oj.uz

Submission #768993

# Submission time Handle Problem Language Result Execution time Memory
768993 2023-06-29T04:24:38 Z marvinthang Carnival Tickets (IOI20_tickets) C++17
100 / 100
 631 ms 84212 KB 
/*************************************
*    author: marvinthang             *
*    created: 29.06.2023 11:07:04    *
*************************************/

#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

long long find_maximum(int k, vector <vector <int>> x) {
	int n = x.size();
	int m = x[0].size();
	long long res = 0;
	vector <pair <int, int>> v;
	REP(i, n) REP(j, k) {
		res -= x[i][j];
		v.emplace_back(x[i][m - k + j] + x[i][j], i);
	}
	vector <int> cnt(n, k);
	sort(v.rbegin(), v.rend());
	REP(i, n * k / 2) {
		res += v[i].fi;
		--cnt[v[i].se];
	}
	vector <vector <int>> ans(n, vector<int>(m, -1));
	int t = 0;
	REP(i, n) {
		REP(j, k) ans[i][j < cnt[i] ? j : m - k + j] = (t + j) % k;
		t = (t + cnt[i]) % k;
	}
	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 296 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.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 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 16 ms 3156 KB Output is correct
6 Correct 391 ms 73124 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 0 ms 212 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 16 ms 2588 KB Output is correct
6 Correct 378 ms 57740 KB Output is correct
7 Correct 387 ms 60740 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 13 ms 2388 KB Output is correct
14 Correct 13 ms 2384 KB Output is correct
15 Correct 396 ms 63084 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 0 ms 212 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 22 ms 3640 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 4 ms 1044 KB Output is correct
8 Correct 631 ms 84212 KB Output is correct
9 Correct 526 ms 78572 KB Output is correct
10 Correct 532 ms 78444 KB Output is correct
11 Correct 577 ms 84072 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 2 ms 596 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 304 KB Output is correct
9 Correct 2 ms 468 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 1 ms 212 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 2 ms 596 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 304 KB Output is correct
9 Correct 2 ms 468 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 16 ms 3140 KB Output is correct
14 Correct 17 ms 3244 KB Output is correct
15 Correct 20 ms 3252 KB Output is correct
16 Correct 27 ms 3788 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 332 KB Output is correct
20 Correct 23 ms 2788 KB Output is correct
21 Correct 19 ms 3276 KB Output is correct
22 Correct 20 ms 3032 KB Output is correct
23 Correct 21 ms 3440 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 296 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 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 16 ms 3156 KB Output is correct
12 Correct 391 ms 73124 KB Output is correct
13 Correct 1 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 440 KB Output is correct
17 Correct 16 ms 2588 KB Output is correct
18 Correct 378 ms 57740 KB Output is correct
19 Correct 387 ms 60740 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 300 KB Output is correct
23 Correct 0 ms 304 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 13 ms 2388 KB Output is correct
26 Correct 13 ms 2384 KB Output is correct
27 Correct 396 ms 63084 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 568 KB Output is correct
32 Correct 22 ms 3640 KB Output is correct
33 Correct 4 ms 852 KB Output is correct
34 Correct 4 ms 1044 KB Output is correct
35 Correct 631 ms 84212 KB Output is correct
36 Correct 526 ms 78572 KB Output is correct
37 Correct 532 ms 78444 KB Output is correct
38 Correct 577 ms 84072 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 440 KB Output is correct
41 Correct 2 ms 596 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 304 KB Output is correct
47 Correct 2 ms 468 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 16 ms 3140 KB Output is correct
52 Correct 17 ms 3244 KB Output is correct
53 Correct 20 ms 3252 KB Output is correct
54 Correct 27 ms 3788 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 332 KB Output is correct
58 Correct 23 ms 2788 KB Output is correct
59 Correct 19 ms 3276 KB Output is correct
60 Correct 20 ms 3032 KB Output is correct
61 Correct 21 ms 3440 KB Output is correct
62 Correct 44 ms 8416 KB Output is correct
63 Correct 44 ms 8432 KB Output is correct
64 Correct 62 ms 9568 KB Output is correct
65 Correct 233 ms 33560 KB Output is correct
66 Correct 249 ms 37476 KB Output is correct
67 Correct 5 ms 1108 KB Output is correct
68 Correct 4 ms 852 KB Output is correct
69 Correct 396 ms 73160 KB Output is correct
70 Correct 477 ms 75128 KB Output is correct
71 Correct 570 ms 83948 KB Output is correct
72 Correct 512 ms 67956 KB Output is correct
73 Correct 542 ms 80176 KB Output is correct
74 Correct 434 ms 60836 KB Output is correct
75 Correct 469 ms 73352 KB Output is correct