제출 #1363052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1363052		ericl23302	앵무새 (IOI11_parrots)	C++20	98 / 100	5 ms	836 KiB

encoder

#include "encoder.h"

#include <algorithm>
#include <cmath>
#include <numeric>
#include <unordered_map>
#include <vector>

#include "encoderlib.h"

using namespace std;

void encode(int N, int M[]) {
    int n = 7, cnt = 0;
    vector<int> combs;
    unordered_map<int, int> m;
    for (int i1 = 0; i1 <= n; ++i1) {
        for (int i2 = 0; i1 + i2 <= n; ++i2) {
            for (int i3 = 0; i1 + i2 + i3 <= n; ++i3) {
                for (int i4 = 0; i1 + i2 + i3 + i4 <= n; ++i4) {
                    int val = i1 * 1000 + i2 * 100 + i3 * 10 + i4 * 1;
                    combs.push_back(val);
                    m[val] = cnt++;
                }
            }
        }
    }

    for (int i = 0; i < N; ++i) {
        int cur = i * 4, val = combs[M[i]];
        while (val >= 1000) send(cur + 3), val -= 1000;
        while (val >= 100) send(cur + 2), val -= 100;
        while (val >= 10) send(cur + 1), val -= 10;
        while (val >= 1) send(cur + 0), val -= 1;
    }
}

decoder

#include "decoder.h"

#include <algorithm>
#include <cmath>
#include <numeric>
#include <unordered_map>
#include <vector>

#include "decoderlib.h"

using namespace std;

void decode(int N, int L, int X[]) {
    int n = 7, cnt = 0;
    vector<int> combs;
    unordered_map<int, int> m;
    for (int i1 = 0; i1 <= n; ++i1) {
        for (int i2 = 0; i1 + i2 <= n; ++i2) {
            for (int i3 = 0; i1 + i2 + i3 <= n; ++i3) {
                for (int i4 = 0; i1 + i2 + i3 + i4 <= n; ++i4) {
                    int val = i1 * 1000 + i2 * 100 + i3 * 10 + i4 * 1;
                    combs.push_back(val);
                    m[val] = cnt++;
                }
            }
        }
    }

    vector<int> res(N);
    for (int i = 0; i < L; ++i) {
        int idx = X[i] / 4;
        res[idx] += pow(10, X[i] % 4);
    }
    for (auto& i : res) output(m[i]);
}

• 서브태스크 1: 17 / 17
• 서브태스크 2: 17 / 17
• 서브태스크 3: 18 / 18
• 서브태스크 4: 29 / 29
• 서브태스크 5: 17 / 19