# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
240930 | 2020-06-21T14:07:36 Z | SamAnd | Telefoni (COCI17_telefoni) | C++17 | 33 ms | 2048 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 300005; int n, d; int a[N]; void solv() { scanf("%d%d", &n, &d); for (int i = 1; i <= n; ++i) { scanf("%d", &a[i]); } int ans = 0; int u; for (int i = 1; i <= n; ++i) { if (a[i] == 1) { u = i; continue; } else { if (i - u == d) { ++ans; u = i; } } } printf("%d\n", ans); } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 512 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 5 ms | 384 KB | Output is correct |
7 | Correct | 5 ms | 384 KB | Output is correct |
8 | Correct | 31 ms | 2048 KB | Output is correct |
9 | Correct | 32 ms | 2040 KB | Output is correct |
10 | Correct | 33 ms | 2044 KB | Output is correct |