제출 #30003

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30003		aybala	로봇 (IOI13_robots)	C++11	0 / 100	0 ms	10420 KiB

robots

#include "robots.h"
#include<bits/stdc++.h>
#define fori(a,b,c) for(int a=b; a<c; a++)
#define ford(a,b,c) for(int a=b; a>=c; a--)
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;

bool a[2][2];
int b[2];


int tt[1000004];
int aa[50006];

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	if(B==0){
		sort(W,W+T);
		sort(X,X+A);
		int l=A;
		int ans=0;
		ford(i,T-1,0){
			if(i!=T-1)
				tt[i]=tt[i+1];
			ford(j,l-1,0){
				if(X[j]>W[i]){
					tt[i]++;
				}
				else{
					l=j+1;
					aa[l]++;
					ans=max(ans,aa[l]);
					break;
				}		
			}
			if(i==T-1 && tt[i]==0)
				return -1;
			//cout <<  tt[i] << " " << i << " " << ans << endl;
		}
		return ans;
	}
	
	
	
	fori(i,0,2){
		int k=0;
		fori(j,0,A){
			if(W[i]<X[j]){
				a[j][i]=1;
				b[i]++;
			}
			k++;
		}
		
		fori(j,0,B){
			if(S[i]<Y[k]){
				a[k][i]=1;
				b[i]++;
			}
			k++;
		}
	}
	
	if(!b[0] || !b[1]){
		return -1;
	}
	
	if(b[0]==1 && b[1]==1){
		if((a[0][0]==0 && a[0][1]==0) || (a[1][0]==0 && a[1][1]==0) )
			return 2;
	}
	
	return 1;
}

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