# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139430 | MrBrionix | Robots (IOI13_robots) | C++14 | 1921 ms | 22968 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 <stdio.h>
#include <stdlib.h>
#include "robots.h"
#include<bits/stdc++.h>
using namespace std;
int low,up,mid,wei[100000],siz[100000],cont,cont2;
pair<int,int> v[1000005];
priority_queue<int> pq;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
up=T+1;
for(int i=0;i<A;i++)wei[i]=X[i];
for(int i=0;i<B;i++)siz[i]=Y[i];
for(int i=0;i<T;i++)v[i]={W[i],S[i]};
sort(v,v+T);
sort(wei,wei+A);
sort(siz,siz+B);
while(up-low>1){
mid=(up+low)/2;
while(pq.size()>0)pq.pop();
cont=0;
# | 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... |