제출 #311032

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311032		Jarif_Rahman	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	3 ms	1792 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
deque<deque<int>> r;
int n, m;
long long find_maximum(int k, vector<vector<int>>rrrr){
    n = rrrr.size(), m = rrrr[0].size();
    for(int i = 0; i < n; i++){
        r.pb({});
        for(int j = 0; j < m; j++) r[i].pb(rrrr[i][j]);
    }
    ll s = 0;
    vector <vector<int>> ans(n, vector<int>(m, -1));
    for(int i = 0; i < m; i++){
        vector <ll> v;
        for(int j = 0; j < n; j++){
            if(j%2 == 0){
                v.pb(r[j].front());
                r[j].pop_front();
                ans[j][i] = i;
            }
            else{
                v.pb(r[j].back());
                r[j].pop_back();
                ans[j][m - i - 1] = i;
            }
        }
        sort(v.begin(), v.end());
        ll b = (v[n/2] + v[n/2 - 1])/2;
        for(ll x: v) s+=abs(x - b);
    }
    allocate_tickets(ans);
    return s;
}

• 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