제출 #471616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
471616		NhatMinh0208	로봇 (IOI13_robots)	C++14	90 / 100	3054 ms	22972 KiB

robots

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "robots.h"

int n,m,i,j,k,t,t1,u,v,a,b;
pii(int) p[1000001];
int xl[50001],yl[50001];
int sub[1000001];
priority_queue<int> pq;
int check(int l) {
    if (m==0) {
    i=0;j=0;
    a=0;
    while (i<t || j<n) {
        if (i==t) {
            a=max(0,a-l);
            j++;
        } else if (j==n) {
            a++;
            i++;
        } else if (p[i].fi<=xl[j]) {
            a++;
            i++;
        } else {
            a=max(0,a-l);
            j++;
        }
    }
    if (a) return 0;
    return 1;
    }
    i=0;j=0;
    while (i<t || j<n) {
        if (i==t) {
            for (k=0;k<l;k++) if (pq.size()) pq.pop();
            j++;
        } else if (j==n) {
            pq.push(p[i].se);
            i++;
        } else if (p[i].fi<=xl[j]) {
            pq.push(p[i].se);
            i++;
        } else {
            for (k=0;k<l;k++) if (pq.size()) pq.pop();
            j++;
        }
    }
    u=pq.size();
    // cout<<"a\n";
    for (i=u-1; i>=0; i--) {
        sub[i]=pq.top();
        pq.pop();
        // cout<<sub[i]<<' ';
    }
    // cout<<endl;
    i=0;j=0;
    a=0;
    while (i<u || j<m) {
        if (i==u) {
            a=max(0,a-l);
            j++;
        } else if (j==m) {
            a++;
            i++;
        } else if (sub[i]<=yl[j]) {
            a++;
            i++;
        } else {
            a=max(0,a-l);
            j++;
        }
    }
    if (a) return 0;
    return 1;
}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    n=A;
    m=B;
    t=T;
    for (i=0;i<t;i++) {
        p[i]={W[i]+1,S[i]+1};
    }
    sort(p,p+t);
    memcpy(xl,X,4*n);
    memcpy(yl,Y,4*m);
    sort(xl,xl+n);
    sort(yl,yl+m);
    int l=1,r=t+1,mid; 
    while(l<r) {
        mid=(l+r)/2;
        if (check(mid)) r=mid; else l=mid+1;
    }
    if (l==t+1) return -1; else return l;
}

// Normie28;

컴파일 시 표준 에러 (stderr) 메시지

robots.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

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