Submission #1193722

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193722		simona1230	카니발 티켓 (IOI20_tickets)	C++20	0 / 100	0 ms	328 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int nn,mm;
int a[1501][1501];

vector<vector<int> > v;
long long find_maximum(int k, std::vector<std::vector<int>> x)
{
    v=x;
	nn=x.size();
	mm=x[0].size();

	for(int i=0;i<nn;i++)
    {
        for(int j=0;j<mm;j++)
        {
            a[i][j]=x[i][j];
        }
    }

    if(mm==1)
    {
        vector<int> h;
        for(int i=0;i<nn;i++)
            h.push_back(a[i][0]);
        sort(h.begin(),h.end());
        long long sz=h.size()/2,ans=0;
        for(int i=0;i<nn;i++)
            ans+=abs(h[i]-h[sz]);
        for(int i=0;i<nn;i++)
            v[i][0]=1;
        allocate_tickets(v);
        return ans;
    }
	return 1;
}

• 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