Submission #29115

#TimeUsernameProblemLanguageResultExecution timeMemory
29115dereotuDancing Elephants (IOI11_elephants)C++14
10 / 100
99 ms17644 KiB
#include "elephants.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
using namespace std;
int n,l,a[2];

void init(int N, int L, int X[]){
	l=L;
	n = N;
	forr(i,0,n){
		a[i]=X[i];
	}
}

int update(int i, int y){
	a[i]=y;
	if(abs(a[0]-a[1])>l) return 2;
	else return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...