Submission #225521

#	Time	Username	Problem	Language	Result	Execution time	Memory
225521		rqi	Robots (IOI13_robots)	C++14	100 / 100	2337 ms	36436 KiB

robots

#include "robots.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}; 

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; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// 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
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(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 T> str ts(T v) {
	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 << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#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
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

const int mx = 1000005;
const int mx2 = 1000005;
bool used[mx];
pi wsorthelp[mx2];
int wsort[mx2];
pi ssorthelp[mx2];
int ssort[mx2];

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {

	sort(X, X+A);
	sort(Y, Y+B);

	for(int i = 0; i < T; i++){
		wsorthelp[i] = mp(W[i], i);
		ssorthelp[i] = mp(S[i], i);
	}
	sort(wsorthelp, wsorthelp+T);
	sort(ssorthelp, ssorthelp+T);

	for(int i = 0; i < T; i++){
		wsort[i] = wsorthelp[i].s;
		ssort[i] = ssorthelp[i].s;
	}
	int lo = 1;
	int hi = 1000005;
	while(lo < hi){
		int mid = (lo+hi)/2;
		bool works = 1;
		for(int i = 0; i < T; i++){
			used[i] = 0;
		}

		priority_queue<pi> pq; //size, index
		int tind = 0;
		for(int i = 0; i < A; i++){
			while(tind < T){
				if(W[wsort[tind]] >= X[i]){
					break;
				}
				pq.push(mp(S[wsort[tind]], wsort[tind]));
				tind++;
			}
			for(int j = 0; j < mid; j++){
				if(sz(pq) == 0) break;
				int ind = pq.top().s;
				used[ind] = 1;
				pq.pop();
			}
		}

		vi toys;
		for(int i = 0; i < T; i++){
			if(used[ssort[i]] == 0) toys.pb(S[ssort[i]]);
		}
		//toys = {all sizes left}

		if(ll(sz(toys)) > ll(B)*ll(mid)){
			works = 0;
		}
		else if(sz(toys) == 0){
			works = 1;
		}
		else if(B == 0 && sz(toys) > 0){
			works = 0;
		}
		else if(toys.bk >= Y[B-1]){
			works = 0;
		}
		else{
			int toyind = sz(toys)-1;
			int tot = 0;
			for(int i = B; i >= 0; i--){
				int thresh;
				if(i == 0) thresh = 0;
				else thresh = Y[i-1];

				while(toyind >= 0){
					if(toys[toyind] < thresh) break;
					tot++;
					toyind--;
				}
				if(ll(tot) > ll(B-i)*ll(mid)){
					works = 0;
					break;
				}
			}
		}


		if(works == 1) hi = mid;
		else lo = mid+1;
	}
	if(lo > 1000000) return -1;
    return lo;
}

Compilation message (stderr)

robots.cpp: In function 'void setIn(std::__cxx11::string)':
robots.cpp:124: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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
robots.cpp: In function 'void setOut(std::__cxx11::string)':
robots.cpp:125: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: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 10 / 10