제출 #1339169

#제출 시각아이디문제언어결과실행 시간메모리
1339169eysbutnoBubble Sort 2 (JOI18_bubblesort2)C++20
0 / 100
9091 ms784 KiB
#include <bits/stdc++.h>

using ll = long long;

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

		std::vector<int> cur;
		for (int i : a) {
            bool ins = false;
			for (int &j : cur) {
                if (j <= i) j = i, ins = true;
            }

            if (!ins) cur.push_back(i);
		}

		res[t] = cur.size() - 1;
	}

	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...