oj.uz

Submission #425242

# Submission time Handle Problem Language Result Execution time Memory
425242 2021-06-12T17:22:55 Z peijar Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1290 ms 113768 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));

  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;
      pq.emplace(x[i][j] + x[i][other], i, j);
    }
  }
  while ((int)pq.size() > n * k / 2) {
    auto [delta, i, j] = pq.top();
    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 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 3 ms 944 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 30 ms 3644 KB Output is correct
6 Correct 699 ms 61820 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 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 28 ms 3388 KB Output is correct
6 Correct 777 ms 73872 KB Output is correct
7 Correct 894 ms 81180 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 1164 KB Output is correct
13 Correct 25 ms 3124 KB Output is correct
14 Correct 26 ms 3244 KB Output is correct
15 Correct 875 ms 85788 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 40 ms 4944 KB Output is correct
6 Correct 9 ms 1040 KB Output is correct
7 Correct 8 ms 1384 KB Output is correct
8 Correct 1290 ms 93336 KB Output is correct
9 Correct 1249 ms 88016 KB Output is correct
10 Correct 1157 ms 87140 KB Output is correct
11 Correct 1280 ms 93224 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 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 564 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 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 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 564 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 29 ms 3564 KB Output is correct
14 Correct 27 ms 3552 KB Output is correct
15 Correct 33 ms 4136 KB Output is correct
16 Correct 39 ms 4924 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 556 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 31 ms 3756 KB Output is correct
21 Correct 32 ms 4136 KB Output is correct
22 Correct 40 ms 4220 KB Output is correct
23 Correct 37 ms 4676 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 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 3 ms 944 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 436 KB Output is correct
11 Correct 30 ms 3644 KB Output is correct
12 Correct 699 ms 61820 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 28 ms 3388 KB Output is correct
18 Correct 777 ms 73872 KB Output is correct
19 Correct 894 ms 81180 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 1164 KB Output is correct
25 Correct 25 ms 3124 KB Output is correct
26 Correct 26 ms 3244 KB Output is correct
27 Correct 875 ms 85788 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 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 40 ms 4944 KB Output is correct
33 Correct 9 ms 1040 KB Output is correct
34 Correct 8 ms 1384 KB Output is correct
35 Correct 1290 ms 93336 KB Output is correct
36 Correct 1249 ms 88016 KB Output is correct
37 Correct 1157 ms 87140 KB Output is correct
38 Correct 1280 ms 93224 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 564 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 29 ms 3564 KB Output is correct
52 Correct 27 ms 3552 KB Output is correct
53 Correct 33 ms 4136 KB Output is correct
54 Correct 39 ms 4924 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 556 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 31 ms 3756 KB Output is correct
59 Correct 32 ms 4136 KB Output is correct
60 Correct 40 ms 4220 KB Output is correct
61 Correct 37 ms 4676 KB Output is correct
62 Correct 72 ms 9388 KB Output is correct
63 Correct 80 ms 9540 KB Output is correct
64 Correct 116 ms 12912 KB Output is correct
65 Correct 385 ms 42148 KB Output is correct
66 Correct 498 ms 50300 KB Output is correct
67 Correct 8 ms 1420 KB Output is correct
68 Correct 8 ms 932 KB Output is correct
69 Correct 656 ms 82088 KB Output is correct
70 Correct 888 ms 94500 KB Output is correct
71 Correct 1222 ms 113768 KB Output is correct
72 Correct 993 ms 96652 KB Output is correct
73 Correct 1070 ms 108332 KB Output is correct
74 Correct 827 ms 80284 KB Output is correct
75 Correct 851 ms 92604 KB Output is correct