oj.uz

답안 #760261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760261 2023-06-17T11:04:20 Z danikoynov 서열 (APIO23_sequence) C++17
28 / 100
 2000 ms 35496 KB 
#include "sequence.h"

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

const int maxn = 5e5 + 10;
vector < int > occ[maxn];
int val[maxn], pref[maxn];
int sequence(int N, vector<int> A)
{
    A.insert(A.begin(), 0);
    for (int i = 1; i <= N; i ++)
        occ[A[i]].push_back(i);

    int ans = 0;
    for (int x = 1; x <= N; x ++)
    {
        for (int i = 1; i <= N; i ++)
        {
            if (A[i] < x)
                val[i] = -1;
            else
            if (A[i] == x)
            val[i] = 0;
            else
                val[i] = 1;
            pref[i] = pref[i - 1] + val[i];
        }


        for (int i = 0; i < occ[x].size(); i ++)
        {
            int j = i + ans;
            if (j >= occ[x].size())
                break;
            //cout << "-----------" << endl;
            //cout << x << " " << i << " " << j << " " << ans << endl;
            ///cout << pref[r] << endl;
            int l = occ[x][i], r = occ[x][j];
            int min_lf = 1e9, max_lf = -1e9;
            int min_rf = 1e9, max_rf = -1e9;
            int d = 0;
            for (int p = l - 1; p >= 0; p --)
            {
                if (A[p] == x)
                    d ++;
                min_lf = min(min_lf, pref[p] - d);
                max_lf = max(max_lf, pref[p] + d);
            }
            d = 0;
            for (int p = r; p <= N; p ++)
            {
                if (A[p] == x && p != r)
                    d ++;
                min_rf = min(min_rf, pref[p] - d);
                max_rf = max(max_rf, pref[p] + d);
            }

            max_rf += (j - i + 1);
            min_rf -= (j - i + 1);
            //cout << min_lf << " " << max_lf << " " << min_rf << " " << max_rf << endl;
            if (max(min_rf, min_lf) <= min(max_rf, max_lf))
            {
                ///cout << x << " " << i << " " << j << endl;
                ans ++;
                i --;
            }

            }
    }
    return ans;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:31:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for (int i = 0; i < occ[x].size(); i ++)
      |                         ~~^~~~~~~~~~~~~~~
sequence.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |             if (j >= occ[x].size())
      |                 ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12064 KB Output is correct
3 Correct 6 ms 11948 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 8 ms 11988 KB Output is correct
6 Correct 5 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 5 ms 11988 KB Output is correct
9 Correct 6 ms 12060 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12060 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 17 ms 12116 KB Output is correct
14 Correct 17 ms 12044 KB Output is correct
15 Correct 18 ms 12116 KB Output is correct
16 Correct 18 ms 12116 KB Output is correct
17 Correct 18 ms 12068 KB Output is correct
18 Correct 16 ms 12160 KB Output is correct
19 Correct 16 ms 12128 KB Output is correct
20 Correct 17 ms 12116 KB Output is correct
21 Correct 17 ms 12116 KB Output is correct
22 Correct 17 ms 12116 KB Output is correct

Subtask #3
0.0 / 7.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12064 KB Output is correct
3 Correct 6 ms 11948 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 8 ms 11988 KB Output is correct
6 Correct 5 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 5 ms 11988 KB Output is correct
9 Correct 6 ms 12060 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12060 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 17 ms 12116 KB Output is correct
14 Correct 17 ms 12044 KB Output is correct
15 Correct 18 ms 12116 KB Output is correct
16 Correct 18 ms 12116 KB Output is correct
17 Correct 18 ms 12068 KB Output is correct
18 Correct 16 ms 12160 KB Output is correct
19 Correct 16 ms 12128 KB Output is correct
20 Correct 17 ms 12116 KB Output is correct
21 Correct 17 ms 12116 KB Output is correct
22 Correct 17 ms 12116 KB Output is correct
23 Execution timed out 2067 ms 14872 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 12064 KB Output is correct
3 Correct 6 ms 11948 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 8 ms 11988 KB Output is correct
6 Correct 5 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 5 ms 11988 KB Output is correct
9 Correct 6 ms 12060 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12060 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 17 ms 12116 KB Output is correct
14 Correct 17 ms 12044 KB Output is correct
15 Correct 18 ms 12116 KB Output is correct
16 Correct 18 ms 12116 KB Output is correct
17 Correct 18 ms 12068 KB Output is correct
18 Correct 16 ms 12160 KB Output is correct
19 Correct 16 ms 12128 KB Output is correct
20 Correct 17 ms 12116 KB Output is correct
21 Correct 17 ms 12116 KB Output is correct
22 Correct 17 ms 12116 KB Output is correct
23 Execution timed out 2063 ms 29720 KB Time limit exceeded
24 Halted 0 ms 0 KB -