oj.uz

답안 #1091402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091402 2024-09-20T19:05:29 Z andrei_iorgulescu Joker (BOI20_joker) C++14
0 / 100
 2000 ms 17736 KB 
#include <bits/stdc++.h>

using namespace std;

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

pair<int, int> t[200005];
vector<int> g[200005];
int cnt_bad = 0;

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 % 2);
}

bool viz[200005];

int kk, kkk;

void dfss(int x, int y)
{
    viz[x] = true;
    if (x == y)
        kkk = kk;
    else
    {
        for (auto vecin : g[x])
        {
            if (!viz[vecin])
            {
                kk = 1 - kk;
                dfss(vecin, y);
                kk = 1 - kk;
            }
        }
    }
}

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) % 2);
        int dl = t[p2.first].second;
        memset(viz, 0, sizeof(viz));
        kk = 0;
        kkk = 0;
        dfss(p2.first, p1.first);
        t[p2.first].second = kkk;
    }
    else
    {
        if (p1.second == p2.second)
            cnt_bad++;
    }
}

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], g[u[i]].push_back(v[i]), g[v[i]].push_back(u[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 (cnt_bad != 0)
        {
            rmin[1] = i + 1;
            break;
        }
    }
    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
**/

Compilation message

Joker.cpp: In function 'void join(int, int)':
Joker.cpp:54:13: warning: unused variable 'dl' [-Wunused-variable]
   54 |         int dl = t[p2.first].second;
      |             ^~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Incorrect 2 ms 5212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Incorrect 2 ms 5212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Execution timed out 2056 ms 17736 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Incorrect 2 ms 5212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Incorrect 2 ms 5212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Incorrect 2 ms 5212 KB Output isn't correct
4 Halted 0 ms 0 KB -