oj.uz

Submission #940091

# Submission time Handle Problem Language Result Execution time Memory
940091 2024-03-07T05:30:16 Z vjudge1 Sequence (BOI14_sequence) C++17
9 / 100
 1000 ms 2776 KB 
#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;
vector<string> v;
int a[N];

bool check(string &s, int x) {
  for (auto u: s) 
    if (u - '0' == x) 
      return true;
  return false;
}

bool check (vector<string> &v) {
  for (int i = 0; i < v.size(); i++)
    if (!check(v[i], a[i + 1])) return false;
  return true;
}

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

Compilation message

sequence.cpp: In function 'bool check(std::vector<std::__cxx11::basic_string<char> >&)':
sequence.cpp:31:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for (int i = 0; i < v.size(); i++)
      |                   ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 13 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 528 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 13 ms 348 KB Output is correct
15 Correct 14 ms 348 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 120 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 14 ms 528 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Execution timed out 1089 ms 348 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 1050 ms 992 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Execution timed out 1038 ms 2776 KB Time limit exceeded
6 Halted 0 ms 0 KB -