제출 #29102

#제출 시각아이디문제언어결과실행 시간메모리
29102Nikefor코끼리 (Dancing Elephants) (IOI11_elephants)C++98
0 / 100
69 ms16740 KiB
#include "elephants.h" #include<cmath> int n; bool s1 = false; int p[4]; void init(int N, int L, int X[]) { if(N==2) s1= true; p[1] = X[0]; p[2] = X[1]; n = N; } int update(int i, int y) { p[i] = y; if( std::abs(p[1]-p[2]) <=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...