제출 #431881

#제출 시각아이디문제언어결과실행 시간메모리
431881Pbezz카니발 티켓 (IOI20_tickets)C++14
11 / 100
2 ms588 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back typedef pair<ll,ll> pii; const ll MAXN = 2e5+5; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(),i; ll ans=0; int m = x[0].size(); std::vector<std::vector<int>> answer; for (int i = 0; i < n; i++) { std::vector<int> row(m); for (int j = 0; j < m; j++) { if (j < k) { row[j] = j; } else { row[j] = -1; } } answer.push_back(row); } allocate_tickets(answer); vector<int>p; for(i=0;i<n;i++){ p.pb(x[i][0]); } sort(p.begin(),p.end()); for(i=0;i<n;i++){ ans+=(ll)abs(p[i]-p[n/2]); } return ans; }
#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...