제출 #1150592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150592		brover29	Bubble Sort 2 (JOI18_bubblesort2)	C++20	0 / 100	1817 ms	796 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N=1e5+29;
vector<int>B;
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
	ll Q=X.size();
	B=A;
	vector<int> answer(Q);
	for (int j=0;j<Q;j++) {
		A[X[j]]=V[j];
		B=A;
		sort(B.begin(),B.end());
		ll cnt=0;
		for(ll i=B.size()-1;i>=0;i--){
			if(B[i]==A[i]){
				cnt++;
			}else break;
		}
		answer.push_back(A.size()-cnt-1);
	}
	return answer;
}

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