제출 #29856

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
29856		Nikefor	로봇 (IOI13_robots)	C++98	14 / 100	193 ms	5428 KiB

robots

#include "robots.h"
int XG[1001], YG[1001], WG[1001], SG[1001], AG, BG, TG;
bool suit(int t, bool type, int r) { /* true if weak, false if small    */
    if(type and WG[t] >= XG[r]) return false;
    if(!type and SG[t] >= YG[r]) return false;
    return true;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    AG=A, BG=B, TG=T;
    for(int i=0; i<T; i++) {
        WG[i] = W[i];
        SG[i] = S[i];
    }
    for(int i=0; i<A; i++) XG[i] = X[i];
    for(int i=0; i<B; i++) YG[i] = Y[i];
    if(T==2 and (A+B)==2) {
        if(A==2) {
            if( (suit(0, true,0) and suit(1, true, 1) ) or ( suit(0,true,1) and suit(1,true,0) ) ) return 1;
            else if( (suit(0, true,0) and suit(1, true, 0) ) or ( suit(0,true,1) and suit(1,true,1) ) ) return 2;
            return -1;
        }
        if(B==2) {
            if( (suit(0, false,0) and suit(1, false, 1) ) or ( suit(0,false,1) and suit(1,false,0) ) ) return 1;
            else if( (suit(0, false,0) and suit(1, false, 0) ) or ( suit(0,false,1) and suit(1,false,1) ) ) return 2;
            return -1;
        }
        if( (suit(0, false,0) and suit(1, true, 0) ) or ( suit(0,true,0) and suit(1,false,0) ) ) return 1;
        else if( (suit(0, false,0) and suit(1, false, 0) ) or ( suit(0,true,0) and suit(1,true,0) ) ) return 2;
        return -1;

    }
    return 42;
}

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