Submission #65918992


Source Code Expand

#include <stdio.h>
#include <math.h>

int main(void){
    int N;
    scanf("%d", &N);
    int P[N];
    for(int i = 0; i < N; i++){
        scanf("%d", &P[i]);  
    }
    
    long long kosu = 0;
    int sign[N];
    for (int i = 0; i < N - 1 ; i++){
        if(P[i] < P[i+1]){sign[i+1] = 1;} //+1
        else{sign[i+1] = -1;} //-1
    }

    int fugou_block[N];
    int block_sign[N];
    int block_idx = 0;

    fugou_block[0] = 1;
    block_sign[0] = sign[1];
    int tmp_sign = sign[1];

    for(int i = 2; i < N; i++){
        if(tmp_sign != sign[i]){
            block_idx += 1;
            fugou_block[block_idx] = 1;
            tmp_sign = sign[i];
            block_sign[block_idx] = tmp_sign;
        } else {fugou_block[block_idx] += 1;}
    }


   for(int i = 0; i <= block_idx - 2; i++){
        if (block_sign[i]   ==  1 && block_sign[i+1] == -1 && block_sign[i+2] ==  1)
        {
            kosu += (long long)fugou_block[i] * fugou_block[i+2];
        }
    }
    printf("%lld\n", kosu);
    return 0;
}

Submission Info

Submission Time
Task C - ~
User oinucha
Language C (gcc 12.2.0)
Score 350
Code Size 1067 Byte
Status AC
Exec Time 27 ms
Memory 6408 KiB

Compile Error

Main.c: In function ‘main’:
Main.c:6:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    6 |     scanf("%d", &N);
      |     ^~~~~~~~~~~~~~~
Main.c:9:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    9 |         scanf("%d", &P[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 0 ms 1644 KiB
sample01.txt AC 0 ms 1716 KiB
sample02.txt AC 0 ms 1616 KiB
testcase00.txt AC 6 ms 2548 KiB
testcase01.txt AC 27 ms 6328 KiB
testcase02.txt AC 4 ms 2324 KiB
testcase03.txt AC 27 ms 6296 KiB
testcase04.txt AC 23 ms 5644 KiB
testcase05.txt AC 27 ms 6392 KiB
testcase06.txt AC 19 ms 4892 KiB
testcase07.txt AC 27 ms 6304 KiB
testcase08.txt AC 0 ms 1704 KiB
testcase09.txt AC 0 ms 1720 KiB
testcase10.txt AC 8 ms 3140 KiB
testcase11.txt AC 27 ms 6408 KiB
testcase12.txt AC 19 ms 4784 KiB
testcase13.txt AC 27 ms 6408 KiB
testcase14.txt AC 21 ms 6308 KiB
testcase15.txt AC 11 ms 4184 KiB
testcase16.txt AC 20 ms 6324 KiB
testcase17.txt AC 9 ms 3752 KiB
testcase18.txt AC 20 ms 6392 KiB
testcase19.txt AC 5 ms 2748 KiB
testcase20.txt AC 20 ms 6400 KiB
testcase21.txt AC 8 ms 3484 KiB
testcase22.txt AC 21 ms 6396 KiB
testcase23.txt AC 12 ms 4272 KiB
testcase24.txt AC 21 ms 6408 KiB
testcase25.txt AC 11 ms 3928 KiB
testcase26.txt AC 21 ms 6256 KiB
testcase27.txt AC 6 ms 2844 KiB
testcase28.txt AC 21 ms 6308 KiB
testcase29.txt AC 8 ms 3572 KiB
testcase30.txt AC 21 ms 6324 KiB
testcase31.txt AC 4 ms 2440 KiB
testcase32.txt AC 21 ms 6392 KiB
testcase33.txt AC 9 ms 3660 KiB
testcase34.txt AC 21 ms 6316 KiB