oj.uz

Submission #1114855

# Submission time Handle Problem Language Result Execution time Memory
1114855 2024-11-19T17:13:00 Z ortsac Dancing Elephants (IOI11_elephants) C++17
26 / 100
 9000 ms 10540 KB 
#pragma GCC optimize("O3")
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

int n, l;
vector<int> v;
vector<int> po;
vector<int> haspo;

void init(int N, int L, int X[])
{
  n = N;
  l = L;
  v.resize(n);
  po.resize(n);
  haspo.resize(n);
  for (int i = 0; i < n; i++) {
    po[i] = i;
    haspo[i] = i;
    v[i] = X[i];
  }
}

int update(int i, int y) {
  if (v[po[i]] < y) {
    v[po[i]] = y;
    int lst, qtd = 0;
    for (int i = 0; i < n; i++) {
      if ((i < (n - 1)) && (v[i] > v[i + 1])) {
        swap(v[i], v[i + 1]);
        swap(po[haspo[i]], po[haspo[i + 1]]);
        swap(haspo[i], haspo[i + 1]);
      }
      if ((i == 0) || (v[i] > (lst + l))) {
        lst = v[i];
        qtd++;
      }
    }
    return qtd;
  } else {
    v[po[i]] = y;
    int lst, qtd = 0;
    for (int i = n - 1; i >= 0; i--) {
      if ((i > 0) && (v[i] < v[i - 1])) {
        swap(v[i], v[i - 1]);
        swap(po[haspo[i]], po[haspo[i - 1]]);
        swap(haspo[i], haspo[i - 1]);
      }
      if ((i == (n - 1)) || (v[i] < (lst - l))) {
        lst = v[i];
        qtd++;
      }
    }
    return qtd;
  }
}

Compilation message

elephants.cpp: In function 'int update(int, int)':
elephants.cpp:51:42: warning: 'lst' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |       if ((i == (n - 1)) || (v[i] < (lst - l))) {
      |                                     ~~~~~^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6648 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1970 ms 8972 KB Output is correct
8 Correct 3022 ms 9012 KB Output is correct
9 Correct 3580 ms 9404 KB Output is correct
10 Execution timed out 9035 ms 10540 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6648 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1970 ms 8972 KB Output is correct
8 Correct 3022 ms 9012 KB Output is correct
9 Correct 3580 ms 9404 KB Output is correct
10 Execution timed out 9035 ms 10540 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6480 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Correct 1 ms 6480 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 1 ms 6648 KB Output is correct
6 Correct 1 ms 6480 KB Output is correct
7 Correct 1970 ms 8972 KB Output is correct
8 Correct 3022 ms 9012 KB Output is correct
9 Correct 3580 ms 9404 KB Output is correct
10 Execution timed out 9035 ms 10540 KB Time limit exceeded
11 Halted 0 ms 0 KB -