oj.uz

답안 #635138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635138 2022-08-25T13:58:31 Z stevancv 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 637 ms 54340 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 5e5 + 2;
const int mod = 1e9 + 7;
ll find_maximum(int k, vector<vector<int>> a) {
    int n = a.size(); int m = a[0].size();
    vector<int> l(n, k - 1), r(n, m - 1);
    priority_queue<array<int, 2>> pq;
    for (int i = 0; i < n; i++) pq.push({a[i][l[i]] + a[i][r[i]], i});
    int uk = n * k / 2;
    while (uk--) {
        int i = pq.top()[1]; pq.pop();
        l[i]--; r[i]--;
        if (l[i] >= 0) pq.push({a[i][l[i]] + a[i][r[i]], i});
    }
    vector<int> kol(n);
    ll sol = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= l[i]; j++) sol -= a[i][j];
        for (int j = r[i] + 1; j < m; j++) sol += a[i][j];
        kol[i] = k - l[i] - 1;
        l[i] = 0; r[i] = m - 1;
    }
    vector<vector<int>> ans(n, vector<int>(m, -1));
    for (int z = 0; z < k; z++) {
        vector<int> id(n);
        iota(id.begin(), id.end(), 0);
        sort(id.begin(), id.end(), [&] (int i, int j) {
            return kol[i] < kol[j];
        });
        for (int i = 0; i < n / 2; i++) {
            ans[id[i]][l[id[i]]] = z;
            l[id[i]]++;
        }
        for (int i = n / 2; i < n; i++) {
            ans[id[i]][r[id[i]]] = z;
            r[id[i]]--;
            kol[id[i]]--;
        }
    }
    allocate_tickets(ans);
    return sol;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
5 Correct 19 ms 2316 KB Output is correct
6 Correct 464 ms 51500 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 3 ms 340 KB Output is correct
5 Correct 23 ms 2396 KB Output is correct
6 Correct 443 ms 52320 KB Output is correct
7 Correct 459 ms 52724 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 704 KB Output is correct
13 Correct 15 ms 2040 KB Output is correct
14 Correct 15 ms 2048 KB Output is correct
15 Correct 507 ms 53340 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
5 Correct 24 ms 2452 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 602 ms 54264 KB Output is correct
9 Correct 588 ms 50640 KB Output is correct
10 Correct 623 ms 50700 KB Output is correct
11 Correct 637 ms 54340 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 432 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 432 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 19 ms 2260 KB Output is correct
14 Correct 25 ms 2372 KB Output is correct
15 Correct 26 ms 2436 KB Output is correct
16 Correct 25 ms 2368 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 2292 KB Output is correct
21 Correct 22 ms 2300 KB Output is correct
22 Correct 21 ms 2260 KB Output is correct
23 Correct 23 ms 2248 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 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 0 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 19 ms 2316 KB Output is correct
12 Correct 464 ms 51500 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 23 ms 2396 KB Output is correct
18 Correct 443 ms 52320 KB Output is correct
19 Correct 459 ms 52724 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 704 KB Output is correct
25 Correct 15 ms 2040 KB Output is correct
26 Correct 15 ms 2048 KB Output is correct
27 Correct 507 ms 53340 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 340 KB Output is correct
32 Correct 24 ms 2452 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 5 ms 852 KB Output is correct
35 Correct 602 ms 54264 KB Output is correct
36 Correct 588 ms 50640 KB Output is correct
37 Correct 623 ms 50700 KB Output is correct
38 Correct 637 ms 54340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 432 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 3 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 340 KB Output is correct
48 Correct 2 ms 340 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 19 ms 2260 KB Output is correct
52 Correct 25 ms 2372 KB Output is correct
53 Correct 26 ms 2436 KB Output is correct
54 Correct 25 ms 2368 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 2292 KB Output is correct
59 Correct 22 ms 2300 KB Output is correct
60 Correct 21 ms 2260 KB Output is correct
61 Correct 23 ms 2248 KB Output is correct
62 Correct 53 ms 6016 KB Output is correct
63 Correct 50 ms 5912 KB Output is correct
64 Correct 66 ms 6212 KB Output is correct
65 Correct 234 ms 23448 KB Output is correct
66 Correct 276 ms 23948 KB Output is correct
67 Correct 5 ms 852 KB Output is correct
68 Correct 4 ms 600 KB Output is correct
69 Correct 485 ms 51512 KB Output is correct
70 Correct 546 ms 52272 KB Output is correct
71 Correct 621 ms 54276 KB Output is correct
72 Correct 521 ms 52100 KB Output is correct
73 Correct 588 ms 52172 KB Output is correct
74 Correct 487 ms 50748 KB Output is correct
75 Correct 519 ms 50608 KB Output is correct