oj.uz

Submission #67587

# Submission time Handle Problem Language Result Execution time Memory
67587 2018-08-15T04:54:16 Z mirbek01 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>

#include "messy.h"
//#include "grader.cpp"

using namespace std;

int n;
string s;
vector <int> ans, vv;

void fun(int l, int r){
      if(l >= r) return ;
      s = "";

      for(int i = 0; i < n; i ++){
            if(l <= i && i <= r)
                  s += '0';
            else
                  s += '1';
      }
      int md = (l + r) >> 1;
      for(int i = l; i <= md; i ++){
            s[i] = '1';
            add_element(s);
            s[i] = '0';
      }
      fun(l, md);
      fun(md + 1, r);
}

void rec(int l, int r){
      if(l >= r){
            return ;
      }
      s.resize(n);
      for(int i = 0; i < n; i ++){
            if(l <= i && i <= r)
                  s[ans[i]] = '0';
            else
                  s[ans[i]] = '1';
      }
      vector < int > v1, v2;
      int md = (l + r) >> 1;
      for(int i = l; i <= r; i ++){
            s[ans[i]] = '1';
            if(check_element(s))
                  v1.push_back(ans[i]);
            else
                  v2.push_back(ans[i]);
            s[ans[i]] = '0';
      }
      int p1 = 0, p2 = 0;
      for(int i = l; i <= r; i ++){
            if(i <= md){
                  ans[i] = v1[p1 ++];
            } else {
                  ans[i] = v2[p2 ++];
            }
      }
      rec(l, md);
      rec(md + 1, r);
}

vector<int> restore_permutation(int NN, int w, int r) {
      n = NN;
      ans.resize(n);
      vv.resize(n);
      for(int i = 0; i < n; i ++)
            ans[i] = i;
      fun(0, n - 1);
      compile_set();
      rec(0, n - 1);
      for(int i = 0; i < n; i ++){
            vv[ans[i]] = i;
      }
      return vv;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 8
2 Correct 2 ms 384 KB n = 8
3 Correct 2 ms 384 KB n = 8
4 Correct 2 ms 384 KB n = 8
5 Correct 2 ms 384 KB n = 8
6 Correct 2 ms 384 KB n = 8
7 Correct 2 ms 384 KB n = 8
8 Correct 2 ms 256 KB n = 8
9 Correct 2 ms 384 KB n = 8
10 Correct 2 ms 256 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 256 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 256 KB n = 32
3 Correct 2 ms 256 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 384 KB n = 32
8 Correct 2 ms 384 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 256 KB n = 32
13 Correct 2 ms 256 KB n = 32
14 Correct 2 ms 256 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 256 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 384 KB n = 32
8 Correct 2 ms 384 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 384 KB n = 32
13 Correct 2 ms 384 KB n = 32
14 Correct 2 ms 256 KB n = 32
15 Correct 2 ms 256 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 512 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 3 ms 512 KB n = 128
10 Correct 3 ms 512 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 3 ms 512 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 3 ms 512 KB n = 128
10 Correct 3 ms 512 KB n = 128
11 Correct 3 ms 640 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