oj.uz

Submission #289672

# Submission time Handle Problem Language Result Execution time Memory
289672 2020-09-02T22:25:04 Z b00n0rp Jousting tournament (IOI12_tournament) C++17
100 / 100
 112 ms 9352 KB 
#include<bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,a,b) for(int i = a; i < b; i++)

const int MAXN = 100005;

int n;
int lft[MAXN],rgt[MAXN];
int seg[MAXN*4];

void build(int ind,int l,int r){
	if(l == r){
		seg[ind] = 1;
		return;
	}
	int mid = (l+r)/2;
	build(2*ind,l,mid);
	build(2*ind+1,mid+1,r);
	seg[ind] = seg[2*ind]+seg[2*ind+1];
}

int quer(int ind,int l,int r,int val){ // returns first index such that pref[0..ind] >= val;
	if(l == r){
		if(seg[ind] == val) return l;
		else return l+1;
	}
	int mid = (l+r)/2;
	if(seg[2*ind] >= val) return quer(2*ind,l,mid,val);
	else return quer(2*ind+1,mid+1,r,val-seg[2*ind]);
}

void upd(int ind,int l,int r,int pos,int val){
	if(r < pos or l > pos) return;
	if(l == r){
		seg[ind] = val;
		return;
	}
	int mid = (l+r)/2;
	upd(2*ind,l,mid,pos,val);
	upd(2*ind+1,mid+1,r,pos,val);
	seg[ind] = seg[2*ind]+seg[2*ind+1];	
}

vector<int> endings[MAXN];

stack<int> st;

int fen[MAXN];

void bitupd(int pos,int val){
	pos++;
	while(pos <= n){
		fen[pos] += val;
		pos += (pos&-pos);
	}
}

int bitquer(int pos){
	pos++;
	int res = 0;
	while(pos){
		res += fen[pos];
		pos -= (pos&-pos);
	}
	return res;
}


int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
	build(1,0,N-1);
	n = N;
	REP(i,C){
		vector<int> positions;
		FOR(j,S[i]+1,E[i]+3) positions.push_back(quer(1,0,N-1,j));
		positions.back()--;
		S[i] = positions[0];
		E[i] = positions.back();
		FOR(i,1,((int)positions.size())-1){
			// cout << "updating: " << positions[i] << endl;
			upd(1,0,N-1,positions[i],0);
		}
		// cout << S[i] << " " << E[i] << endl;
	}
	lft[0] = -1;
	rgt[n-1] = n-1;
	FOR(i,1,n) lft[i] = (K[i-1] > R)?(i-1):(lft[i-1]);
	for(int i = n-2; i >= 0; i--) rgt[i] = (K[i] > R)?(i):(rgt[i+1]);

	REP(i,C){
		endings[S[i]].push_back(E[i]);
	}
	REP(i,N) sort(endings[i].begin(),endings[i].end());

	// REP(j,C){
	// 	if(i >= S[j] and S[j] > lft[i] and i <= E[j] and E[j] <= rgt[i]) cnt++;
	// }

	int pos = -1,mx = -1;
	REP(i,n){
		if(i and lft[i] != lft[i-1]){
			while(!st.empty()){
				bitupd(st.top(),-1);
				st.pop();
			}
		}
		for(auto x:endings[i]){
			st.push(x);
			bitupd(x,1);
		}
		int cnt = bitquer(rgt[i])-bitquer(i-1);
		if(cnt > mx){
			mx = cnt;
			pos = i;
		}
	}
	return pos;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2688 KB Output is correct
2 Correct 7 ms 3072 KB Output is correct
3 Correct 4 ms 2944 KB Output is correct
4 Correct 7 ms 2976 KB Output is correct
5 Correct 6 ms 2944 KB Output is correct
6 Correct 6 ms 2944 KB Output is correct
7 Correct 7 ms 2944 KB Output is correct
8 Correct 7 ms 2944 KB Output is correct
9 Correct 4 ms 2944 KB Output is correct
10 Correct 8 ms 3072 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 4984 KB Output is correct
2 Correct 107 ms 9208 KB Output is correct
3 Correct 69 ms 5776 KB Output is correct
4 Correct 112 ms 9336 KB Output is correct
5 Correct 108 ms 9080 KB Output is correct
6 Correct 109 ms 8312 KB Output is correct
7 Correct 112 ms 9352 KB Output is correct
8 Correct 107 ms 9208 KB Output is correct
9 Correct 50 ms 5668 KB Output is correct
10 Correct 60 ms 6136 KB Output is correct