Submission #1835268
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> mat; #define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++) #define rep(i,n) FOR(i,0,n) #define ALL(x) (x).begin(),(x).end() #define RALL(x) (x).rbegin(),(x).rend() #define mset(a,x) memset(a,x,sizeof(a)) #define FASTIO cin.tie(0),ios::sync_with_stdio(0) int main() { int n, k; cin >> n >> k; static int a[300000] = {0}; rep(i, n) scanf("%d", a + i); static int sum[300010] = {0}; rep(i, n - 1) { sum[i + 1] += sum[i] + (a[i] < a[i + 1]); } int ans = 0; rep(i, n - k + 1) ans += (sum[k - 1 + i] - sum[i]) == k - 1; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 解像度が低い。 |
User | fushime2 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 744 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 2560 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] rep(i, n) scanf("%d", a + i); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | decr2_1.txt, decr2_2.txt, decr_1.txt, decr_2.txt, incr2_1.txt, incr2_2.txt, incr2_3.txt, incr_1.txt, incr_2.txt, incr_3.txt, incr_4.txt, incr_5.txt, ins_1.txt, ins_2.txt, ins_3.txt, ins_4.txt, ins_5.txt, ins_6.txt, ins_7.txt, ins_8.txt, ins_9.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
decr2_1.txt | AC | 4 ms | 512 KB |
decr2_2.txt | AC | 4 ms | 512 KB |
decr_1.txt | AC | 4 ms | 512 KB |
decr_2.txt | AC | 4 ms | 512 KB |
incr2_1.txt | AC | 12 ms | 1024 KB |
incr2_2.txt | AC | 11 ms | 1024 KB |
incr2_3.txt | AC | 12 ms | 1024 KB |
incr_1.txt | AC | 32 ms | 2560 KB |
incr_2.txt | AC | 11 ms | 1024 KB |
incr_3.txt | AC | 32 ms | 2560 KB |
incr_4.txt | AC | 32 ms | 2560 KB |
incr_5.txt | AC | 32 ms | 2560 KB |
ins_1.txt | AC | 32 ms | 2560 KB |
ins_2.txt | AC | 32 ms | 2560 KB |
ins_3.txt | AC | 32 ms | 2560 KB |
ins_4.txt | AC | 32 ms | 2560 KB |
ins_5.txt | AC | 32 ms | 2560 KB |
ins_6.txt | AC | 32 ms | 2560 KB |
ins_7.txt | AC | 33 ms | 2560 KB |
ins_8.txt | AC | 32 ms | 2560 KB |
ins_9.txt | AC | 33 ms | 2560 KB |
random_1.txt | AC | 33 ms | 2560 KB |
random_2.txt | AC | 26 ms | 2560 KB |
random_3.txt | AC | 33 ms | 2560 KB |
random_4.txt | AC | 33 ms | 2560 KB |
random_5.txt | AC | 33 ms | 2560 KB |
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
sample_4.txt | AC | 1 ms | 256 KB |