제출 #434880

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434880		sumit_kk10	Sails (IOI07_sails)	C++14	30 / 100	1099 ms	8376 KiB

sails

#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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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