| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1336918 | iq500 | Mi Teleférico (JOI25_ho_t3) | C++20 | 1 ms | 344 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
