제출 #485365

#제출 시각아이디문제언어결과실행 시간메모리
485365blueDancing Elephants (IOI11_elephants)C++17
10 / 100
0 ms204 KiB
#include "elephants.h" #include <vector> #include <algorithm> using namespace std; const int maxN = 50'000; int N; int L; int* X; int* I; void init(int N_, int L_, int X_[]) { N = N_; L = L_; X = new int[N]; for(int i = 0; i < N; i++) X[i] = X_[i]; } int update(int i, int y) { X[i] = y; if(abs(X[0] - X[1]) > 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...