Submission #940348

#	Time	Username	Problem	Language	Result	Execution time	Memory
940348		vjudge1	Sequence (BOI14_sequence)	C++17	9 / 100	1095 ms	452 KiB

sequence

#include<bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;

#define pb              push_back
#define F               first
#define S               second
#define len(x)          (int)x.size()
#define all(x)          x.begin(),x.end()
#define file            freopen("connect.in", "r", stdin);freopen("connect.out", "w", stdout);
#define kill(x)         {cout << x << '\n'; continue;}
//#define int             long long
	
const int maxn = 1e5 + 5, LG = 20, MOD = 1e9+7;// 998244353
const ll inf =  1061109567;

//priority_queue< pii , vector<pii> , greater<pii> pq;

int n;
char a[maxn];
signed main() {
	ios::sync_with_stdio(0), cin.tie(0);

	cin >> n;
	for(int i = 0; i < n; ++i) cin >> a[i];
	for(int i = 1; i <= 10000000; ++i) {
		bool B = 1;
		for(int j = 0; j < n; ++j) {
			string s = to_string((i+j));
			bool A = 0;
			int leen = len(s);
			for(int k = 0; k < leen; ++k)	if(s[k] == a[j]) A = 1;
			if(!A) { B = 0; break; }
		}
		if(B == 1) {
			cout << i << '\n';
			break;
		}
	}

}

// hasan = nigga

• Subtask 1: 9 / 9
• Subtask 2: 0 / 33
• Subtask 3: 0 / 25
• Subtask 4: 0 / 33