oj.uz

Submission #349188

# Submission time Handle Problem Language Result Execution time Memory
349188 2021-01-17T03:04:41 Z NhatMinh0208 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2092 ms 100584 KB 
/*
	Normie's Template v2.0
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
#include "tickets.h"
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
int n,m,kk,i,j,t,t1,u,v,a,b;
vector<vector<int>> ord;
vector<vector<int>> pts;
vector<int> cntm,cntp;
vector<vector<int>> res;
ll val;
struct cmp
{
	int operator()(int a, int b) const
	{
		int u=pts[a][ord[a][m-1-cntp[a]]]+pts[a][ord[a][cntm[a]-1]];
		int v=pts[b][ord[b][m-1-cntp[b]]]+pts[b][ord[b][cntm[b]-1]];
		if (u-v) return (u>v);
		return (a<b);
	}
};
set<int,cmp> se;
ll find_maximum(int k, vector<vector<int>> x)
{
	pts=x;
	n=x.size();
	m=x[0].size();
	kk=k;
	for (i=0;i<n;i++)
	{
		ord.push_back({});
		res.push_back({});
		cntm.push_back(k);
		cntp.push_back(0);
		for (j=0;j<m;j++) ord[i].push_back(j);
		for (j=0;j<m;j++) res[i].push_back(-1);
		sort(ord[i].begin(),ord[i].end(),[](int a, int b){
			return (pts[i][a]<pts[i][b]);
		});
		for (j=0;j<k;j++) val-=pts[i][ord[i][j]];
	}
	for (i=0;i<n;i++) se.insert(i);
	for (i=0;i<k*n/2;i++)
	{
		u=*(se.begin());
		se.erase(u);
		v=pts[u][ord[u][m-1-cntp[u]]]+pts[u][ord[u][cntm[u]-1]];
		val+=v;
		cntp[u]++;
		cntm[u]--;
		if (cntm[u]) se.insert(u);
	}
	vector<int> vec;
	for (i=0;i<n;i++) vec.push_back(i);
	for (i=0;i<k;i++) 
	{
		sort(vec.begin(),vec.end(),[](int a, int b){
			return (cntp[a]>cntp[b]);
		});
		for (j=0;j<n/2;j++)
		{
			u=vec[j];
			res[u][ord[u][m-cntp[u]]]=i;
			cntp[u]--;
		}
		for (j=n/2;j<n;j++)
		{
			u=vec[j];
			res[u][ord[u][cntm[u]-1]]=i;
			cntm[u]--;
		}
	}
	allocate_tickets(res);
	return val;
}

Compilation message

tickets.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 36 ms 4588 KB Output is correct
6 Correct 904 ms 80492 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 38 ms 3948 KB Output is correct
6 Correct 1045 ms 81260 KB Output is correct
7 Correct 1174 ms 81656 KB Output is correct
8 Correct 5 ms 748 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 35 ms 3308 KB Output is correct
14 Correct 35 ms 2924 KB Output is correct
15 Correct 1236 ms 82248 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 62 ms 4616 KB Output is correct
6 Correct 9 ms 1004 KB Output is correct
7 Correct 13 ms 1388 KB Output is correct
8 Correct 2029 ms 100536 KB Output is correct
9 Correct 1900 ms 95624 KB Output is correct
10 Correct 1913 ms 94196 KB Output is correct
11 Correct 2000 ms 100584 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 5 ms 620 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 620 KB Output is correct
10 Correct 5 ms 620 KB Output is correct
11 Correct 5 ms 620 KB Output is correct
12 Correct 4 ms 620 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 4 ms 620 KB Output is correct
5 Correct 5 ms 620 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 620 KB Output is correct
10 Correct 5 ms 620 KB Output is correct
11 Correct 5 ms 620 KB Output is correct
12 Correct 4 ms 620 KB Output is correct
13 Correct 36 ms 4588 KB Output is correct
14 Correct 40 ms 4588 KB Output is correct
15 Correct 50 ms 4588 KB Output is correct
16 Correct 62 ms 4588 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 52 ms 3948 KB Output is correct
21 Correct 52 ms 4460 KB Output is correct
22 Correct 53 ms 3948 KB Output is correct
23 Correct 58 ms 4460 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 36 ms 4588 KB Output is correct
12 Correct 904 ms 80492 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 620 KB Output is correct
17 Correct 38 ms 3948 KB Output is correct
18 Correct 1045 ms 81260 KB Output is correct
19 Correct 1174 ms 81656 KB Output is correct
20 Correct 5 ms 748 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 10 ms 1260 KB Output is correct
25 Correct 35 ms 3308 KB Output is correct
26 Correct 35 ms 2924 KB Output is correct
27 Correct 1236 ms 82248 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 4 ms 620 KB Output is correct
32 Correct 62 ms 4616 KB Output is correct
33 Correct 9 ms 1004 KB Output is correct
34 Correct 13 ms 1388 KB Output is correct
35 Correct 2029 ms 100536 KB Output is correct
36 Correct 1900 ms 95624 KB Output is correct
37 Correct 1913 ms 94196 KB Output is correct
38 Correct 2000 ms 100584 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 4 ms 620 KB Output is correct
43 Correct 5 ms 620 KB Output is correct
44 Correct 4 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 4 ms 620 KB Output is correct
48 Correct 5 ms 620 KB Output is correct
49 Correct 5 ms 620 KB Output is correct
50 Correct 4 ms 620 KB Output is correct
51 Correct 36 ms 4588 KB Output is correct
52 Correct 40 ms 4588 KB Output is correct
53 Correct 50 ms 4588 KB Output is correct
54 Correct 62 ms 4588 KB Output is correct
55 Correct 2 ms 492 KB Output is correct
56 Correct 4 ms 748 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 52 ms 3948 KB Output is correct
59 Correct 52 ms 4460 KB Output is correct
60 Correct 53 ms 3948 KB Output is correct
61 Correct 58 ms 4460 KB Output is correct
62 Correct 98 ms 10568 KB Output is correct
63 Correct 100 ms 10604 KB Output is correct
64 Correct 181 ms 10928 KB Output is correct
65 Correct 637 ms 41336 KB Output is correct
66 Correct 828 ms 41964 KB Output is correct
67 Correct 13 ms 1388 KB Output is correct
68 Correct 9 ms 1004 KB Output is correct
69 Correct 924 ms 97516 KB Output is correct
70 Correct 1602 ms 98496 KB Output is correct
71 Correct 2092 ms 100288 KB Output is correct
72 Correct 1485 ms 84864 KB Output is correct
73 Correct 2029 ms 97040 KB Output is correct
74 Correct 1177 ms 83368 KB Output is correct
75 Correct 1570 ms 95464 KB Output is correct