# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515889 | 2022-01-20T04:58:42 Z | ac2hu | Tales of seafaring (POI13_mor) | C++14 | 1494 ms | 131076 KB |
#include <bits/stdc++.h> using namespace std; void setIO(string name) { #ifdef DEBUG #else ios_base::sync_with_stdio(0); cin.tie(0); freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout); #endif } signed main(){ iostream::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); int n,m,k;cin >> n >> m >> k; vector<int> adj[n]; for(int i = 0;i<m;i++){ int a,b;cin >> a >> b; a--;b--; adj[a].push_back(b); adj[b].push_back(a); } int dist[n][n][2]; for(int i = 0;i<n;i++){ for(int j= 0;j<n;j++){ for(int f = 0;f<2;f++) dist[i][j][f] = 1e9 + 10; } } for(int i = 0;i<n;i++){ queue<pair<int,int>> q; dist[i][i][0] = 0; q.push({i,0}); while(!q.empty()){ pair<int,int> x = q.front(); q.pop(); for(auto e : adj[x.first]){ if(dist[i][e][(x.second + 1)%2] > dist[i][x.first][x.second] + 1){ dist[i][e][(x.second + 1)%2] = dist[i][x.first][x.second] + 1; q.push({e,(x.second + 1)%2}); } } } } // for(int i = 0;i<n;i++){ // for(int j =0 ;j<n;j++) // cout << dist[i][j] << " "; // cout << "\n"; // } for(int _ = 0;_<k;_++){ int a,b,d;cin >> a >> b >> d; a--;b--; if(dist[a][b][d%2] > d) cout << "NIE\n"; else { cout << "TAK\n"; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 0 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 312 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 324 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 1584 KB | Output is correct |
2 | Correct | 2 ms | 624 KB | Output is correct |
3 | Correct | 17 ms | 2252 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 3284 KB | Output is correct |
2 | Correct | 41 ms | 5504 KB | Output is correct |
3 | Incorrect | 50 ms | 5480 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 136 ms | 18240 KB | Output is correct |
2 | Correct | 10 ms | 4816 KB | Output is correct |
3 | Incorrect | 283 ms | 31876 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 706 ms | 35972 KB | Output is correct |
2 | Correct | 34 ms | 31772 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1494 ms | 129984 KB | Output is correct |
2 | Correct | 131 ms | 34820 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 67 ms | 131076 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 76 ms | 131076 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |