| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 39151 | faustaadp | 로봇 (IOI13_robots) | C++14 | 0 ms | 0 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>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
int t,i,n,m,x[1010101],y[1010101],hs,l,r,c,xx[1010101],yy[1010101],b[1010101];
pair<int,int> a[1010101];
bool cm(pair<ll,ll> aa,pair<ll,ll> bb)
{
return aa.se>bb.se;
}
bool rmt(ll aa)
{
ll ii,jj,te;
for(ii=0;ii<n;ii++)
xx[ii]=0;
for(ii=0;ii<m;ii++)
yy[ii]=0;
for(ii=0;ii<t;ii++)
b[ii]=0;
for(ii=0;ii<t;ii++)
{
for(jj=0;jj<n;jj++)
{
if(xx[jj]<aa&&a[ii].fi<x[jj])
{
// cout<<aa<<" "<<x[jj]<<" "<<a[ii].fi<<"-"<<ii<<"---"<<a[ii].fi<<" "<<a[ii].se<<"\n";
xx[jj]++;
b[ii]=1;
break;
}
}
}
te=m-1;
for(ii=0;ii<t;ii++)
{
if(t>10000)
{
if(te<0)
return 0;
if(a[ii].se<y[te])
{
yy[te]++;
}
else
return 0;
if(yy[te]==aa)
te--;
}
else
{
if(b[ii]==0)
{
for(jj=0;jj<m;jj++)
{
if(yy[jj]<aa&&a[ii].se<y[jj])
{
yy[jj]++;
b[ii]=1;
break;
}
}
}
if(b[ii]==0)
{
// cout<<a[ii].fi<<"-"<<a[ii].se<<"\n";
// cout<<aa<<" "<<ii<<"\n";
return 0;
}
}
}
return 1;
}