oj.uz

Submission #300700

# Submission time Handle Problem Language Result Execution time Memory
300700 2020-09-17T12:14:24 Z abeker Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1212 ms 62352 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

ll find_maximum(int K, vector <vector <int>> x) {
  int N = x.size();
  int M = x[0].size();
  ll sol = 0;
  vector <pii> diffs;
  for (int i = 0; i < N; i++)
    for (int j = 1; j <= K; j++) {
      diffs.push_back({x[i][K - j] + x[i][M - j], i});
      sol -= x[i][K - j];
    }
  sort(diffs.begin(), diffs.end(), greater <pii> ());
  vector <int> cnt(N);
  for (int i = 0; i < K * N / 2; i++) {
    cnt[diffs[i].second]++;
    sol += diffs[i].first;
  }
  vector <int> lo(N, 0), hi(N, M - 1);
  vector <vector <int>> round(N, vector <int> (M, -1));
  for (int k = 0; k < K; k++) {
    vector <pii> sorted;
    for (int i = 0; i < N; i++)
      sorted.push_back({cnt[i], i});
    sort(sorted.begin(), sorted.end(), greater <pii> ());
    for (int i = 0; i < N; i++) {
      int colour = sorted[i].second;
      if (i < N / 2) {
        round[colour][hi[colour]--] = k;
        cnt[colour]--;
      }
      else 
        round[colour][lo[colour]++] = k;
    }
  }
  allocate_tickets(round);
  return sol;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 33 ms 2424 KB Output is correct
6 Correct 816 ms 51472 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 34 ms 2428 KB Output is correct
6 Correct 734 ms 53436 KB Output is correct
7 Correct 801 ms 56508 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 8 ms 904 KB Output is correct
13 Correct 25 ms 2300 KB Output is correct
14 Correct 24 ms 2300 KB Output is correct
15 Correct 772 ms 58684 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 45 ms 2808 KB Output is correct
6 Correct 8 ms 768 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 1183 ms 62224 KB Output is correct
9 Correct 1121 ms 58148 KB Output is correct
10 Correct 1159 ms 58136 KB Output is correct
11 Correct 1212 ms 62232 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 31 ms 2432 KB Output is correct
14 Correct 34 ms 2424 KB Output is correct
15 Correct 39 ms 2540 KB Output is correct
16 Correct 45 ms 2804 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 35 ms 2544 KB Output is correct
21 Correct 44 ms 2552 KB Output is correct
22 Correct 39 ms 2668 KB Output is correct
23 Correct 42 ms 2668 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 33 ms 2424 KB Output is correct
12 Correct 816 ms 51472 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 34 ms 2428 KB Output is correct
18 Correct 734 ms 53436 KB Output is correct
19 Correct 801 ms 56508 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 8 ms 904 KB Output is correct
25 Correct 25 ms 2300 KB Output is correct
26 Correct 24 ms 2300 KB Output is correct
27 Correct 772 ms 58684 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 45 ms 2808 KB Output is correct
33 Correct 8 ms 768 KB Output is correct
34 Correct 12 ms 1024 KB Output is correct
35 Correct 1183 ms 62224 KB Output is correct
36 Correct 1121 ms 58148 KB Output is correct
37 Correct 1159 ms 58136 KB Output is correct
38 Correct 1212 ms 62232 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 31 ms 2432 KB Output is correct
52 Correct 34 ms 2424 KB Output is correct
53 Correct 39 ms 2540 KB Output is correct
54 Correct 45 ms 2804 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 35 ms 2544 KB Output is correct
59 Correct 44 ms 2552 KB Output is correct
60 Correct 39 ms 2668 KB Output is correct
61 Correct 42 ms 2668 KB Output is correct
62 Correct 87 ms 6136 KB Output is correct
63 Correct 85 ms 6140 KB Output is correct
64 Correct 123 ms 7268 KB Output is correct
65 Correct 439 ms 24160 KB Output is correct
66 Correct 514 ms 27984 KB Output is correct
67 Correct 11 ms 1024 KB Output is correct
68 Correct 11 ms 768 KB Output is correct
69 Correct 799 ms 51444 KB Output is correct
70 Correct 983 ms 53436 KB Output is correct
71 Correct 1196 ms 62352 KB Output is correct
72 Correct 1125 ms 59660 KB Output is correct
73 Correct 1190 ms 59028 KB Output is correct
74 Correct 866 ms 52556 KB Output is correct
75 Correct 980 ms 52404 KB Output is correct