Submission #243348

#	Time	Username	Problem	Language	Result	Execution time	Memory
243348		Benq	Holiday (IOI14_holiday)	C++14	23 / 100	2294 ms	10308 KiB

holiday

#include"holiday.h"

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		int mid = (lo+hi)/2; 
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
template<class T> void remDup(vector<T>& v) { 
	sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

int n,st,d; vi a;

ll rig(vi a) {
	priority_queue<int,vi,greater<int>> pq;
	ll sum = 0, ans = 0;
	F0R(i,sz(a)) {
		if (i > d) break;
		ll x = a[i]; pq.push(x), sum += x;
		while (sz(pq) > d-i) sum -= pq.top(), pq.pop();
		ckmax(ans,sum);
	}
	dbg("HAHA",a,ans,sum);
	return ans;
}

/**
 * Description: Priority queue w/ modification. Use for Dijkstra?
 * Source: https://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/pq_design.html
 * Verification: ?
 */

#include <ext/pb_ds/priority_queue.hpp>

void pqExample() {
	__gnu_pbds::priority_queue<int> p;
	vi act; vector<decltype(p)::point_iterator> v;
	int n = 1000000;
	F0R(i,n) { int r = rand(); act.pb(r), v.pb(p.push(r)); }
	F0R(i,n) { int r = rand(); act[i] = r, p.modify(v[i],r); }
	sort(rall(act));
	F0R(i,n) { assert(act[i] == p.top()); p.pop(); }
}


__gnu_pbds::priority_queue<pi> lo, hi;

ll go(int num) {
	if (num <= 0 || num > n) return 0;
	int rig = n-1;
	lo = hi = __gnu_pbds::priority_queue<pi>();
	vector<decltype(lo)::point_iterator> its(n);
	vi loc(n);
	int R = n-1;
	auto insLo = [&](int x) {
		loc[x] = 1;
		its[x] = lo.push({a[x],x});
	};
	ll sum = 0;
	auto insHi = [&](int x) {
		loc[x] = 2;
		its[x] = hi.push({-a[x],x});
		sum += a[x];
	};
	FOR(i,st+1,n) insLo(i);
	ll res = 0;
	R0F(i,st+1) { // <= d-num moves
		if (sz(lo) && a[i] <= lo.top().f) insLo(i);
		else insHi(i);
		int r = d-num-2*(st-i); if (r <= st) break;
		for (;R > r; R--) {
			assert(loc[R]);
			if (loc[R] == 1) lo.erase(its[R]);
			else hi.erase(its[R]);
		}
		while (sz(lo) && sz(hi) < num) insHi(lo.top().s), lo.pop();
		while (sz(hi) > num) {
			sum += hi.top().f;
			insLo(hi.top().s), hi.pop();
		}
		if (sz(hi) == num) ckmax(res,sum);
	}
	return res;
}

ll solve() {
	ll res = rig(vi(st+all(a)));
	// int mx = 0, cnt = 0, num = 0;
	// R0F(i,st+1) {
	// 	if (i != st) cnt ++;
	// 	cnt ++; num ++; //dbg("HA",cnt,num);
	// 	if (cnt > d) break;
	// 	mx = num;
	// }
	// cnt += st;
	// FOR(i,st+1,n) {
	// 	cnt += 2; num ++;
	// 	if (cnt > d) break;
	// 	mx = num;
	// }
	int lo = 0, hi = n;
	while (lo+2 < hi) {
		int m0 = (2*lo+hi)/3, m1 = (lo+2*hi)/3;
		if (go(m0) >= go(m1)) hi = m1;
		else lo = m0;
	}
	FOR(i,lo-10,hi+10) ckmax(res,go(i));
	return res;
}

long long int findMaxAttraction(int _n, int _start, int _d, int attraction[]) {
	n = _n; st = _start; d = _d;
	F0R(i,n) a.pb(attraction[i]);
	ll x = solve();
	reverse(all(a)); st = n-1-st;
	ll y = solve();
    return max(x,y);
}

Compilation message (stderr)

holiday.cpp: In function 'll rig(vi)':
holiday.cpp:154:23: warning: statement has no effect [-Wunused-value]
  dbg("HAHA",a,ans,sum);
                       ^
holiday.cpp: In function 'll go(int)':
holiday.cpp:181:6: warning: unused variable 'rig' [-Wunused-variable]
  int rig = n-1;
      ^~~
holiday.cpp: In function 'void setIn(std::__cxx11::string)':
holiday.cpp:132:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
holiday.cpp: In function 'void setOut(std::__cxx11::string)':
holiday.cpp:133:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 23 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53