# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398637 | mars | Sequence (BOI14_sequence) | C++14 | 159 ms | 1240 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.
/*
* A solution for task Sequence.
* Complexity - O(K log K).
*
* Author: Daumilas Ardickas
* Idea: Vytautas Gruslys
*/
#include <cstdio>
#include <vector>
using namespace std;
long long minN(const vector<int>& A, bool try9 = true) {
long long m = 102345678900000L;
if (A.size() == 1) {
m = 0;
for (int a = 1; a <= 9; a++)
if (A[0] & (1 << a)) {
m = m * 10 + a;
if (m == a && A[0] & 1) m *= 10;
}
if (m == 0 && A[0] & 1) m = 10;
return m;
}
for (int n = 0; n < 9 + try9; n++) {
int y = n, a = 0;
bool zero = false;
vector<int> B;
for (int i = 0; i < A.size(); i++) {
a |= A[i] & (1023 - (1 << y));
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... |