| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 421910 | juancarlovieri | Sequence (BOI14_sequence) | C++17 | 1072 ms | 2280 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
int ans = 1000000000000000000;
int pw[20];
void rek(vector<int> sections, int curr = 0, int level = 0, bool flag = false) {
if (curr >= ans) return;
int n = sections.size();
if (n == 1) {
int mask = sections[0];
if (!mask) {
if (!curr || flag) curr += pw[level];
} else if (mask == 1) curr += pw[level + 1];
else {
if (mask & 1) {
int mn = 10;
for (int i = 9; i; --i) {
if (mask & (1 << i)) mn = i;
}
for (int i = 9; i; --i) {
if ((mask & (1 << i)) && i != mn) curr += i * pw[level++];
}
curr += mn * pw[++level];
} else {
for (int i = 9; i; --i) {
if (mask & (1 << i)) curr += i * pw[level++];
| # | 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... | ||||