Submission #74313020

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int,int>;
vector<pii> dir = {
  {1, 0}, {-1, 0}, {0, 1}, {0, -1}
};

void solveA () {
 int n;
 cin >> n;
 for (int i = n; i >= 1; i --) {
  if (i != 1) cout << i << ",";
  else cout << i;
 }
 cout << endl;
}

void solveB () {
  int n;
  cin >> n;
  auto maze = vector(n + 1, vector<int> (n + 1, -1));
  for (int i = 1; i < n; i ++) {
    for (int j = i + 1; j <= n; j ++) {
      cin >> maze[i][j];
    }
  }
  // debug(maze);
  for (int i = 1; i <= n; i ++) {
    for (int j = i + 1; j <= n; j ++) {
      for (int k = j + 1; k <= n; k ++) {
       if (maze[i][j] + maze[j][k] < maze[i][k]) {
        // debug(i);
        // debug(j);
        // debug(k);
        cout << "Yes" << endl;
        return;
       }
      }
    }
  }
  cout << "No" << endl;
}

void solveC () {
  int h, w;
  cin >> h >> w;
  int cnt = 0;
  auto maze = vector(h + 1, vector<char> (w + 1));
  auto vis = vector(h + 1, vector<int> (w + 1));
  for (int i = 1; i <= h; i ++) {
    for (int j = 1; j <= w; j ++ ){
      cin >> maze[i][j];
    }
  }
  // debug(maze);
  // debug(vis);
  auto bfs = [&] (int xi, int yi) -> int {
   queue<pii> que;
   que.push({xi, yi});
   vis[xi][yi] = 1;
   bool ok = false;
   while (!que.empty()) {
    auto [x, y] = que.front();
    que.pop();
    for (auto&[dx, dy] : dir) {
      int nx = x + dx, ny = y + dy;
      if (nx < 1 || nx > h || ny < 1 || ny > w) {
        ok = true;
        continue;
      }
      if (vis[nx][ny]) continue;
      if (maze[nx][ny] != '.') continue;
      que.push({nx, ny});
      vis[nx][ny] = 1;
    }
   }
   if (!ok) return 1;
   return 0;
  };
 
  for (int i = 1; i <= h; i ++) {
    for (int j = 1; j <= w; j ++) {
      if (maze[i][j] == '.' && !vis[i][j]) {
        cnt += bfs(i, j);
      }
    }
  }
  //  debug(vis);
  cout << cnt << endl;
}

void solveD () {
  int n, k;
  cin >> n >> k;
  vector<i64> b(n);
  for (int i = 0; i < n; i++) {
    i64 x;
    cin >> x;
    b[i] = x % k;
  }
  sort(b.begin(), b.end());
  for (int i = 0; i < n; i++) {
    b.push_back(b[i] + k);
  }
  i64 ans = LLONG_MAX;
  for (int i = 0; i < n; i++) {
    ans = min(ans, b[i + n - 1] - b[i]);
  }
  cout << ans << endl;
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  solveD();
}

Submission Info

Judge Result