oj.uz

Submission #826058

# Submission time Handle Problem Language Result Execution time Memory
826058 2023-08-15T10:07:20 Z boyliguanhan Sails (IOI07_sails) C++17
10 / 100
 136 ms 7664 KB 
#include<bits/stdc++.h>
#define maintain(n) (sz[n] = sz[ch[n][0]]+sz[ch[n][1]] + 1)
using namespace std;
random_device rd1,rd2,rd3;
#define int long long
mt19937 rng(abs(rd1()+rd2()+rd3()+rd1()+rd2()+rd3()-chrono::steady_clock().now().time_since_epoch().count()));
#define N 100100
int ch[N][2], val[N], key[N], sz[N], root, cnt, lz[N];
void pd(int n) {
    if(lz[n]) {
        val[n]+=lz[n];
        if(ch[n][0])
            lz[ch[n][0]]+=lz[n];
        if(ch[n][1])
            lz[ch[n][1]]+=lz[n];
        lz[n]=0;
    }
}
void split(int n, int x, int &a, int &b) {
    if(!n) a = b = 0;
    else { pd(n);if(val[n] <= x) a = n,
        split(ch[n][1], x, ch[n][1], b);
    else b = n, split(ch[n][0], x, a, ch[b][0]);
    maintain(n);}
}
void split2(int n, int size, int&a, int &b){
    if(!n) a = b = 0;
    else { pd(n);if(sz[ch[n][0]] < size) a = n,
        split2(ch[n][1], size - sz[ch[n][0]]-1, ch[n][1], b);
    else
        b = n, split2(ch[n][0], size, a, ch[n][0]);
    maintain(n);}
}
int merge(int a, int b) {
    pd(a),pd(b);
    if(!a||!b) return a|b;
    if(key[a]<key[b]){ ch[a][1] = merge(ch[a][1], b);
        maintain(a); return a;}
    ch[b][0] = merge(a, ch[b][0]);
    maintain(b); return b;
}
void ins() {
    sz[++cnt] = 1;
    key[cnt] = rng();
    root = merge(cnt, root);
}
int getv(int rank) {
    int cur = root;
    while(cur) {
        if(rank==sz[ch[cur][0]]+1) break;
        if(rank <= sz[ch[cur][0]]) cur = ch[cur][0];
        else rank-=sz[ch[cur][0]]+1, cur = ch[cur][1];
    }
    return val[cur];
}
int pre(int n) {
    if(!n) return 0;
    return val[n]*(val[n]-1)/2+pre(ch[n][0])+pre(ch[n][1]);
}
int last, ans, temp;
signed main() {
    vector<pair<int, int>> v;
    int n;
    cin >> n;
    while(n--) {
        int a, b;
        cin >> a >> b;
        v.push_back({a,b});
    }
    sort(v.begin(), v.end());
    for(auto i: v) {
        while(sz[root]<i.first)
            ins();
        int cutval = getv(i.second);
        int x=0, y=0, z=0;
        split(root, cutval-1, x, y);
        split(y, cutval, y, z);
        int y2=0;
        split2(y, i.second-sz[x],y,y2);
        if(y)
            lz[y]++;
        if(x)
            lz[x]++;
        root = merge(merge(x,y2),merge(y,z));
    }
    cout << pre(root) << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Incorrect 1 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 324 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 2000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 2604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 4108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 6056 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 124 ms 7580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 136 ms 7664 KB Output isn't correct
2 Halted 0 ms 0 KB -