oj.uz

Submission #601261

# Submission time Handle Problem Language Result Execution time Memory
601261 2022-07-21T14:25:12 Z SeDunion Unscrambling a Messy Bug (IOI16_messy) C++17
38 / 100
 1 ms 340 KB 
#include <iostream>
#include <algorithm>
#include <random>
#include <vector>
#include <iterator>
 
#include "messy.h"
 
using namespace std;
    std::random_device rd;
    std::mt19937 g(rd());
 
vector<int> restore_permutation(int n, int w, int r) {
	for (int i = 1 ; i <= n ; ++ i) {
		string cur = "";
		for (int _ = 0 ; _ < i ; ++ _) cur += "1";
		for (int _ = 0 ; _ < n - i ; ++ _) cur += "0";
		add_element(cur);
	}
	compile_set();
	vector<int>p(n, -1);
	vector<int>R(n);
	for (int i = 0 ; i < n ; ++ i) R.emplace_back(i);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	shuffle(R.begin(), R.end(), g);
	for (int i = 1 ; i <= n ; ++ i) {
		string cur(n, '0');
		for (int j = 0 ; j < n ; ++ j) if (p[j] != -1) cur[j] = '1';
		for (int j : R) if (cur[j] == '0') {
			string temp = cur;
			temp[j] = '1';
			if (check_element(temp)) {
				p[j] = i - 1;
				break;
			}
		}
	}
	return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 0 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 0 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Incorrect 1 ms 212 KB grader returned WA
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -