Submission #864767

#	Time	Username	Problem	Language	Result	Execution time	Memory
864767		andrei_boaca	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	401 ms	82136 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll ans=0;
int n,m;
vector<vector<int>> sol,v;
bool comp(pll a, pll b)
{
    return a.second>b.second;
}
long long find_maximum(int k, std::vector<std::vector<int>> vectoras) {
	n = vectoras.size();
	m = vectoras[0].size();
	sol=vectoras;
    v=vectoras;
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            sol[i][j]=-1;
    if(k==1)
    {
        vector<pll> a;
        for(int i=0;i<n;i++)
        {
            sol[i][0]=0;
            ans-=v[i][0];
            a.push_back({i,v[i][m-1]+v[i][0]});
        }
        sort(a.begin(),a.end(),comp);
        for(int i=0;i<n/2;i++)
        {
            ll poz=a[i].first;
            ans+=v[poz][0]+v[poz][m-1];
            sol[poz][0]=-1;
            sol[poz][m-1]=0;
        }
        allocate_tickets(sol);
        return ans;
    }
	return 1;
}

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