oj.uz

Submission #827562

# Submission time Handle Problem Language Result Execution time Memory
827562 2023-08-16T14:46:03 Z minhcool Carnival Tickets (IOI20_tickets) C++17
100 / 100
 801 ms 61664 KB 
//#define local
#ifndef local
#include "tickets.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
#define ll long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<ll, ll> ii;
typedef pair<ii, ll> iii;
typedef pair<ii, ii> iiii;
 
const ll N = 3e5 + 5;
 
const ll oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(1);
 
ll rnd(ll l, ll r){
	ll temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
ll n, m, itr[N];

int degbig[N], degsmall[N];

#ifdef local
void allocate_tickets(vector<vector<int>> vc){
    for(int i = 0; i < vc.size(); i++){
        for(int j = 0; j < vc[0].size(); j++) cout << vc[i][j] << " ";
        cout << "\n";
    }
}
#endif

bool cmp(ii a, ii b){
    if(a.fi != b.fi) return a.fi > b.fi;
    return a.se < b.se;
}
 
ll find_maximum(int k, vector<vector<int>> x){
    n = x.size(), m = x[0].size();
    ll sum = 0;
    ll ans = 0;
    for(ll i = 0; i < n; i++){
        for(ll j = 0; j < k; j++) ans += (ll)x[i][m - j - 1];
        //cout << x[i][m - 1] << "\n";
        itr[i] = 0;
    }
    priority_queue<ii, vector<ii>> pq;
    //cout << ans << '\n';
    for(ll i = 0; i < n; i++) pq.push({-((ll)x[i][0] + x[i][m - k]), i});
    for(ll i = 1; i <= (n * k)/2; i++){
        ii temp = pq.top();
        pq.pop();
        itr[temp.se]++;
        //cout << temp.fi << "\n";
        ans += temp.fi;
        if(itr[temp.se] < k) pq.push({-((ll)x[temp.se][itr[temp.se]] + x[temp.se][m - k + itr[temp.se]]), temp.se});
    }
    vector<vector<int>> assign;
    assign.resize(n);
    for(int i = 0; i < k; i++) degbig[i] = degsmall[i] = n/2;
    for(ll i = 0; i < n; i++){
        assign[i].resize(m);
        for(int j = 0; j < m; j++) assign[i][j] = -1;
        vector<ii> v;
        for(int j = 0; j < k; j++) v.pb({degsmall[j], j});
        sort(v.begin(), v.end(), greater<ii>());
        for(int j = 0; j < itr[i]; j++){
            assign[i][j] = v[j].se;
            degsmall[v[j].se]--;
        }
        v.clear();
        for(int j = 0; j < k; j++) v.pb({degbig[j], j});
        sort(v.begin(), v.end(), cmp);
        for(int j = itr[i]; j < k; j++){
            //cout << v[j].fi << " " << v[j].se << "\n";
            assign[i][m - k + j] = v[j - itr[i]].se;
            degbig[v[j - itr[i]].se]--;
        }
    }
    allocate_tickets(assign);
    return ans;
}
 
#ifdef local
void process(){
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> temp;
    temp.resize(n);
    for(int i = 0; i < n; i++) temp[i].resize(m);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++) cin >> temp[i][j];
    }
    cout << find_maximum(k, temp);
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}
#endif

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:51:8: warning: unused variable 'sum' [-Wunused-variable]
   51 |     ll sum = 0;
      |        ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 708 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 452 KB Output is correct
5 Correct 16 ms 3284 KB Output is correct
6 Correct 404 ms 56732 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 468 KB Output is correct
5 Correct 19 ms 2576 KB Output is correct
6 Correct 506 ms 56824 KB Output is correct
7 Correct 550 ms 57140 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 836 KB Output is correct
13 Correct 17 ms 2212 KB Output is correct
14 Correct 19 ms 2224 KB Output is correct
15 Correct 570 ms 57744 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 468 KB Output is correct
5 Correct 28 ms 3316 KB Output is correct
6 Correct 5 ms 764 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 801 ms 59148 KB Output is correct
9 Correct 724 ms 61484 KB Output is correct
10 Correct 721 ms 61664 KB Output is correct
11 Correct 763 ms 58992 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 17 ms 3248 KB Output is correct
14 Correct 17 ms 3284 KB Output is correct
15 Correct 22 ms 3276 KB Output is correct
16 Correct 28 ms 3268 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 23 ms 2644 KB Output is correct
21 Correct 23 ms 3212 KB Output is correct
22 Correct 26 ms 2640 KB Output is correct
23 Correct 28 ms 3192 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 708 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 16 ms 3284 KB Output is correct
12 Correct 404 ms 56732 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 19 ms 2576 KB Output is correct
18 Correct 506 ms 56824 KB Output is correct
19 Correct 550 ms 57140 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 836 KB Output is correct
25 Correct 17 ms 2212 KB Output is correct
26 Correct 19 ms 2224 KB Output is correct
27 Correct 570 ms 57744 KB Output is correct
28 Correct 1 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 468 KB Output is correct
32 Correct 28 ms 3316 KB Output is correct
33 Correct 5 ms 764 KB Output is correct
34 Correct 5 ms 980 KB Output is correct
35 Correct 801 ms 59148 KB Output is correct
36 Correct 724 ms 61484 KB Output is correct
37 Correct 721 ms 61664 KB Output is correct
38 Correct 763 ms 58992 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 448 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 508 KB Output is correct
45 Correct 1 ms 312 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 452 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 3 ms 468 KB Output is correct
51 Correct 17 ms 3248 KB Output is correct
52 Correct 17 ms 3284 KB Output is correct
53 Correct 22 ms 3276 KB Output is correct
54 Correct 28 ms 3268 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 23 ms 2644 KB Output is correct
59 Correct 23 ms 3212 KB Output is correct
60 Correct 26 ms 2640 KB Output is correct
61 Correct 28 ms 3192 KB Output is correct
62 Correct 59 ms 8400 KB Output is correct
63 Correct 46 ms 8444 KB Output is correct
64 Correct 80 ms 8664 KB Output is correct
65 Correct 255 ms 33288 KB Output is correct
66 Correct 330 ms 33588 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 8 ms 808 KB Output is correct
69 Correct 416 ms 56236 KB Output is correct
70 Correct 582 ms 57216 KB Output is correct
71 Correct 765 ms 59004 KB Output is correct
72 Correct 702 ms 60616 KB Output is correct
73 Correct 707 ms 57328 KB Output is correct
74 Correct 536 ms 59156 KB Output is correct
75 Correct 574 ms 55372 KB Output is correct