Submission #1754322
Source Code Expand
#include <vector> #include <iostream> #include <utility> #include <algorithm> #include <string> #include <deque> #include <queue> #include <tuple> #include <queue> #include <functional> #include <cmath> #include <iomanip> #include <map> #include <set> #include <numeric> #include <unordered_map> #include <unordered_set> #include <complex> #include <iterator> #include <array> #include <memory> #include <stack> #define vi vector<int> #define vvi vector<vector<int> > #define ll long long int #define vl vector<ll> #define vvl vector<vector<ll>> #define vb vector<bool> #define vc vector<char> #define vs vector<string> #define ld long double #define INF 1e9 #define EPS 0.0000000001 #define rep(i,n) for(int i=0;i<n;i++) #define loop(i,s,n) for(int i=s;i<n;i++) #define all(in) in.begin(), in.end() template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; } template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; } #define MAX 9999999 using namespace std; typedef pair<int, int> pii; typedef pair<double,double>pdd; typedef pair<ll,ll>pll; int main(){ int n,m,t;cin>>n>>m>>t; vi v(n); rep(i,n)cin>>v[i]; int ans=0; int current=0; ans+=v[0]-m; rep(i,n-1){ if(v[i+1]-v[i]<m*2)continue; ans+=v[i+1]-v[i]-m*2; } if(t-v[n-1]>m)ans+=t-v[n-1]-m; cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 豪邸と宅配便 |
User | yebityon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1401 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_00, 00_sample_01, 00_sample_02, 10_random_01, 10_random_02, 10_random_03, 10_random_04, 10_random_05, 10_random_06, 10_random_07, 10_random_08, 10_random_09, 10_random_10, 20_large_01, 20_large_02, 20_large_03, 20_large_04, 20_large_05, 30_do_not_return01, 30_do_not_return02, 30_do_not_return03, 30_do_not_return04, 30_do_not_return05 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00 | AC | 1 ms | 256 KB |
00_sample_01 | AC | 1 ms | 256 KB |
00_sample_02 | AC | 1 ms | 256 KB |
10_random_01 | AC | 1 ms | 256 KB |
10_random_02 | AC | 1 ms | 256 KB |
10_random_03 | AC | 1 ms | 256 KB |
10_random_04 | AC | 1 ms | 256 KB |
10_random_05 | AC | 4 ms | 256 KB |
10_random_06 | AC | 1 ms | 256 KB |
10_random_07 | AC | 1 ms | 256 KB |
10_random_08 | AC | 1 ms | 256 KB |
10_random_09 | AC | 1 ms | 256 KB |
10_random_10 | AC | 1 ms | 256 KB |
20_large_01 | AC | 1 ms | 256 KB |
20_large_02 | AC | 1 ms | 256 KB |
20_large_03 | AC | 1 ms | 256 KB |
20_large_04 | AC | 1 ms | 256 KB |
20_large_05 | AC | 1 ms | 256 KB |
30_do_not_return01 | AC | 1 ms | 256 KB |
30_do_not_return02 | AC | 1 ms | 256 KB |
30_do_not_return03 | AC | 1 ms | 256 KB |
30_do_not_return04 | AC | 1 ms | 256 KB |
30_do_not_return05 | AC | 1 ms | 256 KB |