oj.uz

Submission #830029

# Submission time Handle Problem Language Result Execution time Memory
830029 2023-08-18T17:46:03 Z Liudas Unscrambling a Messy Bug (IOI16_messy) C++17
49 / 100
 1 ms 340 KB 
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"
#include <numeric>
#include <algorithm>
#include <random>
#include <chrono>
using namespace std;
vector<int> restore_permutation(int N, int W, int R){
    string s = string(N, '0'), t = string(N, '0');
    for(int i = 0; i < N/2; i ++){
        s[i] = '1';
        //cout << s << endl;
        add_element(s);
        s[i] = '0';
        s[N-i-1] = '1';
        //cout << s << endl;
        add_element(s);
        s[i] = '1';
    }
    string ss = string(N, '1');
    ss[0] = '0';
    add_element(ss);
    t[0] = '1';
    for(int i = 0; i < N/2-1; i ++){
        t[i + 1] = '1';
        //cout << t << endl;
        add_element(t);
        t[i] = '0';
    }
    vector<int> order(N);
    iota(order.begin(), order.end(), 0);
    compile_set();
    string ans = string(N, '0');
    vector<vector<int>> pos(N/2);
    vector<int> perm(N, -1);
    for(int i = 0; i < N/2; i ++){
        string temp = ans;
        for(int j = 0; j < N; j ++){
            if(ans[j] == '0'){
                temp[j] = '1';
                bool good = check_element(temp);
                if(good){
                    ans[j] = '1';
                    pos[i].push_back(j);
                }
                temp[j] = '0';
            }
        }
    }
    perm[pos[0][0]] = 0;
    perm[pos[0][1]] = N-1;
    ss[0] = '1';
    ss[pos[0][0]] = '0';
    if(!check_element(ss)){
        swap(perm[pos[0][0]], perm[pos[0][1]]);
    }
    for(int i = 1; i < N/2; i ++){
        string temp = string(N, '0');
        temp[find(perm.begin(), perm.end(), i-1)-perm.begin()] = '1';
        temp[pos[i][0]] = '1';
        //cout << temp << endl;
        if(check_element(temp)){
            //cout << "WTF" << endl;
            perm[pos[i][0]] = i;
            perm[pos[i][1]] = N-i-1;
        }
        else{
            //cout << "LOL" << endl;
            perm[pos[i][1]] = i;
            perm[pos[i][0]] = N-i-1;
        }
    }
    return perm;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 300 KB n = 32
3 Correct 0 ms 300 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 0 ms 212 KB n = 32
6 Correct 0 ms 212 KB n = 32
7 Correct 0 ms 212 KB n = 32
8 Correct 0 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 304 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 0 ms 300 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 #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 300 KB grader returned WA
2 Halted 0 ms 0 KB -