oj.uz

Submission #838153

# Submission time Handle Problem Language Result Execution time Memory
838153 2023-08-26T09:43:46 Z caganyanmaz Carnival Tickets (IOI20_tickets) C++17
25 / 100
 785 ms 105596 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp(x...) array<int, 2>({x})
#define int int64_t
using namespace std;

//#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif

constexpr static int INF = 1e15;
constexpr static int MXN = 1505;
int prefix[MXN][MXN], suffix[MXN][MXN];
void allocate_tickets(vector<vector<int32_t>> s);

int find_maximum(int32_t _k, vector<vector<int32_t>> x) 
{
	int k = _k;
	int n = x.size();
	int m = x[0].size();
	vector<array<int, 2>> v;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			v.pb({x[i][j], i});
	sort(v.begin(), v.end());

	int current_count = k*n/2;
	vector<vector<int32_t>> s(n, vector<int32_t>(m,-1));
	vector<array<int, 2>> bounds(n, {0, m-1}); // Left right
	vector<array<int, 2>> counts; // Small count, n
	vector<int> tcounts(n, 0);
	for (int i = 0; i < n; i++)
		counts.pb({0, i});
	int total_used = 0;
	for (int i = 0; total_used < n*k/2; i++)
	{
		if (tcounts[v[i][1]] >= k)
			continue;
		total_used++;
		tcounts[v[i][1]]++;
		counts[v[i][1]][0]++;
	}
	sort(counts.begin(), counts.end());
	int sum = 0;
	for (int i = 0; i < k; i++)
	{
		for (int j = n/2; j < n; j++)
		{
			sum -= x[counts[j][1]][bounds[counts[j][1]][0]];
			s[counts[j][1]][bounds[counts[j][1]][0]++] = i;
			counts[j][0]--;
		}
		for (int j = 0; j < n/2; j++)
		{
			sum += x[counts[j][1]][bounds[counts[j][1]][1]];
			s[counts[j][1]][bounds[counts[j][1]][1]--] = i;
		}
		sort(counts.begin(), counts.end());
	}
	debug("b");
	allocate_tickets(s);
	return sum;

}

Compilation message

tickets.cpp: In function 'int64_t find_maximum(int32_t, std::vector<std::vector<int> >)':
tickets.cpp:30:6: warning: unused variable 'current_count' [-Wunused-variable]
   30 |  int current_count = k*n/2;
      |      ^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Contestant returned 2307346107 while correct return value is 2727881086.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Contestant returned 23 while correct return value is 25.
4 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.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 2 ms 632 KB Output is correct
5 Correct 26 ms 3680 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 6 ms 1236 KB Output is correct
8 Correct 749 ms 105596 KB Output is correct
9 Correct 718 ms 102972 KB Output is correct
10 Correct 724 ms 103020 KB Output is correct
11 Correct 785 ms 105548 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 2 ms 596 KB Contestant returned 39141745836 while correct return value is 39376297182.
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 2 ms 596 KB Contestant returned 39141745836 while correct return value is 39376297182.
3 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 0 ms 212 KB Output is correct
3 Correct 0 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 1 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Contestant returned 2307346107 while correct return value is 2727881086.
9 Halted 0 ms 0 KB -