Submission #289977

#	Time	Username	Problem	Language	Result	Execution time	Memory
289977		khangal	Robots (IOI13_robots)	C++14	100 / 100	2057 ms	55476 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 ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a,*w,*x,*y,z,t,*s;
bool used[1234567];
pair<int,int> p[1234567];
vector<int> v[1234567],vec,vv1,vv2;
// string s1,s;
// int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<ll,ll> mp;
bool check(int val){
    priority_queue<int> pq;
    int i,j=0;
    for(int i=0;i<a;i++){
        while(x[i] > p[j].ff && j<t){
            pq.push(s[p[j].ss]);
            j++;
        }
        int cnt=val;
        while(cnt-- && pq.size() > 0){
            pq.pop();
        }
    }
    for(;j<t;j++)pq.push(s[p[j].ss]);
    vector<int> vec;
    while(pq.size()>0){
        vec.pb(pq.top());
        pq.pop();
    }
    reverse(vec.begin(), vec.end());
    j = 0;
    cnt = val;
    for(auto it : vec){
        while(j < b && (!cnt || it >= y[j])){
            j++;
            cnt = val;
        }
        if(j == b) return 0;
        cnt--;
    }
    return 1;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]){
    a=A;
    b=B;
    t=T;
    x=X;
    y=Y;
    w=W;
    s=S;
    for(int i=0;i<T;i++){
        p[i].ff=w[i];
        p[i].ss=i;
    }
    sort(p,p+T);
    sort(X,X+A);    
    sort(Y,Y+B);
    sort(x,x+a);    
    sort(y,y+b);
    for(int i=0;i<T;i++){
        if(A>0&&B>0){
            if(X[A-1] <= W[i] && Y[B-1] <= S[i])return -1;
        }
        if(A==0){
            if(Y[B-1] <= S[i])return -1;
        }
        if(B==0){
            if(X[A-1] <= W[i])return -1;
        }
    }
    l=1;
    r=T;
    while(l<r){
        int mid=(l+r)/2;
        if(check(mid)==1)r=mid;
        else l=mid+1;
    }
    return l;
}

Compilation message (stderr)

robots.cpp: In function 'bool check(int)':
robots.cpp:47:9: warning: unused variable 'i' [-Wunused-variable]
   47 |     int i,j=0;
      |         ^

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