Submission #305947

# Submission time Handle Problem Language Result Execution time Memory
305947 2020-09-24T06:38:03 Z baluteshih Carnival Tickets (IOI20_tickets) C++14
100 / 100
957 ms 63352 KB
#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;
        if(pl[u.Y]<k)
            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 0 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 1024 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 Correct 30 ms 2424 KB Output is correct
6 Correct 731 ms 51576 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 2 ms 512 KB Output is correct
5 Correct 26 ms 2552 KB Output is correct
6 Correct 646 ms 56940 KB Output is correct
7 Correct 682 ms 58856 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 1 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 896 KB Output is correct
13 Correct 23 ms 2304 KB Output is correct
14 Correct 23 ms 2304 KB Output is correct
15 Correct 703 ms 60536 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 39 ms 2808 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 957 ms 63224 KB Output is correct
9 Correct 882 ms 59000 KB Output is correct
10 Correct 890 ms 59000 KB Output is correct
11 Correct 940 ms 63228 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 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 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 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 3 ms 512 KB Output is correct
13 Correct 31 ms 2424 KB Output is correct
14 Correct 31 ms 2456 KB Output is correct
15 Correct 34 ms 2552 KB Output is correct
16 Correct 36 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 29 ms 2552 KB Output is correct
21 Correct 33 ms 2560 KB Output is correct
22 Correct 31 ms 2680 KB Output is correct
23 Correct 38 ms 2816 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 1024 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 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 30 ms 2424 KB Output is correct
12 Correct 731 ms 51576 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 26 ms 2552 KB Output is correct
18 Correct 646 ms 56940 KB Output is correct
19 Correct 682 ms 58856 KB Output is correct
20 Correct 4 ms 640 KB Output is correct
21 Correct 1 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 896 KB Output is correct
25 Correct 23 ms 2304 KB Output is correct
26 Correct 23 ms 2304 KB Output is correct
27 Correct 703 ms 60536 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 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 39 ms 2808 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 8 ms 1024 KB Output is correct
35 Correct 957 ms 63224 KB Output is correct
36 Correct 882 ms 59000 KB Output is correct
37 Correct 890 ms 59000 KB Output is correct
38 Correct 940 ms 63228 KB Output is correct
39 Correct 1 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 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 3 ms 512 KB Output is correct
51 Correct 31 ms 2424 KB Output is correct
52 Correct 31 ms 2456 KB Output is correct
53 Correct 34 ms 2552 KB Output is correct
54 Correct 36 ms 2808 KB Output is correct
55 Correct 1 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 33 ms 2560 KB Output is correct
60 Correct 31 ms 2680 KB Output is correct
61 Correct 38 ms 2816 KB Output is correct
62 Correct 83 ms 6096 KB Output is correct
63 Correct 91 ms 6136 KB Output is correct
64 Correct 104 ms 7288 KB Output is correct
65 Correct 362 ms 25464 KB Output is correct
66 Correct 462 ms 28024 KB Output is correct
67 Correct 8 ms 1024 KB Output is correct
68 Correct 10 ms 768 KB Output is correct
69 Correct 739 ms 51724 KB Output is correct
70 Correct 832 ms 57076 KB Output is correct
71 Correct 948 ms 63352 KB Output is correct
72 Correct 762 ms 60664 KB Output is correct
73 Correct 889 ms 60280 KB Output is correct
74 Correct 681 ms 55644 KB Output is correct
75 Correct 803 ms 55712 KB Output is correct