oj.uz

Submission #830130

# Submission time Handle Problem Language Result Execution time Memory
830130 2023-08-18T19:41:52 Z Liudas Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 512 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> ans;
void prec(vector<int> in, vector<int> out){
    if(in.size() % 2) return;
    string s = string(in.size() + out.size(), '0');
    vector<int> l, r, ll = out, rr = out;
    for(int i : out){
        s[i] = '1';
    }
    for(int i = 0; i < in.size()/2; i ++){
        s[in[i]] = '1';
        l.push_back(in[i]);
        r.push_back(in[i+in.size()/2]);
        ll.push_back(in[i]);
        rr.push_back(in[i+in.size()/2]);
        add_element(s);
        s[in[i]] = '0';
    }
    prec(l, rr);
    prec(r, ll);
}
void comp(vector<int> in, vector<int> out, int L){
    if(in.size() % 2){
        ans[in[0]] = L;
        return;
    }
    string s = string(in.size() + out.size(), '0');
    for(int i : out){
        s[i] = '1';
    }
    vector<int> l, r, ll = out, rr = out;
    for(int i : in){
        s[i] = '1';
        if(check_element(s)){
            l.push_back(i);
            ll.push_back(i);
        }
        else{
            r.push_back(i);
            rr.push_back(i);
        }
        s[i] = '0'; 
    }
    comp(l, rr, L);
    comp(r, ll, L + in.size() / 2);
}
vector<int> restore_permutation(int N, int W, int R){
    vector<int> arr(N), brr;
    iota(arr.begin(), arr.end(), 0);
    prec(arr, brr);
    compile_set();
    ans.resize(N);
    comp(arr, brr, 0);
    return ans;
}

Compilation message

messy.cpp: In function 'void prec(std::vector<int>, std::vector<int>)':
messy.cpp:21:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int i = 0; i < in.size()/2; i ++){
      |                    ~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 1 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 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 300 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 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 296 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 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 0 ms 212 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 1 ms 304 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
11.0 / 11.0

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 2 ms 424 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 2 ms 428 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 2 ms 512 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

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