#include "tickets.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define fi first #define se second #define vi vector<int> #define vll vector<long long> #define pii pair<int, int> #define pll pair<long long, long long> #define pb push_back #define mp make_pair #define eb emplace_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);} inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);} #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; struct pair_hash{ size_t operator()(const pair<int,int>&x)const{ return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32)); } }; vector<vi> getAns(int n, int m, int k, vector<vi> zeros, vector<vi> ones){ vector<vi> res(n, vi(m, -1)); for(int i = 1; i <= k; i++){ vi only1 = {}; vi only0 = {}; vi both = {}; for(int j = 0; j < n; j++){ if(sz(zeros[j]) == 0){ only1.pb(j); }else if(sz(ones[j]) == 0){ only0.pb(j); }else{ both.pb(j); } } for(auto ele : only1){ res[ele][ones[ele].back()] = i; ones[ele].pop_back(); } for(auto ele : only1){ res[ele][zeros[ele].back()] = i; zeros[ele].pop_back(); } for(int j = 0; j < n / 2 - sz(only1); j++){ res[both[j]][ones[both[j]].back()] = i; ones[both[j]].pop_back(); } for(int j = n / 2 - sz(only1); j < sz(both); j++){ res[both[j]][zeros[both[j]].back()] = i; zeros[both[j]].pop_back(); } } return res; } const int MAXN = 307; pll dp[MAXN][MAXN * MAXN]; ll find_maximum(int k, vector<vi> X) { int n = sz(X); int m = sz(X[0]); for (int i = 0; i < n; i++){ vll add(k + 1, 0LL); for(int x = 0; x <= k; x++){ for(int j = m - x; j < m; j++){ add[x] += X[i][j]; } for(int j = 0; j < k - x; j++){ add[x] -= X[i][j]; } } for (int j = 0; j <= n * k / 2; j++) { for(int x = 0; x <= k; x++){ if(x > j){ continue; } if(dp[i][j].fi < add[x] + (i == 0 ? 0LL : dp[i - 1][j - x].fi)){ dp[i][j].fi = (ll)add[x] + (i == 0 ? 0LL : dp[i - 1][j - x].fi); dp[i][j].se = x; } } } } vector<vi> zeros(n, vi()); vector<vi> ones(n, vi()); int i = n - 1; int j = n * k / 2; ll ans = dp[i][j].fi; while(i >= 0){ for(int j2 = m - dp[i][j].se; j2 < m; j2++){ ones[i].pb(j2); } for(int j2 = 0; j2 < k - dp[i][j].se; j2++){ zeros[i].pb(j2); } j = j - dp[i][j].se; i--; } vector<vi> answer = getAns(n, m, k, zeros, ones); allocate_tickets(answer); return ans; } // int main(){ // return 0; // }