oj.uz

Submission #637653

# Submission time Handle Problem Language Result Execution time Memory
637653 2022-09-02T14:57:51 Z ggoh Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 520 KB 
#include "messy.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(v) ((int)(v).size())
typedef long long lint;
vector<int> restore_permutation(int n, int w, int r) {
    vector<int>ans;
    for(int i=0;i<n;i++)ans.push_back(i);
    string a,b;
    for(int i=0;i<n;i++)a+='1';
    for(int i=n;i>=2;i/=2)
    {
      for(int j=0;j<n;j+=i)
      {
        b=a;
        for(int k=0;k<i;k++)b[j+k]='0';
        for(int k=0;k<i/2;k++)
        {
          b[j+k]='1';
          add_element(b);
          b[j+k]='0';
        }
      }
    }
    compile_set();
    int l=1;
    vector<int>V[8][128];
    for(int i=0;i<n;i++)V[0][0].push_back(i);
    for(int i=n;i>=2;i/=2)
    {
      for(int j=0;j<n;j+=i)
      {
        b=a;
        for(int k=0;k<i;k++)b[V[l-1][j][k]]='0';
        for(int k=0;k<n;k++)
        {
          if(b[k]=='1')continue;
          b[k]='1';
          if(check_element(b))
          {
            V[l][j].push_back(k);
          }
          else
          {
            V[l][j+i/2].push_back(k);
          }
          b[k]='0';
        }
      }
      l++;
    }
    
    for(int i=0;i<n;i++)ans[V[l-1][i][0]]=i;

    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 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 1 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 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 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 0 ms 340 KB n = 32
2 Correct 1 ms 340 KB n = 32
3 Correct 1 ms 340 KB n = 32
4 Correct 0 ms 340 KB n = 32
5 Correct 1 ms 340 KB n = 32
6 Correct 1 ms 340 KB n = 32
7 Correct 1 ms 340 KB n = 32
8 Correct 1 ms 340 KB n = 32
9 Correct 0 ms 340 KB n = 32
10 Correct 1 ms 340 KB n = 32
11 Correct 1 ms 340 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 336 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 340 KB n = 32
3 Correct 1 ms 340 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 0 ms 340 KB n = 32
6 Correct 0 ms 340 KB n = 32
7 Correct 0 ms 340 KB n = 32
8 Correct 1 ms 340 KB n = 32
9 Correct 0 ms 340 KB n = 32
10 Correct 1 ms 340 KB n = 32
11 Correct 1 ms 340 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 0 ms 340 KB n = 32
14 Correct 0 ms 340 KB n = 32
15 Correct 0 ms 340 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 2 ms 424 KB n = 128
3 Correct 2 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 2 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 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 2 ms 424 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 2 ms 520 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 1 ms 428 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 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 1 ms 424 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 2 ms 468 KB n = 128
15 Correct 1 ms 432 KB n = 128