제출 #955039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955039		Trisanu_Das	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	414 ms	73192 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
 
long long find_maximum(int k, vector<vector<int> > x) {
  int n = x.size(), m = x[0].size();
  vector<vector<int> > ans(n, vector<int>(m, -1));
  if(k == 1){
    long long sum = 0;
    priority_queue<pair<long long, long long>,  vector<pair<long long, long long> >, greater<pair<long long, long long> > > pq;
    for(int i = 0; i < n; i++){
      sum += x[i][m - 1];
      pq.push({x[i][0] + x[i][m - 1], i});
    }
    for(int i = 0; i < n; i++){
      if(i < n / 2){
        sum -= pq.top().first;
        ans[pq.top().second][0] = 0;
      }else ans[pq.top().second][m - 1] = 0;
      pq.pop();
    }
    allocate_tickets(ans);
    return sum;
  }
}

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

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

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10