# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070773 | 2024-08-22T18:18:50 Z | Ahmed57 | Toy Train (IOI17_train) | C++17 | 178 ms | 1768 KB |
#include "bits/stdc++.h" using namespace std; vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int> v){ int n = a.size(); int m = u.size(); vector<int> adj[n+1],rev[n+1]; for(int i = 0;i<u.size();i++){ adj[u[i]].push_back(v[i]); rev[v[i]].push_back(u[i]); } vector<int> ans(n,1); int deg[n+1] = {0}; int vis[n+1] = {0}; while(1){ for(int i = 0;i<n;i++){ if(ans[i]){ vis[i] = 0; deg[i] = 0; for(auto j:adj[i]){ if(ans[j])deg[i]++; } } } queue<int> q; for(int i = 0;i<n;i++){ if(ans[i]&&r[i]){ q.push(i); } } while(!q.empty()){ int x = q.front();q.pop(); for(auto i:rev[x]){ deg[i]--; if(ans[i]&&(deg[i]==0||a[i]==1)&&!vis[i]){ vis[i] = 1; q.push(i); } } } bool upd = 0; for(int i = 0;i<n;i++){ int old = ans[i]; ans[i]&=vis[i]; if(old!=ans[i])upd = 1; } if(upd==0)break; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1116 KB | 3rd lines differ - on the 22nd token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | 3rd lines differ - on the 8th token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 59 ms | 1624 KB | Output is correct |
2 | Correct | 105 ms | 1768 KB | Output is correct |
3 | Correct | 154 ms | 1760 KB | Output is correct |
4 | Correct | 6 ms | 1624 KB | Output is correct |
5 | Correct | 10 ms | 1608 KB | Output is correct |
6 | Correct | 8 ms | 1628 KB | Output is correct |
7 | Correct | 5 ms | 1628 KB | Output is correct |
8 | Correct | 6 ms | 1628 KB | Output is correct |
9 | Correct | 4 ms | 1628 KB | Output is correct |
10 | Correct | 6 ms | 1496 KB | Output is correct |
11 | Correct | 6 ms | 1576 KB | Output is correct |
12 | Correct | 5 ms | 1628 KB | Output is correct |
13 | Correct | 6 ms | 1628 KB | Output is correct |
14 | Correct | 6 ms | 1628 KB | Output is correct |
15 | Correct | 6 ms | 1624 KB | Output is correct |
16 | Correct | 6 ms | 1604 KB | Output is correct |
17 | Correct | 6 ms | 1628 KB | Output is correct |
18 | Correct | 178 ms | 1176 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1372 KB | 3rd lines differ - on the 696th token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 1628 KB | Output is correct |
2 | Correct | 6 ms | 1628 KB | Output is correct |
3 | Correct | 6 ms | 1520 KB | Output is correct |
4 | Correct | 5 ms | 1628 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 3 ms | 1112 KB | Output is correct |
7 | Correct | 4 ms | 1116 KB | Output is correct |
8 | Correct | 3 ms | 1116 KB | Output is correct |
9 | Correct | 3 ms | 1116 KB | Output is correct |
10 | Correct | 1 ms | 508 KB | Output is correct |
11 | Correct | 3 ms | 1116 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 1116 KB | 3rd lines differ - on the 22nd token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |