oj.uz

답안 #471013

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
471013 2021-09-06T16:07:03 Z AmirElarbi 케이크 (CEOI14_cake) C++14
0 / 100
 4 ms 588 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e7
#define unsigned u
#define eps 1e-18
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 100005;
vi s;int n;
int tree[1000000];
int mrg(int a, int b)
{
    return max(a,b);
}
void build(int v = 1, int i = 0, int j = n-1){
    if(i == j){
       tree[v] = s[i];
       return;
    }
    int md = (i+j)/2;
    build(v*2, i, md);
    build(v*2+1, md+1, j);  
    tree[v] = mrg(tree[v*2],tree[v*2+1]);
}
int query(int v, int i, int j, int x , int y){
    if(j < x || i > y)
        return 0;
    if(i >= x && j <= y){
        return tree[v]; 
    }
    int md = (i+j)/2;
    int a = query(v*2, i, md, x, y), b = query(v*2+1, md+1, j, x, y);
    return mrg(a,b);
}
int get_first(int v, int lv, int rv, int l, int r, int x, bool k) {
    if(lv > r || rv < l) return -1;
    if(l <= lv && rv <= r) {
        if(tree[v] <= x) return -1;
        while(lv != rv) {
            int mid = lv + (rv-lv)/2;
            if(k){
                if(tree[2*v] > x) {
                    v = 2*v;
                    rv = mid;
                }else {
                    v = 2*v+1;
                    lv = mid+1;
                }
            } else {
                if(tree[2*v+1] > x) {
                    v = 2*v+1;
                    lv = mid+1;
                }else {
                    v = 2*v;
                    rv = mid;
                }
            }
        }
        return lv;
    }

    int mid = lv + (rv-lv)/2;
    if(k){
        int rs = get_first(2*v, lv, mid, l, r, x,k);
        if(rs != -1) return rs;
        return get_first(2*v+1, mid+1, rv, l ,r, x,k);
    } else {
        int rs = get_first(2*v+1, mid+1, rv, l ,r, x,k);
        if(rs != -1) return rs;
        return get_first(2*v, lv, mid, l, r, x,k);
    }
}
void upd(int v, int i, int j, int pos, int value, bool k){
    if(j < pos || i > pos)
        return;
    if(i == j){
       if(k){
           tree[v] = value;
           s[pos] = value;
       } else {
            tree[v] += value;
           s[pos] += value;
       }
       return;
    }
    int md = (i+j)/2;
    upd(v*2, i, md, pos, value,k);
    upd(v*2+1, md+1, j, pos, value,k);
    tree[v] = mrg(tree[v*2],tree[v*2+1]);
} 
int main() { 
    optimise;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int start;
    cin >> n >> start;
    start--;
    for (int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        s.pb(a);
    }
    build();
    int q;
    cin >> q;
    while(q--){
        char be;
        cin >> be;
        if(be == 'F'){
            int a;
            cin >> a;
            a--;
            if(start > a){
                int mx = query(1,0,n-1,a,start-1);
                int lim = get_first(1,0,n-1,start+1, n-1,mx,1);
                if(lim == -1) lim = n;
                cout << lim - a -1 << endl;
            } else if(a == start){
                cout << 0 << endl;
            } else {
                int mx = query(1,0,n-1,start+1,a);
                int lim = get_first(1,0,n-1,0,start-1,mx,0);
                cout << a - lim - 1  << endl;
            }
        } else {
            int a,b;
            cin >> a >> b;
            a--;
            b = n-b+1;
            for (int i = 0; i < n; ++i)
            {
                if(s[i] <= b && s[i]>s[a])
                    upd(1,0,n-1,i,-1,0);
            }
            upd(1,0,n-1,a,b,1);
        }
    }
}

Compilation message

cake.cpp: In function 'int main()':
cake.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cake.cpp:110:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 588 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 588 KB Execution killed with signal 11
2 Runtime error 3 ms 588 KB Execution killed with signal 11
3 Runtime error 3 ms 588 KB Execution killed with signal 11
4 Runtime error 3 ms 588 KB Execution killed with signal 11
5 Runtime error 3 ms 588 KB Execution killed with signal 11
6 Runtime error 3 ms 588 KB Execution killed with signal 11
7 Runtime error 3 ms 588 KB Execution killed with signal 11
8 Runtime error 3 ms 588 KB Execution killed with signal 11

Subtask #3
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 588 KB Execution killed with signal 11
2 Runtime error 4 ms 588 KB Execution killed with signal 11
3 Runtime error 3 ms 588 KB Execution killed with signal 11
4 Runtime error 3 ms 588 KB Execution killed with signal 11
5 Runtime error 3 ms 500 KB Execution killed with signal 11
6 Runtime error 3 ms 588 KB Execution killed with signal 11
7 Runtime error 3 ms 588 KB Execution killed with signal 11

Subtask #4
0.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 588 KB Execution killed with signal 11
2 Runtime error 3 ms 588 KB Execution killed with signal 11
3 Runtime error 3 ms 520 KB Execution killed with signal 11
4 Runtime error 3 ms 588 KB Execution killed with signal 11
5 Runtime error 3 ms 588 KB Execution killed with signal 11
6 Runtime error 3 ms 588 KB Execution killed with signal 11
7 Runtime error 4 ms 588 KB Execution killed with signal 11
8 Runtime error 3 ms 588 KB Execution killed with signal 11
9 Runtime error 3 ms 588 KB Execution killed with signal 11
10 Runtime error 3 ms 588 KB Execution killed with signal 11
11 Runtime error 3 ms 588 KB Execution killed with signal 11
12 Runtime error 3 ms 588 KB Execution killed with signal 11
13 Runtime error 3 ms 588 KB Execution killed with signal 11