oj.uz

Submission #208655

# Submission time Handle Problem Language Result Execution time Memory
208655 2020-03-12T01:29:33 Z E869120 Sequence (BOI14_sequence) C++14
42 / 100
 1000 ms 98680 KB 
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

int N, A[1 << 18];
bool used[10000009][10];
bool used3[1009][10];
bool used4[10009][10];

void init() {
	for (int i = 0; i < 10000000; i++) {
		int cx = i;
		while (cx >= 1) {
			used[i][cx % 10] = true;
			cx /= 10;
		}
	}
	for (int i = 0; i < 1000; i++) {
		int cx = i;
		for (int j = 0; j < 3; j++) {
			used3[i][cx % 10] = true;
			cx /= 10;
		}
	}
	for (int i = 0; i < 10000; i++) {
		int cx = i;
		for (int j = 0; j < 4; j++) {
			used4[i][cx % 10] = true;
			cx /= 10;
		}
	}
}

bool check(int pos) {
	for (int i = 0; i < N; i++) {
		if (used[pos][A[i]] == false) return false;
		pos++;
	}
	return true;
}

int cnt[109][10];

string fixes(string V, bool flag) {
	if (V == "") {
		if (flag == true) V = "1";
		else V = "0";
	}
	else if (V[0] == '0') {
		if (V.size() == 1) V = "10";
		else swap(V[0], V[1]);
	}
	return V;
}

long long solve(int dig) {
	for (int i = 0; i < 101; i++) {
		for (int j = 0; j < 10; j++) cnt[i][j] = 0;
	}

	int maxt = 0;
	for (int i = 0; i < N; i++) {
		int V1 = (dig + i) % 1000;
		int V2 = (dig + i) / 1000;
		maxt = max(maxt, V2);
		if (used3[V1][A[i]] == true) continue;
		cnt[maxt][A[i]] = 1;
	}

	// ケース 1: 下 3 桁が XYZ の場合
	long long m1 = (1LL << 60);
	for (int i = 0; i < 900; i++) {
		int v[10] = { 0,0,0,0,0,0,0,0,0,0 }; bool flag = false;
		for (int j = 0; j <= maxt; j++) {
			for (int k = 0; k < 10; k++) {
				if (cnt[j][k] == 1 && used3[i + j][k] == false) v[k] = 1;
			}
			if (cnt[j][0] == 1 && used[i + j][0] == false) flag = true;
		}
		string S = ""; for (int j = 0; j < 10; j++) { if (v[j] == 1) S += ('0' + j); }
		S = fixes(S, flag);
		long long eval = 1000000LL * stoll(S) + 1000LL * i + dig;
		m1 = min(m1, eval);
	}

	// ケース 2: 下 4 桁が X9YZ の場合
	long long m2 = (1LL << 60);
	for (int i = 0; i < 9000; i++) {
		if ((i % 1000) <= 899) continue;
		int v[10] = { 0,0,0,0,0,0,0,0,0,0 }; bool flag = false;
		for (int j = 0; j <= maxt; j++) {
			for (int k = 0; k < 10; k++) {
				if (cnt[j][k] == 1 && used4[i + j][k] == false) v[k] = 1;
			}
			if (cnt[j][0] == 1 && used[i + j][0] == false) flag = true;
		}
		string S = ""; for (int j = 0; j < 10; j++) { if (v[j] == 1) S += ('0' + j); }
		S = fixes(S, flag);
		long long eval = 10000000LL * stoll(S) + 1000LL * i + dig;
		m2 = min(m2, eval);
	}

	return min(m1, m2);
}

int main() {
	cin >> N; init();
	for (int i = 0; i < N; i++) cin >> A[i];

	// ステップ 1. 1000 以下を全探索
	for (int i = 1; i <= 1000; i++) {
		if (check(i) == true) {
			cout << i << endl;
			return 0;
		}
	}

	// ステップ 2. そうでない場合
	long long minx = (1LL << 60);
	for (int i = 0; i <= 999; i++) {
		minx = min(minx, solve(i));
	}
	cout << minx << endl;
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 98296 KB Output is correct
2 Correct 161 ms 98292 KB Output is correct
3 Correct 176 ms 98244 KB Output is correct
4 Correct 180 ms 98296 KB Output is correct
5 Correct 165 ms 98292 KB Output is correct
6 Correct 170 ms 98296 KB Output is correct
7 Correct 181 ms 98300 KB Output is correct
8 Correct 163 ms 98296 KB Output is correct
9 Correct 167 ms 98296 KB Output is correct
10 Correct 188 ms 98428 KB Output is correct
11 Correct 166 ms 98296 KB Output is correct
12 Correct 170 ms 98296 KB Output is correct
13 Correct 159 ms 98296 KB Output is correct
14 Correct 157 ms 98296 KB Output is correct
15 Correct 165 ms 98296 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 98296 KB Output is correct
2 Correct 187 ms 98272 KB Output is correct
3 Correct 186 ms 98296 KB Output is correct
4 Correct 175 ms 98296 KB Output is correct
5 Correct 221 ms 98296 KB Output is correct
6 Correct 170 ms 98296 KB Output is correct
7 Correct 414 ms 98400 KB Output is correct
8 Correct 174 ms 98272 KB Output is correct
9 Correct 171 ms 98272 KB Output is correct
10 Correct 187 ms 98336 KB Output is correct
11 Correct 446 ms 98296 KB Output is correct
12 Correct 179 ms 98296 KB Output is correct
13 Correct 173 ms 98296 KB Output is correct
14 Correct 183 ms 98272 KB Output is correct
15 Correct 168 ms 98296 KB Output is correct
16 Correct 183 ms 98424 KB Output is correct
17 Correct 184 ms 98296 KB Output is correct
18 Correct 476 ms 98296 KB Output is correct
19 Correct 508 ms 98296 KB Output is correct
20 Correct 567 ms 98336 KB Output is correct
21 Correct 504 ms 98400 KB Output is correct
22 Correct 535 ms 98296 KB Output is correct
23 Correct 554 ms 98384 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 98296 KB Output is correct
2 Correct 601 ms 98296 KB Output is correct
3 Correct 630 ms 98424 KB Output is correct
4 Correct 685 ms 98424 KB Output is correct
5 Correct 670 ms 98296 KB Output is correct
6 Correct 584 ms 98552 KB Output is correct
7 Execution timed out 1102 ms 98680 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 98268 KB Output is correct
2 Correct 163 ms 98296 KB Output is correct
3 Correct 165 ms 98296 KB Output is correct
4 Correct 175 ms 98272 KB Output is correct
5 Execution timed out 1097 ms 98656 KB Time limit exceeded
6 Halted 0 ms 0 KB -