Submission #3771348


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main () {
 int N, X;
  cin >> N >> X;
  vector<int> x(N+1), y(N);
  for (int i = 0; i < N+1; i++) {
    if (i != N) cin >> x.at(i);
    else x.at(i) = X;
  }
  sort (x.begin(), x.end());
  for (int i = 0; i < N; i++) {
    y.at(i) = x.at(i+1) - x.at(i);
  }
  sort (y.begin(), y.end());
  int Y = y.at(N-1);
  vector<bool> T(Y, true);
  for (int i = 1; i < Y; i++) {
    for (int j = 0; j < N; j++) {
      if (y.at(j)%(i+1) != 0) T.at(i) = false;
    }
  }
  for (int i = Y-1; i > 0; i--) {
    if (T.at(i)) {
      cout << i+1 << endl;
      return 0;
    }
  }
}

Submission Info

Submission Time
Task C - Skip
User yomogidaifuku
Language C++14 (GCC 5.4.1)
Score 0
Code Size 645 Byte
Status TLE
Exec Time 2107 ms
Memory 122368 KB

Judge Result

Set Name All Sample
Score / Max Score 0 / 300 0 / 0
Status
AC × 9
TLE × 13
AC × 2
TLE × 1
Set Name Test Cases
All hand_1, large_1, large_2, large_3, large_4, large_5, large_6, large_7, large_8, max_1, max_2, max_3, min_1, min_2, sample_01, sample_02, sample_03, small_1, small_2, small_3, small_4, small_5
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
hand_1 TLE 2104 ms 122368 KB
large_1 TLE 2103 ms 384 KB
large_2 TLE 2103 ms 384 KB
large_3 TLE 2103 ms 384 KB
large_4 TLE 2103 ms 9472 KB
large_5 TLE 2103 ms 9216 KB
large_6 TLE 2103 ms 7424 KB
large_7 TLE 2103 ms 25856 KB
large_8 TLE 2103 ms 4864 KB
max_1 TLE 2103 ms 1024 KB
max_2 TLE 2103 ms 1024 KB
max_3 TLE 2107 ms 1024 KB
min_1 AC 1 ms 256 KB
min_2 AC 1 ms 256 KB
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 TLE 2104 ms 122368 KB
small_1 AC 1 ms 256 KB
small_2 AC 1 ms 256 KB
small_3 AC 1 ms 256 KB
small_4 AC 1 ms 256 KB
small_5 AC 1 ms 256 KB