답안 #338685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338685	2020-12-23T16:39:31 Z	limabeans	수열 (BOI14_sequence)	C++17	9 / 100	1000 ms	980 KB

sequence

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;



int n;
vector<int> a;



set<int> digits(int x) {
    set<int> res;
    while (x) {
	res.insert(x%10);
	x/=10;
    }
    return res;
}

bool test(int x) {
    for (int i=0; i<n; i++) {
	int cur=x+i;
	bool ok = false;
	while (cur) {
	    if (a[i]==cur%10) {
		ok=true; break;
	    }
	    cur/=10;
	}
	if (!ok) {
	    return false;
	}
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    a.resize(n);
    for (int i=0; i<n; i++) {
	cin>>a[i];
    }

    for (int i=1; ; i++) {
	if (test(i)) out(i);
    }

    assert(false);    
    return 0;
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct

Subtask #2

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Execution timed out	1079 ms	364 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	26 ms	364 KB	Output is correct
3	Execution timed out	1085 ms	364 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	227 ms	620 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	893 ms	980 KB	Output is correct
12	Execution timed out	1069 ms	876 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-