# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
86320 | 2018-11-26T07:14:19 Z | MaHaMBa_25 | Telefoni (COCI17_telefoni) | C++14 | 3 ms | 668 KB |
#include <bits/stdc++.h> #define GLHF ios_base::sync_with_stdio(0); cin.tie(), cout.tie(); #define GGWP return 0; #define ALTF4 exit(0) #define GCWS/*Good Contest, Well Solved*/ ALTF4 #define ull unsigned long long #define ll long long #define ld long double #define fxr1(x) for(int I = 0; I < x; ++I) #define fxr(x) for(int I = 0; I <= x; ++I) using namespace std; int n, d, ans; bool a[21]; int main() { GLHF cin >> n >> d; for ( int I = 0; I < n; ++I ) cin >> a[I]; for ( int I = 0; I < n; ++I ) { int cnt = 1; for ( int J = d; J > 0; --J ) { if ( a[J + I] == 1 ) I = J + I; else if ( J < 2 ) { ++ans; I = I + d; } } } cout << ans << endl; GGWP } //clang++ -v -std=c++11 finish fishing the fish.people
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Incorrect | 2 ms | 512 KB | Output isn't correct |
3 | Correct | 3 ms | 512 KB | Output is correct |
4 | Correct | 2 ms | 512 KB | Output is correct |
5 | Correct | 2 ms | 540 KB | Output is correct |
6 | Incorrect | 2 ms | 540 KB | Output isn't correct |
7 | Incorrect | 2 ms | 540 KB | Output isn't correct |
8 | Incorrect | 2 ms | 552 KB | Output isn't correct |
9 | Incorrect | 2 ms | 608 KB | Output isn't correct |
10 | Incorrect | 2 ms | 668 KB | Output isn't correct |