oj.uz

Submission #308475

# Submission time Handle Problem Language Result Execution time Memory
308475 2020-10-01T11:07:59 Z juggernaut Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 512 KB 
#include"messy.h"
#include<bits/stdc++.h>
//#include"grader.cpp"
using namespace std;
int nn;
vector<int>res;
void build(int l,int r){
    if(l==r)return;
    int mid=(l+r)>>1,i=l;
    string s(nn,'0');
    for(;i<=r;i++)s[i]='1';
    for(i=l;i<=mid;i++){
        s[i]='0';
        add_element(s);
        s[i]='1';
    }
    build(l,mid);
    build(mid+1,r);
}
void go(vector<int>v){
    if(v.size()==1)return;
    string s(nn,'0');
    for(int to:v)s[to]='1';
    int mid=int(v.size())>>1;
    vector<int>a,b;
    for(int to:v){
        s[to]='0';
        if(check_element(s))a.push_back(to);
        else b.push_back(to),res[to]+=mid;
        s[to]='1';
    }
    go(a);
    go(b);
}
vector<int>restore_permutation(int N,int w,int r){
    nn=N;
    build(0,nn-1);
    compile_set();
    res.resize(nn);
    vector<int>v(nn);
    iota(v.begin(),v.end(),0);
    go(v);
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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