oj.uz

Submission #974307

# Submission time Handle Problem Language Result Execution time Memory
974307 2024-05-03T07:57:05 Z Pannda Sequence (APIO23_sequence) C++17
7 / 100
 106 ms 33516 KB 
#include "sequence.h"

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

int sequence(int n, vector<int> a) {
    vector<vector<int>> mp(n);
    for (int i = 0; i < n; i++) {
        a[i]--;
        mp[a[i]].push_back(i);
    }

    int ans = 0;
    for (int i = 0, c; i < n; i++) {
        if (i == 0 || a[i] != a[i - 1]) {
            c = 1;
        } else {
            c++;
        }
        ans = max(ans, c);
    }

    for (int med = 0; med < n; med++) {
        if (mp[med].size() < 2) continue;
        int l = mp[med].front();
        int r = mp[med].back() + 1;
        if (2 * (n - r + l + mp[med].size()) >= n) {
            ans = max(ans, (int)mp[med].size());
        }
    }

    return ans;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:27:46: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |         if (2 * (n - r + l + mp[med].size()) >= n) {
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 68 ms 27764 KB Output is correct
3 Correct 73 ms 29268 KB Output is correct
4 Correct 37 ms 19164 KB Output is correct
5 Correct 64 ms 28264 KB Output is correct
6 Correct 62 ms 28240 KB Output is correct
7 Correct 38 ms 19916 KB Output is correct
8 Correct 37 ms 20048 KB Output is correct
9 Correct 38 ms 19804 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 39 ms 19968 KB Output is correct
3 Incorrect 38 ms 19260 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 106 ms 33516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -