oj.uz

답안 #978980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978980 2024-05-10T05:20:44 Z Halym2007 다리 (APIO19_bridges) C++17
13 / 100
 3000 ms 10116 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
#define sz size()
const int N = 5e4 + 5;

pii val[N];
int l[N], r[N], w[N], vis[N];
vector <pii> v[N];
void dfs (int x, int y) {
	vis[x] = 1;
	for (pii i : v[x]) {
		if (vis[i.ff]) continue;
		if (y <= i.ss) dfs (i.ff, y);
	}
}

int main () {
//	freopen ("input.txt", "r", stdin);
	int n, m, q;
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		cin >> l[i] >> r[i] >> w[i];
		val[i] = {(int)v[l[i]].sz, (int)v[r[i]].sz};
		v[l[i]].pb({r[i], w[i]});
		v[r[i]].pb({l[i], w[i]});
	}
	cin >> q;
	while ( q-- ) {
		int query, x, y;
		cin >> query >> x >> y;
//		cout << "--> " << query << " " << x << " " << y << "\n";
		if (query == 1) {
			pii pos = val[x];
			v[l[x]][pos.ff].ss = y;
			v[r[x]][pos.ss].ss = y;
		}
		else {
			dfs (x, y);
			int jog = 0;
			for (int i = 1; i <= n; ++i) {
				if (vis[i]) jog++;
				vis[i] = 0;
			}
			cout << jog << "\n";
		}
	}
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 50 ms 2876 KB Output is correct
4 Correct 17 ms 2652 KB Output is correct
5 Correct 14 ms 2820 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 13 ms 2652 KB Output is correct
8 Correct 14 ms 2836 KB Output is correct
9 Correct 12 ms 2652 KB Output is correct
10 Correct 17 ms 2720 KB Output is correct
11 Correct 13 ms 2808 KB Output is correct
12 Correct 13 ms 2652 KB Output is correct
13 Correct 15 ms 2652 KB Output is correct
14 Correct 14 ms 2652 KB Output is correct
15 Correct 15 ms 2652 KB Output is correct
16 Correct 12 ms 2652 KB Output is correct
17 Correct 12 ms 2752 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1481 ms 9116 KB Output is correct
2 Correct 1458 ms 9424 KB Output is correct
3 Correct 1524 ms 9544 KB Output is correct
4 Correct 1539 ms 9568 KB Output is correct
5 Correct 1619 ms 9556 KB Output is correct
6 Execution timed out 3050 ms 8472 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1471 ms 6360 KB Output is correct
2 Correct 1638 ms 4664 KB Output is correct
3 Execution timed out 3052 ms 5676 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 41 ms 10116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1481 ms 9116 KB Output is correct
2 Correct 1458 ms 9424 KB Output is correct
3 Correct 1524 ms 9544 KB Output is correct
4 Correct 1539 ms 9568 KB Output is correct
5 Correct 1619 ms 9556 KB Output is correct
6 Execution timed out 3050 ms 8472 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 50 ms 2876 KB Output is correct
4 Correct 17 ms 2652 KB Output is correct
5 Correct 14 ms 2820 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 13 ms 2652 KB Output is correct
8 Correct 14 ms 2836 KB Output is correct
9 Correct 12 ms 2652 KB Output is correct
10 Correct 17 ms 2720 KB Output is correct
11 Correct 13 ms 2808 KB Output is correct
12 Correct 13 ms 2652 KB Output is correct
13 Correct 15 ms 2652 KB Output is correct
14 Correct 14 ms 2652 KB Output is correct
15 Correct 15 ms 2652 KB Output is correct
16 Correct 12 ms 2652 KB Output is correct
17 Correct 12 ms 2752 KB Output is correct
18 Correct 1481 ms 9116 KB Output is correct
19 Correct 1458 ms 9424 KB Output is correct
20 Correct 1524 ms 9544 KB Output is correct
21 Correct 1539 ms 9568 KB Output is correct
22 Correct 1619 ms 9556 KB Output is correct
23 Execution timed out 3050 ms 8472 KB Time limit exceeded
24 Halted 0 ms 0 KB -