# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
693160 | NemanjaSo2005 | Carnival Tickets (IOI20_tickets) | C++14 | 1 ms | 212 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<bits/stdc++.h>
#include "tickets.h"
#define ll long long
using namespace std;
int N,M,K,koliko[1505][1505];
struct slog{
int vred,i,j;
}niz[1505];
bool pov(slog a,slog b){
return a.vred<b.vred;
}
vector<vector<int>> kako;
ll find_maximum(int k,vector<vector<int>> d){
kako=d;
for(int i=0;i<kako.size();i++)
for(int j=0;j<kako[i].size();j++)
kako[i][j]=-1;
K=k;
N=d.size();
M=d[0].size();
for(int i=1;i<=N;i++)
for(int j=1;j<=M;j++)
koliko[i][j]=d[i-1][j-1];
if(M==1){
for(int i=1;i<=N;i++){
niz[i].vred=koliko[i][1];
niz[i].i=i-1;
niz[i].j=1-1;
}
sort(niz+1,niz+1+N,pov);
ll res=0;
for(int i=1;i<=N/2;i++){
res-=niz[i].vred;
// cout<<"- "<<niz[i].vred<<endl;
kako[niz[i].i][niz[i].j]=1;
}
for(int i=N/2+1;i<=N;i++){
//cout<<"+ "<<niz[i].vred<<endl;
kako[niz[i].i][niz[i].j]=1;
res+=niz[i].vred;
}
//cout<<res<<endl;
allocate_tickets(kako);
return res;
}
}
Compilation message (stderr)
# | 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... |