oj.uz

답안 #208670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208670 2020-03-12T01:45:54 Z E869120 수열 (BOI14_sequence) C++14
67 / 100
 1000 ms 2736 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <ctime>
using namespace std;
#pragma warning (disable: 4996)

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

int shou[200009], amari[200009];

void init() {
	for (int i = 0; i < 200000; i++) {
		shou[i] = i / 1000;
		amari[i] = i % 1000;
	}
	for (int i = 0; i < 10000; 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, ret = 0;
	for (int i = 0; i < N; i++) {
		if (used3[amari[dig + i]][A[i]] == false) cnt[shou[dig + i]][A[i]] = 1;
	}
	maxt = (dig + N - 1) / 1000;

	vector<int> J[10];
	for (int i = 0; i < 10; i++) {
		for (int j = 0; j <= maxt; j++) { if (cnt[j][i] == 1) J[i].push_back(j); }
		if (J[i].size() >= 1) {
			for (int j = 0; j < J[i].size(); j++) { swap(J[i][rand() % J[i].size()], J[i][rand() % J[i].size()]); }
		}
	}

	// ケース 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 k = 0; k < 10; k++) {
			for (int j : J[k]) { if (used3[i + j][k] == false) { v[k] = 1; break; } }
		}
		for (int j : J[0]) { if (used[i + j][0] == false) { flag = true; break; } }
		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 の場合
	// どうやら存在しないらしい

	return m1;
}

int main() {
	srand((unsigned)time(NULL));
	scanf("%d", &N); init();
	for (int i = 0; i < N; i++) scanf("%d", &A[i]);

	// ステップ 1. 1000 以下を全探索
	for (int i = 1; i <= 100; 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;
}

Compilation message

sequence.cpp:7:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
sequence.cpp: In function 'long long int solve(int)':
sequence.cpp:81:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < J[i].size(); j++) { swap(J[i][rand() % J[i].size()], J[i][rand() % J[i].size()]); }
                    ~~^~~~~~~~~~~~~
sequence.cpp:71:16: warning: unused variable 'ret' [-Wunused-variable]
  int maxt = 0, ret = 0;
                ^~~
sequence.cpp: In function 'int main()':
sequence.cpp:107:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N); init();
  ~~~~~^~~~~~~~~~
sequence.cpp:108:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < N; i++) scanf("%d", &A[i]);
                              ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2040 KB Output is correct
2 Correct 176 ms 2040 KB Output is correct
3 Correct 6 ms 2040 KB Output is correct
4 Correct 171 ms 2168 KB Output is correct
5 Correct 6 ms 2168 KB Output is correct
6 Correct 6 ms 2040 KB Output is correct
7 Correct 92 ms 2168 KB Output is correct
8 Correct 98 ms 2040 KB Output is correct
9 Correct 6 ms 2040 KB Output is correct
10 Correct 189 ms 2168 KB Output is correct
11 Correct 6 ms 2040 KB Output is correct
12 Correct 169 ms 2040 KB Output is correct
13 Correct 173 ms 2040 KB Output is correct
14 Correct 193 ms 2168 KB Output is correct
15 Correct 191 ms 2040 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2040 KB Output is correct
2 Correct 179 ms 2040 KB Output is correct
3 Correct 6 ms 2168 KB Output is correct
4 Correct 169 ms 2296 KB Output is correct
5 Correct 6 ms 2040 KB Output is correct
6 Correct 6 ms 2040 KB Output is correct
7 Correct 98 ms 2040 KB Output is correct
8 Correct 91 ms 2040 KB Output is correct
9 Correct 106 ms 2040 KB Output is correct
10 Correct 6 ms 2040 KB Output is correct
11 Correct 149 ms 2168 KB Output is correct
12 Correct 189 ms 2040 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 170 ms 2168 KB Output is correct
15 Correct 175 ms 2040 KB Output is correct
16 Correct 191 ms 2040 KB Output is correct
17 Correct 196 ms 2168 KB Output is correct
18 Correct 177 ms 2040 KB Output is correct
19 Correct 175 ms 2040 KB Output is correct
20 Correct 192 ms 2168 KB Output is correct
21 Correct 181 ms 2040 KB Output is correct
22 Correct 188 ms 2040 KB Output is correct
23 Correct 193 ms 2040 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2040 KB Output is correct
2 Correct 134 ms 2168 KB Output is correct
3 Correct 131 ms 2168 KB Output is correct
4 Correct 154 ms 2168 KB Output is correct
5 Correct 159 ms 2296 KB Output is correct
6 Correct 125 ms 2168 KB Output is correct
7 Correct 402 ms 2296 KB Output is correct
8 Correct 288 ms 2296 KB Output is correct
9 Correct 530 ms 2424 KB Output is correct
10 Correct 533 ms 2552 KB Output is correct

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2040 KB Output is correct
2 Correct 178 ms 2168 KB Output is correct
3 Correct 6 ms 2040 KB Output is correct
4 Correct 165 ms 2040 KB Output is correct
5 Correct 574 ms 2424 KB Output is correct
6 Correct 6 ms 2040 KB Output is correct
7 Correct 6 ms 2040 KB Output is correct
8 Correct 97 ms 2152 KB Output is correct
9 Correct 92 ms 2040 KB Output is correct
10 Correct 101 ms 2040 KB Output is correct
11 Correct 548 ms 2552 KB Output is correct
12 Correct 551 ms 2552 KB Output is correct
13 Correct 6 ms 2040 KB Output is correct
14 Correct 146 ms 2040 KB Output is correct
15 Correct 186 ms 2040 KB Output is correct
16 Correct 6 ms 2040 KB Output is correct
17 Correct 170 ms 2040 KB Output is correct
18 Correct 174 ms 2040 KB Output is correct
19 Correct 192 ms 2168 KB Output is correct
20 Correct 192 ms 2296 KB Output is correct
21 Correct 168 ms 2168 KB Output is correct
22 Correct 176 ms 2044 KB Output is correct
23 Correct 186 ms 2040 KB Output is correct
24 Correct 178 ms 2040 KB Output is correct
25 Correct 190 ms 2040 KB Output is correct
26 Correct 188 ms 2040 KB Output is correct
27 Correct 133 ms 2292 KB Output is correct
28 Correct 132 ms 2168 KB Output is correct
29 Correct 154 ms 2168 KB Output is correct
30 Correct 153 ms 2168 KB Output is correct
31 Correct 126 ms 2296 KB Output is correct
32 Correct 404 ms 2424 KB Output is correct
33 Correct 285 ms 2424 KB Output is correct
34 Correct 536 ms 2552 KB Output is correct
35 Correct 525 ms 2552 KB Output is correct
36 Correct 808 ms 2676 KB Output is correct
37 Correct 993 ms 2552 KB Output is correct
38 Correct 704 ms 2552 KB Output is correct
39 Execution timed out 1030 ms 2736 KB Time limit exceeded
40 Halted 0 ms 0 KB -