oj.uz

Submission #1013352

# Submission time Handle Problem Language Result Execution time Memory
1013352 2024-07-03T12:47:27 Z PCTprobability Abracadabra (CEOI22_abracadabra) C++17
100 / 100
 1969 ms 76184 KB 
#include <bits/stdc++.h>
using namespace std;
/*#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif*/
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
#define die(a) {cout<<a<<endl;return 0;}
#define dier(a) {return a;}
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
struct segtree{
  vector<ll> node;
  ll n;
  segtree(ll _n){
    n=1;
    while(n<_n) n*=2;
    node.resize(2*n);
  }
  void set(ll i,ll v){
    i+=n;
    node[i]=v;
    while(i){
      i/=2;
      node[i]=node[2*i]+node[2*i+1];
    }
  }
  ll prod(ll l,ll r,ll a,ll b,ll k){
    if(r<=a||b<=l) return 0;
    if(l<=a&&b<=r) return node[k];
    return prod(l,r,a,(a+b)/2,2*k)+prod(l,r,(a+b)/2,b,2*k+1);
  }
  ll prod(ll l,ll r){
    return prod(l,r,0,n,1);
  }
};
struct segtreem{
  vector<P> node;
  ll n;
  segtreem(ll _n){
    n=1;
    while(n<_n) n*=2;
    node.resize(2*n);
    for(int i=0;i<n;i++) node[i+n]={inf,i};
    for(int i=n-1;i>=0;i--){
      node[i]=node[2*i];
    }
  }
  void set(ll i,ll v){
    i+=n;
    node[i].fi=v;
    while(i){
      i/=2;
      if(node[2*i].fi<node[2*i+1].fi) node[i]=node[2*i];
      else node[i]=node[2*i+1];
    }
  }
  P prod(ll l,ll r,ll a,ll b,ll k){
    if(r<=a||b<=l) return {inf,inf};
    if(l<=a&&b<=r) return node[k];
    P u=prod(l,r,a,(a+b)/2,2*k),v=prod(l,r,(a+b)/2,b,2*k+1);
    if(u.fi<v.fi) return u;
    else return v;
  }
  P prod(ll l,ll r){
    return prod(l,r,0,n,1);
  }
};
int main(){
  cincout();
  ll n,q;
  cin>>n>>q;
  n/=2;
  vector<ll> a(2*n);
  vcin(a);
  for(auto &e:a) e--;
  vector<vector<P>> t(2*n+1);
  for(int i=0;i<q;i++){
    ll tm,x;
    cin>>tm>>x;
    chmin(tm,2*n);
    t[tm].pb({x,i});
  }
  vector<ll> ans(q);
  vector<ll> rev(2*n);
  vector<ll> nx(2*n);
  segtreem sem(2*n);
  for(int i=2*n-1;i>=0;i--){
    nx[i]=sem.prod(a[i],2*n).fi;
    sem.set(a[i],i);
  }
  for(int i=0;i<2*n;i++) rev[a[i]]=i;
  ll now=1,id=0;
  segtree seg(2*n);
  for(int i=1;i<2*n;i++){
    if(a[id]<a[i]){
      seg.set(a[id],now);
      now=1;
      id=i;
    }
    else now++;
  }
  seg.set(a[id],now);
  for(int _=0;_<=2*n;_++){
    if(_){
      for(auto e:t[_]){
        ll sm=0;
        ll ok=2*n-1,ng=-1;
        while(abs(ok-ng)>1){
          ll mid=(ok+ng)/2;
          if(seg.prod(0,mid+1)>=e.fi) ok=mid;
          else ng=mid;
        }
        ans[e.se]=a[rev[ok]+e.fi-seg.prod(0,ok)-1]+1;
      }
    }
    else{
      for(auto e:t[_]){
        ans[e.se]=a[e.fi-1]+1;
      }
    }
    ll sm=0;
    ll ok=2*n-1,ng=-1;
    while(abs(ok-ng)>1){
      ll mid=(ok+ng)/2;
      if(seg.prod(0,mid+1)>=n) ok=mid;
      else ng=mid;
    }
    ll l=rev[ok]+n-seg.prod(0,ok),r=rev[ok]+seg.prod(ok,ok+1)-1;
    seg.set(ok,n-seg.prod(0,ok));
    if(l>r) continue;
    ll now=1,id=l;
    while(true){
      if(nx[id]>r){
        seg.set(a[id],r+1-id);
        break;
      }
      seg.set(a[id],nx[id]-id);
      id=nx[id];
    }
  }
  for(auto e:ans) cout<<e<<endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:173:12: warning: unused variable 'sm' [-Wunused-variable]
  173 |         ll sm=0;
      |            ^~
Main.cpp:188:8: warning: unused variable 'sm' [-Wunused-variable]
  188 |     ll sm=0;
      |        ^~
Main.cpp:198:8: warning: unused variable 'now' [-Wunused-variable]
  198 |     ll now=1,id=l;
      |        ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 31952 KB Output is correct
2 Correct 456 ms 30172 KB Output is correct
3 Correct 509 ms 29256 KB Output is correct
4 Correct 429 ms 27476 KB Output is correct
5 Correct 448 ms 32948 KB Output is correct
6 Correct 394 ms 31040 KB Output is correct
7 Correct 485 ms 34764 KB Output is correct
8 Correct 411 ms 29284 KB Output is correct
9 Correct 399 ms 28520 KB Output is correct
10 Correct 431 ms 28288 KB Output is correct
11 Correct 416 ms 28348 KB Output is correct
12 Correct 371 ms 26964 KB Output is correct
13 Correct 414 ms 27284 KB Output is correct
14 Correct 442 ms 30504 KB Output is correct
15 Correct 419 ms 28532 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 155 ms 27076 KB Output is correct
18 Correct 254 ms 27000 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1232 ms 51896 KB Output is correct
2 Correct 1186 ms 51892 KB Output is correct
3 Correct 1094 ms 45472 KB Output is correct
4 Correct 1083 ms 45488 KB Output is correct
5 Correct 1206 ms 46120 KB Output is correct
6 Correct 1016 ms 45492 KB Output is correct
7 Correct 1341 ms 52492 KB Output is correct
8 Correct 1258 ms 63068 KB Output is correct
9 Correct 1207 ms 58460 KB Output is correct
10 Correct 1206 ms 62256 KB Output is correct
11 Correct 1149 ms 56000 KB Output is correct
12 Correct 1097 ms 55164 KB Output is correct
13 Correct 1103 ms 61616 KB Output is correct
14 Correct 1139 ms 56016 KB Output is correct
15 Correct 1221 ms 64176 KB Output is correct
16 Correct 250 ms 23120 KB Output is correct
17 Correct 360 ms 60080 KB Output is correct
18 Correct 885 ms 53556 KB Output is correct
19 Correct 255 ms 30600 KB Output is correct
20 Correct 483 ms 31752 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 15184 KB Output is correct
2 Correct 270 ms 15220 KB Output is correct
3 Correct 264 ms 14952 KB Output is correct
4 Correct 232 ms 14928 KB Output is correct
5 Correct 259 ms 15184 KB Output is correct
6 Correct 210 ms 14884 KB Output is correct
7 Correct 242 ms 15440 KB Output is correct
8 Correct 247 ms 14932 KB Output is correct
9 Correct 214 ms 14932 KB Output is correct
10 Correct 192 ms 14672 KB Output is correct
11 Correct 203 ms 15184 KB Output is correct
12 Correct 196 ms 14928 KB Output is correct
13 Correct 209 ms 14676 KB Output is correct
14 Correct 211 ms 15064 KB Output is correct
15 Correct 228 ms 14872 KB Output is correct
16 Correct 122 ms 11092 KB Output is correct
17 Correct 118 ms 13768 KB Output is correct
18 Correct 148 ms 14024 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 31952 KB Output is correct
2 Correct 456 ms 30172 KB Output is correct
3 Correct 509 ms 29256 KB Output is correct
4 Correct 429 ms 27476 KB Output is correct
5 Correct 448 ms 32948 KB Output is correct
6 Correct 394 ms 31040 KB Output is correct
7 Correct 485 ms 34764 KB Output is correct
8 Correct 411 ms 29284 KB Output is correct
9 Correct 399 ms 28520 KB Output is correct
10 Correct 431 ms 28288 KB Output is correct
11 Correct 416 ms 28348 KB Output is correct
12 Correct 371 ms 26964 KB Output is correct
13 Correct 414 ms 27284 KB Output is correct
14 Correct 442 ms 30504 KB Output is correct
15 Correct 419 ms 28532 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 155 ms 27076 KB Output is correct
18 Correct 254 ms 27000 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1232 ms 51896 KB Output is correct
22 Correct 1186 ms 51892 KB Output is correct
23 Correct 1094 ms 45472 KB Output is correct
24 Correct 1083 ms 45488 KB Output is correct
25 Correct 1206 ms 46120 KB Output is correct
26 Correct 1016 ms 45492 KB Output is correct
27 Correct 1341 ms 52492 KB Output is correct
28 Correct 1258 ms 63068 KB Output is correct
29 Correct 1207 ms 58460 KB Output is correct
30 Correct 1206 ms 62256 KB Output is correct
31 Correct 1149 ms 56000 KB Output is correct
32 Correct 1097 ms 55164 KB Output is correct
33 Correct 1103 ms 61616 KB Output is correct
34 Correct 1139 ms 56016 KB Output is correct
35 Correct 1221 ms 64176 KB Output is correct
36 Correct 250 ms 23120 KB Output is correct
37 Correct 360 ms 60080 KB Output is correct
38 Correct 885 ms 53556 KB Output is correct
39 Correct 255 ms 30600 KB Output is correct
40 Correct 483 ms 31752 KB Output is correct
41 Correct 254 ms 15184 KB Output is correct
42 Correct 270 ms 15220 KB Output is correct
43 Correct 264 ms 14952 KB Output is correct
44 Correct 232 ms 14928 KB Output is correct
45 Correct 259 ms 15184 KB Output is correct
46 Correct 210 ms 14884 KB Output is correct
47 Correct 242 ms 15440 KB Output is correct
48 Correct 247 ms 14932 KB Output is correct
49 Correct 214 ms 14932 KB Output is correct
50 Correct 192 ms 14672 KB Output is correct
51 Correct 203 ms 15184 KB Output is correct
52 Correct 196 ms 14928 KB Output is correct
53 Correct 209 ms 14676 KB Output is correct
54 Correct 211 ms 15064 KB Output is correct
55 Correct 228 ms 14872 KB Output is correct
56 Correct 122 ms 11092 KB Output is correct
57 Correct 118 ms 13768 KB Output is correct
58 Correct 148 ms 14024 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1683 ms 76136 KB Output is correct
62 Correct 1969 ms 75612 KB Output is correct
63 Correct 1784 ms 73156 KB Output is correct
64 Correct 1368 ms 73480 KB Output is correct
65 Correct 1433 ms 76184 KB Output is correct
66 Correct 1466 ms 73308 KB Output is correct
67 Correct 1425 ms 72660 KB Output is correct
68 Correct 1417 ms 70148 KB Output is correct
69 Correct 1504 ms 74192 KB Output is correct
70 Correct 1416 ms 67568 KB Output is correct
71 Correct 1366 ms 70372 KB Output is correct
72 Correct 1313 ms 68560 KB Output is correct
73 Correct 1293 ms 69588 KB Output is correct
74 Correct 1373 ms 72968 KB Output is correct
75 Correct 1458 ms 69716 KB Output is correct
76 Correct 245 ms 23352 KB Output is correct
77 Correct 377 ms 61364 KB Output is correct
78 Correct 782 ms 59808 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct