oj.uz

Submission #230186

# Submission time Handle Problem Language Result Execution time Memory
230186 2020-05-09T02:50:42 Z mohamedsobhi777 Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 9000 ms 896 KB 
#include<bits/stdc++.h>
#include "bubblesort2.h"


using namespace std ; 

vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
	int Q=A.size();
    int B = X.size() ; 
	vector<int> ret ; 
    vector<int> aux; 
    for(int i = 0 ;i <  B ;i++){
        A[X[i]] = V[i] ; 
        aux.clear() ; 
        for(int j = 0;j < Q ;j ++){
            aux.push_back(A[j]) ; 
        }   
        int ans = 0 ; 
        for(int j = 0 ;j < Q ;j ++){
            int kk =  -1 ; 
            for(int k = 0 ; k < Q ; k ++ ){
                if( k <= j){
                    kk+=(aux[k] <= aux[j]) ; 
                }   
                else{
                    kk+=(aux[k] < aux[j]) ; 
                }
            }
            ans = max(ans , abs(kk - j) ) ; 
        }
        ret.push_back(ans) ; 
    }

	return ret;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9021 ms 896 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -