Submission #607438

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
607438	2022-07-26T17:27:48 Z	yanndev	Toy Train (IOI17_train)	C++17	0 / 100	85 ms	1440 KB

train

#include <bits/stdc++.h>
using namespace std;

const int MX = 5042;

int n;
int mxScore[MX];
int deg[MX];
bool isAlice[MX];
bool isCharge[MX];
vector<int> rgraph[MX];
vector<int> graph[MX];

int chg(int a, int b, bool isMax) {
    if (isMax)
        return max(a, b);
    return min(a, b);
}

void BFS(int layer) {
    queue<int> nxt {};
    for (int i = 0; i < n; i++) {
        deg[i] = 0;
        if (isCharge[i] && mxScore[i] == layer)
            nxt.push(layer);
    }

    for (int i = 0; i < n; i++)
        if (mxScore[i] == layer)
            for (auto& x: rgraph[i])
                deg[x]++;
    
    while (!nxt.empty()) {
        auto cur = nxt.front();
        nxt.pop();

        for (auto& x: graph[cur])
            mxScore[cur] = chg(mxScore[cur], mxScore[x], isAlice[cur]);
        mxScore[cur] += isCharge[cur];
        
        for (auto& x: rgraph[cur])
            if (--deg[x] == 0)
                nxt.push(x);
    }
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = (int)a.size();

    for (int i = 0; i < (int)u.size(); i++) {
        rgraph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }
    
    for (int i = 0; i < n; i++) {
        isAlice[i] = a[i];
        isCharge[i] = r[i];
    }

    for (int layer = 0; layer <= (int)r.size(); layer++)
        BFS(layer);

    vector<int> ans (n);
    for (int i = 0; i < n; i++)
        ans[i] = mxScore[i] >= (int)r.size() + 1;
    return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	468 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	Correct	60 ms	1440 KB	Output is correct
2	Correct	74 ms	1416 KB	Output is correct
3	Correct	80 ms	1416 KB	Output is correct
4	Incorrect	85 ms	1368 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-