Submission #65266174

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int L = 1, R = 1000000001;
struct Node {
    Node *l = nullptr, *r = nullptr;
    int cnt = 0;
    ll s0 = 0, s1 = 0;
};
void upd(Node*& t, int lo, int hi, int x) {
    if (!t) t = new Node();
    if (lo + 1 == hi) {
        t->cnt++;
        t->s0 += x;
        return;
    }
    int mid = lo + (hi - lo) / 2;
    if (x < mid) {
        upd(t->l, lo, mid, x);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int L = 1, R = 1000000001;

struct Node {
    Node *l = nullptr, *r = nullptr;
    int cnt = 0;
    ll s0 = 0, s1 = 0;
};

void upd(Node*& t, int lo, int hi, int x) {
    if (!t) t = new Node();
    if (lo + 1 == hi) {
        t->cnt++;
        t->s0 += x;
        return;
    }
    int mid = lo + (hi - lo) / 2;
    if (x < mid) {
        upd(t->l, lo, mid, x);
    } else {
        upd(t->r, mid, hi, x);
    }
    int cL = 0, cR = 0;
    ll s0L = 0, s1L = 0, s0R = 0, s1R = 0;
    
    if (t->l) {
        cL   = t->l->cnt;
        s0L  = t->l->s0;
        s1L  = t->l->s1;
    }
    if (t->r) {
        cR   = t->r->cnt;
        s0R  = t->r->s0;
        s1R  = t->r->s1;
    }
    t->cnt = cL + cR;
    if (cL % 2 == 0) {
        t->s0 = s0L + s0R;
        t->s1 = s1L + s1R;
    } else {
        t->s0 = s0L + s1R;
        t->s1 = s1L + s0R;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int Q;
    cin >> Q;
    Node* root = nullptr;
    ll z = 0;
    
    while (Q--) {
        ll y;
        cin >> y;
        int x = int((y + z) % 1000000000) + 1;
        upd(root, L, R, x);
        z = root->s0;
        cout << z << "\n";
    }
    return 0;
}

Submission Info

Judge Result