Submission #993212

#TimeUsernameProblemLanguageResultExecution timeMemory
993212Essa2006로봇 (IOI13_robots)C++14
0 / 100
1 ms4444 KiB
#include "robots.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)


int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    array<int, 2> fir = {W[0] < X[0], W[1] < X[0]};
    array<int, 2> sec = {S[0] < Y[0], S[1] < Y[0]};
    
    if ((fir[0] && sec[1]) || (fir[1] && sec[0])) {
        return 1;
    }
    if ((fir[0] && fir[1]) || (sec[0] && sec[1])) {
        return 2;
    }
    return -1;
        
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...