제출 #416051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
416051		duality	카니발 티켓 (IOI20_tickets)	C++14	100 / 100	804 ms	76160 KiB

tickets

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "tickets.h"

int a[1500];
priority_queue<pii> H;
long long int find_maximum(int k,vector<vector<int> > x) {
    int i,j,n = x.size(),m = x[0].size();
    LLI sum = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < k; j++) sum -= x[i][j];
        H.push(mp(x[i][m-1]+x[i][k-1],i));
    }
    for (i = 0; i < n*k/2; i++) {
        sum += H.top().first;
        int u = H.top().second;
        H.pop(),a[u]++;
        if (a[u] < k) H.push(mp(x[u][m-a[u]-1]+x[u][k-a[u]-1],u));
    }
    int p = 0;
    vector<vi> ans(n,vi(m,-1));
    for (i = 0; i < n; i++) {
        for (j = 0; j < a[i]; j++) ans[i][m-j-1] = p,p = (p+1) % k;
        int q = p;
        for (j = 0; j < k-a[i]; j++) ans[i][j] = q,q = (q+1) % k;
    }
    allocate_tickets(ans);
    return sum;
}

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 12 / 12
• Subtask 6: 23 / 23
• Subtask 7: 10 / 10