oj.uz

Submission #370634

# Submission time Handle Problem Language Result Execution time Memory
370634 2021-02-24T10:07:45 Z maroonrk Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1195 ms 137280 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

struct T{
	int l,r,i;
	bool operator<(const T&rhs)const{
		return l<rhs.l;
	}
};

long long find_maximum(signed k, std::vector<std::vector<signed>> x){
	int n=si(x),m=si(x[0]);
	vvc<pi> z(n,vc<pi>(m));
	rep(i,n){
		rep(j,m)z[i][j]=pi(x[i][j],j);
		sort(all(z[i]));
	}
	vc<T> lr(n);
	rep(i,n){
		lr[i]={k,m,i};
	}
	int off=0;
	vc<pi> qs;
	qs.reserve(n*k);
	rep(i,n){
		rep(j,k){
			off-=z[i][j].a;
			qs.eb(z[i][m-k+j].a+z[i][j].a,i);
		}
	}
	sort(all(qs),greater<pi>());
	qs.resize(n*k/2);
	for(auto w:qs){
		off+=w.a;
		int i=w.b;
		lr[i].l--;
		lr[i].r--;
	}
	vvc<signed> ans(n,vc<signed>(m,-1));
	rep(step,k){
		sort(all(lr));
		rep(i,n/2){
			int idx=lr[i].i;
			int pos=lr[i].r++;
			ans[idx][z[idx][pos].b]=step;
		}
		rng(i,n/2,n){
			int idx=lr[i].i;
			int pos=--lr[i].l;
			ans[idx][z[idx][pos].b]=step;
		}
	}
	allocate_tickets(ans);
	return off;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 876 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 31 ms 4716 KB Output is correct
6 Correct 762 ms 108564 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 40 ms 4460 KB Output is correct
6 Correct 885 ms 102112 KB Output is correct
7 Correct 858 ms 108012 KB Output is correct
8 Correct 4 ms 876 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 8 ms 1388 KB Output is correct
13 Correct 26 ms 3948 KB Output is correct
14 Correct 27 ms 4076 KB Output is correct
15 Correct 894 ms 112620 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 748 KB Output is correct
5 Correct 44 ms 5868 KB Output is correct
6 Correct 7 ms 1260 KB Output is correct
7 Correct 8 ms 1516 KB Output is correct
8 Correct 1172 ms 137196 KB Output is correct
9 Correct 1090 ms 128096 KB Output is correct
10 Correct 1078 ms 128108 KB Output is correct
11 Correct 1176 ms 137280 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 3 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 3 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 30 ms 4716 KB Output is correct
14 Correct 31 ms 4716 KB Output is correct
15 Correct 37 ms 5100 KB Output is correct
16 Correct 44 ms 5900 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 34 ms 4716 KB Output is correct
21 Correct 36 ms 5228 KB Output is correct
22 Correct 40 ms 5120 KB Output is correct
23 Correct 39 ms 5612 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 31 ms 4716 KB Output is correct
12 Correct 762 ms 108564 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 620 KB Output is correct
17 Correct 40 ms 4460 KB Output is correct
18 Correct 885 ms 102112 KB Output is correct
19 Correct 858 ms 108012 KB Output is correct
20 Correct 4 ms 876 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 8 ms 1388 KB Output is correct
25 Correct 26 ms 3948 KB Output is correct
26 Correct 27 ms 4076 KB Output is correct
27 Correct 894 ms 112620 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 4 ms 748 KB Output is correct
32 Correct 44 ms 5868 KB Output is correct
33 Correct 7 ms 1260 KB Output is correct
34 Correct 8 ms 1516 KB Output is correct
35 Correct 1172 ms 137196 KB Output is correct
36 Correct 1090 ms 128096 KB Output is correct
37 Correct 1078 ms 128108 KB Output is correct
38 Correct 1176 ms 137280 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 4 ms 748 KB Output is correct
44 Correct 3 ms 748 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 748 KB Output is correct
49 Correct 3 ms 748 KB Output is correct
50 Correct 3 ms 748 KB Output is correct
51 Correct 30 ms 4716 KB Output is correct
52 Correct 31 ms 4716 KB Output is correct
53 Correct 37 ms 5100 KB Output is correct
54 Correct 44 ms 5900 KB Output is correct
55 Correct 1 ms 492 KB Output is correct
56 Correct 3 ms 748 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 34 ms 4716 KB Output is correct
59 Correct 36 ms 5228 KB Output is correct
60 Correct 40 ms 5120 KB Output is correct
61 Correct 39 ms 5612 KB Output is correct
62 Correct 84 ms 12524 KB Output is correct
63 Correct 84 ms 12524 KB Output is correct
64 Correct 117 ms 15724 KB Output is correct
65 Correct 421 ms 53484 KB Output is correct
66 Correct 499 ms 61248 KB Output is correct
67 Correct 8 ms 1516 KB Output is correct
68 Correct 7 ms 1260 KB Output is correct
69 Correct 746 ms 108580 KB Output is correct
70 Correct 956 ms 119448 KB Output is correct
71 Correct 1195 ms 137224 KB Output is correct
72 Correct 1069 ms 118540 KB Output is correct
73 Correct 1136 ms 130348 KB Output is correct
74 Correct 892 ms 104556 KB Output is correct
75 Correct 947 ms 116772 KB Output is correct