oj.uz

Submission #747018

# Submission time Handle Problem Language Result Execution time Memory
747018 2023-05-23T12:08:23 Z danikoynov Toy Train (IOI17_train) C++14
5 / 100
 9 ms 764 KB 
#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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 612 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 3 ms 576 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 612 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 3 ms 576 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Incorrect 0 ms 212 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
13 Halted 0 ms 0 KB -