제출 #1336918

#제출 시각아이디문제언어결과실행 시간메모리
1336918iq500Mi Teleférico (JOI25_ho_t3)C++20
7 / 100
1 ms344 KiB
#include<bits/stdc++.h>
//#define int long long
#define pb push_back
#define fir first
#define sec second
using namespace std;

const int lim=55;

vector<pair<int, int>> g[lim];
int vis[lim];

void dfs(int nd, int l, int r){
    vis[nd]=1;
    for(auto go:g[nd]){
        if(l<=go.sec && go.sec<=r){
            dfs(go.fir, l, r);
        }
    }
    return;
}

signed main(){
    int n, m, p; cin>>n>>m>>p;
    for(int i=0; i<m; i++){
        int a, b, c; cin>>a>>b>>c;
        g[a].pb({b, c});
    }
    int q; cin>>q;
    for(int i=0; i<q; i++){
        int l, r, x; cin>>l>>r>>x;
        memset(vis, 0, sizeof(vis));
        dfs(1, l, r);
        bool ans=true;
        for(int i=1; i<=n; i++) if(vis[i]!=1) ans=false;
        if(ans) cout<<"Yes\n";
        else cout<<"No\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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...