#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define SZ(a) ((int)a.size())
#define pb push_back
const ll INF=1e18;
ll find_maximum(int k, vector<vector<int>> x)
{
int n = x.size();
int m = x[0].size();
int tar=n*k/2;
ll sum=0;
vector<vector<int>> answer(n,vector<int>(m,-1)),que(n,vector<int>(k,0));
vector<int> cnt(n,0),num(n,0),nw(n,0),tp(n,0),pl(n,0);
priority_queue<pii> pq;
for(int i=0;i<n;++i)
{
for(int j=0;j<k;++j)
sum-=x[i][j];
for(int j=1;j<=k;++j)
que[i][j-1]=x[i][k-j]+x[i][m-j];
pq.push(pii(que[i][0],i));
}
for(int i=0;i<tar;++i)
{
auto u=pq.top();
pq.pop();
++cnt[u.Y],++pl[u.Y],sum+=u.X,pq.push(pii(que[u.Y][pl[u.Y]],u.Y));
}
for(int i=0;i<n;++i)
nw[i]=k-cnt[i],num[i]=i,tp[i]=cnt[i];
for(int i=0;i<k;++i)
{
sort(ALL(num),[&](int a,int b){return cnt[a]>cnt[b];});
for(int j=0;j<n/2;++j)
answer[num[j]][m-tp[num[j]]+(--cnt[num[j]])]=i;
for(int j=n/2;j<n;++j)
answer[num[j]][--nw[num[j]]]=i;
}
allocate_tickets(answer);
return sum;
}
# |
Verdict |
Execution time |
Memory |
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 |
3 ms |
896 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
31 ms |
2376 KB |
Output is correct |
6 |
Correct |
748 ms |
51576 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
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 |
3 ms |
512 KB |
Output is correct |
5 |
Incorrect |
26 ms |
2552 KB |
Contestant returned 22495 but the tickets gives a total value of 68100 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
360 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 |
2812 KB |
Output is correct |
6 |
Correct |
8 ms |
768 KB |
Output is correct |
7 |
Correct |
8 ms |
1024 KB |
Output is correct |
8 |
Correct |
981 ms |
63272 KB |
Output is correct |
9 |
Correct |
907 ms |
59000 KB |
Output is correct |
10 |
Correct |
907 ms |
59180 KB |
Output is correct |
11 |
Correct |
973 ms |
63224 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
4 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 |
512 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
4 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 |
512 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 |
32 ms |
2424 KB |
Output is correct |
14 |
Correct |
32 ms |
2424 KB |
Output is correct |
15 |
Correct |
35 ms |
2680 KB |
Output is correct |
16 |
Correct |
38 ms |
2808 KB |
Output is correct |
17 |
Correct |
1 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 |
30 ms |
2552 KB |
Output is correct |
21 |
Correct |
36 ms |
2552 KB |
Output is correct |
22 |
Correct |
31 ms |
2680 KB |
Output is correct |
23 |
Correct |
37 ms |
2812 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
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 |
3 ms |
896 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 |
384 KB |
Output is correct |
10 |
Correct |
3 ms |
512 KB |
Output is correct |
11 |
Correct |
31 ms |
2376 KB |
Output is correct |
12 |
Correct |
748 ms |
51576 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 |
3 ms |
512 KB |
Output is correct |
17 |
Incorrect |
26 ms |
2552 KB |
Contestant returned 22495 but the tickets gives a total value of 68100 |
18 |
Halted |
0 ms |
0 KB |
- |