# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93835 | vamaddur | Robots (IOI13_robots) | C++14 | 1688 ms | 24480 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.
/*
Solution
*/
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
#define PI atan2(0, -1)
#define epsilon 1e-9
#define INF 5000000000000000000
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]){
sort(X, X+A); sort(Y, Y+B);
vector<pair<int, int>> toys;
for(int i = 0; i < T; i++) toys.pb(mp(W[i], S[i]));
sort(toys.begin(), toys.end());
int lo = 1, hi = T, ret = -1;
while(lo <= hi){
int mid = (lo+hi)/2, idx = 0;
priority_queue<int> pq;
# | 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... |