# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79845 | doowey | 앵무새 (IOI11_parrots) | C++14 | 11 ms | 1776 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 <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int n, int arr[])
{
vector<int> qr;
int x;
for(int i = 0 ; i < n; i ++ ){
x = arr[i];
for(int j = 0 ;j < 4; j ++ ){
qr.push_back(x % 4);
x /= 4;
}
}
for(int t = 0; t < qr.size(); t ++ ){
for(int e = 0; e < qr[t]; e ++ )
send(t);
}
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int n, int k, int x[]){
int m = n * 4;
vector<int> qr(m);
for(int i = 0 ; i < m ; i ++ )
qr[i] = 0;
for(int d = 0 ; d < k; d ++ ){
qr[x[d]] ++ ;
}
int l, r;
int p;
int sm;
for(int i = 0 ; i < n; i ++ ){
l = i * 4;
r = l + 4;
p = 1;
sm = 0;
for(int z = l; z < r; z ++ ){
sm += qr[z] * p;
p *= 4;
}
output(sm);
}
}
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... |