Submission #580706

#TimeUsernameProblemLanguageResultExecution timeMemory
580706snasibov05Sails (IOI07_sails)C++14
30 / 100
1087 ms7876 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { const int mx = 1e5 + 5; int n; cin >> n; vector<pair<int, int>> v(n); for (int i = 0; i < n; ++i) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); set<pair<int, int>> st; vector<int> cnt(mx); for (int i = 0; i < n; ++i){ for (int j = 1; j <= v[i].first; ++j) { st.insert({cnt[j], j}); } for (int j = 0; j < v[i].second; ++j){ auto it = st.begin(); int h = it->second; st.erase(it); cnt[h]++; } } int ans = 0; for (int i = 0; i < mx; ++i) ans += cnt[i] * (cnt[i] - 1) / 2; cout << ans << "\n"; return 0; }
#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...