oj.uz

Submission #607416

# Submission time Handle Problem Language Result Execution time Memory
607416 2022-07-26T16:59:00 Z gonzakia29 Dancing Elephants (IOI11_elephants) C++17
0 / 100
 0 ms 340 KB 
#include "elephants.h"
#include <iostream>
using namespace std;

int n;
int l;
long long x[150000];

void init(int N, int L, int X[]){
  n = N;
  l = L;
  for (int i = 0; i < n; ++i){
    x[i] = X[i];
  }
}

int update(int i, int y){
    x[i] = y;
    if (abs(x[2]-x[1]) <= l){
        return 1;
    }
    return 2;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 0 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 0 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 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -