# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673736 | 2022-12-21T21:33:45 Z | meoww | Traffic (CEOI11_tra) | C++14 | 56 ms | 1236 KB |
#include "bits/stdc++.h" using namespace std; const int N=7000; int n,m,a,b,cnt; bool vis[N]; pair<int,int> jun[N]; vector<int> v[N]; void dfs(int i) { vis[i]=true; if (jun[i].first==a) cnt++; for (int j:v[i]) { if (!vis[j]) dfs(j); } } signed main() { cin>>n>>m>>a>>b; for (int i=1;i<=n;i++) { cin>>jun[i].first>>jun[i].second; } for (int i=0;i<m;i++) { int c,d,e; cin>>c>>d>>e; v[c].push_back(d); if (e==2) v[d].push_back(c); } vector<pair<int,int> > wst; for (int i=1;i<=n;i++) { if (jun[i].first==0) wst.push_back({jun[i].second,i}); } sort(wst.rbegin(),wst.rend()); vector<int> ans; for (int i=0;i<wst.size();i++) { cnt=0; for (int j=1;j<=n;j++) vis[j]=false; dfs(wst[i].second); ans.push_back(cnt); } for (int i:ans) cout<<i<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 468 KB | Output is correct |
3 | Correct | 0 ms | 468 KB | Output is correct |
4 | Correct | 1 ms | 468 KB | Output is correct |
5 | Correct | 1 ms | 468 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 468 KB | Output is correct |
2 | Correct | 1 ms | 468 KB | Output is correct |
3 | Correct | 1 ms | 468 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 468 KB | Output is correct |
2 | Correct | 2 ms | 468 KB | Output is correct |
3 | Correct | 2 ms | 476 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 484 KB | Output is correct |
2 | Correct | 56 ms | 812 KB | Output is correct |
3 | Correct | 7 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 1004 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 1108 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 1236 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 1132 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 1108 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 1128 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 1236 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 1236 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |