Submission #3042823

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int main() {
	int n; cin >> n;
	int cnt[13] = {};
	rep(i, n) {
		int d; cin >> d; cnt[d]++;
	}
	bool f = true;
	vector<int> v; v.push_back(0);
	rep(i, 13) {
		rep(j, cnt[i]) {
			if (f)v.push_back(i);
			else v.push_back(24 - i);
			f = !f;
		}
	}
	int len = v.size();
	int out = 30;
	rep(i, len) {
		Rep(j, i + 1, len) {
			int t = abs(v[i] - v[j]);
			t = min(t, 24 - t);
			out = min(out, t);
		}
	}
	cout << out << endl;
	return 0;
}

Submission Info

Judge Result