Submission #607426

#TimeUsernameProblemLanguageResultExecution timeMemory
607426gonzakia29Dancing Elephants (IOI11_elephants)C++17
10 / 100
1 ms340 KiB
#include "elephants.h" #include <bits/stdc++.h> using namespace std; int n; long long l, mini, maxi; vector <int> x; void init(int N, int L, int X[]){ n = N; l = L; mini = min(X[0],X[1]); maxi = max(X[0],X[1]); x.push_back(mini); x.push_back(maxi); } int update(int i, int y){ x[i] = y; mini = min(x[0],x[1]); maxi = max(x[0],x[1]); return 1+(maxi-mini>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...