oj.uz

Submission #300815

# Submission time Handle Problem Language Result Execution time Memory
300815 2020-09-17T13:59:38 Z 79brue Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1328 ms 135564 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

typedef long long ll;

struct dat{
    int i, l, r; ll val;
    dat(){}
    dat(int i, int l, int r, ll val): i(i), l(l), r(r), val(val){}

    bool operator<(const dat &tr)const{
        if(val == tr.val) return l < tr.l;
        return val < tr.val;
    }
};

vector<vector<int> > ans;
ll ansV;
vector<dat> vec;

queue<int> small[1502], big[1502];
int only[1502]; /// 0: all, 1: only small, 2: only big

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size(), nh = n/2;
	int m = x[0].size();

	ans.resize(n);
	for(int i=0; i<n; i++) ans[i] = vector<int>(m, -1);

	for(int i=0; i<n; i++){
        for(int j=0; j<k; j++){
            ansV += x[i][m-k+j];
            vec.push_back(dat(i, j, m-k+j, x[i][j] + x[i][m-k+j]));
            big[i].push(m-k+j);
        }
	}
	sort(vec.begin(), vec.end());

	for(int i=0; i<nh*k; i++){
        dat tmp = vec[i];
        ansV -= tmp.val;

        assert(big[tmp.i].front() == tmp.r);
        big[tmp.i].pop();
        small[tmp.i].push(tmp.l);
	}

    for(int c=0; c<k; c++){
        for(int i=0; i<n; i++){
            if(big[i].empty()) only[i] = 1;
            else if(small[i].empty()) only[i] = 2;
            else only[i] = 0;
        }
        int smallCnt = 0, bigCnt = 0;
        for(int i=0; i<n; i++){
            if(!only[i]) continue;
            if(only[i] == 1){
                ans[i][small[i].front()] = c;
                small[i].pop(), smallCnt++;
            }
            else{
                ans[i][big[i].front()] = c;
                big[i].pop(), bigCnt++;
            }
        }
        for(int i=0; i<n; i++){
            if(only[i]) continue;
            if(smallCnt < nh){
                ans[i][small[i].front()] = c;
                small[i].pop(), smallCnt++;
            }
            else{
                ans[i][big[i].front()] = c;
                big[i].pop(), bigCnt++;
            }
        }
    }

    allocate_tickets(ans);
    return ansV;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 3 ms 2432 KB Output is correct
