제출 #940428

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940428		vjudge1	수열 (BOI14_sequence)	C++17	34 / 100	1110 ms	237708 KiB

sequence

///ITNOG

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;

constexpr int MOD = 1e9 + 7, N = 3e7 + 8, M = 1e6, SQ = 600, INF = 1e9 + 8, LGN = 22, mod = 998244353, P = 131113;

bitset <10> mark[N];
short int a[N];
int n;

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  for(int i = 1; i < N; ++ i){
    mark[i][i%10] = true;
    mark[i] |= mark[i/10];
  }
  cin >> n;
  for (int i = 0; i < N; ++ i){
    cin >> a[i];
  }
  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;
        break;
      }
    }
    if (ok){
      cout << i;
      return 0;
    }
  }
  cout << -1;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

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