oj.uz

Submission #955041

# Submission time Handle Problem Language Result Execution time Memory
955041 2024-03-29T08:32:03 Z Trisanu_Das Carnival Tickets (IOI20_tickets) C++17
76 / 100
 2870 ms 225968 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#include <vector>
 
using namespace std;
 
int n;
int m;
long long res = 0;
vector<int> l, r;
vector<vector<int>> sg, ans;
set<pair<int, pair<int, int>>> prio;
 
long long find_maximum(int k, vector<vector<int>> x) {
	n = x.size();
	m = x[0].size();
	l.resize(n, 0);
	r.resize(n, m - 1);
	sg.resize(n, vector<int>(m, 0));
	ans.resize(n, vector<int>(m, -1));
	for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            sg[i][j] = -1;
            int s, p;
            s = x[i][j];
            p = x[i][m - k + j];
            prio.insert(make_pair(-s - p, make_pair(i, j)));
            res -= s;
        }
    }
    int cnt = 0;
    for (auto it = prio.begin(); cnt < n * k / 2; cnt++, it++)
    {
        auto v = *it;
        res -= v.first;
        auto pos = v.second;
        sg[pos.first][pos.second] = 0;
        sg[pos.first][m - k + pos.second] = 1;
    }
    for (int t = 0; t < k; t++) {
        int plus = 0;
        for (int i = 0; i < n; i++) if (sg[i][l[i]] != -1) plus++;
        for (int i = 0; i < n; i++) {
            if (sg[i][l[i]] != -1) {
                ans[i][r[i]] = t;
                r[i]--;
            }else if (sg[i][r[i]] != 1){
                ans[i][l[i]] = t;
                l[i]++;
            } else {
                if (plus < n / 2) {
                    plus++;
                    ans[i][r[i]] = t;
                    r[i]--;
                } else{
                    ans[i][l[i]] = t;
                    l[i]++;
                }
            }
        }
    }
    allocate_tickets(ans);
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 387 ms 60672 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Contestant returned 4 but the tickets gives a total value of 6
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 40 ms 9240 KB Output is correct
6 Correct 6 ms 1884 KB Output is correct
7 Correct 9 ms 2140 KB Output is correct
8 Correct 2870 ms 225720 KB Output is correct
9 Correct 2331 ms 210724 KB Output is correct
10 Correct 2294 ms 210880 KB Output is correct
11 Correct 2688 ms 225968 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 3 ms 960 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 3 ms 960 KB Output is correct
13 Correct 16 ms 3676 KB Output is correct
14 Correct 17 ms 3676 KB Output is correct
15 Correct 29 ms 6484 KB Output is correct
16 Correct 39 ms 9344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 856 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 29 ms 6732 KB Output is correct
21 Correct 29 ms 7248 KB Output is correct
22 Correct 34 ms 8272 KB Output is correct
23 Correct 34 ms 8752 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 16 ms 2652 KB Output is correct
12 Correct 387 ms 60672 KB Output is correct
13 Incorrect 0 ms 344 KB Contestant returned 4 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -