제출 #321175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321175		AmineWeslati	Editor (BOI15_edi)	C++14	0 / 100	1854 ms	24616 KiB

edi

//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
}

vi adj[MX];
int N; 
int nb;

bool vis[MX];

void dfs(int u){
	vis[u]=true;
	nb++;
	for(auto v: adj[u]) if(!vis[v]) dfs(v);
}

vi t(4*MX,0);

void update(int i, int v, int pos=1, int tl=0, int tr=N-1){
	if(tl==tr){
		t[pos]=v;
		return;
	}
	int tm=(tl+tr)/2;
	if(i<=tm) update(i,v,pos*2,tl,tm);
	else update(i,v,pos*2+1,tm+1,tr);
	t[pos]=max(t[pos*2],t[pos*2+1]);
} 

int get(int l, int r, int pos=1, int tl=0, int tr=N-1){
	if(l>r) return 0;
	if(l==tl && r==tr) return t[pos];
	int mid=(tl+tr)/2;
	return max(get(l,min(r,mid),pos*2,tl,mid),get(max(l,mid+1),r,pos*2+1,mid+1,tr));
}

int32_t main() {
    boost; IO();

    cin>>N;
    vi a(N);
    FOR(i,0,N){
    	cin>>a[i];
    	if(a[i]>0) update(i,0);
    	else{
    		a[i]=-a[i];
    		update(i,a[i]);
		}
	}

	FOR(i,0,N){
		int l=i+1,r=N-1;
		int ans=-1;
		while(l<=r){
			int m=(l+r)/2;
			if(get(i+1,m)>a[i]){
				ans=m; r=m-1;
			}
			else l=m+1;
		}
		if(ans!=-1){
			adj[ans].pb(i);
			adj[i].pb(ans);
		}
	}
	FOR(i,0,N-1) cout << 0 << endl;
	int ans=0;
	ROF(i,0,N) if(a[i]>0){
		nb=0;
		dfs(i);
		if(nb%2==1){ans=a[i]; break;}
	}
	cout << ans << 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: 0 / 20
• Subtask 2: 0 / 15
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37