답안 #105983

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105983	2019-04-16T03:50:41 Z	xiaowuc1	수열 (BOI14_sequence)	C++14	9 / 100	483 ms	4856 KB

sequence

#include <algorithm>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef vector<vector<ll>> matrix;

const int MAX_N = 1000000;
short valid[MAX_N];

void gen(int x) {
	int y = x;
	while(y) {
		valid[x] |= 1 << (y%10);
		y /= 10;
	}
}

int l[100000];
int n;
void solve() {
	for(int i = 0; i < MAX_N; i++) gen(i);
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> l[i];
	}
	int ret = 1;
	while(true) {
		bool good = true;
		for(int i = 0; good && i < n; i++) {
			good = (valid[ret+i] & (1 << l[i]));
		}
		if(good) {
			cout << ret << endl;
			break;
		}
		ret++;
	}
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
	/*
  int t;
  cin >> t;
  for(int i = 1; i <= t; i++) {
    cout << "Case #" << i << ": ";
    solve();
  }
	*/
	solve();
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	2296 KB	Output is correct
2	Correct	23 ms	2304 KB	Output is correct
3	Correct	23 ms	2304 KB	Output is correct
4	Correct	17 ms	2304 KB	Output is correct
5	Correct	19 ms	2304 KB	Output is correct
6	Correct	22 ms	2268 KB	Output is correct
7	Correct	16 ms	2304 KB	Output is correct
8	Correct	21 ms	2300 KB	Output is correct
9	Correct	16 ms	2304 KB	Output is correct
10	Correct	17 ms	2296 KB	Output is correct
11	Correct	17 ms	2304 KB	Output is correct
12	Correct	16 ms	2304 KB	Output is correct
13	Correct	17 ms	2304 KB	Output is correct
14	Correct	19 ms	2304 KB	Output is correct
15	Correct	17 ms	2304 KB	Output is correct

Subtask #2

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	21 ms	2296 KB	Output is correct
2	Correct	17 ms	2304 KB	Output is correct
3	Correct	20 ms	2304 KB	Output is correct
4	Correct	17 ms	2304 KB	Output is correct
5	Correct	18 ms	2304 KB	Output is correct
6	Correct	17 ms	2304 KB	Output is correct
7	Correct	23 ms	2304 KB	Output is correct
8	Correct	16 ms	2304 KB	Output is correct
9	Correct	16 ms	2344 KB	Output is correct
10	Correct	16 ms	2304 KB	Output is correct
11	Runtime error	65 ms	4472 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	2304 KB	Output is correct
2	Correct	24 ms	2304 KB	Output is correct
3	Correct	371 ms	2408 KB	Output is correct
4	Correct	25 ms	2432 KB	Output is correct
5	Runtime error	483 ms	4576 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	2276 KB	Output is correct
2	Correct	15 ms	2276 KB	Output is correct
3	Correct	16 ms	2304 KB	Output is correct
4	Correct	17 ms	2304 KB	Output is correct
5	Runtime error	28 ms	4856 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
6	Halted	0 ms	0 KB	-