제출 #622476

#제출 시각아이디문제언어결과실행 시간메모리
622476happypotato카니발 티켓 (IOI20_tickets)C++17
11 / 100
2 ms724 KiB
#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 = 0, cur = shit[n / 2]; for (int i = 0; i < n; i++) { ans += abs(shit[i] - cur); } 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:29:1: warning: control reaches end of non-void function [-Wreturn-type]
   29 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...