# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731063 | ogibogi2004 | Dancing Elephants (IOI11_elephants) | 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 "elephants.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN=7e4+6;
const int K=280;
int dp1[MAXN];
int dp2[MAXN];
int where[MAXN];
int cam;
struct bucket
{
set<pair<int,int> >s;
void compute()
{
auto it=s.end();
//auto ptr=it;
//ptr--;
for(;;)
{
if(it==s.begin())
{
break;
}
--it;
int t=(*it).first+cam+1;
auto it1=s.lower_bound({t,-1});
/*while((*ptr).first>=t)
{
if(ptr==s.begin())