Submission #297585

#	Time	Username	Problem	Language	Result	Execution time	Memory
297585		pit4h	Bubble Sort 2 (JOI18_bubblesort2)	C++14	38 / 100	9090 ms	2432 KiB

bubblesort2

#include "bubblesort2.h"
#include<bits/stdc++.h>
using namespace std;

struct Dynamic_segtree {

};
vector<int> countScans(vector<int> a, vector<int> x, vector<int> v){
	int q = x.size();
	int n = a.size();
	vector<int> answer(q);
	vector<int> inv(n);
	for(int i=0; i<n; ++i) {
		for(int j=i+1; j<n; ++j) {
			if(a[i] > a[j]) {
				inv[j]++;
			}
		}
	}
	for(int i=0; i<q; ++i) {
		int old = a[x[i]];
		a[x[i]] = v[i];
		inv[x[i]] = 0;
		for(int j=0; j<x[i]; ++j) {
			if(a[j] > a[x[i]]) {
				inv[x[i]]++;
			}
		}
		for(int j=x[i]+1; j<n; ++j) {
			if(a[x[i]] > a[j] && old <= a[j]) {
				inv[j]++;
			}
			if(a[x[i]] <= a[j] && old > a[j]) {
				inv[j]--;
			}
		}
		for(int j=0; j<n; ++j) {
			answer[i] = max(answer[i], inv[j]);
		}
	}
	return answer;
}

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40