Submission #1626781


Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<set>
#include<map>
#include<math.h>
#include<numeric>

using namespace std;

#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) for(int i=0; i<n; i++)

typedef long long int ll;


int main(){
  int n;
  scanf("%d",&n);
  vector<int> a(n);
  vector<int> b(0);
  REP(i,n) scanf("%d",&a[i]);
  int accm = 1;
  REP(i,n-1){
    if(a[i+1]<=a[i]){
      b.push_back(accm);
      accm = 0;
    }
    accm++;
  }
  b.push_back(accm);
  int sum = 0;
  for(auto e : b){
    sum += e*(e+1)/2;
  }
  cout << sum;
  return 0;
}

Submission Info

Submission Time
Task C - 単調増加
User noni
Language C++14 (GCC 5.4.1)
Score 40
Code Size 669 Byte
Status WA
Exec Time 11 ms
Memory 1276 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:24:29: 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 Sample Subtask0 All
Score / Max Score 0 / 0 40 / 40 0 / 60
Status
AC × 4
AC × 19
AC × 33
WA × 2
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 10 ms 896 KB
subtask1_1.txt AC 4 ms 384 KB
subtask1_10.txt AC 10 ms 640 KB
subtask1_11.txt WA 10 ms 640 KB
subtask1_12.txt AC 11 ms 1276 KB
subtask1_13.txt AC 10 ms 640 KB
subtask1_14.txt AC 11 ms 1276 KB
subtask1_15.txt WA 10 ms 640 KB
subtask1_2.txt AC 4 ms 640 KB
subtask1_3.txt AC 8 ms 768 KB
subtask1_4.txt AC 8 ms 512 KB
subtask1_5.txt AC 8 ms 1148 KB
subtask1_6.txt AC 5 ms 640 KB
subtask1_7.txt AC 10 ms 640 KB
subtask1_8.txt AC 4 ms 512 KB
subtask1_9.txt AC 2 ms 384 KB