Submission #3186298
Source Code Expand
#include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
bool cmp_P(const P &a,const P &b){
return a.second < b.second;
}
int main()
{
ll from=0,unti=0,N,T,t[200002],res=0;
cin >> N >> T;
REP(i,N)cin >> t[i];
t[N] = 9999999999999999;
REP(i,N+1){
if(unti < t[i]){
res += unti - from;
unti = t[i]+ T;
from = t[i];
}else{
unti = t[i]+T;
}
}
cout << res << endl;
return 0;
}
int par[MAX_N];
int ranks[MAX_N];
//n要素で初期化
void init(int n){
REP(i,n){
par[i] = i;
ranks[i] = 0;
}
}
//木の根を求める
int find(int x){
if(par[x] == x){
return x;
}else{
return par[x] = find(par[x]);
}
}
void unite(int x,int y){
x = find(x);
y = find(y);
if(x == y) return ;
if(ranks[x] < ranks[y]){
par[x] = y;
}else{
par[y] = x;
if(ranks[x] == ranks[y]) ranks[x]++;
}
}
bool same(int x, int y){
return find(x) == find(y);
}
ll bpow(ll a, ll n,ll mod){
int i = 0;
ll res=1;
while(n){
if(n & 1)
res = (res*a) % mod;
a = (a*a) % mod;
n >>= 1;
}
return res;
}
const int MOD = 1000000007;
mat mul(mat &A, mat &B){
mat C(A.size(),vec(B[0].size()));
REP(i,A.size())REP(k,B.size())REP(j,B[0].size()){
C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD;
}
return C;
}
mat pow(mat A,ll n)
{
mat B(A.size(),vec(A.size()));
REP(i,A.size()){
B[i][i] = 1;
}
while(n > 0){
if ( n & 1) B = mul(B,A);
A = mul(A,A);
n >>= 1;
}
return B;
}
Submission Info
Submission Time |
|
Task |
C - Sentou |
User |
makss |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2023 Byte |
Status |
AC |
Exec Time |
81 ms |
Memory |
1792 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 |
79 ms |
1792 KB |
maxrand1 |
AC |
81 ms |
1792 KB |
maxrand2 |
AC |
79 ms |
1792 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 |