# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
141074 | 2019-08-06T14:36:04 Z | 44442 | Rasvjeta (COCI17_rasvjeta) | C++11 | 3 ms | 484 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++){ 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) ok++; printf("%d",ok); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 484 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 | Incorrect | 2 ms | 376 KB | Output isn't correct |
6 | Incorrect | 2 ms | 376 KB | Output isn't correct |
7 | Correct | 3 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 | 376 KB | Output isn't correct |