oj.uz

답안 #877238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877238 2023-11-23T04:35:56 Z bachhoangxuan Joker (BOI20_joker) C++17
14 / 100
 2000 ms 13476 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
const int base=101;

int n,m,q;
pii p[maxn];
int ans[maxn],ql[maxn],qr[maxn];
vector<int> query[maxn];

namespace DSU{
    bool check=true;
    int par[maxn],d[maxn];
    void reset(){
        check=true;
        for(int i=1;i<=n;i++) par[i]=i,d[i]=0;
    }
    int findpar(int u){
        if(u!=par[u]){
            int nxt=par[u];
            par[u]=findpar(par[u]);
            d[u]^=d[nxt];
            return par[u];
        }
        return u;
    }
    void unions(int u,int v){
        int pu=findpar(u),pv=findpar(v);
        if(pu==pv){
            if(d[u]==d[v]) check=false;
            return;
        }
        par[pv]=pu;
        d[pv]^=d[u]^d[v]^1;
    }
}

void solve(){
    cin >> n >> m >> q;
    for(int i=1;i<=m;i++) cin >> p[i].fi >> p[i].se;
    int Max=0;
    for(int i=1;i<=q;i++){
        cin >> ql[i] >> qr[i];
        DSU::reset();
        for(int j=1;j<ql[i];j++) DSU::unions(p[j].fi,p[j].se);
        for(int j=qr[i]+1;j<=m;j++) DSU::unions(p[j].fi,p[j].se);
        cout << (DSU::check?"NO\n":"YES\n");
        //Max=max(Max,ql[i]);
        //query[ql[i]].push_back(i);
    }
    /*
    for(int i=1;i<=Max;i++){
        DSU::reset();
        for(int j=1;j<i;j++) DSU::unions(p[j].fi,p[j].se);
        int cur=m;
        if(cur>=i && DSU::check) DSU::unions(p[cur].fi,p[cur].se),cur--;
        for(int id:query[i]) if(qr[id]<=cur) ans[id]=1;
    }
    for(int i=1;i<=q;i++) cout << (ans[i]?"YES\n":"NO\n");
        */
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Compilation message

Joker.cpp: In function 'void solve()':
Joker.cpp:77:9: warning: unused variable 'Max' [-Wunused-variable]
   77 |     int Max=0;
      |         ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8680 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8672 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8672 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8680 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8672 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8672 KB Output is correct
29 Correct 12 ms 8540 KB Output is correct
30 Correct 27 ms 8744 KB Output is correct
31 Correct 32 ms 8540 KB Output is correct
32 Correct 32 ms 8540 KB Output is correct
33 Correct 27 ms 8732 KB Output is correct
34 Correct 29 ms 8736 KB Output is correct
35 Correct 32 ms 8540 KB Output is correct
36 Correct 15 ms 8536 KB Output is correct
37 Correct 22 ms 8744 KB Output is correct
38 Correct 31 ms 8540 KB Output is correct
39 Correct 26 ms 8536 KB Output is correct
40 Correct 22 ms 8540 KB Output is correct
41 Correct 22 ms 8680 KB Output is correct
42 Correct 23 ms 8540 KB Output is correct
43 Correct 48 ms 8540 KB Output is correct
44 Correct 59 ms 8788 KB Output is correct
45 Correct 66 ms 8536 KB Output is correct
46 Correct 56 ms 8536 KB Output is correct
47 Correct 30 ms 8540 KB Output is correct
48 Correct 32 ms 8540 KB Output is correct
49 Correct 30 ms 8716 KB Output is correct
50 Correct 29 ms 8536 KB Output is correct
51 Correct 30 ms 8540 KB Output is correct
52 Correct 31 ms 8536 KB Output is correct
53 Correct 32 ms 8536 KB Output is correct
54 Correct 31 ms 8540 KB Output is correct

Subtask #3
0 / 25.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8680 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8672 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8672 KB Output is correct
29 Execution timed out 2065 ms 11336 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8680 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8672 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8672 KB Output is correct
29 Correct 12 ms 8540 KB Output is correct
30 Correct 27 ms 8744 KB Output is correct
31 Correct 32 ms 8540 KB Output is correct
32 Correct 32 ms 8540 KB Output is correct
33 Correct 27 ms 8732 KB Output is correct
34 Correct 29 ms 8736 KB Output is correct
35 Correct 32 ms 8540 KB Output is correct
36 Correct 15 ms 8536 KB Output is correct
37 Correct 22 ms 8744 KB Output is correct
38 Correct 31 ms 8540 KB Output is correct
39 Correct 26 ms 8536 KB Output is correct
40 Correct 22 ms 8540 KB Output is correct
41 Correct 22 ms 8680 KB Output is correct
42 Correct 23 ms 8540 KB Output is correct
43 Correct 48 ms 8540 KB Output is correct
44 Correct 59 ms 8788 KB Output is correct
45 Correct 66 ms 8536 KB Output is correct
46 Correct 56 ms 8536 KB Output is correct
47 Correct 30 ms 8540 KB Output is correct
48 Correct 32 ms 8540 KB Output is correct
49 Correct 30 ms 8716 KB Output is correct
50 Correct 29 ms 8536 KB Output is correct
51 Correct 30 ms 8540 KB Output is correct
52 Correct 31 ms 8536 KB Output is correct
53 Correct 32 ms 8536 KB Output is correct
54 Correct 31 ms 8540 KB Output is correct
55 Execution timed out 2021 ms 13476 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8680 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8672 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8536 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8792 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8672 KB Output is correct
29 Correct 12 ms 8540 KB Output is correct
30 Correct 27 ms 8744 KB Output is correct
31 Correct 32 ms 8540 KB Output is correct
32 Correct 32 ms 8540 KB Output is correct
33 Correct 27 ms 8732 KB Output is correct
34 Correct 29 ms 8736 KB Output is correct
35 Correct 32 ms 8540 KB Output is correct
36 Correct 15 ms 8536 KB Output is correct
37 Correct 22 ms 8744 KB Output is correct
38 Correct 31 ms 8540 KB Output is correct
39 Correct 26 ms 8536 KB Output is correct
40 Correct 22 ms 8540 KB Output is correct
41 Correct 22 ms 8680 KB Output is correct
42 Correct 23 ms 8540 KB Output is correct
43 Correct 48 ms 8540 KB Output is correct
44 Correct 59 ms 8788 KB Output is correct
45 Correct 66 ms 8536 KB Output is correct
46 Correct 56 ms 8536 KB Output is correct
47 Correct 30 ms 8540 KB Output is correct
48 Correct 32 ms 8540 KB Output is correct
49 Correct 30 ms 8716 KB Output is correct
50 Correct 29 ms 8536 KB Output is correct
51 Correct 30 ms 8540 KB Output is correct
52 Correct 31 ms 8536 KB Output is correct
53 Correct 32 ms 8536 KB Output is correct
54 Correct 31 ms 8540 KB Output is correct
55 Execution timed out 2065 ms 11336 KB Time limit exceeded
56 Halted 0 ms 0 KB -