제출 #310301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
310301		APROHACK	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

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

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

	for (long long i = 0; i < n; i++) {
		vector<int> row(m);
		for (long long j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}

    for(long long i = 0 ; i < n ; i ++){
        for(long long j = 0 ; j < m ; j ++){
            answer[i][j]=0;
        }
    }
    /*
    set<long long>pasados;
    for(long long i = 0 ; i < n/2 ; i ++){
        long long menor=long long_MAX, mayor, menorpos, mayorpos;
        for(long long j = 0 ; j < n ; j ++){
            if(pasados.find(j)!=pasados.end())continue;
            if(menor>=x[j][0]){
                menor=x[j][0];
                menorpos=j;
            }

        }
    }
    */

	allocate_tickets(answer);
	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