Submission #351440

#	Time	Username	Problem	Language	Result	Execution time	Memory
351440		talant117408	Parrots (IOI11_parrots)	C++17	34 / 100	2 ms	1456 KiB

encoder

#include "encoder.h"
#include "encoderlib.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

void encode(int N, int M[]){
    vector <int> v(N);
    for(int i = 0; i < N; i++){
        v[i] = M[i];
        for(int bit = 8; bit < 16; bit++){
            if(i&(1<<(bit-8))){
                v[i] |= (1<<bit);
            }
        }
    }
    for(auto to : v) send(to);
}

decoder

#include "decoder.h"
#include "decoderlib.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

void decode(int N, int L, int X[]){
    vector <pii> v;
    for(int i = 0; i < L; i++){
        int ind = 0, num = 0;
        for(int bit = 0; bit < 8; bit++){
            if(X[i]&(1<<bit)) num |= (1<<bit);
            if(X[i]&(1<<(bit+8))) ind |= (1<<(bit+8));
        }
        v.pb(mp(ind, num));
    }
    sort(all(v));
    for(auto to : v) output(to.second);
}

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