oj.uz

Submission #805913

# Submission time Handle Problem Language Result Execution time Memory
805913 2023-08-04T02:11:34 Z pavement The Collection Game (BOI21_swaps) C++17
3 / 100
 45 ms 332 KB 
//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <iostream>
#include <vector>
#include <set>
using namespace std;

#define pb push_back

void solve(int N, int V) {
	vector<int> P, x, y;
	set<int> ss;
	for (int i = 1; i <= N; i++) {
		P.pb(i);
	}
	for (int p = 1; p < N; p <<= 1) {
		for (int k = p; k >= 1; k >>= 1) {
			for (int j = k % p; j <= N - 1 - k; j += (k << 1)) {
				for (int i = 0; i <= min(k - 1, N - j - k - 1); i++) {
					if ((i + j) / (p << 1) == (i + j + k) / (p << 1)) {
						if (ss.find(i + j + 1) != ss.end() || ss.find(i + j + k + 1) != ss.end()) {
							auto ret = visit();
							for (int l = 0; l < (int)ret.size(); l++) {
								if (!ret[l]) swap(P[x[l]], P[y[l]]);
							}
							x.clear();
							y.clear();
						}
						x.pb(i + j);
						y.pb(i + j + k);
						ss.insert(i + j + 1);
						ss.insert(i + j + k + 1);
						schedule(i + j + 1, i + j + k + 1);
					}
				}
			}
		}
	}
	auto ret = visit();
	for (int l = 0; l < (int)ret.size(); l++) {
		if (!ret[l]) swap(P[x[l]], P[y[l]]);
	}
	answer(P);
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 292 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3-1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 10 ms 208 KB Correct

Subtask #3-2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 10 ms 208 KB Correct
3 Incorrect 1 ms 208 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #4-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 8 ms 208 KB Correct
3 Correct 32 ms 208 KB Correct
4 Runtime error 45 ms 288 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #4-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 8 ms 208 KB Correct
3 Correct 32 ms 208 KB Correct
4 Runtime error 45 ms 288 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #5-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 8 ms 208 KB Correct
3 Correct 32 ms 208 KB Correct
4 Runtime error 41 ms 332 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #5-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 8 ms 208 KB Correct
3 Correct 32 ms 208 KB Correct
4 Runtime error 41 ms 332 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #6-1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 10 ms 208 KB Correct
3 Correct 19 ms 208 KB Correct
4 Runtime error 43 ms 208 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #6-2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 10 ms 208 KB Correct
3 Correct 19 ms 208 KB Correct
4 Runtime error 43 ms 208 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #7-1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 10 ms 208 KB Correct
3 Correct 35 ms 208 KB Correct
4 Runtime error 34 ms 312 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #7-2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct
2 Correct 10 ms 208 KB Correct
3 Correct 35 ms 208 KB Correct
4 Runtime error 34 ms 312 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -