Submission #248814

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
248814	2020-07-13 13:08:31	alexandra_udristoiu	Jousting tournament (IOI12_tournament)	C++14	100 / 100	59 ms	4728 KiB

tournament

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#define DIM 100005
using namespace std;
static int aib[DIM], nxt[DIM], sum[DIM], pmax[DIM];
static int N;
void update(int x, int val){
    x++;
    for(; x <= N; x += (x & -x) ){
        aib[x] += val;
    }
}
int query(int val){
    int p, x = 0, sum = 0;
    for(p = 17; p >= 0; p--){
        if( x + (1 << p) <= N && sum + aib[ x + (1 << p) ] < val){
            sum += aib[ x + (1 << p) ];
            x += (1 << p);
        }
    }
    return x;
}
int GetBestPosition(int n, int q, int r, int *v, int *s, int *e) {
    int i, j, p, u;
    N = n;
    for(i = 0; i < n; i++){
        nxt[i] = i + 1;
        update(i, 1);
    }
    pmax[n + 1] = n + 1;
    for(i = n; i >= 1; i--){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 32 / 32
• Subtask 3: 51 / 51