oj.uz

Submission #302000

# Submission time Handle Problem Language Result Execution time Memory
302000 2020-09-18T11:04:24 Z theStaticMind Carnival Tickets (IOI20_tickets) C++14
27 / 100
 827 ms 63592 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()

#include "tickets.h"
#include <vector>

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(n,vector<int> (m, -1));

	vector<int> seq[n];
	vector<int> A;
	int64_t ret = 0;

	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			seq[i].push_back(j);
		}
		sort(all(seq[i]), [&](int a, int b){
			return x[i][a] < x[i][b];
		});
		A.push_back(i);
		ret += x[i][seq[i].back()];
	}

	sort(all(A), [&](int a, int b){
		return x[a][seq[a][0]] + x[a][seq[b][m - 1]] < x[b][seq[b][0]] + x[b][seq[b][m - 1]];
	});

	for(int i = 0; i < n/2; i++){
		ret -= x[A[i]][seq[A[i]][0]];
		ret -= x[A[i]][seq[A[i]][m - 1]];
		answer[A[i]][seq[A[i]][0]] = 0;
	}
	for(int i = n / 2; i < n; i++){
		answer[A[i]][seq[A[i]][m - 1]] = 0;
	}
	

	allocate_tickets(answer);
	return ret;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 33 ms 3064 KB Output is correct
6 Correct 827 ms 63592 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 33 ms 3064 KB Output is correct
12 Correct 827 ms 63592 KB Output is correct
13 Incorrect 1 ms 256 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -