Submission #1130249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130249		sohamsen15	Dancing Elephants (IOI11_elephants)	C++20	26 / 100	9086 ms	3908 KiB

elephants

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 999999;

int a[50005];
map<int, int> mp;
int n, l;

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

int update(int idx, int y) {
    mp.erase(a[idx]);
    mp[y] = 1;
    a[idx] = y; 
    int b[n]; int i = 0;
    for (auto x: mp) {
        b[i] = x.first;
        i++;
    }
    int ans = 0;
    for (int i = 0; i < n;) {
        ans++;
        bool done = false;
        for (int j = i + 1; j < n; j++) {
            if (b[j] - b[i] > l) {
                done = true;
                i = j; break;
            } else if (j == n - 1) {
                i = n;
                done = true;
            }
        }
        if (!done) i++;
    }
    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3