oj.uz

Submission #411619

# Submission time Handle Problem Language Result Execution time Memory
411619 2021-05-25T15:45:38 Z nxteru Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 460 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>ans;
void add(vector<int>x,string s){
    if(x.size()==1)return;
    vector<int>a,b;
    for(int i=0;i<x.size()/2;i++)a.push_back(x[i]);
    for(int i=x.size()/2;i<x.size();i++)b.push_back(x[i]);
    for(auto i:a){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    for(auto i:b)s[i]='1';
    add(a,s);
    for(auto i:b)s[i]='0';
    for(auto i:a)s[i]='1';
    add(b,s);
}
void check(vector<int>x,string s,int l,int r){
    if(x.size()==1){
        ans[x[0]]=l;
        return;
    }
    int m=(l+r)/2;
    vector<int>a,b;
    for(auto i:x){
        s[i]='1';
        if(check_element(s))a.push_back(i);
        else b.push_back(i);
        s[i]='0';
    }
    for(auto i:b)s[i]='1';
    check(a,s,l,m);
    for(auto i:b)s[i]='0';
    for(auto i:a)s[i]='1';
    check(b,s,m,r);
}
vector<int> restore_permutation(int n, int w, int r) {
    string s;
    for(int i=0;i<n;i++)s+='0';
    vector<int>x;
    for(int i=0;i<n;i++)x.push_back(i);
    add(x,s);
    compile_set();
    ans.resize(n);
    check(x,s,0,n);
    return ans;
}

Compilation message

messy.cpp: In function 'void add(std::vector<int>, std::string)':
messy.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0;i<x.size()/2;i++)a.push_back(x[i]);
      |                 ~^~~~~~~~~~~
messy.cpp:10:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=x.size()/2;i<x.size();i++)b.push_back(x[i]);
      |                          ~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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