oj.uz

Submission #575848

# Submission time Handle Problem Language Result Execution time Memory
575848 2022-06-11T11:30:58 Z lorenzoferrari Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include "messy.h"
#include <set>
#include <vector>
#include <cassert>
#include <numeric>
#include <iostream>
using namespace std;

int n;
vector<int> p;

void fill_set(int l, int r) {
  if (l == r) return;
  string s(n, '1');
  for (int i = l; i <= r; ++i) s[i] = '0';
  int m = (l + r) / 2;
  for (int i = l; i <= m; ++i) {
    s[i] = '1';
    add_element(s);
    s[i] = '0';
  }
  fill_set(l, m);
  fill_set(m+1, r);
}

void query_set(int l, int r, vector<int> pp) {
  assert(int(pp.size()) == r-l+1);
  if (l == r) {
    p[pp[0]] = l;
    return;
  }
  string s(n, '1');
  for (int i = 0; i <= r-l; ++i) s[pp[i]] = '0';
  vector<int> ppa, ppb;
  for (int i = 0; i <= r-l; ++i) {
    s[pp[i]] = '1';
    if (check_element(s)) {
      ppa.push_back(pp[i]);
    } else {
      ppb.push_back(pp[i]);
    }
    s[pp[i]] = '0';
  }
  int m = (l + r) / 2;
  query_set(l, m, ppa);
  query_set(m+1, r, ppb);
}

vector<int> restore_permutation(int n, int w, int r) {
  ::n = n;
  p.resize(n);
  fill_set(0, n-1);
  compile_set();
  vector<int> pp(n);
  iota(pp.begin(), pp.end(), 0);
  query_set(0, n-1, pp);
  return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 1 ms 296 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 296 KB n = 8
9 Correct 1 ms 292 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 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 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 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 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 300 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 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 300 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 0 ms 212 KB n = 32
6 Correct 1 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 1 ms 300 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 0 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.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 2 ms 468 KB n = 128
4 Correct 1 ms 424 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 432 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 428 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 432 KB n = 128
13 Correct 1 ms 428 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 436 KB n = 128