제출 #289904

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289904		someone_aa	Joker (BOI20_joker)	C++17	0 / 100	2084 ms	18192 KiB

Joker

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
const int maxn = 200100;
ll n, m, q;

vector<pii>g[maxn];

bool visited[maxn];
int color[maxn];

bool check(int l, int r) {
	memset(visited, false,sizeof(visited));
	memset(color, 0, sizeof(color));

	bool cycle = false;

	for(int i=1;i<=n;i++) {
		if(!visited[i]) {
			visited[i] = true;
			color[i] = 1;

			queue<int>q;
			q.push(i);

			while(!q.empty()) {
				int curr = q.front();
				q.pop();

				for(auto i:g[curr]) {
					if(l <= i.second && i.second <= r) continue;

					if(!visited[i.first]) {
						visited[i.first] = true;
						color[i.first] = 3 - color[curr];
						q.push(i.first);
					}
					else {
						if(color[i.first] == color[curr]) cycle = true;
					}
				}
			}
		}
	}

	return cycle;
}

int main() {
	cin>>n>>m>>q;

	int u, v;
	for(int i=1;i<=m;i++) {
		cin>>u>>v;
		g[u].pb(mp(v, i));
		g[v].pb(mp(u, i));
	}

	
	int rmost = 1;
	for(ll cekor=m/2;cekor>0;cekor/=2) {
		while(rmost + cekor <= m && check(1, rmost+cekor)) rmost += cekor;
	}

	if(!check(1, 1)) {
		for(int i=0;i<q;i++) {
			cout<<"NO\n";
		}
		return 0;
	}


	int l, r;
	while(q--) {
		cin>>l>>r;

		if(r <= rmost) cout<<"YES\n";
		else cout<<"NO\n";
	}
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 25
• Subtask 4: 0 / 10
• Subtask 5: 0 / 22
• Subtask 6: 0 / 29