# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103758 | wxh010910 | Parrots (IOI11_parrots) | C++17 | 9 ms | 1536 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 M[]) {
vector<vector<long long>> dp(21, vector<long long>(16));
for (int i = 0; i < 16; ++i) {
dp[0][i] = 1;
}
for (int i = 1; i < 21; ++i) {
for (int j = 0; j < 16; ++j) {
for (int k = j; k < 16; ++k) {
dp[i][j] += dp[i - 1][k];
}
}
}
vector<long long> sum(21);
for (int i = 1; i < 21; ++i) {
sum[i] = sum[i - 1] + dp[i][0];
}
vector<int> a(M, M + N);
while (a.size() % 4) {
a.push_back(0);
++N;
}
for (int i = 0; i < N; i += 4) {
long long state = 0;
for (int j = 0; j < 4; ++j) {
# | 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... |