제출 #1305284

#제출 시각아이디문제언어결과실행 시간메모리
1305284bronze_coderSails (IOI07_sails)C++20
30 / 100
1096 ms1468 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; vector<long long> a; for(int i=0;i<n;i++){ int h,k; cin >> h >> k; while(a.size()<h){ a.push_back(0); } for(int i=0;i<k;i++){ a[h-1-i]++; } } vector<long long> partial = {0}; long long c = 0; long long ans = 0; for(int i=0;i<a.size();i++){ long long x = c; long long z = 0; for(int j=0;j<a.size();j++){ x += a[j]; if(j>=i){ z = max(z,(x+j-i)/(j-i+1)); } } c -= z; ans += z*(z-1)/2; } cout << ans << endl; }
#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...