Submission #751581

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
751581	2023-05-31 19:37:16	tch1cherin	The Kingdom of JOIOI (JOI17_joioi)	C++17	100 / 100	3176 ms	102780 KiB

joioi

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
void solve() {
  int H, W;
  cin >> H >> W;
  vector<vector<int>> A(H, vector<int>(W));
  vector<pair<int, int>> P;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      P.emplace_back(i, j);
      cin >> A[i][j];
    } 
  }
  int ans = INT_MAX;
  for (int r = 0; r < 2; r++) {
    sort(P.begin(), P.end(), [&](pair<int, int> x, pair<int, int> y) {
      return A[x.first][x.second] < A[y.first][y.second];
    });
    vector<vector<int>> x(H, vector<int>(W + 1));
    for (int i = 0; i < H; i++) {
      x[i][W] = INT_MAX;
      for (int j = W - 1; j >= 0; j--) {
        x[i][j] = min(x[i][j + 1], A[i][j]);
      }
    }
    multiset<int> Spref, Ssuff;
    for (int i = 0; i < H; i++) {
      Spref.insert(x[i][0]);
      Ssuff.insert(x[i][0]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 45 / 45
• Subtask 3: 40 / 40