답안 #954139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954139	2024-03-27T10:35:51 Z	Otalp	서열 (APIO23_sequence)	C++17	11 / 100	2000 ms	7628 KB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

int sequence(int n, vector<int> a) {
    int ans = 0;
    for(int i=0; i<n; i++){
        int sum=0, col=0;
        for(int j=i; j>=0; j--){
            if(a[i] == a[j]) col++;
            if(a[i] < a[j]) sum --;
            if(a[i] > a[j]) sum ++;
            if(abs(sum) <= col) ans = max(ans, col);
            //cout<<i<<' '<<j<<' '<<col<<' '<<sum<<'\n';
        }
    }
    return ans;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct

Subtask #2

0.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Incorrect	6 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Execution timed out	2095 ms	7628 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	2095 ms	5196 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2052 ms	7516 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Incorrect	6 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Incorrect	6 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-