Submission #150151

#TimeUsernameProblemLanguageResultExecution timeMemory
150151Powered By Zigui (#200)On the Grid (FXCUP4_grid)C++17
12 / 100
11 ms384 KiB
#include "grid.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> SortDisks(int N) {
	vector<int> correct;
	vector<int> ans;	ans.resize(N);
	set<int> S;
	for(int i = 0 ; i < N ; i++) S.insert(i);

	for(int i = 0 ; i < N ; i++){
		for(auto val1 : S) {
			vector<int> tmp;
			tmp.push_back(val1);
			for(auto val2 : S) if(val1 != val2) tmp.push_back(val2);
			for(int j = correct.size() - 1 ; j >= 0 ; j--) tmp.push_back(correct[j]);
			int X = PutDisks(tmp);
			//cout << X << '\n';
			if(X == 2 * N - 1 - i) {
				ans[val1] = N - i;
				correct.push_back(val1);
				S.erase(val1);
				break;
			}
		}
	}

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