# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
351673 | kylych03 | Parrots (IOI11_parrots) | C++14 | 45 ms | 1676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
int i, xr, res = 1e9;
for(int t = 0 ; t <= 255; t++){
int cnt = 0;
for(i = 0 ; i < N; i++){
int f = (M[i] ^ t);
for(int j= 0 ; j < 8 ;j++){
if(( f>>j )&1){
if(j%2==1)
cnt++;
cnt++;
}
}
}
if(cnt < res){
res = cnt;
xr = t;
}
}
for(i = 0 ; i < N; i++)
M[i]^=(xr);
if(N > 32){
for(i=0; i<N; i++){
int packet=(i<<2);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |