제출 #1263047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263047		norman165	Room Temperature (JOI24_ho_t1)	C++20	35 / 100	0 ms	328 KiB

Main

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define yes() cout << "YES\n"
#define no() cout << "NO\n"

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

const int inf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e6;
const int mod1 = 998244353;
const int mod2 = 1e18 + 1;
const int mod3 = 1e9 + 9;
const int mod4 = 333333333;
const int mod5 = 200000;
const int mod6 = 10007;
const int k = 3000;
const int w = 1e5;
const ld EPS = 1e-8;

int LOG = 30;

void solve() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int& i : a) cin >> i;

    // sort(all(a));
    set<int> cand;
    for (int& i : a) cand.insert(i % k);
    for (int& i : a) cand.insert(k - (i % k));
    for (int& i : a) cand.insert(max(0ll, k - (i % k) - 1));
    cand.insert(k - 1);
    cand.insert(0);
    int ans = inf;
    for (auto& i : cand) {
        int x = i;
        int sum = 0;

        for (int& j : a) {
            int y = abs(x - j) % k;
            sum = max(sum, min(y, k - y));
        }

        ans = min(ans, sum);
    }

    cout << ans << "\n";
}

signed main() {
    // cout.precision(16);

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }
}

• Subtask 1: 0 / 15
• Subtask 2: 5 / 5
• Subtask 3: 30 / 30
• Subtask 4: 0 / 35
• Subtask 5: 0 / 15