# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
775998 | 2023-07-07T08:14:18 Z | PoonYaPat | 장난감 기차 (IOI17_train) | C++14 | 1723 ms | 1604 KB |
#include "train.h" #include <bits/stdc++.h> using namespace std; int n; bool c[5005],charge[5005],vis[5005]; vector<int> adj[5005],radj[5005],ans; void dfs(int x) { for (auto s : adj[x]) { if (!vis[s] && !charge[s]) { vis[s]=true; dfs(s); } } } void rdfs(int x) { vis[x]=true; ans[x]=0; for (auto s : radj[x]) { if (!vis[s]) { rdfs(s); } } } std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) { n=a.size(); for (int i=0; i<n; ++i) charge[i]=r[i], c[i]=a[i], ans.push_back(1); for (int i=0; i<u.size(); ++i) { adj[u[i]].push_back(v[i]); radj[v[i]].push_back(u[i]); } for (int i=0; i<n; ++i) { if (charge[i]) continue; memset(vis,0,sizeof(vis)); dfs(i); if (!vis[i]) continue; memset(vis,0,sizeof(vis)); rdfs(i); } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 1236 KB | 3rd lines differ - on the 14th token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 468 KB | 3rd lines differ - on the 2nd token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 126 ms | 1604 KB | Output is correct |
2 | Correct | 141 ms | 1564 KB | Output is correct |
3 | Correct | 140 ms | 1552 KB | Output is correct |
4 | Incorrect | 1152 ms | 1456 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 1236 KB | Output is correct |
2 | Correct | 87 ms | 1268 KB | Output is correct |
3 | Correct | 141 ms | 1356 KB | Output is correct |
4 | Correct | 99 ms | 1364 KB | Output is correct |
5 | Correct | 272 ms | 1376 KB | Output is correct |
6 | Correct | 198 ms | 1368 KB | Output is correct |
7 | Correct | 207 ms | 1348 KB | Output is correct |
8 | Correct | 88 ms | 1320 KB | Output is correct |
9 | Correct | 5 ms | 1236 KB | Output is correct |
10 | Correct | 7 ms | 1380 KB | Output is correct |
11 | Correct | 6 ms | 1364 KB | Output is correct |
12 | Correct | 6 ms | 1400 KB | Output is correct |
13 | Correct | 617 ms | 1420 KB | Output is correct |
14 | Correct | 288 ms | 1324 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1723 ms | 1492 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 1236 KB | 3rd lines differ - on the 14th token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |