oj.uz

Submission #321165

# Submission time Handle Problem Language Result Execution time Memory
321165 2020-11-11T10:01:53 Z AmineWeslati Editor (BOI15_edi) C++14
35 / 100
 3000 ms 16184 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 = 2e5 + 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
}

int32_t main() {
    boost; IO();

    int N; cin>>N;
    V<pair<pi,int>> vec; // (type,val,active/inactive)
    FOR(i,0,N){
    	int x; cin>>x;
    	if(x>0){
    		vec.pb({{1,x},1});
    	}
    	else{
    		x=-x;

    		ROF(j,0,i){
    			if(vec[j].se==0) continue;
    			if(vec[j].fi.fi==1 ||(vec[j].fi.fi<=0 && vec[j].fi.se<x)){
    				vec.pb({{-j,x},1});
    				break;
    			}
    		}
    		int j=vec.back().fi.fi; j=-j;
    		while(1){
    			vec[j].se=1-vec[j].se;
	    		if(vec[j].fi.fi==1) break;
	    		j=-vec[j].fi.fi;
	    	}
    	}

    	

    	/*FOR(j,0,sz(vec)){
    		cout << vec[j].se << ' '; 
    	}cout << endl;*/
    	int ans=0;
    	ROF(j,0,sz(vec)){
    		if(vec[j].fi.fi==1 && vec[j].se==1){
    			ans=vec[j].fi.se; break;
    		}
    	}
    	cout << ans << endl; //<< 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 5 ms 748 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 31 ms 748 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 748 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 810 ms 16032 KB Output is correct
2 Correct 897 ms 16184 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2125 ms 8380 KB Output is correct
2 Execution timed out 3008 ms 5648 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 748 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 31 ms 748 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 810 ms 16032 KB Output is correct
11 Correct 897 ms 16184 KB Output is correct
12 Correct 2125 ms 8380 KB Output is correct
13 Execution timed out 3008 ms 5648 KB Time limit exceeded
14 Halted 0 ms 0 KB -