제출 #1092098

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1092098	2024-09-23 07:44:53	onlk97	카니발 티켓 (IOI20_tickets)	C++14	100 / 100	464 ms	76112 KiB

tickets

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k,vector <vector <int> > x){
    int n=x.size(),m=x[0].size();
    long long ans=0;
    for (int i=0; i<n; i++){
        for (int j=0; j<k; j++) ans-=x[i][j];
    }
    int cnt[n];
    for (int i=0; i<n; i++) cnt[i]=0;
    priority_queue <pair <long long,int> > pq;
    for (int i=0; i<n; i++) pq.push({x[i].back()+x[i][k-1],i});
    for (int iters=0; iters<n*k/2; iters++){
        pair <long long,int> tp=pq.top(); pq.pop();
        ans+=tp.first;
        cnt[tp.second]++;
        if (cnt[tp.second]<k) pq.push({x[tp.second][m-1-cnt[tp.second]]+x[tp.second][k-1-cnt[tp.second]],tp.second});
    }
    vector <vector <int> > op(n,vector <int>(m,-1));
    int pos=0;
    for (int i=0; i<n; i++){
        vector <int> done(k,0);
        for (int j=0; j<cnt[i]; j++){
            op[i][m-1-j]=pos;
            done[pos]=1;
            pos=(pos+1)%k;
        }
        int ptr=0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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