oj.uz

답안 #648636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648636 2022-10-07T08:43:36 Z mychecksedad Joker (BOI20_joker) C++17
39 / 100
 2000 ms 61408 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 2e5+10, F = 2147483646, K = 20;

struct Dsu {
    vector<int> s;
    vector<pair<int, int>> p;
    vector<bool> bp;
    Dsu(int n){
        s.resize(n+1, 1);
        p.resize(n+1);
        bp.resize(n+1);
        for(int i = 0; i <= n; ++i) p[i] = {i, 0}, bp[i] = 1;
    }
    pair<int, int> find_set(int v) {
        if (v != p[v].first) {
            int parity = p[v].second;
            p[v] = find_set(p[v].first);
            p[v].second ^= parity;
        }
        return p[v];
    }
    void merge(int a, int b){
        pair<int, int> pa = find_set(a);
        a = pa.first;
        int x = pa.second;

        pair<int, int> pb = find_set(b);
        b = pb.first;
        int y = pb.second;

        if (a == b) {
            if (x == y)
                bp[a] = 0;
        } else {
            if (s[a] < s[b])
                swap (a, b);
            p[b] = make_pair(a, x^y^1);
            bp[a] = bp[b] & bp[a];
            s[a] += s[b];
        }
    }
};


int n, m, q, l, r;
bool ok;
vector<pair<int, int>> g[N], edges;
bitset<M> vis, pos;
void dfs(int v, int p, bool c){
    vis[v] = 1;
    pos[v] = c;
    for(auto k: g[v]){
        int u = k.first;
        if(l <= k.second && k.second <= r) continue;
        if(u != p){
            if(vis[u])
                ok |= pos[v] == pos[u];
            else
                dfs(u, v, !c);
        }
    }
}
void solve(){
    cin >> n >> m >> q;
    for(int i = 0; i < m; ++i){
        int u, v; cin >> u >> v;
        g[u].pb({v, i + 1});
        g[v].pb({u, i + 1});
        edges.pb({u, v});
    }
    if(n <= 2000){
        for(int i = 0; i < q; ++i){
            cin >> l >> r;
            vis = 0;
            ok = 0;
            for(int v = 1; v <= n; ++v) if(!ok && !vis[v]) dfs(v, v, 0);
            if(ok) cout << "YES\n";
            else cout << "NO\n";
        }
    }
    else{
        vector<pair<int, int>> queries[205];
        vector<int> qq(q + 1);
        for(int i = 1; i <= q; ++i){
            cin >> l >> r;
            queries[l].pb({r, i});
        }
        for(int i = 1; i <= 200; ++i){
            if(queries[i].empty()) continue;
            Dsu d(n);
            ok = 0;
            for(int j = 1; j < i; ++j){
                int u = edges[j - 1].first, v = edges[j - 1].second;
                d.merge(u, v);
                ok |= !d.bp[d.find_set(u).first] | !d.bp[d.find_set(v).first];
            }
            sort(all(queries[i]), [&](const pair<int, int> &a, const pair<int, int> &b){
                return a.first > b.first;
            });
            int cur = m;
            for(auto k: queries[i]){
                while(cur > k.first){
                    int u = edges[cur - 1].first, v = edges[cur - 1].second;
                    d.merge(u, v);
                    ok |= !d.bp[d.find_set(u).first] | !d.bp[d.find_set(v).first];
                    cur--;
                }
                qq[k.second] = ok;
            }
        }
        for(int i = 1; i <= q; ++i) cout << (qq[i] ? "YES\n" : "NO\n");
    }
}



int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

Joker.cpp: In function 'int main()':
Joker.cpp:133:16: warning: unused variable 'aa' [-Wunused-variable]
  133 |     int T = 1, aa;
      |                ^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23844 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23752 KB Output is correct
