Submission #307125

#	Time	Username	Problem	Language	Result	Execution time	Memory
307125		Ruxandra985	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	2 ms	768 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
#define DIMN 1510
 
using namespace std;
 
 
pair <int , int> v[DIMN];
 
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size() , i;
	int m = x[0].size();
	long long sol = 0;
	vector<vector<int>> answer;
	for (i = 0; i < n; i++) {
		vector<int> row(m);
		answer.push_back(row);
	}
 
 
	if (m == 1){
 
        for (i = 0 ; i < n ; i++){
            answer[i][0] = 0;
            v[i] = make_pair(x[i][0] , i);
        }
 
        sort (v , v + n);
 
        for (i = 0 ; i < n ; i++){
 
            if (i < n / 2)
                sol = sol - v[i].first;
            else
                sol = sol + v[i].first;
        }
 
 
	}
 
	allocate_tickets(answer);
	return sol;
}

• 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