# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1045593 | 2024-08-06T06:05:53 Z | pcc | 장난감 기차 (IOI17_train) | C++17 | 592 ms | 4504 KB |
#include "train.h" #include <bits/stdc++.h> using namespace std; const int mxn = 5050; vector<int> charge; int N,M; queue<int> q; int owner[mxn]; bitset<mxn> reach[mxn],dist; vector<int> paths[mxn]; bitset<mxn> ban; void BFS(int s = -1){ if(s != -1){ dist.reset(); q.push(s); } while(!q.empty()){ auto now = q.front(); q.pop(); for(auto nxt:paths[now]){ if(!dist[nxt]&&!ban[nxt]){ dist[nxt] = 1; q.push(nxt); } } } return; } 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++){ owner[i] = a[i]; if(r[i]){ charge.push_back(i); ban[i] = true; } } for(int i = 0;i<u.size();i++){ int aa = u[i],bb = v[i]; paths[aa].push_back(bb); } for(int i = 0;i<N;i++){ BFS(i); reach[i] = dist; } vector<int> ans(N,1); for(int i = 0;i<N;i++){ for(int j = 0;j<N;j++){ if(!ban[j]&&reach[i][j]&&reach[j][j])ans[i] = 0; } } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 3932 KB | 3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | 3rd lines differ - on the 2nd token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 100 ms | 4180 KB | Output is correct |
2 | Correct | 54 ms | 4504 KB | Output is correct |
3 | Correct | 34 ms | 4440 KB | Output is correct |
4 | Incorrect | 592 ms | 4260 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 30 ms | 3964 KB | 3rd lines differ - on the 696th token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 556 ms | 4180 KB | 3rd lines differ - on the 1st token, expected: '1', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 3932 KB | 3rd lines differ - on the 1st token, expected: '0', found: '1' |
2 | Halted | 0 ms | 0 KB | - |