oj.uz

Submission #738074

# Submission time Handle Problem Language Result Execution time Memory
738074 2023-05-08T06:52:34 Z bobthebuilder Carnival Tickets (IOI20_tickets) C++17
100 / 100
 756 ms 84060 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define lowb(x) (x&(-x))
#define ALL(_x) _x.begin(),_x.end()
#define pii pair<int,int>
#define f first
#define s second
#define SORT_UNIQUE(x) sort(ALL(x)),x.erase(unique(ALL(x)),x.end())
#define ll long long
#define MNTO(x,y) x=min(x,y)
#define MXTO(x,y) x=max(x,y)
const ll INF64=4e18;
const int maxn=2e3+5;
int cnt[maxn];
bool vis[maxn];
int tot[maxn];
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> lbl(n,vector<int>(m,-1));
	vector<pii> cst;
	ll ans=0;
	REP(i,n){
		REP(j,k) ans-=x[i][j];
		REP1(j,k){
			cst.pb({x[i][k-j]+x[i][m-j],i});
		}
	}
	sort(ALL(cst));
	reverse(ALL(cst));
	REP(j,k*n/2){
		ans+=cst[j].f;
		tot[cst[j].s]++;
	}
	int pp=0;
	REP(i,n){
		int pos=tot[i],neg=0;
		REP(j,pos){
			lbl[i][m-j-1]=pp;
			vis[pp]=1;
			++pp;
			pp%=k;
		}
		REP(j,k){
			if(!vis[j]){
				lbl[i][neg]=j;
				++neg;
			}
			vis[j]=0;
		}
	}
	allocate_tickets(lbl);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 23 ms 3212 KB Output is correct
6 Correct 456 ms 54148 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 23 ms 2636 KB Output is correct
6 Correct 499 ms 57824 KB Output is correct
7 Correct 457 ms 60772 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 16 ms 2380 KB Output is correct
14 Correct 15 ms 2388 KB Output is correct
15 Correct 445 ms 63008 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 25 ms 2760 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 667 ms 83868 KB Output is correct
9 Correct 630 ms 78504 KB Output is correct
10 Correct 626 ms 78580 KB Output is correct
11 Correct 698 ms 84060 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 18 ms 2392 KB Output is correct
14 Correct 20 ms 2372 KB Output is correct
15 Correct 23 ms 2404 KB Output is correct
16 Correct 25 ms 2752 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 20 ms 2516 KB Output is correct
21 Correct 27 ms 2508 KB Output is correct
22 Correct 25 ms 2668 KB Output is correct
23 Correct 23 ms 2688 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 23 ms 3212 KB Output is correct
12 Correct 456 ms 54148 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 23 ms 2636 KB Output is correct
18 Correct 499 ms 57824 KB Output is correct
19 Correct 457 ms 60772 KB Output is correct
20 Correct 3 ms 572 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 16 ms 2380 KB Output is correct
26 Correct 15 ms 2388 KB Output is correct
27 Correct 445 ms 63008 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 25 ms 2760 KB Output is correct
33 Correct 4 ms 852 KB Output is correct
34 Correct 5 ms 1108 KB Output is correct
35 Correct 667 ms 83868 KB Output is correct
36 Correct 630 ms 78504 KB Output is correct
37 Correct 626 ms 78580 KB Output is correct
38 Correct 698 ms 84060 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 388 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 18 ms 2392 KB Output is correct
52 Correct 20 ms 2372 KB Output is correct
53 Correct 23 ms 2404 KB Output is correct
54 Correct 25 ms 2752 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 20 ms 2516 KB Output is correct
59 Correct 27 ms 2508 KB Output is correct
60 Correct 25 ms 2668 KB Output is correct
61 Correct 23 ms 2688 KB Output is correct
62 Correct 54 ms 8364 KB Output is correct
63 Correct 56 ms 8424 KB Output is correct
64 Correct 77 ms 9612 KB Output is correct
65 Correct 246 ms 33544 KB Output is correct
66 Correct 296 ms 37476 KB Output is correct
67 Correct 6 ms 1108 KB Output is correct
68 Correct 5 ms 852 KB Output is correct
69 Correct 477 ms 73204 KB Output is correct
70 Correct 581 ms 75104 KB Output is correct
71 Correct 756 ms 83916 KB Output is correct
72 Correct 613 ms 67832 KB Output is correct
73 Correct 615 ms 80060 KB Output is correct
74 Correct 494 ms 60932 KB Output is correct
75 Correct 577 ms 73252 KB Output is correct