#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define gc getchar()
#define pc(x) putchar(x)
template<typename T> void scan(T &x){x = 0;bool _=0;T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=char(n%10+48);n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
template<typename First, typename ... Ints> void scan(First &arg, Ints&... rest){scan(arg);scan(rest...);}
template<typename T> void print(T n){printn(n);pc(10);}
template<typename First, typename ... Ints> void print(First arg, Ints... rest){printn(arg);pc(32);print(rest...);}
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template<typename T>
void pr(T a){std::cerr<<a<<std::endl;}
template<typename T,typename... Args>
void pr(T a, Args... args) {std::cerr<<a<<' ',pr(args...);}
#else
template<typename... Args>
void pr(Args... args){}
#endif
using namespace std;
using ll = long long;
using pii = pair<ll, int>;
const int MM = 1505;
#ifndef ONLINE_JUDGE
void allocate_tickets(vector<vector<int>> s){
for(auto &i: s){
for(auto j: i)
cout<<j<<' ';
cout<<'\n';
}
}
#else
void allocate_tickets(vector<vector<int>> s);
#endif
priority_queue<pii, vector<pii>, greater<pii>> st;
int n, m, k;
vector<vector<int>> a;
int l[MM];
ll find_maximum(int _k, vector<vector<int>> _a){
a = move(_a);
n = size(a), m = size(a[0]), k = _k;
ll ans = 0;
for(int i = 0; i < n; i++){
st.emplace(a[i][0]+a[i][m-k+l[i]], i);
}
for(int tt = 0; tt < n*k/2; tt++){
assert(size(st));
auto i = st.top().second; st.pop();
l[i]++;
if(l[i] < k)
st.emplace(a[i][l[i]]+a[i][m-k+l[i]], i);
}
auto out = a;
for(int i = 0; i < n; i++){
fill(all(out[i]), -1);
}
ll suml = 0, sumr = 0;
int nx = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < l[i]; j++){
suml += a[i][j];
out[i][j] = nx;
nx = (nx+1)%k;
}
int cont = nx;
int cnt = k-l[i];
for(int j = m-1; cnt > 0; cnt--, j--){
sumr += a[i][j];
out[i][j] = cont;
cont = (cont+1)%k;
}
}
ans = sumr-suml;
allocate_tickets(out);
return ans;
}
#ifndef ONLINE_JUDGE
int main(){
int N, M, K;
scan(N, M, K);
vector<vector<int>> A(N);
for(int i = 0; i < N; i++){
A[i].resize(M);
for(int j = 0; j < M; j++)
scan(A[i][j]);
}
print(find_maximum(K, A));
// print(find_maximum(2, {{0, 2, 5},{1, 1, 3}}));
// print(find_maximum(1, {{5, 9}, {1, 4}, {3, 6}, {2, 7}}));
}
#endif
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
1 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 |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
31 ms |
2432 KB |
Output is correct |
6 |
Correct |
723 ms |
51588 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 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 |
2432 KB |
Output is correct |
6 |
Correct |
588 ms |
52472 KB |
Output is correct |
7 |
Correct |
604 ms |
52728 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
256 KB |
Output is correct |
11 |
Correct |
1 ms |
256 KB |
Output is correct |
12 |
Correct |
7 ms |
896 KB |
Output is correct |
13 |
Correct |
20 ms |
2044 KB |
Output is correct |
14 |
Correct |
21 ms |
2040 KB |
Output is correct |
15 |
Correct |
613 ms |
53368 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 |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
37 ms |
2428 KB |
Output is correct |
6 |
Correct |
6 ms |
640 KB |
Output is correct |
7 |
Correct |
7 ms |
896 KB |
Output is correct |
8 |
Correct |
888 ms |
54268 KB |
Output is correct |
9 |
Correct |
822 ms |
50808 KB |
Output is correct |
10 |
Correct |
832 ms |
50776 KB |
Output is correct |
11 |
Correct |
879 ms |
54264 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
512 KB |
Output is correct |
3 |
Correct |
4 ms |
512 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
3 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 |
5 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
512 KB |
Output is correct |
3 |
Correct |
4 ms |
512 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
3 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 |
5 ms |
512 KB |
Output is correct |
13 |
Correct |
30 ms |
2424 KB |
Output is correct |
14 |
Correct |
31 ms |
2428 KB |
Output is correct |
15 |
Correct |
32 ms |
2424 KB |
Output is correct |
16 |
Correct |
35 ms |
2424 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
4 ms |
512 KB |
Output is correct |
19 |
Correct |
1 ms |
384 KB |
Output is correct |
20 |
Correct |
26 ms |
2304 KB |
Output is correct |
21 |
Correct |
34 ms |
2424 KB |
Output is correct |
22 |
Correct |
28 ms |
2424 KB |
Output is correct |
23 |
Correct |
33 ms |
2424 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
1 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 |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
1 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
11 |
Correct |
31 ms |
2432 KB |
Output is correct |
12 |
Correct |
723 ms |
51588 KB |
Output is correct |
13 |
Correct |
1 ms |
256 KB |
Output is correct |
14 |
Correct |
1 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 |
2432 KB |
Output is correct |
18 |
Correct |
588 ms |
52472 KB |
Output is correct |
19 |
Correct |
604 ms |
52728 KB |
Output is correct |
20 |
Correct |
3 ms |
512 KB |
Output is correct |
21 |
Correct |
1 ms |
256 KB |
Output is correct |
22 |
Correct |
1 ms |
256 KB |
Output is correct |
23 |
Correct |
1 ms |
256 KB |
Output is correct |
24 |
Correct |
7 ms |
896 KB |
Output is correct |
25 |
Correct |
20 ms |
2044 KB |
Output is correct |
26 |
Correct |
21 ms |
2040 KB |
Output is correct |
27 |
Correct |
613 ms |
53368 KB |
Output is correct |
28 |
Correct |
0 ms |
256 KB |
Output is correct |
29 |
Correct |
0 ms |
256 KB |
Output is correct |
30 |
Correct |
1 ms |
256 KB |
Output is correct |
31 |
Correct |
3 ms |
512 KB |
Output is correct |
32 |
Correct |
37 ms |
2428 KB |
Output is correct |
33 |
Correct |
6 ms |
640 KB |
Output is correct |
34 |
Correct |
7 ms |
896 KB |
Output is correct |
35 |
Correct |
888 ms |
54268 KB |
Output is correct |
36 |
Correct |
822 ms |
50808 KB |
Output is correct |
37 |
Correct |
832 ms |
50776 KB |
Output is correct |
38 |
Correct |
879 ms |
54264 KB |
Output is correct |
39 |
Correct |
1 ms |
256 KB |
Output is correct |
40 |
Correct |
3 ms |
512 KB |
Output is correct |
41 |
Correct |
4 ms |
512 KB |
Output is correct |
42 |
Correct |
3 ms |
512 KB |
Output is correct |
43 |
Correct |
3 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 |
5 ms |
512 KB |
Output is correct |
51 |
Correct |
30 ms |
2424 KB |
Output is correct |
52 |
Correct |
31 ms |
2428 KB |
Output is correct |
53 |
Correct |
32 ms |
2424 KB |
Output is correct |
54 |
Correct |
35 ms |
2424 KB |
Output is correct |
55 |
Correct |
2 ms |
384 KB |
Output is correct |
56 |
Correct |
4 ms |
512 KB |
Output is correct |
57 |
Correct |
1 ms |
384 KB |
Output is correct |
58 |
Correct |
26 ms |
2304 KB |
Output is correct |
59 |
Correct |
34 ms |
2424 KB |
Output is correct |
60 |
Correct |
28 ms |
2424 KB |
Output is correct |
61 |
Correct |
33 ms |
2424 KB |
Output is correct |
62 |
Correct |
84 ms |
6008 KB |
Output is correct |
63 |
Correct |
81 ms |
6136 KB |
Output is correct |
64 |
Correct |
96 ms |
6264 KB |
Output is correct |
65 |
Correct |
357 ms |
23528 KB |
Output is correct |
66 |
Correct |
392 ms |
24060 KB |
Output is correct |
67 |
Correct |
7 ms |
928 KB |
Output is correct |
68 |
Correct |
7 ms |
640 KB |
Output is correct |
69 |
Correct |
707 ms |
51448 KB |
Output is correct |
70 |
Correct |
813 ms |
52576 KB |
Output is correct |
71 |
Correct |
897 ms |
54316 KB |
Output is correct |
72 |
Correct |
700 ms |
52344 KB |
Output is correct |
73 |
Correct |
835 ms |
52472 KB |
Output is correct |
74 |
Correct |
641 ms |
50680 KB |
Output is correct |
75 |
Correct |
784 ms |
50788 KB |
Output is correct |