oj.uz

Submission #141357

# Submission time Handle Problem Language Result Execution time Memory
141357 2019-08-07T13:52:26 Z 44442 Rasvjeta (COCI17_rasvjeta) C++11
25 / 50
 2 ms 380 KB 
#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++){
     	 if(a[i]-a[i-1]>2*k+1)
		     ok=ok+(a[i]-a[i-1])/(2*k+1);
	 }
	 if(n-a[m-1]>k or a[m-1]==0){
	 	 b=a[m-1]+2*k+1;
	 	 if(!a[m-1]) 
	 	     b=k+1;
	 	 while(b<n+k+1){
	         ok++;
			 b=b+2*k+1;
         }
	 }
	 if(a[0]>k+1){
	 	 c=a[0]-2*k-1;
	 	 while(c>-k){
	         ok++;
	         c=c-2*k-1;
	     }
	 }
	 printf("%d",ok);
return 0;
}

Compilation message

rasjveta.cpp: In function 'int main()':
rasjveta.cpp:6:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d\n%d\n%d",&n,&m,&k);
      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
rasjveta.cpp:8:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
          scanf("\n%d",&a[i]);
          ~~~~~^~~~~~~~~~~~~~

Subtask #1
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 380 KB Output isn't correct