oj.uz

Submission #230187

# Submission time Handle Problem Language Result Execution time Memory
230187 2020-05-09T03:12:44 Z mohamedsobhi777 Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 6444 ms 1504 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 ; 
    for(int i = 0 ;i <  B ;i++){
        A[X[i]] = V[i] ; 
        vector<pair<int,int> > aux ; 
        for(int j = 0;j < Q ;j ++){
            aux.push_back({A[j] , j}) ;  
        }   
        sort(aux.begin() , aux.end()) ; 
        int ans = 0 ; 
        for(int j = 0 ;j < Q ; j++){
            ans = max(ans , abs(aux[j].second - j)) ; 
        }
        ret.push_back(ans);
    }

	return ret;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 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 23 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 Incorrect 6444 ms 1504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

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