제출 #71504

#제출 시각아이디문제언어결과실행 시간메모리
71504FLDutchmanParrots (IOI11_parrots)C++14
88 / 100
20 ms2800 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[]){
	if(N <= 32) FOR(i, 0, N) FOR(j, 0, 8) {if(M[i]&(1<<j)) send( (i<<3)+j);} 
	else {
		int cnt = 0;
		FOR(i, 0, N) FOR(j, 0, 4){
			int m = M[i];
			int k = (m>>(2*j))& 3 ;
			//cerr << cnt << endl;
			FOR(_,0,k) {send( (i<<2)+j); cnt++;}
		}
	}
}
#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[]) {
	if(N <= 32){
		vi msg(N, 0) ;
		FOR(i, 0, L) msg[ (X[i]) >>3] |= 1<<(X[i]&7);
		FOR(i, 0, N) output(msg[i]);
	} else {
		vi msg(4*N, 0);
		FOR(i, 0, L) msg[X[i]]++;
		//for(int k : msg) cout << k << " ";
		//cout<<endl;
		FOR(i, 0, N) {
			int c = 0;
			FOR(k, 0, 4) c |= msg[4*i+k] << (2*k);
			//cerr<<c<<endl;
			output(c);
		}
	}
}
#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...