/// ITNOG
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;
template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
constexpr int MOD = 1e9 + 7, N = 1e7 + 8, M = 1e6, SQ = 600, INF = 1e9 + 8, LGN = 22, mod = 998244353, P = 131113;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool mark[N][10];
int n, a[N];
int32_t main(){
fast_io;
cin >> n;
FOR (i, 0, n){
cin >> a[i];
}
FOR (i, 1, N - 1){
string s = to_string(i);
for (char ch : s){
mark[i][ch-'0'] = true;
}
}
for (int i = 1; i < N; ++ i){
bool ok = true;
for (int j = 0; j < n; ++ j){
if (!mark[i+j][a[j]]){
ok = false;
}
}
if (ok){
cout << i;
return 0;
}
}
cout << -1;
return 0;
}
// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
185 ms |
100208 KB |
Output is correct |
2 |
Correct |
168 ms |
100084 KB |
Output is correct |
3 |
Correct |
171 ms |
100368 KB |
Output is correct |
4 |
Correct |
169 ms |
100064 KB |
Output is correct |
5 |
Correct |
172 ms |
100180 KB |
Output is correct |
6 |
Correct |
166 ms |
100176 KB |
Output is correct |
7 |
Correct |
172 ms |
100088 KB |
Output is correct |
8 |
Correct |
170 ms |
100116 KB |
Output is correct |
9 |
Correct |
168 ms |
100180 KB |
Output is correct |
10 |
Correct |
169 ms |
100124 KB |
Output is correct |
11 |
Correct |
212 ms |
100176 KB |
Output is correct |
12 |
Correct |
166 ms |
100212 KB |
Output is correct |
13 |
Correct |
178 ms |
100160 KB |
Output is correct |
14 |
Correct |
175 ms |
100348 KB |
Output is correct |
15 |
Correct |
176 ms |
100204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
168 ms |
100176 KB |
Output is correct |
2 |
Correct |
168 ms |
100208 KB |
Output is correct |
3 |
Correct |
182 ms |
100180 KB |
Output is correct |
4 |
Correct |
166 ms |
100080 KB |
Output is correct |
5 |
Correct |
182 ms |
100388 KB |
Output is correct |
6 |
Correct |
175 ms |
100280 KB |
Output is correct |
7 |
Correct |
232 ms |
100240 KB |
Output is correct |
8 |
Correct |
167 ms |
100432 KB |
Output is correct |
9 |
Correct |
168 ms |
100080 KB |
Output is correct |
10 |
Correct |
175 ms |
100092 KB |
Output is correct |
11 |
Execution timed out |
1004 ms |
100432 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
185 ms |
100180 KB |
Output is correct |
2 |
Correct |
969 ms |
100408 KB |
Output is correct |
3 |
Execution timed out |
1072 ms |
100180 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
171 ms |
100312 KB |
Output is correct |
2 |
Correct |
172 ms |
100176 KB |
Output is correct |
3 |
Correct |
169 ms |
100092 KB |
Output is correct |
4 |
Correct |
168 ms |
100064 KB |
Output is correct |
5 |
Execution timed out |
1040 ms |
100384 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |