oj.uz

Submission #681906

# Submission time Handle Problem Language Result Execution time Memory
681906 2023-01-14T20:02:53 Z cadmiumsky Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"

#define all(x) (x).begin(),(x).end()

using namespace std;

#define sz(x) (int)(x).size()

void divide_in(int l, int r, string hint) {
  if(l == r) return;
  int mid = l + r >> 1;
  for(int i = l; i <= mid; i++) {
    hint[i] = '1';
    add_element(hint);
    hint[i] = '0';
  }
  for(int i = l; i <= mid; i++) 
    hint[i] = '1';
  divide_in(mid + 1, r, hint);
  
  for(int i = l; i <= mid; i++) 
    hint[i] = '0',
    hint[i - l + mid + 1] = '1';
  
  divide_in(l, mid, hint);
}

vector<int> rez;

void divide_out(int l, int r, string hint) {
  //cerr << l << ' ' << r << ' ' << hint << '\n';
  if(l == r) {
    for(int i = 0; i < sz(hint); i++)
      if(hint[i] == '0') {
        rez[l] = i;
        return;
      }
    assert(false);
  }

  

  int mid = l + r >> 1;
  vector<int> lf, rh;
  for(int i = 0; i < sz(hint); i++) {
    if(hint[i] == '1') continue;
    hint[i] = '1';
    if(check_element(hint))
      //cerr << "L " << hint << '\n',
      lf.emplace_back(i);
    else
      //cerr << "R " << hint << '\n',
      rh.emplace_back(i);
    hint[i] = '0';
  }
  
  
  for(auto x : rh)
    hint[x] = '1';
    
  divide_out(l, mid, hint);
  
  for(auto x : rh)
    hint[x] = '0';
  for(auto x : lf)
    hint[x] = '1';
  
  divide_out(mid + 1, r, hint);
}

vector<int> restore_permutation(int n, int w, int r) {
  rez.resize(n);

  string hint;
  hint.resize(n);
  fill(all(hint), '0');
  
  divide_in(0, n - 1, hint);
  compile_set();
  divide_out(0, n - 1, hint);
  vector<int> inv(n);
  for(int i = 0; i < sz(rez); i++)
    inv[rez[i]] = i;
  return inv;
}

Compilation message

messy.cpp: In function 'void divide_in(int, int, std::string)':
messy.cpp:12:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |   int mid = l + r >> 1;
      |             ~~^~~
messy.cpp: In function 'void divide_out(int, int, std::string)':
messy.cpp:44:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 0 ms 300 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 340 KB n = 8
11 Correct 0 ms 300 KB n = 8
12 Correct 1 ms 224 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 0 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 1 ms 304 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 304 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 0 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 212 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 0 ms 212 KB n = 32
2 Correct 0 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 0 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 0 ms 212 KB n = 32
9 Correct 0 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 304 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 0 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 428 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 2 ms 436 KB n = 128
5 Correct 2 ms 428 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 436 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 432 KB n = 128
12 Correct 2 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 432 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 432 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 432 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 2 ms 468 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 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128