| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 282458 | youssefbou62 | 마상시합 토너먼트 (IOI12_tournament) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
#define sz(x) (int)x.size()
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab (int x ) { return (x>0?x:-x); }
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int MAXN = 5005 ;
int in[MAXN] ;
int st[MAXN*2];
void init(int n){
for(int i = 0 ; i< n ;i++ )
in[i] = i ;
}
int left(int u){return u*2+1;}
int right(int u){return u*2+2;}
void build (int i,int j,int u,vector<int>& v){
if( i > j )return ;
if( i == j ){
st[u] = v[i];
return ;
}
int mid = (i+j)/2;
build(i,mid,left(u),v);
build(mid+1,j,right(u),v);
st[u] = max(st[left(u)],st[right(u)]);
}
int query(int i,int j,int qL ,int qR,int u){
if( i > j || i > qR || j < qL ) return -1;
if( i >= qL && j <= qR )return st[u] ;
int mid = ( i + j )/2;
return max(query(i,mid,qL,qR,left(u)) ,
query(mid+1,j,qL,qR,right(u)));
}
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
init(N);
vpi queries ;
for(int i = 0 ; i < C ; i++ ){
int s = S[i] , e = E[i] ;
int new_index = in[s] ;
int L = 1e9 , R = -1 ;
for(int j = 0 ; j < N ; j++ ){
if( in[j] >= s && in[j] <= e){
in[j] = new_index;
L = min(L,j);
R = max(R,j);
}
if( in[j] > e )
new_index++ , in[j] = new_index ;
}
queries.pb({L,R});
// cout << queries[i].fi << " " << queries[i].se <<endl;
// for(int j = 0 ; j < N ; j++ ){
// cout << in[j] << " " ;
// }
// cout << endl;
}
vector<int> bat , bat1 ;
int ans=-1,pos;
for(int i = 0 ; i < N-1 ; i++ )bat.pb(K[i]);
for(int i = 0 ; i < N ; i++ ){
bat1 = bat ;
bat1.insert(bat1.begin()+i,R);
build(0,N-1,0,bat1);
int cur_ans = 0 ;
// cout << "choosen pos " << i << endl;
for(int j = 0 ; j < C ; j++ ){
// cout << "winner of game j "<<j <<" "<<
query(0,N-1,queries[j].fi,queries[j].se,0)<<endl;
if(query(0,N-1,queries[j].fi,queries[j].se,0)==R)cur_ans ++ ;
}
if( cur_ans > ans ){
pos = i ;
ans = cur_ans ;
}
// cout << "pos = " << i << " " << cur_ans << endl;
}
return pos;
}
// #define inbuf_len 1 << 16
// #define outbuf_len 1 << 16
// int GetBestPosition(int N, int C, int R, int *K, int *S, int *E);
// int main() {
// int tmp;
// /* Set input and output buffering */
// char *inbuf, *outbuf;
// inbuf = (char*) malloc(inbuf_len * sizeof(char));
// outbuf = (char*) malloc(outbuf_len * sizeof(char));
// tmp = setvbuf(stdin, inbuf, _IOFBF, inbuf_len);
// assert(tmp == 0);
// tmp = setvbuf(stdout, outbuf, _IOFBF, outbuf_len);
// assert(tmp == 0);
// int N, C, R;
// int *K, *S, *E;
// tmp = scanf("%d %d %d", &N, &C, &R);
// assert(tmp == 3);
// K = (int*) malloc((N-1) * sizeof(int));
// S = (int*) malloc(C * sizeof(int));
// E = (int*) malloc(C * sizeof(int));
// int i;
// for (i = 0; i < N-1; i++) {
// tmp = scanf("%d", &K[i]);
// assert(tmp == 1);
// }
// for (i = 0; i < C; i++) {
// tmp = scanf("%d %d", &S[i], &E[i]);
// assert(tmp == 2);
// }
// printf("%d\n", GetBestPosition(N, C, R, K, S, E));
// return 0;
// }