oj.uz

Submission #1093650

# Submission time Handle Problem Language Result Execution time Memory
1093650 2024-09-27T07:36:13 Z ntdaccode Joker (BOI20_joker) C++17
49 / 100
 2000 ms 13292 KB 
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int mod=1e9+7;
const int M=2e5+10;
const int N=1e3+10;
const int SIZE=448;
int n,m,q;
int x[M],y[M];
struct query
{
  int l,r,idx;
}Q[M];
int ret[M];
// dsu
int id[M];
bool dd[M],lz[M];
#define tp tuple<int,int,int,int>
stack<tp> sk;
stack<tp> ks;
int finded(int u,bool &v)
{
  v^=lz[u];
  return id[u] < 0 ? u : finded(id[u],v);
}
bool unioned(int tt ,int u,int v)
{
  bool pos=0,pos2=0;
  u=finded(u,pos);
  v=finded(v,pos2);

  if(u==v)
  {
    if(pos==pos2) return true;
    return false;
  }
  if(id[u]>id[v]) swap(u,v);
  if(tt!=0)
  {
  sk.push({tt,id[u],id[v],pos==pos2});
  ks.push({tt,u,v,pos==pos2});
  }
  if(pos==pos2) lz[v]^=1;
  id[u]+=id[v];
  id[v]=u;
  return false;
}
int32_t main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  #define task "1"
  if(fopen(task".inp","r"))
  {
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);
  }
  cin >> n >> m >> q;
  fori(i,1,m) cin >> x[i] >> y[i];
  fori(i,1,q)
  {
    cin >> Q[i].l >> Q[i].r ;
    Q[i].idx=i;
  }
  sort(Q+1,Q+q+1,[&] (const query a,const query b)
       {
         if(a.l/SIZE==b.l/SIZE) return a.r> b.r;
         return  a.l<b.l;
       });
  memset(id,-1,sizeof(id));
  int r=m;
  bool ok=0;
  bool okk=0;
  fori(i,1,q)
  {
   // cout << Q[i].l << " " << Q[i].r << "ds\n";
    if(Q[i-1].l/SIZE!=Q[i].l/SIZE)
    {
      while(!sk.empty())
      {
        auto[tt,idu,idv,dog] = sk.top();
        auto[tt2,u,v,cho] = ks.top();
        sk.pop();
        ks.pop();
        lz[v]^=dog;
        id[u]=idu;
        id[v]=idv;
      }
      okk=0;
      fori(j,max(1,(Q[i-1].l/SIZE)*SIZE),min(m,(Q[i].l/SIZE)*SIZE-1)) if(unioned(0,x[j],y[j])) ok=1;
      //fori(i,1,n) cout << lz[i] << " " << id[i] << "\n";
      //cout << Q[i].l << " " << Q[i].r << " " << max(1ll,(Q[i-1].l/SIZE)*SIZE) << " " <<min(m,(Q[i].l/SIZE)*SIZE-1) << "\n";
      r=m;
    }
    //if(Q[i].l==9) cout << sk.size() << " ";
    while(Q[i].r<r&&r/SIZE!=Q[i].l/SIZE)
    {
      if(x[r]==y[r]) continue;
      if(unioned(1,x[r],y[r])) okk=1;
      //if(Q[i].l==7) cout << r << " ";
      r--;
    }
    //if(Q[i].l==2&&Q[i].r==6) cout << r << " ";
    if(ok||okk) ret[Q[i].idx]=1;
    else
    {
      bool ook=0;
      //cout << (Q[i].l/SIZE)*SIZE <<  " " << r << "\n";
      fori(j,max(1,(Q[i].l/SIZE)*SIZE),Q[i].l-1)
      {
        if(x[j]==y[j]) continue;
        if(unioned(2,x[j],y[j])) ook=1;
      }
      fori(j,Q[i].r+1,r)
      {
        if(x[j]==y[j]) continue;
        if(unioned(2,x[j],y[j])) ook=1;
      }
      while(!sk.empty())
      {
        auto[tt,idu,idv,cho] = sk.top();
        auto[tt2,u,v,dog] = ks.top();
        if(tt!=2) break;
        sk.pop();
        ks.pop();
        lz[v]^=dog;
        id[u]=idu;
        id[v]=idv;
      }

      if(ook) ret[Q[i].idx]=1;
    }

  }
  fori(i,1,q)
  {
    if(ret[i]) cout << "YES\n";
    else cout << "NO\n";
  }
}

