# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243993 | ctziapo | Robots (IOI13_robots) | C++14 | 3081 ms | 65540 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<algorithm>
#include<iostream>
#include<vector>
struct diplo{
int x;
int y;
int i;
};
bool ff(diplo x,diplo y){
return x.y>y.y || x.y==y.y && x.x>y.x;
}
bool ff2(diplo x,diplo y){
return x.x>y.x || x.x==y.x && x.y>y.y;
}
using namespace std;
int putaway(int a, int b, int n, int x[], int y[], int w[], int s[]) {
int f[n]={};
sort(x,x+a);
sort(y,y+b);
for(int i=0;i<n;i++){
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... |