제출 #1158900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158900		Zbyszek99	Joker (BOI20_joker)	C++20	6 / 100	17 ms	2496 KiB

Joker

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

vi graph[201];
vector<pii> edges;
int odw[201];

bool is;

void dfs(int v, int c)
{
    odw[v] = c;
    forall(it,graph[v])
    {
        if(odw[it] == -1) dfs(it,c^1);
        else
        {
            if(odw[it] == c) is = 0;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,m,q;
    cin >> n >> m >> q;
    rep(i,m)
    {
        int a,b;
        cin >> a >> b;
        edges.pb({a,b});
    }
    rep(qq,q)
    {
        int l,r;
        cin >> l >> r;
        l--;
        r--;
        rep2(i,1,n)
        {
            graph[i] = {};
            odw[i] = -1;
        }
        rep2(i,0,l-1)
        {
            graph[edges[i].ff].pb(edges[i].ss);
            graph[edges[i].ss].pb(edges[i].ff);
        }
        rep2(i,r+1,m-1)
        {
            graph[edges[i].ff].pb(edges[i].ss);
            graph[edges[i].ss].pb(edges[i].ff);
        }
        is=1;
        rep2(i,1,n)
        {
            if(odw[i]== -1) dfs(i,0);
        }
        if(is) cout << "NO\n";
        else cout << "YES\n";
    }
}

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