#include "tickets.h"
#include <vector>
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double;
long long find_maximum(int k, vector<vector<int>> x) {
int n = sz(x);
int m = sz(x[0]);
vector<vector<int> > res(n, vector<int>(m, -1));
vector<int> h(n, 0), l(n, k);
long long sum = 0;
vector<pair<int, int> > st;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
st.emplace_back(x[i][k - j - 1] + x[i][m - j - 1], i);
sum -= x[i][j];
}
}
sort(rall(st));
for (int i = 0; i < n * k / 2; i++) {
sum += st[i].first;
h[st[i].second]++;
l[st[i].second]--;
}
for (int col = 0; col < k; col++) {
int U = n / 2, L = n / 2;
vector<bool> bad(n, false);
for(int i = 0; i < n; i++) {
if (h[i] == 0) {
l[i]--;
res[i][l[i]] = col;
bad[i] = true;
L--;
} else if (l[i] == 0) {
h[i]--;
res[i][m - h[i] - 1] = col;
bad[i] = true;
U--;
}
}
for (int i = 0; i < n; i++) {
if (!bad[i]) {
if (U) {
h[i]--;
res[i][m - h[i] - 1] = col;
bad[i] = true;
U--;
} else {
l[i]--;
res[i][l[i]] = col;
bad[i] = true;
L--;
}
}
}
}
allocate_tickets(res);
return sum;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
30 ms |
2432 KB |
Output is correct |
6 |
Correct |
711 ms |
51468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
25 ms |
2456 KB |
Output is correct |
6 |
Correct |
603 ms |
53520 KB |
Output is correct |
7 |
Correct |
622 ms |
56524 KB |
Output is correct |
8 |
Correct |
4 ms |
812 KB |
Output is correct |
9 |
Correct |
0 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
256 KB |
Output is correct |
11 |
Correct |
0 ms |
256 KB |
Output is correct |
12 |
Correct |
7 ms |
904 KB |
Output is correct |
13 |
Correct |
21 ms |
2296 KB |
Output is correct |
14 |
Correct |
22 ms |
2428 KB |
Output is correct |
15 |
Correct |
637 ms |
58824 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
39 ms |
2796 KB |
Output is correct |
6 |
Correct |
6 ms |
768 KB |
Output is correct |
7 |
Correct |
8 ms |
1024 KB |
Output is correct |
8 |
Correct |
1002 ms |
62372 KB |
Output is correct |
9 |
Correct |
922 ms |
58192 KB |
Output is correct |
10 |
Correct |
938 ms |
58148 KB |
Output is correct |
11 |
Correct |
966 ms |
62244 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
512 KB |
Output is correct |
3 |
Correct |
3 ms |
512 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
4 ms |
512 KB |
Output is correct |
6 |
Correct |
3 ms |
512 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
3 ms |
512 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
11 |
Correct |
3 ms |
512 KB |
Output is correct |
12 |
Correct |
3 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
512 KB |
Output is correct |
3 |
Correct |
3 ms |
512 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
4 ms |
512 KB |
Output is correct |
6 |
Correct |
3 ms |
512 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
3 ms |
512 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
11 |
Correct |
3 ms |
512 KB |
Output is correct |
12 |
Correct |
3 ms |
512 KB |
Output is correct |
13 |
Correct |
30 ms |
2424 KB |
Output is correct |
14 |
Correct |
30 ms |
2456 KB |
Output is correct |
15 |
Correct |
35 ms |
2544 KB |
Output is correct |
16 |
Correct |
40 ms |
2796 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
3 ms |
512 KB |
Output is correct |
19 |
Correct |
2 ms |
384 KB |
Output is correct |
20 |
Correct |
29 ms |
2552 KB |
Output is correct |
21 |
Correct |
34 ms |
2544 KB |
Output is correct |
22 |
Correct |
33 ms |
2668 KB |
Output is correct |
23 |
Correct |
37 ms |
2676 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
768 KB |
Output is correct |
7 |
Correct |
0 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
0 ms |
256 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
11 |
Correct |
30 ms |
2432 KB |
Output is correct |
12 |
Correct |
711 ms |
51468 KB |
Output is correct |
13 |
Correct |
1 ms |
256 KB |
Output is correct |
14 |
Correct |
0 ms |
256 KB |
Output is correct |
15 |
Correct |
1 ms |
256 KB |
Output is correct |
16 |
Correct |
2 ms |
512 KB |
Output is correct |
17 |
Correct |
25 ms |
2456 KB |
Output is correct |
18 |
Correct |
603 ms |
53520 KB |
Output is correct |
19 |
Correct |
622 ms |
56524 KB |
Output is correct |
20 |
Correct |
4 ms |
812 KB |
Output is correct |
21 |
Correct |
0 ms |
256 KB |
Output is correct |
22 |
Correct |
1 ms |
256 KB |
Output is correct |
23 |
Correct |
0 ms |
256 KB |
Output is correct |
24 |
Correct |
7 ms |
904 KB |
Output is correct |
25 |
Correct |
21 ms |
2296 KB |
Output is correct |
26 |
Correct |
22 ms |
2428 KB |
Output is correct |
27 |
Correct |
637 ms |
58824 KB |
Output is correct |
28 |
Correct |
0 ms |
256 KB |
Output is correct |
29 |
Correct |
1 ms |
256 KB |
Output is correct |
30 |
Correct |
0 ms |
256 KB |
Output is correct |
31 |
Correct |
3 ms |
512 KB |
Output is correct |
32 |
Correct |
39 ms |
2796 KB |
Output is correct |
33 |
Correct |
6 ms |
768 KB |
Output is correct |
34 |
Correct |
8 ms |
1024 KB |
Output is correct |
35 |
Correct |
1002 ms |
62372 KB |
Output is correct |
36 |
Correct |
922 ms |
58192 KB |
Output is correct |
37 |
Correct |
938 ms |
58148 KB |
Output is correct |
38 |
Correct |
966 ms |
62244 KB |
Output is correct |
39 |
Correct |
0 ms |
256 KB |
Output is correct |
40 |
Correct |
3 ms |
512 KB |
Output is correct |
41 |
Correct |
3 ms |
512 KB |
Output is correct |
42 |
Correct |
3 ms |
512 KB |
Output is correct |
43 |
Correct |
4 ms |
512 KB |
Output is correct |
44 |
Correct |
3 ms |
512 KB |
Output is correct |
45 |
Correct |
1 ms |
384 KB |
Output is correct |
46 |
Correct |
1 ms |
384 KB |
Output is correct |
47 |
Correct |
3 ms |
512 KB |
Output is correct |
48 |
Correct |
3 ms |
512 KB |
Output is correct |
49 |
Correct |
3 ms |
512 KB |
Output is correct |
50 |
Correct |
3 ms |
512 KB |
Output is correct |
51 |
Correct |
30 ms |
2424 KB |
Output is correct |
52 |
Correct |
30 ms |
2456 KB |
Output is correct |
53 |
Correct |
35 ms |
2544 KB |
Output is correct |
54 |
Correct |
40 ms |
2796 KB |
Output is correct |
55 |
Correct |
2 ms |
384 KB |
Output is correct |
56 |
Correct |
3 ms |
512 KB |
Output is correct |
57 |
Correct |
2 ms |
384 KB |
Output is correct |
58 |
Correct |
29 ms |
2552 KB |
Output is correct |
59 |
Correct |
34 ms |
2544 KB |
Output is correct |
60 |
Correct |
33 ms |
2668 KB |
Output is correct |
61 |
Correct |
37 ms |
2676 KB |
Output is correct |
62 |
Correct |
80 ms |
6044 KB |
Output is correct |
63 |
Correct |
88 ms |
6136 KB |
Output is correct |
64 |
Correct |
107 ms |
7276 KB |
Output is correct |
65 |
Correct |
392 ms |
24032 KB |
Output is correct |
66 |
Correct |
429 ms |
27860 KB |
Output is correct |
67 |
Correct |
8 ms |
1024 KB |
Output is correct |
68 |
Correct |
7 ms |
768 KB |
Output is correct |
69 |
Correct |
723 ms |
57720 KB |
Output is correct |
70 |
Correct |
858 ms |
75080 KB |
Output is correct |
71 |
Correct |
998 ms |
84072 KB |
Output is correct |
72 |
Correct |
819 ms |
67864 KB |
Output is correct |
73 |
Correct |
923 ms |
64400 KB |
Output is correct |
74 |
Correct |
695 ms |
52540 KB |
Output is correct |
75 |
Correct |
814 ms |
52284 KB |
Output is correct |