oj.uz

Submission #41359

# Submission time Handle Problem Language Result Execution time Memory
41359 2018-02-16T19:12:47 Z gabrielsimoes Sequence (BOI14_sequence) C++14
34 / 100
 673 ms 1256 KB 
#include <bits/stdc++.h>
using namespace std;

bool test(int a, int b) {
  while (a > 0) {
    if (b == (a % 10))
      return true;
    else
      a /= 10;
  }

  return false;
}

int n;
vector<int> v;

int main() {
  scanf("%d", &n);
  for (int i = 0, a; i < n; i++) {
    scanf("%d", &a);
    v.push_back(a);
  }

  if (n <= 10000) {
    for (int ans = 1; ans <= 10000; ans++) {
      bool ok = true;
      for (int i = 0; i < n; i++) {
        if (!test(ans + i, v[i])) ok = false;
      }

      if (ok) {
        printf("%d\n", ans);
        return 0;
      }
    }
  }

  int x = v[0];

  if (x > 0 && x < 9) {
    printf("%d", x);
    int cur = 1;
    while (n >= cur + 1) {
      printf("0");
      cur *= 10;
    }
    printf("\n");
  }

  if (x == 9) {
    int cur = 1;
    while (n >= cur + 1) {
      printf("8");
      cur = cur * 10 + 1;
    }

    printf("9\n");
  }

  if (x == 0) {
    printf("10");
    if (n != 1) {
      int cur = 1;
      while (n > cur) {
        printf("0");
        cur = cur * 10 + 1;
      }
    }
    printf("\n");
  }
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:19:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
sequence.cpp:21:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a);
                    ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 4 ms 352 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 1 ms 516 KB Output is correct
6 Correct 1 ms 516 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 8 ms 568 KB Output is correct
9 Correct 1 ms 584 KB Output is correct
10 Correct 3 ms 584 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 1 ms 584 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Correct 13 ms 584 KB Output is correct
15 Correct 13 ms 612 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 612 KB Output is correct
2 Correct 6 ms 612 KB Output is correct
3 Correct 1 ms 612 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 1 ms 612 KB Output is correct
6 Correct 1 ms 612 KB Output is correct
7 Correct 66 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 8 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Incorrect 88 ms 612 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 612 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 648 KB Output is correct
5 Correct 3 ms 648 KB Output is correct
6 Correct 673 ms 668 KB Output is correct
7 Correct 10 ms 1256 KB Output is correct
8 Correct 6 ms 1256 KB Output is correct
9 Correct 11 ms 1256 KB Output is correct
10 Correct 11 ms 1256 KB Output is correct

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1256 KB Output is correct
2 Correct 5 ms 1256 KB Output is correct
3 Correct 2 ms 1256 KB Output is correct
4 Correct 2 ms 1256 KB Output is correct
5 Incorrect 5 ms 1256 KB Output isn't correct
6 Halted 0 ms 0 KB -