Submission #607393

#	Time	Username	Problem	Language	Result	Execution time	Memory
607393		APROHACK	Dancing Elephants (IOI11_elephants)	C++14	10 / 100	1 ms	312 KiB

elephants

#include "elephants.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
ll n;
ll mn, mx, l;
vector<int>a;
void init(int N, int L, int X[])
{
  n = N, l = L;
  mn = min(X[0], X[1]), mx = max(X[0], X[1]);
  a.pb(X[0]);
  a.pb(X[1]);
}

int update(int i, int y)
{
  a[i]=y;
  mn = min(a[0], a[1]), mx = max(a[0], a[1]);
  return 1+ (mx-mn > l);
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3