# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013766 | Almonther | Tales of seafaring (POI13_mor) | C++98 | 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>
#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
short n,m,k;
short dist[5001][5001][2];
vector<short>v[5001];
void bfs(short x){
queue<pair<short,short>>q;
q.push({x,0});
while(q.size()){
auto inp=q.front();
q.pop();
short a,b;
a=inp.first;
b=inp.second;
if(dist[x][a][b%2]!=-1) continue;
dist[x][a][b%2]=b;
for(auto i:v[a]){
q.push({i,b+1});
}
}
}
void solve(){
memset(dist,-1,sizeof(dist));
cin>>n>>m>>k;
for(int i=0;i<m;i++){
short a,b;
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;i++){
bfs(i);
}
while(k--){
short a,b,
int c;
cin>>a>>b>>c;
if(dist[a][b][c%2]!=-1&&dist[a][b][c%2]<=c) co "TAK\n";
else co "NIE\n";
}
}
int main()
{
suiii
int tt=1;
// cin>>tt;
while(tt--){
solve();
}
return 0;
}