提出 #704819

---

ソースコード 拡げる

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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

int N = 0, M = 0, T = 0;
vector<int> Time;
vector<int> m_time;


void input() {
	CI N >> M >> T;

	Time.resize(N);
	m_time.resize(N - 1);

	REP (i, N) {
		CI Time[i];
	}
	REP(i, N - 1) {
		m_time[i] = Time[i + 1] - Time[i];
	}
}


int main(void) {
	input();
	int time_s = 0;

	time_s = T - (N * 2 * M);

	if (N != 1) {
		REP(i, N - 1) {
			if (m_time[i] < 2 * M) {
				time_s += (2 * M - m_time[i]);
			}
		}
	}
		if (T - Time[N - 1] < M) {
			time_s += (M - (T - Time[N - 1]));
		}
	
	CO time_s E

	return 0;
}

提出情報

ジャッジ結果