# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
307212 | 2020-09-27T11:03:40 Z | NintsiChkhaidze | Exercise Deadlines (CCO20_day1problem2) | C++14 | 6 ms | 5248 KB |
#include <bits/stdc++.h> #define f first #define s second #define pb push_back #define left (node<<1),l,((l+r)>>1) #define right ((node<<1)|1),((l+r)>>1) + 1,r #define N 200005 #define int long long using namespace std; priority_queue <int> q; int fen[200005]; vector <int> v[200005]; void upd(int in,int val){ while (in <= N){ fen[in]+=val; in += (in&(-in)); } } int get(int in){ int sum=0; while (in > 0){ sum+=fen[in]; in -= (in&(-in)); } return sum; } main(){ ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0); int n; cin>>n; for (int i=1;i<=n;i++){ int a; cin>>a; v[a].pb(i); } int ind = n,ans = 0; while (ind > 0){ for (int i = 0; i < v[ind].size(); i++) q.push(v[ind][i] - get(v[ind][i] - 1)); if (q.size() == 0){ cout<<-1; return 0; } int x = q.top(); q.pop(); ans+=ind - x; upd(x,1),upd(ind + 1,-1); ind--; } cout<<ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 5248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 5248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |