oj.uz

답안 #251566

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

const int N = 50000 + 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] ; 
}
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 ; 

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  + 100  ; i++){
                add(i , -N * 100  ) ; 
        }

        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 4 ms 2944 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 7 ms 3328 KB Output is correct
4 Correct 8 ms 3328 KB Output is correct
5 Correct 8 ms 3328 KB Output is correct
6 Correct 7 ms 3328 KB Output is correct
7 Correct 8 ms 3328 KB Output is correct
8 Correct 7 ms 3328 KB Output is correct
9 Correct 8 ms 3328 KB Output is correct
10 Correct 7 ms 3328 KB Output is correct
11 Correct 8 ms 3328 KB Output is correct
12 Correct 8 ms 3328 KB Output is correct
13 Correct 7 ms 3328 KB Output is correct
14 Correct 8 ms 3328 KB Output is correct
15 Correct 8 ms 3228 KB Output is correct
16 Correct 7 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2944 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 7 ms 3328 KB Output is correct
4 Correct 8 ms 3328 KB Output is correct
5 Correct 8 ms 3328 KB Output is correct
6 Correct 7 ms 3328 KB Output is correct
7 Correct 8 ms 3328 KB Output is correct
8 Correct 7 ms 3328 KB Output is correct
9 Correct 8 ms 3328 KB Output is correct
10 Correct 7 ms 3328 KB Output is correct
11 Correct 8 ms 3328 KB Output is correct
12 Correct 8 ms 3328 KB Output is correct
13 Correct 7 ms 3328 KB Output is correct
14 Correct 8 ms 3328 KB Output is correct
15 Correct 8 ms 3228 KB Output is correct
16 Correct 7 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct
19 Correct 27 ms 4988 KB Output is correct
20 Correct 33 ms 5240 KB Output is correct
21 Correct 28 ms 5240 KB Output is correct
22 Correct 38 ms 5248 KB Output is correct
23 Correct 25 ms 4992 KB Output is correct
24 Correct 27 ms 4992 KB Output is correct
25 Correct 25 ms 4736 KB Output is correct
26 Correct 27 ms 4864 KB Output is correct
27 Correct 26 ms 4728 KB Output is correct
28 Correct 25 ms 4732 KB Output is correct

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2944 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 7 ms 3328 KB Output is correct
4 Correct 8 ms 3328 KB Output is correct
5 Correct 8 ms 3328 KB Output is correct
6 Correct 7 ms 3328 KB Output is correct
7 Correct 8 ms 3328 KB Output is correct
8 Correct 7 ms 3328 KB Output is correct
9 Correct 8 ms 3328 KB Output is correct
10 Correct 7 ms 3328 KB Output is correct
11 Correct 8 ms 3328 KB Output is correct
12 Correct 8 ms 3328 KB Output is correct
13 Correct 7 ms 3328 KB Output is correct
14 Correct 8 ms 3328 KB Output is correct
15 Correct 8 ms 3228 KB Output is correct
16 Correct 7 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct
19 Correct 27 ms 4988 KB Output is correct
20 Correct 33 ms 5240 KB Output is correct
21 Correct 28 ms 5240 KB Output is correct
22 Correct 38 ms 5248 KB Output is correct
23 Correct 25 ms 4992 KB Output is correct
24 Correct 27 ms 4992 KB Output is correct
25 Correct 25 ms 4736 KB Output is correct
26 Correct 27 ms 4864 KB Output is correct
27 Correct 26 ms 4728 KB Output is correct
28 Correct 25 ms 4732 KB Output is correct
29 Incorrect 26 ms 4472 KB Output isn't correct
30 Halted 0 ms 0 KB -