oj.uz

Submission #17065

# Submission time Handle Problem Language Result Execution time Memory
17065 2015-11-04T13:47:57 Z erdemkiraz Dancing Elephants (IOI11_elephants) C++
26 / 100
 9000 ms 34340 KB 
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)

typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

const int N = 150000 + 5;
const int K = 100;
const int T = N / K + 5;

int n, l;
int a[N], nxt[N], need[N];
set < ii > s[T], all;

inline int get(int x) {
    return all.lower_bound(ii(x + l + 1, 0)) -> second;
}

void rebuild(int i) {
    int last = 0;
    if(s[i].size())
        last = (--s[i].end()) -> first;
    for(set < ii > :: reverse_iterator it = s[i].rbegin(); it != s[i].rend(); it++) {
        int x = it -> first;
        int id = it -> second;
        int next = get(x);
        //printf("id = %d next = %d\n", id, next);
        //printf("id = %d next = %d\n", id, next);
        if(a[next] <= last) {
            nxt[id] = nxt[next];
            need[id] = need[next] + 1;
        }
        else {
            nxt[id] = id;
            need[id] = 0;
        }
    }
}

ii b[N];

void init() {
    all.clear();
    for(int i = 0; i < n; i++) {
        all.insert(ii(a[i], i));
        b[i] = ii(a[i], i);
    }
    a[n] = 2 * inf;
    all.insert(ii(2 * inf, n));
    sort(b, b + n);
    int ind = 0;
    for(int i = 0; i * K < n; i++) {
        s[i].clear();
        for(int j = i * K; j < n and j < (i + 1) * K; j++) {
            s[i].insert(b[j]);
        }
        ind = i;
    }
    for(int i = ind; i >= 0; i--)
        rebuild(i);
}

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

int upCnt = 0;

int update(int i, int x) {
    upCnt++;
    if(upCnt == K) {
        upCnt = 0;
        a[i] = x;
        init();
    }
else {
    int ind = -1;
    for(int j = 0; j * K < n; j++) {
        if(s[j].count(ii(a[i], i))) {
            ind = j;
            break;
        }
    }
    assert(ind != -1);
    s[ind].erase(ii(a[i], i));
    all.erase(ii(a[i], i));
    rebuild(ind);
    a[i] = x;
    for(int j = 0; j * K < n; j++) {
        ind = j;
        if(s[j].size() and x <= (--s[j].end()) -> first)
            break;
    }
    all.insert(ii(a[i], i));
    s[ind].insert(ii(a[i], i));
    rebuild(ind);
}
    int pos = all.begin() -> second, ans = 0, cnt = 0;
    while(pos < n) {
        //printf("pos = %d\n", pos);
        //getchar();getchar();
        if(nxt[pos] == pos) {
            ans++;
            pos = get(a[pos]);
        }
        else {
            ans += need[pos];
            pos = nxt[pos];
        }
        cnt++;
    }
    assert(cnt <= T + T);
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4438 ms 21408 KB Output is correct
2 Correct 6490 ms 21936 KB Output is correct
3 Execution timed out 9000 ms 24968 KB Program timed out
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 8190 ms 21936 KB Output is correct
2 Execution timed out 9000 ms 22460 KB Program timed out
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9000 ms 34340 KB Program timed out
2 Halted 0 ms 0 KB -