oj.uz

답안 #648613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648613 2022-10-07T07:11:11 Z mychecksedad Joker (BOI20_joker) C++17
14 / 100
 2000 ms 41676 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;


int n, m, q, l, r;
bool ok;
vector<pair<int, int>> g[N];
bitset<M> vis, pos, okb;
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 dfs1(int v, int p, bool c, int min_edge){
    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])
                okb[min_edge] = okb[min_edge] | (pos[v] == pos[u]);
            else
                dfs1(u, v, !c, k.second > r ? min(min_edge, k.second) : min_edge);
        }
    }
}
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});
    }
    for(int i = 1; i <= n; ++i){
        sort(all(g[i]), [&](const pair<int, int> &a, pair<int, int> &b){
            return a.second > b.second;
        });
    }
    if(n <= 2000 || q <= 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<int> lim(205);
        for(int i = 1; i <= min(200, m); ++i){
            vis = 0;
            okb = 0;
            l = i, r = i;
            for(int v = 1; v <= n; ++v) if(!ok && !vis[v]) dfs1(v, v, 0, m + 1);
            for(int j = 1; j <= m; ++j){
                if(okb[j]) lim[i] = j;
            }
        }
        for(int i = 1; i <= q; ++i){
            cin >> l >> r;
            cout << (r <= lim[i] ? "YES": "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:97:16: warning: unused variable 'aa' [-Wunused-variable]
   97 |     int T = 1, aa;
      |                ^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23804 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23832 KB Output is correct
6 Correct 13 ms 23788 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 15 ms 23868 KB Output is correct
9 Correct 14 ms 23764 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 14 ms 23868 KB Output is correct
12 Correct 16 ms 23852 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 14 ms 23852 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 14 ms 23764 KB Output is correct
19 Correct 13 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 15 ms 23772 KB Output is correct
23 Correct 16 ms 23864 KB Output is correct
24 Correct 17 ms 23764 KB Output is correct
25 Correct 17 ms 23892 KB Output is correct
26 Correct 13 ms 23864 KB Output is correct
27 Correct 13 ms 23872 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23804 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23832 KB Output is correct
6 Correct 13 ms 23788 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 15 ms 23868 KB Output is correct
9 Correct 14 ms 23764 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 14 ms 23868 KB Output is correct
12 Correct 16 ms 23852 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 14 ms 23852 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 14 ms 23764 KB Output is correct
19 Correct 13 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 15 ms 23772 KB Output is correct
23 Correct 16 ms 23864 KB Output is correct
24 Correct 17 ms 23764 KB Output is correct
25 Correct 17 ms 23892 KB Output is correct
26 Correct 13 ms 23864 KB Output is correct
27 Correct 13 ms 23872 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 88 ms 23892 KB Output is correct
30 Correct 99 ms 24020 KB Output is correct
31 Correct 110 ms 23964 KB Output is correct
32 Correct 89 ms 23980 KB Output is correct
33 Correct 76 ms 23964 KB Output is correct
34 Correct 95 ms 23956 KB Output is correct
35 Correct 114 ms 23964 KB Output is correct
36 Correct 48 ms 24020 KB Output is correct
37 Correct 100 ms 23960 KB Output is correct
38 Correct 121 ms 23936 KB Output is correct
39 Correct 97 ms 24028 KB Output is correct
40 Correct 90 ms 23984 KB Output is correct
41 Correct 86 ms 23968 KB Output is correct
42 Correct 91 ms 23980 KB Output is correct
43 Correct 87 ms 23904 KB Output is correct
44 Correct 124 ms 23960 KB Output is correct
45 Correct 153 ms 23968 KB Output is correct
46 Correct 124 ms 23972 KB Output is correct
47 Correct 97 ms 23940 KB Output is correct
48 Correct 99 ms 23952 KB Output is correct
49 Correct 111 ms 23960 KB Output is correct
50 Correct 108 ms 23892 KB Output is correct
51 Correct 89 ms 23956 KB Output is correct
52 Correct 108 ms 23960 KB Output is correct
53 Correct 118 ms 23964 KB Output is correct
54 Correct 119 ms 23960 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Incorrect 1871 ms 41676 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23804 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23832 KB Output is correct
6 Correct 13 ms 23788 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 15 ms 23868 KB Output is correct
9 Correct 14 ms 23764 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 14 ms 23868 KB Output is correct
12 Correct 16 ms 23852 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 14 ms 23852 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 14 ms 23764 KB Output is correct
19 Correct 13 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 15 ms 23772 KB Output is correct
23 Correct 16 ms 23864 KB Output is correct
24 Correct 17 ms 23764 KB Output is correct
25 Correct 17 ms 23892 KB Output is correct
26 Correct 13 ms 23864 KB Output is correct
27 Correct 13 ms 23872 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Incorrect 1871 ms 41676 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23804 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23832 KB Output is correct
6 Correct 13 ms 23788 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 15 ms 23868 KB Output is correct
9 Correct 14 ms 23764 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 14 ms 23868 KB Output is correct
12 Correct 16 ms 23852 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 14 ms 23852 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 14 ms 23764 KB Output is correct
19 Correct 13 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 15 ms 23772 KB Output is correct
23 Correct 16 ms 23864 KB Output is correct
24 Correct 17 ms 23764 KB Output is correct
25 Correct 17 ms 23892 KB Output is correct
26 Correct 13 ms 23864 KB Output is correct
27 Correct 13 ms 23872 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 88 ms 23892 KB Output is correct
30 Correct 99 ms 24020 KB Output is correct
31 Correct 110 ms 23964 KB Output is correct
32 Correct 89 ms 23980 KB Output is correct
33 Correct 76 ms 23964 KB Output is correct
34 Correct 95 ms 23956 KB Output is correct
35 Correct 114 ms 23964 KB Output is correct
36 Correct 48 ms 24020 KB Output is correct
37 Correct 100 ms 23960 KB Output is correct
38 Correct 121 ms 23936 KB Output is correct
39 Correct 97 ms 24028 KB Output is correct
40 Correct 90 ms 23984 KB Output is correct
41 Correct 86 ms 23968 KB Output is correct
42 Correct 91 ms 23980 KB Output is correct
43 Correct 87 ms 23904 KB Output is correct
44 Correct 124 ms 23960 KB Output is correct
45 Correct 153 ms 23968 KB Output is correct
46 Correct 124 ms 23972 KB Output is correct
47 Correct 97 ms 23940 KB Output is correct
48 Correct 99 ms 23952 KB Output is correct
49 Correct 111 ms 23960 KB Output is correct
50 Correct 108 ms 23892 KB Output is correct
51 Correct 89 ms 23956 KB Output is correct
52 Correct 108 ms 23960 KB Output is correct
53 Correct 118 ms 23964 KB Output is correct
54 Correct 119 ms 23960 KB Output is correct
55 Execution timed out 2083 ms 36388 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23804 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23832 KB Output is correct
6 Correct 13 ms 23788 KB Output is correct
7 Correct 13 ms 23764 KB Output is correct
8 Correct 15 ms 23868 KB Output is correct
9 Correct 14 ms 23764 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct
11 Correct 14 ms 23868 KB Output is correct
12 Correct 16 ms 23852 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 14 ms 23852 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 14 ms 23764 KB Output is correct
19 Correct 13 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 15 ms 23772 KB Output is correct
23 Correct 16 ms 23864 KB Output is correct
24 Correct 17 ms 23764 KB Output is correct
25 Correct 17 ms 23892 KB Output is correct
26 Correct 13 ms 23864 KB Output is correct
27 Correct 13 ms 23872 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 88 ms 23892 KB Output is correct
30 Correct 99 ms 24020 KB Output is correct
31 Correct 110 ms 23964 KB Output is correct
32 Correct 89 ms 23980 KB Output is correct
33 Correct 76 ms 23964 KB Output is correct
34 Correct 95 ms 23956 KB Output is correct
35 Correct 114 ms 23964 KB Output is correct
36 Correct 48 ms 24020 KB Output is correct
37 Correct 100 ms 23960 KB Output is correct
38 Correct 121 ms 23936 KB Output is correct
39 Correct 97 ms 24028 KB Output is correct
40 Correct 90 ms 23984 KB Output is correct
41 Correct 86 ms 23968 KB Output is correct
42 Correct 91 ms 23980 KB Output is correct
43 Correct 87 ms 23904 KB Output is correct
44 Correct 124 ms 23960 KB Output is correct
45 Correct 153 ms 23968 KB Output is correct
46 Correct 124 ms 23972 KB Output is correct
47 Correct 97 ms 23940 KB Output is correct
48 Correct 99 ms 23952 KB Output is correct
49 Correct 111 ms 23960 KB Output is correct
50 Correct 108 ms 23892 KB Output is correct
51 Correct 89 ms 23956 KB Output is correct
52 Correct 108 ms 23960 KB Output is correct
53 Correct 118 ms 23964 KB Output is correct
54 Correct 119 ms 23960 KB Output is correct
55 Incorrect 1871 ms 41676 KB Output isn't correct
56 Halted 0 ms 0 KB -