# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962764 | 2024-04-14T08:00:04 Z | simona1230 | Robots (IOI13_robots) | C++17 | 1 ms | 4444 KB |
#include <bits/stdc++.h> #include "robots.h" using namespace std; int a,b,t,x[50000],y[50000],w[50000],s[50000]; int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]) { a=A; b=B; t=T; for(int i=0;i<a;i++) x[i]=X[i]; for(int i=0;i<b;i++) y[i]=Y[i]; for(int i=0;i<t;i++) w[i]=W[i],s[i]=S[i]; sort(x,x+a); sort(y,y+b); if(a+b==2&&t==2) { if(a==2) { sort(w,w+t); if(x[0]>=x[1])swap(x[0],x[1]); if(x[0]>=w[0]&&x[1]>=w[1])return 1; if(x[1]>=w[1])return 2; return 0; } if(b==2) { sort(s,s+t); if(y[0]>=y[1])swap(y[0],y[1]); if(y[0]>=s[0]&&y[1]>=s[1])return 1; if(y[1]>=s[1])return 2; return -1; } if(x[0]>=w[0]&&y[0]>=s[1]||x[0]>=w[1]&&y[0]>=s[0])return 1; if(x[0]<w[0]&&y[0]<s[0]||x[0]<w[1]&&y[0]<s[1])return -1; return 2; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4440 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4444 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4444 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4440 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 4444 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |