제출 #768318

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768318		keta_tsimakuridze	Growing Trees (BOI11_grow)	C++14	100 / 100	214 ms	3296 KiB

grow

#include<bits/stdc++.h>
#define f first
#define s second
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t[N], a[N];
int n;
void upd(int id, int val) {
    for(id; id <= n; id += id & (-id)) t[id] += val;
}
int get(int id) {
    int ans = 0;
    for(id; id >= 1; id -= id & (-id)) ans += t[id];
    return ans;
}
int find(int x) {
    int l = 1, r = n, id = n + 1;
    while(l <= r) {
        int mid = (l + r) / 2;
        if(get(mid) >= x) id = mid, r = mid - 1;
        else l = mid + 1;
    }
    return id;
}
main(){
    int q;
    cin >> n >> q;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; i++) {
        upd(i, a[i]);
        upd(i + 1, -a[i]);
    }
    ++q;
    while(--q) {
        char c;
        cin >> c;
        if(c == 'F') {
            int cn, h;
            cin >> cn >> h;
            int id = find(h);
            if(id + cn - 1 < n) {
                int L = max(id, find(get(id + cn - 1))), R = find(get(id + cn - 1) + 1) - 1;
                // id - L + 1 bolo amdeni
                upd(R - (id + cn - 1 - L + 1) + 1, 1);
                upd(R + 1, -1);
                upd(id, 1);
                upd(L, -1);
            } else upd(id, 1);
            continue;
        } else {
            int L, R;
            cin >> L >> R;
            cout << find(R + 1) - 1 - find(L) + 1 << "\n";
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

grow.cpp: In function 'void upd(int, int)':
grow.cpp:10:9: warning: statement has no effect [-Wunused-value]
   10 |     for(id; id <= n; id += id & (-id)) t[id] += val;
      |         ^~
grow.cpp: In function 'int get(int)':
grow.cpp:14:9: warning: statement has no effect [-Wunused-value]
   14 |     for(id; id >= 1; id -= id & (-id)) ans += t[id];
      |         ^~
grow.cpp: At global scope:
grow.cpp:26:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   26 | main(){
      | ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10