oj.uz

Submission #319949

# Submission time Handle Problem Language Result Execution time Memory
319949 2020-11-06T22:00:02 Z eriksuenderhauf Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1499 ms 85972 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<int,int> a[2000][2000];
int cnt[2000], vis[2000], cnt2[2000];

ll find_maximum(int k, vector<vector<int>> x) {
  int n = x.size(), m = x[0].size();
  vector<vector<int>> y(n, vector<int>(m, -1));
  priority_queue<array<int,2>> pq;
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++)
      a[i][j] = make_pair(x[i][j], j);
    sort(a[i], a[i]+m);
    for (int j1 = k-1, j2 = m-1; ~j1; j1--, j2--)
      pq.push({a[i][j1].first + a[i][j2].first, i}), ans -= a[i][j1].first;
  }
  for (int i = 0; i < k * n / 2; i++, pq.pop())
    ans += pq.top()[0], cnt[pq.top()[1]]++;
  while (!pq.empty()) pq.pop();
  for (int i = 0; i < n; i++)
    pq.push({cnt[i], i});
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < n / 2; j++, pq.pop())
      vis[pq.top()[1]] = 1;
    for (int j = 0; j < n; j++)
      if (vis[j])
        vis[j] = 0, y[j][a[j][m-cnt[j]].second] = i, pq.push({--cnt[j], j});
      else
        y[j][a[j][cnt2[j]++].second] = i;
  }
  allocate_tickets(y);
  return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 1644 KB Output is correct
6 Correct 5 ms 6892 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 29 ms 5284 KB Output is correct
6 Correct 712 ms 75152 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 876 KB Output is correct
5 Correct 34 ms 4660 KB Output is correct
6 Correct 899 ms 80320 KB Output is correct
7 Correct 1048 ms 83248 KB Output is correct
8 Correct 6 ms 1256 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1772 KB Output is correct
13 Correct 34 ms 4956 KB Output is correct
14 Correct 32 ms 3820 KB Output is correct
15 Correct 1113 ms 83888 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 5 ms 1004 KB Output is correct
5 Correct 50 ms 5716 KB Output is correct
6 Correct 7 ms 1012 KB Output is correct
7 Correct 12 ms 7404 KB Output is correct
8 Correct 1495 ms 85896 KB Output is correct
9 Correct 1386 ms 80684 KB Output is correct
10 Correct 1397 ms 80304 KB Output is correct
11 Correct 1477 ms 85972 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 3 ms 1004 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 3 ms 876 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct
11 Correct 4 ms 1004 KB Output is correct
12 Correct 5 ms 1004 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 3 ms 1004 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 3 ms 876 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct
11 Correct 4 ms 1004 KB Output is correct
12 Correct 5 ms 1004 KB Output is correct
13 Correct 29 ms 5348 KB Output is correct
14 Correct 30 ms 5220 KB Output is correct
15 Correct 38 ms 5348 KB Output is correct
16 Correct 49 ms 5592 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 4 ms 1900 KB Output is correct
19 Correct 2 ms 1644 KB Output is correct
20 Correct 40 ms 4804 KB Output is correct
21 Correct 42 ms 5212 KB Output is correct
22 Correct 47 ms 4960 KB Output is correct
23 Correct 47 ms 5440 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 1 ms 1644 KB Output is correct
6 Correct 5 ms 6892 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 29 ms 5284 KB Output is correct
12 Correct 712 ms 75152 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 34 ms 4660 KB Output is correct
18 Correct 899 ms 80320 KB Output is correct
19 Correct 1048 ms 83248 KB Output is correct
20 Correct 6 ms 1256 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 10 ms 1772 KB Output is correct
25 Correct 34 ms 4956 KB Output is correct
26 Correct 32 ms 3820 KB Output is correct
27 Correct 1113 ms 83888 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 5 ms 1004 KB Output is correct
32 Correct 50 ms 5716 KB Output is correct
33 Correct 7 ms 1012 KB Output is correct
34 Correct 12 ms 7404 KB Output is correct
35 Correct 1495 ms 85896 KB Output is correct
36 Correct 1386 ms 80684 KB Output is correct
37 Correct 1397 ms 80304 KB Output is correct
38 Correct 1477 ms 85972 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 876 KB Output is correct
41 Correct 3 ms 1004 KB Output is correct
42 Correct 3 ms 1004 KB Output is correct
43 Correct 3 ms 1004 KB Output is correct
44 Correct 4 ms 1004 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 748 KB Output is correct
47 Correct 3 ms 876 KB Output is correct
48 Correct 4 ms 1004 KB Output is correct
49 Correct 4 ms 1004 KB Output is correct
50 Correct 5 ms 1004 KB Output is correct
51 Correct 29 ms 5348 KB Output is correct
52 Correct 30 ms 5220 KB Output is correct
53 Correct 38 ms 5348 KB Output is correct
54 Correct 49 ms 5592 KB Output is correct
55 Correct 1 ms 492 KB Output is correct
56 Correct 4 ms 1900 KB Output is correct
57 Correct 2 ms 1644 KB Output is correct
58 Correct 40 ms 4804 KB Output is correct
59 Correct 42 ms 5212 KB Output is correct
60 Correct 47 ms 4960 KB Output is correct
61 Correct 47 ms 5440 KB Output is correct
62 Correct 101 ms 12516 KB Output is correct
63 Correct 79 ms 12644 KB Output is correct
64 Correct 138 ms 13656 KB Output is correct
65 Correct 492 ms 38096 KB Output is correct
66 Correct 613 ms 41952 KB Output is correct
67 Correct 13 ms 7404 KB Output is correct
68 Correct 7 ms 1132 KB Output is correct
69 Correct 689 ms 75128 KB Output is correct
70 Correct 1056 ms 77084 KB Output is correct
71 Correct 1499 ms 85968 KB Output is correct
72 Correct 1387 ms 84976 KB Output is correct
73 Correct 1410 ms 82172 KB Output is correct
74 Correct 1051 ms 78000 KB Output is correct
75 Correct 1034 ms 75176 KB Output is correct