제출 #622323

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
//
const ll MAX = 1e18;
vector<vector<int>> a;
int n, m, k;
ll st1() {
    vector<vector<int>> allo;
    allo.resize(n, {0});
    allocate_tickets(allo);
    vector<ll> shit(n);
    for (int i = 0; i < n; i++) shit[i] = a[i][0];
    sort(shit.begin(), shit.end());
    ll ans = MAX, cur = 0;
    for (int i = 0; i < n; i++) {
        cur += shit[i];
    }
    int delta = -n;
    for (int i = 0; i < n; i++) {
        cur += (shit[i] - (i == 0 ? 0 : shit[i - 1])) * delta;
        ans = min(ans, cur);
        delta += 2;
    }
    return ans;
}
long long find_maximum(int K, vector<vector<int>> x) {
    n = x.size(); m = x[0].size(); k = K; a = x;
    if (m == 1) return st1();
}

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
   35 | }
      | ^

• 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