Submission #940105

#	Time	Username	Problem	Language	Result	Execution time	Memory
940105		vjudge1	Sequence (BOI14_sequence)	C++17	9 / 100	1071 ms	1000 KiB

sequence

#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);
#define what(x) cerr << #x << " is " << x << '\n';
#define kill(x) {cout << x << '\n'; return 0;}
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pb push_back
#define ll long long
#define F first
#define S second
const ll inf = 1e16, mod = 1e9 + 7, delta = 1e9 + 9, SQ = 450, P = 6065621;

using namespace std;

const int N = 5e5 + 10, LG = 20;
deque<int> v;
int a[N], n;

inline bool check(ll t, int x) {
  while (t > 0) {
    if (t % 10 == x) 
      return true;
    t /= 10;
  }
  return false;
}

inline bool check (deque<int> x) {
  for (int i = 1; i <= n; i++) {
    int v = x.front();
    x.pop_front();
    if (!check(v, a[i])) return false;
  }
  return true;
}

int main () {
  fast_io;
  cin >> n;
  for (int i = 1; i <= n; i++)
    cin >> a[i];
  for (int i = 1; i <= n; i++)
    v.pb(i);
  int pt = n + 1;
  while (1) {
    if (check(v)) kill(pt - n);
    v.pop_front();
    v.pb(pt);
    ++pt;
  }
  return 0;
}

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