제출 #1289641

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289641		bilgun	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	1 ms	340 KiB

tickets

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

long long find_maximum(int k, vector<vector<int>> vec){
    int n = vec.size(), m = vec[0].size();
    vector<vector<int>> ans(n);
    int count = 0, s = 0;
    for( int i = 0; i < n; i++){
        ans[i].push_back(vec[i][0]);
        count += vec[i][0];
    }
    count /= n;
    for( int i = 0; i < n; i++){
        s += abs(vec[i][0] - count);
    }
    allocate_tickets(ans);
    return s;
}

• 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