oj.uz

Submission #914685

# Submission time Handle Problem Language Result Execution time Memory
914685 2024-01-22T14:17:20 Z Amr Joker (BOI20_joker) C++14
49 / 100
 2000 ms 29156 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
//#define F first
#define all(x) (x).begin(),(x).end()
#define sz size()
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define pb(x) push_back(x);
#define endl '\n'
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N=2e5+7;
#define ll int
ll INF=INT_MAX,mod=1e9+7;
int TT=1;
ll power(ll x, unsigned int y)
{
    ll res = 1;
    x = x; // % mod;
    if (x == 0) return 0;
    while (y > 0)
    {
        if (y & 1) res = (res*x)  ; // % mod;
        y = y>>1;
        x = (x*x) ; // % mod;
    }
    return res;
}
ll n , m , q;
pair<ll,ll> p[N];
pair<ll,ll>  a[N];
vector<vector<ll> > qe(N,vector<ll> (3));
ll ans[N];
ll siz[N];
ll cycles = 0;
vector<vector<ll>> roll;
ll sqr = 4;
bool cmp(vector<ll> x, vector<ll> y)
{
    if(x[0]/sqr==y[0]/sqr) return x[1] > y[1];
    return x[0]<y[0];
}
pair<ll,ll> get(ll x)
{
    if(p[x].first==x) return {x,0};
    pair<ll,ll> ho = get(p[x].first);
    return {ho.first, p[x].second^ho.second};
}
void nonmerge(vector<ll> v)
{
    ll x= v[0] , y = v[1] , b = v[2];
    if(b==1)
    {
    siz[y] -= siz[x];
    p[x] = {x,0};
    return;
    }
    else
    {
        if(b==2) cycles--; return;
    }
}
void merg(ll x, ll y)
{

    pair<ll,ll> paix = get(x);
    pair<ll,ll> paiy = get(y);
    if(paix.first==paiy.first)
    {
        if(paix.second==paiy.second) {cycles++;roll.push_back({x,y,2});}
        else
        roll.push_back({x,y,0});
    }
    else
    {
        ll xx = paix.first , yy = paiy.first;
        if(siz[xx]<siz[yy])
        {
            p[xx] = {yy,(paix.second==paiy.second)};
            siz[yy] +=siz[xx];
            roll.push_back({xx,yy,1});
        }
        else
        {
            p[yy] = {xx,(paix.second==paiy.second)};
            siz[xx]+=siz[yy];
            roll.push_back({yy,xx,1});
        }
    }
}
void solve()
{

    cin >> n >> m >> q;
    sqr = max(1,m/int(sqrt(q)));
    for(int i = 1; i <= n; i++) p[i] = {i,0},siz[i] = 1;
    for(int i = 1; i <= m; i++) cin >> a[i].first >> a[i].second;
    for(int i = 1; i <= q; i++)
    {
        cin >> qe[i][0] >> qe[i][1];
    }
    for(int i = 1; i <= q; i++) qe[i][2] = i;
    sort(qe.begin()+1,qe.begin()+q+1,cmp);
    //for(int i = 1; i <= q; i++) cout << qe[i][1] << " "; cout << endl;
    ll st = 0, en = m+1;
    for(int i = 1; i <= q; i++)
    {
        ll l = qe[i][0] , r = qe[i][1];
        while(roll.sz&&st>0)
        {
            //
            nonmerge(roll.back());
            roll.pop_back();
            st--;
        }

        while(roll.sz&&en<=r)
        {
            //
            nonmerge(roll.back());
            roll.pop_back();
            en++;
        }
        while(en>r+1)
        {
            en--;
            merg(a[en].first,a[en].second);

            // mege en
        }
        while(st<l-1)
        {
            st++;
            merg(a[st].first,a[st].second);
          //  cout << cycles << endl;
            // merge st;
        }
        //cout << endl;
        //for(int i = 1; i <= n; i++) cout << p[i].first << " " << p[i].second << endl;
       // cout << l << " " << r << ": " << st << " " << en<< " " << cycles  << endl;
         ans[qe[i][2]] = bool(cycles);
    }
    for(int i = 1; i <= q; i++)
    {
        if(ans[i]) Yes; else No;
    }
}
int main(){
    //freopen("friday.in","r",stdin);
    //freopen("friday.out","w",stdout);
    fast;
    //cin >> TT;
    while(TT--)
        solve();

    return 0;
}

