Submission #1203348

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203348		shadow_sami	Robots (IOI13_robots)	C++20	76 / 100	3092 ms	22840 KiB

robots

#include<bits/stdc++.h>
#include "robots.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifdef SAMI
	#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
	#define debg() cerr<<nli;
#else
	#define debug(x)
	#define debg() 
#endif


void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
bool mark[mx];
ll l,r,mid;
ll a,b,t;
ll xx[mx];
ll yy[mx];
ll w[mx];
ll s[mx];

class cmp{
public:
	bool operator()(const ll aa,const ll bb)const{
		return s[aa] < s[bb];
	}
};

vector<ll> lis;
priority_queue<ll,vector<ll>,cmp> pq,pq2;

void deb(){
	pq2 = pq;
	cerr<<"start"<<" : ";
	while(pq2.size()){
		cerr<<pq2.top()<<" ";
		pq2.pop();
	}
	cerr<<nli;
	return;
}

void deb2(){
	pq2 = pq;
	cerr<<"start"<<" : ";
	while(pq2.size()){
		cerr<<s[pq2.top()]<<" ";
		pq2.pop();
	}
	cerr<<nli;
	return;
}

bool check(ll k){
	lis.clear();
	fip(0,t)
		lis.push_back(i);
	sort(lis.begin(),lis.end(),[](const ll aa,const ll bb){
		return w[aa] < w[bb];
	});	
	while(pq.size())pq.pop();
	tp = 0;
	fip(0,a){
		while(tp<lis.size()){
			if(w[lis[tp]]<xx[i]){				
				pq.push(lis[tp]);
				tp++;
			}else
				break;
		}		
		tptp = k;
		while(tptp && pq.size()){			
			pq.pop();
			tptp--;
		}		
	}	
	while(tp<lis.size()){
		pq.push(lis[tp]);
		tp++;
	}	
	fin(b-1,0){
		tptp = k;		
		while(tptp && pq.size()){			
			if(s[pq.top()]<yy[i]){
				pq.pop();
				tptp--;
			}else
				break;
		}		
	}
	return (pq.size()==0);
}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	a = A;
	b = B;
	t = T;
	fip(0,A)
		xx[i] = X[i];
	fip(0,B)
		yy[i] = Y[i];
	fip(0,T)
		w[i] = W[i];
	fip(0,T)
		s[i] = S[i];
	ans = -1;
	l = 1;
	r = 1e5;
	sort(xx,xx+a);
	sort(yy,yy+b);
	while(l<=r){
		mid = l + (r-l) / 2;
		if(check(mid)){
			ans = mid;
			r = mid - 1;
		}else
			l = mid + 1;
			
	}
    return ans;
}

#ifdef SAMI

#define fail(s, x...) do { \
		fprintf(stderr, s "\n", ## x); \
		exit(1); \
	} while(0)

#define MAX_A 50000
#define MAX_B 50000
#define MAX_T 500000

static int X[MAX_A];
static int Y[MAX_B];
static int W[MAX_T];
static int S[MAX_T];

int main() {
    int A, B, T, i;
	int res;
	FILE *f = fopen("input1.txt", "r");
	freopen("output1.txt", "w", stdout);
    freopen("error1.txt", "w", stderr);
	if (!f)
		fail("Failed to open input file.");

	res = fscanf(f, "%d", &A);
	if (res != 1)
		fail("Failed to read A from input file.");
	if (A < 0 || A > MAX_A)
		fail("A is out of bounds.");

	res = fscanf(f, "%d", &B);
	if (res != 1)
		fail("Failed to read B from input file.");
	if (B < 0 || B > MAX_B)
		fail("B is out of bounds.");

	res = fscanf(f, "%d", &T);
	if (res != 1)
		fail("Failed to read T from input file.");
	if (T < 1 || T > MAX_T)
		fail("T is out of bounds.");

	for (i = 0; i < A; i++) {
		res = fscanf(f, "%d", &X[i]);
		if (res != 1)
		    fail("Failed to read data from input file.");
    }
	for (i = 0; i < B; i++) {
        res = fscanf(f, "%d", &Y[i]);
        if (res != 1)
            fail("Failed to read data from input file.");
    }
	for (i = 0; i < T; i++) {
        res = fscanf(f, "%d%d", &W[i], &S[i]);
        if (res != 2)
            fail("Failed to read data from input file.");
    }
	fclose(f);

	int answer = putaway(A, B, T, X, Y, W, S);

	printf("%d\n", answer);

	return 0;
}
#endif

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 0 / 10