Submission #320750

# Submission time Handle Problem Language Result Execution time Memory
320750 2020-11-09T18:16:37 Z MiricaMatei Carnival Tickets (IOI20_tickets) C++14
100 / 100
963 ms 98460 KB
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

const int MAXN = 1505;

struct Srt {
  int s;
  int i, j;
  bool operator <(const Srt& other) const {
    return s < other.s;
  }
};

int l[MAXN], r[MAXN];

/*void allocate_tickets(vector<vector<int> >v) {
  for (auto it1:v) {
    for (auto it2:it1)
      cout << it2 << ' ';
    cout << '\n';
  }
}*/

long long find_maximum(int k, vector<vector<int> >v) {
  int n = v.size();
  int m = v[0].size();
  vector<vector<int> >s;
  vector<int>aux(m, -1);
  for (int i = 0; i < n; ++i) {
    s.push_back(aux);
    r[i] = m - 1;
  }
  vector<Srt>srt;
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = r[i]; j >= r[i] - k + 1; --j)
      ans += v[i][j];
    r[i] = r[i] - k + 1;
    for (int j = 0; j + m - k < m; ++j)
      srt.push_back({v[i][j] + v[i][j + m - k], i, j});
  }
  sort(srt.begin(), srt.end());
  for (int i = 0; i < n * k / 2; ++i) {
    ans -= srt[i].s;
    r[srt[i].i]++;
    l[srt[i].i]++;
  }
  vector<int>vis(n);
  while (k--) {
    int pl = n / 2, mn = n / 2;
    for (int i = 0; i < n; ++i) {
      if (l[i] == 0) {
        pl--;
        s[i][r[i]] = k;
        r[i]++;
        vis[i] = 1;
      } else if (r[i] == m) {
        mn--;
        l[i]--;
        s[i][l[i]] = k;
        vis[i] = 1;
      }
    }
    for (int i = 0; i < n; ++i) {
      if (vis[i]) {
        vis[i] = 0;
        continue;
      }
      if (mn && l[i]) {
        mn--;
        l[i]--;
        s[i][l[i]] = k;
      } else {
        pl--;
        s[i][r[i]] = k;
        r[i]++;
      }
    }
  }
  allocate_tickets(s);
  return ans;
}

/*int main() {
  freopen("date.in", "r", stdin);
  freopen("date.out", "w", stdout);

  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int> >v;
  for (int i = 0; i < n; ++i) {
    vector<int>g(m);
    for (int j = 0; j < m; ++j)
      cin >> g[j];
    v.push_back(g);
  }

  cout << find_maximum(k, v);

  return 0;
}*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 27 ms 2404 KB Output is correct
6 Correct 662 ms 51556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 25 ms 2664 KB Output is correct
6 Correct 623 ms 57884 KB Output is correct
7 Correct 648 ms 62436 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 7 ms 1072 KB Output is correct
13 Correct 22 ms 2660 KB Output is correct
14 Correct 22 ms 2788 KB Output is correct
15 Correct 667 ms 70208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 37 ms 4196 KB Output is correct
6 Correct 6 ms 1004 KB Output is correct
7 Correct 7 ms 1200 KB Output is correct
8 Correct 963 ms 98204 KB Output is correct
9 Correct 885 ms 95184 KB Output is correct
10 Correct 931 ms 95096 KB Output is correct
11 Correct 943 ms 98204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 28 ms 3308 KB Output is correct
14 Correct 28 ms 3308 KB Output is correct
15 Correct 32 ms 3560 KB Output is correct
16 Correct 38 ms 4068 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 28 ms 3172 KB Output is correct
21 Correct 34 ms 3684 KB Output is correct
22 Correct 30 ms 3428 KB Output is correct
23 Correct 35 ms 3944 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 27 ms 2404 KB Output is correct
12 Correct 662 ms 51556 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 25 ms 2664 KB Output is correct
18 Correct 623 ms 57884 KB Output is correct
19 Correct 648 ms 62436 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 7 ms 1072 KB Output is correct
25 Correct 22 ms 2660 KB Output is correct
26 Correct 22 ms 2788 KB Output is correct
27 Correct 667 ms 70208 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 37 ms 4196 KB Output is correct
33 Correct 6 ms 1004 KB Output is correct
34 Correct 7 ms 1200 KB Output is correct
35 Correct 963 ms 98204 KB Output is correct
36 Correct 885 ms 95184 KB Output is correct
37 Correct 931 ms 95096 KB Output is correct
38 Correct 943 ms 98204 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 3 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 28 ms 3308 KB Output is correct
52 Correct 28 ms 3308 KB Output is correct
53 Correct 32 ms 3560 KB Output is correct
54 Correct 38 ms 4068 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 28 ms 3172 KB Output is correct
59 Correct 34 ms 3684 KB Output is correct
60 Correct 30 ms 3428 KB Output is correct
61 Correct 35 ms 3944 KB Output is correct
62 Correct 78 ms 8676 KB Output is correct
63 Correct 76 ms 8680 KB Output is correct
64 Correct 102 ms 10720 KB Output is correct
65 Correct 350 ms 35656 KB Output is correct
66 Correct 412 ms 41552 KB Output is correct
67 Correct 7 ms 1200 KB Output is correct
68 Correct 6 ms 1004 KB Output is correct
69 Correct 665 ms 73212 KB Output is correct
70 Correct 814 ms 79644 KB Output is correct
71 Correct 949 ms 98460 KB Output is correct
72 Correct 729 ms 83892 KB Output is correct
73 Correct 880 ms 88224 KB Output is correct
74 Correct 659 ms 65692 KB Output is correct
75 Correct 782 ms 78112 KB Output is correct