oj.uz

Submission #335142

# Submission time Handle Problem Language Result Execution time Memory
335142 2020-12-11T08:35:02 Z nicholask Bridges (APIO19_bridges) C++14
13 / 100
 3000 ms 6712 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	tuple <int,int,int> g[m];
	for (int i=0; i<m; i++) cin>>get<0>(g[i])>>get<1>(g[i])>>get<2>(g[i]);
	int q;
	cin>>q;
	while (q--){
		int t,x,y;
		cin>>t>>x>>y;
		if (t==1) get<2>(g[x-1])=y;
		else {
			vector <int> v[n+1];
			for (int i=0; i<m; i++){
				if (get<2>(g[i])<y) continue;
				v[get<0>(g[i])].push_back(get<1>(g[i]));
				v[get<1>(g[i])].push_back(get<0>(g[i]));
			}
			bool visited[n+1]={};
			queue <int> q;
			q.push(x);
			visited[x]=1;
			while (!q.empty()){
				int f=q.front();
				q.pop();
				for (auto&i:v[f]){
					if (visited[i]) continue;
					q.push(i);
					visited[i]=1;
				}
			}
			int cnt=0;
			for (int i=1; i<=n; i++){
				if (visited[i]) cnt++;
			}
			cout<<cnt<<endl;
		}
	}
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 181 ms 620 KB Output is correct
4 Correct 33 ms 492 KB Output is correct
5 Correct 36 ms 492 KB Output is correct
6 Correct 37 ms 492 KB Output is correct
7 Correct 48 ms 364 KB Output is correct
8 Correct 44 ms 492 KB Output is correct
9 Correct 65 ms 492 KB Output is correct
10 Correct 45 ms 492 KB Output is correct
11 Correct 44 ms 492 KB Output is correct
12 Correct 48 ms 492 KB Output is correct
13 Correct 60 ms 620 KB Output is correct
14 Correct 56 ms 492 KB Output is correct
15 Correct 64 ms 512 KB Output is correct
16 Correct 52 ms 364 KB Output is correct
17 Correct 51 ms 364 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3071 ms 4972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3055 ms 3436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3045 ms 6712 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3071 ms 4972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 181 ms 620 KB Output is correct
4 Correct 33 ms 492 KB Output is correct
5 Correct 36 ms 492 KB Output is correct
6 Correct 37 ms 492 KB Output is correct
7 Correct 48 ms 364 KB Output is correct
8 Correct 44 ms 492 KB Output is correct
9 Correct 65 ms 492 KB Output is correct
10 Correct 45 ms 492 KB Output is correct
11 Correct 44 ms 492 KB Output is correct
12 Correct 48 ms 492 KB Output is correct
13 Correct 60 ms 620 KB Output is correct
14 Correct 56 ms 492 KB Output is correct
15 Correct 64 ms 512 KB Output is correct
16 Correct 52 ms 364 KB Output is correct
17 Correct 51 ms 364 KB Output is correct
18 Execution timed out 3071 ms 4972 KB Time limit exceeded
19 Halted 0 ms 0 KB -