Submission #1354175

#TimeUsernameProblemLanguageResultExecution timeMemory
1354175hmms127Robots (IOI13_robots)C++20
14 / 100
61 ms4360 KiB
#include "bits/stdc++.h"
#include "robots.h"
using namespace std;
#define f1(n) for(int i=0;i<n;i++)
#define f3(n) for(int j=0;j<n;j++)
#define f2(m,n,q) for(int i=m;i<n;i+=q)
#define f4(m,n,q) for(int j=m;j<n;j+=q)
#define pb push_back
using pr=pair<int,int>;
using ar=array<int,3>;
int putaway(int a, int b, int t, int x[], int y[], int w[], int s[]) {
    sort(x,x+a);
    sort(y,y+b);
    bool ok=1;
    f1(t) {
        if (!(a>0&&x[a-1]>w[i])&&!(b>0&&y[b-1]>s[i]))return -1;
    }
    if (a==2) {
        ok=0;
        f1(t) {
            ok|=(x[0]>w[i]);
        }
        if (ok)return 1;
        return 2;

    }
    if (b==2) {
        ok=0;
        f1(t) {
            ok|=(y[0]>s[i]);
        }
        if (ok)return 1;
        return 2;
    }
    vector<int>v,v1;
    f1(t) {
        if (x[0]>w[i])v.pb(i);
        if (y[0]>s[i])v1.pb(i);
    }
    if ((v.size()==1&&v1.size()==1&&v[0]==v1[0])||(v.size()==0||v1.size()==0))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...