oj.uz

Submission #940369

# Submission time Handle Problem Language Result Execution time Memory
940369 2024-03-07T08:41:15 Z vjudge1 Sequence (BOI14_sequence) C++17
9 / 100
 1000 ms 3456 KB 
/// 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 = 1e6 + 8, M = 1e6, SQ = 600, INF = 1e9 + 8, LGN = 22, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

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

int32_t main(){
  fast_io;
  cin >> n;
  FOR (i, 0, n){
    cin >> a[i];
  }
  FOR (i, 1, N - 1){
    int x = i;
    int k = i * 10;
    while (x){
      mark[k+x%10] = 1;
      x /= 10;
    }
  }
  for (int i = 1; i < N; ++ i){
    bool ok = true;
    int k = i * 10;
    for (int j = 0; j < n; ++ j){
      if (!mark[k+(a[j])]){
        ok = false;
      }
      k += 10;
    }
    if (ok){
      cout << i;
      return 0;
    }
  }
  return 0;
}

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3164 KB Output is correct
2 Correct 13 ms 3332 KB Output is correct
3 Correct 12 ms 3164 KB Output is correct
4 Correct 12 ms 3176 KB Output is correct
5 Correct 12 ms 3164 KB Output is correct
6 Correct 13 ms 3164 KB Output is correct
7 Correct 12 ms 3336 KB Output is correct
8 Correct 13 ms 3164 KB Output is correct
9 Correct 12 ms 3284 KB Output is correct
10 Correct 13 ms 3320 KB Output is correct
11 Correct 14 ms 3148 KB Output is correct
12 Correct 13 ms 3356 KB Output is correct
13 Correct 11 ms 3164 KB Output is correct
14 Correct 13 ms 3220 KB Output is correct
15 Correct 14 ms 3160 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3160 KB Output is correct
2 Correct 12 ms 3164 KB Output is correct
3 Correct 12 ms 3164 KB Output is correct
4 Correct 12 ms 3164 KB Output is correct
5 Correct 12 ms 3160 KB Output is correct
6 Correct 12 ms 3164 KB Output is correct
7 Correct 18 ms 3164 KB Output is correct
8 Correct 12 ms 3164 KB Output is correct
9 Correct 13 ms 3160 KB Output is correct
10 Correct 12 ms 3164 KB Output is correct
11 Incorrect 732 ms 3320 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3164 KB Output is correct
2 Correct 706 ms 3384 KB Output is correct
3 Execution timed out 1050 ms 3160 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3164 KB Output is correct
2 Correct 12 ms 3196 KB Output is correct
3 Correct 11 ms 3164 KB Output is correct
4 Correct 12 ms 3164 KB Output is correct
5 Execution timed out 1094 ms 3456 KB Time limit exceeded
6 Halted 0 ms 0 KB -