# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126377 | nxteru | Robots (IOI13_robots) | C++14 | 601 ms | 27504 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;
typedef long long ll;
typedef pair<ll,ll> P;
#define F first
#define S second
#define PB push_back
ll n,m,q,x[50005],y[50005],par[50005],res[50005],s[50005],u[50005];
P g[1000005];
vector<ll>cmx,cmy;
int find(int a){
if(par[a]==a)return a;
return par[a]=find(par[a]);
}
void unit(int a,int b){
par[a]=find(b);
}
bool check(int t){
for(int i=0;i<=cmy.size();i++)par[i]=i,res[i]=0;
for(int i=0;i<m;i++)res[y[i]]+=t;
for(int i=0;i<=cmx.size();i++)s[i]=0,u[i]=0;
for(int i=0;i<n;i++)u[x[i]]+=t;
for(int i=0;i<q;i++){
ll p=g[i].S;
p=find(p);
if(p==cmy.size())s[g[i].F]++;
else{
res[p]--;
if(res[p]==0)unit(p,p+1);
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... |