Submission #1291677

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291677		lambd47	Carnival Tickets (IOI20_tickets)	C++20	27 / 100	489 ms	85460 KiB

tickets

#include<bits/stdc++.h>
#include "tickets.h"

using namespace std;
#define ll long long
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer(n,vector<int>(m,-1));

    vector<vector<int>> ord(n,vector<int>(m));
    vector<array<int,3>> tudao;
    vector<vector<bool>> tipo(n,vector<bool>(m,1));//grande ou pequeno
    L(i,0,n-1){
        L(j,0,m-1){
            tudao.push_back({x[i][j],i,j});
        }
    }
    sort(all(tudao));
    L(i,0,(n/2)*m-1){
        tipo[tudao[i][1]][tudao[i][2]]=0;
    }

    L(i,0,n-1){
        iota(all(ord[i]),0);
        sort(all(ord[i]),[&](int a, int b){
                return x[i][a]<x[i][b];
        });
    }
    vector<int> l(n,0);
    vector<int> r(n,m-1);

    vector<int> ord2(n);
    iota(all(ord2),0);
    sort(all(ord2),[&](int i, int j){
            return x[i][ord[i][l[i]]]+x[i][ord[i][r[i]]]<x[j][ord[j][l[j]]]+x[j][ord[j][r[j]]];
    });
    ll resp=0;
    L(i,0,n-1){
        int j=ord2[i];
        if(i<n/2){
            answer[j][ord[j][l[j]]]=0;
            resp-=x[j][ord[j][l[j]]];
        }
        else{
            answer[j][ord[j][r[j]]]=0;
            resp+=x[j][ord[j][r[j]]];
        }
    }
	allocate_tickets(answer);
	return resp;
}

• 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