# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210141 | mohamedsobhi777 | Robots (IOI13_robots) | C++14 | 1761 ms | 46996 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 "robots.h"
#include <bits/stdc++.h>
const int N = 1e6 + 6 ;
using namespace std ;
int AA , BB , TT ;
vector<int> XX , YY , WW , SS ;
vector<int> appear[N] ;
bool check(int x){
priority_queue<int> q ;
for(int i = 0 ; i < AA ; i++){
for(int j = 0 ; j < appear[i].size() ; j++){
q.push(appear[i][j]) ;
}
int sz = min((int)q.size() , x) ;
for(int j = 0 ; j < sz ; j++){
q.pop() ;
}
}
for(int i = 0 ; i < appear[AA].size() ; i++){
q.push(appear[AA][i]) ;
}
for(int i = 0 ; i < BB ; i++){
int sz = min((int)q.size() , x ) ;
for(int j = 0 ; j < sz ; j++){
if(q.top() < YY[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... |