# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199001 | maximath_1 | Robots (IOI13_robots) | C++11 | 1047 ms | 29536 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>
using namespace std;
#define ll long long
ll n, a, b;
vector<pair<ll, ll> >v;
vector<ll>vv[50005];
bool ok(ll x){
ll sisa=0;
vector<ll>isi;
priority_queue<ll>pq;
for(ll i=0; i<vv[0].size(); i++)
isi.push_back(vv[0][i]);
for(ll i=1; i<=a; i++){
// cout<<sisa<<"->";
for(ll j=0; j<(ll)vv[i].size(); j++)
pq.push(vv[i][j]);
ll siz=vv[i].size();
if(sisa>=siz-x) sisa-=siz-x;
else{
for(ll j=1; j<=siz-x-sisa; j++){
if(pq.empty()) return false;
isi.push_back(pq.top()); pq.pop();
}
sisa=0;
}
// cout<<sisa<<endl;
}
sort(isi.begin(), isi.end());
for(ll i=0; i<(ll)isi.size(); 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... |