oj.uz

Submission #305847

# Submission time Handle Problem Language Result Execution time Memory
305847 2020-09-24T02:36:53 Z Dormi Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1346 ms 92176 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/2*k;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 0 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 2 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 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 31 ms 2552 KB Output is correct
6 Correct 715 ms 51576 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 28 ms 3184 KB Output is correct
6 Correct 749 ms 68580 KB Output is correct
7 Correct 829 ms 77336 KB Output is correct
8 Correct 4 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 25 ms 3192 KB Output is correct
15 Correct 862 ms 83096 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 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 43 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 1340 ms 92176 KB Output is correct
9 Correct 1235 ms 87000 KB Output is correct
10 Correct 1216 ms 85972 KB Output is correct
11 Correct 1295 ms 92116 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 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 512 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 30 ms 2560 KB Output is correct
14 Correct 36 ms 2552 KB Output is correct
15 Correct 41 ms 3192 KB Output is correct
16 Correct 45 ms 4212 KB Output is correct
17 Correct 1 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 33 ms 3444 KB Output is correct
21 Correct 39 ms 3316 KB Output is correct
22 Correct 42 ms 4072 KB Output is correct
23 Correct 41 ms 3952 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 0 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 2 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 1 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2552 KB Output is correct
12 Correct 715 ms 51576 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 28 ms 3184 KB Output is correct
18 Correct 749 ms 68580 KB Output is correct
19 Correct 829 ms 77336 KB Output is correct
20 Correct 4 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 25 ms 3192 KB Output is correct
27 Correct 862 ms 83096 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 43 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 1340 ms 92176 KB Output is correct
36 Correct 1235 ms 87000 KB Output is correct
37 Correct 1216 ms 85972 KB Output is correct
38 Correct 1295 ms 92116 KB Output is correct
39 Correct 1 ms 512 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 30 ms 2560 KB Output is correct
52 Correct 36 ms 2552 KB Output is correct
53 Correct 41 ms 3192 KB Output is correct
54 Correct 45 ms 4212 KB Output is correct
55 Correct 1 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 33 ms 3444 KB Output is correct
59 Correct 39 ms 3316 KB Output is correct
60 Correct 42 ms 4072 KB Output is correct
61 Correct 41 ms 3952 KB Output is correct
62 Correct 86 ms 6136 KB Output is correct
63 Correct 82 ms 6172 KB Output is correct
64 Correct 130 ms 10596 KB Output is correct
65 Correct 428 ms 30536 KB Output is correct
66 Correct 551 ms 40768 KB Output is correct
67 Correct 9 ms 1288 KB Output is correct
68 Correct 7 ms 1024 KB Output is correct
69 Correct 715 ms 51764 KB Output is correct
70 Correct 1006 ms 68412 KB Output is correct
71 Correct 1346 ms 92124 KB Output is correct
72 Correct 1138 ms 88156 KB Output is correct
73 Correct 1230 ms 86792 KB Output is correct
74 Correct 887 ms 68128 KB Output is correct
75 Correct 994 ms 67556 KB Output is correct