Compilation message

Joker.cpp: In function 'void nonmerge(std::vector<int>)':
Joker.cpp:62:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   62 |         if(b==2) cycles--; return;
      |         ^~
Joker.cpp:62:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   62 |         if(b==2) cycles--; return;
      |                            ^~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15452 KB Output is correct
2 Correct 9 ms 15452 KB Output is correct
3 Correct 11 ms 15452 KB Output is correct
4 Correct 11 ms 15448 KB Output is correct
5 Correct 12 ms 15708 KB Output is correct
6 Correct 10 ms 15640 KB Output is correct
7 Correct 10 ms 15452 KB Output is correct
8 Correct 10 ms 15504 KB Output is correct
9 Correct 11 ms 15452 KB Output is correct
10 Correct 11 ms 15512 KB Output is correct
11 Correct 10 ms 15452 KB Output is correct
12 Correct 11 ms 15380 KB Output is correct
13 Correct 11 ms 15500 KB Output is correct
14 Correct 11 ms 15448 KB Output is correct
15 Correct 11 ms 15452 KB Output is correct
16 Correct 11 ms 15452 KB Output is correct
17 Correct 11 ms 15452 KB Output is correct
18 Correct 12 ms 15480 KB Output is correct
19 Correct 11 ms 15452 KB Output is correct
20 Correct 12 ms 15448 KB Output is correct
21 Correct 10 ms 15448 KB Output is correct
22 Correct 11 ms 15452 KB Output is correct
23 Correct 11 ms 15452 KB Output is correct
24 Correct 11 ms 15492 KB Output is correct
25 Correct 10 ms 15452 KB Output is correct
26 Correct 16 ms 15448 KB Output is correct
27 Correct 14 ms 15296 KB Output is correct
28 Correct 16 ms 15452 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15452 KB Output is correct
2 Correct 9 ms 15452 KB Output is correct
3 Correct 11 ms 15452 KB Output is correct
4 Correct 11 ms 15448 KB Output is correct
5 Correct 12 ms 15708 KB Output is correct
6 Correct 10 ms 15640 KB Output is correct
7 Correct 10 ms 15452 KB Output is correct
8 Correct 10 ms 15504 KB Output is correct
9 Correct 11 ms 15452 KB Output is correct
10 Correct 11 ms 15512 KB Output is correct
11 Correct 10 ms 15452 KB Output is correct
12 Correct 11 ms 15380 KB Output is correct
13 Correct 11 ms 15500 KB Output is correct
14 Correct 11 ms 15448 KB Output is correct
15 Correct 11 ms 15452 KB Output is correct
16 Correct 11 ms 15452 KB Output is correct
17 Correct 11 ms 15452 KB Output is correct
18 Correct 12 ms 15480 KB Output is correct
19 Correct 11 ms 15452 KB Output is correct
20 Correct 12 ms 15448 KB Output is correct
21 Correct 10 ms 15448 KB Output is correct
22 Correct 11 ms 15452 KB Output is correct
23 Correct 11 ms 15452 KB Output is correct
24 Correct 11 ms 15492 KB Output is correct
25 Correct 10 ms 15452 KB Output is correct
26 Correct 16 ms 15448 KB Output is correct
27 Correct 14 ms 15296 KB Output is correct
28 Correct 16 ms 15452 KB Output is correct
29 Correct 52 ms 15452 KB Output is correct
30 Correct 99 ms 15620 KB Output is correct
31 Correct 125 ms 15452 KB Output is correct
32 Correct 122 ms 15636 KB Output is correct
33 Correct 125 ms 15628 KB Output is correct
34 Correct 106 ms 15636 KB Output is correct
35 Correct 106 ms 15704 KB Output is correct
36 Correct 109 ms 15632 KB Output is correct
37 Correct 101 ms 15448 KB Output is correct
38 Correct 100 ms 15452 KB Output is correct
39 Correct 126 ms 15636 KB Output is correct
40 Correct 118 ms 15452 KB Output is correct
41 Correct 105 ms 15448 KB Output is correct
42 Correct 103 ms 15652 KB Output is correct
43 Correct 146 ms 15452 KB Output is correct
44 Correct 147 ms 15636 KB Output is correct
45 Correct 136 ms 15448 KB Output is correct
46 Correct 126 ms 15448 KB Output is correct
47 Correct 109 ms 15632 KB Output is correct
48 Correct 111 ms 15452 KB Output is correct
49 Correct 107 ms 15636 KB Output is correct
50 Correct 103 ms 15652 KB Output is correct
51 Correct 152 ms 15644 KB Output is correct
52 Correct 114 ms 15632 KB Output is correct
53 Correct 111 ms 15628 KB Output is correct
54 Correct 108 ms 15448 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15452 KB Output is correct
2 Correct 9 ms 15452 KB Output is correct
3 Correct 241 ms 28132 KB Output is correct
4 Correct 269 ms 28416 KB Output is correct
5 Correct 275 ms 28248 KB Output is correct
6 Correct 216 ms 28400 KB Output is correct
7 Correct 226 ms 27124 KB Output is correct
8 Correct 213 ms 27384 KB Output is correct
9 Correct 215 ms 27644 KB Output is correct
10 Correct 224 ms 28916 KB Output is correct
11 Correct 215 ms 28356 KB Output is correct
12 Correct 219 ms 28680 KB Output is correct
13 Correct 207 ms 27548 KB Output is correct
14 Correct 217 ms 27132 KB Output is correct
15 Correct 222 ms 27392 KB Output is correct
16 Correct 218 ms 28156 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15452 KB Output is correct
2 Correct 9 ms 15452 KB Output is correct
3 Correct 11 ms 15452 KB Output is correct
4 Correct 11 ms 15448 KB Output is correct
5 Correct 12 ms 15708 KB Output is correct
6 Correct 10 ms 15640 KB Output is correct
7 Correct 10 ms 15452 KB Output is correct
8 Correct 10 ms 15504 KB Output is correct
9 Correct 11 ms 15452 KB Output is correct
10 Correct 11 ms 15512 KB Output is correct
11 Correct 10 ms 15452 KB Output is correct
12 Correct 11 ms 15380 KB Output is correct
13 Correct 11 ms 15500 KB Output is correct
14 Correct 11 ms 15448 KB Output is correct
15 Correct 11 ms 15452 KB Output is correct
16 Correct 11 ms 15452 KB Output is correct
17 Correct 11 ms 15452 KB Output is correct
18 Correct 12 ms 15480 KB Output is correct
19 Correct 11 ms 15452 KB Output is correct
20 Correct 12 ms 15448 KB Output is correct
21 Correct 10 ms 15448 KB Output is correct
22 Correct 11 ms 15452 KB Output is correct
23 Correct 11 ms 15452 KB Output is correct
24 Correct 11 ms 15492 KB Output is correct
25 Correct 10 ms 15452 KB Output is correct
26 Correct 16 ms 15448 KB Output is correct
27 Correct 14 ms 15296 KB Output is correct
28 Correct 16 ms 15452 KB Output is correct
29 Correct 241 ms 28132 KB Output is correct
30 Correct 269 ms 28416 KB Output is correct
31 Correct 275 ms 28248 KB Output is correct
32 Correct 216 ms 28400 KB Output is correct
33 Correct 226 ms 27124 KB Output is correct
34 Correct 213 ms 27384 KB Output is correct
35 Correct 215 ms 27644 KB Output is correct
36 Correct 224 ms 28916 KB Output is correct
37 Correct 215 ms 28356 KB Output is correct
38 Correct 219 ms 28680 KB Output is correct
39 Correct 207 ms 27548 KB Output is correct
40 Correct 217 ms 27132 KB Output is correct
41 Correct 222 ms 27392 KB Output is correct
42 Correct 218 ms 28156 KB Output is correct
43 Correct 1052 ms 27900 KB Output is correct
44 Correct 1048 ms 28696 KB Output is correct
45 Correct 1014 ms 28804 KB Output is correct
46 Correct 1046 ms 28044 KB Output is correct
47 Correct 1047 ms 28148 KB Output is correct
48 Correct 1181 ms 28028 KB Output is correct
49 Correct 1205 ms 27796 KB Output is correct
50 Correct 1086 ms 27444 KB Output is correct
51 Correct 1090 ms 28100 KB Output is correct
52 Correct 1042 ms 28676 KB Output is correct
53 Correct 1064 ms 27920 KB Output is correct
54 Correct 1113 ms 28428 KB Output is correct
55 Correct 1088 ms 28336 KB Output is correct
56 Correct 1095 ms 29156 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15452 KB Output is correct
2 Correct 9 ms 15452 KB Output is correct
3 Correct 11 ms 15452 KB Output is correct
4 Correct 11 ms 15448 KB Output is correct
5 Correct 12 ms 15708 KB Output is correct
6 Correct 10 ms 15640 KB Output is correct
7 Correct 10 ms 15452 KB Output is correct
8 Correct 10 ms 15504 KB Output is correct
9 Correct 11 ms 15452 KB Output is correct
10 Correct 11 ms 15512 KB Output is correct
11 Correct 10 ms 15452 KB Output is correct
12 Correct 11 ms 15380 KB Output is correct
13 Correct 11 ms 15500 KB Output is correct
14 Correct 11 ms 15448 KB Output is correct
15 Correct 11 ms 15452 KB Output is correct
16 Correct 11 ms 15452 KB Output is correct
17 Correct 11 ms 15452 KB Output is correct
18 Correct 12 ms 15480 KB Output is correct
19 Correct 11 ms 15452 KB Output is correct
20 Correct 12 ms 15448 KB Output is correct
21 Correct 10 ms 15448 KB Output is correct
22 Correct 11 ms 15452 KB Output is correct
23 Correct 11 ms 15452 KB Output is correct
24 Correct 11 ms 15492 KB Output is correct
25 Correct 10 ms 15452 KB Output is correct
26 Correct 16 ms 15448 KB Output is correct
27 Correct 14 ms 15296 KB Output is correct
28 Correct 16 ms 15452 KB Output is correct
29 Correct 52 ms 15452 KB Output is correct
30 Correct 99 ms 15620 KB Output is correct
31 Correct 125 ms 15452 KB Output is correct
32 Correct 122 ms 15636 KB Output is correct
33 Correct 125 ms 15628 KB Output is correct
34 Correct 106 ms 15636 KB Output is correct
35 Correct 106 ms 15704 KB Output is correct
36 Correct 109 ms 15632 KB Output is correct
37 Correct 101 ms 15448 KB Output is correct
38 Correct 100 ms 15452 KB Output is correct
39 Correct 126 ms 15636 KB Output is correct
40 Correct 118 ms 15452 KB Output is correct
41 Correct 105 ms 15448 KB Output is correct
42 Correct 103 ms 15652 KB Output is correct
43 Correct 146 ms 15452 KB Output is correct
44 Correct 147 ms 15636 KB Output is correct
45 Correct 136 ms 15448 KB Output is correct
46 Correct 126 ms 15448 KB Output is correct
47 Correct 109 ms 15632 KB Output is correct
48 Correct 111 ms 15452 KB Output is correct
49 Correct 107 ms 15636 KB Output is correct
50 Correct 103 ms 15652 KB Output is correct
51 Correct 152 ms 15644 KB Output is correct
52 Correct 114 ms 15632 KB Output is correct
53 Correct 111 ms 15628 KB Output is correct
54 Correct 108 ms 15448 KB Output is correct
55 Execution timed out 2016 ms 27424 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15452 KB Output is correct
2 Correct 9 ms 15452 KB Output is correct
3 Correct 11 ms 15452 KB Output is correct
4 Correct 11 ms 15448 KB Output is correct
5 Correct 12 ms 15708 KB Output is correct
6 Correct 10 ms 15640 KB Output is correct
7 Correct 10 ms 15452 KB Output is correct
8 Correct 10 ms 15504 KB Output is correct
9 Correct 11 ms 15452 KB Output is correct
10 Correct 11 ms 15512 KB Output is correct
11 Correct 10 ms 15452 KB Output is correct
12 Correct 11 ms 15380 KB Output is correct
13 Correct 11 ms 15500 KB Output is correct
14 Correct 11 ms 15448 KB Output is correct
15 Correct 11 ms 15452 KB Output is correct
16 Correct 11 ms 15452 KB Output is correct
17 Correct 11 ms 15452 KB Output is correct
18 Correct 12 ms 15480 KB Output is correct
19 Correct 11 ms 15452 KB Output is correct
20 Correct 12 ms 15448 KB Output is correct
21 Correct 10 ms 15448 KB Output is correct
22 Correct 11 ms 15452 KB Output is correct
23 Correct 11 ms 15452 KB Output is correct
24 Correct 11 ms 15492 KB Output is correct
25 Correct 10 ms 15452 KB Output is correct
26 Correct 16 ms 15448 KB Output is correct
27 Correct 14 ms 15296 KB Output is correct
28 Correct 16 ms 15452 KB Output is correct
29 Correct 52 ms 15452 KB Output is correct
30 Correct 99 ms 15620 KB Output is correct
31 Correct 125 ms 15452 KB Output is correct
32 Correct 122 ms 15636 KB Output is correct
33 Correct 125 ms 15628 KB Output is correct
34 Correct 106 ms 15636 KB Output is correct
35 Correct 106 ms 15704 KB Output is correct
36 Correct 109 ms 15632 KB Output is correct
37 Correct 101 ms 15448 KB Output is correct
38 Correct 100 ms 15452 KB Output is correct
39 Correct 126 ms 15636 KB Output is correct
40 Correct 118 ms 15452 KB Output is correct
41 Correct 105 ms 15448 KB Output is correct
42 Correct 103 ms 15652 KB Output is correct
43 Correct 146 ms 15452 KB Output is correct
44 Correct 147 ms 15636 KB Output is correct
45 Correct 136 ms 15448 KB Output is correct
46 Correct 126 ms 15448 KB Output is correct
47 Correct 109 ms 15632 KB Output is correct
48 Correct 111 ms 15452 KB Output is correct
49 Correct 107 ms 15636 KB Output is correct
50 Correct 103 ms 15652 KB Output is correct
51 Correct 152 ms 15644 KB Output is correct
52 Correct 114 ms 15632 KB Output is correct
53 Correct 111 ms 15628 KB Output is correct
54 Correct 108 ms 15448 KB Output is correct
55 Correct 241 ms 28132 KB Output is correct
56 Correct 269 ms 28416 KB Output is correct
57 Correct 275 ms 28248 KB Output is correct
58 Correct 216 ms 28400 KB Output is correct
59 Correct 226 ms 27124 KB Output is correct
60 Correct 213 ms 27384 KB Output is correct
61 Correct 215 ms 27644 KB Output is correct
62 Correct 224 ms 28916 KB Output is correct
63 Correct 215 ms 28356 KB Output is correct
64 Correct 219 ms 28680 KB Output is correct
65 Correct 207 ms 27548 KB Output is correct
66 Correct 217 ms 27132 KB Output is correct
67 Correct 222 ms 27392 KB Output is correct
68 Correct 218 ms 28156 KB Output is correct
69 Correct 1052 ms 27900 KB Output is correct
70 Correct 1048 ms 28696 KB Output is correct
71 Correct 1014 ms 28804 KB Output is correct
72 Correct 1046 ms 28044 KB Output is correct
73 Correct 1047 ms 28148 KB Output is correct
74 Correct 1181 ms 28028 KB Output is correct
75 Correct 1205 ms 27796 KB Output is correct
76 Correct 1086 ms 27444 KB Output is correct
77 Correct 1090 ms 28100 KB Output is correct
78 Correct 1042 ms 28676 KB Output is correct
79 Correct 1064 ms 27920 KB Output is correct
80 Correct 1113 ms 28428 KB Output is correct
81 Correct 1088 ms 28336 KB Output is correct
82 Correct 1095 ms 29156 KB Output is correct
83 Execution timed out 2016 ms 27424 KB Time limit exceeded
84 Halted 0 ms 0 KB -