# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300440 | 20160161simone | Carnival Tickets (IOI20_tickets) | C++14 | 765 ms | 51444 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m;
const ll N=1.5e3+10,INF=1e18;
ll t[N];
struct node{
ll num,val;
}a[N];
ll cmp(node a,node b){
return a.val<b.val;
}
long long find_maximum(int k, std::vector<std::vector<int> > x) {
n = x.size();
m = x[0].size();
vector<std::vector<int> > ans;
for (int i = 0; i < n; i++) {
vector<int> row;
for (int j = 0; j < m; j++) row.push_back(-1);
ans.push_back(row);
}
if(m==1){
for(int i=0;i<n;i++) ans[i][0]=0;
allocate_tickets(ans);
ll s=0;
for(int i=0;i<n;i++) t[i]=x[i][0];
sort(t,t+n);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |