Submission #1363065

#TimeUsernameProblemLanguageResultExecution timeMemory
1363065ericl23302Parrots (IOI11_parrots)C++20
98 / 100
7 ms920 KiB
#include "encoder.h"

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

#include "encoderlib.h"

using namespace std;

void encode(int N, int M[]) {
    int n = 7;
    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);
                }
            }
        }
    }

    sort(combs.begin(), combs.end(), [](const int& a, const int& b) {
        string sa = to_string(a), sb = to_string(b);
        int cntA = 0, cntB = 0;
        for (auto& i : sa) cntA += i - '0';
        for (auto& i : sb) cntB += i - '0';
        return cntA < cntB;
    });

    mt19937 g(82356120);

    shuffle(combs.begin(), combs.begin() + 256, g);
    for (int i = 0; i < 256; ++i) m[combs[i]] = i;

    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;
    }
}
#include "decoder.h"

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

#include "decoderlib.h"

using namespace std;

void decode(int N, int L, int X[]) {
    int n = 7;
    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);
                }
            }
        }
    }

    sort(combs.begin(), combs.end(), [](const int& a, const int& b) {
        string sa = to_string(a), sb = to_string(b);
        int cntA = 0, cntB = 0;
        for (auto& i : sa) cntA += i - '0';
        for (auto& i : sb) cntB += i - '0';
        return cntA < cntB;
    });

    mt19937 g(82356120);

    shuffle(combs.begin(), combs.begin() + 256, g);
    for (int i = 0; i < 256; ++i) m[combs[i]] = i;

    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]);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...