oj.uz

Submission #981187

# Submission time Handle Problem Language Result Execution time Memory
981187 2024-05-13T01:46:47 Z math_rabbit_1028 Sequence (APIO23_sequence) C++17
11 / 100
 2000 ms 35860 KB 
#include "sequence.h"

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

int n, m, ans = 0;
vector<int> arr, vec;
vector<int> pos[505050];

int sequence(int N, vector<int> A) {
    n = N;
    arr = A;
    sort(A.begin(), A.end());
    A.erase(unique(A.begin(), A.end()), A.end());
    m = A.size();
    for (int i = 0; i < n; i++) {
        arr[i] = lower_bound(A.begin(), A.end(), arr[i]) - A.begin();
    }

    for (int i = 0; i < n; i++) {
        pos[arr[i]].push_back(i);
    }
    
    for (int t = 0; t < m; t++) {
        vec.clear();
        for (int i = 0; i < n; i++) {
            if (arr[t] == arr[i]) vec.push_back(0);
            if (arr[t] > arr[i]) vec.push_back(1);
            if (arr[t] < arr[i]) vec.push_back(-1);
        }

        for (int s = 0; s < n; s++) {
            int a = 0, b = 0, c = 0;
            for (int e = s; e < n; e++) {
                int k = (e-s+1)/2;
                if (vec[e] == -1) a++;
                if (vec[e] == 0) b++;
                if (a <= k && k <= a+b-(e-s+1)%2) ans = max(ans, b);
                /*
                    -1 : a
                    0 : b
                    1 : c
                    
                    합 짝수(2k  ) => a <= n/2 <= a+b
                    합 홀수(2k+1) => a <= n/2 <= a+b-1
                */
            }
        }
    }

    return ans;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:33:31: warning: unused variable 'c' [-Wunused-variable]
   33 |             int a = 0, b = 0, c = 0;
      |                               ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 4 ms 12120 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12096 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 4 ms 12124 KB Output is correct
10 Correct 5 ms 12124 KB Output is correct
11 Correct 4 ms 12124 KB Output is correct
12 Correct 4 ms 12120 KB Output is correct

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 4 ms 12120 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12096 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 4 ms 12124 KB Output is correct
10 Correct 5 ms 12124 KB Output is correct
11 Correct 4 ms 12124 KB Output is correct
12 Correct 4 ms 12120 KB Output is correct
13 Execution timed out 2057 ms 12124 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12120 KB Output is correct
2 Execution timed out 2037 ms 30048 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Execution timed out 2097 ms 23960 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2032 ms 35860 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 4 ms 12120 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12096 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 4 ms 12124 KB Output is correct
10 Correct 5 ms 12124 KB Output is correct
11 Correct 4 ms 12124 KB Output is correct
12 Correct 4 ms 12120 KB Output is correct
13 Execution timed out 2057 ms 12124 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 4 ms 12120 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12096 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 4 ms 12124 KB Output is correct
9 Correct 4 ms 12124 KB Output is correct
10 Correct 5 ms 12124 KB Output is correct
11 Correct 4 ms 12124 KB Output is correct
12 Correct 4 ms 12120 KB Output is correct
13 Execution timed out 2057 ms 12124 KB Time limit exceeded
14 Halted 0 ms 0 KB -