oj.uz

Submission #623616

# Submission time Handle Problem Language Result Execution time Memory
623616 2022-08-06T05:59:25 Z lorenzoferrari Dancing Elephants (IOI11_elephants) C++17
26 / 100
 9000 ms 2396 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 150000;

int n, l, x[MAXN];
multiset<int> s;

void init(int nn, int ll, int xx[]) {
    n = nn, l = ll;
    for (int i = 0; i < n; ++i) {
        x[i] = xx[i];
        s.insert(x[i]);
    }
}

int update(int i, int y) {
    s.erase(s.find(x[i]));
    x[i] = y;
    s.insert(x[i]);;
    int ans = 0;
    auto it = s.begin();
    while (it != s.end()) {
        it = s.upper_bound(*it + l);
        ++ans;
    }
    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 0 ms 312 KB Output is correct
3 Correct 0 ms 340 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 0 ms 312 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 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 0 ms 312 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Execution timed out 9006 ms 2396 KB Time limit exceeded
8 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 0 ms 312 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Execution timed out 9006 ms 2396 KB Time limit exceeded
8 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 0 ms 312 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Execution timed out 9006 ms 2396 KB Time limit exceeded
8 Halted 0 ms 0 KB -