oj.uz

Submission #425246

# Submission time Handle Problem Language Result Execution time Memory
425246 2021-06-12T17:26:06 Z peijar Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1066 ms 92152 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;
  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;
    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 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 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 2 ms 440 KB Output is correct
5 Correct 25 ms 2644 KB Output is correct
6 Correct 669 ms 60436 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 1 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 26 ms 3272 KB Output is correct
6 Correct 717 ms 72852 KB Output is correct
7 Correct 768 ms 80160 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1036 KB Output is correct
13 Correct 30 ms 2960 KB Output is correct
14 Correct 32 ms 3096 KB Output is correct
15 Correct 786 ms 84844 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 36 ms 4164 KB Output is correct
6 Correct 6 ms 912 KB Output is correct
7 Correct 8 ms 1276 KB Output is correct
8 Correct 1058 ms 91976 KB Output is correct
9 Correct 1016 ms 86792 KB Output is correct
10 Correct 996 ms 85872 KB Output is correct
11 Correct 1057 ms 92012 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 4 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 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 460 KB Output is correct
11 Correct 3 ms 460 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 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 460 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 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 25 ms 2756 KB Output is correct
14 Correct 26 ms 2800 KB Output is correct
15 Correct 32 ms 3272 KB Output is correct
16 Correct 37 ms 4036 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 29 ms 3432 KB Output is correct
21 Correct 31 ms 3260 KB Output is correct
22 Correct 33 ms 3768 KB Output is correct
23 Correct 40 ms 3772 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 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 25 ms 2644 KB Output is correct
12 Correct 669 ms 60436 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 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 26 ms 3272 KB Output is correct
18 Correct 717 ms 72852 KB Output is correct
19 Correct 768 ms 80160 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 9 ms 1036 KB Output is correct
25 Correct 30 ms 2960 KB Output is correct
26 Correct 32 ms 3096 KB Output is correct
27 Correct 786 ms 84844 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 36 ms 4164 KB Output is correct
33 Correct 6 ms 912 KB Output is correct
34 Correct 8 ms 1276 KB Output is correct
35 Correct 1058 ms 91976 KB Output is correct
36 Correct 1016 ms 86792 KB Output is correct
37 Correct 996 ms 85872 KB Output is correct
38 Correct 1057 ms 92012 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 4 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 4 ms 460 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 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 25 ms 2756 KB Output is correct
52 Correct 26 ms 2800 KB Output is correct
53 Correct 32 ms 3272 KB Output is correct
54 Correct 37 ms 4036 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 29 ms 3432 KB Output is correct
59 Correct 31 ms 3260 KB Output is correct
60 Correct 33 ms 3768 KB Output is correct
61 Correct 40 ms 3772 KB Output is correct
62 Correct 96 ms 6960 KB Output is correct
63 Correct 72 ms 7068 KB Output is correct
64 Correct 108 ms 10660 KB Output is correct
65 Correct 402 ms 32460 KB Output is correct
66 Correct 471 ms 40596 KB Output is correct
67 Correct 7 ms 1292 KB Output is correct
68 Correct 6 ms 784 KB Output is correct
69 Correct 717 ms 60328 KB Output is correct
70 Correct 802 ms 72828 KB Output is correct
71 Correct 1066 ms 92152 KB Output is correct
72 Correct 927 ms 88480 KB Output is correct
73 Correct 919 ms 87292 KB Output is correct
74 Correct 739 ms 71932 KB Output is correct
75 Correct 812 ms 71352 KB Output is correct