oj.uz

Submission #981930

# Submission time Handle Problem Language Result Execution time Memory
981930 2024-05-13T16:35:35 Z Maaxle Sequence (APIO23_sequence) C++17
0 / 100
 2000 ms 6072 KB 
#include "sequence.h"
#include <bits/stdc++.h>

#define range(it, a, b) for (ll it = a; it < b; it++)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map 
#define pqueue priority_queue 
#define ptr(A) shared_ptr<A>

using namespace std;

int sequence(int N, vector<int> A) {
  int maxi = 0;
  
  map<int, int> freq;
  range(l, 0, N) {
    freq.clear();
    range(r, l, N) {
      freq[A[r]]++;
      int sz = r-l+1;
      int a = sz/2, b = a+(sz&1);

      int pos = -1;
      for (auto& it : freq) {
        pos += it.second;
        if (pos >= a) {
          // cout << it.first << ' '<<it.second<<'\n';
          maxi = max(maxi, it.second);
        }   
        if (pos >= b) {
          // cout << it.first << ' '<<it.second<<'\n';
          maxi = max(maxi, it.second);
          break;
        }
      }
    }
  }
  return maxi;
}

Subtask #1
0.0 / 11.0

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

Subtask #2
0.0 / 17.0

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

Subtask #3
0.0 / 7.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 22.0

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

Subtask #7
0.0 / 18.0

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