제출 #1036455

#제출 시각아이디문제언어결과실행 시간메모리
1036455clementine로봇 (IOI13_robots)C++17
0 / 100
1 ms348 KiB
#include "robots.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) { if(A == 1) { if(X[0] > W[0]) { if(Y[0] > S[1]) { return 1; } } if(X[0] > W[1] && Y[0] > S[0]) { return 1; } if(X[0] > W[0] && X[0] > W[1]) { return 2; } if(Y[0] > S[0] && Y[0] > S[1]) { return 2; } return -1; } if(A== 2) { int a = min(W[1], W[2]); int b = max(W[2], W[2]); int x = min(X[1], X[2]); int y = max({X[1], X[2]}); if(x > a && y > b) { return 1; } if(y > b) { return 2; } return -1; } if(B== 2) { int a = min(S[1], S[2]); int b = max(S[2], S[2]); int x = min(Y[1], Y[2]); int y = max({Y[1], Y[2]}); if(x > a && y > b) { return 1; } if(y > b) { return 2; } return -1; } 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...