Submission #1291683

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291683		julia_08	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	1 ms	348 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"

using ll = long long;

using namespace std;

const int MAXN = 1510;

int sum[MAXN];

set<int> num[MAXN];

ll find_maximum(int k, vector<vector<int>> x){

	int n = x.size();
	int m = x[0].size();

	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			sum[i] += x[i][j];
			num[i].insert(j);
		}
	}

	vector<vector<int>> ans;

	for(int i=0; i<n; i++){
		ans.push_back({});
	  ans[i].push_back(0);
	}

	int ans_max = 0;

  vector<int> aux;

  for(int i=0; i<n; i++) aux.push_back(x[i][0]);

  sort(aux.begin(), aux.end());

  for(int i=0; i<n; i++){
    if(i < n / 2){
      ans_max -= aux[i];
    } else ans_max += aux[i];
  }

	allocate_tickets(ans);

	return ans_max;

}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10