oj.uz

Submission #479835

# Submission time Handle Problem Language Result Execution time Memory
479835 2021-10-13T10:27:10 Z stefantaga Carnival Tickets (IOI20_tickets) C++14
100 / 100
 973 ms 80736 KB 
#include "tickets.h"
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
 
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 3;
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 1501;
int type[mxN][mxN];
int lev[mxN];
ll find_maximum(int k, vector<vector<int>> arr) {
    int n = arr.size();
    int m = arr[0].size();
    vector<vector<int>> s(n, vector<int>(m, -1));
    ll res = 0;
    priority_queue<ttgl, vector<ttgl>, greater<ttgl>> pq;
    owo(i, 0, n) {
        sort(arr[i].begin(), arr[i].end());
        pq.push({arr[i][0] + arr[i][m-k], i});
        lev[i] = 0;
        owo(j, 0, k) {
            res += arr[i][m-j-1];
            type[i][m-j-1] = 1;
        }
    }
    owo(_, 0, n*k/2) {
        auto p = pq.top();
        pq.pop();
        res -= p.first;
        type[p.second][m-k+lev[p.second]] = 0;
        type[p.second][lev[p.second]] = -1;
        lev[p.second]++;
        if(lev[p.second] < k)  pq.push({arr[p.second][lev[p.second]] + arr[p.second][m-k+lev[p.second]], p.second});
    }
    vector<vector<int>> pos(n);
    vector<vector<int>> neg(n);
    owo(i, 0, n) {
        owo(j, 0, m) {
            if(type[i][j]==1)pos[i].senpai(j);
            else if(type[i][j]==-1)neg[i].senpai(j);
        }
    }
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    owo(col, 0, k) {
        sort(ord.begin(), ord.end(), [&](int a, int b) {
            return pos[a].size() < pos[b].size();
        });
        owo(i, 0, n/2) {
            int x = ord[i];
            int y = ord[n-i-1];
            s[x][neg[x].back()] = col;
            neg[x].pop_back();
            s[y][pos[y].back()] = col;
            pos[y].pop_back();
        }
    }
  	allocate_tickets(s);
    return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 4 ms 6860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 27 ms 3660 KB Output is correct
6 Correct 652 ms 57528 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 31 ms 4200 KB Output is correct
6 Correct 586 ms 67292 KB Output is correct
7 Correct 658 ms 70572 KB Output is correct
8 Correct 3 ms 972 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 6 ms 1612 KB Output is correct
13 Correct 22 ms 4556 KB Output is correct
14 Correct 20 ms 3276 KB Output is correct
15 Correct 682 ms 72392 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 33 ms 5372 KB Output is correct
6 Correct 5 ms 844 KB Output is correct
7 Correct 10 ms 7236 KB Output is correct
8 Correct 973 ms 76116 KB Output is correct
9 Correct 829 ms 72360 KB Output is correct
10 Correct 845 ms 71196 KB Output is correct
11 Correct 897 ms 76272 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 3 ms 844 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 844 KB Output is correct
6 Correct 3 ms 844 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Correct 4 ms 844 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 3 ms 844 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 3 ms 844 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 844 KB Output is correct
6 Correct 3 ms 844 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Correct 4 ms 844 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 3 ms 844 KB Output is correct
13 Correct 26 ms 4708 KB Output is correct
14 Correct 29 ms 4812 KB Output is correct
15 Correct 28 ms 5148 KB Output is correct
16 Correct 35 ms 5452 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 1740 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 29 ms 4540 KB Output is correct
21 Correct 30 ms 4940 KB Output is correct
22 Correct 32 ms 4804 KB Output is correct
23 Correct 31 ms 5068 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 4 ms 6860 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 27 ms 3660 KB Output is correct
12 Correct 652 ms 57528 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 31 ms 4200 KB Output is correct
18 Correct 586 ms 67292 KB Output is correct
19 Correct 658 ms 70572 KB Output is correct
20 Correct 3 ms 972 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 6 ms 1612 KB Output is correct
25 Correct 22 ms 4556 KB Output is correct
26 Correct 20 ms 3276 KB Output is correct
27 Correct 682 ms 72392 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 844 KB Output is correct
32 Correct 33 ms 5372 KB Output is correct
33 Correct 5 ms 844 KB Output is correct
34 Correct 10 ms 7236 KB Output is correct
35 Correct 973 ms 76116 KB Output is correct
36 Correct 829 ms 72360 KB Output is correct
37 Correct 845 ms 71196 KB Output is correct
38 Correct 897 ms 76272 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 2 ms 844 KB Output is correct
41 Correct 3 ms 844 KB Output is correct
42 Correct 3 ms 844 KB Output is correct
43 Correct 3 ms 844 KB Output is correct
44 Correct 3 ms 844 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 588 KB Output is correct
47 Correct 3 ms 844 KB Output is correct
48 Correct 4 ms 844 KB Output is correct
49 Correct 2 ms 844 KB Output is correct
50 Correct 3 ms 844 KB Output is correct
51 Correct 26 ms 4708 KB Output is correct
52 Correct 29 ms 4812 KB Output is correct
53 Correct 28 ms 5148 KB Output is correct
54 Correct 35 ms 5452 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 1740 KB Output is correct
57 Correct 2 ms 1612 KB Output is correct
58 Correct 29 ms 4540 KB Output is correct
59 Correct 30 ms 4940 KB Output is correct
60 Correct 32 ms 4804 KB Output is correct
61 Correct 31 ms 5068 KB Output is correct
62 Correct 63 ms 11084 KB Output is correct
63 Correct 76 ms 11332 KB Output is correct
64 Correct 120 ms 12836 KB Output is correct
65 Correct 318 ms 39896 KB Output is correct
66 Correct 390 ms 42688 KB Output is correct
67 Correct 15 ms 7244 KB Output is correct
68 Correct 7 ms 948 KB Output is correct
69 Correct 553 ms 58488 KB Output is correct
70 Correct 829 ms 68032 KB Output is correct
71 Correct 875 ms 75784 KB Output is correct
72 Correct 829 ms 80736 KB Output is correct
73 Correct 834 ms 72848 KB Output is correct
74 Correct 694 ms 73412 KB Output is correct
75 Correct 739 ms 65736 KB Output is correct