oj.uz

답안 #141081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
141081 2019-08-06T15:34:50 Z 44442 Rasvjeta (COCI17_rasvjeta) C++11
10 / 50
 3 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m,k,a[1004],ok;
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])/(2*k+1);
	 }
	 if(n-a[m-1]>k)
	     ok++;
	     ok=ok+(n-k-1-a[m-1])/(2*k+1);
	 if(a[0]>k)
	     ok++;
	     ok=ok+(a[0]-k-1)/(2*k+1);
	 printf("%d",ok);
return 0;
}

Compilation message

rasjveta.cpp: In function 'int main()':
rasjveta.cpp:12:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if(n-a[m-1]>k)
   ^~
rasjveta.cpp:14:7: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
       ok=ok+(n-k-1-a[m-1])/(2*k+1);
       ^~
rasjveta.cpp:15:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if(a[0]>k)
   ^~
rasjveta.cpp:17:7: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
       ok=ok+(a[0]-k-1)/(2*k+1);
       ^~
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
10.0 / 50.0

# 결과 실행 시간 메모리 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 3 ms 276 KB Output isn't correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 376 KB Output isn't correct