Submission #554917

#TimeUsernameProblemLanguageResultExecution timeMemory
554917MohamedFaresNebiliSails (IOI07_sails)C++14
30 / 100
1088 ms4556 KiB
#include <bits/stdc++.h> /// #pragma GCC optimize ("Ofast") /// #pragma GCC target ("avx2") /// #pragma GCC optimize("unroll-loops") using namespace std; using ll = long long; using ii = pair<ll, ll>; using vi = vector<int>; #define ff first #define ss second #define pb push_back #define all(x) (x).begin(), (x).end() #define lb lower_bound #define int ll const int oo = 1e9 + 7; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; vector<ii> arr(N); for(int l = 0; l < N; l++) cin >> arr[l].ff >> arr[l].ss; sort(arr.begin(), arr.end()); int res = 0; vector<int> st(100001, 0); for(int l = 0; l < N; l++) { int H = arr[l].ff, K = arr[l].ss; vector<ii> val(H); for(int i = 0; i < H; i++) val[i] = {st[i], i}; sort(val.begin(), val.end()); for(int i = 0; i < K; i++) st[val[i].ss]++; } for(int l = 0; l < 100001; l++) res += ((st[l] * (st[l] - 1)) / 2); cout << res << "\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...