Submission #747018

#	Time	Username	Problem	Language	Result	Execution time	Memory
747018		danikoynov	Toy Train (IOI17_train)	C++14	5 / 100	9 ms	764 KiB

train

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 5010;
int n, m, a[maxn], r[maxn], cycle[maxn], nxt[maxn];
vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V)
{
    n = A.size();
    m = U.size();
    for (int i = 0; i < n; i ++)
        a[i] = A[i];
    for (int i = 0; i < n; i ++)
        r[i] = R[i];

    for (int i = 0; i < m; i ++)
    {
        if (U[i] == V[i])
        {
            cycle[U[i]] = 1;
            ///cout << "HERE" << endl;
        }
        else
        {
            nxt[U[i]] = 1;
        }
    }

    vector < int > res(n, 0);
    for (int i = 0; i < n; i ++)
    {
        int j = i;
        while(true)
        {
            ///cout << i << " : " << j << endl;
            if (cycle[j])
            {
                //cout << "here" << endl;
                if (a[j] == 1)
                {
                    if (r[j])
                    {
                        res[i] = 1;
                        break;
                    }
                }
                else
                {
                    if (!r[j])
                    {
                        res[i] = 0;
                        break;
                    }
                }
            }

            if (nxt[j])
            {
                j ++;
            }
            else
            {
                if (a[j] == 0)
                res[i] = 1;
                break;
            }
        }
    }

    return res;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51