# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1036288 |
2024-07-27T08:14:02 Z |
beaconmc |
Robots (IOI13_robots) |
C++14 |
|
3000 ms |
42928 KB |
#include "robots.h"
#include <bits/stdc++.h>
typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
bool lmao(vector<ll>& stuff, vector<ll>& robot, ll k){
reverse(stuff.begin(), stuff.end());
ll cur = 0;
for (auto&i : robot){
ll cnt = 0;
while (cur < stuff.size() && cnt < k){
if (stuff[cur] < i) cur++, cnt++;
else break;
}
}
if (cur == stuff.size()) return true;
else return false;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
vector<ll> x(A),y(B);
vector<vector<ll>> lol(T);
FOR(i,0,A) x[i] = (X[i]);
FOR(i,0,B) y[i] = (Y[i]);
FOR(i,0,T) lol[i] = {W[i], S[i]};
sort(x.begin(), x.end());
sort(y.begin(), y.end());
sort(lol.begin(), lol.end());
ll l = 0;
ll r = T+1;
priority_queue<ll> sus;
while (l<r){
ll mid = (l+r)/2;
ll cur = 0;
for (auto&i : x){
while (cur < lol.size()){
if (lol[cur][0] < i) sus.push(lol[cur][1]), cur++;
else break;
}
FOR(k,0,mid){
if (sus.size()) sus.pop();
}
}
while (cur < lol.size()) sus.push(lol[cur][1]), cur++;
vector<ll> idk;
while (sus.size()){
idk.push_back(sus.top());
sus.pop();
}
if (lmao(idk,y,mid)) r = mid;
else l = mid+1;
}
if (l==T+1) return -1;
else return l;
}
Compilation message
robots.cpp: In function 'bool lmao(std::vector<int>&, std::vector<int>&, ll)':
robots.cpp:17:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
17 | while (cur < stuff.size() && cnt < k){
| ~~~~^~~~~~~~~~~~~~
robots.cpp:22:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | if (cur == stuff.size()) return true;
| ~~~~^~~~~~~~~~~~~~~
robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:49:24: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
49 | while (cur < lol.size()){
| ~~~~^~~~~~~~~~~~
robots.cpp:57:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | while (cur < lol.size()) sus.push(lol[cur][1]), cur++;
| ~~~~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
440 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Execution timed out |
3084 ms |
42928 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
444 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
11 ms |
1372 KB |
Output is correct |
17 |
Correct |
13 ms |
1368 KB |
Output is correct |
18 |
Correct |
16 ms |
1440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
444 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
436 KB |
Output is correct |
10 |
Execution timed out |
3020 ms |
42532 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |