Submission #1091411

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091411		andrei_iorgulescu	Joker (BOI20_joker)	C++14	0 / 100	2078 ms	8264 KiB

Joker

#include <bits/stdc++.h>

using namespace std;

int n, m, q;
int u[200005], v[200005];
int rmin[200005];

pair<int, int> t[200005];
bool bad = false;

pair<int, int> par(int x)
{
    int s1 = 0;
    while (t[x].first != x)
    {
        s1 += t[x].second;
        x = t[x].first;
    }
    return make_pair(x, s1);
}

void join(int x, int y)
{
    pair<int,int> p1 = par(x);
    pair<int,int> p2 = par(y);
    if (p1.first != p2.first)
    {
        t[p2.first] = make_pair(p1.first, (1 + p1.second + p2.second));
    }
    else
    {
        if (p1.second % 2 == p2.second % 2)
        {
            bad = true;
        }
    }
}

/*
4 4 1
2 3
2 1
1 3
3 1
1 4
*/

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++)
        cin >> u[i] >> v[i];
    for (int i = 1; i <= n; i++)
        t[i] = {i, 0};
    rmin[1] = 1;
    for (int i = m; i >= 1; i--)
    {
        join(u[i], v[i]);
        if (bad)
        {
            rmin[1] = i;
            break;
        }
    }
    //cout << rmin[1] << endl;
    for (int i = 1; i <= q; i++)
    {
        int x, y;
        cin >> x >> y;
        if (y < rmin[x])
            cout << "YES\n";
        else
            cout << "NO\n";
    }
    return 0;
}

///wtfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff

/**
deci teoretic daca bag elementele de la 1 la N, apoi fac two pointers-ul, o sa cam am queue-like undoing pe DSU, pe care tin si ceva de bipartit
**/

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