Submission #17085

#	Time	Username	Problem	Language	Result	Execution time	Memory
17085		erdemkiraz	Parrots (IOI11_parrots)	C++98	34 / 100	6 ms	2064 KiB

encoder

#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)

typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

const int N = 100 + 5;

#include "encoder.h"
#include "encoderlib.h"

void encode(int n, int a[]) {
	for(int i = 0; i < n; i++) {
		send(i * 256 + a[i]);
	}
}

decoder

#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)

typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

const int N = 100 + 5;

////////////////////////////////////////////////////////////////////////////////////////////////

#include "decoder.h"
#include "decoderlib.h"

int ans[N];

void decode(int n, int m, int a[]) {
	for(int i = 0; i < m; i++) {
		ans[a[i] / 256] = a[i] % 256;
	}
	for(int i = 0; i < n; i++)
		output(ans[i]);
}

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