oj.uz

Submission #107672

# Submission time Handle Problem Language Result Execution time Memory
107672 2019-04-25T12:22:30 Z dfistric Sequence (BOI14_sequence) C++14
9 / 100
 14 ms 768 KB 
#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define ll long long

using namespace std;

const int MAXN = 100100;
ll arr[MAXN];

int main() {
    ios_base::sync_with_stdio(false);
 
    int n;
    cin >> n;
    REP(i, n) cin >> arr[i];

    if (n <= 1000) {
        REP(k, 1001) {
            int good = 1;
            REP(i, n) {
                int flag = 0, t = k + i;
                while (t > 0) {
                    if (t % 10 == arr[i]) flag = 1;
                    t /= 10;
                }
     
                if (!flag) good = 0;
            }
            if (good) {
                cout << k << "\n";
                return 0;
            }
        }
    }

    if (arr[0] != 9) {
        n--;
        int t = 1;
        while (t < n) t *= 10;

        if (arr[0] == 0) cout << 10 * t << "\n";
        else             cout << arr[0] * t << "\n";
    } else {
        int out = 8, curr = 1, inc = 10;
        while (curr < n) {
            curr += inc;
            out = out * 10 + 8;
            inc *= 10;
        }
        cout << out + 1 << "\n";
    }

    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 356 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 10 ms 384 KB Output is correct
15 Correct 9 ms 384 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 14 ms 504 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Incorrect 2 ms 512 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Incorrect 6 ms 768 KB Output isn't correct
6 Halted 0 ms 0 KB -