| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1120487 | vjudge1 | Event Hopping (BOI22_events) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int n) {
	vector <int> v, v2;
	for(int i = 1; i <= n; i++) {
		v.push_back(i);
	}
	int res = publish(v);
	for(int i = 0; i < v.sz(); i++) {
		for(int j = 0; j < v.sz(); j++) {
			if(i == j) continue;
			swap(v[i], v[j]);
			int cur = publish(v);
			if(cur > res) {
				swap(v[i], v[j]);
			}
		}
	}
	answer(v);
}
