oj.uz

Submission #616050

# Submission time Handle Problem Language Result Execution time Memory
616050 2022-07-31T19:13:36 Z yanndev Carnival Tickets (IOI20_tickets) C++17
27 / 100
 465 ms 73084 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;

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

	if (m == 1) {
		vector<vector<int>> answer;
		vector<int> vals {};
		ll score = 0;
		for (int i = 0; i < n; i++) {
			vector<int> row (m);
			for (int j = 0; j < m; j++) {
				vals.push_back(x[i][j]);
				if (j < k) {
					row[j] = j;
				} else {
					row[j] = -1;
				}
			}
			
			answer.push_back(row);
		}

		sort(vals.begin(), vals.end());
		for (auto& x: vals)
			score += (ll)abs(x - vals[n / 2]);
		allocate_tickets(answer);
		return score;
	}

	if (k == 1) {
		vector<vector<int>> ans (n, vector<int> (m, -1));
		vector<pair<int, int>> op {};

		ll score = 0;
		for (int i = 0; i < n; i++) {
			ans[i][m - 1] = 0;
			score += x[i][m - 1];
			op.push_back({-(x[i][m - 1] + x[i][0]), i});
		}

		sort(op.begin(), op.end());
		reverse(op.begin(), op.end());

		for (int i = 0; i < n / 2; i++) {
			score += op[i].fi;
			ans[op[i].se][m - 1] = -1;
			ans[op[i].se][0] = 0;
		}

		allocate_tickets(ans);
		return score;
	}

	return 0;
}

Subtask #1
11.0 / 11.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 1 ms 212 KB Output is correct
4 Correct 1 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 300 KB Output is correct
2 Correct 1 ms 212 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 3228 KB Output is correct
6 Correct 465 ms 73084 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: failure to call allocate_tickets
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: failure to call allocate_tickets
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: failure to call allocate_tickets
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: failure to call allocate_tickets
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.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 1 ms 212 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 19 ms 3228 KB Output is correct
12 Correct 465 ms 73084 KB Output is correct
13 Incorrect 0 ms 212 KB WA in grader: failure to call allocate_tickets
14 Halted 0 ms 0 KB -