제출 #384750

#제출 시각아이디문제언어결과실행 시간메모리
384750nicholask카니발 티켓 (IOI20_tickets)C++14
11 / 100
3 ms748 KiB
#include "tickets.h" #include <bits/stdc++.h> #define pb push_back #define ll long long using namespace std; long long find_maximum(int k,vector <vector <int> > x){ ll n=x.size(),m=x[0].size(); vector <vector <int> > ans(n,vector <int>(m,-1)); if (m==1){ vector <ll> v; for (ll i=0; i<n; i++) v.pb(x[i][0]); sort(v.begin(),v.end()); ll opt=v[v.size()/2]; ll sum=0; for (ll i=0; i<n; i++) sum+=abs(opt-v[i]); for (ll i=0; i<n; i++) ans[i][0]=0; allocate_tickets(ans); return sum; } }

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

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