oj.uz

Submission #441652

# Submission time Handle Problem Language Result Execution time Memory
441652 2021-07-05T16:57:45 Z SirCovidThe19th Sails (IOI07_sails) C++14
100 / 100
 154 ms 2632 KB 
#include <bits/stdc++.h>
using namespace std;

const int mx = 1e5+5;

int n, bit[mx], nums[mx]; pair<int, int> vals[mx]; long long ans;

void upd(int l, int r, int val){
    for (; l < mx; l += l&(-l)) bit[l] += val;
    for (++r; r < mx; r += r&(-r)) bit[r] -= val;
}
int query(int i){
    int ret = 0;
    for (; i > 0; i -= i&(-i)) ret += bit[i];
    return ret;
}

int main(){ 
    cin >> n; iota(nums, nums+mx, 0);
    for (int i = 0; i < n; i++) cin >> vals[i].first >> vals[i].second;
    sort(vals, vals+n);
    for (int i = 0; i < n; i++){
        int H = vals[i].first, S = vals[i].second, L, F; 
        L = lower_bound(nums+1, nums+H+1, query(H-S+1), [](int a, int val){ return query(a) > val; })-nums;
        F = upper_bound(nums+1, nums+H+1, query(H-S+1), [](int val, int a){ return query(a) < val; })-nums-1;
        upd(F+1, H, 1); upd(L, L+(F-(H-S+1)), 1);
    }for (int i = 1; i < mx; i++){
        long long q = query(i); ans += (q*(q-1))/2;
    }cout<<ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 716 KB Output is correct
2 Correct 4 ms 1100 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 944 KB Output is correct
2 Correct 34 ms 1248 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1256 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 1708 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 2496 KB Output is correct
2 Correct 104 ms 2564 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 2632 KB Output is correct
2 Correct 105 ms 2396 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 2632 KB Output is correct
2 Correct 105 ms 2584 KB Output is correct