oj.uz

Submission #709439

# Submission time Handle Problem Language Result Execution time Memory
709439 2023-03-13T15:14:46 Z lukameladze Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1359 ms 240644 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define pb push_back
using namespace std;
const int N = 2005;
ll ans, sign[N][N];
set <ll> neg[N],pos[N];
vector < piii > v;
bool cmp(int a, int b) {
    return neg[a].size() > neg[b].size();
}
long long find_maximum(int k, vector< vector<int> > x) {
	int n = x.size();
	int m = x[0].size();
	vector< vector <int> > answ;
	answ = vector < vector <int> > (n, vector <int> (m, -1));
	for (int i = 0; i < n; i++) {
	    for (int j = 0; j < k; j++) {
	        ans -= x[i][j];
	        sign[i][j] = -1; // neg
	        v.pb({x[i][j] + x[i][m - (k - j)], {i, j}});
        }
    }
    sort(v.rbegin(),v.rend());
    for (int i = 0; i < (k * n) / 2; i++) {
        int xi = v[i].s.f; int xj = v[i].s.s;
        ans += v[i].f; sign[xi][xj] = 0; sign[xi][m - (k - xj)] = 1;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (sign[i][j] == -1) {
                neg[i].insert(j);
            } else if (sign[i][j] == 1) pos[i].insert(j);
        }
    }
    vector <int> id;
    for (int i = 0; i < n; i++) {
        id.pb(i);
    }
    for (int i = 1; i <= k; i++) {
        sort(id.begin(), id.end(), cmp);
        int cnt = 0;
        for (int idx : id) {
            cnt++;
            if (cnt <= n / 2) {
                answ[idx][*neg[idx].begin()] = i - 1;
                neg[idx].erase(neg[idx].begin());
            } else {
                answ[idx][*pos[idx].begin()] = i - 1;
                pos[idx].erase(pos[idx].begin());
            }
        }
    }
	allocate_tickets(answ);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 1748 KB Output is correct
6 Correct 4 ms 6940 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 22 ms 4900 KB Output is correct
6 Correct 511 ms 82436 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 28 ms 7036 KB Output is correct
6 Correct 819 ms 139200 KB Output is correct
7 Correct 948 ms 168772 KB Output is correct
8 Correct 6 ms 1876 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 9 ms 2768 KB Output is correct
13 Correct 27 ms 7836 KB Output is correct
14 Correct 28 ms 7108 KB Output is correct
15 Correct 1000 ms 190608 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 3 ms 1408 KB Output is correct
5 Correct 44 ms 10936 KB Output is correct
6 Correct 7 ms 2044 KB Output is correct
7 Correct 9 ms 8148 KB Output is correct
8 Correct 1359 ms 240644 KB Output is correct
9 Correct 1296 ms 224920 KB Output is correct
10 Correct 1253 ms 224596 KB Output is correct
11 Correct 1358 ms 240560 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 3 ms 1236 KB Output is correct
6 Correct 3 ms 1352 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 760 KB Output is correct
9 Correct 3 ms 1236 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 4 ms 1380 KB Output is correct
12 Correct 3 ms 1432 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 3 ms 1236 KB Output is correct
6 Correct 3 ms 1352 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 760 KB Output is correct
9 Correct 3 ms 1236 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 4 ms 1380 KB Output is correct
12 Correct 3 ms 1432 KB Output is correct
13 Correct 21 ms 5140 KB Output is correct
14 Correct 25 ms 5460 KB Output is correct
15 Correct 34 ms 7816 KB Output is correct
16 Correct 43 ms 10964 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 3 ms 2004 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 36 ms 8232 KB Output is correct
21 Correct 36 ms 8568 KB Output is correct
22 Correct 43 ms 9956 KB Output is correct
23 Correct 41 ms 10216 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 1748 KB Output is correct
6 Correct 4 ms 6940 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 22 ms 4900 KB Output is correct
12 Correct 511 ms 82436 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 28 ms 7036 KB Output is correct
18 Correct 819 ms 139200 KB Output is correct
19 Correct 948 ms 168772 KB Output is correct
20 Correct 6 ms 1876 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 9 ms 2768 KB Output is correct
25 Correct 27 ms 7836 KB Output is correct
26 Correct 28 ms 7108 KB Output is correct
27 Correct 1000 ms 190608 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 500 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 3 ms 1408 KB Output is correct
32 Correct 44 ms 10936 KB Output is correct
33 Correct 7 ms 2044 KB Output is correct
34 Correct 9 ms 8148 KB Output is correct
35 Correct 1359 ms 240644 KB Output is correct
36 Correct 1296 ms 224920 KB Output is correct
37 Correct 1253 ms 224596 KB Output is correct
38 Correct 1358 ms 240560 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 3 ms 980 KB Output is correct
41 Correct 2 ms 980 KB Output is correct
42 Correct 3 ms 1108 KB Output is correct
43 Correct 3 ms 1236 KB Output is correct
44 Correct 3 ms 1352 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 760 KB Output is correct
47 Correct 3 ms 1236 KB Output is correct
48 Correct 5 ms 1236 KB Output is correct
49 Correct 4 ms 1380 KB Output is correct
50 Correct 3 ms 1432 KB Output is correct
51 Correct 21 ms 5140 KB Output is correct
52 Correct 25 ms 5460 KB Output is correct
53 Correct 34 ms 7816 KB Output is correct
54 Correct 43 ms 10964 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 3 ms 2004 KB Output is correct
57 Correct 2 ms 1876 KB Output is correct
58 Correct 36 ms 8232 KB Output is correct
59 Correct 36 ms 8568 KB Output is correct
60 Correct 43 ms 9956 KB Output is correct
61 Correct 41 ms 10216 KB Output is correct
62 Correct 60 ms 12128 KB Output is correct
63 Correct 60 ms 12708 KB Output is correct
64 Correct 137 ms 28336 KB Output is correct
65 Correct 381 ms 72520 KB Output is correct
66 Correct 568 ms 108160 KB Output is correct
67 Correct 10 ms 8148 KB Output is correct
68 Correct 7 ms 2008 KB Output is correct
69 Correct 517 ms 85668 KB Output is correct
70 Correct 909 ms 159396 KB Output is correct
71 Correct 1328 ms 240536 KB Output is correct
72 Correct 1265 ms 214532 KB Output is correct
73 Correct 1287 ms 221892 KB Output is correct
74 Correct 895 ms 148304 KB Output is correct
75 Correct 878 ms 157844 KB Output is correct