Submission #1799014
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long LL; int main(){ int N; cin >> N; int a[N]; for(int i=0;i<N;i++){ cin >> a[i]; } int dp[N]; fill(dp,dp+N,0); int count=0; for(int i=0;i<N;i++){ if(i==0){ dp[i]=1; count++; } else if(a[i-1]<a[i]){ dp[i]=dp[i-1]+count+1; count++; } else{ dp[i]=dp[i-1]+1; count=1; } } cout << dp[N-1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 単調増加 |
User | Yukly |
Language | C++14 (GCC 5.4.1) |
Score | 40 |
Code Size | 569 Byte |
Status | WA |
Exec Time | 37 ms |
Memory | 1152 KB |
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 | 2 ms | 256 KB |
subtask0_1.txt | AC | 2 ms | 256 KB |
subtask0_10.txt | AC | 2 ms | 256 KB |
subtask0_11.txt | AC | 2 ms | 256 KB |
subtask0_12.txt | AC | 2 ms | 256 KB |
subtask0_13.txt | AC | 2 ms | 256 KB |
subtask0_14.txt | AC | 2 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask0_3.txt | AC | 1 ms | 256 KB |
subtask0_4.txt | AC | 2 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 | 2 ms | 256 KB |
subtask1_0.txt | AC | 31 ms | 896 KB |
subtask1_1.txt | AC | 13 ms | 512 KB |
subtask1_10.txt | AC | 37 ms | 1024 KB |
subtask1_11.txt | WA | 36 ms | 1152 KB |
subtask1_12.txt | AC | 36 ms | 1024 KB |
subtask1_13.txt | AC | 37 ms | 1024 KB |
subtask1_14.txt | AC | 36 ms | 1024 KB |
subtask1_15.txt | WA | 37 ms | 1024 KB |
subtask1_2.txt | AC | 11 ms | 512 KB |
subtask1_3.txt | AC | 24 ms | 768 KB |
subtask1_4.txt | AC | 28 ms | 896 KB |
subtask1_5.txt | AC | 27 ms | 768 KB |
subtask1_6.txt | AC | 15 ms | 512 KB |
subtask1_7.txt | AC | 33 ms | 896 KB |
subtask1_8.txt | AC | 10 ms | 384 KB |
subtask1_9.txt | AC | 5 ms | 384 KB |