oj.uz

Submission #645086

# Submission time Handle Problem Language Result Execution time Memory
645086 2022-09-26T07:49:28 Z ToroTN Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#include "messy.h"
string test;
vector<int> ans;
vector<int> v;
int bruh,hsh[128],it=0,answer[128];
void build(int st,int ed)
{
    int md=(st+ed)/2;
    if(st==ed)
    {
        return;
    }
    test.clear();
    for(int i=1;i<=bruh;i++)test.pb('1');
    for(int i=st;i<=ed;i++)test[i-1]='0';
    for(int i=st;i<=md;i++)
    {
        test[i-1]='1';
        //cout << test << endl;
        add_element(test);
        test[i-1]='0';
    }
    build(st,md);
    build(md+1,ed);
}
void finalize(int st,int ed)
{
    vector<int> nathan,pasin;
    int md=(st+ed)/2;
    if(st==ed)
    {
        memset(hsh,0,sizeof hsh);
        for(int i=0;i<v.size();i++)
        {
            //printf("%d ",v[i]);
            ++hsh[v[i]];
        }
        //printf("\n");
        for(int i=0;i<bruh;i++)
        {
            if(hsh[i]==0)
            {
                answer[i]=it;
                ++it;
            }
        }
        return;
    }
    //printf("%d %d\n",st,ed);
    test.clear();
    for(int i=1;i<=bruh;i++)test.pb('0');
    for(int i=0;i<v.size();i++)test[v[i]]='1';
    for(int i=1;i<=bruh;i++)
    {
        if(test[i-1]=='0')
        {
            test[i-1]='1';
            //cout << test << endl;
            if(check_element(test)==1)
            {
                nathan.pb(i-1);
            }else
            {
                v.push_back(i-1);
                pasin.pb(i-1);
            }
            test[i-1]='0';
        }
    }
    /*printf("v\n");
    for(int i=0;i<v.size();i++)
    {
        printf("%d ",v[i]);
    }
    printf("\n");
    printf("nathan\n");
    for(int i=0;i<nathan.size();i++)
    {
        printf("%d ",nathan[i]);
    }
    printf("\n");
    printf("pasin\n");
    for(int i=0;i<pasin.size();i++)
    {
        printf("%d ",pasin[i]);
    }
    printf("\n");*/
    finalize(st,md);
    ////
    /*
    code ever!!
    for(int i=0;i<pasin.size();i++)v.pop_back();
    for(int i=0;i<nathan.size();i++)
    {
        v.pb(nathan[i]);
    }
    */
    ////

    // printf("pasin\n");
    // for(int i=0;i<pasin.size();i++)
    // {
    //     printf("%d ",pasin[i]);
    // }
    // printf("\n");
    memset(hsh,0,sizeof hsh);
    v.clear();
    for(int i=0;i<pasin.size();i++)
    {
        ++hsh[pasin[i]];
    }
    for(int i=0;i<bruh;i++)
    {
        if(hsh[i]==0)v.push_back(i);
    }
    finalize(md+1,ed);
}
std::vector<int> restore_permutation(int n, int w, int r) {
    /*add_element("0");
    compile_set();
    check_element("0");
    return std::vector<int>();*/
    bruh=n;
    //for(int i=0;i<n;i++)ans.pb(i);
    build(1,n);
    //printf("\n");
    compile_set();
    finalize(1,n);
    for(int i=0;i<n;i++)ans.pb(answer[i]);
    return ans;
}

Compilation message

messy.cpp: In function 'void finalize(int, int)':
messy.cpp:37:22: 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:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i=0;i<v.size();i++)test[v[i]]='1';
      |                 ~^~~~~~~~~
messy.cpp:112:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for(int i=0;i<pasin.size();i++)
      |                 ~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

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