Submission #1094859

#	Time	Username	Problem	Language	Result	Execution time	Memory
1094859		steveonalex	Parrots (IOI11_parrots)	C++17	98 / 100	6 ms	1472 KiB

encoder

#include <bits/stdc++.h>
#include "encoder.h"
 #include "encoderlib.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void encode(int N, int M[]){
    string s;
    for(int i = 0; i<N; ++i) {
        for(int j = 0; j < 8; ++j) s.push_back('0' + GETBIT(M[i], j));
    }
    vector<pair<int, int>> mp(4);
    for(int i = 0; i < 4; ++i) mp[i].second = i;
    for(int i= 0; i< s.size(); i += 2) {
        int cur = (s[i] - '0') + (s[i+1] - '0') * 2;
        mp[cur].first++;
    }
    sort(ALL(mp), greater<pair<int,int>>());

    vector<int> pos(4);
    for(int i = 0; i < 4; ++i) pos[mp[i].second] = i;
    for(int i= 0; i< s.size(); i += 2) {
        int cur = (s[i] - '0') + (s[i+1] - '0') * 2;
        cur = pos[cur];
        while(cur--) send(i / 2);
    }

    int chim = 0;
    for(int i = 0; i< 4; ++i) chim += MASK(i * 2) * pos[i];
    for(int i= 0; i < 4; ++i) send(chim);
}

decoder

#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


void decode(int N, int L, int X[]){
    vector<int> ans(N);
    map<int, int> mp;
    for(int i = 0; i <= 255; ++i) mp[i] = 0;
    for(int i = 0; i < L; ++i) mp[X[i]]++;

    vector<int> pos(4);
    for(pair<int, int> i: mp) if (i.second >= 4) {
        for(int j = 0; j < 4; ++j){
            pos[GETBIT(i.first, j * 2) + 2 * GETBIT(i.first, j * 2 + 1)] = j;
        }
        break;
    }
    for(pair<int, int> i: mp){
        int cu = i.first * 2;
        i.second %= 4;
        if (cu / 8 >= ans.size()) continue;
        ans[cu / 8] += MASK(cu % 8) * pos[i.second];
    }
    for(int i: ans) output(i);
}

Compilation message (stderr)

encoder.cpp: In function 'void encode(int, int*)':
encoder.cpp:64:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i= 0; i< s.size(); i += 2) {
      |                   ~^~~~~~~~~~
encoder.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     for(int i= 0; i< s.size(); i += 2) {
      |                   ~^~~~~~~~~~

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:74:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         if (cu / 8 >= ans.size()) continue;
      |             ~~~~~~~^~~~~~~~~~~~~

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