제출 #301906

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
const int N = 200100;
vector<int> vc;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> answer;

	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		row[0] = 0;
		answer.push_back(row);
	}

	allocate_tickets(answer);

	ll ans = 0;

	vc.clear();

	for (int i = 0; i < n; i++)
        vc.PB(x[i][0]);

    sort(all(vc));

    for (int i = 0; i < n; i++)
        ans += abs(vc[i] - vc[sz(vc) / 2]);

	return ans;
}

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

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

• 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