Submission #1221391

#TimeUsernameProblemLanguageResultExecution timeMemory
1221391corruptedbrainDancing Elephants (IOI11_elephants)C++20
10 / 100
0 ms328 KiB
#include "elephants.h" #include <math.h> using namespace std; int n, length; int E1, E2; void init(int N, int L, int X[]) { // Subtask 1 n = N; length = L; // N = 2 E1 = X[0]; E2 = X[1]; return; } int update(int i, int y) { if (i == 0) E1 = y; else E2 = y; return abs(E1 - E2) <= length ? 1 : 2; }
#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...