제출 #1159735

#제출 시각아이디문제언어결과실행 시간메모리
1159735Der_VlaposBubble Sort 2 (JOI18_bubblesort2)C++20
0 / 100
48 ms580 KiB
#include "bubblesort2.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> countScans(std::vector<int> a, std::vector<int> x, std::vector<int> v)
{
	int n = a.size();
	int q = x.size();
	std::vector<int> answer(q);
	for (int j = 0; j < q; j++)
	{
		a[x[j]] = v[j];

		int mn = 1e9 + 10;
		int cnt = 0;
		for (int i = n - 1; i >= 0; --i)
		{
			cnt += (a[i] < mn);
			mn = min(mn, a[i]);
		}
		answer[j] = cnt;
	}
	return answer;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...