oj.uz

Submission #395568

# Submission time Handle Problem Language Result Execution time Memory
395568 2021-04-28T14:43:15 Z fedoseevtimofey Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1027 ms 114404 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
#include <bitset>
#include <chrono>
#include "tickets.h"

using namespace std;
 
typedef long long ll;

long long find_maximum(int k, vector <vector <int>> x) {
	int n = x.size();
	int m = x[0].size();
  vector <vector <int>> p(n, vector <int> (m));
  vector <int> cnt(n);
  ll score = 0;
  vector <pair <ll, int>> q;

  auto add = [&] (int id, int j) {
    ll bg = x[id][p[id][m - j - 1]];
    ll sm = x[id][p[id][k - j - 1]];
    q.push_back({bg + sm, id});
  };  

  for (int i = 0; i < n; ++i) {
    iota(p[i].begin(), p[i].end(), 0);
    sort(p[i].begin(), p[i].end(), [&] (int f, int s) {
      return x[i][f] < x[i][s];
    });
    for (int j = 0; j < k; ++j) {
      score -= x[i][p[i][j]];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < k; ++j) {
      add(i, j);
    }
  }
  sort(q.rbegin(), q.rend());
  for (int it = 0; it < k * n / 2; ++it) {
    score += q[it].first;
    ++cnt[q[it].second];
  }
  vector <vector <int>> ans(n, vector <int> (m, -1));
  int r = 0;
  for (int i = 0; i < n; ++i) {
    vector <int> used(k);
    for (int j = 0; j < cnt[i]; ++j) {
      ans[i][p[i][m - j - 1]] = r;
      used[r++] = 1;
      r %= k;
    }
    int uk = 0;
    for (int j = 0; j < k - cnt[i]; ++j) {
      while (used[uk]) ++uk;
      ans[i][p[i][j]] = uk++; 
    }
  }
	allocate_tickets(ans);
  return score;
}

#ifdef LOCAL 

static int n;
static int m;
static int k;
static std::vector<std::vector<int>> d;
static std::vector<std::vector<int>> x;
static int called = 0;

static void check(bool cond, std::string message) {
    if (!cond) {
        printf("%s\n", message.c_str());
        exit(0);
    }
}


void allocate_tickets( std::vector<std::vector<int>> _d) {
    check(!called, "allocate_tickets called more than once");
    d = _d;
    check((int)d.size() == n, "allocate_tickets called with parameter of wrong size");
    for (int i = 0; i < n; i++) {
        check((int)d[i].size() == m, "allocate_tickets called with parameter of wrong size");
    }
    called = 1;
}

int main() {
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
    cin >> n >> m >> k;
    x.resize(n);
    for (int i = 0; i < n; i++) {
        x[i].resize(m);
        for (int j=0; j < m; j++) {
          cin >> x[i][j];
        }
    }

    long long answer = find_maximum(k, x);
    check(called, "failure to call allocate_tickets");

    cout << answer << '\n';
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          cout << d[i][j] << ' ';
        }
        cout << '\n';
    }
}
#endif

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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 252 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 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 460 KB Output is correct
5 Correct 29 ms 2660 KB Output is correct
6 Correct 714 ms 60216 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 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 28 ms 3340 KB Output is correct
6 Correct 677 ms 75380 KB Output is correct
7 Correct 690 ms 81256 KB Output is correct
8 Correct 4 ms 720 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 1096 KB Output is correct
13 Correct 23 ms 3008 KB Output is correct
14 Correct 24 ms 3116 KB Output is correct
15 Correct 704 ms 86036 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 4 ms 568 KB Output is correct
5 Correct 39 ms 4728 KB Output is correct
6 Correct 7 ms 972 KB Output is correct
7 Correct 8 ms 1264 KB Output is correct
8 Correct 987 ms 93612 KB Output is correct
9 Correct 928 ms 91840 KB Output is correct
10 Correct 927 ms 91812 KB Output is correct
11 Correct 987 ms 93616 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 588 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 332 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 588 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 1 ms 332 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 30 ms 3516 KB Output is correct
14 Correct 30 ms 3528 KB Output is correct
15 Correct 36 ms 4020 KB Output is correct
16 Correct 39 ms 4656 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 564 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 32 ms 3648 KB Output is correct
21 Correct 35 ms 4128 KB Output is correct
22 Correct 35 ms 4004 KB Output is correct
23 Correct 36 ms 4404 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 252 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 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 460 KB Output is correct
11 Correct 29 ms 2660 KB Output is correct
12 Correct 714 ms 60216 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 28 ms 3340 KB Output is correct
18 Correct 677 ms 75380 KB Output is correct
19 Correct 690 ms 81256 KB Output is correct
20 Correct 4 ms 720 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 1096 KB Output is correct
25 Correct 23 ms 3008 KB Output is correct
26 Correct 24 ms 3116 KB Output is correct
27 Correct 704 ms 86036 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 4 ms 568 KB Output is correct
32 Correct 39 ms 4728 KB Output is correct
33 Correct 7 ms 972 KB Output is correct
34 Correct 8 ms 1264 KB Output is correct
35 Correct 987 ms 93612 KB Output is correct
36 Correct 928 ms 91840 KB Output is correct
37 Correct 927 ms 91812 KB Output is correct
38 Correct 987 ms 93616 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 588 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 1 ms 332 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 30 ms 3516 KB Output is correct
52 Correct 30 ms 3528 KB Output is correct
53 Correct 36 ms 4020 KB Output is correct
54 Correct 39 ms 4656 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 564 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 32 ms 3648 KB Output is correct
59 Correct 35 ms 4128 KB Output is correct
60 Correct 35 ms 4004 KB Output is correct
61 Correct 36 ms 4404 KB Output is correct
62 Correct 83 ms 9412 KB Output is correct
63 Correct 81 ms 9384 KB Output is correct
64 Correct 107 ms 12576 KB Output is correct
65 Correct 373 ms 41380 KB Output is correct
66 Correct 445 ms 49316 KB Output is correct
67 Correct 8 ms 1272 KB Output is correct
68 Correct 7 ms 976 KB Output is correct
69 Correct 759 ms 81904 KB Output is correct
70 Correct 889 ms 92776 KB Output is correct
71 Correct 1027 ms 114404 KB Output is correct
72 Correct 929 ms 100072 KB Output is correct
73 Correct 955 ms 104676 KB Output is correct
74 Correct 779 ms 78732 KB Output is correct
75 Correct 880 ms 90988 KB Output is correct