Submission #114237

#TimeUsernameProblemLanguageResultExecution timeMemory
114237nvmdavaSails (IOI07_sails)C++17
0 / 100
1071 ms1624 KiB
#include <bits/stdc++.h>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
#define N 100005

int cnt[N];

vector<pii> fru;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;
    int now = 1;
    fru.resize(n);
    for(int i = 0; i < n; i++)
        cin>>fru[i].ff>>fru[i].ss;
    sort(fru.begin(), fru.end());

    for(auto s : fru){
        while(s.ss--){
            if(now > s.ff) now = 1;
            cnt[now++]++;
        }
    }

    long long res = 0;

    for(int i = 0; i < N; i++){
        res += 1LL * cnt[i] * (cnt[i] - 1) / 2;
    }
    cout<<res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...