oj.uz

Submission #389639

# Submission time Handle Problem Language Result Execution time Memory
389639 2021-04-14T10:27:32 Z i_am_noob Permutation Recovery (info1cup17_permutation) C++17
100 / 100
 3893 ms 194160 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

#define ll long long
//#define int ll
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<(b); ++i)
#define rep3(i,a,b) for(int i=a; i>=(b); --i)
#define pb push_back
#define pii pair<int,int>
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pow2(x) (1ll<<(x))
#define inf 0x3f3f3f3f3f3f3f3f

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << " " << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T x){cerr << x << endl;}
template<typename T, typename ...S> void _do(T x, S... y){cerr << x << ", ";_do(y...);}
#else
#define bug(...) 49
#endif

const int maxn=70005,mod=1000000007;

#define num vector<int>
int n,val[maxn*4],minid[maxn*4],ans[maxn];
num a[maxn],minn[maxn*4],tag[maxn*4];

void noob(num& x){
    if(x.empty()){
        x.pb(0);
        return;
    }
    rep(sz(x)-1){
        if(x[i]>=100000000) x[i]-=100000000,x[i+1]++;
        if(x[i]<0) x[i]+=100000000,x[i+1]--;
    }
    while(x.back()>=100000000||x.back()<=-100000000){
        x.pb(0);
        while(x[sz(x)-2]>=100000000) x[sz(x)-2]-=100000000,x.back()++;
        while(x[sz(x)-2]<0) x[sz(x)-2]+=100000000,x.back()--;
    }
    while(sz(x)>1&&x.back()==0) x.pop_back();
}

void ri(num& x){
    x.clear();
    string str;
    cin >> str;
    reverse(all(str));
    while(sz(str)%8) str+='0';
    for(int i=0; i<sz(str); i+=8){
        x.pb(0);
        rep3(j,i+7,i) x.back()=x.back()*10+(str[j]^'0');
    }
}

num operator +(const num& x, const num& y){
    int k=max(sz(x),sz(y));
    num res(k);
    rep(sz(x)) res[i]+=x[i];
    rep(sz(y)) res[i]+=y[i];
    noob(res);
    return res;
}

num operator -(const num& x, const num& y){
    int k=max(sz(x),sz(y));
    num res(k);
    rep(sz(x)) res[i]+=x[i];
    rep(sz(y)) res[i]-=y[i];
    noob(res);
    return res;
}

num operator +=(num& x, const num& y){
    int k=max(sz(x),sz(y));
    x.resize(k);
    rep(sz(y)) x[i]+=y[i];
    noob(x);
    return x;
}

bool operator <(const num& x, const num& y){
    if(x.back()<0&&y.back()>=0) return true;
    if(y.back()<0&&x.back()>=0) return false;
    bool flag=0;
    if(x.back()<0) flag=1;
    if(sz(x)<sz(y)) return 1^flag;
    if(sz(y)<sz(x)) return flag;
    rep3(i,sz(x)-1,0){
        if(x[i]<y[i]) return true;
        if(x[i]>y[i]) return false;
    }
    return false;
}

void pull(int k){
    val[k]=val[k<<1]+val[k<<1|1];
    if(!val[k<<1]) return minn[k]=minn[k<<1|1],minid[k]=minid[k<<1|1],void();
    if(!val[k<<1|1]) return minn[k]=minn[k<<1],minid[k]=minid[k<<1],void();
    if(minn[k<<1]<minn[k<<1|1]) minn[k]=minn[k<<1],minid[k]=minid[k<<1];
    else minn[k]=minn[k<<1|1],minid[k]=minid[k<<1|1];
}

void push(int k, int l, int r){
    if(l!=r){
        minn[k<<1]+=tag[k];
        minn[k<<1|1]+=tag[k];
        tag[k<<1]+=tag[k];
        tag[k<<1|1]+=tag[k];
    }
    tag[k]=num(1);
}

void build(int k, int l, int r){
    if(l==r){
        minn[k]=a[l];
        minid[k]=l;
        val[k]=1;
        return;
    }
    int mid=l+r>>1;
    build(k<<1,l,mid),build(k<<1|1,mid+1,r);
    pull(k);
}

void modify(int k, int l, int r, int ql, int qr, num& x){
    if(l>qr||r<ql) return;
    if(ql<=l&&qr>=r){
        minn[k]+=x,tag[k]+=x;
        return;
    }
    int mid=l+r>>1;
    push(k,l,r);
    modify(k<<1,l,mid,ql,qr,x),modify(k<<1|1,mid+1,r,ql,qr,x);
    pull(k);
}

void modify2(int k, int l, int r, int p){
    if(l==r){
        val[k]--;
        return;
    }
    int mid=l+r>>1;
    push(k,l,r);
    if(p<=mid) modify2(k<<1,l,mid,p);
    else modify2(k<<1|1,mid+1,r,p);
    pull(k);
}

void print(int k, int l, int r){
    bug(k,l,r,minid[k]);
    for(auto i: minn[k]) bug(i);
    if(l==r) return;
    push(k,l,r);
    int mid=l+r>>1;
    print(k<<1,l,mid),print(k<<1|1,mid+1,r);
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n;
    rep(n) ri(a[i]);
    rep(n) for(auto j: a[i]) bug(i,j);
    rep3(i,n-1,1) a[i]=a[i]-a[i-1];
    rep(n) for(auto j: a[i]) bug(i,j);
    build(1,0,n-1);
    rep(n){
        int x=minid[1];
        ans[x]=i+1;
        bug(x);
        modify2(1,0,n-1,x);
        num tmp(1);
        tmp=tmp-a[x];
        modify(1,0,n-1,x+1,n-1,tmp);
    }
    rep(n) cout << ans[i] << ' ';
    cout << "\n";
}

Compilation message

permutation.cpp: In function 'void build(int, int, int)':
permutation.cpp:127:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  127 |     int mid=l+r>>1;
      |             ~^~
permutation.cpp: In function 'void modify(int, int, int, int, int, std::vector<int>&)':
permutation.cpp:138:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  138 |     int mid=l+r>>1;
      |             ~^~
permutation.cpp: In function 'void modify2(int, int, int, int)':
permutation.cpp:149:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  149 |     int mid=l+r>>1;
      |             ~^~
permutation.cpp: In function 'void print(int, int, int)':
permutation.cpp:24:18: warning: statement has no effect [-Wunused-value]
   24 | #define bug(...) 49
      |                  ^~
permutation.cpp:157:5: note: in expansion of macro 'bug'
  157 |     bug(k,l,r,minid[k]);
      |     ^~~
permutation.cpp:24:18: warning: statement has no effect [-Wunused-value]
   24 | #define bug(...) 49
      |                  ^~
permutation.cpp:158:26: note: in expansion of macro 'bug'
  158 |     for(auto i: minn[k]) bug(i);
      |                          ^~~
permutation.cpp:158:14: warning: unused variable 'i' [-Wunused-variable]
  158 |     for(auto i: minn[k]) bug(i);
      |              ^
permutation.cpp:161:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  161 |     int mid=l+r>>1;
      |             ~^~
permutation.cpp: In function 'int main()':
permutation.cpp:24:18: warning: statement has no effect [-Wunused-value]
   24 | #define bug(...) 49
      |                  ^~
permutation.cpp:169:30: note: in expansion of macro 'bug'
  169 |     rep(n) for(auto j: a[i]) bug(i,j);
      |                              ^~~
permutation.cpp:169:21: warning: unused variable 'j' [-Wunused-variable]
  169 |     rep(n) for(auto j: a[i]) bug(i,j);
      |                     ^
permutation.cpp:24:18: warning: statement has no effect [-Wunused-value]
   24 | #define bug(...) 49
      |                  ^~
permutation.cpp:171:30: note: in expansion of macro 'bug'
  171 |     rep(n) for(auto j: a[i]) bug(i,j);
      |                              ^~~
permutation.cpp:171:21: warning: unused variable 'j' [-Wunused-variable]
  171 |     rep(n) for(auto j: a[i]) bug(i,j);
      |                     ^
permutation.cpp:24:18: warning: statement has no effect [-Wunused-value]
   24 | #define bug(...) 49
      |                  ^~
permutation.cpp:176:9: note: in expansion of macro 'bug'
  176 |         bug(x);
      |         ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct
3 Correct 15 ms 15308 KB Output is correct
4 Correct 15 ms 15240 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct
3 Correct 15 ms 15308 KB Output is correct
4 Correct 15 ms 15240 KB Output is correct
5 Correct 745 ms 31044 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct
3 Correct 15 ms 15308 KB Output is correct
4 Correct 15 ms 15240 KB Output is correct
5 Correct 745 ms 31044 KB Output is correct
6 Correct 1574 ms 47608 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct
3 Correct 15 ms 15308 KB Output is correct
4 Correct 15 ms 15240 KB Output is correct
5 Correct 745 ms 31044 KB Output is correct
6 Correct 1574 ms 47608 KB Output is correct
7 Correct 1477 ms 51100 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct
3 Correct 15 ms 15308 KB Output is correct
4 Correct 15 ms 15240 KB Output is correct
5 Correct 745 ms 31044 KB Output is correct
6 Correct 1574 ms 47608 KB Output is correct
7 Correct 1477 ms 51100 KB Output is correct
8 Correct 2184 ms 160736 KB Output is correct
9 Correct 3044 ms 138624 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15052 KB Output is correct
2 Correct 12 ms 15180 KB Output is correct
3 Correct 15 ms 15308 KB Output is correct
4 Correct 15 ms 15240 KB Output is correct
5 Correct 745 ms 31044 KB Output is correct
6 Correct 1574 ms 47608 KB Output is correct
7 Correct 1477 ms 51100 KB Output is correct
8 Correct 2184 ms 160736 KB Output is correct
9 Correct 3044 ms 138624 KB Output is correct
10 Correct 3893 ms 194160 KB Output is correct