제출 #60967

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

robots

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
//#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
#include"robots.h"
int wee(int A,int T,int X[],int W[]){
	static int wa[100001]={0};
	int i,ans=0;
	for(i=0;i<T;i++){wa[X-upper_bound(X,X+A,W[i])+A]++;}
	if(wa[0]>0){return -1;}
	for(i=1;i<=A;i++){wa[i]+=wa[i-1];maxeq(ans,(i-1+wa[i])/i);}
	return ans;
}
int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]){
	sort(X,X+A);
	sort(Y,Y+B);
	if(B==0){return wee(A,T,X,W);}
	int i,j,ans=0;
	static int wa[1001][1001]={0};
	for(i=0;i<T;i++){
		wa[X-upper_bound(X,X+A,W[i])+A][Y-upper_bound(Y,Y+B,S[i])+B]++;
	}
	if(wa[0][0]>0){return -1;}
	for(i=0;i<A;i++){for(j=0;j<=B;j++){wa[i+1][j]+=wa[i][j];}}
	for(i=0;i<=A;i++){for(j=0;j<B;j++){wa[i][j+1]+=wa[i][j];}}
	for(i=0;i<=A;i++){
		for(j=0;j<=B;j++){
			//cout<<wa[i][j]<<" ";
			if(i+j==0){continue;}
			maxeq(ans,(i+j-1+wa[i][j])/(i+j));
		}
		//cout<<endl;
	}
	return ans;
}

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