Submission #766989

#TimeUsernameProblemLanguageResultExecution timeMemory
766989Tenis0206Exercise Deadlines (CCO20_day1problem2)C++11
17 / 25
1073 ms12572 KiB
#include <bits/stdc++.h> using namespace std; const int nmax = 2e5; int n; int v[nmax + 5]; int poz[nmax + 5]; set<int,greater<int>> s; int main() { ios::sync_with_stdio(false); cin.tie(0); cin>>n; for(int i=1;i<=n;i++) { cin>>v[i]; s.insert(i); } for(int i=n;i>=1;i--) { auto it = s.lower_bound(v[i]); if(it==s.end()) { cout<<-1<<'\n'; return 0; } poz[i] = *it; s.erase(it); } int rez = 0; for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { if(poz[i] > poz[j]) { ++rez; } } } cout<<rez<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...