# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679343 | Cross_Ratio | Parrots (IOI11_parrots) | C++14 | 5 ms | 1328 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;
array<int, 4> B[105];
void encode(int N, int M[]) {
int i, j;
B[0] = {0, 0, 0, 0};
B[1] = {0, 0, 0, 1};
B[2] = {0, 0, 0, 2};
B[3] = {0, 0, 0, 3};
B[4] = {0, 0, 1, 1};
B[5] = {0, 0, 1, 2};
B[6] = {0, 0, 1, 3};
B[7] = {0, 0, 2, 2};
B[8] = {0, 0, 2, 3};
B[9] = {0, 0, 3, 3};
B[10] = {0, 1, 1, 1};
B[11] = {0, 1, 1, 2};
B[12] = {0, 1, 1, 3};
B[13] = {0, 1, 2, 2};
B[14] = {0, 1, 2, 3};
B[15] = {0, 1, 3, 3};
for(i=0;i<N;i++) {
int x = M[i] / (1<<4);
for(j=0;j<4;j++) {
int val = (1<<3) * i + 0 * (1<<2) + B[x][j];
send(val);
}
x = M[i] % (1<<4);
# | 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... |