oj.uz

답안 #104130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104130 2019-04-04T07:37:07 Z Fasho Rasvjeta (COCI17_rasvjeta) C++14
50 / 50
 3 ms 512 KB 
#include <bits/stdc++.h>
#define N 1000005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("myfile.in","r",stdin);freopen ("myfile.out","w",stdout);
#define mod 1000000007
#define fs(x,y) for(int i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(int i=x;i<=y;i++)
using namespace std;

ll n,m,ar[N],sum,k,tut[N],mark[N];


int main()
{
	fast;
	cin>>n>>m>>k;
	fs(ar,m);
	sort(ar+1,ar+1+m);

	for(int i=1;i<=m;i++)
		for(int j=max(ar[i]-k,1ll);j<=ar[i]+k && j<=n;j++)
			mark[j]=1;
	ll last=INT_MIN;
	// fo(i,1,n)
	// 	cout<<mark[i]<<sp;
	// 	cout<<endl;
	for(int i=1;i<=n;i++)
	{
		if(i-last>k*2 && !mark[i])
			last=i,sum++;
	}
	cout<<sum;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct