# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
714513 |
2023-03-24T21:02:09 Z |
mseebacher |
Robots (IOI13_robots) |
C++17 |
|
3000 ms |
11400 KB |
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
int putaway(int A,int B,int T, int X[],int Y[],int W[],int S[]){
sort(X,X+A);
sort(Y,Y+B);
set<int> se;
for(int i = 0;i<T;i++){
if(W[i] >= X[A-1] && B == 0) return -1;
if(S[i] >= Y[B-1] && A == 0) return -1;
if(W[i] >= X[A-1] && S[i] >= Y[B-1]) return -1;
for(int j = 0;j<A;j++){
if(W[i] < X[j]) se.insert(j);
}
for(int j = 0;j<B;j++){
if(S[i] < Y[j]) se.insert(j+A);
}
}
return se.size() == 2 ? 1: 2;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Execution timed out |
3018 ms |
11400 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |