oj.uz

Submission #554921

# Submission time Handle Problem Language Result Execution time Memory
554921 2022-04-29T15:35:35 Z Ronin13 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 810 ms 76236 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
int cnt[1501];
bool cmp(int a, int b){
    return cnt[a] < cnt[b];
}

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
    ll cursum = 0;
    set <pll> st;
    ll curl[n], curr[n];
    for(int i = 0; i < n; i++){
        curr[i] = m - k;
        curl[i] = 0;
        st.insert({x[i][m - k] + x[i][0], i});
    }
    // ll cursum = 0;
    for(int i = 0; i < n; i++){
        for(int j = m - k; j < m; j++)cursum += x[i][j];
    }
    int raod = n * k / 2;
    while(raod--){
        pll now = *st.begin();
            st.erase(st.begin());
        cursum -= now.f;
        int ind = now.s;
        curl[ind]++;
        curr[ind]++;
        int ind1 = curl[ind], ind2 = curr[ind];
        if(ind2 < m)
        st.insert({x[ind][ind1] + x[ind][ind2], ind});
    }
    //cout << 1;
    vector <vector<int> > al;
    al.resize(n);
    for(int i = 0; i < n; i++){
        al[i].resize(m);
        for(int j = 0; j < m; j++) al[i][j] = -1;
    }
    for(int i = 0; i < k; i++){
        cnt[i] = 0;
    }
    for(int i = 0; i < n; i++){
        //cout << 1;
        int used[k];
        fill(used, used + k, 0);
        vector <int> vec;
        for(int j = 0; j < k; j++){
            if(cnt[j] < n / 2) vec.pb(j);
        }
        //cout << 1;
      //  cout << curl[i] << ' ';
        sort(vec.begin(), vec.end(), cmp);
        for(int j = 0; j < curl[i]; j++){
            al[i][j] = vec[j];
            used[vec[j]] = 1;
            cnt[vec[j]]++;
        }
        //cout << 0;
        vector <int> good;
        for(int j = 0; j < k; j++){
            if(!used[j]) good.pb(j);
        }
       // cout << 1;
        int ind = 0;
        for(int j = curr[i]; j < m; j++){
            al[i][j] = good[ind++];
        }
    }
    allocate_tickets(al);
	return cursum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 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 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 25 ms 2388 KB Output is correct
6 Correct 500 ms 51460 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 19 ms 2508 KB Output is correct
6 Correct 465 ms 56780 KB Output is correct
7 Correct 505 ms 57236 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 224 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 892 KB Output is correct
13 Correct 17 ms 2232 KB Output is correct
14 Correct 17 ms 2132 KB Output is correct
15 Correct 493 ms 57744 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory 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 4 ms 508 KB Output is correct
5 Correct 29 ms 3320 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 7 ms 1092 KB Output is correct
8 Correct 810 ms 76224 KB Output is correct
9 Correct 700 ms 71028 KB Output is correct
10 Correct 711 ms 71256 KB Output is correct
11 Correct 766 ms 76236 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 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 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 448 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 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 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 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 448 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 19 ms 3244 KB Output is correct
14 Correct 20 ms 3216 KB Output is correct
15 Correct 24 ms 3228 KB Output is correct
16 Correct 29 ms 3276 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 2676 KB Output is correct
21 Correct 27 ms 3256 KB Output is correct
22 Correct 25 ms 2644 KB Output is correct
23 Correct 28 ms 3128 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 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 25 ms 2388 KB Output is correct
12 Correct 500 ms 51460 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 19 ms 2508 KB Output is correct
18 Correct 465 ms 56780 KB Output is correct
19 Correct 505 ms 57236 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 224 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 892 KB Output is correct
25 Correct 17 ms 2232 KB Output is correct
26 Correct 17 ms 2132 KB Output is correct
27 Correct 493 ms 57744 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 4 ms 508 KB Output is correct
32 Correct 29 ms 3320 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 7 ms 1092 KB Output is correct
35 Correct 810 ms 76224 KB Output is correct
36 Correct 700 ms 71028 KB Output is correct
37 Correct 711 ms 71256 KB Output is correct
38 Correct 766 ms 76236 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 3 ms 468 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 448 KB Output is correct
48 Correct 3 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 19 ms 3244 KB Output is correct
52 Correct 20 ms 3216 KB Output is correct
53 Correct 24 ms 3228 KB Output is correct
54 Correct 29 ms 3276 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 2676 KB Output is correct
59 Correct 27 ms 3256 KB Output is correct
60 Correct 25 ms 2644 KB Output is correct
61 Correct 28 ms 3128 KB Output is correct
62 Correct 52 ms 8468 KB Output is correct
63 Correct 54 ms 8416 KB Output is correct
64 Correct 84 ms 8616 KB Output is correct
65 Correct 273 ms 33148 KB Output is correct
66 Correct 332 ms 33816 KB Output is correct
67 Correct 7 ms 1100 KB Output is correct
68 Correct 6 ms 812 KB Output is correct
69 Correct 478 ms 73236 KB Output is correct
70 Correct 631 ms 74292 KB Output is correct
71 Correct 753 ms 76148 KB Output is correct
72 Correct 574 ms 60668 KB Output is correct
73 Correct 695 ms 73380 KB Output is correct
74 Correct 501 ms 59236 KB Output is correct
75 Correct 603 ms 71904 KB Output is correct