6 Correct 3 ms 2816 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 5 ms 2432 KB Output is correct
5 Correct 34 ms 4480 KB Output is correct
6 Correct 787 ms 53496 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 4 ms 2560 KB Output is correct
5 Correct 44 ms 5624 KB Output is correct
6 Correct 768 ms 84100 KB Output is correct
7 Correct 801 ms 94860 KB Output is correct
8 Correct 8 ms 3008 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 2 ms 2304 KB Output is correct
11 Correct 2 ms 2304 KB Output is correct
12 Correct 13 ms 3200 KB Output is correct
13 Correct 26 ms 5240 KB Output is correct
14 Correct 29 ms 5764 KB Output is correct
15 Correct 874 ms 104708 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 5 ms 2752 KB Output is correct
5 Correct 47 ms 6896 KB Output is correct
6 Correct 9 ms 3088 KB Output is correct
7 Correct 10 ms 3196 KB Output is correct
8 Correct 1313 ms 135548 KB Output is correct
9 Correct 1232 ms 133644 KB Output is correct
10 Correct 1190 ms 133768 KB Output is correct
11 Correct 1284 ms 135564 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 4 ms 2432 KB Output is correct
3 Correct 4 ms 2560 KB Output is correct
4 Correct 5 ms 2560 KB Output is correct
5 Correct 5 ms 2560 KB Output is correct
6 Correct 5 ms 2728 KB Output is correct
7 Correct 3 ms 2432 KB Output is correct
8 Correct 2 ms 2432 KB Output is correct
9 Correct 5 ms 2560 KB Output is correct
10 Correct 5 ms 2688 KB Output is correct
11 Correct 6 ms 2752 KB Output is correct
12 Correct 7 ms 2752 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 4 ms 2432 KB Output is correct
3 Correct 4 ms 2560 KB Output is correct
4 Correct 5 ms 2560 KB Output is correct
5 Correct 5 ms 2560 KB Output is correct
6 Correct 5 ms 2728 KB Output is correct
7 Correct 3 ms 2432 KB Output is correct
8 Correct 2 ms 2432 KB Output is correct
9 Correct 5 ms 2560 KB Output is correct
10 Correct 5 ms 2688 KB Output is correct
11 Correct 6 ms 2752 KB Output is correct
12 Correct 7 ms 2752 KB Output is correct
13 Correct 38 ms 4480 KB Output is correct
14 Correct 35 ms 4472 KB Output is correct
15 Correct 40 ms 5644 KB Output is correct
16 Correct 56 ms 6988 KB Output is correct
17 Correct 4 ms 2432 KB Output is correct
18 Correct 7 ms 2560 KB Output is correct
19 Correct 3 ms 2432 KB Output is correct
20 Correct 35 ms 6004 KB Output is correct
21 Correct 42 ms 5912 KB Output is correct
22 Correct 40 ms 6660 KB Output is correct
23 Correct 44 ms 6784 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2304 KB Output is correct
2 Correct 2 ms 2304 KB Output is correct
3 Correct 2 ms 2304 KB Output is correct
4 Correct 2 ms 2304 KB Output is correct
5 Correct 3 ms 2432 KB Output is correct
6 Correct 3 ms 2816 KB Output is correct
7 Correct 2 ms 2304 KB Output is correct
8 Correct 2 ms 2304 KB Output is correct
9 Correct 2 ms 2304 KB Output is correct
10 Correct 5 ms 2432 KB Output is correct
11 Correct 34 ms 4480 KB Output is correct
12 Correct 787 ms 53496 KB Output is correct
13 Correct 2 ms 2304 KB Output is correct
14 Correct 2 ms 2304 KB Output is correct
15 Correct 2 ms 2304 KB Output is correct
16 Correct 4 ms 2560 KB Output is correct
17 Correct 44 ms 5624 KB Output is correct
18 Correct 768 ms 84100 KB Output is correct
19 Correct 801 ms 94860 KB Output is correct
20 Correct 8 ms 3008 KB Output is correct
21 Correct 2 ms 2304 KB Output is correct
22 Correct 2 ms 2304 KB Output is correct
23 Correct 2 ms 2304 KB Output is correct
24 Correct 13 ms 3200 KB Output is correct
25 Correct 26 ms 5240 KB Output is correct
26 Correct 29 ms 5764 KB Output is correct
27 Correct 874 ms 104708 KB Output is correct
28 Correct 2 ms 2304 KB Output is correct
29 Correct 2 ms 2304 KB Output is correct
30 Correct 2 ms 2304 KB Output is correct
31 Correct 5 ms 2752 KB Output is correct
32 Correct 47 ms 6896 KB Output is correct
33 Correct 9 ms 3088 KB Output is correct
34 Correct 10 ms 3196 KB Output is correct
35 Correct 1313 ms 135548 KB Output is correct
36 Correct 1232 ms 133644 KB Output is correct
37 Correct 1190 ms 133768 KB Output is correct
38 Correct 1284 ms 135564 KB Output is correct
39 Correct 2 ms 2304 KB Output is correct
40 Correct 4 ms 2432 KB Output is correct
41 Correct 4 ms 2560 KB Output is correct
42 Correct 5 ms 2560 KB Output is correct
43 Correct 5 ms 2560 KB Output is correct
44 Correct 5 ms 2728 KB Output is correct
45 Correct 3 ms 2432 KB Output is correct
46 Correct 2 ms 2432 KB Output is correct
47 Correct 5 ms 2560 KB Output is correct
48 Correct 5 ms 2688 KB Output is correct
49 Correct 6 ms 2752 KB Output is correct
50 Correct 7 ms 2752 KB Output is correct
51 Correct 38 ms 4480 KB Output is correct
52 Correct 35 ms 4472 KB Output is correct
53 Correct 40 ms 5644 KB Output is correct
54 Correct 56 ms 6988 KB Output is correct
55 Correct 4 ms 2432 KB Output is correct
56 Correct 7 ms 2560 KB Output is correct
57 Correct 3 ms 2432 KB Output is correct
58 Correct 35 ms 6004 KB Output is correct
59 Correct 42 ms 5912 KB Output is correct
60 Correct 40 ms 6660 KB Output is correct
61 Correct 44 ms 6784 KB Output is correct
62 Correct 106 ms 8056 KB Output is correct
63 Correct 88 ms 8248 KB Output is correct
64 Correct 130 ms 14948 KB Output is correct
65 Correct 433 ms 38740 KB Output is correct
66 Correct 523 ms 52668 KB Output is correct
67 Correct 11 ms 3196 KB Output is correct
68 Correct 9 ms 3088 KB Output is correct
69 Correct 888 ms 53800 KB Output is correct
70 Correct 1018 ms 84132 KB Output is correct
71 Correct 1328 ms 135564 KB Output is correct
72 Correct 1014 ms 134580 KB Output is correct
73 Correct 1134 ms 109344 KB Output is correct
74 Correct 900 ms 85588 KB Output is correct
75 Correct 966 ms 84488 KB Output is correct