Submission #747026

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
747026	2023-05-23T12:29:37 Z	danikoynov	Toy Train (IOI17_train)	C++14	0 / 100	1366 ms	1612 KB

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 > g[maxn];
int tf, used[maxn];

void dfs(int v)
{
    used[v] = 1;
    for (int u : g[v])
    {
        if (!used[u])
        {
            dfs(u);

        }
        else
        {
            if (used[u] == 1)
            {
                cycle[v] = 1;
            }
        }
    }
    used[v] = 2;
}
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 ++)
    {
        g[U[i]].push_back(V[i]);
    }

    vector < int > res(n, 0);
    for (int i = 0; i < n; i ++)
    {
        for (int j = 0; j < n; j ++)
            used[j] = 0, cycle[j] = 0;

        dfs(i);
        for (int j = 0; j < n; j ++)
            if (cycle[j] && r[j])
                res[i] = 1;
    }

    return res;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	251 ms	1100 KB	3rd lines differ - on the 1st token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	340 KB	3rd lines differ - on the 8th token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	206 ms	1348 KB	Output is correct
2	Correct	189 ms	1516 KB	Output is correct
3	Correct	212 ms	1612 KB	Output is correct
4	Correct	1366 ms	1448 KB	Output is correct
5	Correct	973 ms	1412 KB	Output is correct
6	Incorrect	642 ms	1336 KB	3rd lines differ - on the 1186th token, expected: '1', found: '0'
7	Halted	0 ms	0 KB	-