제출 #759300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
759300		boyliguanhan	Joker (BOI20_joker)	C++17	14 / 100	2086 ms	14812 KiB

Joker

#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define N 200100
vector<int> adj[N];
int color[N];
int dfs(int x, int col) {
    if(color[x]) {
        if(col==color[x]) return 0;
        else return 1;
    }
    color[x] = col;
    for(auto i: adj[x])
        if(dfs(i, 3-col))
            return 1;
    return 0;
}
int a[N], b[N];
int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, q;
    cin >> n >> m >> q;
    for(int i = 0; i < m; i++)
        cin >> a[i] >> b[i];
    while(q--) {
        int l, r;
        cin >> l >> r;
        memset(color, 0, sizeof color);
        for(int i = 1; i <= n; i++)
            adj[i].clear();
        for(int i = 0; i < l-1; i++)
            adj[a[i]].push_back(b[i]), adj[b[i]].push_back(a[i]);
        for(int i = r; i < m; i++)
            adj[a[i]].push_back(b[i]), adj[b[i]].push_back(a[i]);
        for(int i = 0; i < n; i++) {
            if(!color[i]){
                if(dfs(i, 1)) {
                    cout << "YES\n";
                    break;
                }
            }
            if(i==n-1) cout << "NO\n";
        }
    }
}

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