Submission #2520448


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[50];
int cnt[13];
int used;

int main()
{
  scanf( "%d", &N );
  rep( i, N )
    scanf( "%d", D+i ), ++cnt[D[i]], used |= 1<<D[i];

  if( cnt[0] >= 1 || cnt[12] >= 2 )
  {
    puts("0");
    
    return 0;
  }

  rep( i, 13 ) if( cnt[i] >= 3 )
  {
    puts("0");

    return 0;
  }

  int ans = 0;
  for( int i = 0; i < (1<<11); ++i )
  {
    int st = (i<<1) & used;

    int mi = 24;
    rep( j, 13 ) rep( k, j )
    {
      std::vector<int> us, vs;

      if( cnt[j] == 2 )
        us.push_back( j ), us.push_back( 24-j );
      else if( cnt[j] == 1 )
        us.push_back( j+(st>>j&1?24-2*j:0) );

      if( cnt[k] == 2 )
        vs.push_back( k ), vs.push_back( 24-k );
      else if( cnt[k] == 1 )
        vs.push_back( k+(st>>k&1?24-2*k:0) );

      for( auto &u : us ) for( auto &v : vs )
        mi = std::min( mi, abs(u-v) ); 

      if( us.size() > 1 )
        mi = std::min( mi, abs(us[1]-us[0]) );
      if( vs.size() > 1 )
        mi = std::min( mi, abs(vs[1]-vs[0]) );
    }

    ans = std::max( ans, mi );
  }

  if( N == 1 )
    ans = std::max( 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 0
Code Size 1411 Byte
Status WA
Exec Time 24 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf( "%d", &N );
                    ^
./Main.cpp:18:53: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf( "%d", D+i ), ++cnt[D[i]], used |= 1<<D[i];
                                                     ^

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 41
WA × 8
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 WA 3 ms 256 KB
01-02.txt WA 4 ms 256 KB
01-03.txt WA 5 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 10 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 12 ms 256 KB
01-11.txt AC 1 ms 256 KB
01-12.txt AC 1 ms 256 KB
01-13.txt AC 1 ms 256 KB
01-14.txt AC 1 ms 256 KB
01-15.txt AC 1 ms 256 KB
01-16.txt AC 1 ms 256 KB
01-17.txt WA 3 ms 256 KB
01-18.txt AC 4 ms 256 KB
01-19.txt AC 4 ms 256 KB
01-20.txt AC 5 ms 256 KB
01-21.txt AC 5 ms 256 KB
01-22.txt WA 5 ms 256 KB
01-23.txt WA 5 ms 256 KB
01-24.txt AC 6 ms 256 KB
01-25.txt WA 6 ms 256 KB
01-26.txt WA 6 ms 256 KB
01-27.txt AC 7 ms 256 KB
01-28.txt AC 7 ms 256 KB
01-29.txt AC 8 ms 256 KB
01-30.txt AC 8 ms 256 KB
01-31.txt AC 9 ms 256 KB
01-32.txt AC 9 ms 256 KB
01-33.txt AC 10 ms 256 KB
01-34.txt AC 10 ms 256 KB
01-35.txt AC 12 ms 256 KB
01-36.txt AC 12 ms 256 KB
01-37.txt AC 13 ms 256 KB
01-38.txt AC 14 ms 256 KB
01-39.txt AC 24 ms 256 KB
01-40.txt AC 1 ms 256 KB
01-41.txt AC 1 ms 256 KB
01-42.txt AC 1 ms 256 KB
01-43.txt AC 5 ms 256 KB
sample-01.txt AC 5 ms 256 KB
sample-02.txt AC 4 ms 256 KB
sample-03.txt AC 1 ms 256 KB