QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #410872 | #1156. Robots | kwongweng# | 14 | 65ms | 7964kb | C++17 | 965b | 2024-05-14 16:18:54 | 2024-05-14 16:18:55 |
Judging History
answer
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef vector<vector<ll>> vll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
if (A==2){
if (max(W[0],W[1]) >= max(X[0],X[1])) return -1;
if (min(W[0],W[1]) < min(X[0],X[1])) return 1;
return 2;
}
if (A==0){
if (max(S[0],S[1]) >= max(Y[0],Y[1])) return -1;
if (min(S[0],S[1]) < min(Y[0],Y[1])) return 1;
return 2;
}
if (W[0]<X[0] && S[1]<Y[0]) return 1;
if (W[1]<X[0] && S[0]<Y[0]) return 1;
if (max(W[0],W[1]) >= X[0] && max(S[0],S[1]) >= Y[0]) return -1;
return 2;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 14
Accepted
Test #1:
score: 14
Accepted
time: 0ms
memory: 3744kb
input:
1 1 2 13 13 5 6 13 13
output:
-1
result:
ok single line: '-1'
Test #2:
score: 14
Accepted
time: 1ms
memory: 3812kb
input:
0 2 2 20 10 7 10 13 10
output:
2
result:
ok single line: '2'
Test #3:
score: 14
Accepted
time: 0ms
memory: 3812kb
input:
2 0 2 10 20 10 7 10 13
output:
2
result:
ok single line: '2'
Test #4:
score: 14
Accepted
time: 0ms
memory: 3772kb
input:
1 1 2 13 13 15 6 5 16
output:
1
result:
ok single line: '1'
Test #5:
score: 14
Accepted
time: 0ms
memory: 3712kb
input:
0 2 2 15 15 7 8 5 6
output:
1
result:
ok single line: '1'
Test #6:
score: 14
Accepted
time: 0ms
memory: 3816kb
input:
2 0 2 15 15 7 8 5 6
output:
1
result:
ok single line: '1'
Test #7:
score: 14
Accepted
time: 0ms
memory: 3652kb
input:
2 0 2 20 1 10 10 10 10
output:
2
result:
ok single line: '2'
Subtask #2:
score: 0
Wrong Answer
Test #8:
score: 0
Wrong Answer
time: 65ms
memory: 7964kb
input:
50000 0 500000 1957680000 64280000 235160000 1384760000 1279320000 1005400000 1481760000 1129920000 1774640000 494160000 763120000 419640000 1742880000 1083000000 278360000 64040000 576880000 1479760000 1872320000 158480000 1183880000 81320000 249920000 30920000 1909240000 870920000 842280000 445640...
output:
2
result:
wrong answer 1st lines differ - expected: '17', found: '2'
Subtask #3:
score: 0
Wrong Answer
Dependency #1:
100%
Accepted
Test #14:
score: 0
Wrong Answer
time: 0ms
memory: 3696kb
input:
3 2 10 6 2 9 4 7 4 6 8 5 2 3 7 9 1 8 5 1 3 3 8 7 7 6 10 5
output:
-1
result:
wrong answer 1st lines differ - expected: '3', found: '-1'
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%