Discussion @ 1711. Code Names @ Timus Online Judge

Anton Smoliakov Got AC with one attemt :) // Problem 1711. Code Names 4 Mar 2022 12:02

FBI WA #2 [1] // Problem 1711. Code Names 11 Dec 2013 15:52

Baurzhan if WA28 [3] // Problem 1711. Code Names 10 Oct 2009 16:36

Mikhail accepted // Problem 1711. Code Names 13 May 2018 17:45

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

const int maxn = 20;
int n;
string s[20][3];
int p[maxn];
vector <string> ans;
bool was[maxn][3];

bool f (int pos, int last = -1) {
    if (pos == n) re true;
    if (pos && was[pos][last]) re false;
    if (pos) was[pos][last] = true;
    if (pos) {
        fo(i, 3) {
            if (s[p[pos - 1]][last] < s[p[pos]][i] && f(pos + 1, i)) {
                ans.pb(s[p[pos]][i]);
                re true;
            }
        }
    } else {
        fo(i, 3) {
            if (f(pos + 1, i)) {
                ans.pb(s[p[pos]][i]);
                re true;
            }
        }
    }
    re false;
}

int main() {
    cin >> n;
    fo(i, n) fo(j, 3) cin >> s[i][j];
    fo(i, n) cin >> p[i], p[i]--;
    if (f(0)) {
        reverse(all(ans));
        for (string &s : ans) cout << s << '\n';
    } else cout << "IMPOSSIBLE\n";
    re 0;
}

igorsky WA #25 [3] // Problem 1711. Code Names 12 Oct 2009 16:58

Vasilenko Oleg Sergeevich, Chelyabinsk Переход с компилятора Intel C++ 7 на компиляторы G++ 4.7.2 и Visual C++ 2010 // Problem 1711. Code Names 13 Oct 2013 18:19

Hikmat Ahmedov Be aware of TEST 3 in JAVA // Problem 1711. Code Names 6 Mar 2013 11:06

Pegasus Help! wa#20 // Problem 1711. Code Names 26 Sep 2012 06:09

Xarkev WA #20 [1] // Problem 1711. Code Names 30 Jan 2011 00:17

isolver test 30 // Problem 1711. Code Names 4 May 2012 18:15

Jumabek_Alihonov WA7 anybody help me!!! There's my solution // Problem 1711. Code Names 19 Apr 2012 16:59

#include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
int b[26],n,i,j;bool t=true;
string a[26][3],str,s[26];
cin>>n;
for(i=0;i<n;i++)
                {
                cin>>a[i][0];
                cin>>a[i][1];
                cin>>a[i][2];
                if(a[i][1]>a[i][2])
                                   {
                                   str=a[i][1];
                                   a[i][1]=a[i][2];
                                   a[i][2]=str;
                                   }

                if(a[i][0]>a[i][1])
                                   {
                                   str=a[i][0];
                                   a[i][0]=a[i][1];
                                   a[i][1]=str;
                                   }

                }
   /*
for(i=0;i<n;i++)
{for(j=0;j<3;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}   */
    for(i=0;i<n;i++)
                    {
                    cin>>b[i];
                    if(i==0)
                    s[i]=a[b[i]-1][0];
                    else{j=0;
                         while(a[b[i]-1][j]<=s[i-1]&&j<3)
                                       {

                                       j++;}
                         if(a[b[i]-1][j]>s[b[i]-1])
                         s[i]=a[b[i]-1][j];
                         else t=false;
                         }

                    }
                 if(t)
    for(i=0;i<n;i++)
    cout<<s[i]<<endl;
    else cout<<"IMPOSSIBLE";

system("pause");
}

Poochi Rang Why is this solution for testCase 1 incorrect [1] // Problem 1711. Code Names 14 Dec 2011 16:09

hatred WA28 [1] // Problem 1711. Code Names 7 Aug 2011 20:47

killerDJO If WA 25 [2] // Problem 1711. Code Names 11 Jul 2011 20:53

ZZmiy Test 7 // Problem 1711. Code Names 30 Jun 2011 18:07

Khamitbekov Madi WA #25, I'm sure that my program works! [2] // Problem 1711. Code Names 11 Jun 2011 19:54

Andrex WA9 // Problem 1711. Code Names 28 Oct 2010 18:22

Pavel Kovalenko #1 Test [5] // Problem 1711. Code Names 10 Oct 2009 15:13

→MOPDOBOPOT← 1 TEST // Problem 1711. Code Names 20 Mar 2010 00:07

Allumium the first test in description is incorrect [3] // Problem 1711. Code Names 10 Oct 2009 14:02

Discussion of Problem 1711. Code Names