Submission #569068

#	Time	Username	Problem	Language	Result	Execution time	Memory
569068		Stickfish	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	212 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ansarr(n, vector<int>(m));
    ll ans = 0;
    if (m == 1) {
        vector<int> v = ansarr[0];
        sort(v.begin(), v.end());
        int d = v[n / 2];
        for (int i = 0; i < n; ++i)
            ans += abs(d - v[i]);
    } else if (k == 1) {
        for (int i = 0; i < n; ++i) {

        }
    }
	allocate_tickets(ansarr);
	return ans;
}

• 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