oj.uz

Submission #500323

# Submission time Handle Problem Language Result Execution time Memory
500323 2021-12-30T18:14:36 Z aryan12 Dancing Elephants (IOI11_elephants) C++17
10 / 100
 1 ms 332 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5 + 5;
int n, len;
set<int> pos;
int cur_pos[MAXN];

void init(int N, int L, int X[]) {
    n = N;
    len = L;
    for(int i = 0; i < N; i++) {
        pos.insert(X[i]);
        cur_pos[i] = X[i];
    }
}

int update(int i, int y)
{
    pos.erase(cur_pos[i]);
    cur_pos[i] = y;
    pos.insert(cur_pos[i]);
    int ans = 0, x = *(pos.begin());
    while(true) {
        ans++;
        if(pos.lower_bound(x + len + 1) == pos.end()) {
            break;
        }
        x = *(pos.lower_bound(x + len));
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 1 ms 316 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 1 ms 316 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 1 ms 316 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 1 ms 316 KB Output isn't correct
5 Halted 0 ms 0 KB -