제출 #1082445

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1082445	2024-08-31 11:06:07	wood	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	501 ms	73108 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;
#define vi vector<int>
#define ll long long
#define pb push_back
#define eb emplace_back
#define p32 pair<int,int>
long long find_maximum(int k, std::vector<std::vector<int>> x) {
  int n = x.size(), m = x[0].size();
  vector<vi> ans;
  if(m==1){
    vi p;
    for(int i = 0; i<n; i++){ ans.pb({0}); p.pb(x[i][0]);}
    sort(p.begin(),p.end());
    ll sum = 0;
    for(int i =0; i<n; i++) sum+=abs(p[n/2]-p[i]);
    allocate_tickets(ans);
    return sum;
  }
  ll result = 0;
  bool finalchoice[n];
  for(int i = 0; i<2*n; i++){
    bool choice[n]; memset(choice,0,sizeof choice); //true if we pick the big card
    int mid = x[i%n][0];
    if(i>=n){ mid = x[i%n][m-1]; choice[i%n] = true;}
    int lowcnt = 0,highcnt = 0;
    ll sum = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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