# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151388 | karma | Robots (IOI13_robots) | C++14 | 2705 ms | 30536 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 <bits/stdc++.h>
#include "robots.h"
#pragma GCC optimization ("O3")
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const int N = int(1e6) + 1;
const int M = int(5e4) + 1;
typedef pair<int, int> pii;
vector<pii> BaeW, BaeS;
vector<bool> del;
priority_queue<pii> pq;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{ // A -> W, B -> S
sort(X, X + A); sort(Y, Y + B);
for(int i = 0; i < T; ++i) BaeS.pb(S[i], i), BaeW.pb(W[i], i);
sort(BaeS.begin(), BaeS.end());
sort(BaeW.begin(), BaeW.end());
int low = 1, high = T, mid, j, cur, cnt;
del.resize(T);
while(low <= high) {
mid = (low + high) >> 1;
fill(del.begin(), del.end(), 0);
j = cnt = 0; while(pq.size()) pq.pop();
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... |