Submission #621467

#	Time	Username	Problem	Language	Result	Execution time	Memory
621467		John3_141592	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	2 ms	724 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define ll long long
#define par pair<int,int>
#define f first
#define s second
#define ld long duble
#define ull unsigned long long
#define st short int

using namespace std;

ll find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector <int> vec;
	vector <vector<int>> answer;
	for(int i=0;i<n;i++){
        vector <int> aux;
        for(int j=0;j<m;j++){
            aux.push_back(0);
            vec.push_back(x[i][j]);
        }
        answer.push_back(aux);
	}
	sort(vec.begin(),vec.end());
    ll solve=0;
    for(int i=0;i<n;i++){
        if(i<n/2) solve-=vec[i];
        else solve+=vec[i];
    }
	allocate_tickets(answer);
	return solve;
}

• Subtask 1: 11 / 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