oj.uz

답안 #919647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919647 2024-02-01T09:57:25 Z JakobZorz 서열 (APIO23_sequence) C++17
11 / 100
 2000 ms 35408 KB 
#include"sequence.h"
#include<vector>
using namespace std;

int n;
int arr2[500000];
int tree1[500000];
vector<int>arr[500000];

int sequence(int N,vector<int>A){
    n=N;
    for(int i=0;i<n;i++){
        arr[A[i]-1].push_back(i);
        arr2[i]=A[i]-1;
        tree1[i]=-1;
    }
    
    int res=0;
    for(int v=0;v<n;v++){
        for(int idx:arr[v]){
            tree1[idx]=1;
            
            for(int i=0;i<n;i++){
                int sum=0,num=0;
                for(int j=i;j<n;j++){
                    sum+=tree1[j];
                    if(arr2[j]==v)
                        num++;
                    if(0<=sum&&sum<=1)
                        res=max(res,num);
                }
            }
        }
    }
    
    return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 15704 KB Output is correct
2 Correct 4 ms 15704 KB Output is correct
3 Correct 5 ms 15960 KB Output is correct
4 Correct 4 ms 15704 KB Output is correct
5 Correct 5 ms 15704 KB Output is correct
6 Correct 5 ms 15704 KB Output is correct
7 Correct 5 ms 15704 KB Output is correct
8 Correct 4 ms 15704 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 5 ms 15704 KB Output is correct
11 Correct 5 ms 15704 KB Output is correct
12 Correct 4 ms 15704 KB Output is correct
13 Execution timed out 2047 ms 15704 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 15704 KB Output is correct
2 Correct 4 ms 15704 KB Output is correct
3 Correct 5 ms 15960 KB Output is correct
4 Correct 4 ms 15704 KB Output is correct
5 Correct 5 ms 15704 KB Output is correct
6 Correct 5 ms 15704 KB Output is correct
7 Correct 5 ms 15704 KB Output is correct
8 Correct 4 ms 15704 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 5 ms 15704 KB Output is correct
11 Correct 5 ms 15704 KB Output is correct
12 Correct 4 ms 15704 KB Output is correct
13 Execution timed out 2047 ms 15704 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 15704 KB Output is correct
2 Correct 4 ms 15704 KB Output is correct
3 Correct 5 ms 15960 KB Output is correct
4 Correct 4 ms 15704 KB Output is correct
5 Correct 5 ms 15704 KB Output is correct
6 Correct 5 ms 15704 KB Output is correct
7 Correct 5 ms 15704 KB Output is correct
8 Correct 4 ms 15704 KB Output is correct
9 Correct 7 ms 15708 KB Output is correct
10 Correct 5 ms 15704 KB Output is correct
11 Correct 5 ms 15704 KB Output is correct
12 Correct 4 ms 15704 KB Output is correct
13 Execution timed out 2047 ms 15704 KB Time limit exceeded
14 Halted 0 ms 0 KB -