Submission #2124196
Source Code Expand
import std.stdio, std.string, std.conv; import std.range, std.algorithm, std.array; void main() { int n = readln.chomp.to!int; auto a = readln.split.to!(int[]); long ans; for (int l, r; l < n; l++) { for (; r < n; r++) { if (l < r && a[r-1] >= a[r]) { break; } } ans += r - l; } writeln(ans); } void scan(T...)(ref T args) { import std.stdio : readln; import std.algorithm : splitter; import std.conv : to; import std.range.primitives; auto line = readln().splitter(); foreach (ref arg; args) { arg = line.front.to!(typeof(arg)); line.popFront(); } assert(line.empty); } void fillAll(R, T)(ref R arr, T value) { static if (is(typeof(arr[] = value))) { arr[] = value; } else { foreach (ref e; arr) { fillAll(e, value); } } }
Submission Info
Submission Time | |
---|---|
Task | C - 単調増加 |
User | nanae |
Language | D (DMD64 v2.070.1) |
Score | 100 |
Code Size | 976 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 4284 KB |
Judge Result
Set Name | Sample | Subtask0 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 60 / 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 | 380 KB |
subtask0_1.txt | AC | 1 ms | 380 KB |
subtask0_10.txt | AC | 1 ms | 380 KB |
subtask0_11.txt | AC | 1 ms | 380 KB |
subtask0_12.txt | AC | 2 ms | 380 KB |
subtask0_13.txt | AC | 1 ms | 380 KB |
subtask0_14.txt | AC | 1 ms | 380 KB |
subtask0_2.txt | AC | 1 ms | 324 KB |
subtask0_3.txt | AC | 1 ms | 380 KB |
subtask0_4.txt | AC | 1 ms | 380 KB |
subtask0_5.txt | AC | 1 ms | 256 KB |
subtask0_6.txt | AC | 1 ms | 256 KB |
subtask0_7.txt | AC | 1 ms | 380 KB |
subtask0_8.txt | AC | 1 ms | 256 KB |
subtask0_9.txt | AC | 1 ms | 380 KB |
subtask1_0.txt | AC | 15 ms | 4244 KB |
subtask1_1.txt | AC | 7 ms | 1404 KB |
subtask1_10.txt | AC | 17 ms | 3452 KB |
subtask1_11.txt | AC | 17 ms | 3452 KB |
subtask1_12.txt | AC | 17 ms | 4284 KB |
subtask1_13.txt | AC | 17 ms | 3388 KB |
subtask1_14.txt | AC | 17 ms | 3324 KB |
subtask1_15.txt | AC | 17 ms | 4284 KB |
subtask1_2.txt | AC | 6 ms | 2556 KB |
subtask1_3.txt | AC | 12 ms | 3716 KB |
subtask1_4.txt | AC | 13 ms | 3660 KB |
subtask1_5.txt | AC | 13 ms | 3936 KB |
subtask1_6.txt | AC | 8 ms | 1532 KB |
subtask1_7.txt | AC | 16 ms | 3696 KB |
subtask1_8.txt | AC | 5 ms | 1020 KB |
subtask1_9.txt | AC | 3 ms | 2684 KB |