Submission #353080

#	Time	Username	Problem	Language	Result	Execution time	Memory
353080		juggernaut	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	364 KiB

tickets

#include"tickets.h"
#include<bits/stdc++.h>
#ifndef EVAL
#include"grader.cpp"
#endif
using namespace std;
long long find_maximum(int k,vector<vector<int>>x){
	int n=x.size();
	int m=x[0].size();
	vector<pair<int,int>>v;
	vector<vector<int>>answer(n,vector<int>(m,-1));
	for(int i=0;i<n;i++)
        v.push_back({x[i][m-1]-x[i][0],i});
    sort(v.begin(),v.end());
    int i;
    long long res=0;
    for(i=0;i<(n>>1);i++){
        answer[v[i].second][0]=0;
        res-=x[v[i].second][0];
    }
    for(;i<n;i++){
        answer[v[i].second][m-1]=0;
        res+=x[v[i].second][m-1];
    }
    allocate_tickets(answer);
    return res;
}

• 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