제출 #53419

#제출 시각아이디문제언어결과실행 시간메모리
53419diegogrc앵무새 (IOI11_parrots)C++17
0 / 100
5 ms2056 KiB
#include "encoder.h" #include "encoderlib.h" #include<bits/stdc++.h> #define MAX 100 using namespace std; void encode(int N, int M[]) { for( int i = 0; i < N; i ++ ) { for( int j = 0; j < 8; j ++ ) { // Manda el num int tmp = 0; if( M[i] & ( 1 << j ) ) tmp = 1; tmp <<= 3; tmp += j; tmp <<= 4; tmp += i; send( tmp ); } } }
#include "decoder.h" #include "decoderlib.h" #include<bits/stdc++.h> #define MAX 100 using namespace std; int ans[MAX]; void decode(int N, int L, int X[]) { for( int i = 0; i < L; i ++ ) { int pos = X[i] & 15; X[i] >>= 4; int j = X[i] & 7; X[i] >>= 3; if( X[i] ) ans[pos] += ( 1 << j ); } for( int i = 0; i < N; i ++ ) output( ans[i] ); }
#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...