oj.uz

Submission #338702

# Submission time Handle Problem Language Result Execution time Memory
338702 2020-12-23T17:14:17 Z limabeans Sequence (BOI14_sequence) C++17
34 / 100
 1000 ms 1388 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;



int n;
vector<int> a;



set<int> digits(int x) {
    set<int> res;
    while (x) {
	res.insert(x%10);
	x/=10;
    }
    return res;
}

bool test(int x) {
    for (int i=0; i<n; i++) {
	int cur=x+i;
	bool ok = false;
	while (cur) {
	    if (a[i]==cur%10) {
		ok=true; break;
	    }
	    cur/=10;
	}
	if (!ok) {
	    return false;
	}
    }
    return true;
}

int brute(vector<int> a) {
    for (int i=1; ; i++) {
	if (test(i)) return i;
    }
    assert(false);
    return -1;
}

int solve1(int d) {
    if (1<=d && d<=8) {
	int ten = 1;
	while (ten < n) ten *= 10;
	return d*ten;
    } else if (d==0) {
	int ans = 10;
	int hit = 1;
	while (hit<n) {
	    ans *= 10;
	    hit *= 10;
	    hit += 1;
	}
	return ans;
    } else if (d==9) {
	for (int len=1;;len++) {
	    string lo;
	    for (int i=0; i<len-1; i++) lo += '8';
	    lo += '9';
	    string hi(len,'9');
	    int have = stoi(hi)-stoi(lo)+1;
	    if (have >= n) {
		return stoi(lo);
	    }
	}
    }

    assert(false);
    return -1;

}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    a.resize(n);
    set<int> st;
    for (int i=0; i<n; i++) {
	cin>>a[i];
	st.insert(a[i]);
    }
    
    if ((int)st.size() == 1) {
	int res = solve1(a[0]);
	out(res);
    }

    int bru = brute(a);
    out(bru);
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Execution timed out 1098 ms 364 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 748 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 8 ms 876 KB Output is correct

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 231 ms 620 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 927 ms 1388 KB Output is correct
12 Execution timed out 1091 ms 1260 KB Time limit exceeded
13 Halted 0 ms 0 KB -