oj.uz

Submission #434880

# Submission time Handle Problem Language Result Execution time Memory
434880 2021-06-22T04:22:07 Z sumit_kk10 Sails (IOI07_sails) C++14
30 / 100
 1000 ms 8376 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
long long n;
pair<long long, long long> a[N];

void solve(){
    cin >> n;
    long long mx = 0;
    for(int i = 1; i <= n; ++i){
        cin >> a[i].first >> a[i].second;
        mx = max(mx, a[i].first);
    }
    sort(a + 1, a + n + 1);
    vector<int> v(mx + 5, 0);
    for(int i = 1; i <= n; ++i){
        int cur = 0;
        set<pair<long long, long long> > s;
        for(int j = 1; j <= a[i].first; ++j)
            s.insert({v[j], j});
        while(true){
            if(s.empty()) break;
            if(cur == a[i].second) break;
            pair<long long, long long> ok = *s.begin();
            v[ok.second]++;
            s.erase(s.begin());
            ++cur;
        }
    }
    long long ans = 0;
    for(int i = 1; i <= mx; ++i){
        // cout << v[i] << ' ';
        ans += (v[i] * (v[i] - 1)) / 2;
    }
    cout << ans << '\n';
}

int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 23 ms 332 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 615 ms 676 KB Output is correct
2 Execution timed out 1089 ms 3344 KB Time limit exceeded

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 1312 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 1552 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 2096 KB Time limit exceeded

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1097 ms 8376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 3420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 4140 KB Time limit exceeded
2 Halted 0 ms 0 KB -