oj.uz

Submission #779620

# Submission time Handle Problem Language Result Execution time Memory
779620 2023-07-11T15:14:09 Z vjudge1 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 834 ms 107564 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#define all(x) (x).begin(),(x).end()
using namespace std;
#define sz(x) ((int)(x).size())
using ll = long long;
 
using pii = pair<int,int>;
 
void partition(int k, vector<vector<int>> wsign) {
  int n = sz(wsign), m = sz(wsign[0]);
  vector<pii> freq(n, pii{0, 0});
  vector<deque<int>> sorted(n);
  vector<vector<int>> rez(n, vector<int>(m, -1));
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < m; j++) if(wsign[i][j] == -1) sorted[i].emplace_back(j), freq[i].first++;
    for(int j = 0; j < m; j++) if(wsign[i][j] ==  1) sorted[i].emplace_back(j), freq[i].second++;      
  } 
  for(int Q = 0; Q < k; Q++) {
    vector<int> checked(n);
    
    vector<int> atr(n);
    iota(all(atr), 0);
    sort(all(atr), [&](auto a, auto b) { return freq[a].first > freq[b].first; });
    
    for(int T = 0, cnt = 0; cnt < n / 2 && T < n; T++) {
      int i = atr[T];
      if(checked[i]) continue;
      if(freq[i].first > 0) {
        rez[i][sorted[i].front()] = Q;
        sorted[i].pop_front();
        cnt++;
        checked[i] = 1;
        freq[i].first--;
      }
    }
    sort(all(atr), [&](auto a, auto b) { return freq[a].second > freq[b].second; });
    for(int T = 0, cnt = 0; cnt < n / 2 && T < n; T++) {
      int i = atr[T];
      if(checked[i]) continue;
      if(freq[i].second > 0) {
        rez[i][sorted[i].back()] = Q;
        sorted[i].pop_back();
        cnt++;
        checked[i] = 1;
        freq[i].second--;
      }
    }
  }
  
  allocate_tickets(rez);
  return;
}
 
const ll infll = 1e18 + 5;
const int nnmax = 300 + 5;
ll S2(int k, vector<vector<int>> d) {
  int n = sz(d), m = sz(d[0]);
  vector<vector<ll>> delta(n + 1);
  vector<int> mcount(n + 1, 0);
  
  reverse(all(d));
  d.emplace_back(vector<int>());
  reverse(all(d));
  
  set<pair<ll, int>> fmerge;
  ll sum = 0;
  for(int i = 1; i <= n; i++) {
    vector<int> tmp = d[i];
    sort(all(tmp));
    vector<ll> cost(k + 1);
    ll tmpsum = 0;
    for(int i = 0; i < k; i++) {
      tmpsum += tmp[i];
      cost[i + 1] -= tmpsum;
    }
    tmpsum = 0;
    for(int i = 0, j = sz(tmp) - 1; i < k; i++, j--) {
      tmpsum += tmp[j];
      cost[k - i - 1] += tmpsum;
    }
    sum += cost[0];
    fmerge.emplace(cost[1] - cost[0], i);
    //cerr << i << ' ' << cost[1] - cost[0] << '\n';
    delta[i] = cost;
  }
  
  for(int i = 0; i < n / 2 * k; i++) {
    auto [c, ptr] = *fmerge.rbegin();
    //cerr << sum << " --> " << sum + c << '\t' << ptr << '\n';
    sum += c;
    fmerge.erase(*fmerge.rbegin());
    mcount[ptr]++;
    if(mcount[ptr] == k) continue;
    fmerge.emplace(delta[ptr][mcount[ptr] + 1] - delta[ptr][mcount[ptr]], ptr);
  }
  
  int current = n / 2 * k;
  vector<vector<int>> wsign(n, vector<int>(m, 0));
  for(int i = n; i > 0; i--) {
    vector<int> atr(m);
    iota(all(atr), 0);
    sort(all(atr), [&](int a, int b) { return d[i][a] < d[i][b]; });
    int u = mcount[i];
    for(int j = 0; j < u; j++)
      wsign[i - 1][atr[j]] = -1;
    for(int j = m - 1, t = 0; t < k - u; t++, j--)
      wsign[i - 1][atr[j]] = 1;
  }
  partition(k, wsign);
  
  return sum;
}
long long find_maximum(int k, std::vector<std::vector<int>> d) {
    return S2(k, d);
}

