제출 #1191067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1191067		Ak_16	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	0 ms	328 KiB

tickets

#include <iostream>
#include "tickets.h"
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long

int n,m;
vector<vector<int>> s,y;
int l[2000];
int r[2000];
int now[2000];
int up[2000];
int tot;

bool cmp(int n1, int n2){
  return y[n1][l[n1]] + y[n1][r[n1]] < y[n2][l[n2]] + y[n2][r[n2]];
}


ll find_maximum(int k, vector<vector<int>> x){
  n = x.size();
  m = x[0].size();
  tot=0;
  
  y = x;
  s = x;
  
  for(int i=0; i<n; i++){
    for(int j=0; j<m; j++){
      s[i][j]=-1;
    }
  }
  
  for(int i=0; i<n; i++){
    l[i]=0;
    r[i]=m-1;
  }
  
  for(int ro=0; ro<k; ro++){
    
    for(int i=0; i<n; i++){
      up[i]=0;
    }
    
    for(int i=0; i<n; i++){
      now[i]=i;
    }
    
    sort(now, now+n, cmp);
    
    for(int i=0; i<n/2; i++){
      tot -= y[now[i]][l[now[i]]];
      s[now[i]][l[now[i]]]=ro;
      l[now[i]]++;
    }
    
    for(int i=n/2; i<n; i++){
      tot += y[now[i]][r[now[i]]];
      s[now[i]][r[now[i]]]=ro;
      r[now[i]]--;
    }
    
  }
  
  allocate_tickets(s);
  
  return tot;
  
}

• Subtask 1: 0 / 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