# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
97890 | 2019-02-19T10:38:04 Z | AKaan37 | Rasvjeta (COCI17_rasvjeta) | C++17 | 3 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; typedef long long int lo; typedef pair< int,int > PII; #define fi first #define se second #define mp make_pair #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(lo i=1;i<=n;i++) const int inf = 1000000000; const int mod = 1000000007; const int KOK = 100000; const int li = 10000005; const int LOG = 20; lo n,m,cev,x,k,PS[li],cevap; vector<int> v; char c; string s; int main(){ scanf("%lld %lld %lld",&n,&m,&k); PS[0]=0; for(lo i=1;i<=m;i++){ scanf("%lld",&x); PS[max(x-k,1ll)]++; PS[min(x+k+1,n+1)]--; } FOR{ PS[i]=PS[i-1]+PS[i]; } FOR{ lo cevv=PS[i]; if(cevv<=0){cev++;} else if(k!=0){cevap+=cev/(k*2+1)+(cev%(k*2+1)==0?0:1);cev=0;} else{cevap+=cev;cev=0;} } if(k!=0) cevap+=cev/(k*2+1)+(cev%(k*2+1)==0?0:1); else cevap+=cev; printf("%lld",cevap); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 3 ms | 384 KB | Output is correct |
6 | Correct | 3 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 384 KB | Output is correct |
8 | Correct | 3 ms | 384 KB | Output is correct |
9 | Correct | 3 ms | 256 KB | Output is correct |
10 | Correct | 3 ms | 384 KB | Output is correct |