Submission #833031

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
833031	2023-08-21T19:59:17 Z	mosiashvililuka	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	708 ms	136964 KB

tickets

#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,K,pas,PL[1509],LIM,st[1509],lst[1509],pi;
long long f[1509][1509],ANS[1509][1509];
pair <long long, long long> p[1509];
long long find_maximum(int Kk, std::vector<std::vector<int> > Xx) {
	/*int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);*/
    
    K=Kk;
    a=Xx.size();
    b=Xx[0].size();

    for(i=1; i<=a; i++){
        for(j=1; j<=b; j++){
            f[i][j]=Xx[i-1][j-1];
        }
    }

    /*for(i=1; i<=a; i++){
        sort(f[i]+1,f[i]+b+1);
    }*/

    for(i=1; i<=a; i++){
        for(j=1; j<=K; j++){
            pas-=f[i][j];
        }
    }

    vector <pair <long long, long long> > V;

    for(i=1; i<=a; i++){
        for(j=K; j>=1; j--){
            zx=f[i][b-(K-j)]+f[i][j];
            V.push_back({-zx,i});
        }
        st[i]=0;lst[i]=b;
    }

    sort(V.begin(),V.end());

    LIM=a/2LL*K;
    for(i=1; i<=LIM; i++){
        pas+=-V[i-1].first;
        //cout<<V[i-1].first<<" "<<V[i-1].second<<"   "<<pas<<"\n";
        lst[V[i-1].second]--;
        PL[V[i-1].second]++;
    }
	
    for(i=1; i<=a; i++){
        for(j=1; j<=b; j++){
            ANS[i][j]=-1;
        }
    }

    for(ii=0; ii<K; ii++){
        pi=0;
        for(i=1; i<=a; i++){
            pi++;
            p[pi]={PL[i],i};
        }
        sort(p+1,p+pi+1);
        for(i=a/2+1; i<=a; i++){
            c=p[i].second;
            lst[c]++;PL[c]--;
            d=lst[c];
            ANS[c][d]=ii;
        }
        
        for(i=1; i<=a/2; i++){
            c=p[i].second;
            st[c]++;
            d=st[c];
            ANS[c][d]=ii;
        }
    }

    //
    vector <vector <int> > ANSA;
    ANSA.resize(a);
    for(i=1; i<=a; i++){
        ANSA[i-1].resize(b);
        for(j=1; j<=b; j++){
            ANSA[i-1][j-1]=ANS[i][j];
        }
    }
    allocate_tickets(ANSA);
    //
    return pas;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	1 ms	2772 KB	Output is correct
6	Correct	6 ms	12756 KB	Output is correct

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	1236 KB	Output is correct
5	Correct	18 ms	6996 KB	Output is correct
6	Correct	403 ms	108604 KB	Output is correct

Subtask #3

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	1236 KB	Output is correct
5	Correct	18 ms	6860 KB	Output is correct
6	Correct	437 ms	102084 KB	Output is correct
7	Correct	481 ms	108012 KB	Output is correct
8	Correct	4 ms	1620 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	6 ms	2640 KB	Output is correct
13	Correct	17 ms	7992 KB	Output is correct
14	Correct	16 ms	5196 KB	Output is correct
15	Correct	506 ms	112652 KB	Output is correct

Subtask #4

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	1364 KB	Output is correct
5	Correct	26 ms	8008 KB	Output is correct
6	Correct	5 ms	1236 KB	Output is correct
7	Correct	9 ms	13524 KB	Output is correct
8	Correct	655 ms	115964 KB	Output is correct
9	Correct	680 ms	110844 KB	Output is correct
10	Correct	660 ms	108360 KB	Output is correct
11	Correct	708 ms	115936 KB	Output is correct

Subtask #5

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	2 ms	1272 KB	Output is correct
3	Correct	2 ms	1236 KB	Output is correct
4	Correct	2 ms	1236 KB	Output is correct
5	Correct	2 ms	1236 KB	Output is correct
6	Correct	2 ms	1364 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	980 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1364 KB	Output is correct
12	Correct	3 ms	1364 KB	Output is correct

Subtask #6

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	2 ms	1272 KB	Output is correct
3	Correct	2 ms	1236 KB	Output is correct
4	Correct	2 ms	1236 KB	Output is correct
5	Correct	2 ms	1236 KB	Output is correct
6	Correct	2 ms	1364 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	980 KB	Output is correct
9	Correct	2 ms	1236 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	2 ms	1364 KB	Output is correct
12	Correct	3 ms	1364 KB	Output is correct
13	Correct	18 ms	7124 KB	Output is correct
14	Correct	18 ms	7124 KB	Output is correct
15	Correct	21 ms	7500 KB	Output is correct
16	Correct	26 ms	8128 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	3 ms	3028 KB	Output is correct
19	Correct	2 ms	2880 KB	Output is correct
20	Correct	27 ms	7112 KB	Output is correct
21	Correct	23 ms	7496 KB	Output is correct
22	Correct	25 ms	7492 KB	Output is correct
23	Correct	26 ms	7876 KB	Output is correct

Subtask #7

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	1 ms	2772 KB	Output is correct
6	Correct	6 ms	12756 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	1236 KB	Output is correct
11	Correct	18 ms	6996 KB	Output is correct
12	Correct	403 ms	108604 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	2 ms	1236 KB	Output is correct
17	Correct	18 ms	6860 KB	Output is correct
18	Correct	437 ms	102084 KB	Output is correct
19	Correct	481 ms	108012 KB	Output is correct
20	Correct	4 ms	1620 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	6 ms	2640 KB	Output is correct
25	Correct	17 ms	7992 KB	Output is correct
26	Correct	16 ms	5196 KB	Output is correct
27	Correct	506 ms	112652 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	1364 KB	Output is correct
32	Correct	26 ms	8008 KB	Output is correct
33	Correct	5 ms	1236 KB	Output is correct
34	Correct	9 ms	13524 KB	Output is correct
35	Correct	655 ms	115964 KB	Output is correct
36	Correct	680 ms	110844 KB	Output is correct
37	Correct	660 ms	108360 KB	Output is correct
38	Correct	708 ms	115936 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	2 ms	1272 KB	Output is correct
41	Correct	2 ms	1236 KB	Output is correct
42	Correct	2 ms	1236 KB	Output is correct
43	Correct	2 ms	1236 KB	Output is correct
44	Correct	2 ms	1364 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	980 KB	Output is correct
47	Correct	2 ms	1236 KB	Output is correct
48	Correct	2 ms	1236 KB	Output is correct
49	Correct	2 ms	1364 KB	Output is correct
50	Correct	3 ms	1364 KB	Output is correct
51	Correct	18 ms	7124 KB	Output is correct
52	Correct	18 ms	7124 KB	Output is correct
53	Correct	21 ms	7500 KB	Output is correct
54	Correct	26 ms	8128 KB	Output is correct
55	Correct	1 ms	468 KB	Output is correct
56	Correct	3 ms	3028 KB	Output is correct
57	Correct	2 ms	2880 KB	Output is correct
58	Correct	27 ms	7112 KB	Output is correct
59	Correct	23 ms	7496 KB	Output is correct
60	Correct	25 ms	7492 KB	Output is correct
61	Correct	26 ms	7876 KB	Output is correct
62	Correct	46 ms	16340 KB	Output is correct
63	Correct	48 ms	16300 KB	Output is correct
64	Correct	73 ms	19536 KB	Output is correct
65	Correct	228 ms	61096 KB	Output is correct
66	Correct	282 ms	69052 KB	Output is correct
67	Correct	9 ms	13524 KB	Output is correct
68	Correct	4 ms	1236 KB	Output is correct
69	Correct	400 ms	108524 KB	Output is correct
70	Correct	539 ms	119420 KB	Output is correct
71	Correct	655 ms	136964 KB	Output is correct
72	Correct	654 ms	119880 KB	Output is correct
73	Correct	675 ms	130252 KB	Output is correct
74	Correct	505 ms	105696 KB	Output is correct
75	Correct	541 ms	116660 KB	Output is correct