oj.uz

Submission #305853

# Submission time Handle Problem Language Result Execution time Memory
305853 2020-09-24T03:01:45 Z Dormi Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1419 ms 92116 KB 
#include "bits/stdc++.h"
#include "tickets.h"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
int sz(const T &a){return int(a.size());}
vector<int> used[1501][2];
int amlower[1501];
ll find_maximum(int k, vector<vector<int>> x){
    int n=sz(x),m=sz(x[0]);
    ll ans=0;
    priority_queue<pair<ll,int>> q;
    vector<int> order;
    for(int i=0;i<n;i++){
        order.push_back(i);
        for(int j=1;j<=k;j++){
            ans+=x[i][m-j];
            q.push({-x[i][j-1]-x[i][m-k+j-1],i});
        }
    }
    for(int i=0;i<n*k/2;i++){
        auto cur=q.top();
        q.pop();
        ans+=cur.first;
        amlower[cur.second]++;
    }
    for(int i=0;i<n;i++){
        for(int j=m-1;j>=m-k+amlower[i];j--)used[i][0].push_back(j);
        for(int j=0;j<amlower[i];j++)used[i][1].push_back(j);
    }
    vector<vector<int>> ret(n,vector<int>(m,-1));
    for(int i=0;i<k;i++){
        sort(order.begin(),order.end(),[&](auto &lhs, auto &rhs){
            return sz(used[rhs][0])<sz(used[lhs][0]);
        });
        for(int j=0;j<n;j++){
            int loc=(j>=n/2);
            ret[order[j]][used[order[j]][loc].back()]=i;
            used[order[j]][loc].pop_back();
        }
    }
    allocate_tickets(ret);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 3 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2552 KB Output is correct
6 Correct 765 ms 51580 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 30 ms 3320 KB Output is correct
6 Correct 777 ms 68504 KB Output is correct
7 Correct 897 ms 77336 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 1148 KB Output is correct
13 Correct 26 ms 3068 KB Output is correct
14 Correct 27 ms 3192 KB Output is correct
15 Correct 896 ms 82968 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 48 ms 4204 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 9 ms 1288 KB Output is correct
8 Correct 1391 ms 91988 KB Output is correct
9 Correct 1316 ms 87004 KB Output is correct
10 Correct 1297 ms 86100 KB Output is correct
11 Correct 1390 ms 92116 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 32 ms 2552 KB Output is correct
14 Correct 31 ms 2560 KB Output is correct
15 Correct 38 ms 3184 KB Output is correct
16 Correct 48 ms 4204 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 34 ms 3436 KB Output is correct
21 Correct 42 ms 3316 KB Output is correct
22 Correct 40 ms 3952 KB Output is correct
23 Correct 42 ms 3944 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2552 KB Output is correct
12 Correct 765 ms 51580 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 30 ms 3320 KB Output is correct
18 Correct 777 ms 68504 KB Output is correct
19 Correct 897 ms 77336 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 8 ms 1148 KB Output is correct
25 Correct 26 ms 3068 KB Output is correct
26 Correct 27 ms 3192 KB Output is correct
27 Correct 896 ms 82968 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 48 ms 4204 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 9 ms 1288 KB Output is correct
35 Correct 1391 ms 91988 KB Output is correct
36 Correct 1316 ms 87004 KB Output is correct
37 Correct 1297 ms 86100 KB Output is correct
38 Correct 1390 ms 92116 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 640 KB Output is correct
44 Correct 3 ms 640 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 640 KB Output is correct
48 Correct 3 ms 640 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 32 ms 2552 KB Output is correct
52 Correct 31 ms 2560 KB Output is correct
53 Correct 38 ms 3184 KB Output is correct
54 Correct 48 ms 4204 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 34 ms 3436 KB Output is correct
59 Correct 42 ms 3316 KB Output is correct
60 Correct 40 ms 3952 KB Output is correct
61 Correct 42 ms 3944 KB Output is correct
62 Correct 86 ms 6136 KB Output is correct
63 Correct 89 ms 6172 KB Output is correct
64 Correct 135 ms 10592 KB Output is correct
65 Correct 448 ms 30552 KB Output is correct
66 Correct 598 ms 40644 KB Output is correct
67 Correct 9 ms 1288 KB Output is correct
68 Correct 7 ms 1024 KB Output is correct
69 Correct 757 ms 51680 KB Output is correct
70 Correct 1075 ms 68504 KB Output is correct
71 Correct 1419 ms 92084 KB Output is correct
72 Correct 1200 ms 88284 KB Output is correct
73 Correct 1289 ms 86680 KB Output is correct
74 Correct 932 ms 68128 KB Output is correct
75 Correct 1051 ms 67476 KB Output is correct