Submission #987326

#TimeUsernameProblemLanguageResultExecution timeMemory
987326huutuanSails (IOI07_sails)C++14
30 / 100
1062 ms7348 KiB
#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N=1e5+10;
int n;
int a[N], b[N];
pair<int, int> c[N];
int cnt[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   for (int i=1; i<=n; ++i) cin >> a[i] >> b[i], c[i]={a[i], b[i]};
   sort(c+1, c+n+1);
   int ans=0;
   for (int i=1; i<=n; ++i){
      a[i]=c[i].first, b[i]=c[i].second;
      vector<pair<int, int>> v;
      for (int j=1; j<=a[i]; ++j) v.emplace_back(cnt[j], j);
      sort(v.begin(), v.end());
      for (int j=0; j<b[i]; ++j) ans+=cnt[v[j].second]++;
   }
   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...