oj.uz

Submission #956483

# Submission time Handle Problem Language Result Execution time Memory
956483 2024-04-02T05:25:49 Z modwwe Osumnjičeni (COCI21_osumnjiceni) C++17
110 / 110
 516 ms 62396 KB 
#include<bits/stdc++.h>
#define int long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";

using namespace std;
void phongbeo();
mt19937 rd(chrono::high_resolution_clock::now().time_since_epoch().count    ());
const int mod2=1e9+7;
const int  mod1=998244353;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a,b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
int n,m,s2,s4,s3,sf,k,r,dem=0,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,l;
int  s,i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
//fin(task),fou(task);
#endif
    NHP
//modwwe
    phongbeo(),down
    //checktime
}
int t[1600001];
int lazy[1600001];
int st[18][200001];
ib a[2000001];
void ff(int x)
{
     for(int i=x*2;i<=x*2+1;i++)
     {
         t[i]+=lazy[x];
         lazy[i]+=lazy[x];
     }
     lazy[x]=0;
}
void upd(int node,int l,int r,int l1,int r1,int z)
{
     if(l>r1||r<l1) return;
      if(l>=l1&&r<=r1)
      {
          t[node]+=z;
           lazy[node]+=z;
         return;
      }
      int mid=l+r>>1;
       ff(node);
       upd(node<<1,l,mid,l1,r1,z);
       upd(node<<1|1,mid+1,r,l1,r1,z);
       t[node]=max(t[node<<1],t[node<<1|1]);
}
vector<int> v;
void phongbeo()
{
     cin>>n;
     l=0;
     for(int i=1;i<=n;i++)
        cin>>a[i].a>>a[i].b,v.pb(a[i].a),v.pb(a[i].b);
        sort(v.begin(),v.end());
        for(int i=1;i<=n;i++)
            a[i].a=lower_bound(v.begin(),v.end(),a[i].a)-v.begin()+1,
            a[i].b=lower_bound(v.begin(),v.end(),a[i].b)-v.begin()+1;
      for(int i=1;i<=n;i++)
      {
          while(t[1]<2&&l<=n)
          {l++;
          upd(1,1,n*2,a[l].a,a[l].b,1);
          }
          st[0][i]=l;
           upd(1,1,n*2,a[i].a,a[i].b,-1);
      }
for(int j=1;j<18;j++)
    for(int i=1;i<=n;i++)
    st[j][i]=st[j-1][st[j-1][i]];
cin>>m;
for(int i=1;i<=m;i++)
{
     cin>>l>>r;
     res=0;
      for(int j=17;j>=0;--j)
      {
          if(st[j][l]<=r&&st[j][l]!=0)
            res+=(1ll<<j),l=st[j][l];
      }
      cout<<res+1,down
}
}

Compilation message

Main.cpp:39:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   39 | main()
      | ^~~~
Main.cpp: In function 'void upd(long long int, long long int, long long int, long long int, long long int, long long int)':
Main.cpp:71:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |       int mid=l+r>>1;
      |               ~^~
Main.cpp: In function 'void phongbeo()':
Main.cpp:82:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   82 |      for(int i=1;i<=n;i++)
      |      ^~~
Main.cpp:84:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   84 |         sort(v.begin(),v.end());
      |         ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 59560 KB Output is correct
2 Correct 274 ms 58756 KB Output is correct
3 Correct 303 ms 58304 KB Output is correct
4 Correct 282 ms 58556 KB Output is correct
5 Correct 304 ms 59016 KB Output is correct
6 Correct 99 ms 48368 KB Output is correct
7 Correct 107 ms 48156 KB Output is correct
8 Correct 113 ms 48576 KB Output is correct
9 Correct 128 ms 54460 KB Output is correct
10 Correct 118 ms 54972 KB Output is correct
11 Correct 227 ms 58124 KB Output is correct
12 Correct 238 ms 58300 KB Output is correct
13 Correct 219 ms 57848 KB Output is correct
14 Correct 229 ms 58556 KB Output is correct
15 Correct 229 ms 57788 KB Output is correct
16 Correct 4 ms 26972 KB Output is correct
17 Correct 107 ms 48184 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 30044 KB Output is correct
2 Correct 10 ms 30020 KB Output is correct
3 Correct 10 ms 30068 KB Output is correct
4 Correct 11 ms 30044 KB Output is correct
5 Correct 10 ms 30044 KB Output is correct
6 Correct 7 ms 27680 KB Output is correct
7 Correct 7 ms 27484 KB Output is correct
8 Correct 7 ms 27740 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 27740 KB Output is correct
11 Correct 9 ms 30092 KB Output is correct
12 Correct 8 ms 30044 KB Output is correct
13 Correct 9 ms 30036 KB Output is correct
14 Correct 8 ms 30044 KB Output is correct
15 Correct 8 ms 30044 KB Output is correct
16 Correct 3 ms 26972 KB Output is correct
17 Correct 6 ms 27484 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 30044 KB Output is correct
2 Correct 10 ms 30020 KB Output is correct
3 Correct 10 ms 30068 KB Output is correct
4 Correct 11 ms 30044 KB Output is correct
5 Correct 10 ms 30044 KB Output is correct
6 Correct 7 ms 27680 KB Output is correct
7 Correct 7 ms 27484 KB Output is correct
8 Correct 7 ms 27740 KB Output is correct
9 Correct 7 ms 29788 KB Output is correct
10 Correct 7 ms 27740 KB Output is correct
11 Correct 9 ms 30092 KB Output is correct
12 Correct 8 ms 30044 KB Output is correct
13 Correct 9 ms 30036 KB Output is correct
14 Correct 8 ms 30044 KB Output is correct
15 Correct 8 ms 30044 KB Output is correct
16 Correct 3 ms 26972 KB Output is correct
17 Correct 6 ms 27484 KB Output is correct
18 Correct 72 ms 32696 KB Output is correct
19 Correct 62 ms 32296 KB Output is correct
20 Correct 69 ms 32592 KB Output is correct
21 Correct 66 ms 32592 KB Output is correct
22 Correct 79 ms 32592 KB Output is correct
23 Correct 61 ms 30036 KB Output is correct
24 Correct 64 ms 30292 KB Output is correct
25 Correct 64 ms 30288 KB Output is correct
26 Correct 63 ms 30220 KB Output is correct
27 Correct 58 ms 32040 KB Output is correct
28 Correct 42 ms 32084 KB Output is correct
29 Correct 45 ms 32228 KB Output is correct
30 Correct 46 ms 32484 KB Output is correct
31 Correct 47 ms 32084 KB Output is correct
32 Correct 46 ms 32084 KB Output is correct
33 Correct 3 ms 26972 KB Output is correct
34 Correct 45 ms 29992 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 59072 KB Output is correct
2 Correct 296 ms 59324 KB Output is correct
3 Correct 287 ms 58300 KB Output is correct
4 Correct 263 ms 59064 KB Output is correct
5 Correct 292 ms 58460 KB Output is correct
6 Correct 105 ms 47620 KB Output is correct
7 Correct 107 ms 48836 KB Output is correct
8 Correct 113 ms 53900 KB Output is correct
9 Correct 112 ms 54976 KB Output is correct
10 Correct 125 ms 54832 KB Output is correct
11 Correct 211 ms 58048 KB Output is correct
12 Correct 243 ms 58380 KB Output is correct
13 Correct 209 ms 57500 KB Output is correct
14 Correct 218 ms 58816 KB Output is correct
15 Correct 229 ms 58300 KB Output is correct
16 Correct 3 ms 26968 KB Output is correct
17 Correct 104 ms 48108 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 59560 KB Output is correct
2 Correct 274 ms 58756 KB Output is correct
3 Correct 303 ms 58304 KB Output is correct
4 Correct 282 ms 58556 KB Output is correct
5 Correct 304 ms 59016 KB Output is correct
6 Correct 99 ms 48368 KB Output is correct
7 Correct 107 ms 48156 KB Output is correct
8 Correct 113 ms 48576 KB Output is correct
9 Correct 128 ms 54460 KB Output is correct
10 Correct 118 ms 54972 KB Output is correct
11 Correct 227 ms 58124 KB Output is correct
12 Correct 238 ms 58300 KB Output is correct
13 Correct 219 ms 57848 KB Output is correct
14 Correct 229 ms 58556 KB Output is correct
15 Correct 229 ms 57788 KB Output is correct
16 Correct 4 ms 26972 KB Output is correct
17 Correct 107 ms 48184 KB Output is correct
18 Correct 13 ms 30044 KB Output is correct
19 Correct 10 ms 30020 KB Output is correct
20 Correct 10 ms 30068 KB Output is correct
21 Correct 11 ms 30044 KB Output is correct
22 Correct 10 ms 30044 KB Output is correct
23 Correct 7 ms 27680 KB Output is correct
24 Correct 7 ms 27484 KB Output is correct
25 Correct 7 ms 27740 KB Output is correct
26 Correct 7 ms 29788 KB Output is correct
27 Correct 7 ms 27740 KB Output is correct
28 Correct 9 ms 30092 KB Output is correct
29 Correct 8 ms 30044 KB Output is correct
30 Correct 9 ms 30036 KB Output is correct
31 Correct 8 ms 30044 KB Output is correct
32 Correct 8 ms 30044 KB Output is correct
33 Correct 3 ms 26972 KB Output is correct
34 Correct 6 ms 27484 KB Output is correct
35 Correct 72 ms 32696 KB Output is correct
36 Correct 62 ms 32296 KB Output is correct
37 Correct 69 ms 32592 KB Output is correct
38 Correct 66 ms 32592 KB Output is correct
39 Correct 79 ms 32592 KB Output is correct
40 Correct 61 ms 30036 KB Output is correct
41 Correct 64 ms 30292 KB Output is correct
42 Correct 64 ms 30288 KB Output is correct
43 Correct 63 ms 30220 KB Output is correct
44 Correct 58 ms 32040 KB Output is correct
45 Correct 42 ms 32084 KB Output is correct
46 Correct 45 ms 32228 KB Output is correct
47 Correct 46 ms 32484 KB Output is correct
48 Correct 47 ms 32084 KB Output is correct
49 Correct 46 ms 32084 KB Output is correct
50 Correct 3 ms 26972 KB Output is correct
51 Correct 45 ms 29992 KB Output is correct
52 Correct 308 ms 59072 KB Output is correct
53 Correct 296 ms 59324 KB Output is correct
54 Correct 287 ms 58300 KB Output is correct
55 Correct 263 ms 59064 KB Output is correct
56 Correct 292 ms 58460 KB Output is correct
57 Correct 105 ms 47620 KB Output is correct
58 Correct 107 ms 48836 KB Output is correct
59 Correct 113 ms 53900 KB Output is correct
60 Correct 112 ms 54976 KB Output is correct
61 Correct 125 ms 54832 KB Output is correct
62 Correct 211 ms 58048 KB Output is correct
63 Correct 243 ms 58380 KB Output is correct
64 Correct 209 ms 57500 KB Output is correct
65 Correct 218 ms 58816 KB Output is correct
66 Correct 229 ms 58300 KB Output is correct
67 Correct 3 ms 26968 KB Output is correct
68 Correct 104 ms 48108 KB Output is correct
69 Correct 491 ms 62396 KB Output is correct
70 Correct 516 ms 62396 KB Output is correct
71 Correct 471 ms 61416 KB Output is correct
72 Correct 505 ms 61876 KB Output is correct
73 Correct 491 ms 61780 KB Output is correct
74 Correct 383 ms 52424 KB Output is correct
75 Correct 313 ms 55488 KB Output is correct
76 Correct 352 ms 52504 KB Output is correct
77 Correct 337 ms 57520 KB Output is correct
78 Correct 340 ms 58348 KB Output is correct
79 Correct 318 ms 61120 KB Output is correct
80 Correct 300 ms 60728 KB Output is correct
81 Correct 288 ms 60384 KB Output is correct
82 Correct 314 ms 60860 KB Output is correct
83 Correct 293 ms 61384 KB Output is correct
84 Correct 3 ms 26968 KB Output is correct
85 Correct 165 ms 52768 KB Output is correct