Compilation message

tickets.cpp: In function 'll S2(int, std::vector<std::vector<int> >)':
tickets.cpp:98:7: warning: unused variable 'current' [-Wunused-variable]
   98 |   int current = n / 2 * k;
      |       ^~~~~~~

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 0 ms 340 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 2 ms 2004 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 596 KB Output is correct
5 Correct 19 ms 3668 KB Output is correct
6 Correct 484 ms 79104 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 20 ms 4052 KB Output is correct
6 Correct 512 ms 92580 KB Output is correct
7 Correct 610 ms 96952 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 0 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 6 ms 1236 KB Output is correct
13 Correct 17 ms 3712 KB Output is correct
14 Correct 18 ms 3684 KB Output is correct
15 Correct 572 ms 102116 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 2 ms 596 KB Output is correct
5 Correct 29 ms 4656 KB Output is correct
6 Correct 5 ms 964 KB Output is correct
7 Correct 7 ms 2388 KB Output is correct
8 Correct 812 ms 107440 KB Output is correct
9 Correct 802 ms 100072 KB Output is correct
10 Correct 754 ms 100388 KB Output is correct
11 Correct 828 ms 107564 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 20 ms 3668 KB Output is correct
14 Correct 25 ms 3620 KB Output is correct
15 Correct 24 ms 4064 KB Output is correct
16 Correct 29 ms 4736 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 24 ms 4152 KB Output is correct
21 Correct 25 ms 4132 KB Output is correct
22 Correct 35 ms 4336 KB Output is correct
23 Correct 28 ms 4332 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 0 ms 340 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 2 ms 2004 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 596 KB Output is correct
11 Correct 19 ms 3668 KB Output is correct
12 Correct 484 ms 79104 KB Output is correct
13 Correct 1 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 20 ms 4052 KB Output is correct
18 Correct 512 ms 92580 KB Output is correct
19 Correct 610 ms 96952 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 0 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 6 ms 1236 KB Output is correct
25 Correct 17 ms 3712 KB Output is correct
26 Correct 18 ms 3684 KB Output is correct
27 Correct 572 ms 102116 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 2 ms 596 KB Output is correct
32 Correct 29 ms 4656 KB Output is correct
33 Correct 5 ms 964 KB Output is correct
34 Correct 7 ms 2388 KB Output is correct
35 Correct 812 ms 107440 KB Output is correct
36 Correct 802 ms 100072 KB Output is correct
37 Correct 754 ms 100388 KB Output is correct
38 Correct 828 ms 107564 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 596 KB Output is correct
51 Correct 20 ms 3668 KB Output is correct
52 Correct 25 ms 3620 KB Output is correct
53 Correct 24 ms 4064 KB Output is correct
54 Correct 29 ms 4736 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 724 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 24 ms 4152 KB Output is correct
59 Correct 25 ms 4132 KB Output is correct
60 Correct 35 ms 4336 KB Output is correct
61 Correct 28 ms 4332 KB Output is correct
62 Correct 53 ms 9372 KB Output is correct
63 Correct 53 ms 9420 KB Output is correct
64 Correct 85 ms 12380 KB Output is correct
65 Correct 275 ms 41548 KB Output is correct
66 Correct 346 ms 47480 KB Output is correct
67 Correct 8 ms 2388 KB Output is correct
68 Correct 5 ms 980 KB Output is correct
69 Correct 496 ms 79260 KB Output is correct
70 Correct 635 ms 92040 KB Output is correct
71 Correct 834 ms 107404 KB Output is correct
72 Correct 729 ms 102464 KB Output is correct
73 Correct 792 ms 101728 KB Output is correct
74 Correct 640 ms 90856 KB Output is correct
75 Correct 633 ms 90396 KB Output is correct