| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 503904 | t12345 | Parrots (IOI11_parrots) | C++14 | 8 ms | 1224 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 <vector>
using namespace std;
void encode(int N, int M[]) {
int i, j, t;
vector<int> c0, c1;
for(i=0; i<N; i++) {
t = M[i];
for(j=0; j<(t>>6&3); j++) c0.push_back(i*4);
for(j=0; j<(t>>4&3); j++) c0.push_back(i*4+1);
for(j=0; j<(t>>2&3); j++) c0.push_back(i*4+2);
for(j=0; j<(t>>0&3); j++) c0.push_back(i*4+3);
t = 3 - M[i];
for(j=0; j<(t>>6&3); j++) c1.push_back(i*4);
for(j=0; j<(t>>4&3); j++) c1.push_back(i*4+1);
for(j=0; j<(t>>2&3); j++) c1.push_back(i*4+2);
for(j=0; j<(t>>0&3); j++) c1.push_back(i*4+3);
}
if(c0.size() < c1.size()) {
for(i=0; i<c0.size(); i++) send(c0[i]);
} else {
for(i=0; i<c1.size(); i++) send(c1[i]);
for(i=0; i<4; i++) send(0);
}
}
#include "decoder.h"
#include "decoderlib.h"
void decode(int N, int L, int X[]) {
int i, c[260]={};
for(i=0; i<L; i++) c[X[i]]++;
if(c[0]<4) {
for(i=0; i<N; i++) {
output(c[i*4]*64 + c[i*4+1]*16 + c[i*4+2]*4 + c[i*4+3]);
}
} else {
c[0] -= 4;
for(i=0; i<N; i++) {
output((3-c[i*4])*64 + (3-c[i*4+1])*16 + (3-c[i*4+2])*4 + (3-c[i*4+3]));
}
}
}
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... | ||||
