# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78699 | Vardanyan | Sails (IOI07_sails) | C++14 | 1078 ms | 6032 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 100*1000+7;
pair<int,int> a[N];
int d[N];
int main(){
int n;
scanf("%d",&n);
for(int i = 1;i<=n;i++){
scanf("%d%d",&a[i].first,&a[i].second);
}
sort(a+1,a+1+n);
for(int i = 1;i<=n;i++){
vector<pair<int,int> > ind;
for(int j = 1;j<=a[i].first;j++) ind.push_back({d[j],j});
sort(ind.begin(),ind.end());
for(int j = 0;j<a[i].second;j++) d[ind[j].second]++;
}
long long ans = 0;
for(int i = 1;i<=N-2;i++){
long long c = d[i];
c*=(c-1);
c/=2;
ans+=c;
}
cout<<ans<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |