제출 #290041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290041		AKaan37	로봇 (IOI13_robots)	C++17	28 / 100	246 ms	6008 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,PS[li],PS1[li];
int cev;
string s;
vector<int> v;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	if(B==0){
		int bas=0;
		sort(X,X+A);
		sort(W,W+T);
		for(int i=0;i<A;i++){
			while(bas<T && X[i]>W[bas])bas++;
			PS[i]=bas;
		}
		bas=1;
		int son=T;
		while(bas<=son){
			for(int i=0;i<A;i++){
				PS1[i]=PS[i];
			}
			int cikart=0;
			cev=0;
			for(int i=0;i<A;i++){
				PS1[i]-=cikart;
				cev+=min(PS1[i],ort);
				cikart+=min(PS1[i],ort);
			}
			if(cev>=T)son=ort-1;
			else bas=ort+1;
		}
		if(bas>T)return -1;
		return bas;
	}
	else{
		if(A==1 && B==1){
			if(X[0]>W[0] && Y[0]>S[1])return 1;
			if(X[0]>W[1] && Y[0]>S[0])return 1;
			if(X[0]>W[1] && X[0]>W[0])return 2;
			if(Y[0]>S[1] && Y[0]>S[0])return 2;
			return -1;
		}
		if(A==2){
			if(X[0]>W[0] && X[1]>W[1])return 1;
			if(X[0]>W[1] && X[1]>W[0])return 1;
			if(X[0]>W[1] && X[0]>W[0])return 2;
			if(X[1]>W[1] && X[1]>W[0])return 2;
			return -1;
		}
		if(B==2){
			if(Y[0]>S[0] && Y[1]>S[1])return 1;
			if(Y[0]>S[1] && Y[1]>S[0])return 1;
			if(Y[0]>S[1] && Y[0]>S[0])return 2;
			if(Y[1]>S[1] && Y[1]>S[0])return 2;
			return -1;
		}
	}
}

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

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:81:1: warning: control reaches end of non-void function [-Wreturn-type]
   81 | }
      | ^

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