Submission #2520453
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <vector> #define repi(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,a) repi(i,0,a) #define clr(a,v) memset((a),(v),sizeof(a)) int N, D[55], b[55]; int cnt[55]; int main() { scanf( "%d", &N ); rep( i, N ) scanf( "%d", D+i ), ++cnt[D[i]]; int ans = 1; if( N >= 14 ) { if( cnt[0] >= 1 || cnt[12] >= 2 ) ans = 0; repi( i, 1, 12 ) if( cnt[i] >= 3 ) ans = 0; } else { ans = 0; D[N] = 0; for( int i = 0; i <= (1<<14); ++i ) { int mi = 1<<30; rep( j, N+1 ) b[j] = D[j]+(i>>j&1?24-2*D[j]:0); rep( j, N+1 ) rep( k, N+1 ) if( j != k ) mi = std::min( mi, std::min( abs(b[k]-b[j]), 24-abs(b[k]-b[j]) ) ); ans = std::max( ans, mi ); } } if( N == 1 ) ans = std::min( D[0], 24-D[0] ); printf( "%d\n", ans ); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Time Gap |
User | As_sqr |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 962 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:15:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf( "%d", &N ); ^ ./Main.cpp:17:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf( "%d", D+i ), ++cnt[D[i]]; ^
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 | 128 KB |
01-02.txt | AC | 1 ms | 128 KB |
01-03.txt | AC | 1 ms | 128 KB |
01-04.txt | AC | 1 ms | 128 KB |
01-05.txt | AC | 2 ms | 128 KB |
01-06.txt | AC | 2 ms | 128 KB |
01-07.txt | AC | 3 ms | 128 KB |
01-08.txt | AC | 4 ms | 128 KB |
01-09.txt | AC | 4 ms | 128 KB |
01-10.txt | AC | 5 ms | 128 KB |
01-11.txt | AC | 6 ms | 128 KB |
01-12.txt | AC | 7 ms | 128 KB |
01-13.txt | AC | 1 ms | 128 KB |
01-14.txt | AC | 1 ms | 128 KB |
01-15.txt | AC | 1 ms | 128 KB |
01-16.txt | AC | 1 ms | 128 KB |
01-17.txt | AC | 1 ms | 128 KB |
01-18.txt | AC | 1 ms | 128 KB |
01-19.txt | AC | 1 ms | 128 KB |
01-20.txt | AC | 1 ms | 128 KB |
01-21.txt | AC | 1 ms | 128 KB |
01-22.txt | AC | 1 ms | 128 KB |
01-23.txt | AC | 1 ms | 128 KB |
01-24.txt | AC | 1 ms | 128 KB |
01-25.txt | AC | 1 ms | 128 KB |
01-26.txt | AC | 1 ms | 128 KB |
01-27.txt | AC | 2 ms | 128 KB |
01-28.txt | AC | 2 ms | 128 KB |
01-29.txt | AC | 2 ms | 128 KB |
01-30.txt | AC | 2 ms | 128 KB |
01-31.txt | AC | 3 ms | 128 KB |
01-32.txt | AC | 3 ms | 128 KB |
01-33.txt | AC | 4 ms | 128 KB |
01-34.txt | AC | 4 ms | 128 KB |
01-35.txt | AC | 5 ms | 128 KB |
01-36.txt | AC | 6 ms | 128 KB |
01-37.txt | AC | 7 ms | 128 KB |
01-38.txt | AC | 7 ms | 128 KB |
01-39.txt | AC | 1 ms | 128 KB |
01-40.txt | AC | 1 ms | 128 KB |
01-41.txt | AC | 1 ms | 128 KB |
01-42.txt | AC | 1 ms | 128 KB |
01-43.txt | AC | 1 ms | 128 KB |
sample-01.txt | AC | 1 ms | 128 KB |
sample-02.txt | AC | 1 ms | 128 KB |
sample-03.txt | AC | 1 ms | 128 KB |