Submission #1226743

#TimeUsernameProblemLanguageResultExecution timeMemory
1226743VMaksimoski008Sails (IOI07_sails)C++20
30 / 100
1095 ms3128 KiB
#include <bits/stdc++.h> #define ar array //#define int long long using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const ll inf = 1e18; const int N = 1e5 + 5; signed main() { int n; cin >> n; vector<ar<int, 2> > a(n+1); for(int i=1; i<=n; i++) cin >> a[i][0] >> a[i][1]; sort(a.begin()+1, a.end()); ll ans = 0; vector<int> cnt(N); for(int i=1; i<=n; i++) { vector<pii> v; for(int j=1; j<=a[i][0]; j++) v.push_back({ cnt[j], j }); sort(v.begin(), v.end()); for(int k=0; k<a[i][1]; k++) cnt[v[k].second]++; } for(int i=1; i<N; i++) ans += (ll)cnt[i] * (cnt[i] - 1) / 2; cout << ans << '\n'; }
#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...