# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
593893 | 2022-07-11T17:19:14 Z | FatihSolak | Toy Train (IOI17_train) | C++17 | 1435 ms | 1060 KB |
#include "train.h" #include <bits/stdc++.h> #define N 5005 using namespace std; int dp[N]; int ndp[N]; vector<int> adj[N]; vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) { int n = a.size(); int m = u.size(); for(int i = 0;i<m;i++){ adj[u[i]].push_back(v[i]); } for(int i=0;i<4*n;i++){ for(int j = 0;j<n;j++){ if(a[j]){ ndp[j] = -1e18; for(auto u:adj[j]){ ndp[j] = max(ndp[j],dp[u] + r[j]*n - 1); } ndp[j] = min(ndp[j],n); } else{ ndp[j] = 1e18; for(auto u:adj[j]){ ndp[j] = min(ndp[j],dp[u] + r[j]*n - 1); } ndp[j] = min(ndp[j],n); } } for(int j = 0;j<n;j++){ dp[j] = ndp[j]; } } vector<int> res(n); for(int i = 0; i < n; i++){ res[i] = (dp[i] > 0); } return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 619 ms | 772 KB | 3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 0 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 0 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Incorrect | 0 ms | 340 KB | 3rd lines differ - on the 9th token, expected: '0', found: '1' |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 958 ms | 1060 KB | 3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1048 ms | 916 KB | Output is correct |
2 | Correct | 1161 ms | 980 KB | Output is correct |
3 | Correct | 1260 ms | 1044 KB | Output is correct |
4 | Incorrect | 1331 ms | 1024 KB | 3rd lines differ - on the 40th token, expected: '0', found: '1' |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1340 ms | 1040 KB | Output is correct |
2 | Correct | 1334 ms | 1040 KB | Output is correct |
3 | Correct | 1435 ms | 1036 KB | Output is correct |
4 | Correct | 1273 ms | 980 KB | Output is correct |
5 | Correct | 1 ms | 468 KB | Output is correct |
6 | Correct | 601 ms | 768 KB | Output is correct |
7 | Correct | 76 ms | 856 KB | Output is correct |
8 | Correct | 65 ms | 896 KB | Output is correct |
9 | Correct | 68 ms | 852 KB | Output is correct |
10 | Correct | 4 ms | 468 KB | Output is correct |
11 | Correct | 99 ms | 724 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 619 ms | 772 KB | 3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |