Submission #1687527


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <algorithm>
#include <iostream>
#include <string>

#define REP(i, n) for(int i=0;i<n;++i)
#define REPR(i, n) for(int i = n-1;i>=0;--i)
#define REPI(itr, v) for(auto itr=v.begin();itr!=v.end();+itr)
#define SORT(v, n) sort(v, v+n)
#define SORTV(v) sort(v.begin(), v.end())
#define llong long long
#define INF 999999999
#define pb(a) push_back(a)

int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};

using namespace std;

int main(){

  int n, t;
  vector<int> v;

  scanf("%d %d", &n, &t);
  REP(i, n){
    int tmp;
    scanf("%d", &tmp);
    v.pb(tmp);
  }

  SORTV(v);

  llong res = 0;
  REP(i, n - 1){
    if(v[i] + t <= v[i + 1]){
      res += t;
    }else{
      res += v[i + 1] - v[i];
    }
  }

  res += t;

  printf("%lld\n", res);

  return 0;
}

Submission Info

Submission Time
Task B - 自動ドア
User nena
Language C++14 (GCC 5.4.1)
Score 100
Code Size 960 Byte
Status AC
Exec Time 13 ms
Memory 1020 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &t);
                         ^
./Main.cpp:35:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &tmp);
                      ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 2
AC × 31
AC × 61
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, sample_01.txt, sample_02.txt
Subtask2 sample_01.txt, sample_02.txt, sample_23.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_23.txt AC 1 ms 256 KB
subtask1_01.txt AC 11 ms 892 KB
subtask1_02.txt AC 3 ms 384 KB
subtask1_03.txt AC 10 ms 892 KB
subtask1_04.txt AC 5 ms 640 KB
subtask1_05.txt AC 3 ms 436 KB
subtask1_06.txt AC 3 ms 432 KB
subtask1_07.txt AC 11 ms 892 KB
subtask1_08.txt AC 10 ms 892 KB
subtask1_09.txt AC 6 ms 640 KB
subtask1_10.txt AC 2 ms 256 KB
subtask1_11.txt AC 6 ms 640 KB
subtask1_12.txt AC 11 ms 892 KB
subtask1_13.txt AC 10 ms 892 KB
subtask1_14.txt AC 8 ms 640 KB
subtask1_15.txt AC 13 ms 892 KB
subtask1_16.txt AC 12 ms 1020 KB
subtask1_17.txt AC 12 ms 892 KB
subtask1_18.txt AC 12 ms 892 KB
subtask1_19.txt AC 12 ms 892 KB
subtask1_20.txt AC 12 ms 892 KB
subtask1_21.txt AC 12 ms 892 KB
subtask1_22.txt AC 12 ms 892 KB
subtask1_23.txt AC 12 ms 892 KB
subtask1_24.txt AC 13 ms 892 KB
subtask1_25.txt AC 12 ms 892 KB
subtask1_26.txt AC 12 ms 892 KB
subtask1_27.txt AC 12 ms 892 KB
subtask1_28.txt AC 12 ms 892 KB
subtask1_29.txt AC 12 ms 892 KB
subtask2_01.txt AC 8 ms 640 KB
subtask2_02.txt AC 7 ms 640 KB
subtask2_03.txt AC 7 ms 640 KB
subtask2_04.txt AC 2 ms 256 KB
subtask2_05.txt AC 11 ms 892 KB
subtask2_06.txt AC 4 ms 512 KB
subtask2_07.txt AC 7 ms 640 KB
subtask2_08.txt AC 3 ms 384 KB
subtask2_09.txt AC 8 ms 640 KB
subtask2_10.txt AC 12 ms 892 KB
subtask2_11.txt AC 5 ms 640 KB
subtask2_12.txt AC 8 ms 640 KB
subtask2_13.txt AC 4 ms 512 KB
subtask2_14.txt AC 3 ms 384 KB
subtask2_15.txt AC 12 ms 892 KB
subtask2_16.txt AC 12 ms 892 KB
subtask2_17.txt AC 12 ms 892 KB
subtask2_18.txt AC 12 ms 892 KB
subtask2_19.txt AC 13 ms 892 KB
subtask2_20.txt AC 12 ms 892 KB
subtask2_21.txt AC 12 ms 892 KB
subtask2_22.txt AC 13 ms 892 KB
subtask2_23.txt AC 12 ms 892 KB
subtask2_24.txt AC 13 ms 892 KB
subtask2_25.txt AC 12 ms 892 KB
subtask2_26.txt AC 12 ms 892 KB
subtask2_27.txt AC 12 ms 892 KB
subtask2_28.txt AC 12 ms 892 KB
subtask2_29.txt AC 12 ms 892 KB