oj.uz

Submission #431439

# Submission time Handle Problem Language Result Execution time Memory
431439 2021-06-17T11:54:53 Z saleh Carnival Tickets (IOI20_tickets) C++17
16 / 100
 814 ms 51392 KB 
#include "tickets.h"//
#include <bits/stdc++.h>

#define int long long

using namespace std;

const int INF = 1e10;

int n, m, jav;
vector<int> chi, zz, cho;

long long find_maximum(int32_t k, vector<vector<int32_t>> x) {
	n = x.size();
	m = x[0].size();
	if (k != 1 || m <= 1) return 8;
	long long jav = 0;
	vector<vector<int32_t>> answer;
	zz.resize(n);
	for (int i = 0; i < n; i++) {
		vector<int32_t> row(m);
		for (int j = 0; j < m; j++)
			row[j] = -1;
		chi.push_back(x[i][0]);
		cho.push_back(x[i].back());
		answer.push_back(row);
	}
	sort(chi.begin(), chi.end());
	vector<int> fnd;
	for (int i = 0; i < n; i++) {
		int ct = 0, jt = 0;
		for (auto j : chi) if (j <= x[i][0]) ct++;
		if (ct < n / 2) continue;
		ct = 0;
		for (auto j : cho) if (j >= x[i][0]) ct++;
		if (ct < n / 2) continue;
		for (int j = 0; j < n; j++) {
			if (x[j].back() < x[i][0]) {
				zz[j] = INF;
				continue;
			}
			if (x[j][0] > x[i][0]) {
				zz[j] = -INF;
				continue;
			}
			zz[j] = - x[j].back() - x[j][0] + (x[i][0] << 1);
		}
		zz[i] = INF + 8;
		vector<int> ch;
		for (int i = 0; i < n; i++) ch.push_back(i);
		sort(ch.begin(), ch.end(), [](int x, int y) { return zz[x] > zz[y]; });
		for (int i = 0; i < n / 2; i++) jt += x[i][0] - x[ch[i]][0];
		for (int i = 0; i < n / 2; i++) jt += x[ch[i + n / 2]].back() - x[i][0];
		if (jt > jav) {
			jav = jt;
			fnd = ch;
		}
	}
	for (int i = 0; i < n / 2; i++) answer[fnd[i]][0] = 0;
	for (int i = 0; i < n / 2; i++) answer[fnd[i + n / 2]][m - 1] = 0;
	allocate_tickets(answer);//
	return jav;
}

//int32_t main() {}//

Subtask #1
0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 29 ms 2348 KB Output is correct
6 Correct 814 ms 51392 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 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 1 ms 204 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 1 ms 248 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 1 ms 248 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 Incorrect 0 ms 204 KB WA in grader: failure to call allocate_tickets
2 Halted 0 ms 0 KB -