답안 #977063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977063	2024-05-07T10:56:30 Z	Tsagana	서열 (APIO23_sequence)	C++17	28 / 100	2000 ms	4800 KB

sequence

  #include "sequence.h"

  //OP
#include <bits/stdc++.h>
 
#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define pi pair<int, int >
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define mset multiset
#define F first
#define S second

using namespace std;

struct arr {
  vector<int> v;

  void res() {v.clear();}
  void insert(int x) {
    v.pb(x);
    for (int i = v.size()-1; i > 0 && v[i] < v[i-1]; i--) swap(v[i], v[i-1]);
  }
  pair<int, int> med() {
    int n = v.size();
    if (n % 2 == 1) {
      return {v[n/2], -1};
    }
    else {
      return {v[n/2-1], v[n/2]};
    }
  }
  int calc() {
    pair<int, int> p = med();
    int c1 = 0, c2 = 0;
    for (auto i: v) {
      if (i == p.F) c1++;
      if (i == p.S) c2++;
    }
    return max(c1, c2);
  }
};
int sequence(int N, std::vector<int> A) {
  int ans = 0;
  for (int i = 0; i < N; i++) {
    arr a; a.res();
    for (int j = i; j < N; j++) {
      a.insert(A[j]);
      ans = max(ans, a.calc());
      // for (auto k: a.v) cout << k << ' ';
      // cout << " - " << ans << '\n';
    }
  }
  return ans;
}
  //ED

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct

Subtask #2

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1676 ms	348 KB	Output is correct
14	Correct	1681 ms	440 KB	Output is correct
15	Correct	1640 ms	440 KB	Output is correct
16	Correct	1636 ms	592 KB	Output is correct
17	Correct	1554 ms	436 KB	Output is correct
18	Correct	1240 ms	440 KB	Output is correct
19	Correct	1634 ms	440 KB	Output is correct
20	Correct	1685 ms	436 KB	Output is correct
21	Correct	1660 ms	440 KB	Output is correct
22	Correct	1740 ms	436 KB	Output is correct

Subtask #3

0.0 / 7.0

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

Subtask #4

0.0 / 12.0

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

Subtask #5

0.0 / 13.0

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

Subtask #6

0.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1676 ms	348 KB	Output is correct
14	Correct	1681 ms	440 KB	Output is correct
15	Correct	1640 ms	440 KB	Output is correct
16	Correct	1636 ms	592 KB	Output is correct
17	Correct	1554 ms	436 KB	Output is correct
18	Correct	1240 ms	440 KB	Output is correct
19	Correct	1634 ms	440 KB	Output is correct
20	Correct	1685 ms	436 KB	Output is correct
21	Correct	1660 ms	440 KB	Output is correct
22	Correct	1740 ms	436 KB	Output is correct
23	Execution timed out	2075 ms	1408 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #7

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	352 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1676 ms	348 KB	Output is correct
14	Correct	1681 ms	440 KB	Output is correct
15	Correct	1640 ms	440 KB	Output is correct
16	Correct	1636 ms	592 KB	Output is correct
17	Correct	1554 ms	436 KB	Output is correct
18	Correct	1240 ms	440 KB	Output is correct
19	Correct	1634 ms	440 KB	Output is correct
20	Correct	1685 ms	436 KB	Output is correct
21	Correct	1660 ms	440 KB	Output is correct
22	Correct	1740 ms	436 KB	Output is correct
23	Execution timed out	2021 ms	4796 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-