Submission #1803174

---

Source Code Expand

#include <bits/stdc++.h>

#ifndef LOCAL
#define cerr dolor_sit_amet
#endif

#define mp make_pair
#define sz(x) ((int)((x).size()))
#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair < int , int > ipair;
typedef pair < ll , ll > lpair;
const int IINF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const double DINF = numeric_limits<double>::infinity();
const int MOD = 1000000007;
const double EPS = 1e-9;
const int DX[] = { 1,  0, -1,  0,  1, -1,  1, -1};
const int DY[] = { 0,  1,  0, -1,  1, -1, -1,  1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll sqr(ll x) { return x*x; } ll sqr(int x) { return (ll)x*x; }
double sqr(double x) { return x*x; } ld sqr(ld x) { return x*x; }
mt19937 mmtw(960172);
ll rnd(ll x, ll y) { static uniform_int_distribution<ll> d; return d(mmtw) % (y - x + 1) + x; }

// ========================================================================= //

const int N = 55;

int n;
int a[N];

int main() {
    ios::sync_with_stdio(false);

    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    sort(a + 1, a + n + 1);
    if (a[1] == 0) {
        cout << "0\n";
        return 0;
    }
    for (int i = 1; i < n - 1; ++i)
        if (a[i] == a[i+2]) {
            cout << "0\n";
            return 0;
        }
    if (n >= 2 && a[n-1] == 12) {
        cout << "0\n";
        return 0;
    }

    if (n == 23) {
        cout << "1\n";
        return 0;
    }
    int ans = 0;
    for (int m = 0; m < 1 << n; ++m) {
        static vector<int> ts;
        int cans = 222;
        int prv = 0;
        for (int i = 1; i <= n; ++i)
            if (m & (1 << (i-1))) {
                cans = min(cans, a[i] - prv);
                prv = a[i];
            }
        for (int i = n; i >= 1; --i)
            if (!(m & (1 << (i-1)))) {
                cans = min(cans, 24 - a[i] - prv);
                prv = 24 - a[i];
            }
        cans = min(cans, 24 - prv);
        ans = max(ans, cans);
    }
    cout << ans << "\n";

    return 0;
}

Submission Info

Judge Result