oj.uz

Submission #552329

# Submission time Handle Problem Language Result Execution time Memory
552329 2022-04-23T03:09:57 Z hoanghq2004 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 760 ms 84056 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "tickets.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 gen(std :: chrono :: system_clock :: now().time_since_epoch().count());

//static int n;
//static int m;
//static int k;
//static std::vector<std::vector<int>> d;
//static std::vector<std::vector<int>> x;
//static int called = 0;
//
//static void check(bool cond, std::string message) {
//    if (!cond) {
//        printf("%s\n", message.c_str());
//        exit(0);
//    }
//}
//
//
//void allocate_tickets( std::vector<std::vector<int>> _d) {
//    check(!called, "allocate_tickets called more than once");
//    d = _d;
//    check((int)d.size() == n, "allocate_tickets called with parameter of wrong size");
//    for (int i = 0; i < n; i++) {
//        check((int)d[i].size() == m, "allocate_tickets called with parameter of wrong size");
//    }
//    called = 1;
//}

long long find_maximum(int k, vector <vector <int> > x) {
	int n = x.size();
	int m = x[0].size();
	vector <vector <int> > ans(n);
	vector <pair <int, int> > tmp;
	long long B = 0;
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < k; ++j) {
            B -= x[i][j];
            tmp.push_back({x[i][j] + x[i][m - k + j], i});
		}
//    cout << B << '\n';
    sort(tmp.begin(), tmp.end(), greater<>());
    vector <int> used(n, 0);
    int cnt = 0;
    for (auto [x, i]: tmp) {
        if (cnt == n * k / 2) break;
        ++used[i];
        ++cnt;
        B += x;
    }
//    cout << B << endl;
    vector <int> c1(n, 0), c2(n, 0);
    for (int i = 0, cur = 0; i < n; ++i) {
        ans[i].assign(m, -1);
        for (int j = m - used[i]; j < m; ++j) {
            ans[i][j] = cur;
            cur = (cur + 1) % k;
        }
        for (int j = 0; j < k - used[i]; ++j) ans[i][j] = (j + cur) % k;
    }
	allocate_tickets(ans);
	return B;
}
//
//
//int main() {
//    assert(scanf("%d %d %d", &n, &m, &k) == 3);
//    x.resize(n);
//    for (int i = 0; i < n; i++) {
//        x[i].resize(m);
//        for (int j=0; j < m; j++) {
//            assert(scanf("%d", &x[i][j]) == 1);
//        }
//    }
//    fclose(stdin);
//    long long answer = find_maximum(k, x);
////    assert(0);
//    check(called, "failure to call allocate_tickets");
//    printf("%lld\n", answer);
//    for (int i = 0; i < n; i++) {
//        for (int j = 0; j < m; j++) {
//            if (j) printf(" ");
//            printf("%d", d[i][j]);
//        }
//        printf("\n");
//    }
//    fclose(stdout);
//    return 0;
//}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:56:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   56 |     for (auto [x, i]: tmp) {
      |               ^

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 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 300 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 312 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 2508 KB Output is correct
6 Correct 495 ms 51512 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 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 21 ms 2616 KB Output is correct
6 Correct 525 ms 57924 KB Output is correct
7 Correct 507 ms 60716 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 304 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 18 ms 2388 KB Output is correct
14 Correct 18 ms 2388 KB Output is correct
15 Correct 497 ms 63180 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 272 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 30 ms 3648 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 1044 KB Output is correct
8 Correct 760 ms 83960 KB Output is correct
9 Correct 681 ms 78480 KB Output is correct
10 Correct 688 ms 78448 KB Output is correct
11 Correct 722 ms 84056 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 2 ms 440 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 444 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 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 500 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 2 ms 440 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 444 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 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 500 KB Output is correct
13 Correct 21 ms 3252 KB Output is correct
14 Correct 21 ms 3156 KB Output is correct
15 Correct 28 ms 3308 KB Output is correct
16 Correct 29 ms 3644 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 23 ms 2840 KB Output is correct
21 Correct 24 ms 3320 KB Output is correct
22 Correct 27 ms 2988 KB Output is correct
23 Correct 26 ms 3520 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 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 300 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 312 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 2508 KB Output is correct
12 Correct 495 ms 51512 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 21 ms 2616 KB Output is correct
18 Correct 525 ms 57924 KB Output is correct
19 Correct 507 ms 60716 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 304 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 18 ms 2388 KB Output is correct
26 Correct 18 ms 2388 KB Output is correct
27 Correct 497 ms 63180 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 272 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 30 ms 3648 KB Output is correct
33 Correct 5 ms 852 KB Output is correct
34 Correct 5 ms 1044 KB Output is correct
35 Correct 760 ms 83960 KB Output is correct
36 Correct 681 ms 78480 KB Output is correct
37 Correct 688 ms 78448 KB Output is correct
38 Correct 722 ms 84056 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 440 KB Output is correct
41 Correct 2 ms 500 KB Output is correct
42 Correct 2 ms 448 KB Output is correct
43 Correct 3 ms 444 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 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 500 KB Output is correct
51 Correct 21 ms 3252 KB Output is correct
52 Correct 21 ms 3156 KB Output is correct
53 Correct 28 ms 3308 KB Output is correct
54 Correct 29 ms 3644 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 23 ms 2840 KB Output is correct
59 Correct 24 ms 3320 KB Output is correct
60 Correct 27 ms 2988 KB Output is correct
61 Correct 26 ms 3520 KB Output is correct
62 Correct 53 ms 8456 KB Output is correct
63 Correct 75 ms 8384 KB Output is correct
64 Correct 88 ms 9564 KB Output is correct
65 Correct 258 ms 33560 KB Output is correct
66 Correct 320 ms 37576 KB Output is correct
67 Correct 5 ms 1108 KB Output is correct
68 Correct 5 ms 852 KB Output is correct
69 Correct 502 ms 73220 KB Output is correct
70 Correct 596 ms 75164 KB Output is correct
71 Correct 725 ms 83992 KB Output is correct
72 Correct 633 ms 67952 KB Output is correct
73 Correct 679 ms 80124 KB Output is correct
74 Correct 549 ms 60884 KB Output is correct
75 Correct 605 ms 73436 KB Output is correct