제출 #1002706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002706		c2zi6	앵무새 (IOI11_parrots)	C++14	52 / 100	1 ms	1320 KiB

encoder

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "encoder.h"
#include "encoderlib.h"

namespace encoder {
    int shm(int x) {
        return (1<<x)-1;
    }
};
using namespace encoder;

void encode(int N, int M[]) {
    int n = N;
    VI a;
    rep(i, n) a.pb(M[i]);

    rep(i, n) {
        send((a[i]>>4) + (i<<4));
        send((a[i]>>4) + (i<<4));
        send((a[i]&shm(4)) + (i<<4));
    }
}

/*send*/

decoder

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "decoder.h"
#include "decoderlib.h"

namespace decoder {
    int shm(int x) {
        return (1<<x)-1;
    }
};
using namespace decoder;

void decode(int N, int L, int X[]) {
    int n = N;
    VI a;
    rep(i, L) a.pb(X[i]);
    VVI ret(n);
    for (int x : a) {
        ret[x>>4].pb(x & shm(4));
    }
    for (VI vec : ret) {
        int a = vec[0];
        int b = vec[1];
        int c = vec[2];
        if (a == b) output((a<<4)+c);
        else if (a == c) output((a<<4)+b);
        else output((b<<4)+a);
    }
}

/*output*/

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