QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#410839 | #1156. Robots | kwongweng# | 0 | 1ms | 3876kb | C++17 | 723b | 2024-05-14 15:52:20 | 2024-05-14 15:52:21 |
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[]) {
sort(X,X+T);
int ans = 0; int cnt = 0;
int cur = A-1;
if (W[T-1] >= X[cur]) return -1;
ROF(i,T-1,0){
while (cur>0 && W[i] < X[cur-1]) cur--;
ans = max(ans, (T-i) / (A-cur));
}
return ans;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 14
Accepted
time: 1ms
memory: 3876kb
input:
1 1 2 13 13 5 6 13 13
output:
-1
result:
ok single line: '-1'
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 3824kb
input:
0 2 2 20 10 7 10 13 10
output:
-1
result:
wrong answer 1st lines differ - expected: '2', found: '-1'
Subtask #2:
score: 0
Runtime Error
Test #8:
score: 0
Runtime Error
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:
result:
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #1:
0%