oj.uz

Submission #29115

# Submission time Handle Problem Language Result Execution time Memory
29115 2017-07-18T10:00:29 Z dereotu Dancing Elephants (IOI11_elephants) C++14
10 / 100
 99 ms 17644 KB 
#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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17644 KB Output is correct
2 Correct 0 ms 17644 KB Output is correct
3 Correct 0 ms 17644 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 17644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 17644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 17644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 99 ms 17644 KB Output isn't correct
2 Halted 0 ms 0 KB -