Submission #671689

#TimeUsernameProblemLanguageResultExecution timeMemory
671689Hacv16Dancing Elephants (IOI11_elephants)C++17
10 / 100
1 ms340 KiB
#include "elephants.h" #include<bits/stdc++.h> typedef long long ll; const int MAX = 2e6 + 15; int n, l, x[MAX], ans; void init(int n_, int l_, int x_[]){ n = n_, l = l_; for(int i = 0; i < n; i++) x[i] = x_[i]; } int update(int i, int y){ x[i] = y; return 1 + (abs(x[0] - x[1]) > l); }
#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...