제출 #1053491

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

tickets

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

#define ll long long

ll nbcouleurs,nbparcouleurs,r,val;
vector<int> s;
vector<vector<int>> rep;
vector<int> un;

ll find_maximum(int nbtours, vector<vector<int>> x) {
    nbcouleurs=x.size();
    nbparcouleurs=x[0].size();
    //cout<<nbcouleurs<<" "<<nbparcouleurs<<endl;
    un.push_back(0);
    for (int i=0;i<nbcouleurs;i++){
        s.push_back(x[i][0]);
        rep.push_back(un);
    }
    sort(s.begin(),s.end());
    allocate_tickets(rep);
    val=s[nbcouleurs/2-1]+s[nbcouleurs/2];
    val/=2;
    for (int i=0;i<nbcouleurs;i++){
        r+=abs(val-s[i]);
    }
    //cout<<val<<endl;
    //cout<<r<<endl;
    return r;
	/*int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return 1;*/
}

• Subtask 1: 11 / 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