oj.uz

Submission #946649

# Submission time Handle Problem Language Result Execution time Memory
946649 2024-03-14T20:59:03 Z OAleksa Dancing Elephants (IOI11_elephants) C++14
26 / 100
 9000 ms 9328 KB 
#include "elephants.h"
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N = 150069;
int n, a[N], d;

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

int update(int j, int y) {
   vector<int> x;
   a[j] = y;
   for (int i = 0;i < n;i++)
      x.push_back(a[i]);
   sort(x.begin(), x.end());
   int ans = 0;
   int i = 0, lst = -1;
   while (i < n) {
      if (x[i] > lst) {
         ++ans;
         lst = x[i] + d;
      }
      else
         ++i;
   }
   return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 7641 ms 8792 KB Output is correct
8 Execution timed out 9043 ms 9328 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 7641 ms 8792 KB Output is correct
8 Execution timed out 9043 ms 9328 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 7641 ms 8792 KB Output is correct
8 Execution timed out 9043 ms 9328 KB Time limit exceeded
9 Halted 0 ms 0 KB -