5 Correct 12 ms 23832 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 13 ms 23748 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 16 ms 23784 KB Output is correct
12 Correct 16 ms 23800 KB Output is correct
13 Correct 13 ms 23836 KB Output is correct
14 Correct 15 ms 23876 KB Output is correct
15 Correct 13 ms 23788 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 17 ms 23764 KB Output is correct
19 Correct 15 ms 23760 KB Output is correct
20 Correct 16 ms 23876 KB Output is correct
21 Correct 15 ms 23764 KB Output is correct
22 Correct 17 ms 23752 KB Output is correct
23 Correct 16 ms 23860 KB Output is correct
24 Correct 15 ms 23788 KB Output is correct
25 Correct 15 ms 23764 KB Output is correct
26 Correct 14 ms 23864 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 13 ms 23764 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23844 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23752 KB Output is correct
5 Correct 12 ms 23832 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 13 ms 23748 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 16 ms 23784 KB Output is correct
12 Correct 16 ms 23800 KB Output is correct
13 Correct 13 ms 23836 KB Output is correct
14 Correct 15 ms 23876 KB Output is correct
15 Correct 13 ms 23788 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 17 ms 23764 KB Output is correct
19 Correct 15 ms 23760 KB Output is correct
20 Correct 16 ms 23876 KB Output is correct
21 Correct 15 ms 23764 KB Output is correct
22 Correct 17 ms 23752 KB Output is correct
23 Correct 16 ms 23860 KB Output is correct
24 Correct 15 ms 23788 KB Output is correct
25 Correct 15 ms 23764 KB Output is correct
26 Correct 14 ms 23864 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 13 ms 23764 KB Output is correct
29 Correct 97 ms 23896 KB Output is correct
30 Correct 104 ms 24000 KB Output is correct
31 Correct 111 ms 24012 KB Output is correct
32 Correct 92 ms 24020 KB Output is correct
33 Correct 80 ms 24000 KB Output is correct
34 Correct 103 ms 24012 KB Output is correct
35 Correct 122 ms 24128 KB Output is correct
36 Correct 47 ms 24056 KB Output is correct
37 Correct 86 ms 24016 KB Output is correct
38 Correct 94 ms 23988 KB Output is correct
39 Correct 100 ms 24020 KB Output is correct
40 Correct 89 ms 23960 KB Output is correct
41 Correct 89 ms 24040 KB Output is correct
42 Correct 93 ms 24008 KB Output is correct
43 Correct 92 ms 24004 KB Output is correct
44 Correct 119 ms 24008 KB Output is correct
45 Correct 125 ms 24020 KB Output is correct
46 Correct 132 ms 24004 KB Output is correct
47 Correct 93 ms 23992 KB Output is correct
48 Correct 92 ms 24012 KB Output is correct
49 Correct 107 ms 24020 KB Output is correct
50 Correct 104 ms 23988 KB Output is correct
51 Correct 91 ms 24000 KB Output is correct
52 Correct 97 ms 24020 KB Output is correct
53 Correct 106 ms 24020 KB Output is correct
54 Correct 121 ms 24020 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23844 KB Output is correct
3 Correct 142 ms 34284 KB Output is correct
4 Correct 136 ms 37176 KB Output is correct
5 Correct 146 ms 37080 KB Output is correct
6 Correct 139 ms 35832 KB Output is correct
7 Correct 131 ms 35924 KB Output is correct
8 Correct 123 ms 35068 KB Output is correct
9 Correct 131 ms 35964 KB Output is correct
10 Correct 187 ms 37100 KB Output is correct
11 Correct 134 ms 35692 KB Output is correct
12 Correct 152 ms 36492 KB Output is correct
13 Correct 123 ms 34612 KB Output is correct
14 Correct 129 ms 34924 KB Output is correct
15 Correct 146 ms 35920 KB Output is correct
16 Correct 155 ms 37048 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23844 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23752 KB Output is correct
5 Correct 12 ms 23832 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 13 ms 23748 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 16 ms 23784 KB Output is correct
12 Correct 16 ms 23800 KB Output is correct
13 Correct 13 ms 23836 KB Output is correct
14 Correct 15 ms 23876 KB Output is correct
15 Correct 13 ms 23788 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 17 ms 23764 KB Output is correct
19 Correct 15 ms 23760 KB Output is correct
20 Correct 16 ms 23876 KB Output is correct
21 Correct 15 ms 23764 KB Output is correct
22 Correct 17 ms 23752 KB Output is correct
23 Correct 16 ms 23860 KB Output is correct
24 Correct 15 ms 23788 KB Output is correct
25 Correct 15 ms 23764 KB Output is correct
26 Correct 14 ms 23864 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 13 ms 23764 KB Output is correct
29 Correct 142 ms 34284 KB Output is correct
30 Correct 136 ms 37176 KB Output is correct
31 Correct 146 ms 37080 KB Output is correct
32 Correct 139 ms 35832 KB Output is correct
33 Correct 131 ms 35924 KB Output is correct
34 Correct 123 ms 35068 KB Output is correct
35 Correct 131 ms 35964 KB Output is correct
36 Correct 187 ms 37100 KB Output is correct
37 Correct 134 ms 35692 KB Output is correct
38 Correct 152 ms 36492 KB Output is correct
39 Correct 123 ms 34612 KB Output is correct
40 Correct 129 ms 34924 KB Output is correct
41 Correct 146 ms 35920 KB Output is correct
42 Correct 155 ms 37048 KB Output is correct
43 Correct 1353 ms 34772 KB Output is correct
44 Correct 1817 ms 38588 KB Output is correct
45 Correct 1801 ms 38532 KB Output is correct
46 Correct 1877 ms 36648 KB Output is correct
47 Correct 1871 ms 36708 KB Output is correct
48 Correct 1773 ms 36572 KB Output is correct
49 Execution timed out 2081 ms 37892 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23844 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23752 KB Output is correct
5 Correct 12 ms 23832 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 13 ms 23748 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 16 ms 23784 KB Output is correct
12 Correct 16 ms 23800 KB Output is correct
13 Correct 13 ms 23836 KB Output is correct
14 Correct 15 ms 23876 KB Output is correct
15 Correct 13 ms 23788 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 17 ms 23764 KB Output is correct
19 Correct 15 ms 23760 KB Output is correct
20 Correct 16 ms 23876 KB Output is correct
21 Correct 15 ms 23764 KB Output is correct
22 Correct 17 ms 23752 KB Output is correct
23 Correct 16 ms 23860 KB Output is correct
24 Correct 15 ms 23788 KB Output is correct
25 Correct 15 ms 23764 KB Output is correct
26 Correct 14 ms 23864 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 13 ms 23764 KB Output is correct
29 Correct 97 ms 23896 KB Output is correct
30 Correct 104 ms 24000 KB Output is correct
31 Correct 111 ms 24012 KB Output is correct
32 Correct 92 ms 24020 KB Output is correct
33 Correct 80 ms 24000 KB Output is correct
34 Correct 103 ms 24012 KB Output is correct
35 Correct 122 ms 24128 KB Output is correct
36 Correct 47 ms 24056 KB Output is correct
37 Correct 86 ms 24016 KB Output is correct
38 Correct 94 ms 23988 KB Output is correct
39 Correct 100 ms 24020 KB Output is correct
40 Correct 89 ms 23960 KB Output is correct
41 Correct 89 ms 24040 KB Output is correct
42 Correct 93 ms 24008 KB Output is correct
43 Correct 92 ms 24004 KB Output is correct
44 Correct 119 ms 24008 KB Output is correct
45 Correct 125 ms 24020 KB Output is correct
46 Correct 132 ms 24004 KB Output is correct
47 Correct 93 ms 23992 KB Output is correct
48 Correct 92 ms 24012 KB Output is correct
49 Correct 107 ms 24020 KB Output is correct
50 Correct 104 ms 23988 KB Output is correct
51 Correct 91 ms 24000 KB Output is correct
52 Correct 97 ms 24020 KB Output is correct
53 Correct 106 ms 24020 KB Output is correct
54 Correct 121 ms 24020 KB Output is correct
55 Runtime error 100 ms 61408 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23844 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23752 KB Output is correct
5 Correct 12 ms 23832 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 13 ms 23748 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 16 ms 23784 KB Output is correct
12 Correct 16 ms 23800 KB Output is correct
13 Correct 13 ms 23836 KB Output is correct
14 Correct 15 ms 23876 KB Output is correct
15 Correct 13 ms 23788 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 17 ms 23764 KB Output is correct
19 Correct 15 ms 23760 KB Output is correct
20 Correct 16 ms 23876 KB Output is correct
21 Correct 15 ms 23764 KB Output is correct
22 Correct 17 ms 23752 KB Output is correct
23 Correct 16 ms 23860 KB Output is correct
24 Correct 15 ms 23788 KB Output is correct
25 Correct 15 ms 23764 KB Output is correct
26 Correct 14 ms 23864 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 13 ms 23764 KB Output is correct
29 Correct 97 ms 23896 KB Output is correct
30 Correct 104 ms 24000 KB Output is correct
31 Correct 111 ms 24012 KB Output is correct
32 Correct 92 ms 24020 KB Output is correct
33 Correct 80 ms 24000 KB Output is correct
34 Correct 103 ms 24012 KB Output is correct
35 Correct 122 ms 24128 KB Output is correct
36 Correct 47 ms 24056 KB Output is correct
37 Correct 86 ms 24016 KB Output is correct
38 Correct 94 ms 23988 KB Output is correct
39 Correct 100 ms 24020 KB Output is correct
40 Correct 89 ms 23960 KB Output is correct
41 Correct 89 ms 24040 KB Output is correct
42 Correct 93 ms 24008 KB Output is correct
43 Correct 92 ms 24004 KB Output is correct
44 Correct 119 ms 24008 KB Output is correct
45 Correct 125 ms 24020 KB Output is correct
46 Correct 132 ms 24004 KB Output is correct
47 Correct 93 ms 23992 KB Output is correct
48 Correct 92 ms 24012 KB Output is correct
49 Correct 107 ms 24020 KB Output is correct
50 Correct 104 ms 23988 KB Output is correct
51 Correct 91 ms 24000 KB Output is correct
52 Correct 97 ms 24020 KB Output is correct
53 Correct 106 ms 24020 KB Output is correct
54 Correct 121 ms 24020 KB Output is correct
55 Correct 142 ms 34284 KB Output is correct
56 Correct 136 ms 37176 KB Output is correct
57 Correct 146 ms 37080 KB Output is correct
58 Correct 139 ms 35832 KB Output is correct
59 Correct 131 ms 35924 KB Output is correct
60 Correct 123 ms 35068 KB Output is correct
61 Correct 131 ms 35964 KB Output is correct
62 Correct 187 ms 37100 KB Output is correct
63 Correct 134 ms 35692 KB Output is correct
64 Correct 152 ms 36492 KB Output is correct
65 Correct 123 ms 34612 KB Output is correct
66 Correct 129 ms 34924 KB Output is correct
67 Correct 146 ms 35920 KB Output is correct
68 Correct 155 ms 37048 KB Output is correct
69 Correct 1353 ms 34772 KB Output is correct
70 Correct 1817 ms 38588 KB Output is correct
71 Correct 1801 ms 38532 KB Output is correct
72 Correct 1877 ms 36648 KB Output is correct
73 Correct 1871 ms 36708 KB Output is correct
74 Correct 1773 ms 36572 KB Output is correct
75 Execution timed out 2081 ms 37892 KB Time limit exceeded
76 Halted 0 ms 0 KB -