oj.uz

Submission #671688

# Submission time Handle Problem Language Result Execution time Memory
671688 2022-12-13T14:42:24 Z Hacv16 Dancing Elephants (IOI11_elephants) C++17
0 / 100
 1 ms 340 KB 
#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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -