제출 #29104

#제출 시각아이디문제언어결과실행 시간메모리
29104Nikefor코끼리 (Dancing Elephants) (IOI11_elephants)C++98
0 / 100
113 ms16740 KiB
#include "elephants.h"
#include<cmath>
int n;
bool s1 = false;
int p[3];
void init(int N, int L, int X[])
{
  if(N==2) s1= true;
  p[0] = X[0];
  p[1] = X[1];
  n = N;
}

int update(int i, int y)
{
  p[i] = y;
  if( std::abs(p[0]-p[1]) <=10) return 1;
  return 2;
  return n;
}
#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...