# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162099 | AlgorithmWarrior | Robots (IOI13_robots) | C++20 | 1031 ms | 13220 KiB |
#include <bits/stdc++.h>
#include "robots.h"
using namespace std;
int const MAX=1e6+5;
struct w_s{
int w,s;
bool operator<(w_s ot){
return s>ot.s;
}
}toy[MAX];
bool cmp(int a,int b){
return a>b;
}
bool check(int days,int X[],int Y[],int A,int B,int T){
map<int,int>mep;
int i;
for(i=0;i<A;++i)
if(1LL*i*days<T)
mep[X[i]]+=days;
vector<int>v;
for(i=0;i<T;++i)
if(mep.upper_bound(toy[i].w)->second==0)
v.push_back(toy[i].s);
else{
int nr=mep.upper_bound(toy[i].w)->first;
# | 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... |