oj.uz

Submission #800701

# Submission time Handle Problem Language Result Execution time Memory
800701 2023-08-01T18:30:09 Z kirakaminski968 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
int n, occ[128];
void solve(int l, int r){
  if(l == r) return; 
  string s; 
  for(int i = 0;i<n;++i) s.push_back('0'); 
  for(int i = l;i<=r;++i) s[i] = '1'; 
  int mid = (l+r)/2; 
  for(int j = mid+1;j<=r;++j){
    s[j] = '0'; 
    add_element(s); 
    s[j] = '1'; 
  }
  solve(l,mid); 
  solve(mid+1,r); 
}

void solve2(int l, int r, vector<int> v){
  if(l == r){
    occ[v[0]] = l; 
    return; 
  }
  int mid = (l+r)/2; 
  string s; 
  for(int i = 0;i<n;++i) s.push_back('0'); 
  for(auto x : v) s[x] = '1'; 
  vector<int> low, high; 
  for(auto x : v){
    s[x] = '0'; 
    if(check_element(s)) high.push_back(x); 
    else low.push_back(x); 
    s[x] = '1'; 
  }
  solve2(l,mid,low); 
  solve2(mid+1,r,high); 
}

vector<int> restore_permutation(int N, int w, int r) {
  n = N; 
  solve(0,N-1); 
  compile_set(); 
  vector<int> vec;
  for(int i = 0;i<n;++i) vec.push_back(i);
  solve2(0,n-1,vec);
  vector<int> ans;
  for(int i=0; i<n; i++) ans.push_back(occ[i]);
  return ans;
}

Subtask #1
20.0 / 20.0

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