| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 141383 | 44442 | Rasvjeta (COCI17_rasvjeta) | C++11 | 2 ms | 504 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,m,k,a[1004],ok,b,c;
int main (){
ios::sync_with_stdio(0);
     scanf("%d\n%d\n%d",&n,&m,&k);
     for(int i=0;i<m;i++)
         scanf("\n%d",&a[i]);
     for(int i=1;i<m;i++){
		     ok=ok+(a[i]-a[i-1]-1)/(2*k+1);
	 }
	 if(n-a[m-1]>k){
	 	 b=a[m-1]+k+1;
	 	 while(b<n+1){
	         ok++;
			 b=b+2*k+1;
         }
	 }
	 if(a[0]>k+1){
	 	 c=a[0]-k-1;
	 	 while(c>-1){
	         ok++;
	         c=c-2*k-1;
	     }
	 }
	 printf("%d",ok);
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
