oj.uz

Submission #770570

# Submission time Handle Problem Language Result Execution time Memory
770570 2023-07-01T13:29:55 Z bleahbleah Carnival Tickets (IOI20_tickets) C++17
90 / 100
 1857 ms 2097152 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#define all(x) (x).begin(),(x).end()
using namespace std;


using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 1500 + 5;

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>> dp(n + 1, vector<ll>(k * n / 2 + 2, -infll));
  vector<vector<int>> with(n + 1, vector<int>(k * n / 2 + 2, 0));
  reverse(all(d));
  d.emplace_back(vector<int>());
  reverse(all(d));
  //for(int j = 1; j < sz(dp[0]); j++) dp[0][j] = -infll;
  dp[0][0] = 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;
    }
    int lim = min(k * n / 2, i * k);
    for(int j = 0; j <= lim; j++) {
      int mnw = 0;
      dp[i][j] = -infll;
      for(int minus = 0; minus <= min(j, k); minus++) {
        if(dp[i - 1][j - minus] + cost[minus] > dp[i][j]) {
          mnw = minus;
          dp[i][j] = dp[i - 1][j - minus] + cost[minus];
        }
      }
      with[i][j] = mnw;
      //cerr << dp[i][j] << ' ';
    }
    //cerr << '\n';
  }
  //cerr << "finished\n";
  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]; });
    //cerr << sz(with[i]) << ' ' << current << '\n';
    int u = with[i][current];
    current -= u;
    //cerr << u << '\n';
    for(int j = 0; j < u; j++)
      //cerr << atr[j] << '\n',
      wsign[i - 1][atr[j]] = -1;
    for(int j = m - 1, t = 0; t < k - u; t++, j--)
      //cerr << atr[j] << '\n',
      wsign[i - 1][atr[j]] = 1;
  }
  //cerr << current << '\n';
  partition(k, wsign);
  //cerr << "better\n";
  ll sum = 0;
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < m; j++)
      //cerr << wsign[i][j] << ' ',
      sum += wsign[i][j] * d[i + 1][j];
    //cerr << '\n';
  }
  
  return sum;
}

ll S3(int k, vector<vector<int>> d) {
  int n = sz(d), m = sz(d[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(d[i][j] ==  0) sorted[i].emplace_back(j), freq[i].first++;
    for(int j = 0; j < m; j++) if(d[i][j] ==  1) sorted[i].emplace_back(j), freq[i].second++;      
  } 
  ll sum = 0;
  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; });
    
    int total = 0;
    
    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) {
        total++;
        rez[i][sorted[i].back()] = Q;
        sorted[i].pop_back();
        cnt++;
        checked[i] = 1;
        freq[i].second--;
      }
    }
    
    for(int T = 0; T < n; T++) {
      int i = atr[T];
      if(checked[i]) continue;
      if(freq[i].second > 0)
        total++,
        freq[i].second--;
      else
        freq[i].first--;
      rez[i][sorted[i].back()] = Q;
      sorted[i].pop_back();
      checked[i] = 1;
    }
    
    sum += min(total, n - total);
  }
  
  allocate_tickets(rez);
  return sum;
}
 

ll S4(int k, vector<vector<int>> d) { 
  vector<pii> values;
  int n = sz(d), m = sz(d[0]);
  for(int i = 0; i < n; i++) 
    for(int j = 0; j < m; j++) 
      values.emplace_back(i, j);
  sort(all(values), [&](auto a, auto b) { return d[a.first][a.second] < d[b.first][b.second]; });
  
  vector<vector<int>> signs(n, vector<int>(m, 1));
  for(int i = 0; i < n / 2 * k; i++)
    signs[values[i].first][values[i].second] = -1;
  
  partition(k, signs);
  ll sum = 0;
  for(auto [a, b] : values) {
    sum += d[a][b] * signs[a][b];
  }
  return sum;
  
}

ll S1(int k, vector<vector<int>> d) {
  int n = sz(d), m = 1;
  vector<vector<int>> rez(n, vector<int>(m, 0));
  allocate_tickets(rez);
  vector<int> v;
  for(auto a : d)
    for(auto x : a) v.emplace_back(x);
  sort(all(v));
  ll sum = 0;
  for(int i = 0; i < n; i++)
    sum += v[i];
  for(int i = 0; i < n / 2; i++)
    sum -= 2 * v[i];
  return sum;
}

