oj.uz

Submission #321827

# Submission time Handle Problem Language Result Execution time Memory
321827 2020-11-13T12:20:22 Z AmineWeslati Editor (BOI15_edi) C++14
100 / 100
 324 ms 110060 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 3e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

const int LOG=22;
int ans[MX],anc[MX][LOG],mn[MX][LOG];

int32_t main() {
    boost; IO();

    int N; cin>>N;

    ans[0]=0;
    FOR(i,1,N+1){
        int x; cin>>x;
        if(x>0){
            ans[i]=x;
            anc[i][0]=i;
        }
        else{
            x=-x;
            int cur=i-1;
            ROF(j,0,LOG) if(mn[cur][j]>=x) cur=anc[cur][j];
            ans[i]=ans[cur-1];
            anc[i][0]=cur-1;
            mn[i][0]=x;
            FOR(j,1,LOG){
                anc[i][j]=anc[anc[i][j-1]][j-1];
                mn[i][j]=min(mn[anc[i][j-1]][j-1],mn[i][j-1]);
            }
        }
    }
    
    FOR(i,1,N+1) cout << ans[i] << endl;
    

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 1772 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 5 ms 2156 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 4 ms 2156 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 2156 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 109592 KB Output is correct
2 Correct 147 ms 109420 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 42240 KB Output is correct
2 Correct 83 ms 50412 KB Output is correct
3 Correct 256 ms 87020 KB Output is correct
4 Correct 142 ms 109420 KB Output is correct
5 Correct 146 ms 110060 KB Output is correct
6 Correct 195 ms 107500 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 1772 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 5 ms 2156 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 4 ms 2156 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 2156 KB Output is correct
10 Correct 144 ms 109592 KB Output is correct
11 Correct 147 ms 109420 KB Output is correct
12 Correct 62 ms 42240 KB Output is correct
13 Correct 83 ms 50412 KB Output is correct
14 Correct 256 ms 87020 KB Output is correct
15 Correct 142 ms 109420 KB Output is correct
16 Correct 146 ms 110060 KB Output is correct
17 Correct 195 ms 107500 KB Output is correct
18 Correct 131 ms 84204 KB Output is correct
19 Correct 142 ms 84076 KB Output is correct
20 Correct 324 ms 108652 KB Output is correct
21 Correct 141 ms 109420 KB Output is correct
22 Correct 148 ms 110060 KB Output is correct