oj.uz

Submission #111972

# Submission time Handle Problem Language Result Execution time Memory
111972 2019-05-17T03:05:52 Z mechfrog88 None (JOI16_memory2) C++14
0 / 100
 3 ms 384 KB 
#include "Memory2_lib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void Solve(int T, int N){
	vector <ll> num(N,0);
	vector <bool> visited(N*2,false);
	for (int z=N-1;z>-1;z--){
		bool ok = true;
		for (int x=0;x<N*2 && ok;x++){
			if (visited[x]) continue;
			for (int next=0;next<N*2 && ok;next++){
				if (x == next) continue;
				if (visited[next]) continue;
				if (Flip(x,next) == z){
					Answer(x,next,z);
					visited[x] = true;
					visited[next] = true;
					ok = false;
				}
			}
			
		}
	}
	return;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 364 KB Wrong Answer[3]
2 Halted 0 ms 0 KB -