text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);++i)
using namespace std;
int main(void){
int n,m,t;
cin>>n>>m>>t;
vector<int> a(n);
rep(i,n) cin>>a[i];
int sum = a[0]-m + max(t-a[n-1]-m,0);
rep(i,n-1){
sum += max(a[i+1]-a[i]-m*2, 0);
}
cout<<sum<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
vector<int> v;
int main(){
int n, m, t;
cin >> n >> m >> t;
for(int i = 0; i < n; i++){
int tmp;
cin >> tmp;
v.push_back(tmp);
}
//v.push_back(t);
int ans = 0;
//exeption
ans += v[0] - m;
for(int i = 1; i < n; i++){
if(v[i] - v[i-1] > 2 * m) ans += (v[i] - v[i-1]) - 2 * m;
}
if(t - v[n-1] > m) ans += (t - v[n-1]) - m;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, m, t;
cin >> n >> m >> t;
vector<int> a(n);
for(auto&& i : a){
cin >> i;
}
a.push_back(t + m);
int now = 0, ans = 0;
for(int i = 0; i < a.size(); i++){
ans += max(0, a[i] - now - m);
now = a[i] + m;
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M, T;
cin >> N >> M >> T;
vector<long long int>data( N );
for( size_t i = 0; i < N; i++ ) {
cin >> data[i];
}
long long int ans = 0;
for( size_t i = 0; i < N - 1; i++ ) {
ans += max( data[i + 1] - data[i] - 2 * M, 0LL );
}
ans += data[0] - M;
ans += max( T - data[data.size() - 1] - M, 0LL );
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int max = 0;
int N,M,T;
int a[1000];
cin >> N >> M >> T;
for(int i=0; i<N; ++i){
cin >> a[i];
}
max = a[0] - M;
for(int i=1; i<N; ++i){
if(a[i] - a[i-1] > 2 * M){
max += a[i] - a[i -1] - 2*M;
continue;
}
}
if(T - a[N - 1] > M){
max += T - a[N-1] - M;
}
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
int a[105];
for(int i=0;i<n;i++){
cin >> a[i];
}
int ans = a[0]-m;
for(int i=0;i<n-1;i++){
ans += max(0, a[i+1]-a[i]-m*2);
}
ans += max(0, t-a[n-1]-m);
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
int a[150];
for(int i = 0;i < n;i++)cin >> a[i];
int loss = m;//begin and end
for(int i = 0;i < n-1;i++){
loss += min(2 * m, a[i+1] - a[i]);
}
loss += min(m, t - a[n-1]);
cout << t - loss << endl;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M, T;
cin >> N >> M >> T;
vector<int>a (N+1);
a[N] = T;
for( int i = 0; i < N; i++)
cin >> a[i];
int ans = a[0] - M;
for( int i = 0; i < a.size()-1; i++) {
if( i == a.size() - 2 )
ans += max(0, a[i+1]-a[i]-M);
else
ans += max(0, a[i+1]-a[i]-2*M);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, T;
cin >> N >> M >> T;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int sumTime = 0;
if (A[0] - M > 0) sumTime += A[0] - M;
for (int i = 1; i < A.size(); i++) {
if (A[i] - A[i - 1] > 2 * M) sumTime += A[i] - A[i - 1] - 2 * M;
}
if (T - A[A.size() - 1] > M) sumTime += T - A[A.size() - 1] - M;
cout << sumTime << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,m,t;
vector<pair<int,int> >a;
int main()
{
cin>>n>>m>>t;
for(int i=0;i<n;i++)
{
int x;cin>>x;
a.push_back(make_pair(x-m,x+m));
}
int cnt=0,now=0;
for(int i=0;i<n;i++)
{
if(a[i].first>now)cnt+=a[i].first-now;
now=a[i].second;
}
if(t>now)cnt+=t-now;
cout<<cnt<<endl;
}
|
#include<iostream>
using namespace std;
#define rep(i, n) for(i = 0;i < n;++i)
int main(void){
int i, j;
int n, m, t;
cin >> n >> m >> t;
int a[n + 2];
a[0] = -m;
rep(i, n)cin >> a[i + 1];
a[n + 1] = t + m;
int res = 0;
rep(i, n + 1)res += max(a[i + 1] - a[i] - m - m, 0);
cout << res << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M, T, temp, temp2[10010] = {}, count = 0;
cin>>N>>M>>T;
for(int i = 0; i < N; i++){
cin>>temp;
for(int j = temp - M + 1; (j <= temp + M )&& j <= T; j++ ){
temp2[j] = 1;
}
}
for(int i = 1; i <= T; i++){
if(!temp2[i])count++;//cout<<temp2[i]<<endl;
}
cout<<count<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
int h[100]={};
cin>>n>>m>>t;
for(int i=0;i<n;i++)cin>>h[i];
int ans=t-m;
if(t-h[n-1]>m)ans-=m;
else ans-=t-h[n-1];
for(int i=0;i<n-1;i++)
if(h[i+1]-h[i]>2*m)ans-=2*m;
else ans-=h[i+1]-h[i];
cout<<ans<<endl;
return 0;
} |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
int main(){
int N,M,T,pre,current,maximum;
scanf("%d %d %d",&N,&M,&T);
scanf("%d",¤t);
maximum = current - M;
pre = current;
for(int i = 1; i < N; i++){
scanf("%d",¤t);
if(current - pre > 2*M){
maximum += current-pre-2*M;
}
pre = current;
}
if(T - pre > M){
maximum += T-pre-M;
}
printf("%d\n",maximum);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e7+1;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
typedef long long int ll;
typedef vector<ll> vi;
typedef vector < pair<ll, ll > > vp;
typedef vector <string> vs;
typedef vector <char> vc;
typedef list <ll> lst;
ll n,m, k, ans = 0, sum = 0, cnt = 0;
string s;
char c;
/*--------------------template--------------------*/
ll v[10004];
int main()
{
ll t;
cin >> n >> m >> t;
fill(v, v + 10004, 0);
REP(i, n)
{
ll a, b, c;
cin >> a;
a - m > 0 ? b = a - m : b = 0;
m + a > t ? c = t : c = m + a;
FOR(i, b, c) v[i] = 1;
}
REP(i, t) ans += v[i];
cout << t - ans << endl;
} |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int time=0,now=0;
if(m < a[0]){
time+=a[0]-m;
}
now=a[0];
for(int i=1; i<n; i++){
if(now+2*m < a[i]){
time+=a[i]-(now+2*m);
}
now = a[i];
}
if(now+m < t){
time+=t-(now+m);
}
cout << time << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
int N, M, T;
cin >> N >> M >> T;
vector<int>a(N+1);
a[0] = -M;
for (int i = 0; i < N; i++) {
cin >> a[i+1];
}
a.push_back(T+M);
int ans = 0;
for (int i = 1; i < a.size(); i++) {
ans += max(0, (a[i] - a[i - 1]) - 2 * M);
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
#include<queue>
using namespace std;
long long int mod = 1000000007;
int main(void) {
int n, m, t;
cin >> n >> m >> t;
vector<bool> a(10000+5, false);
for(int i=1; i<n+1; i++){
int tmp;
cin >> tmp;
for(int j=max(0, tmp-m); j<min(10005, tmp+m); j++) a[j] = true;
}
int cnt = 0;
for(int i=0; i<t; i++){
cnt += a[i];
}
cout << t - cnt << endl;
return 0;
}
// |
#include <iostream>
using namespace std;
int main(){
int a,b,c,n,t[10001]={0},p=0,i,j;
for(cin>>n>>a>>b,i=0;n--;){
for(cin>>c,j=c-a;j<=c+a-1&&j<b;)if(!(t[j++]++))p--;
}
cout<<b+p<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << (x) << endl
int main(){
int n, m, t;
while(cin >> n >> m >> t && n){
int a[110];
a[0] = 0;
rep(i, n) cin >> a[i+1];
a[n+1] = t;
int ans = 0;
rep(i, n+1) ans += max(0, a[i+1] - a[i] - ((i==0 || i==n) ? m : 2*m));
cout << ans << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;
//-----------------------------------------------------------------------
int A[100];
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,t;
cin>>n>>m>>t;
REP(i,n) cin>>A[i];
int ans=A[0]-m;
REP(i,n-1){
int d=A[i+1]-A[i];
ans+=max(0LL,d-2*m);
}
int rest=t-A[n-1];
ans+=max(0LL,rest-m);
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstring>
using namespace std;
int con[210000];
int main() {
int N, M, T; cin >> N >> M >> T;
memset(con, 0, sizeof(con));
for (int i = 0; i < N; ++i) {
int a; cin >> a;
for (int b = a - M; b < a + M; ++b) {
con[b]++;
}
}
int res = 0;
for (int t = 0; t < T; ++t) if (!con[t]) ++res;
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, t, ans = 0, a, bf;
int main() {
int i;
cin >> n >> m >> t;
for(i = 0; i < n; ++i) {
cin >> a;
if(i == 0)
ans += a - m;
else if((a - bf) > 2 * m)
ans += (a - bf) - 2 * m;
if(i == n - 1 && (t - a) > m) ans += (t - a) - m;
bf = a;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int N, M, T;
std::vector<int> t(1e5, 1);
int main() {
std::cin >> N >> M >> T;
int a;
for(int i = 0; i<N; ++i) {
std::cin >> a;
for(int j = a - M; j < a + M; ++j) {
t[j] = 0;
}
}
int ans = std::accumulate(t.begin(), t.begin() + T, 0);
std::cout << ans << std::endl;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int N,M,T;
int input[200];
int main(){
scanf("%d%d%d",&N,&M,&T);
for(int i=1;i<=N;i++) scanf("%d",input+i);
int res=0;
for(int i=1;i<N;i++){
res+=max(0,input[i+1]-input[i]-2*M);
}
res+=max(0,input[1]-M);
res+=max(0,T-input[N]-M);
printf("%d\n",res);
return 0;
}
|
#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n);i<(N);i++)
#define RREP(i,n,N) for(ll i=(N-1);i>=(n);i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a,b) memcpy(b,a,sizeof(b))
#define p(s) cout<<(s)<<endl
#define p2(a, b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const ll mod= 1e9+7;
const ll inf = 1e18;
ll d[10010];
ll N, M, T;
ll a[110];
int main(){
while(cin>>N>>M>>T && N != 0){
REP(i,0,N) cin>>a[i];
REP(i,0,10010) d[i] = 0;
REP(i,0,N){
d[max(0LL,a[i]-M)]++;
d[min(T,a[i]+M)]--;
}
REP(i,1,T+1){
d[i] += d[i-1];
}
ll ans = 0;
REP(i,0,T+1){
if(d[i] > 0) ans++;
}
cout<<T-ans<<endl;
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) begin(x),end(x)
using namespace std;
int main() {
int n,m,t;
cin>>n>>m>>t;
vector<bool> ok(t, true);
REP(i,n) {
int a;
cin>>a;
FOR(j,max(0,a-m),min(t,a+m)) ok[j] = false;
}
cout << count(ALL(ok), true) << endl;
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
#include<random>
using namespace std;
int main()
{
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> m(T, 1);
for (int i = 0; i < N; ++i) {
int idx = a[i];
for (int j = 0; j < M; ++j) {
if(idx - j - 1 >= 0) m[idx - j - 1] = 0;
if(idx + j < T) m[idx + j] = 0;
}
}
int ans = accumulate(begin(m), end(m), 0);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = a[0] - M;
for (int i = 0; i < N - 1; i++) {
if (a[i + 1] - a[i] > 2 * M) {
sum += a[i + 1] - a[i] - 2 * M;
}
}
sum += max(0, T - a[N - 1] - M);
cout << sum << endl;
return 0;
} |
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
int n,m,t,a[101];
int main( ){
int answer = 0;
cin >> n >> m >> t;
rep(i,n) cin >> a[i];
// 0
answer += ( a[0] - m );
// 1..n-1
rep(i,n) if( a[i+1] - a[i] > m * 2 ) {
answer += ( a[i+1] - a[i] - m * 2 );
}
if( t - ( a[n-1] + m ) > 0 ) answer += ( t - ( a[n-1] + m ) );
cout << answer << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, T; cin >> N >> M >> T;
int ans = 0;
int pv = 0;
for (int i = 0; i < N; ++i) {
int a; cin >> a;
ans += max(0, max(0, a - M) - pv);
pv = min(T, a + M);
}
cout << ans + T - pv << endl;
return 0;
}
|
#include <iostream>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
int main(void) {
long long N, M, T;
long long A[10000];
cin >> N >> M >> T;
REP(i, 0, N) cin >> A[i];
long long last = 0, ans = 0;
REP(i, 0, N) {
ans += max(A[i] - M - last, 0LL);
last = A[i] + M;
}
ans += max(T - last, 0LL);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int n,m,t,a;
cin >> n >> m >> t;
vector<int> used(1000000,0);
rep(i,n){
cin >> a;
used[a] = 1;
rep(i,m){
used[a+i+1]= 1;
used[a-i-1]= 1;
}
}
int cnt = 0;
rep(i,t){
if(used[i] != used[i+1]) cnt++;
}
cnt /= 2;
rep(i,t){
if(used[i]==0) cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N, M, T, a, t = 0, ans = 0;
cin >> N >> M >> T;
for (int i = 0; i < N; ++i) {
cin >> a;
if (!i) {
if (a > M) ans += a - M;
t = a;
} else {
if (t + 2*M < a) ans += a - t - 2*M;
t = a;
}
}
if (t + M < T) ans += T - t - M;
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
using ll = long long;
using P = std::tuple<int,int>;
const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
int main(){
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int N, M, T;
std::cin >> N >> M >> T;
int A[110];
for(int i=1;i<=N;++i){
std::cin >> A[i];
}
A[0] = 0;
A[N+1] = T;
int res = 0;
for(int i=0;i<=N;++i){
int pathLength = (i == 0 || i == N) ? M : 2 * M;
if(A[i+1] - A[i] < pathLength){
}else{
res += A[i+1] - A[i] - pathLength;
}
}
std::cout << res << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, t, a;
cin >> n >> m >> t;
vector<bool> used(t + m + 1, false);
for (int i = 0; i < n; ++i) {
cin >> a;
for (int j = max(a - m, 0); j < min(a + m, t); ++j)
used[j] = true;
}
int cnt = 0;
for (int i = 0; i < t; ++i)
if (!used[i]) ++cnt;
cout << cnt << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int N,M,T;
scanf("%d %d %d",&N,&M,&T);
for(int i=0;i<N;i++) scanf("%d",&a[i]);
int sum=a[0]-M;
for(int i=1;i<N;i++) {
if(a[i]-a[i-1]<=2*M) continue;
sum+=a[i]-a[i-1]-2*M;
}
sum+=max(T-a[N-1]-M,0);
printf("%d\n",sum);
} |
#include <iostream>
using namespace std;
int main(){
int a,b,c,n,t[10001]={0},p=0,i,j;
for(cin>>n>>a>>b,i=0;n--;)
for(cin>>c,j=c-a;j<=c+a-1&&j<b;)if(!(t[j++]++))p--;
cout<<b+p<<endl;
} |
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
void _main() {
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N), cum(T + 1, 0);
REP (i, N) {
cin >> a[i];
cum[a[i] - M]++;
cum[min(T, a[i] + M)]--;
}
REP (i, T) cum[i + 1] += cum[i];
int ans = 0;
FOR (i, 1, T + 1) ans += (cum[i] == 0);
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
_main();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
int N,M,T;
int sum[100000];
signed main(){
cin>>N>>M>>T;
rep(i,N){
int a;
cin>>a;
sum[a-M]++;
sum[a+M]--;
}
int ans=0;
rep(i,T){
sum[i+1]+=sum[i];
if(!sum[i])ans++;
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int time[10001];
int n,m,t,a,ans=0;
bool b=false;
for(int i=0;i<10001;i++){
time[i]=0;
}
cin>>n>>m>>t;
for(int i=0;i<n;i++){
cin>>a;
time[a]=1;
for(int j=a;j>=0 && abs(a-j)<=m;j--){
time[j]=2;
}
for(int j=a;j<10001 && abs(a-j)<=m;j++){
time[j]=2;
}
}
for(int i=0;i<t+1;i++){
if(time[i]==0 && b){
ans+=2;
b=false;
}
else if(time[i]==0) ans++;
else b=true;
}
if(b) cout<<ans<<endl;
else cout<<ans-1<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
void ido(int M, int T, int time[])
{
for (int i = 0; i < T; i++) {
if (time[i] == 2)
for (int j = 0; j < M; j++) {
if (i - j - 1 >= 0)
time[i - j - 1] = 1;
if (i + j < T && time[i + j] != 2)
time[i + j] = 1;
}
}
}
int main()
{
int N, an, ret = 0, time[10000], T, M;
cin >> N >> M >> T;
for (int i = 0; i < T; i++)
time[i] = 0;
for (int i = 0; i < N; i++) {
cin >> an;
time[an] = 2;
}
ido(M, T, time);
for (int i = 0; i < T; i++)
if (!time[i])
ret++;
cout << ret << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<long>;
int main() {
long n, m, t;
cin >> n >> m >> t;
VI as;
long ans = 0;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (i == 0) ans += a - m;
if (i == n - 1) ans += max(0l, t - a - m);
as.push_back(a);
}
for (int i = 0; i < n - 1; i++) {
ans += max(0l, as[i + 1] - as[i] - 2 * m);
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, m, t;
cin >> n >> m >> t;
long long int a;
long long int sum = 0;
long long int tt = 0;
cin >> a;
sum += a-m;
tt = a;
for (long long int i = 1; i < n; i++) {
cin >> a;
if (a > tt+m*2) {
sum += a-(tt+m*2);
}
tt = a;
}
if (t > tt+m) {
sum += t-(tt+m);
}
cout << sum << endl;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
while (true) {
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int sum = a[0] - M;
for (int i = 0; i < N - 1; i++) {
if (a[i + 1] - a[i] > 2 * M) {
sum += a[i + 1] - a[i] - 2 * M;
}
}
sum += max(0, T - a[N - 1] - M);
cout << sum << endl;
break;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define reps(i,j,k) for(int i = j; i < k;++i)
#define rep(i,j) reps(i,0,j)
int main(){
int N,M,T;
int stage[10010] = {};
int sum[10010] = {};
cin >> N >> M >> T;
rep(i,N){
int a;
cin >> a;
stage[a-M]++;
stage[a+M]--;
}
reps(i,1,T+5){
sum[i] = sum[i-1] + stage[i];
}
/*rep(i,T+1){
cout << sum[i] << " ";
}
cout << endl;*/
int cnt = 0;
rep(i,T){
if(sum[i] != 0){
continue;
}
++cnt;
}
cout << cnt << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
bool l[10010];
for (int i = 0; i < t; i++){
l[i] = true;
}
for (int i = 0; i < n; i++){
int a; cin >> a;
for (int i = a - m; i <= min(t, a + m - 1); i++) {
l[i] = false;
}
}
int sum = 0;
for (int i = 0; i < t; i++){
if (l[i] == true)sum++;
}
cout << sum << endl;
char c; cin >> c;
} |
#include <bits/stdc++.h>
#define REP(i,n)for (int i=0;i<(n);i++)
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define ll long long
using namespace std;
int main(){
int n,m,t,a;
int time[10100];
memset(time,0,sizeof(time));
cin>>n>>m>>t;
REP(i,n){
cin>>a;
time[a-m]++;time[min(a+m,10010)]--;
}
REP(i,t)time[i+1]+=time[i];
int ans=0;
REP(i,t)if(time[i]==0)ans++;
cout<<ans<<endl;
} |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
int main(){
int a,b,c;cin>>a>>b>>c;
int ans=0;
bool now=true;
int now2=0;
for(int i=0;i<a;i++){
int n;cin>>n;
if(now){
ans+=max(0,n-now2-b);
now=false;
now2=n;
}else{
ans+=max(0,n-now2-2*b);
now2=n;
}
}
cout<<ans+max(0,c-now2-b)<<endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<((x))<<endl
#define fi first
#define se second
#define INF 2147483600
#define long long long
int main(){
int n,m,t;
cin>>n>>m>>t;
vector<bool> vec(t,false);
rep(loop,n){
int a;
cin>>a;
for(int i=max(0,a-m); i<min(t,a+m); i++){
vec[i]=true;
}
}
int res=0;
rep(i,t) if(!vec[i]) res++;
cout << res<<endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
ll N, M, T; cin >> N >> M >> T;
vector<ll> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
ll ans = 0;
ans += a[0] - M;
for (int i = 1; i < N;i++) {
if (a[i] - a[i - 1] <= 2 * M) continue;
else {
ans += a[i] - a[i - 1] - 2 * M;
}
}
ans += max(0LL, T - a[N - 1] - M);
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;
//-----------------------------------------------------------------------
int A[100];
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,t;
cin>>n>>m>>t;
REP(i,n) cin>>A[i];
int ans=A[0]-m;
REP(i,n-1){
ans+=max(0LL,A[i+1]-A[i]-2*m);
}
ans+=max(0LL,t-A[n-1]-m);
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
int N, M, T, t[100];
int imos[30000] = { 0 };
cin >> N >> M >> T;
for(int i = 0; i < N; i++) {
int t; cin >> t;
imos[t - M]++, imos[t + M]--;
}
for(int i = 1; i <= T; i++) {
imos[i] += imos[i - 1];
}
int cnt = 0;
for(int i = 0; i < T; i++) {
if(!imos[i]) cnt++;
}
cout << cnt << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
int time;
int a[105];
cin >> n >> m >> t;
for(int i=0;i < n;i++){
cin >> a[i];
}
int d[105]={};
for(int i=0;i < n-1;i++){
d[i] = a[i+1]-a[i];
}
time = 0;
for(int i=0;i < n-1;i++){
if(d[i]-2*m > 0) time += d[i]-2*m;
}
time += max(t-a[n-1]-m,0);
cout << time+a[0]-m << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;
int main(){
int N,M,T;
cin>>N>>M>>T;
int t[10001];
fill(t,t+10001,1);
int let;
int ans=0;
REP(i,0,N){
cin>>let;
REP(j,let-M+1,let+M+1){
if(j>10000) break;
t[j]=0;
}
}
REP(i,1,T+1){
ans+=t[i];
}
p(ans);
return 0;
} |
#include <iostream>
using namespace std;
int main(void) {
int N, M, T;
int a[100] = {};
cin >> N >> M >> T;
for(int i = 0; i < N; i++) {
cin >> a[i];
}
int t_study = T - M;
int diff = M;
for(int j = 0; j < N-1; j++) {
diff = a[j+1] - a[j];
if(diff < 2*M) {
t_study = t_study - diff;
} else {
t_study = t_study - 2*M;
}
}
diff = T - a[N-1];
if(diff < M) {
t_study = t_study - diff;
} else {
t_study = t_study - M;
}
cout << t_study << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
t++;
vector<bool> v(t);
for(int i=0;i<t;i++) v[i] = false;
for(int i=0;i<n;i++){
int a;
cin >> a;
v[a] = true;
}
int count = 0;
for(int i=0;i<t;i++){
if(v[i]) count = m+1;
else count=max(count-1,0);
if(count) v[i]=true;
}
count = 0;
for(int i=t-1;i>=0;i--){
if(v[i]) count = m+1;
else count=max(count-1,0);
if(count) v[i]=true;
}
int ans = 0;
for(int i=0;i<t-1;i++){
if(!v[i] || !v[i+1]){
ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m, t;
cin >> n >> m >> t;
vector<int> can(t, 1);
while (n--) {
int a;
cin >> a;
for (int i = a - m; i < min(a + m, t); ++i) {
can[i] = 0;
}
}
int res = accumulate(begin(can), end(can), 0);
cout << res << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, T; cin >> N >> M >> T;
vector<int> A(N);
for(int i=0; i<N; ++i) cin >> A[i];
int res = A[0] - M;
for(int i=0; i+1<N; ++i) res += max(A[i + 1] - A[i] - 2 * M, 0);
res += max(T - M - A[N - 1], 0);
cout << res << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
bool study[10001];
signed main() {
ios::sync_with_stdio(false);
int N, M, T; cin >> N >> M >> T;
memset(study, -1, sizeof(study));
while(N--) {
int t; cin >> t;
for(int i = t - M; i <= t + M; ++i) {
// assert(i >= 0);
// assert(i <= T);
if(i >= 0 && i <= T) {
study[i] = false;
}
}
}
int ans = 0;
REP(i, T) {
if(study[i] || study[i + 1]) ans++;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
while (true) {
int n, m, t;
cin >> n >> m >> t;
if (n == 0)
break;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
a.push_back(-m);
a.push_back(t + m);
sort(a.begin(), a.end());
long long ans = 0;
int bef = a[0];
for (int i = 1; i <= a.size(); i++) {
ans += max(0, a[i] - bef - 2 * m);
bef = a[i];
}
cout << ans << endl;
break;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int n,m,t,a;
cin >> n >> m >> t;
vector<int> used(1000000,0);
rep(i,n){
cin >> a;
used[a] = 1;
rep(i,m){
used[a+i+1]= 1;
used[a-i-1]= 1;
}
}
int cnt = 0;
rep(i,t){
if(used[i] != used[i+1]) cnt++;
}
//rep(i,t+10) cout << used[i] << " ";
//cout << endl;
cnt /= 2;
rep(i,t){
if(used[i]==0) cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
int ans=0;
for(int i=0;i<n;i++){
if(i==0)
ans+=a[0]-m;
if(i==n-1)
if(t-a[n-1]>m)
ans+=t-a[n-1]-m;
if((1!=0)&&(i!=n-1)&&((a[i+1]-a[i]-2*m)>=0))
ans+=(a[i+1]-a[i]-2*m);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int n, m, t, ans;
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n >> m >> t;
int tmp = -1;
for(int i=0; i<n; ++i){
int a;
cin >> a;
if(i == 0){
ans += a - m;
}else{
ans += max(0, a - tmp - 2*m);
}
tmp = a;
if(i == n-1){
ans += max(0, t - tmp - m);
}
}
cout << ans << "\n";
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
using namespace std;
int main() {
int N, M, T, a[105];
cin>>N>>M>>T;
REP(i,0,N) cin>>a[i];
int ans = a[0] - M;
REP(i,1,N){
ans += max(0, (a[i]-M*2) - a[i-1]);
//cout<<"i: "<<i<<", +"<<max(0, (a[i]-M*2) - a[i-1])<<endl;
}
ans += max(0, T - (a[N-1] + M));
//cout<<" +"<<max(0, T - (a[N-1] + M))<<endl;
cout<<ans<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int a[100000],n,m,t,p;
int main(){
cin>>n>>m>>t;
for(int i=0;i<n;i++){cin>>p;a[p-m]++;a[p+m]--;}
for(int i=1;i<t;i++)a[i]+=a[i-1];
int cnt=0;for(int i=0;i<t;i++){if(a[i]==0)cnt++;}
cout<<cnt<<endl;
return 0;
} |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M >> K;
vector<bool>can(K, true);
for (int i = 0; i < N; i++) {
cin >> H;
L = max(H - M, (long long int)0);
R = min(H + M, K);
for (int j = L; j < R; j++) {
can[j] = false;
}
}
for (int i = 0; i < K; i++) {
if (can[i]) {
W++;
}
}
cout << W << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
vector<int> v;
cin>>n>>m>>t;
v.push_back(-m);
for(int i=0;i<n;i++){
int a;
cin>>a;
v.push_back(a);
}
v.push_back(t+m);
int ans=0;
for(int i=1;i<v.size();i++){
ans+=max(0,v[i]-v[i-1]-2*m);
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
cin>>n>>m>>t;
int x,y;
x=0;
int ans=0;
for(int i=0;i<n;i++){
cin>>y;
if(i==0){
ans+=y-m;
}
else if(y-x<2*m) 1;
else ans+=y-x-2*m;
x=y;
}
if(t-x>m) ans+=t-x-m;
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
int main() {
int n, m, t;
cin >> n >> m >> t;
vector<int> v(n);
for (auto &&i : v) scanf("%d", &i);
int ans = max(0, v.front()-m)+max(0, t-v.back()-m);
for (int i = 0; i < n-1; ++i) {
ans += max(0, v[i+1]-v[i]-2*m);
}
cout << ans << "\n";
return 0;
}
|
//#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <climits>
using namespace std;
using ll=long long;
void solve(){
int num,m,t;
cin >> num >> m >> t;
int f;
cin >> f;
int res=f-m;
int then=f;
for(int i=1;i<num;i++)
{
int a;
cin >> a;
if(a-then>2*m)
res+=a-then-2*m;
then=a;
}
cout << res+max(0,t-then-m) << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m, t; cin >> n >> m >> t;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<int> imos(t + 1, 0);
for(int i = 0; i < n; i++){
imos[a[i] - m]--;
if(a[i] + m <= t) imos[a[i] + m]++;
}
for(int i = 2; i <= t; i++){
imos[i] += imos[i - 1];
}
int ans = 0;
for(int i = 0; i < t; i++){
//cout << imos[i] << " ";
if(imos[i] == 0) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;
int main(){
int n, m, t;
int a[30000] = {0};
cin >> n >> m >> t;
rep(i,n){
int inp;
cin >> inp;
a[max(0, inp - m)]++;
a[min(t, inp + m)]--;
}
int cnt = 0;
int c = 0;
rep(i,t){
c+=a[i];
if(c == 0) cnt++;
}
cout << cnt << endl;
} |
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
int N,M,T;
cin >> N >> M >> T;
std::vector<int> a(N);
std::vector<int> dis(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
if (i == N-1) {
dis[i] = 10001;
}
else {
dis[i] = a[i+1] - a[i];
}
}
int nst = 2 * M * N;
for (int i = 0; i < N; i++) {
if (i != N-1) {
if (dis[i] < 2*M) {
nst -= 2 * M;
nst += dis[i];
}
}
else {
if (a[i]+M >= T) {
nst -= (a[i] + M) - T;
}
}
}
cout << (T - nst) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, T, A[100];
cin >> N >> M >> T;
for(int i = 0; i < N; i++) cin >> A[i];
int ret = 0, time = 0;
for(int i = 0; i < N; i++) {
ret += max(0, A[i] - M - time);
if(i == N - 1 || A[i] + M + M <= A[i + 1]) time = A[i] + M;
else time = A[i + 1] + M;
}
cout << ret + max(0, T - time) << endl;
} |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef pair<int, int> P;
signed main(){
int n, m, t;
cin >> n >> m >> t;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int ans = 0;
int now = 0;
int l = 0, r = 0;
rep(i, 0, n){
l = a[i] - m;
r = a[i] + m;
if(now < l) ans += l - now;
now = r;
}
if(now < t) ans += t - now;
cout << ans << endl;
} |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
using namespace std;
int main() {
complex<long double>cmpmp;
const long long int mod = 1000000007;
map<long long int, long long int>mp;
//cout << fixed << setprecision(10);
int n, m, t;
cin >> n >> m >> t;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int res = 0;
res += max(a[0] - m, 0);
for (int i = 0; i < n - 1; i++) {
res += max((a[i + 1] - a[i]) - 2 * m, 0);
}
res += max((t - a.back()) - m, 0);
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, t, a[109];
int main() {
cin >> n >> m >> t; a[0] = -m, a[n+ 1] = t + m;
for(int i = 1; i <= n; i++) cin >> a[i];
int ret = 0;
for(int i = 0; i <= n; i++) ret += max(a[i + 1] - a[i] - 2 * m, 0);
cout << ret << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
int N,M,T;
bool ok[20000];
signed main(){
cin>>N>>M>>T;
fill_n(ok,T,true);
rep(i,N){
int t;cin>>t;
reps(j,t-M,t+M)ok[j]=false;
}
cout<<accumulate(ok,ok+T,0ll)<<endl;
return 0;
} |
#include<iostream>
#include<list>
#include<vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<math.h>
#include<unordered_map>
using namespace std;
using vec = vector<int>;
using mat = vector<vec>;
using lst = list<int>;
bool solve()
{
int N, M, T;
cin >> N >> M >> T;
vec V(T+1, 0);
for (int i = 0; i < N; ++i)
{
int a; cin >> a;
V[a - M + 1] = 1;
if (a + M + 1 <= T)
V[a + M + 1] = -1;
}
int ans = 0;
for (int i = 1; i <= T; ++i)
{
V[i] += V[i - 1];
ans += V[i] == 0;
}
cout << ans << endl;
return true;
}
int main()
{
solve();
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int N,M,T,a[100],ans=0,sa;
while(1){
cin>>N;
cin>>M;
cin>>T;
for(int lop=0;lop<N;lop++){
cin>>a[lop];
}
ans=T;
ans-=M*N*2;
if(T<a[N-1]+M){
ans=ans+( (a[N-1]+M) -T);
}
for(int lop=0;lop<N-1;lop++){
if( (a[lop+1]-a[lop])<M*2 ){
ans=ans+((M*2)-(a[lop+1]-a[lop]));
}
}
cout<<ans<<endl;
for(int lop=0;lop<N;lop++){
a[lop]=0;
}
ans=0;
break;
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n, m, t;
int a[100];
int main() {
int i;
cin >> n >> m >> t;
for (i = 0; i < n; i++) cin >> a[i];
int ans = a[0] - m;
for (i = 1; i < n; i++) {
ans += max(0, a[i] - a[i - 1] - 2 * m);
}
ans += max(0, t - a[n - 1] - m);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,T;
cin>>n>>m>>T;
int pre=0,ans=0;
for(int i=0;i<n;++i){
int a;
cin>>a;
if(i==0){
ans+=a-m;
}else if(int buf=a-pre-2*m){
if(buf>0)ans+=buf;
}
if(i==n-1){
if(int buf=T-a-m){
if(buf>0)ans+=buf;
}
}
pre=a;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<P,P> PP;
const ll MOD=10000;
const ll INF=1000000010;
const int MAX=100001;
int dx[8]={0,1,0,-1,1,-1,1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
int main(){
int n,m,t;cin>>n>>m>>t;
int a[110];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=a[0]-m;
for(int i=1;i<n;i++){
ans+=max(0,a[i]-a[i-1]-2*m);
}
ans+=max(0,t-a[n-1]-m);
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t,cnt;
int a[110];
cin >> n >> m >> t;
cnt = t;
for(int i=0;i<n;i++){
cin >> a[i];
if(i > 0){
cnt -= min(m*2,(a[i]-a[i-1]));
}
}
cnt -= min(a[0],m);
cnt -= min(t-a[n-1],m);
cout << cnt << endl;
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M, T; cin >> N >> M >> T;
vector<int> a(N);
for(int i=0; i<N; ++i) cin >> a[i];
int res = a[0] - M;
for(int i=0; i+1<N; ++i) res += max(a[i + 1] - a[i] - 2 * M, 0);
res += max(T - a[N - 1] - M, 0);
cout << res << endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int n, m, t, d;
cin >> n >> m >> t;
bool a[t+1];
for( int i = 0; i < t + 1; i++ )
a[i] = 0;
for( int i = 0; i < n; i++ )
{
cin >> d;
int b = d - m < 0 ? 0 : d - m;
int c = d + m > t ? t : d + m;
for( int j = b; j <= c; j++ )
a[j] = 1;
}
int cnt = 0;
for( int i = 1; i < t + 1; i++ )
if( !a[i] || !a[i-1] )
cnt++;
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, t, ans = 0, i = 0;
scanf("%d%d%d", &n, &m, &t);
int pre = -m;
for (; i < n; i++) {
int a = 0;
scanf("%d", &a);
ans += max(a - pre - m * 2, 0);
pre = a;
}
ans += max(t - pre - m, 0);
printf("%d\n", ans);
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int N, M, T;
cin >> N >> M >> T;
vector<int> v(T+1);
for(int i=0; i<N; ++i) {
int t;
cin >> t;
v[max(0, t-M)]++;
v[min(T, t+M)]--;
}
for(int i=0; i<T; ++i) {
v[i+1] += v[i];
}
int res = 0;
for(int i=0; i<T; ++i) {
if(v[i] == 0) {
res++;
}
}
cout << res << endl;
}
|
#include<iostream>
#include<string>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
int a[102], sum = 0;
a[0] = -m;
a[n + 1] = t + m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i <= n; i++) {
int x = a[i + 1] - a[i];
if (x > m * 2) {
sum += (x - m * 2);
}
}
cout << sum << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define REAP(i,a,n) for(int i=(a);i<(n);i++)
#define YES cout<<"Yes"<<endl
#define NO cout<<"No"<<endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(),v.end()
typedef long long ll;
int main(){
int n,m,t;
cin >> n >> m >> t;
int a;
vector<int> tim(t,1);
REP(i,n){
cin >> a;
a--;
for(int j=a-m+1;j<=a+m&&j<t;j++){
tim[j]=0;
}
}
int sum=0;
REP(i,t){
sum+=tim[i];
}
cout << sum << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
cin>>n>>m>>t;
int a[n],td=t,nd=n;
for(int i=0;i<nd;i++){
cin>>a[i];
if(i!=0 && a[i]-a[i-1]<2*m){t-=(a[i]-a[i-1]); n-=1;}
}
if(a[nd-1]+m>td){t+=a[nd-1]+m-td;}
t-=n*m*2;
cout<<t<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
#define INF 1000000000;
using namespace std;
int main() {
int N, M, T;
cin >> N >> M >> T;
int a[N];
rep(i, N) cin >> a[i];
a[N] = T + M;
int ans = a[0] - M;
for (int i = 0; i < N; i++)
ans += max(0, a[i + 1] - a[i] - 2 * M);
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N + 1);
a[0] = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
int ans = T;
int t1 = a[N];
int t2 = a[N];
for (int i = N - 1; i >= 0; i--) {
if (t2 - a[i] < M * 2 && a[i] != 0) {
t2 = a[i];
} else {
int tmp = ans;
ans -= (t1 - t2) + M;
ans -= T - t1 < M ? T - t1 : M;
t1 = t2 = a[i];
}
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
int main(){
int N,M,T;
cin >> N >> M >> T;
vector<int> V(N);
rep(i,0,N)cin >> V[i];
int sum = V[0] - M;
sum += max(0, T - V[N-1] - M);
rep(i,1,N){
sum += max(0, V[i] - V[i-1] - M * 2);
}
cout << sum << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int n, m, t, a;
cin >> n >> m >> t;
bool occupied[10001] = {};
for(int i = 0; i < n; i++){
cin >> a;
for(int j = max(0, a-m); j < min(t, a+m); j++) occupied[j] = true;
}
int ans = 0;
for(int i = 0; i < t; i++) if(!occupied[i]) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
int ans = a[0] - M;
for (int i = 0; i < N - 1; i++){
ans += max(a[i + 1] - a[i] - M * 2, 0);
}
ans += max(T - a[N - 1] - M, 0);
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int N, M, T, a[100];
int main(){
int ans = 0;
cin >> N >> M >> T;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
ans += (a[0] - M > 0 ? a[0] - M : 0);
for (int i = 1; i < N; i++) {
if (a[i] - a[i - 1] > 2 * M) {
ans += a[i] - a[i - 1] - 2 * M;
}
}
ans += (T - a[N - 1] - M > 0 ? T - a[N - 1] - M : 0);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main(){
int n, m, t;
cin >> n >> m >> t;
vector<int> v;
for(int i=0;i<n;++i){
int a;
cin >> a;
v.push_back(a);
}
int ans = 0;
for(int i=1;i<n;++i){
ans += max(0, v[i]-v[i-1]-2*m);
}
ans += v[0] - m;
ans += max(0, t-v.back()-m);
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <vector>
int main() {
size_t N;
int M, T;
scanf("%zu %d %d", &N, &M, &T);
std::vector<int> a(N);
for (auto& ai: a) scanf("%d", &ai);
a.insert(a.begin(), -M);
int t = 0;
for (size_t i = 1; i <= N; ++i) {
t += std::max(0, a[i]-a[i-1]-2*M);
}
t += std::max(0, T-a[N]-M);
printf("%d\n", t);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.