Submission #93997

#TimeUsernameProblemLanguageResultExecution timeMemory
93997someone_aaDancing Elephants (IOI11_elephants)C++17
10 / 100
2 ms504 KiB
#include "elephants.h" #include <bits/stdc++.h> int n, l, x[2]; void init(int N, int L, int X[]) { n = N; l = L; x[0] = X[0]; x[1] = X[1]; } int update(int i, int y) { x[i] = y; int fi = x[0]; int si = x[1]; if(abs(fi - si) > 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...