Submission #2542636
Source Code Expand
#include <iostream> #include <vector> #include <limits> using namespace std; int main(){ int N; cin >> N; vector<int> D(N); for(int i=0;i<N;i++) cin >> D[i]; vector<int> cnt(13,0); cnt[0] += 1; for(int i=0;i<N;i++) cnt[D[i]]++; int ans = -1; for(int i=0;i<(1<<11);i++){ vector<bool> used(24,false); int s = numeric_limits<int>::max(); for(int j=0;j<=12;j++){ if(cnt[j]){ if(j==0 || j==12){ used[j] = true; if(cnt[j]>=2){ s = 0; } }else{ if(cnt[j] == 1){ used[((i & (1<<(j-1))) ? j : 24-j)] = true; }else if(cnt[j] == 2){ used[j] = used[24-j] = true; }else{ s = 0; } } } } for(int j=0;j<24;j++){ if(used[j]){ for(int k=0;k<j;k++){ if(used[k]){ s = min(s, min(abs(k-j), 24 - abs(k-j))); } } } } ans = max(ans, s); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Time Gap |
User | okesaku |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1334 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 2 ms | 256 KB |
01-09.txt | AC | 2 ms | 256 KB |
01-10.txt | AC | 2 ms | 256 KB |
01-11.txt | AC | 2 ms | 256 KB |
01-12.txt | AC | 2 ms | 256 KB |
01-13.txt | AC | 2 ms | 256 KB |
01-14.txt | AC | 2 ms | 256 KB |
01-15.txt | AC | 2 ms | 256 KB |
01-16.txt | AC | 2 ms | 256 KB |
01-17.txt | AC | 1 ms | 256 KB |
01-18.txt | AC | 1 ms | 256 KB |
01-19.txt | AC | 1 ms | 256 KB |
01-20.txt | AC | 1 ms | 256 KB |
01-21.txt | AC | 1 ms | 256 KB |
01-22.txt | AC | 1 ms | 256 KB |
01-23.txt | AC | 1 ms | 256 KB |
01-24.txt | AC | 1 ms | 256 KB |
01-25.txt | AC | 1 ms | 256 KB |
01-26.txt | AC | 2 ms | 256 KB |
01-27.txt | AC | 2 ms | 256 KB |
01-28.txt | AC | 2 ms | 256 KB |
01-29.txt | AC | 2 ms | 256 KB |
01-30.txt | AC | 2 ms | 256 KB |
01-31.txt | AC | 2 ms | 256 KB |
01-32.txt | AC | 2 ms | 256 KB |
01-33.txt | AC | 2 ms | 256 KB |
01-34.txt | AC | 2 ms | 256 KB |
01-35.txt | AC | 2 ms | 256 KB |
01-36.txt | AC | 2 ms | 256 KB |
01-37.txt | AC | 2 ms | 256 KB |
01-38.txt | AC | 2 ms | 256 KB |
01-39.txt | AC | 3 ms | 256 KB |
01-40.txt | AC | 3 ms | 256 KB |
01-41.txt | AC | 1 ms | 256 KB |
01-42.txt | AC | 1 ms | 256 KB |
01-43.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |