Submission #3209446
Source Code Expand
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<31)-1
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}
int n, t, ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> t;
vii a(n);
ans = t;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n-1) {
if (a[i+1] <= a[i] + t)
ans += a[i+1] - a[i];
else
ans += t;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Sentou |
User |
kage |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1088 Byte |
Status |
AC |
Exec Time |
21 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example0, example1, example2, example3, example4 |
All |
example0, example1, example2, example3, example4, maxrand0, maxrand1, maxrand2, rand0, rand1, rand2, rand3, rand4 |
Case Name |
Status |
Exec Time |
Memory |
example0 |
AC |
1 ms |
256 KB |
example1 |
AC |
1 ms |
256 KB |
example2 |
AC |
1 ms |
256 KB |
example3 |
AC |
1 ms |
256 KB |
example4 |
AC |
1 ms |
256 KB |
maxrand0 |
AC |
21 ms |
1024 KB |
maxrand1 |
AC |
21 ms |
1024 KB |
maxrand2 |
AC |
21 ms |
1024 KB |
rand0 |
AC |
1 ms |
256 KB |
rand1 |
AC |
1 ms |
256 KB |
rand2 |
AC |
1 ms |
256 KB |
rand3 |
AC |
1 ms |
256 KB |
rand4 |
AC |
1 ms |
256 KB |