| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1348658 | simona_2010 | Robots (IOI13_robots) | C++20 | 0 ms | 344 KiB |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include "robots.h"
using namespace std;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
if(T == 2 && A+B == 2)
{
if(A == 1 && B == 1)
{
if(W[0] < X[0] && S[1] < Y[0])return 1;
if(W[1] < X[0] && S[0] < Y[0])return 1;
if(W[0] < X[0] && W[1] < X[0])return 2;
if(S[0] < Y[0] && S[1] < Y[0])return 2;
return -1;
}
if(A == 2)
{
if(W[0] < X[0] && W[1] < X[1])return 1;
if(W[1] < X[0] && W[0] < X[0])return 1;
if(W[0] < X[0] && W[1] < X[0])return 2;
if(W[0] < X[1] && W[1] < X[1])return 2;
return -1;
}
if(B == 2)
{
if(S[0] < Y[0] && S[1] < Y[1])return 1;
if(S[1] < Y[0] && S[0] < Y[0])return 1;
if(S[0] < Y[0] && S[1] < Y[0])return 2;
if(S[0] < Y[1] && S[1] < Y[1])return 2;
}
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
