#10128 (C90) No.135 とりあえず1次元の問題

• 問題: No.135 とりあえず1次元の問題
• ユーザー: ゆるく
• 提出日時: 2015-01-28 02:03:01
• 言語: C90 (gcc 11.4.0)
• 結果: AC
• 実行時間: 25 ms / 5,000 ms
• コード長: 1,837 bytes
• コンパイル時間: 547 ms
• コンパイル使用メモリ: 23,936 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-11 00:35:04
• 合計ジャッジ時間: 1,450 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	25 ms; 5,248 KB
testcase_01	AC	0 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	0 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	0 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	0 ms; 5,376 KB
testcase_18	AC	0 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	0 ms; 5,376 KB
testcase_21	AC	14 ms; 5,376 KB
testcase_22	AC	23 ms; 5,376 KB
evil01.txt	AC	19 ms; 5,376 KB

コンパイルメッセージ

main.c: In function ‘main’:
main.c:35:3: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   35 |   scanf("%d", &n);
      |   ^~~~~~~~~~~~~~~
main.c:37:13: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   37 |   rep(i, n) scanf("%d", &b[i]);
      |             ^~~~~~~~~~~~~~~~~~

ソースコード

#include <stdio.h>
#include <math.h>
#include <limits.h>
#include <stdlib.h>

typedef long long ll;
#define MAX_N 112233
#define REP(i, x, n) for(i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define INF 0x7FFFFFFF
#define ALLOCA(type, n) ((type*)alloca(sizeof(type) * (n)))
#define MALLOC(type, n) ((type*)malloc(sizeof(type) * (n)))
#define CALLOC(type, n) ((type*)calloc((n), sizeof(type)))
#define REALLOC(type, n, p) ((type*)realloc((p), sizeof(type) * (n)))

typedef struct heap_queue{long *data;long size;}hq;
void heappush(hq *q,int data){long i = q->size;q->size++;while(i > 0){long p = (i - 1) / 2;if (q->data[p]<=data){break;}q->data[i] = q->data[p];i=p;}q->data[i] = data;}
long heappop(hq *q){long ret = q->data[0];q->size--;long data = q->data[q->size];long i = 0;while(i * 2 + 1 < q->size) {long a = i * 2 + 1, b = i * 2 + 2;if (b < q->size && q->data[b] < q->data[a]) {a=b;}if (q->data[a] >= data) {break;}q->data[i] = q->data[a];i=a;}q->data[i]=data;return ret;}

#define SORT(h, n) qsort(h, n, sizeof(h[0]), ASC)
#define RSORT(h, n) qsort(h, n, sizeof(h[0]), DESC)
int ASC(const void *c1,const void *c2){int tmp1=*(int *)c1;int tmp2=*(int *)c2;if(tmp1<tmp2){return -1;}if(tmp1==tmp2){return 0;}if(tmp1>tmp2){return 1;}}
int DESC(const void *c1,const void *c2){int tmp1 = *(int *)c1;int tmp2=*(int *)c2;if(tmp1>tmp2){return -1;}if(tmp1==tmp2){return  0;}if(tmp1<tmp2){return 1;}}

int Gcd(int m, int n){return (n <= 0) ? m:Gcd(n, m % n);}
int Bcd(int m, int n){return m * n / Gcd(m, n);}

int main(void)
{
  int i,j,k;
  int *b;
  int n;
  int m = INF;
  int tmp;
  scanf("%d", &n);
  b = MALLOC(int, n + 1);
  rep(i, n) scanf("%d", &b[i]);
  SORT(b, n);
  rep(j, n - 1) {
    tmp = abs(b[j] - b[j + 1]);
    if (tmp < m && tmp != 0) {
      m = tmp;
    }
  }
  printf("%d\n", m != INF ? m:0);
  free(b);
  return 0;
}