oj.uz

답안 #1111527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111527 2024-11-12T09:18:46 Z kxd Drivers (BOI24_drivers) C++17
100 / 100
 135 ms 18784 KB 
#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb emplace_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

int a[N];
pair<int,pii> e[N];
pair<pii,pii> q[N];
int ans[N];

int p[N];

int getp(int x) {
	if(x!=p[x]) p[x] = getp(p[x]);
	return p[x];
}

void merge(int x, int y) {
	p[getp(x)]=getp(y);
}

bool cmp(pair<pii,pii> a, pair<pii,pii> b) {
	return a.sd.ft < b.sd.ft;
}

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n, m, u;
	cin >> n >> m >> u;
	forn(i,m) {
		cin >> e[i].sd.ft >> e[i].sd.sd >> e[i].ft;
	}
	sort(e,e+m);
	forn(i,u) {
		cin >> q[i].ft.ft >> q[i].ft.sd >> q[i].sd.ft;
		q[i].sd.sd = i;
	}
	sort(q,q+u,cmp);
	forn1(i,n) p[i]=i;
	int upto = 0;
	int j = 0;
	forn(i,u) {
		upto = q[i].sd.ft;
		while(j<m && e[j].ft <= upto) {
			merge(e[j].sd.ft, e[j].sd.sd);
			j++;
		}
		if(getp(q[i].ft.ft)==getp(q[i].ft.sd)) ans[q[i].sd.sd] = 1;
		//cout << '>' << q[i].ft.ft << ' ' << q[i].ft.sd << '|'
		//<< getp(q[i].ft.ft) << " " << getp(q[i].ft.sd) << '|' << ans[q[i].sd.sd] << endl;
	}
	forn(i,u) {
		if(ans[i]) cout << "TAIP" << endl;
		else cout << "NE" << endl;
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 63 ms 13840 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6648 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 1 ms 6480 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 2 ms 6628 KB Output is correct
6 Correct 2 ms 6480 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6480 KB Output is correct
11 Correct 2 ms 6480 KB Output is correct
12 Correct 3 ms 6696 KB Output is correct
13 Correct 2 ms 4616 KB Output is correct
14 Correct 4 ms 6708 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 2 ms 6480 KB Output is correct
17 Correct 2 ms 6480 KB Output is correct
18 Correct 2 ms 6480 KB Output is correct
19 Correct 7 ms 6736 KB Output is correct
20 Correct 1 ms 6652 KB Output is correct
21 Correct 2 ms 6480 KB Output is correct
22 Correct 2 ms 6480 KB Output is correct
23 Correct 2 ms 6480 KB Output is correct
24 Correct 8 ms 6480 KB Output is correct
25 Correct 2 ms 6480 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 63 ms 13840 KB Output is correct
6 Correct 2 ms 6648 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 3 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 3 ms 6480 KB Output is correct
11 Correct 3 ms 6736 KB Output is correct
12 Correct 1 ms 6480 KB Output is correct
13 Correct 1 ms 6480 KB Output is correct
14 Correct 1 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 63 ms 13840 KB Output is correct
6 Correct 1 ms 6648 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6628 KB Output is correct
11 Correct 2 ms 6480 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 2 ms 6480 KB Output is correct
16 Correct 2 ms 6480 KB Output is correct
17 Correct 3 ms 6696 KB Output is correct
18 Correct 2 ms 4616 KB Output is correct
19 Correct 4 ms 6708 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 2 ms 6480 KB Output is correct
22 Correct 2 ms 6480 KB Output is correct
23 Correct 2 ms 6480 KB Output is correct
24 Correct 7 ms 6736 KB Output is correct
25 Correct 1 ms 6652 KB Output is correct
26 Correct 2 ms 6480 KB Output is correct
27 Correct 2 ms 6480 KB Output is correct
28 Correct 2 ms 6480 KB Output is correct
29 Correct 8 ms 6480 KB Output is correct
30 Correct 2 ms 6480 KB Output is correct
31 Correct 2 ms 6648 KB Output is correct
32 Correct 2 ms 6480 KB Output is correct
33 Correct 3 ms 6480 KB Output is correct
34 Correct 2 ms 6480 KB Output is correct
35 Correct 3 ms 6480 KB Output is correct
36 Correct 3 ms 6736 KB Output is correct
37 Correct 1 ms 6480 KB Output is correct
38 Correct 1 ms 6480 KB Output is correct
39 Correct 1 ms 6480 KB Output is correct
40 Correct 1 ms 6480 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 2 ms 6480 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 6480 KB Output is correct
5 Correct 63 ms 13840 KB Output is correct
6 Correct 1 ms 6648 KB Output is correct
7 Correct 2 ms 6480 KB Output is correct
8 Correct 1 ms 6480 KB Output is correct
9 Correct 2 ms 6480 KB Output is correct
10 Correct 2 ms 6628 KB Output is correct
11 Correct 2 ms 6480 KB Output is correct
12 Correct 2 ms 6480 KB Output is correct
13 Correct 2 ms 6480 KB Output is correct
14 Correct 2 ms 6480 KB Output is correct
15 Correct 2 ms 6480 KB Output is correct
16 Correct 2 ms 6480 KB Output is correct
17 Correct 3 ms 6696 KB Output is correct
18 Correct 2 ms 4616 KB Output is correct
19 Correct 4 ms 6708 KB Output is correct
20 Correct 1 ms 6480 KB Output is correct
21 Correct 2 ms 6480 KB Output is correct
22 Correct 2 ms 6480 KB Output is correct
23 Correct 2 ms 6480 KB Output is correct
24 Correct 7 ms 6736 KB Output is correct
25 Correct 1 ms 6652 KB Output is correct
26 Correct 2 ms 6480 KB Output is correct
27 Correct 2 ms 6480 KB Output is correct
28 Correct 2 ms 6480 KB Output is correct
29 Correct 8 ms 6480 KB Output is correct
30 Correct 2 ms 6480 KB Output is correct
31 Correct 2 ms 6648 KB Output is correct
32 Correct 2 ms 6480 KB Output is correct
33 Correct 3 ms 6480 KB Output is correct
34 Correct 2 ms 6480 KB Output is correct
35 Correct 3 ms 6480 KB Output is correct
36 Correct 3 ms 6736 KB Output is correct
37 Correct 1 ms 6480 KB Output is correct
38 Correct 1 ms 6480 KB Output is correct
39 Correct 1 ms 6480 KB Output is correct
40 Correct 1 ms 6480 KB Output is correct
41 Correct 135 ms 18784 KB Output is correct
42 Correct 9 ms 6736 KB Output is correct
43 Correct 7 ms 6480 KB Output is correct
44 Correct 13 ms 9244 KB Output is correct
45 Correct 11 ms 6992 KB Output is correct
46 Correct 8 ms 6992 KB Output is correct
47 Correct 93 ms 17656 KB Output is correct
48 Correct 10 ms 6992 KB Output is correct
49 Correct 95 ms 18760 KB Output is correct