oj.uz

답안 #886752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886752 2023-12-12T20:58:34 Z velislavgarkov Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 856 KB 
#include <iostream>
#include <vector>
#include "messy.h"
using namespace std;
string sbeg, s1, cur;
vector <int> curv;
vector <int> ans, perm;
void add_el(int l, int r) {
    if (l>=r) return;
    int mid=(l+r)/2;
    s1=sbeg;
    for (int i=l;i<=r;i++) s1[i]='0';
    for (int i=l;i<=mid;i++) {
        cur=s1;
        cur[i]='1';
        add_element(cur);
    }
    add_el(l,mid);
    add_el(mid+1,r);
}
void check_el(int l, int r, vector <int> v) {
    if (l==r) perm[l]=v[0];
    if (l>=r) return;
    vector <int> lef, ri;
    s1=sbeg;
    for (auto i:v) s1[i]='0';
    for (auto i:v) {
        cur=s1;
        cur[i]='1';
        if (check_element(cur)) {
            lef.push_back(i);
        } else {
            ri.push_back(i);
        }
    }
    int mid=(l+r)/2;
    check_el(l,mid,lef);
    check_el(mid+1,r,ri);
}
vector<int> restore_permutation(int N, int w, int r) {
    int n=N;
    ans.resize(n); perm.resize(n);
    for (int i=0;i<n;i++) {
        sbeg+='1';
        cur+='1';
    }
    add_el(0,n-1);
    compile_set();
    for (int i=0;i<n;i++) curv.push_back(i);
    check_el(0,n-1,curv);
    for (int i=0;i<n;i++) ans[perm[i]]=i;
    return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 8
2 Correct 0 ms 344 KB n = 8
3 Correct 0 ms 348 KB n = 8
4 Correct 0 ms 348 KB n = 8
5 Correct 0 ms 344 KB n = 8
6 Correct 0 ms 348 KB n = 8
7 Correct 0 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 344 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 0 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 348 KB n = 32
3 Correct 0 ms 348 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 348 KB n = 32
8 Correct 1 ms 504 KB n = 32
9 Correct 0 ms 344 KB n = 32
10 Correct 0 ms 420 KB n = 32
11 Correct 0 ms 348 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 0 ms 348 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 628 KB n = 128
2 Correct 1 ms 600 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 576 KB n = 128
8 Correct 1 ms 600 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 2 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 2 ms 432 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 600 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 856 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 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