oj.uz

Submission #311634

# Submission time Handle Problem Language Result Execution time Memory
311634 2020-10-10T20:18:15 Z ant101 Jousting tournament (IOI12_tournament) C++14
100 / 100
 95 ms 5304 KB 
#include<bits/stdc++.h>
#define inbuf_len 1 << 16
#define outbuf_len 1 << 16
using namespace std;
 
int n, m, r, ans, M=-1, A[100010], bad[100010], sum[100010], tree[400010], check[100010];
 
void build(int node, int s, int e){
    if(s == e){
        tree[node] = 1;
        return;
    }
    int m = s + e >> 1;
    build(node * 2, s, m);
    build(node * 2 + 1, m + 1, e);
    tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
 
void update(int node, int s, int e, int s1, int e1){
    if(e<s1||e1<s) return;
    if(s1<=s&&e<=e1){
        tree[node]=0;
        return;
    }
    int m=s+e>>1;
    update(node*2, s, m, s1, e1);
    update(node*2+1, m+1, e, s1, e1);
    tree[node]=tree[node*2]+tree[node*2+1];
}
 
int gets(int node, int s, int e, int val){
    int m=s+e>>1;
    if(tree[node]==e-s+1&&tree[node]==val) return e;
    if(tree[node*2]>=val) return gets(node*2, s, m, val);
    return gets(node*2+1, m+1, e, val-tree[node*2]);
}
 
int gete(int node, int s, int e, int val){
    int m=s+e>>1;
    if(tree[node]==val) return e;
    if(s==e) return -1;
    if(tree[node*2]>val) return gete(node*2, s, m, val);
    if(tree[node*2]<val) return gete(node*2+1, m+1, e, val-tree[node*2]);
    if(tree[node*2]==val) return max(gete(node*2, s, m, val), gete(node*2+1, m+1, e, val-tree[node*2]));
}
 
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E){
    n = N, m = C, r = R;
 
    for(int i = 1; i < n; i++){
        if(K[i - 1] > r)bad[i] = 1;
        sum[i] = bad[i];
        if(i)sum[i] += sum[i - 1];
    }
 
    build(1, 1, n);
 
//    for(int i=1; i<=9; i++) printf("%d ", tree[i]); puts("");
    for(int i = 0; i < m; i++){
        int x = S[i], y = E[i], s, e, ch = 1;
        s = gets(1, 1, n, x + 1);
        e = gete(1, 1, n, y + 1);
        update(1, 1, n, s + 1, e);
        if(sum[e - 1] - sum[s - 1] >= 1) ch = 0;
        A[s] += ch, A[e + 1] += -ch;
//        printf("%d %d %d %d %d\n", x, y, s, e, ch);
    }
    for(int i = 1; i <= n; i++){
        A[i] += A[i - 1];
        if(M < A[i]) M = A[i], ans = i;
    }
    return ans - 1;
}

Compilation message

tournament.cpp: In function 'void build(int, int, int)':
tournament.cpp:13:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |     int m = s + e >> 1;
      |             ~~^~~
tournament.cpp: In function 'void update(int, int, int, int, int)':
tournament.cpp:25:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |     int m=s+e>>1;
      |           ~^~
tournament.cpp: In function 'int gets(int, int, int, int)':
tournament.cpp:32:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |     int m=s+e>>1;
      |           ~^~
tournament.cpp: In function 'int gete(int, int, int, int)':
tournament.cpp:39:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |     int m=s+e>>1;
      |           ~^~
tournament.cpp:45:1: warning: control reaches end of non-void function [-Wreturn-type]
   45 | }
      | ^

Subtask #1
17.0 / 17.0

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

Subtask #2
32.0 / 32.0

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

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1912 KB Output is correct
2 Correct 95 ms 5304 KB Output is correct
3 Correct 23 ms 3192 KB Output is correct
4 Correct 86 ms 5240 KB Output is correct
5 Correct 85 ms 4984 KB Output is correct
6 Correct 67 ms 4472 KB Output is correct
7 Correct 87 ms 5112 KB Output is correct
8 Correct 89 ms 5240 KB Output is correct
9 Correct 20 ms 3456 KB Output is correct
10 Correct 24 ms 3584 KB Output is correct