oj.uz

Submission #370166

# Submission time Handle Problem Language Result Execution time Memory
370166 2021-02-23T14:01:14 Z leinad2 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 640 KB 
#include "messy.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>ans;
int n;
void add(int l, int r)
{
    if(l==r)return;
    int m=l+r>>1;
    for(int j=l;j<=m;j++)
    {
        string s;
        for(int i=0;i++<n;)
        {
            if(l<=i&&i<=r)
            {
                if(i==j)s+='1';
                else s+='0';
            }
            else s+='1';
        }
        add_element(s);
    }
    add(l, m);
    add(m+1, r);
}
void chk(int l, int r, vector<int>v)
{
    if(l==r)
    {
        ans[v[0]-1]=l-1;
        return;
    }
    int m=l+r>>1;
    vector<int>L, R;
    int A[130]={};
    for(int i=0;i<v.size();i++)
    {
        A[v[i]]=1;
    }
    for(int i=0;i<v.size();i++)
    {
        string s;
        for(int j=0;j++<n;)
        {
            if(A[j])
            {
                if(j==v[i])s+='1';
                else s+='0';
            }
            else s+='1';
        }
        if(check_element(s))L.push_back(v[i]);
        else R.push_back(v[i]);
    }
    chk(l, m, L);
    chk(m+1, r, R);
}
vector<int>restore_permutation(int N, int w, int r)
{
  n=N;
    ans.resize(n);
    vector<int>v;for(int i=0;i++<n;)v.push_back(i);
    add(1, n);
    compile_set();
    chk(1, n, v);
    return ans;
}

Compilation message

messy.cpp: In function 'void add(int, int)':
messy.cpp:9:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    9 |     int m=l+r>>1;
      |           ~^~
messy.cpp: In function 'void chk(int, int, std::vector<int>)':
messy.cpp:34:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |     int m=l+r>>1;
      |           ~^~
messy.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
messy.cpp:41:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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