oj.uz

Submission #139771

# Submission time Handle Problem Language Result Execution time Memory
139771 2019-08-01T11:26:37 Z toonewbie Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 532 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

int n;
vector <int> p;
void add_all(int l, int r) {
  if (l == r) return;
  int mid = (l + r) >> 1;
  string s(n, '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';
  }
  add_all(l, mid);
  add_all(mid + 1, r);
}
void solve(int l, int r, vector <int> can) {
  if (l == r) {
    p[can[0]] = l;
    return;
  }
  int mid = (l + r) >> 1;
  string s(n, '1');
  vector <int> lft, rgt;
  for (int i : can) s[i] = '0';
  for (int i : can) {
    s[i] = '1';
    if (check_element(s) == 1) {
      lft.push_back(i);
    } else {
      rgt.push_back(i);
    }
    s[i] = '0';
  }
  solve(l, mid, lft);
  solve(mid + 1, r, rgt);
}

vector<int> restore_permutation(int N, int w, int r) {
  n = N;
  p.resize(n);
  add_all(0, n - 1);
  compile_set();
  vector <int> can(n);
  for (int i = 0; i < n; i++) can[i] = i;
  solve(0, n - 1, can);
  return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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