Submission #1194239

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194239		countless	선물상자 (IOI15_boxes)	C++20	Compilation error	0 ms	0 KiB

boxes

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

typedef long long ll;
typedef long double ld;

const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;

#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);

ll delivery(int n, int k, int l, int p[]) {
    // subtask 2
    assert(k == n);

    bool left = false, right = false;

    auto dist = [&](int x) -> int {
        if (x < l - x) {
            left = true;
            return x;
        } else {
            right = true;
            return l - x;
        }
    };

    ll ans = 0;

    ll mn = LONG_LONG_MAX;
    REP(i, 0, n) {
        ll ths = dist(p[i]);
        mn = min(mn, ths);
    }

    if (left and right) {
        return n;
    } else {
        return mn;
    }
}

signed main() {
    int n, k, l; cin >> n >> k >> l;
    int p[n];
    REP(i, 0, n) cin >> p[i];
    cout << delivery(n, k, l, p) << endl;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccxKRWs7.o: in function `main':
grader.c:(.text.startup+0x0): multiple definition of `main'; /tmp/ccZfMPj2.o:boxes.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status