Submission #2937329

---

Source Code Expand

#include<algorithm>
#include<climits>
#include<cmath>
#include<iomanip>
#include<iostream>
#include<list>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>
 
#define lint long long
#define rep(i, n) for(int i = 0 ; i < n ; i++)
#define repr(i, n) for(int i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> d(n);
    vector<int> cnt(13, 0);
    rep(i, n){
        cin >> d[i];
        cnt[d[i]]++;
    }
    d.push_back(0);
    cnt[0]++;
    vector<int> a;
    for(int i = 0 ; i <= n ; i++){
        for(int j = i + 1 ; j <= n ; j++){
            if(d[i] == d[j]){
                if(cnt[d[i]] == 2){
                    a.push_back(min(d[i] + d[j], 24 - d[i] - d[j]));
                }else{
                    a.push_back(0);
                }
            }else if(cnt[d[i]] >= 2 || cnt[d[j]] >= 2){
                a.push_back(abs(d[i] - d[j]));
            }else{
                a.push_back(min(d[i] + d[j], 24 - d[i] - d[j]));
            }
        }
    }
    SORT(a);
    cout << a[0] << endl;
    return 0;
}

Submission Info

Judge Result