oj.uz

답안 #829039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829039 2023-08-18T02:39:50 Z bachhoangxuan Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 512 KB 
#include<bits/stdc++.h>
#include "messy.h"
using namespace std;

vector<int> restore_permutation(int n, int w, int r) {
    vector<int> res(n);
    string s(n,'0');
    function<void(int,int)> add = [&](int l,int r){
        if(l==r-1) return;
        int mid=(l+r)>>1;
        for(int i=l;i<r;i++) s[i]='0';
        for(int i=l;i<mid;i++) s[i]='1',add_element(s),s[i]='0';
        for(int i=mid;i<r;i++) s[i]='1';
        add(l,mid);
        for(int i=l;i<mid;i++) s[i]='1';
        add(mid,r);
    };
    add(0,n);
    compile_set();
    s=string(n,'0');
    function<void(int,int,vector<int>)> check = [&](int l,int r,vector<int> p){
        if(l==r-1){
            res[p[0]]=l;
            return;
        }
        int mid=(l+r)>>1;
        for(int x:p) s[x]='0';
        vector<int> lt,rt;
        for(int x:p){
            s[x]='1';
            if(check_element(s)) lt.push_back(x);
            else rt.push_back(x);
            s[x]='0';
        }
        for(int x:rt) s[x]='1';
        check(l,mid,lt);
        for(int x:lt) s[x]='1';
        check(mid,r,rt);
    };
    vector<int> pos(n);
    for(int i=0;i<n;i++) pos[i]=i;
    check(0,n,pos);
    return res;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 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 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 300 KB n = 8
7 Correct 0 ms 300 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 296 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 300 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 1 ms 296 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 0 ms 296 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 0 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 300 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 300 KB n = 32
5 Correct 0 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 316 KB n = 32
8 Correct 1 ms 296 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 300 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 0 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 428 KB n = 128
2 Correct 1 ms 428 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 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 512 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 428 KB n = 128
13 Correct 1 ms 372 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 3 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 428 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 2 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 428 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128