Submission #1339049

#TimeUsernameProblemLanguageResultExecution timeMemory
1339049vjudge1Sails (IOI07_sails)C++20
15 / 100
1096 ms804 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
    int maxx=0;
    vector<int> state(n,0);
    int res=0;

    for(int i=0;i < n;++i){
        int h; cin >> h;
        int k; cin >> k;
        vector<bool> notforbidden(h,true);
        for(int kkk=k-1;kkk >= 0;--kkk){
            int idx=0;
            for(int i=h-1;i >= 0;--i){
                if(state[idx] > state[i] && notforbidden[i]) idx=i;
            }
            state[idx] += 1;
            notforbidden[idx] = false;
        }
    }

    for(auto x:state){
        res += x*(x-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...