Submission #1014991

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014991		Ahmed_Solyman	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	348 KiB

tickets

/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>

using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
#define endl '\n'
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void allocate_tickets(vector<vector<int>>s);

ll find_maximum(int k,vector<vector<int>>v){
    int n=(int)v.size();
    int m=(int)v[0].size();
    vector<vector<int>>g(n,vector<int>(m,1));
    allocate_tickets(g);
    vector<int>p;
    for(int i=0;i<n;i++)p.push_back(v[i][0]);
    sort(all(p));
    int med=p[n/2];
    ll ret=0;
    for(auto i:p)ret+=abs(med-i);
    return ret;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10