Submission #1244312
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <vector> #include <stack> #include <map> #include <cstdio> #include <math.h> #include <utility> #include <list> #include <functional> #include <queue> using namespace std; #define ll long long #define vecint vector<int> #define Pii pair<int, int> #define REP(i,x,n) for(int i=x;i<n;i++) #define rep(i,n) REP(i,0,n) #define print(a) cout << a << endl #define MOD 1000000007 #define NIL -1 int N; int a[100000]; ll f(int x){ return x*(x+1)/2; } void solve(){ ll ans=0; int count=1; int x0=a[0],x1; REP(i,1,N){ x1=a[i]; if(x1>x0){ count++; }else{ ans+=f(count); count=1; } if(i==N-1) ans+=f(count); x0=x1; } print(ans); return; } int main(){ cin>>N; rep(i,N) cin>>a[i]; solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 単調増加 |
User | maxi |
Language | C++14 (GCC 5.4.1) |
Score | 40 |
Code Size | 956 Byte |
Status | WA |
Exec Time | 37 ms |
Memory | 640 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 | 2 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 | 2 ms | 256 KB |
subtask0_8.txt | AC | 1 ms | 256 KB |
subtask0_9.txt | AC | 2 ms | 256 KB |
subtask1_0.txt | AC | 30 ms | 512 KB |
subtask1_1.txt | AC | 13 ms | 384 KB |
subtask1_10.txt | AC | 36 ms | 640 KB |
subtask1_11.txt | WA | 36 ms | 640 KB |
subtask1_12.txt | AC | 36 ms | 640 KB |
subtask1_13.txt | AC | 36 ms | 640 KB |
subtask1_14.txt | AC | 36 ms | 640 KB |
subtask1_15.txt | WA | 37 ms | 640 KB |
subtask1_2.txt | AC | 11 ms | 384 KB |
subtask1_3.txt | AC | 24 ms | 512 KB |
subtask1_4.txt | AC | 28 ms | 512 KB |
subtask1_5.txt | AC | 26 ms | 512 KB |
subtask1_6.txt | AC | 16 ms | 384 KB |
subtask1_7.txt | AC | 33 ms | 640 KB |
subtask1_8.txt | AC | 10 ms | 384 KB |
subtask1_9.txt | AC | 5 ms | 256 KB |