Submission #1242849
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main() { int n, a[100010]; cin >> n; for (int i = 0; i < n; i++) scanf("%d", &a[i]); int l = 0, r = 0; long long ans = 0; while (l < n) { while (a[r] < a[r + 1]) r++; ans += r - l + 1; if (l++ == r) r = l; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 単調増加 |
User | legosuke |
Language | C++14 (GCC 5.4.1) |
Score | 40 |
Code Size | 388 Byte |
Status | WA |
Exec Time | 11 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Sample | Subtask0 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 0 / 60 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample0.txt, sample1.txt, sample2.txt, sample3.txt |
Subtask0 | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
All | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample0.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_10.txt | AC | 1 ms | 256 KB |
subtask0_11.txt | AC | 1 ms | 256 KB |
subtask0_12.txt | AC | 1 ms | 256 KB |
subtask0_13.txt | AC | 1 ms | 256 KB |
subtask0_14.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask0_3.txt | AC | 1 ms | 256 KB |
subtask0_4.txt | AC | 1 ms | 256 KB |
subtask0_5.txt | AC | 1 ms | 256 KB |
subtask0_6.txt | AC | 1 ms | 256 KB |
subtask0_7.txt | AC | 1 ms | 256 KB |
subtask0_8.txt | AC | 1 ms | 256 KB |
subtask0_9.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 9 ms | 512 KB |
subtask1_1.txt | AC | 5 ms | 384 KB |
subtask1_10.txt | AC | 11 ms | 640 KB |
subtask1_11.txt | WA | 11 ms | 640 KB |
subtask1_12.txt | WA | 11 ms | 640 KB |
subtask1_13.txt | WA | 11 ms | 640 KB |
subtask1_14.txt | WA | 11 ms | 640 KB |
subtask1_15.txt | WA | 11 ms | 640 KB |
subtask1_2.txt | AC | 4 ms | 384 KB |
subtask1_3.txt | AC | 7 ms | 512 KB |
subtask1_4.txt | AC | 9 ms | 512 KB |
subtask1_5.txt | AC | 8 ms | 512 KB |
subtask1_6.txt | AC | 5 ms | 384 KB |
subtask1_7.txt | AC | 10 ms | 640 KB |
subtask1_8.txt | AC | 3 ms | 384 KB |
subtask1_9.txt | AC | 2 ms | 256 KB |