제출 #794897

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long best[1501];
vector<pair<long long, long long>> x2[1501], arr;
long long calc(vector<long long> v) {
    sort(v.begin(), v.end());
    long long ans = 0;
    for(auto i: v)
        ans+=abs(i-v[v.size()/2]);
    return ans;
}
long long find_maximum(int k, vector<vector<int>> x) {
	long long n = x.size();
	long long m = x[0].size();
	vector<vector<int>> answer;
    vector<long long> v;
    for(long long i = 0; i < n; i++) {
        for(long long j = 0; j < m; j++) {
            x2[i].push_back({x[i][j],j});
        }
        sort(x2[i].begin(), x2[i].end());
        arr.push_back({x2[i][m-1].first-x2[i][0].first, i});
    }
    sort(arr.rbegin(), arr.rend());
    for(long long i = 0; i < n; i++)
        if(i<n/2)
            best[arr[i].second] = x2[arr[i].second][0].second;
        else
            best[arr[i].second] = x2[arr[i].second][m-1].second;
	for (long long i = 0; i < n; i++) {
		vector<int> row(m);
		for (long long j = 0; j < m; j++) {
			if (j == best[i]) {
				row[j] = 0;
                v.push_back(x[i][j]);
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return calc(v);
}

컴파일 시 표준 에러 (stderr) 메시지

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:26:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   26 |     for(long long i = 0; i < n; i++)
      |     ^~~
tickets.cpp:31:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   31 |  for (long long i = 0; i < n; i++) {
      |  ^~~

• 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