Submission #1114620

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114620		awwads	Drivers (BOI24_drivers)	C++14	0 / 100	2077 ms	6876 KiB

Main

#include <bits/stdc++.h>
using namespace std;
bool connected(int a, int b, vector<vector<int>>graph){
    queue<int> todoset;
    set<int> doneset;
    todoset.push(a);
    while(!todoset.empty()){
        int i=todoset.front();
        todoset.pop();
        doneset.insert(i);
        for(int j: graph[i]){
            if (j==b){
                return true;
            }
            else if (doneset.count(j)==0){
                todoset.push(j);
            }
        }
    }
    return false;
}
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(connected(a[i],b[i],map)){
            cout<<"TAIP\n";
        }
        else{
            cout<<"NE\n";
        }
    }
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 23
• Subtask 5: 0 / 45