| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 380784 | evn | Tales of seafaring (POI13_mor) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int n, m, k;
short dp[5005][5005][2];
vector<int> adj[5005];
bool vis[5005][2];
queue<pii> q;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> k;
for(int i = 0; i < m;i ++){
int a, b;
cin >> a >> b;
a--; b--;
adj[a].pb(b);
adj[b].pb(a);
}
for(int i = 0; i < n;i ++){
for(int j = 0;j < n;j ++){
dp[i][j][0] = 5001;
dp[i][j][1] = 5001;
}
}
for(int i = 0;i < n; i++){
//launch a bfs from node i
memset(vis, false, sizeof(vis));
vis[i][0] = true;
q.push({i,0});
dp[i][i][0] = 0;
while(!q.empty()){
pii c = q.front(); q.pop();
if(c.s != dp[i][c.f][c.s%2])continue;
vis[c.f][c.s%2] = true;
for(int u : adj[c.f]){
int pa = c.s%2;
if(!vis[u][(pa+1)%2]){
dp[i][u][(pa+1)%2] = min(dp[i][u][(pa+1)%2],c.s+1);
q.push({u, (c.s+1)});
}
}
}
}
for(int i = 0; i < k;i ++){
int a, b, d;
cin >> a >> b >> d;
a--; b--;
bool works = false;
if(dp[a][b][d%2] <= d && dp[a][b][d%2] != 5001)works = true;
cout << (works ? "TAK":"NIE") << '\n';
}
}