oj.uz

답안 #251556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251556 2020-07-21T19:27:00 Z test2 Bubble Sort 2 (JOI18_bubblesort2) C++14
38 / 100
 67 ms 26488 KB 
#include<bits/stdc++.h>
#include "bubblesort2.h"
 
using namespace std ; 

const int N = 5e5 + 7 ;  
int n; 

int tree[N * 4] , lazy[N * 4] ; 
multiset<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] ; 
}

const int zero = 0 ; 
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 ;         
}

map<int , int > com ; 

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);

        vector<int> aux ; 
        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] +1 , 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]] +1 , V[j] , 1) ;                 
                }
                else{
                        update( 0 , 1 ,N , V[j] +1 , A[X[j]] , -1) ; 
                }
		A[ X[j] ] = V[ j ] ; 

                answer[j] =  query(0 , 1 , N , 1 , now  ) ; 

	}
	return answer;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 24064 KB Output is correct
2 Correct 16 ms 24192 KB Output is correct
3 Correct 20 ms 24576 KB Output is correct
4 Correct 20 ms 24576 KB Output is correct
5 Correct 20 ms 24448 KB Output is correct
6 Correct 20 ms 24448 KB Output is correct
7 Correct 20 ms 24576 KB Output is correct
8 Correct 20 ms 24576 KB Output is correct
9 Correct 20 ms 24448 KB Output is correct
10 Correct 20 ms 24448 KB Output is correct
11 Correct 20 ms 24448 KB Output is correct
12 Correct 26 ms 24448 KB Output is correct
13 Correct 19 ms 24448 KB Output is correct
14 Correct 28 ms 24448 KB Output is correct
15 Correct 28 ms 24448 KB Output is correct
16 Correct 20 ms 24448 KB Output is correct
17 Correct 22 ms 24576 KB Output is correct
18 Correct 20 ms 24448 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 24064 KB Output is correct
2 Correct 16 ms 24192 KB Output is correct
3 Correct 20 ms 24576 KB Output is correct
4 Correct 20 ms 24576 KB Output is correct
5 Correct 20 ms 24448 KB Output is correct
6 Correct 20 ms 24448 KB Output is correct
7 Correct 20 ms 24576 KB Output is correct
8 Correct 20 ms 24576 KB Output is correct
9 Correct 20 ms 24448 KB Output is correct
10 Correct 20 ms 24448 KB Output is correct
11 Correct 20 ms 24448 KB Output is correct
12 Correct 26 ms 24448 KB Output is correct
13 Correct 19 ms 24448 KB Output is correct
14 Correct 28 ms 24448 KB Output is correct
15 Correct 28 ms 24448 KB Output is correct
16 Correct 20 ms 24448 KB Output is correct
17 Correct 22 ms 24576 KB Output is correct
18 Correct 20 ms 24448 KB Output is correct
19 Correct 51 ms 26104 KB Output is correct
20 Correct 46 ms 26488 KB Output is correct
21 Correct 45 ms 26488 KB Output is correct
22 Correct 67 ms 26488 KB Output is correct
23 Correct 43 ms 26360 KB Output is correct
24 Correct 45 ms 26360 KB Output is correct
25 Correct 40 ms 26232 KB Output is correct
26 Correct 42 ms 26232 KB Output is correct
27 Correct 39 ms 26104 KB Output is correct
28 Correct 40 ms 26104 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 25592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 24064 KB Output is correct
2 Correct 16 ms 24192 KB Output is correct
3 Correct 20 ms 24576 KB Output is correct
4 Correct 20 ms 24576 KB Output is correct
5 Correct 20 ms 24448 KB Output is correct
6 Correct 20 ms 24448 KB Output is correct
7 Correct 20 ms 24576 KB Output is correct
8 Correct 20 ms 24576 KB Output is correct
9 Correct 20 ms 24448 KB Output is correct
10 Correct 20 ms 24448 KB Output is correct
11 Correct 20 ms 24448 KB Output is correct
12 Correct 26 ms 24448 KB Output is correct
13 Correct 19 ms 24448 KB Output is correct
14 Correct 28 ms 24448 KB Output is correct
15 Correct 28 ms 24448 KB Output is correct
16 Correct 20 ms 24448 KB Output is correct
17 Correct 22 ms 24576 KB Output is correct
18 Correct 20 ms 24448 KB Output is correct
19 Correct 51 ms 26104 KB Output is correct
20 Correct 46 ms 26488 KB Output is correct
21 Correct 45 ms 26488 KB Output is correct
22 Correct 67 ms 26488 KB Output is correct
23 Correct 43 ms 26360 KB Output is correct
24 Correct 45 ms 26360 KB Output is correct
25 Correct 40 ms 26232 KB Output is correct
26 Correct 42 ms 26232 KB Output is correct
27 Correct 39 ms 26104 KB Output is correct
28 Correct 40 ms 26104 KB Output is correct
29 Incorrect 43 ms 25592 KB Output isn't correct
30 Halted 0 ms 0 KB -