Submission #199723

#TimeUsernameProblemLanguageResultExecution timeMemory
199723sean617Memory 2 (JOI16_memory2)C++98
10 / 100
5 ms256 KiB
#include "Memory2_lib.h"
#include<vector>

using namespace std;

int n, mx[105];
vector<int> ans[105];
void Solve(int T, int N) {
	int i, j, t;
	n = N * 2;
	for (i = 0; i < n; i++) {
		for (j = i + 1; j < n; j++) {
			t = Flip(i, j);
			mx[i] = max(mx[i], t);
			mx[j] = max(mx[j], t);
		}
	}
	for (i = 0; i < n; i++) {
		ans[mx[i]].push_back(i);
	}
	for (i =0; i < N; i++) {
		Answer(ans[i][0], ans[i][1], i);
	}
	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...