제출 #198367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
198367		stefdasca	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	9 ms	1604 KiB

messy

#include<bits/stdc++.h>
#include<messy.h>
using namespace std;

int N;
int poz[202];
vector<int> pospoz[202][202];
void build(int st, int dr)
{
    if(st == dr)
        return;
    string s;
    for(int i = 0; i < N; ++i)
        s += '1';
    int mid = (st + dr) / 2;
    for(int i = st; i <= dr; ++i)
        s[i] = '0';
    for(int i = st; i <= mid; ++i)
    {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    build(st, mid);
    build(mid+1, dr);
}
void restore(int st, int dr)
{
    if(st == dr)
    {
        poz[st] = pospoz[st][st][0];
        return;
    }
    string twice;
    for(int i = 0; i < N; ++i)
        twice += '1';
    for(int i = 0; i < pospoz[st][dr].size(); ++i)
        twice[pospoz[st][dr][i]] = '0';
    int mid = (st + dr) / 2;
    for(int i = 0; i < pospoz[st][dr].size(); ++i)
    {
        int pp = pospoz[st][dr][i];
        twice[pp] = '1';
        bool xxx = check_element(twice);
        if(xxx)
            pospoz[st][mid].push_back(pp);
        else
            pospoz[mid+1][dr].push_back(pp);
        twice[pp] = '0';
    }
    restore(st, mid);
    restore(mid+1, dr);
}
vector<int> restore_permutation(int n, int w, int r)
{
    N = n;
    build(0, n-1);
    compile_set();
    for(int i = 0; i < n; ++i)
        pospoz[0][n-1].push_back(i);
    restore(0, n-1);
    vector<int> ans, ans2;
    for(int i = 0; i < n; ++i)
        ans.push_back(poz[i]);
    ans2.resize(n);
    for(int i = 0; i < n; ++i)
        ans2[ans[i]] = i;
    return ans2;
}

컴파일 시 표준 에러 (stderr) 메시지

messy.cpp: In function 'void restore(int, int)':
messy.cpp:37:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < pospoz[st][dr].size(); ++i)
                    ~~^~~~~~~~~~~~~~~~~~~~~~~
messy.cpp:40:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < pospoz[st][dr].size(); ++i)
                    ~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 11 / 11
• Subtask 4: 21 / 21
• Subtask 5: 30 / 30