# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432659 | 2021-06-18T12:12:07 Z | inwbear | Bridges (APIO19_bridges) | C++14 | 153 ms | 488 KB |
#include <bits/stdc++.h> using namespace std; int n,m,pa[1005][3],qq,a,b,c,ans; bool vis[1005]; vector<pair<int,int> >v[1005]; queue<int>q; int main() { //freopen("test.cpp","r",stdin); scanf("%d %d",&n,&m); for(int i=1;i<=m;i++) { scanf("%d %d %d",&pa[i][0],&pa[i][1],&pa[i][2]); } scanf("%d",&qq); while(qq--) { scanf("%d %d %d",&a,&b,&c); if(a==1) { pa[b][2]=c; } else { ans=0; for(int i=1;i<=n;i++)v[i].clear(),vis[i]=false; for(int i=1;i<=m;i++)v[pa[i][0]].push_back({pa[i][1],pa[i][2]}),v[pa[i][1]].push_back({pa[i][0],pa[i][2]}); q.push(b); while(!q.empty()) { ans++; a=q.front(); q.pop(); for(int i=0;i<v[a].size();i++) { if(!vis[v[a][i].first]&&c<=v[a][i].second) { vis[v[a][i].first]=true; q.push(v[a][i].first); } } } printf("%d\n",max(ans-1,1)); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 153 ms | 468 KB | Output is correct |
4 | Correct | 5 ms | 460 KB | Output is correct |
5 | Correct | 18 ms | 460 KB | Output is correct |
6 | Correct | 16 ms | 444 KB | Output is correct |
7 | Correct | 20 ms | 332 KB | Output is correct |
8 | Correct | 18 ms | 460 KB | Output is correct |
9 | Correct | 22 ms | 404 KB | Output is correct |
10 | Correct | 16 ms | 440 KB | Output is correct |
11 | Correct | 16 ms | 480 KB | Output is correct |
12 | Correct | 16 ms | 468 KB | Output is correct |
13 | Correct | 27 ms | 472 KB | Output is correct |
14 | Correct | 23 ms | 460 KB | Output is correct |
15 | Correct | 29 ms | 488 KB | Output is correct |
16 | Correct | 20 ms | 400 KB | Output is correct |
17 | Correct | 19 ms | 404 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 460 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 460 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 460 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 460 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 153 ms | 468 KB | Output is correct |
4 | Correct | 5 ms | 460 KB | Output is correct |
5 | Correct | 18 ms | 460 KB | Output is correct |
6 | Correct | 16 ms | 444 KB | Output is correct |
7 | Correct | 20 ms | 332 KB | Output is correct |
8 | Correct | 18 ms | 460 KB | Output is correct |
9 | Correct | 22 ms | 404 KB | Output is correct |
10 | Correct | 16 ms | 440 KB | Output is correct |
11 | Correct | 16 ms | 480 KB | Output is correct |
12 | Correct | 16 ms | 468 KB | Output is correct |
13 | Correct | 27 ms | 472 KB | Output is correct |
14 | Correct | 23 ms | 460 KB | Output is correct |
15 | Correct | 29 ms | 488 KB | Output is correct |
16 | Correct | 20 ms | 400 KB | Output is correct |
17 | Correct | 19 ms | 404 KB | Output is correct |
18 | Runtime error | 1 ms | 460 KB | Execution killed with signal 11 |
19 | Halted | 0 ms | 0 KB | - |