oj.uz

답안 #388894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388894 2021-04-13T09:05:52 Z jjang36524 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 464 KB 
#include <vector>

#include "messy.h"
using namespace std;
int N;
void pus(int s,int e)
{
    if(s+1==e)
        return;
    string st;
    int i;
    for(i=0;i<N;i++)
    {
        st.push_back('0');
    }
    for(i=s;i<e;i++)
    {
        st[i]='1';
    }
    for(i=s;i<(e+s)/2;i++)
    {
        st[i]='0';
        add_element(st);
        st[i]='1';
    }
    pus(s,(s+e)/2);
    pus((s+e)/2,e);
}
vector<int>an;
void pus(int s,int e,vector<int>x)
{
    if(s+1==e)
    {
        an[x[0]]=s;
        return;
    }
    string st;
    int i;
    for(i=0;i<N;i++)
    {
        st.push_back('0');
    }
    for(i=0;i<x.size();i++)
    {
        st[x[i]]='1';
    }
    vector<int>l;
    vector<int>r;
    for(i=0;i<x.size();i++)
    {
        st[x[i]]='0';
        int a=check_element(st);
        if(a)
            l.push_back(x[i]);
        else
            r.push_back(x[i]);
        st[x[i]]='1';
    }
    pus(s,(s+e)/2,l);
    pus((s+e)/2,e,r);
}
std::vector<int> restore_permutation(int n, int w, int r)
{
    N=n;
    pus(0,N);
    compile_set();
    vector<int>al;
    int i;
    for(i=0;i<n;i++)
    {
        an.push_back(0);
        al.push_back(i);
    }
    pus(0,N,al);
    return an;
}

Compilation message

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 1 ms 204 KB n = 8
3 Correct 0 ms 204 KB n = 8
4 Correct 0 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 0 ms 204 KB n = 8
7 Correct 0 ms 208 KB n = 8
8 Correct 1 ms 204 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 0 ms 204 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 0 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 292 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 208 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 292 KB n = 32
13 Correct 1 ms 292 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 208 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 256 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 208 KB n = 32
13 Correct 1 ms 292 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB n = 128
2 Correct 2 ms 460 KB n = 128
3 Correct 2 ms 460 KB n = 128
4 Correct 2 ms 428 KB n = 128
5 Correct 2 ms 424 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 2 ms 460 KB n = 128
8 Correct 2 ms 416 KB n = 128
9 Correct 2 ms 460 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 460 KB n = 128
12 Correct 2 ms 464 KB n = 128
13 Correct 2 ms 428 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB n = 128
2 Correct 3 ms 460 KB n = 128
3 Correct 2 ms 460 KB n = 128
4 Correct 2 ms 460 KB n = 128
5 Correct 2 ms 424 KB n = 128
6 Correct 2 ms 460 KB n = 128
7 Correct 2 ms 460 KB n = 128
8 Correct 2 ms 460 KB n = 128
9 Correct 2 ms 448 KB n = 128
10 Correct 2 ms 460 KB n = 128
11 Correct 2 ms 428 KB n = 128
12 Correct 2 ms 460 KB n = 128
13 Correct 2 ms 460 KB n = 128
14 Correct 2 ms 460 KB n = 128
15 Correct 2 ms 460 KB n = 128