oj.uz

Submission #671699

# Submission time Handle Problem Language Result Execution time Memory
671699 2022-12-13T15:08:54 Z Hacv16 Dancing Elephants (IOI11_elephants) C++17
26 / 100
 9000 ms 3548 KB 
#include "elephants.h"
#include<bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

typedef long long ll;
const int MAX = 2e6 + 15;

int n, l, x[MAX];
set<int> s;

void init(int n_, int l_, int x_[]){
  n = n_, l = l_;

  for(int i = 0; i < n; i++)
     x[i] = x_[i], s.insert(x[i]);
}

int update(int i, int y){
  s.erase(x[i]);
  s.insert(y);

  x[i] = y;

  int ans = 0, r = -1;
 
  for(auto x : s)
    if(x > r) ans++, r = x + l;

  return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 304 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 5082 ms 1584 KB Output is correct
8 Correct 7267 ms 1876 KB Output is correct
9 Execution timed out 9099 ms 3548 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 5082 ms 1584 KB Output is correct
8 Correct 7267 ms 1876 KB Output is correct
9 Execution timed out 9099 ms 3548 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 5082 ms 1584 KB Output is correct
8 Correct 7267 ms 1876 KB Output is correct
9 Execution timed out 9099 ms 3548 KB Time limit exceeded
10 Halted 0 ms 0 KB -