제출 #71481

#제출 시각아이디문제언어결과실행 시간메모리
71481FLDutchman앵무새 (IOI11_parrots)C++14
81 / 100
9 ms2416 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;

typedef int INT;

#define FOR(i,l,r) for(int i = (l); i < (r); i++)
#define snd second
#define fst first
#define V vector
#define pb push_back

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;


void encode(int N, int M[]){
	FOR(i, 0, N) FOR(j, 0, 8) {
		if(M[i]&(1<<j)) send( (i<<3)+j); 
	}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

typedef int INT;

#define FOR(i,l,r) for(int i = (l); i < (r); i++)
#define snd second
#define fst first
#define V vector
#define pb push_back

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;


void decode(int N, int L, int X[]) {
	vi msg(N, 0) ;
	FOR(i, 0, L) msg[ (X[i]) >>3] |= 1<<(X[i]&7);
	FOR(i, 0, N) output(msg[i]);
	//FOR(i,0,N) cout << msg[i] << " ";
	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...