oj.uz

답안 #252104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252104 2020-07-24T07:09:50 Z mohamedsobhi777 Bubble Sort 2 (JOI18_bubblesort2) C++14
100 / 100
 3457 ms 210256 KB 
#include<bits/stdc++.h>
#include "bubblesort2.h"
 
using namespace std ; 
 
const int N = 1e6 + 7 ;  
int n; 
 
int tree[N * 4] , lazy[N * 4] ; 
set<int> ixs[N]; 
 
void update(int node , int L , int R , int l , int r , int val){
        if(l > R || r < L || l > r)
                return ; 
 
        if(L>=l && R<=r){
                lazy[node] += val ; 
                return ; 
        }
        int mid = (L + R) >>1  ; 
 
        update(node*2+1 , L , mid , l , r , val) ; 
        update(node*2+2 , mid+1 , R , l , r, val) ; 
        tree[node] = max(tree[node *2 +1] + lazy[node*2+1] , tree[node*2+2] + lazy[node *2+2] ); 
}
 
int query(int node , int L , int R , int l , int r ){
        if(l > R || r < L || l > r)
                return -N ; 
        if(L>=l && R<=r)
                return tree[node] + lazy[node]; 
        int mid = (L+R) >> 1 ; 
        int s1 = query(node*2+1 , L , mid , l , r) ; 
        int s2 = query(node*2+2 , mid+1 , R , l , r ) ; 
        return max(s1 , s2) + lazy[node] ; 
}
int js[N] ; 
 
void add(int ix , int val){
        ixs[ix].insert(val) ; 
        auto u = ixs[ix].end() ; u -- ; 
        int mx = *u ; 
        update(0 , 1, N , ix , ix , mx - js[ix]) ;
        js[ix] = mx ; 
}
 
void del(int ix , int val){
        ixs[ix].erase(ixs[ix].find(val)) ; 
        auto u = ixs[ix].end() ; u -- ;
        int mx = *u ; 
        update(0 , 1 , N , ix , ix , mx - js[ix]) ; 
        js[ix] = mx ;         
}
 
unordered_map<int , int > com ; 
vector<int> aux ; 
 
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
 
	int Q=X.size();
        n = (int) A.size() ; 
	std::vector<int> answer(Q);
 
        for(auto u : A)
                aux.push_back(u) ; 
        for(auto u : V)
                aux.push_back(u) ; 
        sort(aux.begin() , aux.end()) ; 
        int l = 0 , now = 0 ;
        for(int i = 0 ;i < (int) aux.size() ;i++){
                if(aux[i] > l)
                        now ++ ; 
                com[aux[i]] = now ; 
                l = aux[i] ;
        }
        for(int i = 0 ; i < n; i++){
                A[i] = com[A[i]] ; 
        }
        for(int i = 0 ;i < Q ;i++){
                V[i] = com[V[i]] ; 
        }
 
        for(int i = 1 ;i<=now ; i++){
                add(i , -N  ) ; 
        }
 
        for(int i = 0 ; i < n; i++){
                add(A[i] , i) ; 
                update( 0 , 1 , N , A[i] , now  , -1) ; 
        }
 
	for (int j=0;j<Q;j++) {
                del(A[X[j]] , X[j]) ; 
                add(V[j] , X[j]) ; 
                if(V[j] >=A[X[j]]){
                        update( 0 , 1 , N , A[X[j]]  , V[j] -1 , +1) ;                 
                }
                else{
                        update( 0 , 1 ,N , V[j]  , A[X[j]] -1  , -1) ; 
                }
		A[ X[j] ] = V[ j ] ; 
 
                answer[j] =  query(0 , 1 , N , 1 , now  ) +1; 
                answer[j] = max(answer[j] , -100) ; 
 
	}
	return answer;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47608 KB Output is correct
