oj.uz

답안 #308739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308739 2020-10-01T19:23:50 Z NintsiChkhaidze Exercise Deadlines (CCO20_day1problem2) C++14
17 / 25
 124 ms 10812 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 200001
#define ll 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;
}
int main(){
    int n;
    scanf("%d",&n);
    
    for (int i=1;i<=n;i++){
        int a;
        scanf("%d",&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]);
        
        if (q.size() == 0) {ans=-1;  break;}
        int x = q.top() - get(q.top());
        ans+=ind - x;
        upd(q.top(),1);
        q.pop();
        ind--;
    }
    printf("%d",ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int i = 0; i < v[ind].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~
Main.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d",&a);
      |         ~~~~~^~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 6 ms 5248 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 5 ms 5248 KB Output is correct
8 Correct 5 ms 5248 KB Output is correct
9 Correct 5 ms 5248 KB Output is correct
10 Correct 5 ms 5248 KB Output is correct
11 Correct 5 ms 5248 KB Output is correct
12 Correct 5 ms 5248 KB Output is correct
13 Correct 5 ms 5120 KB Output is correct
14 Correct 5 ms 5192 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 5 ms 5120 KB Output is correct
17 Correct 5 ms 5248 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 5 ms 5248 KB Output is correct
22 Correct 5 ms 5120 KB Output is correct
23 Correct 5 ms 5120 KB Output is correct
24 Correct 5 ms 5120 KB Output is correct
25 Correct 5 ms 5248 KB Output is correct
26 Correct 5 ms 5120 KB Output is correct
27 Correct 5 ms 5120 KB Output is correct
28 Correct 5 ms 5248 KB Output is correct
29 Correct 6 ms 5120 KB Output is correct
30 Correct 5 ms 5120 KB Output is correct
31 Correct 5 ms 5120 KB Output is correct
32 Correct 5 ms 5120 KB Output is correct
33 Correct 5 ms 5248 KB Output is correct
34 Correct 6 ms 5120 KB Output is correct
35 Correct 5 ms 5120 KB Output is correct
36 Correct 5 ms 5120 KB Output is correct
37 Correct 5 ms 5248 KB Output is correct
38 Correct 5 ms 5120 KB Output is correct
39 Correct 6 ms 5120 KB Output is correct
40 Correct 6 ms 5248 KB Output is correct
41 Correct 5 ms 5120 KB Output is correct
42 Correct 6 ms 5120 KB Output is correct
43 Correct 5 ms 5120 KB Output is correct
44 Correct 4 ms 5120 KB Output is correct
45 Correct 4 ms 4992 KB Output is correct

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 6 ms 5248 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 5 ms 5248 KB Output is correct
8 Correct 5 ms 5248 KB Output is correct
9 Correct 5 ms 5248 KB Output is correct
10 Correct 5 ms 5248 KB Output is correct
11 Correct 5 ms 5248 KB Output is correct
12 Correct 5 ms 5248 KB Output is correct
13 Correct 5 ms 5120 KB Output is correct
14 Correct 5 ms 5192 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 5 ms 5120 KB Output is correct
17 Correct 5 ms 5248 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 5 ms 5248 KB Output is correct
22 Correct 5 ms 5120 KB Output is correct
23 Correct 5 ms 5120 KB Output is correct
24 Correct 5 ms 5120 KB Output is correct
25 Correct 5 ms 5248 KB Output is correct
26 Correct 5 ms 5120 KB Output is correct
27 Correct 5 ms 5120 KB Output is correct
28 Correct 5 ms 5248 KB Output is correct
29 Correct 6 ms 5120 KB Output is correct
30 Correct 5 ms 5120 KB Output is correct
31 Correct 5 ms 5120 KB Output is correct
32 Correct 5 ms 5120 KB Output is correct
33 Correct 5 ms 5248 KB Output is correct
34 Correct 6 ms 5120 KB Output is correct
35 Correct 5 ms 5120 KB Output is correct
36 Correct 5 ms 5120 KB Output is correct
37 Correct 5 ms 5248 KB Output is correct
38 Correct 5 ms 5120 KB Output is correct
39 Correct 6 ms 5120 KB Output is correct
40 Correct 6 ms 5248 KB Output is correct
41 Correct 5 ms 5120 KB Output is correct
42 Correct 6 ms 5120 KB Output is correct
43 Correct 5 ms 5120 KB Output is correct
44 Correct 4 ms 5120 KB Output is correct
45 Correct 4 ms 4992 KB Output is correct
46 Incorrect 124 ms 10812 KB Output isn't correct
47 Halted 0 ms 0 KB -