oj.uz

Submission #70828

# Submission time Handle Problem Language Result Execution time Memory
70828 2018-08-23T13:51:52 Z dnass Bubble Sort 2 (JOI18_bubblesort2) C++17
0 / 100
 8910 ms 1332 KB 
#include "bubblesort2.h"
#include <set>
#include <map>
#include <algorithm>
#include <iterator>
#include <cstdio>
#include <cmath>
using namespace std;
 
int n, q;
 
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
	vector<int> ans;
	n = A.size();
	q = X.size();
	for(int i=0;i<q;i++){
		A[X[i]] = V[i];
		vector<int> srt;
		for(int j=0;j<n;j++) srt.push_back(A[j]);
		sort(srt.begin(), srt.end());
		int mx = -1;
		for(int j=0;j<n;j++){
			vector<int>::iterator it;
			it = lower_bound(srt.begin(), srt.end(), A[j]);
			int x = it-srt.begin();
			mx = max(mx, ((int) round(fabs(x-j))));
		}
		ans.push_back(mx);
	}
	return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

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