Submission #65897321

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#include <atcoder/all>
using namespace atcoder;

int main(){
    int N; cin >> N;
    vector<ll> P(N), Q;
    ll ch = 0;
    for(int i = 0; i < N; i++){
        cin >> P[i];
        if(i > 0 && P[i] > P[i - 1])ch++;
        else if(ch > 0){
            ch++;
            Q.push_back(ch);
            ch = 0;
        }
    }
    if(P[N - 1] > P[N - 2])ch++;
    if(ch > 0)Q.push_back(ch);
    if(Q.size() < 2){
        cout << 0 << endl;
        return 0;
    }
    ll ans = 0;
    for(int i = 0; i < Q.size() - 1; i++){
        ans += (Q[i] - 1) * (Q[i + 1] - 1);
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - ~
User iphi7
Language C++ 23 (gcc 12.2)
Score 350
Code Size 694 Byte
Status AC
Exec Time 55 ms
Memory 7628 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:27:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   27 |     for(int i = 0; i < Q.size() - 1; i++){
      |                    ~~^~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 350 / 350
Status
AC × 3
AC × 38
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3496 KiB
sample01.txt AC 1 ms 3536 KiB
sample02.txt AC 1 ms 3708 KiB
testcase00.txt AC 11 ms 3904 KiB
testcase01.txt AC 55 ms 6576 KiB
testcase02.txt AC 7 ms 3820 KiB
testcase03.txt AC 54 ms 6468 KiB
testcase04.txt AC 45 ms 5800 KiB
testcase05.txt AC 54 ms 6472 KiB
testcase06.txt AC 38 ms 5400 KiB
testcase07.txt AC 55 ms 6604 KiB
testcase08.txt AC 1 ms 3500 KiB
testcase09.txt AC 1 ms 3464 KiB
testcase10.txt AC 16 ms 4512 KiB
testcase11.txt AC 55 ms 7612 KiB
testcase12.txt AC 38 ms 5776 KiB
testcase13.txt AC 55 ms 7628 KiB
testcase14.txt AC 51 ms 5584 KiB
testcase15.txt AC 26 ms 4444 KiB
testcase16.txt AC 53 ms 5588 KiB
testcase17.txt AC 21 ms 4196 KiB
testcase18.txt AC 50 ms 5660 KiB
testcase19.txt AC 12 ms 3648 KiB
testcase20.txt AC 51 ms 5740 KiB
testcase21.txt AC 19 ms 4168 KiB
testcase22.txt AC 51 ms 5588 KiB
testcase23.txt AC 28 ms 4412 KiB
testcase24.txt AC 51 ms 5492 KiB
testcase25.txt AC 25 ms 4516 KiB
testcase26.txt AC 50 ms 5524 KiB
testcase27.txt AC 13 ms 3652 KiB
testcase28.txt AC 50 ms 5568 KiB
testcase29.txt AC 19 ms 4164 KiB
testcase30.txt AC 51 ms 5468 KiB
testcase31.txt AC 9 ms 3640 KiB
testcase32.txt AC 51 ms 5568 KiB
testcase33.txt AC 22 ms 4336 KiB
testcase34.txt AC 50 ms 5620 KiB