Compilation message

Joker.cpp: In function 'int32_t main()':
Joker.cpp:61:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |     freopen(task".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:62:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |     freopen(task".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1276 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1192 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1276 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1192 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 19 ms 1336 KB Output is correct
30 Correct 7 ms 1356 KB Output is correct
31 Correct 5 ms 1192 KB Output is correct
32 Correct 4 ms 1116 KB Output is correct
33 Correct 3 ms 1116 KB Output is correct
34 Correct 5 ms 1328 KB Output is correct
35 Correct 6 ms 1116 KB Output is correct
36 Correct 5 ms 1116 KB Output is correct
37 Correct 11 ms 1380 KB Output is correct
38 Correct 17 ms 1376 KB Output is correct
39 Correct 7 ms 1116 KB Output is correct
40 Correct 5 ms 1116 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 5 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 2 ms 1116 KB Output is correct
45 Correct 2 ms 1372 KB Output is correct
46 Correct 2 ms 1372 KB Output is correct
47 Correct 5 ms 1340 KB Output is correct
48 Correct 5 ms 1116 KB Output is correct
49 Correct 5 ms 1344 KB Output is correct
50 Correct 8 ms 1116 KB Output is correct
51 Correct 5 ms 1116 KB Output is correct
52 Correct 5 ms 1340 KB Output is correct
53 Correct 6 ms 1116 KB Output is correct
54 Correct 6 ms 1372 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 61 ms 9812 KB Output is correct
4 Correct 1233 ms 12424 KB Output is correct
5 Correct 70 ms 12484 KB Output is correct
6 Correct 69 ms 9808 KB Output is correct
7 Correct 70 ms 9812 KB Output is correct
8 Correct 60 ms 8532 KB Output is correct
9 Correct 62 ms 9808 KB Output is correct
10 Correct 64 ms 12172 KB Output is correct
11 Correct 63 ms 9696 KB Output is correct
12 Correct 68 ms 11864 KB Output is correct
13 Correct 59 ms 7000 KB Output is correct
14 Correct 61 ms 8532 KB Output is correct
15 Correct 65 ms 10936 KB Output is correct
16 Correct 67 ms 12248 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1276 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1192 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 61 ms 9812 KB Output is correct
30 Correct 1233 ms 12424 KB Output is correct
31 Correct 70 ms 12484 KB Output is correct
32 Correct 69 ms 9808 KB Output is correct
33 Correct 70 ms 9812 KB Output is correct
34 Correct 60 ms 8532 KB Output is correct
35 Correct 62 ms 9808 KB Output is correct
36 Correct 64 ms 12172 KB Output is correct
37 Correct 63 ms 9696 KB Output is correct
38 Correct 68 ms 11864 KB Output is correct
39 Correct 59 ms 7000 KB Output is correct
40 Correct 61 ms 8532 KB Output is correct
41 Correct 65 ms 10936 KB Output is correct
42 Correct 67 ms 12248 KB Output is correct
43 Correct 398 ms 9860 KB Output is correct
44 Correct 1376 ms 12428 KB Output is correct
45 Correct 425 ms 13292 KB Output is correct
46 Correct 408 ms 10064 KB Output is correct
47 Correct 394 ms 9812 KB Output is correct
48 Correct 126 ms 9812 KB Output is correct
49 Correct 172 ms 12372 KB Output is correct
50 Correct 250 ms 9220 KB Output is correct
51 Correct 352 ms 10832 KB Output is correct
52 Correct 388 ms 12040 KB Output is correct
53 Correct 195 ms 7248 KB Output is correct
54 Correct 441 ms 9044 KB Output is correct
55 Correct 504 ms 10884 KB Output is correct
56 Correct 525 ms 12200 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1276 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1192 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 19 ms 1336 KB Output is correct
30 Correct 7 ms 1356 KB Output is correct
31 Correct 5 ms 1192 KB Output is correct
32 Correct 4 ms 1116 KB Output is correct
33 Correct 3 ms 1116 KB Output is correct
34 Correct 5 ms 1328 KB Output is correct
35 Correct 6 ms 1116 KB Output is correct
36 Correct 5 ms 1116 KB Output is correct
37 Correct 11 ms 1380 KB Output is correct
38 Correct 17 ms 1376 KB Output is correct
39 Correct 7 ms 1116 KB Output is correct
40 Correct 5 ms 1116 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 5 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 2 ms 1116 KB Output is correct
45 Correct 2 ms 1372 KB Output is correct
46 Correct 2 ms 1372 KB Output is correct
47 Correct 5 ms 1340 KB Output is correct
48 Correct 5 ms 1116 KB Output is correct
49 Correct 5 ms 1344 KB Output is correct
50 Correct 8 ms 1116 KB Output is correct
51 Correct 5 ms 1116 KB Output is correct
52 Correct 5 ms 1340 KB Output is correct
53 Correct 6 ms 1116 KB Output is correct
54 Correct 6 ms 1372 KB Output is correct
55 Correct 450 ms 6032 KB Output is correct
56 Correct 1637 ms 9556 KB Output is correct
57 Correct 752 ms 10868 KB Output is correct
58 Correct 659 ms 8536 KB Output is correct
59 Correct 1671 ms 8352 KB Output is correct
60 Execution timed out 2064 ms 10220 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1276 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1192 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 19 ms 1336 KB Output is correct
30 Correct 7 ms 1356 KB Output is correct
31 Correct 5 ms 1192 KB Output is correct
32 Correct 4 ms 1116 KB Output is correct
33 Correct 3 ms 1116 KB Output is correct
34 Correct 5 ms 1328 KB Output is correct
35 Correct 6 ms 1116 KB Output is correct
36 Correct 5 ms 1116 KB Output is correct
37 Correct 11 ms 1380 KB Output is correct
38 Correct 17 ms 1376 KB Output is correct
39 Correct 7 ms 1116 KB Output is correct
40 Correct 5 ms 1116 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 5 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 2 ms 1116 KB Output is correct
45 Correct 2 ms 1372 KB Output is correct
46 Correct 2 ms 1372 KB Output is correct
47 Correct 5 ms 1340 KB Output is correct
48 Correct 5 ms 1116 KB Output is correct
49 Correct 5 ms 1344 KB Output is correct
50 Correct 8 ms 1116 KB Output is correct
51 Correct 5 ms 1116 KB Output is correct
52 Correct 5 ms 1340 KB Output is correct
53 Correct 6 ms 1116 KB Output is correct
54 Correct 6 ms 1372 KB Output is correct
55 Correct 61 ms 9812 KB Output is correct
56 Correct 1233 ms 12424 KB Output is correct
57 Correct 70 ms 12484 KB Output is correct
58 Correct 69 ms 9808 KB Output is correct
59 Correct 70 ms 9812 KB Output is correct
60 Correct 60 ms 8532 KB Output is correct
61 Correct 62 ms 9808 KB Output is correct
62 Correct 64 ms 12172 KB Output is correct
63 Correct 63 ms 9696 KB Output is correct
64 Correct 68 ms 11864 KB Output is correct
65 Correct 59 ms 7000 KB Output is correct
66 Correct 61 ms 8532 KB Output is correct
67 Correct 65 ms 10936 KB Output is correct
68 Correct 67 ms 12248 KB Output is correct
69 Correct 398 ms 9860 KB Output is correct
70 Correct 1376 ms 12428 KB Output is correct
71 Correct 425 ms 13292 KB Output is correct
72 Correct 408 ms 10064 KB Output is correct
73 Correct 394 ms 9812 KB Output is correct
74 Correct 126 ms 9812 KB Output is correct
75 Correct 172 ms 12372 KB Output is correct
76 Correct 250 ms 9220 KB Output is correct
77 Correct 352 ms 10832 KB Output is correct
78 Correct 388 ms 12040 KB Output is correct
79 Correct 195 ms 7248 KB Output is correct
80 Correct 441 ms 9044 KB Output is correct
81 Correct 504 ms 10884 KB Output is correct
82 Correct 525 ms 12200 KB Output is correct
83 Correct 450 ms 6032 KB Output is correct
84 Correct 1637 ms 9556 KB Output is correct
85 Correct 752 ms 10868 KB Output is correct
86 Correct 659 ms 8536 KB Output is correct
87 Correct 1671 ms 8352 KB Output is correct
88 Execution timed out 2064 ms 10220 KB Time limit exceeded
89 Halted 0 ms 0 KB -