제출 #722013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722013		danikoynov	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	2 ms	596 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, M;
vector < vector < int > > answer;
long long find_maximum(int k, vector < vector < int > > x) {
    N = x.size();
    M = x[0].size();

    answer.resize(N);
	for (int i = 0; i < N; i++) {
		answer[i].resize(M);
	}

	ll max_prize = 0;
	if (M == 1)
    {

        vector < int > d;
        for (int i = 0; i < N; i ++)
            d.push_back(x[i][0]);
        sort(d.begin(), d.end());
        for (int i = 0; i < N / 2; i ++)
            max_prize = max_prize - (ll)(d[i]);
        for (int i = N / 2; i < N; i ++)
            max_prize = max_prize + (ll)(d[i]);

        for (int i = 0; i < N; i ++)
            answer[i][0] = 0;
    }

	allocate_tickets(answer);
	return max_prize;
}

• 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