oj.uz

Submission #592004

# Submission time Handle Problem Language Result Execution time Memory
592004 2022-07-08T11:12:45 Z yutabi Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;


#define pb push_back


#include "messy.h"


vector <int> digits[256];

vector <int> ans;


int N;


void write(int l=0, int r=N-1, int node=1)
{
    if(l==r)
    {
        return;
    }

    string str="";

    for(int i=0;i<N;i++)
    {
        if(l<=i && i<=r)
        {
            str+='0';
        }

        else
        {
            str+='1';
        }
    }

    int m=(l+r)/2;

    for(int i=l;i<=m;i++)
    {
        str[i]='1';

        add_element(str);

        str[i]='0';
    }

    write(l,m,node*2);
    write(m+1,r,node*2+1);
}


void read(int l=0, int r=N-1, int node=1)
{
    if(l==r)
    {
        ans[digits[node][0]]=l;

        return;
    }

    string str="";

    for(int i=0;i<N;i++)
    {
        str+='1';
    }

    for(int i=0;i<digits[node].size();i++)
    {
        str[digits[node][i]]='0';
    }

    for(int i=0;i<digits[node].size();i++)
    {
        str[digits[node][i]]='1';

        if(check_element(str))
        {
            digits[node*2].pb(digits[node][i]);
        }

        else
        {
            digits[node*2+1].pb(digits[node][i]);
        }

        str[digits[node][i]]='0';
    }

    int m=(l+r)/2;

    read(l,m,node*2);
    read(m+1,r,node*2+1);
}


std::vector<int> restore_permutation(int n, int w, int r)
{
    N=n;

    write();

    compile_set();

    ans=vector <int> (N);

    for(int i=0;i<N;i++)
    {
        digits[1].pb(i);
    }

    read();

    return ans;
}

Compilation message

messy.cpp: In function 'void read(int, int, int)':
messy.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0;i<digits[node].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~~
messy.cpp:78:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i=0;i<digits[node].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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