oj.uz

답안 #659180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659180 2022-11-16T22:50:53 Z evenvalue 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 1054 ms 169880 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

using int64 = long long;
using ld = long double;

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;

struct ticket {
  int value;
  int color;
  int group;

  bool operator<(const ticket &other) const {
    return (value == other.value ? group < other.group : value < other.value);
  }

  bool operator>(const ticket &other) const {
    return (value == other.value ? group > other.group : value > other.value);
  }
};

struct ticket_pair {
  ticket one;
  ticket two;
  int priority;

  int value() const {
    return one.value + two.value;
  }

  bool operator<(const ticket_pair &other) const {
    return (value() == other.value() ? priority < other.priority : value() < other.value());
  }
};

int64 find_maximum(const int k, const vector<vector<int>> X) {
  const int n = (int) X.size();   //number of colours
  const int m = (int) X[0].size();//number of tickets
  const int choose = n * k;       //number of tickets to choose

  vector<vector<ticket>> tickets(n, vector<ticket>(m));
  for (int color = 0; color < n; color++) {
    for (int group = 0; group < m; group++) {
      tickets[color][group].value = X[color][group];
      tickets[color][group].color = color;
      tickets[color][group].group = group;
    }
  }

  vector<ticket_pair> pq;
  for (auto color : tickets) {
    sort(color.begin(), color.end());
    for (int i = 0; i < k; i++) {
      const int j = m - k + i;
      pq.push_back({color[i], color[j], i});
    }
  }

  sort(pq.begin(), pq.end());

  vector<vector<ticket>> positive(n);
  while (pq.size() > choose / 2) {
    const ticket t = pq.back().two;
    positive[t.color].push_back(t);
    pq.pop_back();
  }

  vector<vector<ticket>> negative(n);
  while (not pq.empty()) {
    const ticket t = pq.back().one;
    negative[t.color].push_back(t);
    pq.pop_back();
  }

  int64 score = 0;
  vector<vector<int>> s(n, vector<int>(m, -1));

  for (int round = 0; round < k; round++) {
    vector<int> color(n);
    iota(color.begin(), color.end(), 0);

    auto delta = [&](const int i) {
      return (int)positive[i].size() - (int)negative[i].size();
    };

    sort(color.begin(), color.end(), [&](const int i, const int j) {
      return delta(i) > delta(j);
    });

    for (int i = 0; i < n; i++) {
      auto &v = (i < n / 2 ? positive : negative);
      const ticket t = v[color[i]].back();
      s[t.color][t.group] = round;
      score += (i < n / 2 ? t.value : -t.value);
      v[color[i]].pop_back();
    }
  }

  allocate_tickets(s);
  return score;
}

Compilation message

tickets.cpp: In function 'int64 find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:71:20: warning: comparison of integer expressions of different signedness: 'std::vector<ticket_pair>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |   while (pq.size() > choose / 2) {
      |          ~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 3412 KB Output is correct
6 Correct 503 ms 77984 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 26 ms 5404 KB Output is correct
6 Correct 669 ms 121508 KB Output is correct
7 Correct 726 ms 131832 KB Output is correct
8 Correct 4 ms 1044 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1680 KB Output is correct
13 Correct 23 ms 4940 KB Output is correct
14 Correct 24 ms 5264 KB Output is correct
15 Correct 787 ms 149496 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 756 KB Output is correct
5 Correct 36 ms 7492 KB Output is correct
6 Correct 6 ms 1428 KB Output is correct
7 Correct 8 ms 1812 KB Output is correct
8 Correct 1054 ms 169880 KB Output is correct
9 Correct 972 ms 159492 KB Output is correct
10 Correct 965 ms 157472 KB Output is correct
11 Correct 1028 ms 168232 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 4 ms 756 KB Output is correct
12 Correct 3 ms 756 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 4 ms 756 KB Output is correct
12 Correct 3 ms 756 KB Output is correct
13 Correct 21 ms 3456 KB Output is correct
14 Correct 20 ms 3540 KB Output is correct
15 Correct 28 ms 5396 KB Output is correct
16 Correct 35 ms 7532 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 29 ms 5740 KB Output is correct
21 Correct 30 ms 5620 KB Output is correct
22 Correct 40 ms 6880 KB Output is correct
23 Correct 35 ms 6716 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 3412 KB Output is correct
12 Correct 503 ms 77984 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 26 ms 5404 KB Output is correct
18 Correct 669 ms 121508 KB Output is correct
19 Correct 726 ms 131832 KB Output is correct
20 Correct 4 ms 1044 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 8 ms 1680 KB Output is correct
25 Correct 23 ms 4940 KB Output is correct
26 Correct 24 ms 5264 KB Output is correct
27 Correct 787 ms 149496 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 756 KB Output is correct
32 Correct 36 ms 7492 KB Output is correct
33 Correct 6 ms 1428 KB Output is correct
34 Correct 8 ms 1812 KB Output is correct
35 Correct 1054 ms 169880 KB Output is correct
36 Correct 972 ms 159492 KB Output is correct
37 Correct 965 ms 157472 KB Output is correct
38 Correct 1028 ms 168232 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 4 ms 756 KB Output is correct
50 Correct 3 ms 756 KB Output is correct
51 Correct 21 ms 3456 KB Output is correct
52 Correct 20 ms 3540 KB Output is correct
53 Correct 28 ms 5396 KB Output is correct
54 Correct 35 ms 7532 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 29 ms 5740 KB Output is correct
59 Correct 30 ms 5620 KB Output is correct
60 Correct 40 ms 6880 KB Output is correct
61 Correct 35 ms 6716 KB Output is correct
62 Correct 55 ms 8936 KB Output is correct
63 Correct 56 ms 9032 KB Output is correct
64 Correct 102 ms 19168 KB Output is correct
65 Correct 329 ms 53972 KB Output is correct
66 Correct 436 ms 74264 KB Output is correct
67 Correct 7 ms 1812 KB Output is correct
68 Correct 6 ms 1428 KB Output is correct
69 Correct 488 ms 78232 KB Output is correct
70 Correct 741 ms 121536 KB Output is correct
71 Correct 1014 ms 169676 KB Output is correct
72 Correct 961 ms 161188 KB Output is correct
73 Correct 962 ms 158392 KB Output is correct
74 Correct 722 ms 121152 KB Output is correct
75 Correct 751 ms 119668 KB Output is correct