text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
int main()
{
int N, M, T;
scanf("%d%d%d", &N, &M,&T);
int t{-M}, sum{};
for (int i{}; i < N; i++)
{
int a;
scanf("%d", &a);
sum += std::max(0, a - t - 2 * M);
t = a;
}
sum += std::max(T - t - M, 0);
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
int main() {
int n, m, t;
cin >> n >> m >> t;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
}
int ans=0;
bool s=1;
int idx=0;
rep(i, t) {
if (idx >= n) {
if (!s) { i += m - 1; s = 1; }
else ans++;
continue;
}
if (s and i + m >= a[idx]) {
i += m - 1;
idx++;
s = 0;
continue;
}
if (!s and i + m*2 < a[idx]) {
i += m - 1;
s = 1;
continue;
}
else if (!s and i + m*2 >= a[idx]){
i = a[idx] - 1;
idx++;
continue;
}
ans++;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, t;
cin >> n >> m >> t;
vector<int> a(n);
rep(i, n) cin >> a[i];
int T = 0, ans = 0;
bool f = true;
rep(i, n)
{
int len = a[i] - T;
T = a[i];
if (f)
ans += len - m;
if (a[i + 1] - T >= 2 * m)
T += m, f = true;
else
f = false;
}
ans += max(0LL, t - a[n - 1] - m);
cout << ans << endl;
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(void) {
int i,j;
int n,m,t;
cin>>n>>m>>t;
vi times(t+1,0);
rep(i,n){
int a;
cin>>a;
times[a-m]++;
if(a+m<=t)times[a+m]--;
}
for(i=1;i<=t;i++)
times[i]+=times[i-1];
int ans=0;
rep(i,t)
if(times[i]==0)ans++;
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(){
int n, m, t;
cin >> n >> m >> t;
int a, a1;
int count = 0;
for(int i = 0; i < n; i++){
cin >> a;
if(i == 0)count += a - m;
else{
if(a - a1 > 2 * m)count += a - a1 - 2 * m;
}
a1 = a;
}
if(t > a + m)count += t - a - m;
cout << count << endl;
} |
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int32_t main() {
int32_t N, M, T;
cin >> N >> M >> T;
vector<int32_t> times;
for (uint32_t i = 0; i < N; i++) {
int32_t time;
cin >> time;
times.push_back(time - M);
times.push_back(time + M);
}
int32_t count = times[0] - 0;
for (uint32_t i = 1; i < times.size() - 1; i += 2) {
if (times[i + 1] - times[i] >= 0) {
count += times[i + 1] - times[i];
}
}
if (T - times[times.size() - 1] >= 0) {
count += T - times[times.size() - 1];
}
cout << count << 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 = 0;
ANS += A[0] - M;
ANS += max(0, T - M - A[N - 1]);
for (int i = 0; i < N - 1; i++) {
ANS += max(0, A[i + 1] - A[i] - M * 2);
}
cout << ANS << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
int a[n];
bool shosai[t];
for (int i = 0; i < t; i++)
shosai[i] = true;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = a[i] - m; j < a[i] + m && j < t; j++) {
shosai[j] = false;
}
}
int count = 0;
for (int i = 0; i < t; i++)
if (shosai[i]) count++;
cout << count << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, T, a;
cin >> N >> M >> T;
vector<bool> used(T+1, 0);
for (int i = 0; i < N; i++) {
cin >> a;
for (int j = a; j >= max(a-M, 0); j--) {
used[j] = 1;
}
for (int j = a; j < min(a+M, T); j++) {
used[j] = 1;
}
}
cout << count(used.begin(), used.end()-1, 0) << endl;
return 0;
} |
#include<bits/stdc++.h>
#define MAX 110
#define inf 1<<29
#define linf 1e18
#define eps (1e-8)
#define mod 1000000007
#define pi M_PI
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define pd(a) printf("%.10f\n",(double)(a))
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define equals(a,b) (fabs((a)-(b))<eps)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<double,int> pdi;
typedef vector<int> vi;
typedef vector<pii> vpi;
const int dx[8]={1,0,-1,0,1,1,-1,-1};
const int dy[8]={0,1,0,-1,1,-1,1,-1};
int main()
{
int n,m,t,ans=0;
int a[MAX];
cin>>n>>m>>t;
FOR(i,0,n)cin>>a[i];
ans+=a[0]-m;
FOR(i,1,n){
if(2*m<=a[i]-a[i-1])ans+=(a[i]-a[i-1])-2*m;
}
ans+=max(t-a[n-1]-m,0);
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define PI 3.1415926535897932384626433832795028841971
#define INF 1000000000
#define EPS 1e-10
#define MOD 1000003
#define HOGE 100000
#define HUGA 100000
using namespace std;
typedef long long ll;
typedef pair<double,double> P;
typedef pair<double,P> PQ;
int n, m, t;
bool x[10001];
int main(){
cin >> n >> m >> t;
int cnt = 0;
rep(i,n){
int z;
cin >> z;
for(int j = z-m; j < z+m; j++){
if(j < 0 || j >= t) continue;
x[j] = true;
}
}
for(int j = 0; j < t; j++){
if(x[j]) continue;
cnt++;
}
cout << cnt << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
int main() {
ll N, M, T;
cin >> N >> M >> T;
ll ans = 0;
vector<ll> A(N);
for(int i = 0; i < N; i++) cin >> A[i];
ans += max(0LL, A[0] - M);
for(int i = 1; i < N; i++) {
ans += max(0LL, A[i] - A[i-1] - 2 * M);
}
ans += max(0LL, T - A[N-1] - M);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <functional>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <cmath>
#include <cctype>
#include <cstdio>
#define ll long long
#define INF 1000000000000000001
#define MOD 1000000007
using namespace std;
int main(){
int N, M, T;
cin >> N >> M >> T;
int ans=0;
int a[100];
for(int i=0; i<N; i++){
cin >> a[i];
}
int cnt_a=0;
int flag=0;
for(int i=0; i<T; i++){
if(cnt_a<N-1 && i>=a[cnt_a+1]-M){
cnt_a++;
}
if(a[cnt_a]-M<=i && i<a[cnt_a]+M){
flag=1;
}else{
if(flag){
flag=0;
}
ans++;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m,t,a,b;
cin>>n>>m>>t;
b=-m;
int ans=0;
for(int i=0;i<n;i++){
cin>>a;
ans+=max(0,a-b-(2*m));
b=a;
}
ans+=max(0,t-a-m);
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
int N, M, T; cin >> N >> M >> T;
int A[N]; rep(i, N) cin >> A[i];
int ans = max(A[0]-M, 0) + max(T-M-A[N-1], 0);
for(int i = 0; i < N-1; i++){
ans += max(0, (A[i+1]-A[i]-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 s[114514]={};
for(int i=0;i<n;i++){
int a;
cin>>a;
s[a-m+1]++;
s[a+m+1]--;
}
for(int i=1;i<11450;i++){
s[i]+=s[i-1];
}
int ans=0;
for(int i=1;i<=t;i++){
if(!s[i])ans++;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int n,m,t;
cin >> n >> m >> t;
vi data(n);
REP(i,n) cin >> data[i];
int ans = 0;
if (data[0] - m > 0) ans += (data[0] - m);
for(int i = 0; i < n-1; i++){
int t = data[i+1] - data[i] - 2 * m;
if(t > 0) ans += t;
}
if((t - (data[data.size() - 1] + m)) > 0) ans += (t - (data[data.size() - 1] + m));
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
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=1;i<n;i++){
ans+=max(a[i]-a[i-1]-2*m,0);
}
ans+=max(t-a[n-1]-m,0);
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
#include <string>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
int main(){
int n,m,t;
cin>>n>>m>>t;
ll sum=0;
vector<int> a(n);
rep(i,n){
cin>>a[i];
}
sum+=max(0,a[0]-m);
sum+=max(t-(a[n-1]+m),0);
rep(i,n-1){
int tmp = a[i+1]-a[i]-2*m;
if(tmp<=0)continue;
sum+=tmp;
}
cout<<sum<<endl;
} |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, T; cin >> N >> M >> T;
int a[N]; FOR(i,0,N) cin >> a[i];
int go = a[0] - M;
int ans = go;
FOR(i,1,N) {
// ?????????
if(a[i-1] + 2 * M < a[i]) {
int get = a[i - 1] + M;
go = a[i] - M;
ans += go - get;
}
}
ans += max(T - a[N - 1] - M, 0);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,M,T; cin >> N >> M >> T;
vector<int> a(N+2);
a[0]=-M,a[N+1]=T+M;
for (int i=0;i<N;++i) cin >> a[i+1];
int ans=0;
for (int i=0;i<N+1;++i) ans+=max(0,a[i+1]-a[i]-2*M);
cout << ans << '\n';
}
|
#include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<string>
#include<math.h>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
using namespace std;
const int INF=100000000;
int main(){
int n,m,t;
cin>>n>>m>>t;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int tloss=0;
tloss+=2*m;
for(int i=0;i<n-1;i++){
if(a[i+1]-a[i]>2*m){
tloss+=2*m;
}
else{
tloss+=(a[i+1]-a[i]);
}
}
if(a[n-1]+m>t){
tloss-=(a[n-1]+m-t);
}
cout<<t-tloss<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void solve(int n,int m,int t){
vector<bool> tl(t,true);
int in,ans=0;
for(int i=0;i<n;i++){
cin>>in;
in-=1;
for(int j=max(0,in-m+1);j<min(t,in+m+1);j++){
tl[j]=false;
}
}
for(int i=0;i<t;i++){
if(tl[i]){
ans++;
}
}
cout<<ans<<endl;
}
int main(void){
int a,b,c;
cin>>a>>b>>c;
solve(a,b,c);
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N);
rep(i, N) cin >> a[i];
vector<bool> ok(T + 1, true);
rep(i, N) {
for (int j = max(0, a[i] - M + 1); j <= min(a[i] + M, T); j++) {
ok[j] = false;
}
}
int cnt = 0;
rep2(i, 1, T + 1) {
if (ok[i]) cnt++;
}
cout << cnt << endl;
} |
#include <iostream>
#include <cstring>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
int imos[t + 1];
memset(imos, 0, sizeof(imos));
for (int i = 0; i < n; i++){
int a;
cin >> a;
imos[a - m + 1] += 1;
if (a + m + 1 <= t)
imos[a + m + 1] -= 1;
}
int ans = 0;
for (int i = 0; i < t; i++) {
imos[i + 1] += imos[i];
}
for (int i = 1; i <= t; i++)
if (imos[i] == 0) ans++;
cout << ans << endl;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int N, M, T;
int a[100];
scanf("%d %d %d", &N, &M, &T);
for (int i=0;i<N;i++) scanf("%d", &a[i]);
int ans = T-M-min(M, T-a[N-1]);
for (int i=1;i<N;i++) ans -= min(a[i]-a[i-1], 2*M);
printf("%d\n", ans);
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 0
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
signed main() {
int N, M, T; cin >> N >> M >> T;
vector<int> a(N); rep(i, 0, N) { cin >> a[i]; }
int ans = T;
rep(i, 1, N) {
dump(ans);
ans -= min(a[i] - a[i - 1], 2 * M);
}
dump(ans);
ans -= M;
dump(ans);
ans -= min(T - a[N - 1], M);
dump(ans);
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, cur=0, ans=0;
cin >> N >> M >> T;
rep(i,N){
int a;
cin >> a;
ans += max(0, a-M - cur);
cur = a+M;
}
ans += max(0, T - cur);
cout << ans << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
using namespace std;
int N, M, T;
int A[100];
int main() {
cin >> N >> M >> T;
for (int j = 0; j < N; ++j) {
cin >> A[j];
}
int study[20101];
fill(study, study+20101, 0);
study[0] = 1;
study[20100] = -1;
for (int j = 0; j < N; ++j) {
--study[A[j]-M];
++study[A[j]+M];
}
int count = 0;
for (int j = 0; j < T; ++j) {
if (j > 0) { study[j] += study[j-1]; }
count += study[j] > 0 ? 1 : 0;
}
cout << count << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,t;
cin >> n >> m >>t;
int res=0;
int a[n+1];
for(int i=1;i<=n;i++) cin >> a[i];
res += max(0,a[1]-m);
for(int i=1;i<n;i++) res+= max(0,a[i+1]-a[i]-2*m);
res+= max(0,t-a[n]-m);
cout << res << endl;
} |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,m,t;
int a[10005];
int main(void){
scanf("%d%d%d",&n,&m,&t);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int ans=a[0]-m;
for(int i=0;i<n-1;i++){
if(a[i+1]-a[i]>=2*m){
ans+=(a[i+1]-a[i])-2*m;
}
}
if(t-a[n-1]>=m){
ans+=t-a[n-1]-m;
}
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int m;
int t;
int ans;
int as[114514];
int main() {
scanf("%d%d%d", &n, &m, &t);
for (int i=0; i<n; i++) {
scanf("%d", &as[i]);
}
ans += as[0]-m;
for (int i=0; i<n-1; i++) {
ans += max(0, as[i+1] - as[i] - m*2);
}
ans += max(0, t-as[n-1]-m);
printf("%d\n", ans);
} |
#include<iostream>
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 ans=0;
for(int i=1;i<n;i++){
if(a[i]-a[i-1]>m*2) ans+=a[i]-a[i-1]-m*2;
}
ans+=max(0, a[0]-m);
ans+=max(0, t-a[n-1]-m);
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
#define int ll
signed main(void)
{
int n, m, t, a[105], b[10010];
cin >> n >> m >> t;
REP(i, n) {
cin >> a[i];
b[max((ll)0, a[i]-m)]++;
b[min(t, a[i]+m)]--;
}
FOR(i, 1, t) b[i] += b[i-1];
int ret = 0;
REP(i, t) if(b[i] == 0) ret++;
cout << ret << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
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 count = 0;
count += v[0] - m;
for (int i = 0; i < n - 1; ++i) {
if (v[i + 1] - v[i] > 2 * m) {
count += v[i + 1] - v[i] - 2 * m;
}
}
count += max(t - v.back() - m, 0);
cout << count << endl;
}
|
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
int n,m,t;
int table[1000];
int main(){
cin>>n>>m>>t;
rep(i,n)cin>>table[i];
int ans=0,now=0;
for(int i=0;i<n;i++){
if(i==0&&table[i]>m)ans+=table[i]-m;
else if((table[i]-table[i-1])>m*2)ans+=(table[i]-table[i-1])-m*2;
}
if(t-table[n-1]>m)ans+=t-table[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[N];
for(int i=0; i<N; i++) cin>> a[i];
int b[N+1];
for(int i=0; i<N+1; i++){
if(i==0) b[i]=a[i]-M;
else if(i==N) b[i]=max(T-a[i-1]-M, 0);
else b[i]=max(a[i]-a[i-1]-2*M, 0);
}
int c=0;
for(int i=0; i<N+1; i++) c+=b[i];
cout<< c<< endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, T;
cin >> N >> M >> T;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int ans = T - M - min(M, T - A[A.size() - 1]);
for (int i = 1; i < N; i++) {
ans -= min(A[i] - A[i - 1], 2 * M);
}
cout << ans << endl;
}
|
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
int a[100];
for(int i = 0;i < n;i++){
cin >> a[i];
}
bool tcs[10000]; //time can study
memset(tcs,1,sizeof(tcs));
for(int i = 0;i < n;i++){
for(int j = a[i] - m;j < min(a[i] + m,t);j++){
tcs[j] = false;
}
}
int count = 0;
for(int i = 0;i < t;i++){
if(tcs[i]){
count++;
}
}
cout << count << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, t;
cin >> n >> m >> t;
vector<int> ok(2 * t + 1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j <= m; j++) {
if (a - j < 0) {
break;
}
ok[a - j] = 1;
}
for (int j = 0; j < m; j++) {
if (a + j >= t) {
break;
}
ok[a + j] = 1;
}
}
int ans = 0;
for (int i = 0; i < t; i++) {
ans += ok[i] == 0;
}
cout << ans << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;
int main() {
int N, M, T;
cin >> N >> M >> T;
vector<int> A(N);
int ans = 0, now = 0;
REP(i, N) {
int A;
cin >> A;
if (A - now >= M) {
ans += A - now - M;
}
now = A + M;
}
ans += max(0, T - now);
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double PI = 3.14159265358979;
const double E = 2.718281828459045;
const double root2 = sqrt(2);
typedef pair<int, int> P;
typedef unsigned int ui;
int main() {
int n, m, t; cin >> n >> m >> t;
int a;
int study[10002] = {};
for (int i = 0; i < n; i++) {
cin >> a;
study[a - m] += 1; study[min(a + m + 1,t+1)] -= 1;
}
for (int i = 1; i <= t + 1; i++) {
study[i] += study[i - 1];
}
int cnt = 0;
for (int i = 0; i < t; i++) {
if (study[i] == 0 || study[i + 1] == 0)cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define All(v) (v).begin(),(v).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF = 1010101010;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,M,T;
cin >> N >> M >> T;
int a[N+1];
for(int i=0;i<N;i++){
cin >> a[i];
}
a[N]=T;
int ans=a[0]-M+max(T-(a[N-1]+M),0);
for(int i=0;i<N-1;i++){
ans+=max(0,a[i+1]-M-(a[i]+M));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LLINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979
using namespace std;
typedef long long int ll;
typedef pair< long long int, long long int> P;
int main(void) {
int n, m, t;
int count = 0;
int a[101] = {};
cin >> n >> m >> t;
FOR(i, 1, n) {
cin >> a[i];
}
count += a[1] - m;
FOR(i, 2, n) {
if (a[i] - a[i - 1] <= 2 * m) {
}
else {
count += a[i] - a[i - 1] - 2 * m;
}
}
if (a[n] + m <= t) {
count += t - (a[n] + m);
}
cout << count << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int b[50000];
int main() {
int n, m, t; cin >> n >> m >> t;
rep(i, n) {
int h; cin >> h;
b[max(0, h - m)]++;
b[h + m]--;
}
int c = 0;
rep(i, t) {
if (i)b[i] += b[i - 1];
if (!b[i])c++;
}
cout << c << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define Rep(i,n) for(int i=0;i<(n);i++)
#define All(v) v.begin(),v.end()
#define Uniq(v) v.erase(unique(All(v)),v.end())
typedef pair<int, int> Pii;
typedef pair<int, Pii> Pip;
typedef pair<string, int> Psi;
const int INF = (1<<30);
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
int main()
{
int N, M, T;
int a[10001];
cin >> N >> M >> T;
Rep(i, N) cin >> a[i];
int ans = 0;
int now = 0; //今の時間
ans += a[0] - now - M;
now = a[0];
for(int i=1; i<N; i++) {
if( a[i] - now > M * 2 ) {
ans += a[i] - now - (M * 2);
now = a[i];
} else {
now = a[i];
}
}
ans += max(0, T - now - M);
cout << ans << endl;
} |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long int;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
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 (a>b) { a=b; return 1; } return 0; }
int main(){
ll n,m,t;
cin>>n>>m>>t;
V<ll> a(n+1);
a[0]=-m;
for(int i=1;i<=n;i++)cin>>a[i];
a.emplace_back(t+m);
ll ans=0;
for(int i=0;i<=n;i++){
if(a[i+1]-a[i]>=2*m)ans+=a[i+1]-a[i]-2*m;
}
cout<<ans<<"\n";
}
|
//
// main.cpp
// Delivery to a Luxurious House
//
// Created by x15071xx on 2017/06/19.
// Copyright ?? 2017??´ AIT. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char * argv[]) {
int n,m,t,taroSc[100000] = {0},time=0;
vector<int> cometime;
cin >> n >> m >> t;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
cometime.push_back(tmp);
}
for (int i = 0; i < n; i++) {
for (int j = cometime[i]-m; j < cometime[i]+m; j++) {
taroSc[j] = 1;
}
}
for (int i = 0; i < t; i++) {
if (taroSc[i] == 0) {
time++;
}
}
cout << time << endl;
return 0;
} |
#include <iostream>
#include <string>
#include <queue>
using namespace std;
int main(void){
bool time[10001];
queue<int> q;
int n,m,t;
int x;
cin>>n>>m>>t;
for(int i=0;i<=t;i++){
time[i]=true;
}
for(int i=0;i<n;i++){
cin>>x;
q.push(x);
}
for(int i=0;i<=t;i++){
if(q.front()+m<i)q.pop();
if(q.empty())break;
if(q.front()-m<i&&i<=q.front()+m){
time[i]=false;
}
}
int c=0;
for(int i=1;i<=t;i++){
if(time[i])c++;
// cout<<time[i]<<" ";
}
// cout<<endl;
cout<<c<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,t,a; cin >> n >> m >> t;
vector<int> can(t+1);
for(int i=0;i<n;++i) {
cin >> a;
can[a-m]++;
can[a+m<t?a+m:t]--;
}
int ans=0;
for(int i=1;i<t+1;++i) can[i]+=can[i-1];
for(int i=0;i<t;++i)
if(!can[i]) ans++;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int N,M,T;
int cnt=0,a,lt=0;
cin >> N >> M >> T;
for (int i=0;i<N;i++){
cin >> a;
if (lt<a-M){
cnt+=(a-M)-lt;
}
lt=a+M;
}
if (T>lt) cnt+=T-lt;
cout << cnt << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
int n, m, t;
int x;
cin >> n >> m >> t;
int b[10101] = {};
for (int i = 0; i < n; i++) {
cin >> x;
b[x-m]--;
if (x+m <= t) b[x+m]++;
}
int ans = 0;
if (b[0] == 0) ans++;
for (int i = 1; i < t; i++) {
b[i] += b[i-1];
if (b[i] == 0) ans++;
}
cout << ans << endl;
} |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int n, ans = 0,x,sum=0,a[10000];
int m, t;
cin >> n >> m >> t;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
a[n + 1] = t + m;
a[0] = -1 * m;
for (int i = 0; i <= n; i++) {
x = a[i + 1] - a[i];
if (x > m * 2)
sum = sum + (x - 2 * m);
}
cout << sum << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;cin>>n>>m>>t;
int a[n],i,ans=0;
for(i=0;i<n;i++) cin>>a[i];
ans+=a[0]-m;
for(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<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
int ans = 0;
int now_time = 0;
int a;
cin >> a;
if(m < a){
ans += a-m;
}
now_time = a;
for(int i=1; i<n; i++){
cin >> a;
int cost = now_time + 2*m;
if(cost < a){
ans += a - cost;
}
now_time = a;
}
ans += max(0, t - now_time - m);
cout << ans << 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 = A[0] - M;
for(int i = 1; i < N; i++) {
ret += max(A[i] - A[i - 1] - M * 2, 0);
}
ret += max(T - A[N - 1] - M, 0);
cout << ret << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define UNIQUE(o) (o).erase(unique(sort(all((o)))))
typedef long long ll;
const int N = 100;
const int T = 1e4;
int n, m, t;
int a[T+1];
int main() {
scanf("%d%d%d ", &n, &m, &t);
memset(a, 0, sizeof(a));
REP(i,n) {
int x;
scanf("%d ", &x);
FOR(j,x-m,x+m+1) if (j>=0 && j<=t) a[j] = 1;
}
int res = 0;
REP(i,t) if (!a[i] || !a[i+1]) res++;
printf("%d\n", res);
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<sstream>
#include<queue>
#include<deque>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#define INF 2147483647
#define lli long long int
#define MOD 1000000007
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
int main() {
int n,m,t; cin >> n >> m >> t;
vi a(n+2);
a[0] = 0;
a[n+1] = t;
int ans = 0;
for (int i = 1 ; i <= n; i++){
cin >> a[i];
}
if (a[1] - a[0] >= m){
ans += m;
}
for (int i = 1; i < n; i++){
if (a[i+1] - a[i] > 2*m){
ans += 2*m;
}else{
ans += a[i+1] - a[i];
}
}
if (a[n+1] - a[n] >= m){
ans += m;
}else{
ans += a[n+1] - a[n];
}
cout << t - ans << endl;
return 0;
} |
#include <iostream>
#define REP(i,n) for(int i=0; i<n; i++)
#define debug(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main(){
int n, m, t, a1, a2, a[101], used=0;
cin >> n >> m >> t;
used += m;
REP(i,n) cin >> a[i];
for (int i=0; i<n-1; i++){
used += min(a[i+1]-a[i], 2*m);
}
used += min(m, t-a[n-1]);
cout << t-used << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define T 100005
#define N 105
using namespace std;
int n,m,t,a[N],A[T],ans;
int main(){
cin>>n>>m>>t;
for(int i=0;i<n;i++){
cin>>a[i];
A[a[i]-m]++;
A[a[i]+m+1]--;
}
for(int i=1;i<=t;i++)
A[i]+=A[i-1];
int f=0;
for(int i=0;i<=t;i++){
if(!A[i])ans++;
else if(i&&f&&!A[i-1])ans++;
if(A[i])f=1;
}
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#define REP(i,a,b) for(int i=int(a);i<int(b);i++)
using namespace std;
typedef long long int lli;
int main () {
int N, M, T;
cin >> N >> M >> T;
vector<int> v(N);
REP (i, 0, N) cin >> v[i];
lli sum = v[0] - M;
REP (i, 0, N - 1) {
if (2 * M <= v[i + 1] - v[i]) {
sum += (v[i + 1] - v[i] - 2 * M);
}
}
if (v[N - 1] + M <= T) {
sum += (T - M - v[N - 1]);
}
cout << sum << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N,M,T;
cin>>N>>M>>T;
vector<int> V(N);
for(int i=0;i<N;i++){
cin>>V[i];
}
int ans = 0;
ans+=V[0]-M;
ans+=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<<endl;
return 0;
} |
#include<iostream>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
int main()
{
int N, M, T;
int a[101];
cin >> N >> M >> T;
REP(i, 0, N) cin >> a[i];
int ans = M;
REP(i, 1, N) {
if (a[i] - a[i - 1] >= (2 * M)) ans += (2 * M);
else ans += a[i] - a[i - 1];
}
if (T - a[N - 1] >= M) ans += M;
else ans += T - a[N - 1];
cout << T - ans << endl;
return 0;
} |
#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(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
const int N=20202;
int x[N]={};
int main()
{
int n,m,t;
cin >>n >>m >>t;
rep(i,n)
{
int a;
cin >>a;
++x[a-m];
--x[a+m];
}
rep(i,N-1) x[i+1]+=x[i];
int ans = 0;
rep(i,t) ans+=(x[i]==0);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<int(n);(i)++)
using namespace std;
int a[110];
int main(void){
int n,m,t;
cin >> n >> m >> t;
rep(i,n) cin >> a[i];
int ans=0;
ans+=max(a[0]-m,0);
rep(i,n-1) ans+=max(a[i+1]-a[i]-2*m,0);
ans+=max(t-a[n-1]-m,0);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
int main() {
int n, m, t; cin >> n >> m >> t;
int a[n]; rep(i, n) cin >> a[i];
int now = a[0];
int sum = max(0, a[0] - m);
rep3(i, 1, n) { //一旦帰るかそのままいとくか
if (2 * m <= a[i] - now) { //帰った方がいい
sum += a[i] - now - 2 * m;
}
now = a[i];
}
sum += max(0, t - now - m);
out(sum);
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long int i=0;i<n;++i)
typedef long long int ll;
int main(){
int n,m,t;
cin>> n >> m >> t;
vector<bool> a(t,true);
rep(i,n){
int te;
cin >> te;
a[te]=false;
for(int j=te+1;j<te+m&&j<t;j++){
a[j]=false;
}
for(int j=te-1;j>=te-m&&j>=0;j--){
a[j]=false;
}
}
int ans=0;
rep(i,t){
if(a[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> v(N);
for (auto& i : v) cin >> i;
int sum = 0;
for (int i = 0; i < N-1; i++) {
if (v[i+1]-v[i] > M*2) {
sum += v[i+1]-v[i]-2*M;
}
}
sum += (v[0] - M) + max(0, T - v[N-1] - M);
cout << sum << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N,M,T;
int main(){
cin>>N>>M>>T;
int last=-M;
int ans=0;
for(int i=0;i<N;i++){
int a;
cin>>a;
if( a-last >= M+M){
ans+=( (a-last)-M-M );
}
last=a;
}
if( last+M <= T){
ans+=( T-last-M);
}
cout<<ans<<endl;
return 0;
} |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 0
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
signed main() {
int n, m, t; cin >> n >> m >> t; vector<int>v(n); rep(i, 0, n)cin >> v[i];
int ans = 0, idx = 0;
dump(ans);
ans += v[0] - m;
dump(ans);
rep(i, 0, n - 1) {
ans += max(0, v[i + 1] - v[i] - 2 * m);
dump(ans);
}
ans += max(0, t - v[n - 1] - m);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
int main(void){
int n,m,t;
cin>>n>>m>>t;
vi d(t,1);
rep(i,n){
int p;cin>>p;
fill(d.begin()+(int)max(p-m,0),d.begin()+(int)min(p+m,t),0);
}
cout<<accumulate(all(d),0)<<endl;
} |
#include <stdio.h>
int main(void) {
int i, j, k, n, ans = 0, m, t, bef, a;
scanf("%d%d%d", &n, &m, &t);
bef = -m;
for(i = 0; i < n; ++i) {
scanf("%d", &a);
if(a - bef > 2 * m) ans += a - bef - 2 * m;
bef = a;
}
if(t - a > m) ans += t - a - m;
printf("%d\n", ans);
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int sum,a1,a2,n,m,t;
sum=0;
cin>>n>>m>>t;
cin>>a1;
sum=sum+a1-m;
for(int i=1;i<n;i++){
cin>>a2;
if(a2-a1>m*2)sum=sum+a2-a1-(m*2);
a1=a2;
}
if(t-a1-m>0)sum=sum+t-a1-m;
cout<<sum<<endl;
return 0;
} |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int main() {
int n, m, t;
cin >> n >> m >> t;
VI d(t);
REP(i,n){
int a;
cin >> a;
d[a-m]++;
if (a+m < t) d[a+m]--;
}
REP(i,t-1) d[i+1] += d[i];
int ans = 0;
REP(i,t) ans += (d[i] == 0);
cout << ans << endl;
return 0;
} |
#include <iostream>
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 cnt=a[0]-m;
for(int i=1;i<n;i++){
int diff=a[i]-a[i-1];
int study=diff-2*m;
if(study>0) cnt+=study;
}
int study=t-a[n-1]-m;
if(study>0) cnt+=study;
cout<<cnt<<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 ans = a[0] - M;
for(int i = 1; i < N; i++) {
if(a[i] - a[i-1] > 2 * M) {
ans += a[i] - a[i-1] - 2 * M;
}
}
if(T - a[N-1] > M) {
ans += T - a[N-1] - M;
}
cout << ans << endl;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m,t;
cin >> n >> m >> t;
vector<int>ti(t+1,0);
int a;
for(int i=0;i<n;i++){
cin >> a;
for(int j=0;j<=m;j++){
if(a+j<t+1)ti[a+j]=1;
ti[a-j]=1;
}
}
int co=0;
for(int i=1;i<ti.size();i++){
if(ti[i]==0||ti[i-1]==0)co++;
}
cout << co << endl;
return 0;
} |
#include<bits/stdc++.h>
#define T 20005
#define N 105
using namespace std;
int n,m,t,a[N],A[T],ans;
int main(){
cin>>n>>m>>t;
for(int i=0;i<n;i++){
cin>>a[i];
A[a[i]-m]++;
A[a[i]+m+1]--;
}
for(int i=1;i<=t;i++)
A[i]+=A[i-1];
int f=0;
for(int i=0;i<=t;i++){
if(!A[i])ans++;
else if(i&&f&&!A[i-1])ans++;
if(A[i])f=1;
}
cout<<ans<<endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
multiset<int> st;
vector<int> ans;
rep(k,n){
if(st.count(-a[k])==0){
st.insert(a[k]);
}else{
st.erase(st.find(-a[k]));
}
if(st.count(a[n-k-1])==0){
st.insert(-a[n-k-1]);
}else{
st.erase(st.find(a[n-k-1]));
}
if(st.size()==0)ans.pb(k);
}
rep(i,ans.size()){
if(i)cout<<" ";
cout<<ans[i]+1;
}
cout<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int N;
int main(){
cin>>N;
vector<int> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
}
map<int,int> L,R;
int count=0;
vector<int> ans;
for(int i=0;i<N;i++){
int lnum=a[i];
int rnum=a[N-1-i];
if( L[ lnum ] == R[ lnum ] ){
count++;
}
L[ lnum ]++;
if( L[ lnum ] == R[ lnum ] ){
count--;
}
if( L[ rnum ] == R[ rnum ] ){
count++;
}
R[ rnum ]++;
if( L[ rnum ] == R[ rnum ] ){
count--;
}
if( count == 0 ){
ans.push_back(i+1);
}
}
for(int i=0;i<(int)ans.size();i++){
if(i)cout<<' ';
cout<<ans[i];
}
cout<<endl;
return 0;
}
|
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <array>
#include <bitset>
#include <assert.h>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
int main() {
int n;
cin >> n;
VI a(n);
REP(i,n) a[i] = in();
map<int, int> mp;
int cnt = 0;
VI ans;
REP(i,n){
int x = a[i], y = a[n-1-i];
if (x != y){
if (mp[x] == 0) cnt++;
if (mp[x] == -1) cnt--;
mp[x]++;
if (mp[y] == 0) cnt++;
if (mp[y] == 1) cnt--;
mp[y]--;
}
if (cnt == 0) ans.push_back(i + 1);
}
REP(i,ans.size()){
if (i > 0) cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define ALL_OF(v) (v).begin(), (v).end()
int main() {
ll n; cin >> n;
vector<ll> a(n);
REP(i, n) cin >> a[i];
auto unq = a;
sort(ALL_OF(unq));
unq.erase(unique(ALL_OF(unq)), unq.end());
for (ll &x : a) x = lower_bound(ALL_OF(unq), x) - unq.begin();
ll diff = 0;
vector<ll> dp(n, 0), dq(n, 0);
vector<ll> ans;
REP(i, n) {
ll r = n-1-i;
if (a[i] == a[r]) {
int si = dp[a[i]] == dq[a[i]];
dp[a[i]]++;
dq[a[r]]++;
diff += (dp[a[i]] == dq[a[i]]) - si;
} else {
int si = dp[a[i]] == dq[a[i]];
int sr = dp[a[r]] == dq[a[r]];
dp[a[i]]++;
dq[a[r]]++;
diff += (dp[a[i]] == dq[a[i]]) - si;
diff += (dp[a[r]] == dq[a[r]]) - sr;
}
if (diff == 0) {
ans.push_back(i + 1);
}
}
REP(i, ans.size()) cout << ans[i] << " \n"[i+1==ans.size()];
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int main(){
int N;
cin >> N;
int nums[N];
for(int i = 0; i < N; i++){
cin >> nums[i];
}
int not_zero_count = 0;
map<int, int> nums_map;
string ans_string = "";
for(int i = 0; i < N; i++){
if(!nums_map[nums[i]]){
not_zero_count++;
}
nums_map[nums[i]]++;
if(!nums_map[nums[i]]){
not_zero_count--;
}
if(!nums_map[nums[N - i - 1]]){
not_zero_count++;
}
nums_map[nums[N - i - 1]]--;
if(!nums_map[nums[N - i - 1]]){
not_zero_count--;
}
if(!not_zero_count){
ans_string += to_string(i + 1) + " ";
}
}
ans_string.pop_back();
cout << ans_string << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
int main(){
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
map<int, int> mp1, mp2;
rep(i, N-1){
mp1[A[i]]++, mp2[A[N-i-1]]++;
if(mp1.count(A[N-i-1]) && mp2.count(A[N-i-1])){
mp1[A[N-i-1]]--, mp2[A[N-i-1]]--;
if(mp1[A[N-i-1]] == 0) mp1.erase(A[N-i-1]);
if(mp2[A[N-i-1]] == 0) mp2.erase(A[N-i-1]);
}
if(mp1.count(A[i]) && mp2.count(A[i])){
mp1[A[i]]--, mp2[A[i]]--;
if(mp1[A[i]] == 0) mp1.erase(A[i]);
if(mp2[A[i]] == 0) mp2.erase(A[i]);
}
if(mp1.empty() && mp2.empty()) cout << i+1 << ' ';
}
cout << N << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int N, A[100000];
map< int, int > latte, malta;
int diff;
int main() {
cin >> N;
for(int i = 0; i < N; i++) {
cin >> A[i];
}
bool first = false;
for(int i = 0; i < N; i++) {
int j = N - 1 - i;
if(malta[A[i]] == latte[A[i]]) ++diff;
latte[A[i]]++;
if(malta[A[i]] == latte[A[i]]) --diff;
if(malta[A[j]] == latte[A[j]]) ++diff;
malta[A[j]]++;
if(malta[A[j]] == latte[A[j]]) --diff;
if(diff == 0) {
if(first++) cout << " ";
cout << i + 1;
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)
#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}
template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}
using Pi = pair<int, int>;
using Tapris = tuple<int, int, int>;
using vint = vector<int>;
const int inf = 1LL << 55;
const int mod = 1e9 + 7;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
int cnt = 0;
vint ans;
map<int, int> mp;
rep(i, n) {
int j = n-1-i;
bool f = mp[a[i]] == 0;
mp[a[i]]++;
if(f) ++cnt;
else if(mp[a[i]] == 0) --cnt;
bool g = mp[a[j]] == 0;
mp[a[j]]--;
if(g) ++cnt;
else if(mp[a[j]] == 0) --cnt;
if(cnt == 0) ans.push_back(i);
//cout<<i<<" "<<cnt<<endl;
}
int sz = ans.size();
rep(i, sz) cout << ans[i]+1 << " \n"[i==sz-1];
return 0;
}
|
/* -*- coding: utf-8 -*-
*
* 2876.cc: Anagram
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
/* constant */
const int MAX_N = 100000;
const int P = 4073;
const int MOD = 1000000009;
/* typedef */
typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;
/* global variables */
int eps[MAX_N], ieps[MAX_N];
int as[MAX_N], bs[MAX_N];
int ks[MAX_N];
/* subroutines */
int powmod(int a, int b) {
int p = 1;
while (b) {
if (b & 1) p = (ll)p * a % MOD;
a = (ll)a * a % MOD;
b >>= 1;
}
return p;
}
/* main */
int main() {
int ip = powmod(P, MOD - 2);
eps[0] = ieps[0] = 1;
for (int i = 1; i < MAX_N; i++) {
eps[i] = (ll)eps[i - 1] * P % MOD;
ieps[i] = (ll)ieps[i - 1] * ip % MOD;
}
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", as + i), bs[i] = as[i];
sort(bs, bs + n);
int m = unique(bs, bs + n) - bs;
int kn = 0, rh0 = 0, rh1 = 0;
for (int k = 0; k < n; k++) {
int i0 = lower_bound(bs, bs + m, as[k]) - bs;
int i1 = lower_bound(bs, bs + m, as[n - 1 - k]) - bs;
rh0 = (rh0 + (ll)i0 * eps[i0] % MOD) % MOD;
rh1 = (rh1 + (ll)i1 * eps[i1] % MOD) % MOD;
//printf("%d: rh0=%d, rh1=%d\n", k, rh0, rh1);
if (rh0 == rh1) ks[kn++] = k;
}
for (int i = 0; i < kn; i++) {
if (i) putchar(' ');
printf("%d", ks[i] + 1);
}
putchar('\n');
return 0;
}
|
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
map<int, int> cnt;
vector<int> answer;
REP(i,n) {
if((cnt.find(a[i])!=cnt.end()) && cnt[a[i]]==-1) cnt.erase(a[i]);
else ++cnt[a[i]];
if((cnt.find(a[n-1-i])!=cnt.end()) && cnt[a[n-1-i]]==1) cnt.erase(a[n-1-i]);
else --cnt[a[n-1-i]];
if(cnt.empty()) answer.push_back(i+1);
}
REP(i,(int)answer.size()) {
if(i) cout << ' ';
cout << answer[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector< int > a(N);
for (int i=0; i<N; ++i) cin >> a[i];
int L = 0, R = N-1, sum = 0;
map< int, int > cnt;
vector< int > ans;
while (L < N) {
if (a[L] != a[R]) {
if (cnt[a[R]] == 0) ++sum;
if (cnt[a[L]] == 0) ++sum;
if (cnt[a[R]] == -1) --sum;
if (cnt[a[L]] == 1) --sum;
++cnt[a[R]];
--cnt[a[L]];
}
if (sum == 0) ans.push_back(L+1);
++L;
--R;
}
int m = ans.size();
for (int i=0; i<m; ++i) cout << ans[i] << (i<m-1? " " : "\n");
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int n;
map<int, int> mp;
int geti(int num) {
if (!mp.count(num)) {
int temp = mp.size();
mp[num] = temp;
return temp;
}
return mp[num];
}
int main() {
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = geti(a[i]);
}
vector<int> ans;
vector<int> cou(mp.size() + 1000, 0);
int kind = 0;
for (int i = 0; i < n; i++) {
{
if (cou[a[i]] == 0) {
kind++;
}
cou[a[i]]++;
if (cou[a[i]] == 0) {
kind--;
}
}
{
if (cou[a[n - i - 1]] == 0) {
kind++;
}
cou[a[n - i - 1]]--;
if (cou[a[n - i - 1]] == 0) {
kind--;
}
}
if (kind == 0) {
ans.push_back(i + 1);
}
}
if (ans.size() > 0) {
cout << ans[0];
for (int i = 1; i < ans.size(); i++) {
cout << " " << ans[i];
}
cout << endl;
}
}
|
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
signed main() {
int N; cin >> N;
vector<int> vec(N);
for(int i=0; i<N; i++) {
cin >> vec[i];
}
map<int, int> pre, suf;
vector<int> ans;
for(int i=0; i<N; i++) {
int lidx = i, ridx = N - 1 - i;
pre[ vec[lidx] ]++;
suf[ vec[ridx] ]++;
if(pre == suf) {
ans.push_back(i+1);
}
}
for(size_t i=0; i<ans.size(); i++) {
printf("%lld%c", ans[i], (i+1==ans.size() ? '\n' : ' '));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,i;scanf("%d",&N);
int a[N];
map<int,int> ml,mr;
for(i=0;i<N;i++) scanf("%d",&a[i]);
int ng = 0;vector<int> ans;
for(i=0;i<N;i++){
ml[a[i]]++;
if(ml[a[i]] == mr[a[i]]) ng--;
else if(ml[a[i]]-1 == mr[a[i]]) ng++;
mr[a[N-i-1]]++;
if(ml[a[N-i-1]] == mr[a[N-i-1]]) ng--;
else if(ml[a[N-i-1]] == mr[a[N-i-1]]-1) ng++;
if(ng == 0) ans.push_back(i+1);
}
for(i=0;i<ans.size()-1;i++) printf("%d ",ans[i]);
printf("%d\n",ans.back());
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T> constexpr T inf;
template <> constexpr int inf<int> = 1e9;
template <> constexpr ll inf<ll> = 1e18;
template <> constexpr double inf<double> = 1e18;
int main() {
int N;
cin >> N;
vector<int> a(N), xs;
for(int i = 0; i < N; ++i) {
cin >> a[i];
xs.push_back(a[i]);
}
sort(begin(xs), end(xs));
xs.erase(unique(begin(xs), end(xs)), end(xs));
for(int i = 0; i < N; ++i) {
a[i] = lower_bound(begin(xs), end(xs), a[i]) - begin(xs);
}
const int m = xs.size();
int incorrect = 0;
vector<int> cnt1(m), cnt2(m);
vector<int> ans;
for(int i = 0; i < N; ++i) {
if(cnt1[a[i]] + 1 == cnt2[a[i]]) {
incorrect -= 1;
} else if(cnt1[a[i]] == cnt2[a[i]]) {
incorrect += 1;
}
cnt1[a[i]] += 1;
if(cnt2[a[N - i - 1]] + 1 == cnt1[a[N - i - 1]]) {
incorrect -= 1;
} else if(cnt1[a[N - i - 1]] == cnt2[a[N - i - 1]]) {
incorrect += 1;
}
cnt2[a[N - i - 1]] += 1;
if(incorrect == 0) {
ans.push_back(i + 1);
}
}
for(int i = 0; i < (int)ans.size(); ++i) {
cout << ans[i] << " \n"[i + 1 == (int)ans.size()];
}
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
using namespace std;
template<typename Monoid> class SegTree {
using T = typename Monoid::value_type;
Monoid m;
std::vector<T> tree; // 1-indexed
int size = 1;
public:
SegTree(const int n = 0) {
while (size < n) size *= 2;
tree.assign(size * 2, m.id());
}
SegTree(const int n, const T &x) {
while (size < n) size *= 2;
tree.assign(size * 2, x);
for (int i = size - 1; i >= 1; i--) tree[i] = m(tree[i * 2], tree[i * 2 + 1]);
}
T fold(int l, int r) { // [l, r)
T accl = m.id(), accr = m.id();
for (l += size, r += size; l < r; l /= 2, r /= 2) {
if (l & 1) accl = m(accl, tree[l++]);
if (r & 1) accr = m(tree[--r], accr);
}
return m(accl, accr);
}
void update(int i, const T &x) {
tree[i += size] = x;
while (i /= 2) tree[i] = m(tree[i * 2], tree[i * 2 + 1]);
}
const T &operator[](int i) const { return tree[i + size]; }
};
template<typename T = bool> struct anyMonoid {
using value_type = T;
constexpr value_type id() { return false; }
constexpr value_type operator()(const value_type &a, const value_type &b) { return a | b; }
};
std::vector<int> compressByOrd(const std::vector<int> &v) {
size_t n = v.size();
int k = 0;
std::map<int, int> m;
std::vector<int> w(v.begin(), v.end());
std::sort(w.begin(), w.end());
rep(i, n) if (!m.count(w[i])) m[w[i]] = k++;
rep(i, n) w[i] = m[v[i]];
return w;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) cin >> x;
vector<int> b = compressByOrd(a);
vector<int> ans;
ans.reserve(n);
SegTree<anyMonoid<int>> st(n);
rep(i, n) {
st.update(b[i], st[b[i]] + 1);
st.update(b[n - 1 - i], st[b[n - 1 - i]] - 1);
if (st.fold(0, n) == 0) ans.emplace_back(i + 1);
}
int m = static_cast<int>(ans.size());
rep(i, m) cout << ans[i] << " \n"[i == m - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin>>n;
vector<int> a(n);
for(int i = 0;i < n;++i) {
cin>>a[i];
}
map<int,int> mp;
set<int> cnt;
vector<int> ans;
for(int i = 0;i < n;++i) {
mp[a[i]]++;
if(mp[a[i]]==1)cnt.insert(a[i]);
if(mp[a[i]]==0)cnt.erase(a[i]);
mp[a[n-1-i]]--;
if(mp[a[n-1-i]]==0)cnt.erase(a[n-1-i]);
if(mp[a[n-1-i]]==-1)cnt.insert(a[n-1-i]);
if(cnt.size()==0)ans.emplace_back(i+1);
}
for(int i = 0;i < ans.size()-1;++i) {
cout<<ans[i]<<" ";
}
cout<<n<<endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day1/problems/C>
問題文============================================================
長さ N の数列 ai が与えられる。 次の条件を満たす整数 K(1≤K≤N) を全て出力せよ。
条件: a1,⋯,aK をうまく並び替えると aN−K+1,⋯,aN と一致する。
=================================================================
解説=============================================================
Kを大きくしていくにつれて、mapなどで、左から見て行った時、右から見て行った時の
要素が出現した個数を保持して、条件を満たすか判定していく
================================================================
*/
void solve(){
ll N; cin >> N;
vector<ll> a(N); for(auto& in:a) cin >> in;
map<ll,ll> mp1,mp2;
vector<ll> ans;
for(int i = 1; i <= N;i++){
mp1[a[i-1]]++;
mp2[a[N-i]]++;
[&]{
for(auto it:mp1){
if(it.second == mp2[it.first]) continue;
return;
}
ans.push_back(i);
}();
}
cout << ans << endl;
}
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>
using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
template<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}
template<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
/* do your best */
int main() {
int n; cin >> n;
vector<int> a(n);
set<int> st;
for (int i = 0; i < n; i++) {
cin >> a[i];
st.insert(a[i]);
}
map<int, int> zip;
int val = 0;
for (auto x : st) {
zip[x] = val;
val++;
}
for (int i = 0; i < n; i++) {
a[i] = zip[a[i]];
}
int minus = 0;
int plus = 0;
vector<int> ans;
vector<int> cnt(n + 2, 0);
for (int k = 0; k < n; k++) {
cnt[a[k]]++;
if (cnt[a[k]] == 0) {
minus--;
} else if (cnt[a[k]] == 1) {
plus++;
}
cnt[a[n - k - 1]]--;
if (cnt[a[n - k - 1]] == 0) {
plus--;
} else if (cnt[a[n - k - 1]] == -1) {
minus++;
}
if (plus == 0 and minus == 0) {
ans.push_back(k + 1);
}
}
for (size_t i = 0; i < ans.size(); i++) {
if (i + 1 == ans.size()) cout << ans[i] << endl;
else cout << ans[i] << " ";
}
return 0;
}
|
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <map>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main(){
ll n; cin >> n;
ll a[n]; REP(i,n) cin >> a[i];
map<ll,ll> mp;
vector<ll> ans;
REP(i,n){
mp[a[i]]++ , mp[a[n-1-i]]--;
if(mp[a[i]]==0) mp.erase(a[i]);
if(mp[a[n-1-i]]==0) mp.erase(a[n-1-i]);
if(mp.empty()) ans.push_back(i+1);
}
for(auto v: ans){
cout << v ;
if(v!=ans.back()) cout << " ";
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n;
while (cin >> n) {
map<int, int> cnt;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans;
rep(i, n) {
int l = a[i], r = a[n - i - 1];
cnt[l]++;
cnt[r]--;
if (cnt[l] == 0) cnt.erase(l);
if (cnt[r] == 0) cnt.erase(r);
if (cnt.size() == 0) {
ans.push_back(i);
}
}
rep(i, ans.size()) {
cout << ans[i] + 1;
if (i + 1 == ans.size()) {
cout << endl;
} else {
cout << ' ';
}
}
}
}
|
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<P> vp;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[200010],dp[550][550];
int main(){
cin >> n;
vi vec;
map<ll,ll> test;
rep(i,0,n)cin >> d[i];
rep(i,0,n){
test[d[i]]++;
test[d[n-1-i]]--;
if(test[d[i]] == 0)test.erase(d[i]);
//cout << "i:" << test.size() << endl;
if(test[d[n-1-i]] == 0)test.erase(d[n-1-i]);
//cout << "j:" << test.size() << endl << endl;
if(test.empty())vec.pb(i);
}
sort(all(vec));
rep(i,0,vec.sz){
cout << vec[i] + 1;
if(i == vec.sz-1)break;
cout <<" ";
}
cout << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.