oj.uz

Submission #718626

# Submission time Handle Problem Language Result Execution time Memory
718626 2023-04-04T12:43:01 Z baojiaopisu Carnival Tickets (IOI20_tickets) C++14
100 / 100
 761 ms 76236 KB 
#include "tickets.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

int l[N], r[N];
ll find_maximum(int k, vector<vector<int>> a) {
	int n = a.size();
	int m = a[0].size();

	for(int i = 0; i < n; i++) {
		l[i] = 0; r[i] = m - 1;
	}

	vector<vector<int>> ans(n, vector<int>(m, -1));
	ll res = 0;
	for(int i = 0; i < n; i++) {
		for(int j = m - 1; j >= m - k; j--) res += a[i][j];
	}
	
	set<pii> s;
	for(int i = 0; i < n; i++) {
		s.ins(mp(a[i][0] + a[i][m - k], i));
		r[i] = m - 1;
	}

	for(int i = 1; i <= n * k / 2; i++) {
		auto iter = s.begin();
		int id = (*iter).se;
		s.erase(iter);
		res -= a[id][l[id]] + a[id][m - k + l[id]];
		++l[id];
		if(l[id] < k) s.ins(mp(a[id][l[id]] + a[id][m - k + l[id]], id));
	}

	for(int i = 0; i < n; i++) l[i]--;
	for(int i = 0; i < k; i++) {
		vector<int> pos;
		for(int j = 0; j < n; j++) pos.pb(j);
		sort(all(pos), [&](int x, int y) {
			return l[x] > l[y];
		});
		for(int j = 0; j < n / 2; j++) {
			int x = pos[j];
			ans[x][l[x]] = i;
			l[x]--; 
		}
		for(int j = n / 2; j < n; j++) {
			int x = pos[j];
			ans[x][r[x]] = i;
			r[x]--;
		}
	}
	allocate_tickets(ans);
	return res;
}

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 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 2316 KB Output is correct
6 Correct 435 ms 51508 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 18 ms 2316 KB Output is correct
6 Correct 439 ms 52420 KB Output is correct
7 Correct 462 ms 52720 KB Output is correct
8 Correct 3 ms 468 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 316 KB Output is correct
12 Correct 6 ms 760 KB Output is correct
13 Correct 17 ms 2172 KB Output is correct
14 Correct 17 ms 2132 KB Output is correct
15 Correct 471 ms 57792 KB Output is correct

Subtask #4
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 3 ms 512 KB Output is correct
5 Correct 29 ms 3292 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 736 ms 76120 KB Output is correct
9 Correct 679 ms 71036 KB Output is correct
10 Correct 695 ms 71172 KB Output is correct
11 Correct 738 ms 76236 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 460 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 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 524 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 456 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 460 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 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 524 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 456 KB Output is correct
13 Correct 20 ms 3356 KB Output is correct
14 Correct 21 ms 3260 KB Output is correct
15 Correct 23 ms 3164 KB Output is correct
16 Correct 29 ms 3232 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 22 ms 2576 KB Output is correct
21 Correct 25 ms 3144 KB Output is correct
22 Correct 25 ms 2636 KB Output is correct
23 Correct 27 ms 3148 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 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 2316 KB Output is correct
12 Correct 435 ms 51508 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 18 ms 2316 KB Output is correct
18 Correct 439 ms 52420 KB Output is correct
19 Correct 462 ms 52720 KB Output is correct
20 Correct 3 ms 468 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 316 KB Output is correct
24 Correct 6 ms 760 KB Output is correct
25 Correct 17 ms 2172 KB Output is correct
26 Correct 17 ms 2132 KB Output is correct
27 Correct 471 ms 57792 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 29 ms 3292 KB Output is correct
33 Correct 5 ms 716 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 736 ms 76120 KB Output is correct
36 Correct 679 ms 71036 KB Output is correct
37 Correct 695 ms 71172 KB Output is correct
38 Correct 738 ms 76236 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 460 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 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 3 ms 524 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 456 KB Output is correct
51 Correct 20 ms 3356 KB Output is correct
52 Correct 21 ms 3260 KB Output is correct
53 Correct 23 ms 3164 KB Output is correct
54 Correct 29 ms 3232 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 512 KB Output is correct
57 Correct 2 ms 340 KB Output is correct
58 Correct 22 ms 2576 KB Output is correct
59 Correct 25 ms 3144 KB Output is correct
60 Correct 25 ms 2636 KB Output is correct
61 Correct 27 ms 3148 KB Output is correct
62 Correct 56 ms 8448 KB Output is correct
63 Correct 55 ms 8524 KB Output is correct
64 Correct 78 ms 8604 KB Output is correct
65 Correct 264 ms 33108 KB Output is correct
66 Correct 328 ms 33740 KB Output is correct
67 Correct 6 ms 1092 KB Output is correct
68 Correct 5 ms 712 KB Output is correct
69 Correct 479 ms 73376 KB Output is correct
70 Correct 579 ms 74188 KB Output is correct
71 Correct 761 ms 76020 KB Output is correct
72 Correct 563 ms 60632 KB Output is correct
73 Correct 682 ms 73372 KB Output is correct
74 Correct 495 ms 59064 KB Output is correct
75 Correct 580 ms 72004 KB Output is correct