oj.uz

답안 #208667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208667 2020-03-12T01:38:59 Z E869120 수열 (BOI14_sequence) C++14
67 / 100
 1000 ms 1272 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];

void init() {
	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++) {
		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;
	}

	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); }
	}

	// ケース 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 の場合
	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 k = 0; k < 10; k++) {
			for (int j : J[k]) { if (used4[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 = 10000000LL * stoll(S) + 1000LL * i + dig;
		m2 = min(m2, eval);
	}*/

	return min(m1, m2);
}

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:65:16: warning: unused variable 'ret' [-Wunused-variable]
  int maxt = 0, ret = 0;
                ^~~
sequence.cpp: In function 'int main()':
sequence.cpp:113:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N); init();
  ~~~~~^~~~~~~~~~
sequence.cpp:114: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 5 ms 504 KB Output is correct
2 Correct 175 ms 632 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 159 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 81 ms 504 KB Output is correct
8 Correct 103 ms 632 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 188 ms 608 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 162 ms 608 KB Output is correct
13 Correct 165 ms 504 KB Output is correct
14 Correct 186 ms 508 KB Output is correct
15 Correct 187 ms 508 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 177 ms 632 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 162 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 94 ms 632 KB Output is correct
8 Correct 84 ms 600 KB Output is correct
9 Correct 100 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 145 ms 508 KB Output is correct
12 Correct 190 ms 632 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 160 ms 608 KB Output is correct
15 Correct 171 ms 600 KB Output is correct
16 Correct 192 ms 504 KB Output is correct
17 Correct 197 ms 504 KB Output is correct
18 Correct 167 ms 504 KB Output is correct
19 Correct 171 ms 504 KB Output is correct
20 Correct 191 ms 592 KB Output is correct
21 Correct 167 ms 504 KB Output is correct
22 Correct 197 ms 504 KB Output is correct
23 Correct 191 ms 504 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 160 ms 636 KB Output is correct
3 Correct 153 ms 632 KB Output is correct
4 Correct 191 ms 632 KB Output is correct
5 Correct 184 ms 632 KB Output is correct
6 Correct 130 ms 504 KB Output is correct
7 Correct 590 ms 860 KB Output is correct
8 Correct 403 ms 760 KB Output is correct
9 Correct 803 ms 1008 KB Output is correct
10 Correct 804 ms 1016 KB Output is correct

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 178 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 164 ms 504 KB Output is correct
5 Correct 724 ms 760 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 90 ms 504 KB Output is correct
9 Correct 89 ms 632 KB Output is correct
10 Correct 92 ms 504 KB Output is correct
11 Correct 869 ms 1176 KB Output is correct
12 Correct 825 ms 1272 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 141 ms 504 KB Output is correct
15 Correct 182 ms 504 KB Output is correct
16 Correct 5 ms 760 KB Output is correct
17 Correct 165 ms 504 KB Output is correct
18 Correct 164 ms 504 KB Output is correct
19 Correct 195 ms 632 KB Output is correct
20 Correct 185 ms 504 KB Output is correct
21 Correct 163 ms 504 KB Output is correct
22 Correct 173 ms 504 KB Output is correct
23 Correct 184 ms 592 KB Output is correct
24 Correct 172 ms 504 KB Output is correct
25 Correct 191 ms 504 KB Output is correct
26 Correct 198 ms 504 KB Output is correct
27 Correct 151 ms 632 KB Output is correct
28 Correct 152 ms 656 KB Output is correct
29 Correct 185 ms 652 KB Output is correct
30 Correct 188 ms 632 KB Output is correct
31 Correct 130 ms 632 KB Output is correct
32 Correct 593 ms 1000 KB Output is correct
33 Correct 402 ms 760 KB Output is correct
34 Correct 807 ms 1144 KB Output is correct
35 Correct 811 ms 1272 KB Output is correct
36 Execution timed out 1066 ms 1144 KB Time limit exceeded
37 Halted 0 ms 0 KB -