제출 #671688

#제출 시각아이디문제언어결과실행 시간메모리
671688Hacv16Dancing Elephants (IOI11_elephants)C++17
0 / 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];

   return;
}

int update(int i, int y){
  x[i] = y;

  if(abs(x[0] - x[1]) > l) ans = 1;
  else ans = 2;

  return ans;
}
#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...