oj.uz

Submission #422015

# Submission time Handle Problem Language Result Execution time Memory
422015 2021-06-09T14:49:07 Z Berted Sequence (BOI14_sequence) C++14
9 / 100
 8 ms 352 KB 
#include <iostream>

using namespace std;

int N, A[100001], ans = 0;
bool same = 1;

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
		if (i) same |= (A[i] == A[i - 1]);
	}
	if (N <= 1000)
	{
		for (int i = 1; i <= 1000; i++)
		{
			for (int j = 0; j < N; j++)
			{
				int c = i + j;
				bool exist = 0;
				while (c) {exist |= (A[j] == c % 10); c /= 10;}
				if (!exist) {break;}
				else if (j == N - 1) {ans = i;}
			}
			if (ans) break;
		}
	}
	else
	{
		ans = A[0];
		if (A[0] == 9)
		{
			int cnt = 1;
			while (cnt < N) {cnt *= 10; cnt++; ans--; ans *= 10; ans += 9;}
		}
		else
		{
			N--;
			if (!ans) ans = 10;
			while (N) {N /= 10; ans *= 10;}
		}
		
	}
	
	cout << ans << "\n";

	//cerr << "ANS2: " << ans << "\n";
	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 33.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 33.0

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