# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384764 | 2021-04-02T08:05:05 Z | nicholask | Carnival Tickets (IOI20_tickets) | C++14 | 669 ms | 65724 KB |
#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 (k==1){ ll sum=0; priority_queue <pair <ll,ll>,vector <pair <ll,ll> >,greater <pair <ll,ll> > > pq; for (ll i=0; i<n; i++){ sum+=x[i][m-1]; pq.push({x[i][0]+x[i][m-1],i}); } for (ll 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; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 2 ms | 748 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 3 ms | 492 KB | Output is correct |
5 | Correct | 28 ms | 3308 KB | Output is correct |
6 | Correct | 669 ms | 65724 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 620 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 620 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 620 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 620 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 2 ms | 748 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 1 ms | 364 KB | Output is correct |
9 | Correct | 1 ms | 364 KB | Output is correct |
10 | Correct | 3 ms | 492 KB | Output is correct |
11 | Correct | 28 ms | 3308 KB | Output is correct |
12 | Correct | 669 ms | 65724 KB | Output is correct |
13 | Runtime error | 3 ms | 620 KB | Execution killed with signal 6 |
14 | Halted | 0 ms | 0 KB | - |