oj.uz

Submission #21910

# Submission time Handle Problem Language Result Execution time Memory
21910 2017-04-26T23:38:44 Z sampriti Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 4 ms 512 KB 
#include "messy.h"

#include <vector>
#include <string>
#include <algorithm>
#include <cassert>

using namespace std;

int N;

void add_strings(int L, int R, string base) {
  if(L == R) return;
  int mid = (L + R)/2;
  for(int i = L; i <= mid; i++) {
    base[i] = '1';
    add_element(base);
    base[i] = '0';
  }

  base = string(N, '0');
  string left = base, right = base;
  for(int i = mid + 1; i <= R; i++) left[i] = '1';
  for(int i = L; i <= mid; i++) right[i] = '1';
  add_strings(L, mid, left);
  add_strings(mid + 1, R, right);
}

vector<int> ans_rev;

void solve(int L, int R, vector<int> A, vector<int> other) {
  if(L == R) {
    assert(A.size() == 1);
    ans_rev[L] = A[0];
    return;
  }

  string convert(N, '0');
  for(int i: other) convert[i] = '1';

  vector<int> left, right;
  for(int i: A) {
    convert[i] = '1';
    if(check_element(convert)) left.push_back(i);
    else right.push_back(i);
    convert[i] = '0';
  }

  int mid = (L + R)/2;
  solve(L, mid, left, right);
  solve(mid + 1, R, right, left);
}

std::vector<int> restore_permutation(int n, int w, int r) {
  N = n;
  add_strings(0, N - 1, string(N, '0'));

  compile_set();

  ans_rev.resize(N, -1);
  vector<int> A;
  for(int i = 0; i < N; i++) A.push_back(i);
  solve(0, N - 1, A, {});

  vector<int> ans(N);
  for(int i = 0; i < N; i++) ans[ans_rev[i]] = i;
  return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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