oj.uz

Submission #300496

# Submission time Handle Problem Language Result Execution time Memory
300496 2020-09-17T08:10:52 Z guangxuan Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1821 ms 65780 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x2) {
	int n = x2.size();
	int m = x2[0].size();
	int all_x[n*m];
	for (int i = 0; i < n; i++) {
		for(int j=0;j<m;j++){
			all_x[i*m+j] = x2[i][j];
		}
	}
	sort(all_x,all_x+n*m);
    long long bans=0;
    vector<vector<int> > banswer;
    for(int mi=max(n*m/2-2,0);mi<min(n*m/2+2,n*m);mi++){
        vector<vector<int>> x = x2;
        int med = all_x[mi];
        cerr << med << endl;
        for (int i = 0; i < n; i++) {
            for(int j=0;j<m;j++){
                x[i][j] -= med;
                //printf("%d ",x[i][j]);
            }//puts("");
        }
        int l[n],r[n];
        int neg = 0;
        priority_queue<pair<int,int> >pq;
        for(int i=0;i<n;i++){
            l[i]=k;r[i]=m-1;
            for(int j=0;j<k;j++){
                if(x[i][j]>0){
                    l[i]=j;r[i]=m-1-(k-j);
                    break;
                }
            }
            //cerr<<l[i] << ' ' << r[i] << endl;
            if(l[i]&&x[i][r[i]]>=0){
                pq.push({x[i][r[i]]-abs(x[i][l[i]-1]),i});
            }
            neg+=l[i];
        }
        bool legit = 1;
        while(neg>n*k/2){
            if(!pq.size()){legit=0;break;}
            pair<int,int> ctop = pq.top();pq.pop();
            int i= ctop.second;
            neg--;
            l[i]--;r[i]--;
            if(l[i]&&x[i][r[i]]>=0){
                pq.push({x[i][r[i]]-abs(x[i][l[i]-1]),i});
            }
        }
        if(!legit||neg!=n*k/2)continue;
        long long ans = 0;
        vector<int> low[n], high[n];
        for(int i=0;i<n;i++){
            //cerr<<l[i] << ' ' << r[i] << endl;
            for(int j=0;j<l[i];j++){
                ans+=abs(x[i][j]);
                low[i].push_back(j);
                if(x[i][j]>0){legit=0;break;}
            }
            for(int j=m-1;j>r[i];j--){
                ans+=abs(x[i][j]);
                high[i].push_back(j);
                if(x[i][j]<0){legit=0;break;}
            }
        }
        if(!legit)continue;
        std::vector<std::vector<int>> answer(n,vector<int>(m,-1));
        pair<int,int> diff2id[n];
        /*for(int i=0;i<n;i++){
            printf("%d %d\n",l[i],r[i]);
            printf("lo: ");
            for(int j:low[i])printf("%d ",j);
            printf("high: ");
            for(int j:high[i])printf("%d ",j);
            puts("");
        }*/
        for(int r=0;r<k;r++){
            for(int i=0;i<n;i++)diff2id[i] = make_pair(high[i].size()-low[i].size(),i);
            sort(diff2id,diff2id+n);
            for(int i=0;i<n;i++){
                if(i<n/2){
                    int x = diff2id[i].second;
                    answer[x][low[x].back()] = r;
                    low[x].pop_back();
                }
                else{
                    int x = diff2id[i].second;
                    answer[x][high[x].back()] = r;
                    high[x].pop_back();
                }
            }
        }
        if(ans>bans){
            bans=ans;
            banswer=answer;
        }
    }
    
	allocate_tickets(banswer);
	return bans;
}

Subtask #1
11.0 / 11.0

# 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 4 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 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 36 ms 2560 KB Output is correct
6 Correct 898 ms 53568 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 41 ms 2816 KB Output is correct
6 Correct 1256 ms 59716 KB Output is correct
7 Correct 1448 ms 62540 KB Output is correct
8 Correct 6 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 1 ms 256 KB Output is correct
12 Correct 12 ms 988 KB Output is correct
13 Correct 40 ms 2560 KB Output is correct
14 Correct 37 ms 2560 KB Output is correct
15 Correct 1488 ms 63904 KB Output is correct

Subtask #4
14.0 / 14.0

# 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 4 ms 512 KB Output is correct
5 Correct 56 ms 3084 KB Output is correct
6 Correct 7 ms 772 KB Output is correct
7 Correct 11 ms 1152 KB Output is correct
8 Correct 1293 ms 65780 KB Output is correct
9 Correct 1287 ms 62168 KB Output is correct
10 Correct 1296 ms 61312 KB Output is correct
11 Correct 1464 ms 65668 KB Output is correct

Subtask #5
12.0 / 12.0

# 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 6 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 4 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 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# 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 6 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 4 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 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 36 ms 2560 KB Output is correct
14 Correct 55 ms 2552 KB Output is correct
15 Correct 51 ms 2816 KB Output is correct
16 Correct 44 ms 3084 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 8 ms 512 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 52 ms 2688 KB Output is correct
21 Correct 55 ms 2680 KB Output is correct
22 Correct 50 ms 2944 KB Output is correct
23 Correct 55 ms 2944 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 4 ms 896 KB Output is correct
7 Correct 1 ms 384 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 36 ms 2560 KB Output is correct
12 Correct 898 ms 53568 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 Correct 41 ms 2816 KB Output is correct
18 Correct 1256 ms 59716 KB Output is correct
19 Correct 1448 ms 62540 KB Output is correct
20 Correct 6 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 1 ms 256 KB Output is correct
24 Correct 12 ms 988 KB Output is correct
25 Correct 40 ms 2560 KB Output is correct
26 Correct 37 ms 2560 KB Output is correct
27 Correct 1488 ms 63904 KB Output is correct
28 Correct 1 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 4 ms 512 KB Output is correct
32 Correct 56 ms 3084 KB Output is correct
33 Correct 7 ms 772 KB Output is correct
34 Correct 11 ms 1152 KB Output is correct
35 Correct 1293 ms 65780 KB Output is correct
36 Correct 1287 ms 62168 KB Output is correct
37 Correct 1296 ms 61312 KB Output is correct
38 Correct 1464 ms 65668 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 6 ms 512 KB Output is correct
43 Correct 7 ms 512 KB Output is correct
44 Correct 4 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 4 ms 512 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 5 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 36 ms 2560 KB Output is correct
52 Correct 55 ms 2552 KB Output is correct
53 Correct 51 ms 2816 KB Output is correct
54 Correct 44 ms 3084 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 8 ms 512 KB Output is correct
57 Correct 3 ms 640 KB Output is correct
58 Correct 52 ms 2688 KB Output is correct
59 Correct 55 ms 2680 KB Output is correct
60 Correct 50 ms 2944 KB Output is correct
61 Correct 55 ms 2944 KB Output is correct
62 Correct 99 ms 6264 KB Output is correct
63 Correct 120 ms 6400 KB Output is correct
64 Correct 148 ms 7676 KB Output is correct
65 Correct 663 ms 26688 KB Output is correct
66 Correct 578 ms 28816 KB Output is correct
67 Correct 13 ms 1152 KB Output is correct
68 Correct 10 ms 768 KB Output is correct
69 Correct 930 ms 53656 KB Output is correct
70 Correct 1578 ms 59740 KB Output is correct
71 Correct 1333 ms 65672 KB Output is correct
72 Correct 1521 ms 63876 KB Output is correct
73 Correct 1821 ms 63480 KB Output is correct
74 Correct 1232 ms 57976 KB Output is correct
75 Correct 1601 ms 57936 KB Output is correct