long long find_maximum(int k, std::vector<std::vector<int>> d) {
  bool ok = 1;
  for(auto a : d)
    for(auto x : a)
      ok &= (x == 0 || x == 1);
  if(ok)
    return S3(k, d);
  else if(sz(d[0]) == 1) return S1(k, d);
  else if(k == sz(d[0])) 
    return S4(k, d);
  else
    return S2(k, d);
}


/**
      Anul asta se da centroid.
-- Surse oficiale
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 304 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 696 KB Output is correct
5 Correct 20 ms 5048 KB Output is correct
6 Correct 540 ms 94208 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 1 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 19 ms 3320 KB Output is correct
6 Correct 439 ms 72064 KB Output is correct
7 Correct 467 ms 72412 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 1012 KB Output is correct
13 Correct 16 ms 2876 KB Output is correct
14 Correct 17 ms 2764 KB Output is correct
15 Correct 454 ms 73620 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 28 ms 5252 KB Output is correct
6 Correct 5 ms 1080 KB Output is correct
7 Correct 6 ms 2384 KB Output is correct
8 Correct 906 ms 97680 KB Output is correct
9 Correct 778 ms 91048 KB Output is correct
10 Correct 809 ms 91224 KB Output is correct
11 Correct 833 ms 97744 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 596 KB Output is correct
3 Correct 2 ms 820 KB Output is correct
4 Correct 3 ms 1336 KB Output is correct
5 Correct 5 ms 2132 KB Output is correct
6 Correct 10 ms 2900 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 8 ms 2516 KB Output is correct
10 Correct 7 ms 2516 KB Output is correct
11 Correct 12 ms 3224 KB Output is correct
12 Correct 14 ms 3284 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 596 KB Output is correct
3 Correct 2 ms 820 KB Output is correct
4 Correct 3 ms 1336 KB Output is correct
5 Correct 5 ms 2132 KB Output is correct
6 Correct 10 ms 2900 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 8 ms 2516 KB Output is correct
10 Correct 7 ms 2516 KB Output is correct
11 Correct 12 ms 3224 KB Output is correct
12 Correct 14 ms 3284 KB Output is correct
13 Correct 19 ms 5620 KB Output is correct
14 Correct 25 ms 9772 KB Output is correct
15 Correct 593 ms 83860 KB Output is correct
16 Correct 27 ms 5192 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 5 ms 5076 KB Output is correct
19 Correct 3 ms 2772 KB Output is correct
20 Correct 982 ms 110108 KB Output is correct
21 Correct 910 ms 103664 KB Output is correct
22 Correct 1857 ms 153248 KB Output is correct
23 Correct 1783 ms 143696 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 304 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 20 ms 5048 KB Output is correct
12 Correct 540 ms 94208 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 19 ms 3320 KB Output is correct
18 Correct 439 ms 72064 KB Output is correct
19 Correct 467 ms 72412 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 1012 KB Output is correct
25 Correct 16 ms 2876 KB Output is correct
26 Correct 17 ms 2764 KB Output is correct
27 Correct 454 ms 73620 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 4 ms 620 KB Output is correct
32 Correct 28 ms 5252 KB Output is correct
33 Correct 5 ms 1080 KB Output is correct
34 Correct 6 ms 2384 KB Output is correct
35 Correct 906 ms 97680 KB Output is correct
36 Correct 778 ms 91048 KB Output is correct
37 Correct 809 ms 91224 KB Output is correct
38 Correct 833 ms 97744 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 820 KB Output is correct
42 Correct 3 ms 1336 KB Output is correct
43 Correct 5 ms 2132 KB Output is correct
44 Correct 10 ms 2900 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 8 ms 2516 KB Output is correct
48 Correct 7 ms 2516 KB Output is correct
49 Correct 12 ms 3224 KB Output is correct
50 Correct 14 ms 3284 KB Output is correct
51 Correct 19 ms 5620 KB Output is correct
52 Correct 25 ms 9772 KB Output is correct
53 Correct 593 ms 83860 KB Output is correct
54 Correct 27 ms 5192 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 5 ms 5076 KB Output is correct
57 Correct 3 ms 2772 KB Output is correct
58 Correct 982 ms 110108 KB Output is correct
59 Correct 910 ms 103664 KB Output is correct
60 Correct 1857 ms 153248 KB Output is correct
61 Correct 1783 ms 143696 KB Output is correct
62 Correct 53 ms 14148 KB Output is correct
63 Correct 67 ms 25964 KB Output is correct
64 Correct 79 ms 13092 KB Output is correct
65 Runtime error 690 ms 2097152 KB Execution killed with signal 9
66 Halted 0 ms 0 KB -