2 Correct 30 ms 47616 KB Output is correct
3 Correct 39 ms 47992 KB Output is correct
4 Correct 38 ms 48048 KB Output is correct
5 Correct 34 ms 47992 KB Output is correct
6 Correct 34 ms 48000 KB Output is correct
7 Correct 35 ms 47992 KB Output is correct
8 Correct 34 ms 48000 KB Output is correct
9 Correct 34 ms 48000 KB Output is correct
10 Correct 34 ms 47992 KB Output is correct
11 Correct 39 ms 47992 KB Output is correct
12 Correct 34 ms 48000 KB Output is correct
13 Correct 33 ms 47872 KB Output is correct
14 Correct 33 ms 47872 KB Output is correct
15 Correct 39 ms 47872 KB Output is correct
16 Correct 39 ms 47864 KB Output is correct
17 Correct 39 ms 47864 KB Output is correct
18 Correct 38 ms 47864 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47608 KB Output is correct
2 Correct 30 ms 47616 KB Output is correct
3 Correct 39 ms 47992 KB Output is correct
4 Correct 38 ms 48048 KB Output is correct
5 Correct 34 ms 47992 KB Output is correct
6 Correct 34 ms 48000 KB Output is correct
7 Correct 35 ms 47992 KB Output is correct
8 Correct 34 ms 48000 KB Output is correct
9 Correct 34 ms 48000 KB Output is correct
10 Correct 34 ms 47992 KB Output is correct
11 Correct 39 ms 47992 KB Output is correct
12 Correct 34 ms 48000 KB Output is correct
13 Correct 33 ms 47872 KB Output is correct
14 Correct 33 ms 47872 KB Output is correct
15 Correct 39 ms 47872 KB Output is correct
16 Correct 39 ms 47864 KB Output is correct
17 Correct 39 ms 47864 KB Output is correct
18 Correct 38 ms 47864 KB Output is correct
19 Correct 52 ms 49508 KB Output is correct
20 Correct 62 ms 49912 KB Output is correct
21 Correct 56 ms 49784 KB Output is correct
22 Correct 68 ms 49784 KB Output is correct
23 Correct 56 ms 49656 KB Output is correct
24 Correct 57 ms 49608 KB Output is correct
25 Correct 62 ms 49400 KB Output is correct
26 Correct 54 ms 49528 KB Output is correct
27 Correct 53 ms 49272 KB Output is correct
28 Correct 59 ms 49276 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 49020 KB Output is correct
2 Correct 107 ms 50292 KB Output is correct
3 Correct 161 ms 51500 KB Output is correct
4 Correct 160 ms 51696 KB Output is correct
5 Correct 159 ms 51440 KB Output is correct
6 Correct 162 ms 51696 KB Output is correct
7 Correct 163 ms 51572 KB Output is correct
8 Correct 161 ms 51568 KB Output is correct
9 Correct 159 ms 51568 KB Output is correct
10 Correct 138 ms 51568 KB Output is correct
11 Correct 145 ms 51444 KB Output is correct
12 Correct 148 ms 51568 KB Output is correct
13 Correct 140 ms 51736 KB Output is correct
14 Correct 145 ms 51568 KB Output is correct
15 Correct 138 ms 51568 KB Output is correct
16 Correct 135 ms 51544 KB Output is correct
17 Correct 136 ms 51440 KB Output is correct
18 Correct 132 ms 51524 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47608 KB Output is correct
2 Correct 30 ms 47616 KB Output is correct
3 Correct 39 ms 47992 KB Output is correct
4 Correct 38 ms 48048 KB Output is correct
5 Correct 34 ms 47992 KB Output is correct
6 Correct 34 ms 48000 KB Output is correct
7 Correct 35 ms 47992 KB Output is correct
8 Correct 34 ms 48000 KB Output is correct
9 Correct 34 ms 48000 KB Output is correct
10 Correct 34 ms 47992 KB Output is correct
11 Correct 39 ms 47992 KB Output is correct
12 Correct 34 ms 48000 KB Output is correct
13 Correct 33 ms 47872 KB Output is correct
14 Correct 33 ms 47872 KB Output is correct
15 Correct 39 ms 47872 KB Output is correct
16 Correct 39 ms 47864 KB Output is correct
17 Correct 39 ms 47864 KB Output is correct
18 Correct 38 ms 47864 KB Output is correct
19 Correct 52 ms 49508 KB Output is correct
20 Correct 62 ms 49912 KB Output is correct
21 Correct 56 ms 49784 KB Output is correct
22 Correct 68 ms 49784 KB Output is correct
23 Correct 56 ms 49656 KB Output is correct
24 Correct 57 ms 49608 KB Output is correct
25 Correct 62 ms 49400 KB Output is correct
26 Correct 54 ms 49528 KB Output is correct
27 Correct 53 ms 49272 KB Output is correct
28 Correct 59 ms 49276 KB Output is correct
29 Correct 54 ms 49020 KB Output is correct
30 Correct 107 ms 50292 KB Output is correct
31 Correct 161 ms 51500 KB Output is correct
32 Correct 160 ms 51696 KB Output is correct
33 Correct 159 ms 51440 KB Output is correct
34 Correct 162 ms 51696 KB Output is correct
35 Correct 163 ms 51572 KB Output is correct
36 Correct 161 ms 51568 KB Output is correct
37 Correct 159 ms 51568 KB Output is correct
38 Correct 138 ms 51568 KB Output is correct
39 Correct 145 ms 51444 KB Output is correct
40 Correct 148 ms 51568 KB Output is correct
41 Correct 140 ms 51736 KB Output is correct
42 Correct 145 ms 51568 KB Output is correct
43 Correct 138 ms 51568 KB Output is correct
44 Correct 135 ms 51544 KB Output is correct
45 Correct 136 ms 51440 KB Output is correct
46 Correct 132 ms 51524 KB Output is correct
47 Correct 925 ms 91680 KB Output is correct
48 Correct 3116 ms 184532 KB Output is correct
49 Correct 3371 ms 210224 KB Output is correct
50 Correct 3394 ms 210204 KB Output is correct
51 Correct 3380 ms 210096 KB Output is correct
52 Correct 3457 ms 210156 KB Output is correct
53 Correct 3341 ms 210128 KB Output is correct
54 Correct 3126 ms 210256 KB Output is correct
55 Correct 3237 ms 210228 KB Output is correct
56 Correct 3204 ms 210172 KB Output is correct
57 Correct 3246 ms 210228 KB Output is correct
58 Correct 3104 ms 210156 KB Output is correct
59 Correct 2703 ms 189976 KB Output is correct
60 Correct 2673 ms 189892 KB Output is correct
61 Correct 2724 ms 190152 KB Output is correct
62 Correct 2962 ms 183908 KB Output is correct
63 Correct 2455 ms 183904 KB Output is correct
64 Correct 2525 ms 183920 KB Output is correct
65 Correct 2622 ms 177848 KB Output is correct
66 Correct 2459 ms 178104 KB Output is correct
67 Correct 2695 ms 177820 KB Output is correct