# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
296816 | 2020-09-10T22:28:12 Z | DanerZein | 장난감 기차 (IOI17_train) | C++14 | 247 ms | 262148 KB |
#include "train.h" #include <bits/stdc++.h> using namespace std; typedef vector<int> vi; vector<vi> G; bitset<5010> ab,cs,cl; int vis[5010]; vi res,path; int n; bool dfs(int u){ vis[u]=1; if(ab[u] and cs[u] and cl[u]){ return res[u]=1; } if(!ab[u] and !cs[u] and cl[u]){ return res[u]=0; } bool ans=0; for(auto &v:G[u]){ ans=dfs(v); } if(G[u].size()==0){ if(ab[u] and !cs[u]){ ans=0; } if(!ab[u] and cs[u]){ ans=1; } } return res[u]=ans; } 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<a.size();i++){ ab[i]=a[i]; cs[i]=r[i]; } G.resize(n+1); res.resize(n); for(int i=0;i<u.size();i++){ int x=u[i],y=v[i]; if(x!=y) G[x].push_back(y); if(x==y) cl[x]=1; } memset(vis,-1,sizeof vis); for(int i=0;i<n;i++){ if(vis[i]==-1){ res[i]=dfs(i); } } return res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 768 KB | Output is correct |
2 | Correct | 4 ms | 768 KB | Output is correct |
3 | Correct | 5 ms | 896 KB | Output is correct |
4 | Correct | 5 ms | 896 KB | Output is correct |
5 | Correct | 4 ms | 896 KB | Output is correct |
6 | Correct | 4 ms | 896 KB | Output is correct |
7 | Correct | 5 ms | 896 KB | Output is correct |
8 | Correct | 4 ms | 896 KB | Output is correct |
9 | Correct | 5 ms | 896 KB | Output is correct |
10 | Correct | 4 ms | 896 KB | Output is correct |
11 | Correct | 4 ms | 768 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 168 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 247 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 177 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 173 ms | 262148 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 768 KB | Output is correct |
2 | Correct | 4 ms | 768 KB | Output is correct |
3 | Correct | 5 ms | 896 KB | Output is correct |
4 | Correct | 5 ms | 896 KB | Output is correct |
5 | Correct | 4 ms | 896 KB | Output is correct |
6 | Correct | 4 ms | 896 KB | Output is correct |
7 | Correct | 5 ms | 896 KB | Output is correct |
8 | Correct | 4 ms | 896 KB | Output is correct |
9 | Correct | 5 ms | 896 KB | Output is correct |
10 | Correct | 4 ms | 896 KB | Output is correct |
11 | Correct | 4 ms | 768 KB | Output is correct |
12 | Runtime error | 168 ms | 262148 KB | Execution killed with signal 9 |
13 | Halted | 0 ms | 0 KB | - |