oj.uz

Submission #796318

# Submission time Handle Problem Language Result Execution time Memory
796318 2023-07-28T09:22:56 Z TheSahib Unscrambling a Messy Bug (IOI16_messy) C++14
70 / 100
 1 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

string s;

int N;


void f1(int l, int r){
    int mid = (l + r) / 2;
    fill(s.begin(), s.end(), '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';
    }
    if(l == r) return;
    f1(mid + 1, r);
    f1(l, mid);
}

vector<int> ans;

void f2(int l, int r){
    int mid = (l + r) / 2;
    fill(s.begin(), s.end(), '0');
    for (int i = 0; i < N; i++)
    {
        if(ans[i] == -1) continue;
        s[ans[i]] = '1';
    }
    int p = l;
    for (int i = 0; i < N; i++)
    {
        if(s[i] == '1') continue;
        s[i] = '1';
        if(check_element(s)) ans[p++] = i;
        s[i] = '0';
    }
    if(l == r) return;
    f2(mid + 1, r);
    fill(ans.begin() + l, ans.begin() + mid + 1, -1);
    f2(l, mid);
}

vector<int> restore_permutation(int n, int w, int r) {
    N = n;

    ans.resize(n, -1);
    s.resize(n);

    f1(0, n - 1);
    compile_set();
    f2(0, n - 1);
    vector<int> tmp(N);
    for (int i = 0; i < N; i++)
    {
        tmp[ans[i]] = i;
    }
    
    return tmp;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 32
2 Correct 0 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 0 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 212 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 0 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

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory 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 468 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 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB grader returned WA
2 Halted 0 ms 0 KB -