oj.uz

Submission #1111521

# Submission time Handle Problem Language Result Execution time Memory
1111521 2024-11-12T09:14:42 Z kxd Drivers (BOI24_drivers) C++17
0 / 100
 2 ms 6480 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.ft.sd;
}

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 << '>' << 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
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Incorrect 1 ms 6480 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6480 KB Output isn't correct
2 Halted 0 ms 0 KB -