제출 #613662

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
613662		Koosha_mv	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	496 ms	60344 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=1505;

int n,m,a[N][N],l[N],r[N],ted[N];
ll sum;
vector<vector<int>> ans;

ll find_maximum(int k,vector<vector<int>> mat) {
	n=mat.size(),m=mat[0].size(),ans=mat;
	f(i,0,n) f(j,0,m) a[i][j]=mat[i][j],ans[i][j]=-1;
	vector<pair<int,int>> vec;
	f(i,0,n){
		l[i]=0,r[i]=m-1;
		ted[i]=k;
		f(j,0,k){
			sum-=a[i][j];
			vec.pb({i,j});
		}
	}
	sort(all(vec),[&](pair<int,int> u,pair<int,int> v){ return a[u.F][u.S]+a[u.F][m-k+u.S]>a[v.F][v.S]+a[v.F][m-k+v.S];});
	f(i,0,n*k/2){
		sum+=a[vec[i].F][vec[i].S]+a[vec[i].F][m-k+vec[i].S];
		ted[vec[i].F]--;
	}
	f(i,0,k){
		vector<int> v(n);
		iota(all(v),0);
		sort(all(v),[&](int u,int v){ return ted[u]<ted[v]; });
		f(j,0,n){
			int x=v[j];
			if(j>=n/2){
				ted[x]--;
				ans[x][l[x]]=i;
				l[x]++;
			}
			else{
				ted[x]++;
				ans[x][r[x]]=i;
				r[x]--;
			}
		}
	}
	allocate_tickets(ans);
	return sum;
}

• 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