oj.uz

Submission #425243

# Submission time Handle Problem Language Result Execution time Memory
425243 2021-06-12T17:24:57 Z peijar Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1095 ms 92008 KB 
#include <bits/stdc++.h>
using namespace std;
#include "tickets.h"

long long find_maximum(int k, vector<vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
  vector<vector<int>> answer(n, vector<int>(m, -1));

  vector<vector<int>> side(n, vector<int>(m, -1));
  vector<tuple<int, int, int>> swaps;
  priority_queue<tuple<int, int, int>> pq;
  long long sol = 0;

  for (int i = 0; i < n; ++i) {
    for (int j(0); j < k; ++j) {
      int other = m - k + j;
      sol -= x[i][j];
      side[i][j] = 0;
      swaps.emplace_back(x[i][j] + x[i][other], i, j);
    }
  }
  sort(swaps.rbegin(), swaps.rend());
  for (int a(0); a < n * k / 2; ++a) {
    auto [delta, i, j] = swaps[a];
    int other = m - k + j;
    pq.pop();
    sol += delta;
    side[i][j] = -1;
    side[i][other] = 1;
  }

  vector<vector<int>> posLeft(n), posRight(n);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      if (side[i][j] == 1)
        posRight[i].push_back(j);
      else if (side[i][j] == 0)
        posLeft[i].push_back(j);
    }
  for (int round = 0; round < k; ++round) {
    vector<bool> picked(n);
    int gaucheNec = n / 2, droiteNec = n / 2;
    for (int col = 0; col < n; ++col) {
      if (posLeft[col].empty()) {
        picked[col] = true;
        answer[col][posRight[col].back()] = round;
        posRight[col].pop_back();
        droiteNec--;
      } else if (posRight[col].empty()) {
        picked[col] = true;
        answer[col][posLeft[col].back()] = round;
        posLeft[col].pop_back();
        gaucheNec--;
      }
    }
    for (int col = 0; col < n; ++col) {
      if (picked[col])
        continue;
      assert(!posLeft[col].empty() and !posRight[col].empty());
      if (gaucheNec > 0) {
        answer[col][posLeft[col].back()] = round;
        posLeft[col].pop_back();
        gaucheNec--;
      } else {
        assert(droiteNec > 0);
        answer[col][posRight[col].back()] = round;
        posRight[col].pop_back();
        droiteNec--;
      }
    }
  }
  allocate_tickets(answer);
  return sol;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 844 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 26 ms 2796 KB Output is correct
6 Correct 643 ms 60312 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 28 ms 3228 KB Output is correct
6 Correct 772 ms 72800 KB Output is correct
7 Correct 822 ms 80212 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1036 KB Output is correct
13 Correct 25 ms 2980 KB Output is correct
14 Correct 25 ms 3104 KB Output is correct
15 Correct 865 ms 84800 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 38 ms 4152 KB Output is correct
6 Correct 6 ms 848 KB Output is correct
7 Correct 7 ms 1292 KB Output is correct
8 Correct 1051 ms 92008 KB Output is correct
9 Correct 956 ms 86732 KB Output is correct
10 Correct 957 ms 85936 KB Output is correct
11 Correct 1010 ms 91996 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 460 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 28 ms 2672 KB Output is correct
14 Correct 26 ms 2708 KB Output is correct
15 Correct 31 ms 3308 KB Output is correct
16 Correct 50 ms 4020 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 35 ms 3384 KB Output is correct
21 Correct 33 ms 3296 KB Output is correct
22 Correct 34 ms 3852 KB Output is correct
23 Correct 43 ms 3836 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 26 ms 2796 KB Output is correct
12 Correct 643 ms 60312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 28 ms 3228 KB Output is correct
18 Correct 772 ms 72800 KB Output is correct
19 Correct 822 ms 80212 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 1036 KB Output is correct
25 Correct 25 ms 2980 KB Output is correct
26 Correct 25 ms 3104 KB Output is correct
27 Correct 865 ms 84800 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 38 ms 4152 KB Output is correct
33 Correct 6 ms 848 KB Output is correct
34 Correct 7 ms 1292 KB Output is correct
35 Correct 1051 ms 92008 KB Output is correct
36 Correct 956 ms 86732 KB Output is correct
37 Correct 957 ms 85936 KB Output is correct
38 Correct 1010 ms 91996 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 296 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 28 ms 2672 KB Output is correct
52 Correct 26 ms 2708 KB Output is correct
53 Correct 31 ms 3308 KB Output is correct
54 Correct 50 ms 4020 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 35 ms 3384 KB Output is correct
59 Correct 33 ms 3296 KB Output is correct
60 Correct 34 ms 3852 KB Output is correct
61 Correct 43 ms 3836 KB Output is correct
62 Correct 72 ms 6980 KB Output is correct
63 Correct 71 ms 7124 KB Output is correct
64 Correct 103 ms 10476 KB Output is correct
65 Correct 353 ms 32368 KB Output is correct
66 Correct 436 ms 40660 KB Output is correct
67 Correct 8 ms 1292 KB Output is correct
68 Correct 6 ms 784 KB Output is correct
69 Correct 639 ms 60424 KB Output is correct
70 Correct 930 ms 72760 KB Output is correct
71 Correct 1071 ms 92008 KB Output is correct
72 Correct 1095 ms 88300 KB Output is correct
73 Correct 1004 ms 87284 KB Output is correct
74 Correct 831 ms 72056 KB Output is correct
75 Correct 805 ms 71416 KB Output is correct