Submission #1123060

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1123060	2024-12-02 07:23:44	Luvidi	Carnival Tickets (IOI20_tickets)	C++20	27 / 100	437 ms	51364 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 pii pair<int,int>
#define fs first
#define sc second
long long find_maximum(int k, std::vector<std::vector<int>> a) {
  int n = a.size();
  int m = a[0].size();
  long long x=0;
  vector<vector<int>> ans(n,vector<int>(m,-1));
  vector<pair<pii,pii>> v;
  for(int i=0;i<n;i++){
    pii mx={-1,0},mn={1e9+1,0};
    for(int j=0;j<m;j++){
      mx=max(mx,{a[i][j],j});
      mn=min(mn,{a[i][j],j});
    }
    x-=mn.fs;
    v.push_back({{mn.fs+mx.fs,i},{mx.sc,mn.sc}});
  }
  sort(v.rbegin(),v.rend());
  for(int i=0;i<n/2;i++){
    x+=v[i].fs.fs;
    ans[v[i].fs.sc][v[i].sc.fs]=0;
  }
  for(int i=n/2;i<n;i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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