Submission #309327

#TimeUsernameProblemLanguageResultExecution timeMemory
309327amunduzbaevRobots (IOI13_robots)C++14
0 / 100
1 ms384 KiB
#include "robots.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;

const int N=1e4+5;

int putaway(int wet, int smt, int t1, int we[], int sm[], int wt[], int st[]) {
    sort(we,we+wet);
    sort(sm,sm+smt);
    if(wt[0]>we[wet-1]||wt[1]>we[wet-1]) return -1;
    if(st[0]>sm[smt-1]||st[1]>sm[smt-1]) return -1;
    if(wet&&smt){
        if(we[wet-1]>=wt[0]){
            if(sm[smt-1]>=st[1])
                return 1;
        }
        if(we[wet-1]>=wt[1]){
            if(sm[smt-1]>=st[0])
                return 1;
        }
    }
    return 2;

}
#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...