Submission #441353

#	Time	Username	Problem	Language	Result	Execution time	Memory
441353		SirCovidThe19th	Sails (IOI07_sails)	C++14	5 / 100	170 ms	1744 KiB

sails

#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, greater<pair<int, int>>());
    for (int i = 0; i < n; i++){
        int H = vals[i].first, S = vals[i].second, L, F; 
        L = upper_bound(nums+1, nums+H+1, query(S), [](int val, int a){ return query(a) > val; })-nums-1;
        F = lower_bound(nums+1, nums+H+1, query(S), [](int a, int val){ return query(a) < val; })-nums;
        upd(1, F-1, 1); upd(L-(S-F), L, 1);
    }for (int i = 1; i < mx; i++){
        long long q = query(i); ans += (q*(q-1))/2;
    }cout<<ans;
}

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