oj.uz

답안 #1043707

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043707 2024-08-04T14:25:14 Z dpsaveslives Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 608 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> ans;
void solve(int l, int r){ //we can do recursion!
    if(l == r) return;
    int mid = (l+r)>>1;
    string s = "";
    for(int i = 0;i<n;++i){
        s += '0';
    }
    for(int i = l;i<=r;++i){
        s[i] = '1';
    }
    for(int i = mid+1;i<=r;++i){
        s[i] = '0';
        add_element(s);
        s[i] = '1';
    }
    solve(l,mid); solve(mid+1,r);
}
void read(int l, int r, vector<int> v){
    if(l == r){
        ans[v[0]] = l;
        return;
    }
    int mid = (l+r)>>1;
    string s = "";
    for(int i = 0;i<n;++i){
        s += '0';
    }
    for(auto x : v){
        s[x] = '1';
    }
    vector<int> low, high;
    for(auto x : v){
        s[x] = '0';
        if(check_element(s)){
            high.push_back(x);
        }
        else{
            low.push_back(x);
        }
        s[x] = '1';
    }
    read(l,mid,low); read(mid+1,r,high);
}
vector<int> restore_permutation(int N, int w, int r){
    n = N; ans = vector<int>(N);
    solve(0,N-1);
  	compile_set(); 
    vector<int> v;
    for(int i = 0;i<N;++i){
        v.push_back(i);
    }
    read(0,N-1,v);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #4
21.0 / 21.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 608 KB n = 128
7 Correct 1 ms 608 KB n = 128
8 Correct 1 ms 608 KB n = 128
9 Correct 1 ms 608 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 604 KB n = 128
15 Correct 1 ms 432 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 388 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 600 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 604 KB n = 128
15 Correct 1 ms 600 KB n = 128