oj.uz

Submission #23493

# Submission time Handle Problem Language Result Execution time Memory
23493 2017-05-11T05:43:12 Z ruhanhabib39 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 7 ms 640 KB 
#include <vector>
#include <string>
#include <iostream>

#include "messy.h"

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

void work(int n, std::vector<int>& res, std::vector<int> v, int l, int r) {
  // std::cerr << l << " " << r << " " << v.size() << "\n";
  if(l == r) {
    res[v[0]] = l;
    return;
  }
  int m = (l + r) / 2;
  std::string ss(n, '1');
  for(int i : v) {
    ss[i] = '0';
  }
  std::vector<int> lf, rh;
  for(int i : v) {
    ss[i] = '1';
    if(check_element(ss)) lf.push_back(i);
    else rh.push_back(i);
    ss[i] = '0';
  }
  work(n, res, lf, l, m);
  work(n, res, rh, m+1, r);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    build(n, 0, n-1);
    compile_set();
    std::vector<int> res(n, 0);
    std::vector<int> vec(n);
    for(int i = 0; i < n; i++) {
      vec[i] = i;
    }
    work(n, res, vec, 0, n-1);
    return res;
}

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 292 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 384 KB n = 8
8 Correct 2 ms 384 KB n = 8
9 Correct 2 ms 384 KB n = 8
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 2 ms 512 KB n = 8
14 Correct 2 ms 384 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 384 KB n = 32
2 Correct 2 ms 384 KB n = 32
3 Correct 2 ms 384 KB n = 32
4 Correct 2 ms 384 KB n = 32
5 Correct 2 ms 384 KB n = 32
6 Correct 2 ms 384 KB n = 32
7 Correct 2 ms 256 KB n = 32
8 Correct 2 ms 384 KB n = 32
9 Correct 2 ms 384 KB n = 32
10 Correct 2 ms 332 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 2 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 356 KB n = 32
5 Correct 2 ms 384 KB n = 32
6 Correct 2 ms 384 KB n = 32
7 Correct 2 ms 256 KB n = 32
8 Correct 2 ms 256 KB n = 32
9 Correct 2 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 300 KB n = 32
13 Correct 2 ms 384 KB n = 32
14 Correct 2 ms 384 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 3 ms 512 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 3 ms 484 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 3 ms 512 KB n = 128
7 Correct 3 ms 512 KB n = 128
8 Correct 3 ms 512 KB n = 128
9 Correct 4 ms 512 KB n = 128
10 Correct 3 ms 640 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 7 ms 640 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 3 ms 640 KB n = 128
7 Correct 3 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 484 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