제출 #309683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309683		amunduzbaev	로봇 (IOI13_robots)	C++14	0 / 100	1 ms	384 KiB

robots

#include "robots.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
const int N1=5e4+5;
int t,a,b,a1[N1],b1[N1],w[N],s[N];

int putaway(int A, int B, int T, int A1[], int B1[], int W[], int S[]) {
    t=T,a=A,b=B;
    for(int i=0;i<t;i++){
        w[i]=W[i];
        s[i]=S[i];
    }
    for(int i=0;i<a;i++) a1[i]=A1[i];
    for(int i=0;i<b;i++) b1[i]=B1[i];
    sort(a1,a1+a);
    sort(b1,b1+b);
    if(t==2){
        for(int i=0;i<t;i++){
            if(a&&b){
                if(w[i]>a1[a-1]&&s[i]>b1[b-1]) return -1;
            }else if(a){
                if(w[i]>a1[a-1]) return -1;
            }else{
                if(s[i]>b1[b-1]) return -1;
            }
        }

        if(a&&b){
            if(a1[0]>=w[0]&&b1[0]>=s[1]||a1[0]>=w[1]&&b1[0]>=s[0]) return 1;
        }
        else if(a){
            if(a1[0]>=w[0]&&a1[1]>=w[1]||a1[1]>=w[0]&&a1[0]>=w[1]) return 1;
        }
        else {
            if(b1[0]>=s[0]&&b1[1]>=s[1]||b1[1]>=s[0]&&b1[0]>=s[1]) return 1;
        }
        return 2;
    }

}

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

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:31:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   31 |             if(a1[0]>=w[0]&&b1[0]>=s[1]||a1[0]>=w[1]&&b1[0]>=s[0]) return 1;
      |                ~~~~~~~~~~~^~~~~~~~~~~~~
robots.cpp:34:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   34 |             if(a1[0]>=w[0]&&a1[1]>=w[1]||a1[1]>=w[0]&&a1[0]>=w[1]) return 1;
      |                ~~~~~~~~~~~^~~~~~~~~~~~~
robots.cpp:37:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   37 |             if(b1[0]>=s[0]&&b1[1]>=s[1]||b1[1]>=s[0]&&b1[0]>=s[1]) return 1;
      |                ~~~~~~~~~~~^~~~~~~~~~~~~
robots.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

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