Submission #761908

#	Time	Username	Problem	Language	Result	Execution time	Memory
761908		phoebe	Parrots (IOI11_parrots)	C++17	0 / 100	3 ms	1072 KiB

encoder

#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;

#define ll long long

static const int maxx = 31;
static ll idx, dp[22][32];

ll raw_to_hash(vector<int> &v){
    ll re = 0;
    for (int i = 0; i < v.size(); i++){
        int rem_length = v.size() - i - 1;
        re += v[i] * pow(256, rem_length);
    }
    return re;
}

ll cnt_encoded(int i, int x){
    if (dp[i][x] != -1) return dp[i][x];
    if (i == 0) return 1ll;
    ll re = 0;
    for (int y = x; y <= maxx; y++) re += cnt_encoded(i - 1, y);
    dp[i][x] = re;
    return re;
}

void actually_encode(int i, ll rem, int last){
    // cout << i << ' ' << rem << ' ' << last << endl;
    if (i == 0) return;
    for (int y = last; y <= maxx; y++){
        ll cnt = cnt_encoded(i - 1, y);
        if (rem > cnt) rem -= cnt;
        else{
            send(idx + y);
            // cout << y << ' ';
            actually_encode(i - 1, rem, y);
            return;
        }
        // cout << rem << ' ' << cnt << endl;
    }
}

void encode(int N, int M[]){
    fill(&dp[0][0], &dp[0][0] + 22 * 32, -1);
    int angie = 0;
    for (int i = 0; i < N; i += 4){
        idx = angie<<5; angie++;
        vector<int> v;
        for (int j = i; j < min(N, i + 4); j++){
            v.push_back(M[j]);
        }
        // for (auto k : v) cout << k << ' '; cout << endl;
        ll hash = raw_to_hash(v);
        // cout << "encoder hash: " << hash << endl;
        actually_encode(v.size() * 5, hash, 0);
        // cout << endl;
    }
    // cout << endl << endl;
}

decoder

#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;

#define ll long long

static const int maxx = 31;
static ll dp[22][32];

ll cnt_decode(int i, int x){
    if (dp[i][x] != -1) return dp[i][x];
    if (i == 0) return 1ll;
    ll re = 0;
    for (int y = x; y <= maxx; y++) re += cnt_decode(i - 1, y);
    dp[i][x] = re;
    return re;
}

void actually_decode(int i, ll rem){
    if (i == 0) return;
    for (int y = 0; y <= 255; y++){
        ll cnt = pow(256, i - 1);
        if (rem >= cnt) rem -= cnt;
        else{
            // cout << y << ' ' << rem << endl;
            output(y);
            actually_decode(i - 1, rem);
            return;
        }
    }
}

void decode(int N, int L, int X[]){
    fill(&dp[0][0], &dp[0][0] + 22 * 32, -1);
    sort(X, X + L); 
    // for (int i = 0; i < L; i++) cout << X[i] << ' '; cout << endl;
    for (int i = 0; i < L; i += 4 * 5){
        vector<int> v;
        for (int j = i; j < min(L, i + 20); j++){
            v.push_back(X[j] % 32);
        }
        // for (auto k : v) cout << k << ' '; cout << endl;
        ll hash = 1;
        ll angie = 0;
        for (int j = 0; j < v.size(); j++){
            int sz = v.size() - j - 1;
            for (int x = (j == 0 ? 0 : v[j - 1]); x < v[j]; x++){
                hash += cnt_decode(sz, x);
            }
        }
        // cout << "decoder hash: " << hash << endl;
        actually_decode(v.size() / 5, hash);
    }
}

Compilation message (stderr)

encoder.cpp: In function 'long long int raw_to_hash(std::vector<int>&)':
encoder.cpp:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i = 0; i < v.size(); i++){
      |                     ~~^~~~~~~~~~

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:46:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int j = 0; j < v.size(); j++){
      |                         ~~^~~~~~~~~~
decoder.cpp:45:12: warning: unused variable 'angie' [-Wunused-variable]
   45 |         ll angie = 0;
      |            ^~~~~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 29
• Subtask 5: 0 / 19