oj.uz

답안 #854347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854347 2023-09-27T01:13:43 Z hgmhc Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 604 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std; using ii = pair<int,int>; using ll = long long; using vi = vector<int>;
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define per(i,a,b) for (auto i = (b); i >= (a); --i)
#define all(x) begin(x), end(x)
#define siz(x) int((x).size())
#define Mup(x,y) x = max(x,y)
#define mup(x,y) x = min(x,y)
#define fi first
#define se second
#define dbg(...) fprintf(stderr,__VA_ARGS__)

inline void flip(char &c) {
    if (c == '1') c = '0';
    else c = '1';
}

void step1(string s, int l, int r) {
    if (l+1 == r) return;
    int m = (l+r)/2;
    rep(i,l,m-1) s[i] = '1', add_element(s), s[i] = '0';
    rep(i,l,m-1) s[i] = '1';
    step1(s,m,r);
    rep(i,l,m-1) s[i] = '0';
    rep(i,m,r-1) s[i] = '1';
    step1(s,l,m);
}

vi p;
void step2(string s, int l, int r, vi idxs) {
    assert( r-l == siz(idxs) );
    if (l+1 == r) {
        p[idxs[0]] = l;
        return;
    }
    int m = (l+r)/2;
    vi front, back;
    for (auto i : idxs) {
        s[i] = '1';
        if (check_element(s)) front.push_back(i);
        else back.push_back(i);
        s[i] = '0';
    }
    for (auto i : front) s[i] = '1';
    step2(s,m,r,back);
    for (auto i : front) s[i] = '0';
    for (auto i : back) s[i] = '1';
    step2(s,l,m,front);
}

vi restore_permutation(int n, int w, int r) {
    step1(string(n,'0'),0,n);
    compile_set();
    vi idxs(n); iota(all(idxs),0);
    p.resize(n);
    step2(string(n,'0'),0,n,idxs);
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 32
2 Correct 0 ms 436 KB n = 32
3 Correct 1 ms 344 KB n = 32
4 Correct 1 ms 432 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 0 ms 436 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 0 ms 404 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 0 ms 348 KB n = 32
15 Correct 1 ms 432 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 604 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 2 ms 604 KB n = 128
7 Correct 1 ms 600 KB n = 128
8 Correct 1 ms 604 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 604 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 604 KB n = 128
15 Correct 1 ms 604 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 604 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 604 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 604 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 2 ms 604 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 600 KB n = 128
15 Correct 1 ms 600 KB n = 128