oj.uz

Submission #593281

# Submission time Handle Problem Language Result Execution time Memory
593281 2022-07-10T18:58:01 Z Soumya1 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
#ifdef __LOCAL__
  #include <debug_local.h>
#endif
using namespace std;
int n;
vector<int> ans;
void insert(int l, int r) {
  if (l == r) return;
  int m = (l + r) / 2;
  string s = string(n, '1');
  for (int j = l; j <= r; j++) s[j] = '0';
  for (int i = l; i <= m; i++) {
    s[i] = '1';
    add_element(s);
    s[i] = '0';
  }
  insert(l, m);
  insert(m + 1, r);
}
void solve(int l, int r, vector<int> pos) {
  if (l == r) {
    ans[pos[0]] = l;
    return;
  }
  int m = (l + r) / 2;
  string s = string(n, '1');
  for (int i : pos) s[i] = '0';
  vector<int> mark(n), left, right;
  for (int i : pos) {
    s[i] = '1';
    if (check_element(s)) {
      mark[i] = 1;
    }
    s[i] = '0';
  }
  for (int i : pos) {
    if (mark[i]) left.push_back(i);
    else right.push_back(i);
  }
  solve(l, m, left);
  solve(m + 1, r, right);
}
vector<int> restore_permutation(int N, int w, int r) {
  n = N;
  ans.resize(n);
  insert(0, n - 1);
  compile_set();
  vector<int> a(n);
  iota(a.begin(), a.end(), 0);
  solve(0, n - 1, a);
  return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 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 0 ms 300 KB n = 32
6 Correct 1 ms 304 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 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 1 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 296 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 0 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 296 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 0 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 1 ms 468 KB n = 128
2 Correct 2 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 2 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
30.0 / 30.0

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