제출 #1225270

#제출 시각아이디문제언어결과실행 시간메모리
1225270Nonoze카니발 티켓 (IOI20_tickets)C++20
11 / 100
1 ms836 KiB
#include "tickets.h" #include <bits/stdc++.h> #define fi first #define se secod #define sz(x) (int)x.size() #define cmin(a, b) a=min(a, b) #define cmax(a, b) a=max(a, b) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define pb push_back #define int long long using namespace std; int n, m, k; vector<vector<int>> a; int find_maximum(signed K, vector<vector<signed>> x) { n=sz(x), m=sz(x[0]), k=K; a.resize(n, vector<int>(m)); for (int i=0; i<n; i++) for (int j=0; j<m; j++) a[i][j]=x[i][j]; vector<vector<signed>> ans(n, vector<signed>(m, -1)); if (m==1) { ans.clear(), ans.resize(n, vector<signed>(m, 0)); allocate_tickets(ans); vector<int> b; for (int i=0; i<n; i++) b.pb(a[i][0]); sort(all(b)); int res=0; for (int i=0; i<n/2; i++) res+=b[n-i-1]-b[i]; return res; } }

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

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