oj.uz

답안 #648509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648509 2022-10-06T18:47:04 Z inksamurai Rasvjeta (COCI17_rasvjeta) C++17
45 / 50
 1 ms 312 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3Rz7lEu ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

const int mod=1000000007;

signed main(){
_3Rz7lEu;
	int n,m,k;
	cin>>n>>m>>k;
	vi usd(n+1,0);
	rep(i,m){
		int v;
		cin>>v;
		for(int j=max(0,v-k);j<=min(v+k,n);j++)usd[j]=1;
	}
	int _lst=-1,ans=0;
	for(int i=1;i<=n;i++){
		if(usd[i]){
			if(_lst!=-1) ans+=1;
			_lst=-1;
		}else{
			// print(_lst,i);
			if(_lst!=-1){
				if(i-_lst>=k){
					ans+=1;
					_lst=-1;
					for(int j=max(0,i-k);j<=min(i+k,n);j++)usd[j]=1;
				}
			}else{
				_lst=i;
			}
		}
	}
	// print(_lst);
	if(_lst!=-1)ans+=1;
	print(ans);
}

Subtask #1
45.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 232 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Incorrect 1 ms 212 KB Output isn't correct