# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45301 | 2018-04-12T19:20:36 Z | imaxblue | Tales of seafaring (POI13_mor) | C++17 | 132 ms | 17276 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define mp make_pair #define pb push_back #define x first #define y second #define pii pair<int, int> #define p3i pair<pii, int> #define pll pair<ll, ll> #define p3l pair<pll, ll> #define vi vector<int> #define vpii vector<pii> #define vp3i vector<p3i> #define vpll vector<pll> #define vp3l vector<p3l> #define lseg L, (L+R)/2, N*2+1 #define rseg (L+R)/2+1, R, N*2+2 #define ub upper_bound #define lb lower_bound #define PQ priority_queue #define MN 1000000007 #define fox(k, x) for (int k=0; k<x; ++k) #define fox1(k, x) for (int k=1; k<=x; ++k) #define foxr(k, x) for (int k=x-1; k>=0; --k) #define fox1r(k, x) for (int k=x; k>0; --k) #define ms multiset #define flood(x) memset(x, 0x3f3f3f3f, sizeof x) #define drain(x) memset(x, 0, sizeof x) #define rng() ((rand() << 14)+rand()) #define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0) char _; #define pi 3.14159265358979323846 int d[2][1005][1005]; int n, m, q, x, y, w, N, D; bool T; vector<int> v[1005]; queue<pii> pq; #define top front void dijk(int S){ pq.push(mp(0, S*2)); while(!pq.empty()){ D=pq.top().x; T=pq.top().y%2; N=pq.top().y/2; pq.pop(); if (d[T][S][N]<=D) continue; d[T][S][N]=D; fox(l, v[N].size()){ pq.push(mp(D+1, v[N][l]*2+!T)); } } } int32_t main(){ flood(d); scanf("%i%i%i", &n, &m, &q); fox(l, m){ scanf("%i%i", &x, &y); v[x].pb(y); v[y].pb(x); } fox1(l, n){ dijk(l); } fox(l, q){ scanf("%i%i%i", &x, &y, &w); if (d[w%2][x][y]<=w){ printf("TAK\n"); } else { printf("NIE\n"); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 8184 KB | Output is correct |
2 | Incorrect | 8 ms | 8296 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 8296 KB | Output is correct |
2 | Correct | 8 ms | 8412 KB | Output is correct |
3 | Incorrect | 8 ms | 8580 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 8580 KB | Output is correct |
2 | Correct | 10 ms | 8580 KB | Output is correct |
3 | Correct | 9 ms | 8732 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 8740 KB | Output is correct |
2 | Correct | 10 ms | 8760 KB | Output is correct |
3 | Correct | 65 ms | 8764 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 87 ms | 8952 KB | Output is correct |
2 | Correct | 23 ms | 9076 KB | Output is correct |
3 | Incorrect | 132 ms | 9424 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 18 ms | 17164 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 22 ms | 17212 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 20 ms | 17244 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 18 ms | 17260 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 18 ms | 17276 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |