| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354156 | vjudge1 | Robots (IOI13_robots) | C++17 | 0 ms | 0 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 int long long
#define pb push_back
constexpr int N=1e6+1,M=1e10,LOG=21,mod=998244353,inf=1e18;
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) {
ok&=(w[i]>x[a-1]&&s[i]>y[b-1]);
}
if (!ok)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]==v[1])return 2;
return 1;
//hmms
}