oj.uz

Submission #50689

# Submission time Handle Problem Language Result Execution time Memory
50689 2018-06-12T15:32:38 Z Mamnoon_Siam Unscrambling a Messy Bug (IOI16_messy) C++17
49 / 100
 3 ms 408 KB 
#include <bits/stdc++.h>
using namespace std;
 
void add_element(std::string x);
bool check_element(std::string x);
void compile_set();
 
std::vector<int> restore_permutation(int n, int w, int r)
{
	srand(time(0));
    vector<int> ret=vector<int>(n);
    for(int i=0; i<n; i++) ret[i]=-1;
    string cur=string(n, '0');
    for(int i=n-1; i>0; i--) {
        cur[i]='1';
        add_element(cur);
    }
    compile_set();
    for(int i=0; i<cur.size(); i++) cur[i]='0';
    for(int pos=n-1; pos>0; pos--) {
        vector<int> foo;
        for(int i = 0; i < n; i++) {
        	if(cur[i] == '0') {
        		foo.push_back(i);
        	}
        }
        random_shuffle(foo.begin(), foo.end(), [](int i){return rand()%i;});
        for(int i : foo) {
        	string temp = cur; temp[i] = '1';
        	if(check_element(temp) == 1) {
        		cur = temp;
        		ret[i] = pos;
        		goto siam;
        	}
        }
        siam : ;
    }
    for(int i=0; i<n; i++) {
        if(ret[i]==-1) {
            ret[i]=0;
            break;
        }
    }
    return ret;
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:19:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<cur.size(); i++) cur[i]='0';
                  ~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 30.0

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