Submission #352429

#	Time	Username	Problem	Language	Result	Execution time	Memory
352429		ryansee	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	384 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;
 
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = x.size(), m = x[0].size(), ans = 0;
	vector<vector<int>> ret(n, vector<int>(m, -1));
	
	vector<int> front(n, 0), back(n, m-1), zeros(n, 0);
	FOR(i,0,n-1) FOR(j,0,m-1) if(x[i][j]==0) ++ zeros[i];
	
	FOR(K,1,k) {
		vector<int> zero, one, dk;
		FOR(i,0,n-1) {
			if(x[i][front[i]] == 1) one.eb(i);
			else if(x[i][back[i]] == 0) zero.eb(i);
			else dk.eb(i);
		}
		sort(all(dk), [&](int x,int y){return zeros[x]>zeros[y];});
		reverse(all(dk));
		while(siz(zero) < n/2) {
			zero.eb(dk.back()), dk.pop_back();
		}
		while(siz(dk)) {
			one.eb(dk.back()), dk.pop_back();
		}
		ans += min(siz(zero), siz(one));
		for(auto i:zero) {
			ret[i][front[i]]=K, ++ front[i];
		}
		for(auto i:one) {
			ret[i][back[i]]=K, -- back[i];
		}
	}
	
	allocate_tickets(ret);
	return ans;
}

• 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