Submission #983712

#TimeUsernameProblemLanguageResultExecution timeMemory
983712irmuunCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms856 KiB
#include<bits/stdc++.h> #include "tickets.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() ll find_maximum(int k,vector<vector<int>>x){ auto s=x; int n=x.size(); int m=x[0].size(); if(m==1){ ll ans=0; vector<ll>v; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ s[i][j]=0; v.pb(x[i][j]); } } sort(all(v)); for(int j=n/2;j<n;j++){ ans+=v[j]; } for(int j=0;j<n/2;j++){ ans-=v[j]; } allocate_tickets(s); return ans; } return 0ll; }
#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...