제출 #1329539

#제출 시각아이디문제언어결과실행 시간메모리
1329539namiousBubble Sort 2 (JOI18_bubblesort2)C++20
60 / 100
9092 ms4988 KiB
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define pb push_back
#pragma GCC optimize("O3,unroll-loops")
#define fast_io ios_base::sync_with_stdio(0) ,cin.tie(0),cout.tie(0);

vector <int> countScans(vector<int> A , vector<int> X , vector<int> V){
	int n = A.size(); int q = X.size(); vector <int> output;
	vector <int> inv; for(int i = 0 ; i < n ; i++) inv.pb(0);
	for(int i = 1 ; i < n ; i++){
		for(int j = 0 ; j < i ; j++){
			inv[i] += (A[j] > A[i]);
		}
	}
	for(int i = 0 ; i < q ; i++){
		for(int j = X[i]+1 ; j < n ; j++) inv[j] -= (A[X[i]] > A[j]) , inv[j] += (V[i] > A[j]);
		A[X[i]] = V[i]; inv[X[i]] = 0;
		for(int j = 0 ; j < X[i] ; j++) inv[X[i]] += (A[j] > A[X[i]]);
		int ans = 0; for(int j = 0 ; j < n ; j++) ans = max(ans,inv[j]);
		output.pb(ans);
	}
	return output;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...