제출 #355452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
355452		ryansee	카니발 티켓 (IOI20_tickets)	C++14	100 / 100	1145 ms	173352 KiB

tickets

#include "tickets.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 
 
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
 
int n, m;
ll ans, l=1e9;
 
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = x.size(), m = x[0].size(), ans = l * (n/2) * k;
	vector<vector<int>> ret(n, vector<int>(m, -1));
	vector<vector<int>> f(n, vector<int>(m, -1));
	vector<tuple<ll,ll,ll,ll>> v;
	FOR(i,0,n-1) {
		FOR(j,0,k-1) {
			f[i][j] = 0;
			ans -= x[i][j];
		}
		ll co = m-1;
		DEC(j,k-1,0) {
			v.pb({x[i][j]-l+x[i][co], i, j, co});
			-- co;
		}
	}
	sort(all(v), [](tuple<ll,ll,ll,ll> x,tuple<ll,ll,ll,ll> y){
		if(get<0>(x) ^ get<0>(y)) return get<0>(x) > get<0>(y);
		else return get<2>(x) > get<2>(y);
	});
	FOR(ii,0,(n/2)*k-1) {
		ll i=get<1>(v[ii]), j=get<2>(v[ii]), k=get<3>(v[ii]);
		ans += get<0>(v[ii]);
		f[i][j] = -1, f[i][k] = 1;
	}
	vector<ll> fr(k, n/2), bk(k, n/2);
	FOR(i,0,n-1) {
		ll co=0, co2=m-1;
		vector<int> ind;
		FOR(K,0,k-1) ind.eb(K);
		sort(all(ind), [&](int x,int y){return fr[x]>fr[y];});
		for(auto K:ind) {
			if(fr[K] && f[i][co]==0) {
				ret[i][co]=K, -- fr[K], ++ co;
			} else {
				assert(bk[K] && f[i][co2] == 1);
				ret[i][co2]=K, -- bk[K], -- co2;
			}
		}
	}
	allocate_tickets(ret);
	return ans;
}

• 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