oj.uz

Submission #952546

# Submission time Handle Problem Language Result Execution time Memory
952546 2024-03-24T08:19:31 Z SmuggingSpun Unscrambling a Messy Bug (IOI16_messy) C++14
38 / 100
 1 ms 760 KB 
#include "messy.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
vector<int>restore_permutation(int n, int w, int r){
	assert(n <= 32);
	if(n <= 32){
		string s(n, '0'), current(n, '0');
		for(int i = 0; i + 1 < n; i++){
			s[i] = '1';
			add_element(s);
		}
		compile_set();
		vector<int>ans(n), p(n);
		iota(p.begin(), p.end(), 0);
		for(int i = 0; i < n; i++){
			shuffle(p.begin(), p.end(), rng);
			int index = int(p.size()) - 1;
			for(int i = 0; i + 1 < p.size(); i++){
				current[p[i]] = '1';
				if(check_element(current)){
					index = i;
					break;
				}
				current[p[i]] = '0';
			}
			current[p[index]] = '1';
			ans[p[index]] = i;
			p.erase(p.begin() + index);
		}
		return ans;
	}
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:19:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |    for(int i = 0; i + 1 < p.size(); i++){
      |                   ~~~~~~^~~~~~~~~~
messy.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -