oj.uz

Submission #231110

# Submission time Handle Problem Language Result Execution time Memory
231110 2020-05-12T18:21:50 Z a_player Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 6 ms 512 KB 
#include "messy.h"
#include <bits/stdc++.h>
#ifdef ALE
#include "grader.cpp"
#endif

using namespace std;
/*
add_element("0");
compile_set();
check_element("0");
*/
int N;
vector<int> ans;
void add(int l, int r){
  if(l==r)return;
  int m=(l+r)/2;
  string s(N,'1');
  for(int i=l;i<=r;i++)s[i]='0';

  for(int i=l;i<=m;i++){
    s[i]='1';
    add_element(s);
    s[i]='0';
  }
  add(l,m);
  add(m+1,r);
}
void search(int l, int r, vector<int> a){
  if(l==r){
    ans[a[0]]=l;
    return;
  }
  int m=(l+r)/2;
  string s(N,'1');
  for(int x:a)s[x]='0';
  vector<int> dx,sx;
  for(int x:a){
    s[x]='1';
    if(check_element(s))
        sx.push_back(x);
    else dx.push_back(x);
    s[x]='0';
  }
  search(l,m,sx);
  search(m+1,r,dx);

}
vector<int> restore_permutation(int n, int w, int r) {
  N=n;
  ans.resize(n);
  add(0,N-1);
  compile_set();
  vector<int> a(N);
  iota(a.begin(),a.end(),0);
  search(0,N-1,a);
  return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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