oj.uz

Submission #433168

# Submission time Handle Problem Language Result Execution time Memory
433168 2021-06-19T03:20:25 Z Amylopectin Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1123 ms 144232 KB 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include "tickets.h"
//#include "grader.cpp"
using namespace std;
const long long mxn = 1610,mxm = 1e7 + 10;
struct ord
{
    long long nn,mm,vaa;
};
bool cmp2(const struct ord &l,const struct ord &r)
{
    return l.vaa < r.vaa;
}
struct we
{
    long long vaa,nn;
};
bool cmp(const struct we &l,const struct we &r)
{
    return l.vaa < r.vaa;
}
bool cmp3(const struct we &l,const struct we &r)
{
    return l.nn < r.nn;
}

struct ord po[mxm] = {};
struct we so[mxm] = {},cir[mxn] = {};
long long cans[mxn][mxn] = {},coun[mxn] = {},le[mxn] = {},ri[mxn] = {},coub[mxn] = {},fa[mxn] = {};
long long find_maximum(int k, vector<vector<int> > x)
{
	long long n = x.size(),i,j,ru = 0,su = 0,rul,rur;
	long long m = x[0].size();
	vector<vector<int>> ans;
	vector<int > ro;
	for(i=0; i<n; i++)
	{
        for(j=0; j<m; j++)
        {
            cans[i][j] = -1;
        }
	}
	if(m == k)
	{
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
            {
                po[ru] = {i,j,x[i][j]};
                ru ++;
            }
            cir[i].nn = i;
        }
        sort(po,po+ru,cmp2);
        for(i=0; i<ru/2; i++)
        {
            su -= po[i].vaa;
            cir[po[i].nn].vaa ++;
        }
        for(i=ru/2; i<ru; i++)
        {
            su += po[i].vaa;
        }
	}
	else
	{
        for(i=0; i<n; i++)
        {
            for(j=0; j<k; j++)
            {
//                printf("%d\n",x[i][j]);
                so[ru] = {x[i][j] + x[i][m-k+j],i};
                su -= x[i][j];
                ru ++;
            }
            cir[i].nn = i;
        }
        sort(so,so+ru,cmp);
        for(i=0; i<ru/2; i++)
        {
            cir[so[i].nn].vaa ++;
        }
        for(i=ru/2; i<ru; i++)
        {
            su += so[i].vaa;
        }
	}
	sort(cir,cir+n,cmp);
	for(i=0; i<n/2; i++)
	{
        le[i] = cir[i].nn;
    }
    for(i=n/2; i<n; i++)
    {
        ri[i-n/2] = cir[i].nn;
    }
    sort(cir,cir+n,cmp3);
    for(i=0; i<n; i++)
    {
        coub[i] = m-1;
    }
    for(i=0; i<k; i++)
    {
        rul = 0;
        rur = 0;
        for(j=0; j<n; j++)
        {
            if(rul < n/2 && (rur == n/2 || cir[le[rul]].vaa < cir[ri[rur]].vaa))
            {
                fa[j] = le[rul];
                rul ++;
            }
            else
            {
                fa[j] = ri[rur];
                rur ++;
            }
        }
        for(j=0; j<n/2; j++)
        {
            le[j] = fa[j];
            cans[fa[j]][coub[fa[j]]] = i;
            coub[fa[j]] --;
        }
        for(j=n/2; j<n; j++)
        {
            ri[j-n/2] = fa[j];
            cans[fa[j]][coun[fa[j]]] = i;
            coun[fa[j]] ++;
            cir[fa[j]].vaa --;
        }
    }
	for(i=0; i<n; i++)
	{
        ro.clear();
        for(j=0; j<m; j++)
        {
            ro.push_back(cans[i][j]);
        }
        ans.push_back(ro);
	}
//	for (long long i = 0; i < n; i++)
//	{
//		vector<int> row(m);
//		for (long long j = 0; j < m; j++)
//		{
//			if (j < k)
//			{
//				row[j] = j;
//			}
//			else
//			{
//				row[j] = -1;
//			}
//		}
//		answer.push_back(row);
//	}
	allocate_tickets(ans);
	return su;
}
//long long main()
//{
//    cout << "Hello world!" << endl;
//    return 0;
//}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 2 ms 1612 KB Output is correct
6 Correct 5 ms 6840 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 28 ms 5188 KB Output is correct
6 Correct 657 ms 92100 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 25 ms 5208 KB Output is correct
6 Correct 628 ms 93316 KB Output is correct
7 Correct 654 ms 99632 KB Output is correct
8 Correct 4 ms 1228 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 7 ms 1868 KB Output is correct
13 Correct 23 ms 5568 KB Output is correct
14 Correct 22 ms 4296 KB Output is correct
15 Correct 680 ms 104880 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 972 KB Output is correct
5 Correct 42 ms 7308 KB Output is correct
6 Correct 7 ms 1228 KB Output is correct
7 Correct 10 ms 7480 KB Output is correct
8 Correct 1053 ms 144232 KB Output is correct
9 Correct 925 ms 139220 KB Output is correct
10 Correct 984 ms 138104 KB Output is correct
11 Correct 1067 ms 142172 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 844 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 844 KB Output is correct
6 Correct 3 ms 952 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 3 ms 952 KB Output is correct
12 Correct 4 ms 972 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 844 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 844 KB Output is correct
6 Correct 3 ms 952 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 3 ms 952 KB Output is correct
12 Correct 4 ms 972 KB Output is correct
13 Correct 29 ms 5156 KB Output is correct
14 Correct 31 ms 5188 KB Output is correct
15 Correct 34 ms 5844 KB Output is correct
16 Correct 40 ms 7344 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 1868 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 27 ms 5432 KB Output is correct
21 Correct 33 ms 5964 KB Output is correct
22 Correct 30 ms 5836 KB Output is correct
23 Correct 35 ms 6340 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 2 ms 1612 KB Output is correct
6 Correct 5 ms 6840 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 844 KB Output is correct
11 Correct 28 ms 5188 KB Output is correct
12 Correct 657 ms 92100 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 844 KB Output is correct
17 Correct 25 ms 5208 KB Output is correct
18 Correct 628 ms 93316 KB Output is correct
19 Correct 654 ms 99632 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 7 ms 1868 KB Output is correct
25 Correct 23 ms 5568 KB Output is correct
26 Correct 22 ms 4296 KB Output is correct
27 Correct 680 ms 104880 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 4 ms 972 KB Output is correct
32 Correct 42 ms 7308 KB Output is correct
33 Correct 7 ms 1228 KB Output is correct
34 Correct 10 ms 7480 KB Output is correct
35 Correct 1053 ms 144232 KB Output is correct
36 Correct 925 ms 139220 KB Output is correct
37 Correct 984 ms 138104 KB Output is correct
38 Correct 1067 ms 142172 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 3 ms 844 KB Output is correct
41 Correct 4 ms 844 KB Output is correct
42 Correct 3 ms 844 KB Output is correct
43 Correct 3 ms 844 KB Output is correct
44 Correct 3 ms 952 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 588 KB Output is correct
47 Correct 3 ms 844 KB Output is correct
48 Correct 3 ms 972 KB Output is correct
49 Correct 3 ms 952 KB Output is correct
50 Correct 4 ms 972 KB Output is correct
51 Correct 29 ms 5156 KB Output is correct
52 Correct 31 ms 5188 KB Output is correct
53 Correct 34 ms 5844 KB Output is correct
54 Correct 40 ms 7344 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 1868 KB Output is correct
57 Correct 2 ms 1612 KB Output is correct
58 Correct 27 ms 5432 KB Output is correct
59 Correct 33 ms 5964 KB Output is correct
60 Correct 30 ms 5836 KB Output is correct
61 Correct 35 ms 6340 KB Output is correct
62 Correct 77 ms 12384 KB Output is correct
63 Correct 74 ms 12484 KB Output is correct
64 Correct 107 ms 18508 KB Output is correct
65 Correct 390 ms 52788 KB Output is correct
66 Correct 438 ms 68932 KB Output is correct
67 Correct 13 ms 7500 KB Output is correct
68 Correct 7 ms 1212 KB Output is correct
69 Correct 653 ms 89536 KB Output is correct
70 Correct 894 ms 106720 KB Output is correct
71 Correct 1123 ms 143876 KB Output is correct
72 Correct 740 ms 112460 KB Output is correct
73 Correct 908 ms 123436 KB Output is correct
74 Correct 711 ms 96772 KB Output is correct
75 Correct 786 ms 108284 KB Output is correct