oj.uz

Submission #300952

# Submission time Handle Problem Language Result Execution time Memory
300952 2020-09-17T15:25:28 Z lohacho Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1114 ms 78776 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)2e9;
using LL = long long;
int L[2004];
vector < int > dif[2004];
priority_queue < pair < int, int > > big, low;
int pos[2004];
vector < int > use_l[2004], use_r[2004];
vector < int > zero;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int N = x.size();
	int M = x[0].size();
	std::vector<std::vector<int>> answer;
	answer.resize(N);
	LL sum = 0;
    for(int i = 0; i < N / 2; ++i){
        answer[i].resize(M);
        L[i] = k;
        for(int j = k - 1; j >= 0; --j){
            sum -= x[i][j];
            dif[i].push_back(x[i][M - (k - j)] + x[i][j]);
        }
        dif[i].push_back(-INF);
        big.push(make_pair(dif[i][0], i));
    }
    for(int i = N / 2; i < N; ++i){
        answer[i].resize(M);
        L[i] = 0;
        for(int j = M - k; j < M; ++j){
            sum += x[i][j];
            dif[i].push_back(-x[i][j] - x[i][j - (M - k)]);
        }
        dif[i].push_back(-INF);
        low.push(make_pair(dif[i][0], i));
    }
    while(1){
        auto b = big.top(), l = low.top();
        big.pop(), low.pop();
        LL val = (LL)b.first + l.first;
        if(val <= 0){
            break;
        }
        sum += val;
        ++pos[b.second], big.push(make_pair(dif[b.second][pos[b.second]], b.second)); --L[b.second];
        ++pos[l.second], low.push(make_pair(dif[l.second][pos[l.second]], l.second)); ++L[l.second];
    }
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < L[i]; ++j){
            use_l[i].push_back(j);
        }
        for(int j = M - k + L[i]; j < M; ++j){
            use_r[i].push_back(j);
        }
        if(L[i] == k) zero.push_back(i);
    }
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < M; ++j){
            answer[i][j] = -1;
        }
    }
    for(int i = 0; i < k; ++i){
        int cnt = 0;
        for(auto&j:zero){
            ++cnt;
            answer[j][use_l[j].back()] = i;
            use_l[j].pop_back();
        }
        for(int j = 0; j < N; ++j){
            if(!(int)use_r[j].size()) continue;
            if(cnt < N / 2 && (int)use_l[j].size()){
                ++cnt;
                answer[j][use_l[j].back()] = i;
                use_l[j].pop_back();
            }
            else{
                answer[j][use_r[j].back()] = i;
                use_r[j].pop_back();
                if((int)use_r[j].size() == 0){
                    zero.push_back(j);
                }
            }
        }
    }
    allocate_tickets(answer);
	return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 35 ms 2680 KB Output is correct
6 Correct 824 ms 51704 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 26 ms 3200 KB Output is correct
6 Correct 665 ms 64696 KB Output is correct
7 Correct 736 ms 67972 KB Output is correct
8 Correct 4 ms 768 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 8 ms 1204 KB Output is correct
13 Correct 26 ms 2772 KB Output is correct
14 Correct 25 ms 2936 KB Output is correct
15 Correct 824 ms 75924 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 40 ms 3832 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 9 ms 1280 KB Output is correct
8 Correct 1099 ms 78776 KB Output is correct
9 Correct 987 ms 75000 KB Output is correct
10 Correct 977 ms 73484 KB Output is correct
11 Correct 1094 ms 78536 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 4 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 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 4 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 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 49 ms 2552 KB Output is correct
14 Correct 33 ms 2552 KB Output is correct
15 Correct 47 ms 3196 KB Output is correct
16 Correct 41 ms 3832 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 32 ms 3196 KB Output is correct
21 Correct 51 ms 3064 KB Output is correct
22 Correct 46 ms 3704 KB Output is correct
23 Correct 38 ms 3576 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 1024 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 35 ms 2680 KB Output is correct
12 Correct 824 ms 51704 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 26 ms 3200 KB Output is correct
18 Correct 665 ms 64696 KB Output is correct
19 Correct 736 ms 67972 KB Output is correct
20 Correct 4 ms 768 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 8 ms 1204 KB Output is correct
25 Correct 26 ms 2772 KB Output is correct
26 Correct 25 ms 2936 KB Output is correct
27 Correct 824 ms 75924 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 40 ms 3832 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 9 ms 1280 KB Output is correct
35 Correct 1099 ms 78776 KB Output is correct
36 Correct 987 ms 75000 KB Output is correct
37 Correct 977 ms 73484 KB Output is correct
38 Correct 1094 ms 78536 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 4 ms 640 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 3 ms 640 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 1 ms 512 KB Output is correct
46 Correct 1 ms 512 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 49 ms 2552 KB Output is correct
52 Correct 33 ms 2552 KB Output is correct
53 Correct 47 ms 3196 KB Output is correct
54 Correct 41 ms 3832 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 640 KB Output is correct
58 Correct 32 ms 3196 KB Output is correct
59 Correct 51 ms 3064 KB Output is correct
60 Correct 46 ms 3704 KB Output is correct
61 Correct 38 ms 3576 KB Output is correct
62 Correct 132 ms 6264 KB Output is correct
63 Correct 97 ms 6264 KB Output is correct
64 Correct 128 ms 8696 KB Output is correct
65 Correct 403 ms 28280 KB Output is correct
66 Correct 479 ms 33016 KB Output is correct
67 Correct 9 ms 1280 KB Output is correct
68 Correct 8 ms 1024 KB Output is correct
69 Correct 811 ms 51836 KB Output is correct
70 Correct 972 ms 64632 KB Output is correct
71 Correct 1114 ms 78608 KB Output is correct
72 Correct 894 ms 76536 KB Output is correct
73 Correct 1099 ms 75704 KB Output is correct
74 Correct 845 ms 63244 KB Output is correct
75 Correct 1046 ms 62752 KB Output is correct