제출 #795037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
795037		ono_de206	앵무새 (IOI11_parrots)	C++14	0 / 100	4 ms	1232 KiB

encoder

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

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

//#define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

void encode(int n, int a[]) {
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < 4; j++) {
			int times = a[i] & 3;
			for(int k = 0; k < times; k++) {
				send(i | (j >> 6));
			}
		}
	}
}

decoder

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

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

//#define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

void decode(int n, int l, int x[]) {
	vector<int> ret(n);
	for(int i = 0; i < l; i++) {
		int id = x[i] & 63;
		int pos = x[i] >> 6;
		ret[id] += 1 << (pos * 2);
	}
	for(int i = 0; i < n; i++) {
		output(ret[i]);
	}
}

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