# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
817122 | gun_gan | Robots (IOI13_robots) | C++17 | 1530 ms | 32612 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
int A, B, T;
vector<int> X, Y, W, S;
vector<pair<int,int>> v, vv; // sorted by size, sorted by weight
bool can(int x) {
if(1LL * x * A + 1LL * x * B < T) return 0;
priority_queue<int> pq;
int pt = 0;
for(int i = 0; i < A; i++) {
while(pt < vv.size() && vv[pt].first < X[i]) {
pq.push(S[vv[pt].second]);
pt++;
}
int c = 0;
while(!pq.empty() && c < x) {
pq.pop();
c++;
}
}
Compilation message (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... |