제출 #430794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430794		juggernaut	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	2 ms	716 KiB

tickets

#include"tickets.h"
#include<bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include"grader.cpp"
#endif
typedef long long ll;
vector<vector<int>>x;
int n,m;
bool cmp(int l,int r){
    if(x[l][m-1]==x[r][m-1])return x[l][0]<x[r][0];
    return x[l][m-1]>x[r][m-1];
}
ll find_maximum(int k,vector<vector<int>>X){
    ::x=X;
	n=x.size();
	m=x[0].size();
	vector<vector<int>>answer;
	answer.assign(n,vector<int>(m,-1));
	vector<int>vec(n);
	iota(vec.begin(),vec.end(),0);
	ll sum=0;
    sort(vec.begin(),vec.end(),cmp);
    for(int i=0;i<n/2;i++){
        sum+=x[vec[i]][m-1];;
        answer[vec[i]][m-1]=0;
    }
    for(int i=0;i<n;i++)if(answer[i][m-1]!=0)answer[i][0]=0,sum-=x[i][0];
	allocate_tickets(answer);
	return sum;
}

• 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