Submission #1111535

#TimeUsernameProblemLanguageResultExecution timeMemory
1111535awwadsDrivers (BOI24_drivers)C++14
0 / 100
1 ms504 KiB
#include <bits/stdc++.h> using namespace std; int arr[200001]; int bfs(int a, int b, int N, vector<vector<int>>map){ arr[a]=1; for (int i:map[a]){ if (i==b){ return 1; } if (arr[i]!=1){ cout<<i<<b<<"\n"; return bfs(i,b,N,map); } } return 0; } int main() { int N,M,U; cin>>N>>M>>U; int x[M], y[M], t[M]; for(int i=0; i<M; i++){ cin>>x[i]>>y[i]>>t[i]; } int a[U], b[U], p[U]; for (int i=0; i<U; i++){ cin>>a[i]>>b[i]>>p[i]; } for (int i=0; i<U; i++){ vector<vector<int>>map; vector<int>empty; for (int j=0; j<=N; j++){ map.push_back(empty); } for (int j=0; j<M; j++){ if (t[j]<=p[i]){ map[x[j]].push_back(y[j]); map[y[j]].push_back(x[j]); } } if(bfs(a[i],b[i],N,map)==1){ cout<<"TAIP\n"; } else{ cout<<"NE\n"; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...