| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 29105 | Nikefor | Dancing Elephants (IOI11_elephants) | C++98 | 89 ms | 16740 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<cmath>
//int n;
//bool s1 = false;
int p[3];
void init(int N, int L, int X[])
{
//if(N==2) s1= true;
p[0] = X[0];
p[1] = X[1];
//n = N;
}
int update(int i, int y)
{
p[i] = y;
if( (p[0]-p[1]) <=10 and (p[0]-p[1]) >=-10 ) return 1;
return 2;
//return n;
}
| # | 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... | ||||
