Submission #74305893

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
const ll N = 1e6 + 5, MOD = 1e9 + 7, inf = 2e18;
using namespace std;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
char di[] = {'R', 'L', 'D', 'U'};
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Ebraam() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("Input.txt", "r", stdin);
    freopen("Output.txt", "w", stdout);
#endif
}

void solve() {
    ll n, k;
    cin >> n >> k;
    vector<ll> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        v[i] %= k;
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    ll ans = 0;
    for (int i = 0; i < n - 1; i++) {
        ans = max(ans, v[i + 1] - v[i]);
    }
    cout << k - max(ans, k - v.back() + v.front());
}

int main() {
    Ebraam();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        if (t)cout << endl;
    }
    return 0;
}

Submission Info

Judge Result