| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 950575 | Pring | Costinland (info1cup19_costinland) | C++17 | 2 ms | 604 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>
using namespace std;
#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;
const int MXN = 50;
int x;
int n;
char c[MXN][MXN];
vector<pii> w[6] = {
vector<pii>{},
vector<pii>{mp(2LL, 0LL)},
vector<pii>{mp(2LL, 0LL), mp(0LL, 2LL)},
vector<pii>{mp(2LL, 1LL)},
vector<pii>{mp(2LL, 0LL), mp(2LL, 1LL)},
vector<pii>{mp(2LL, 0LL), mp(2LL, 1LL), mp(0LL, 2LL)}
};
vector<int> base6(int x) {
vector<int> v;
while (x) {
v.push_back(x % 6);
x /= 6;
}
return v;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||