oj.uz

답안 #699227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699227 2023-02-16T07:38:33 Z maomao90 Joker (BOI20_joker) C++17
0 / 100
 2000 ms 10008 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n, m, q;
int u[MAXN], v[MAXN];
vii ql[MAXN];

bool pos;
int p[MAXN], rnk[MAXN];
bool col[MAXN];
void init() {
    pos = 1;
    REP (i, 1, n + 1) {
        p[i] = i;
        rnk[i] = 1;
        col[i] = 0;
    }
}
int findp(int u) {
    if (p[u] == u) {
        return u;
    }
    int op = p[u];
    p[u] = findp(p[u]);
    col[u] ^= col[op];
    return p[u];
}
void join(int a, int b) {
    int pa = findp(a), pb = findp(b);
    if (pa == pb) {
        if (col[a] == col[b]) {
            pos = 0;
        }
        return;
    }
    if (rnk[pa] < rnk[pb]) {
        swap(pa, pb);
    }
    if (rnk[pa] == rnk[pb]) {
        rnk[pa]++;
    }
    p[pb] = pa;
    col[pb] = 1;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m >> q;
    REP (i, 1, m + 1) {
        cin >> u[i] >> v[i];
    }
    REP (i, 0, q) {
        int l, r; cin >> l >> r;
        //ql[l].pb(r);
        init();
        REP (j, 1, l) {
            join(u[j], v[j]);
            if (!pos) {
                break;
            }
        }
        if (!pos) {
            cout << "YES\n";
            continue;
        }
        REP (j, r + 1, m + 1) {
            join(u[j], v[j]);
            if (!pos) {
                break;
            }
        }
        if (!pos) {
            cout << "YES\n";
            continue;
        }
        cout << "NO\n";
    }
    return 0;
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Execution timed out 2079 ms 10008 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 22.0

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

Subtask #6
0 / 29.0

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