Submission #1037075

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1037075	2024-07-28 02:50:15	fryingduc	Binaria (CCO23_day1problem1)	C++17	25 / 25	171 ms	22356 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bits/stdc++.h"
using namespace std;
const int maxn = 1e6 + 6;
const int mod = 1e6 + 3;
int n, k;
int a[maxn], force[maxn];
bool check[maxn];
int fact[maxn], inv[maxn];
int power(int a, int b) {
    if(b == 0) return 1;
    int ans = power(a, b / 2);
    ans = (1ll * ans * ans % mod);
    if(b & 1) return 1ll * ans * a % mod;
    return ans;
}
int C(int n, int k) {
    if(k > n) return 0;
    return 1ll * fact[n] * inv[n - k] % mod * inv[k] % mod;
}
void solve() {
    cin >> n >> k;
    for(int i = 1; i <= n - k + 1; ++i) {
        cin >> a[i];
    }
    fill(force, force + n + 1, -1);
    for(int i = 2, j = k + 1; i <= n - k + 1; ++i, ++j) {
        if(a[i] > a[i - 1]) {
            force[j] = 1, force[j - k] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 7 / 7