oj.uz

Submission #540658

# Submission time Handle Problem Language Result Execution time Memory
540658 2022-03-21T10:47:02 Z MilosMilutinovic Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1002 ms 175604 KB 
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

/*
at every round we choose n / 2 mins and n / 2 maxs
value of round is sum_of_maxs - sum_of_mins
mx[i] + mn[i] > mx[j] + mn[j]
    ^ wrong
   
just image taking k mins and then find diffs next max - last min
sort everything and take greedy
works?
*/

long long find_maximum(int k, vector<vector<int>> x) {
  int n = x.size(), m = x[0].size();
  vector<vector<int>> ans(n, vector<int>(m, -1));
  long long sum = 0;      
  vector<tuple<long long, int, int, int>> ops;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < k; j++) {
      sum -= x[i][j];
      ans[i][j] = (i + j) % k;
    }                       
    for (int j = k - 1; j >= 0; j--) {
      ops.emplace_back(x[i][j] + x[i][m - (k - j)], i, j, m - (k - j));
    }
  }
  int take = (n / 2) * k;
  sort(ops.rbegin(), ops.rend());
  for (int id = 0; id < take; id++) {
    sum += get<0>(ops[id]);
    int i = get<1>(ops[id]);
    int jx = get<2>(ops[id]);
    int jy = get<3>(ops[id]);
    swap(ans[i][jx], ans[i][jy]);
  }
  /*vector<tuple<int, int, int>> vec;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (ans[i][j] != -1) {
        vec.emplace_back(x[i][j], i, j);
      }
    }
  }
  sort(vec.begin(), vec.end());
  int nxt = 0;
  for (int id = 0; id < vec.size(); id++) {
    int i = get<1>(vec[id]);
    int j = get<2>(vec[id]);
    who[i].push_back();
    ans[i][j] = nxt;
    if ((id + 1) % (
  }*/   
  sum = 0;
  vector<tuple<int, int, int>> vec;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (ans[i][j] != -1) {
        vec.emplace_back(x[i][j], i, j);
      }
    }
  }
  sort(vec.begin(), vec.end());
  int sz = vec.size();
  vector<vector<bool>> L(n, vector<bool>(m, false));
  vector<vector<bool>> R(n, vector<bool>(m, false));
  for (int i = 0; i < sz; i++) {
    if (i < sz / 2) {
      sum -= get<0>(vec[i]);
      L[get<1>(vec[i])][get<2>(vec[i])] = true;
    } else {
      sum += get<0>(vec[i]);
      R[get<1>(vec[i])][get<2>(vec[i])] = true;
    }
  }
  int nxt = 0;    
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (L[i][j]) {
        ans[i][j] = nxt;
        nxt = (nxt + 1) % k;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    vector<bool> was(k);       
    for (int j = 0; j < m; j++) {
      if (L[i][j]) {
        was[ans[i][j]] = true;
      }
    }              
    vector<int> vec;
    for (int j = 0; j < k; j++) {
      if (!was[j]) {
        vec.push_back(j);
      }
    }
    for (int j = 0; j < m; j++) {
      if (R[i][j]) {
        assert(vec.size() > 0);
        ans[i][j] = vec.back();
        vec.pop_back();
      }
    }
  }
  /*vector<vector<int>> vals(k);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (ans[i][j] == -1) {
        continue;
      }
      vals[ans[i][j]].push_back(x[i][j]);
    }
  }
  for (int i = 0; i < k; i++) {
    sort(vals[i].begin(), vals[i].end());
    for (int j = 0; j < n; j++) {
      if (j < n / 2) {
        sum -= vals[i][j];
      } else {
        sum += vals[i][j];
      }
    }
  }*/
  allocate_tickets(ans);
  return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 1 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

# Verdict Execution time Memory 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 2 ms 468 KB Output is correct
5 Correct 20 ms 2388 KB Output is correct
6 Correct 477 ms 52172 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory 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 2 ms 596 KB Output is correct
5 Correct 30 ms 3900 KB Output is correct
6 Correct 706 ms 91872 KB Output is correct
7 Correct 724 ms 105276 KB Output is correct
8 Correct 4 ms 980 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1360 KB Output is correct
13 Correct 23 ms 3888 KB Output is correct
14 Correct 24 ms 4172 KB Output is correct
15 Correct 722 ms 119340 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory 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 3 ms 724 KB Output is correct
5 Correct 36 ms 6900 KB Output is correct
6 Correct 5 ms 1240 KB Output is correct
7 Correct 8 ms 1720 KB Output is correct
8 Correct 990 ms 175576 KB Output is correct
9 Correct 931 ms 168660 KB Output is correct
10 Correct 911 ms 168764 KB Output is correct
11 Correct 973 ms 175604 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 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 696 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 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 696 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 20 ms 3252 KB Output is correct
14 Correct 21 ms 3376 KB Output is correct
15 Correct 28 ms 4552 KB Output is correct
16 Correct 37 ms 6972 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 696 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 36 ms 4472 KB Output is correct
21 Correct 31 ms 4916 KB Output is correct
22 Correct 36 ms 6108 KB Output is correct
23 Correct 34 ms 6584 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory 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 1 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 0 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 20 ms 2388 KB Output is correct
12 Correct 477 ms 52172 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 30 ms 3900 KB Output is correct
18 Correct 706 ms 91872 KB Output is correct
19 Correct 724 ms 105276 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 7 ms 1360 KB Output is correct
25 Correct 23 ms 3888 KB Output is correct
26 Correct 24 ms 4172 KB Output is correct
27 Correct 722 ms 119340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 36 ms 6900 KB Output is correct
33 Correct 5 ms 1240 KB Output is correct
34 Correct 8 ms 1720 KB Output is correct
35 Correct 990 ms 175576 KB Output is correct
36 Correct 931 ms 168660 KB Output is correct
37 Correct 911 ms 168764 KB Output is correct
38 Correct 973 ms 175604 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 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 696 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 3 ms 596 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 3 ms 700 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 20 ms 3252 KB Output is correct
52 Correct 21 ms 3376 KB Output is correct
53 Correct 28 ms 4552 KB Output is correct
54 Correct 37 ms 6972 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 696 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 36 ms 4472 KB Output is correct
59 Correct 31 ms 4916 KB Output is correct
60 Correct 36 ms 6108 KB Output is correct
61 Correct 34 ms 6584 KB Output is correct
62 Correct 54 ms 8592 KB Output is correct
63 Correct 55 ms 8600 KB Output is correct
64 Correct 104 ms 17516 KB Output is correct
65 Correct 327 ms 47696 KB Output is correct
66 Correct 416 ms 69288 KB Output is correct
67 Correct 7 ms 1620 KB Output is correct
68 Correct 6 ms 1340 KB Output is correct
69 Correct 499 ms 73940 KB Output is correct
70 Correct 711 ms 112848 KB Output is correct
71 Correct 1002 ms 175572 KB Output is correct
72 Correct 925 ms 157584 KB Output is correct
73 Correct 876 ms 143240 KB Output is correct
74 Correct 690 ms 101220 KB Output is correct
75 Correct 698 ms 112652 KB Output is correct