Submission #2520439


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)

int N, D[50];
bool used[25];

int main()
{
  scanf( "%d", &N );
  rep( i, N )
    scanf( "%d", D+i );

  std::sort( D, D+N );

  bool tug = false;
  rep( i, N )
  {
    int nxt = (tug?D[i]:24-D[i]);

    if( used[nxt] )
    {
      puts("0");

      return 0;
    }

    used[nxt] = true;
    tug ^= true;
  }

  int ans = 24;
  rep( i, 24 ) rep( j, i ) if( used[i] && used[j] )
    ans = std::min( ans, i-j );

  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 624 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf( "%d", &N );
                    ^
./Main.cpp:14:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf( "%d", D+i );
                       ^

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 35
WA × 14
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 1 ms 128 KB
01-02.txt WA 1 ms 128 KB
01-03.txt WA 1 ms 128 KB
01-04.txt WA 1 ms 128 KB
01-05.txt WA 1 ms 128 KB
01-06.txt WA 1 ms 128 KB
01-07.txt AC 1 ms 128 KB
01-08.txt AC 1 ms 128 KB
01-09.txt AC 1 ms 128 KB
01-10.txt AC 1 ms 128 KB
01-11.txt AC 1 ms 128 KB
01-12.txt AC 1 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 WA 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 WA 1 ms 128 KB
01-23.txt WA 1 ms 128 KB
01-24.txt AC 1 ms 128 KB
01-25.txt WA 1 ms 128 KB
01-26.txt WA 1 ms 128 KB
01-27.txt AC 1 ms 128 KB
01-28.txt AC 1 ms 128 KB
01-29.txt AC 1 ms 128 KB
01-30.txt AC 1 ms 128 KB
01-31.txt AC 1 ms 128 KB
01-32.txt AC 1 ms 128 KB
01-33.txt AC 1 ms 128 KB
01-34.txt AC 1 ms 128 KB
01-35.txt AC 1 ms 128 KB
01-36.txt AC 1 ms 128 KB
01-37.txt AC 1 ms 128 KB
01-38.txt AC 1 ms 128 KB
01-39.txt AC 1 ms 128 KB
01-40.txt WA 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 WA 1 ms 128 KB