oj.uz

Submission #426369

# Submission time Handle Problem Language Result Execution time Memory
426369 2021-06-13T20:20:23 Z JeanBombeur Dancing Elephants (IOI11_elephants) C++17
100 / 100
 5205 ms 10404 KB 
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include "elephants.h"
using namespace std;

const int INFINI = (1000 * 1000 * 1000 + 1);
const int MAX_ELEPHANTS = (150 * 1000);
const int LOG = (10);
const int SQRT = (600);

int Positions[MAX_ELEPHANTS];

vector <int> Elephants[SQRT];

vector <pair <int, int>> Answer[SQRT];

int nbElephants, tailleIntervalle;

void UpdateBucket(int bucket) {
    int sz = Elephants[bucket].size();
    int droite = sz;
    for (int i = droite - 1; i >= 0; i --)
    {
        while (Elephants[bucket][droite - 1] > Elephants[bucket][i] + tailleIntervalle)
            droite --;
        if (droite == sz)
            Answer[bucket][i] = {1, Elephants[bucket][i] + tailleIntervalle};
        else
            Answer[bucket][i] = {1 + Answer[bucket][droite].first, Answer[bucket][droite].second};
    }
    return;
}

void Insert(int bucket, int val) {
    vector <int> nv;
    for (int a : Elephants[bucket])
    {
        if (a >= val)
        {
            nv.push_back(val);
            val = INFINI;
        }
        nv.push_back(a);
    }
    if (val < INFINI)
        nv.push_back(val);
    Elephants[bucket] = nv;
    Answer[bucket].push_back({0, 0});
    UpdateBucket(bucket);
    return;
}

void Remove(int bucket, int val) {
    vector <int> nv;
    for (int a : Elephants[bucket])
    {
        if (a == val)
            val = -1;
        else
            nv.push_back(a);
    }
    Elephants[bucket] = nv;
    UpdateBucket(bucket);
    return;
}

int FindNext(int bucket, int val) {
    int ans = -1;
    int sz = Elephants[bucket].size();
    for (int i = (1 << LOG); i > 0; i /= 2)
    {
        if (ans + i < sz && Elephants[bucket][ans + i] <= val)
            ans += i;
    }
    return ans + 1;
}

int FindAnswer() {
    int ans = 0;
    int curBucket = 0;
    int curId = 0;
    while (Elephants[curBucket].size() > 0)
    {
        ans += Answer[curBucket][curId].first;
        int saut = Answer[curBucket][curId].second;
        curId = FindNext(++ curBucket, saut);
        while (curId != 0 && curId == (int)Elephants[curBucket].size())
            curId = FindNext(++ curBucket, saut);
    }
    return ans;
}

void ResetBuckets() {
    vector <int> AllPos;
    int curBucket = 0;
    while (Elephants[curBucket].size() > 0)
    {
        for (int a : Elephants[curBucket])
            AllPos.push_back(a);
        curBucket ++;
    }
    for (int i = 0; i < curBucket; i ++)
    {
        Elephants[i].clear();
        Answer[i].clear();
    }
    curBucket = 0;
    for (int i = 0; i < nbElephants; i ++)
    {
        if ((int)Elephants[curBucket].size() > SQRT && (nbElephants - i) >= SQRT / 2)
            curBucket ++;
        Elephants[curBucket].push_back(AllPos[i]);
        Answer[curBucket].push_back({0, 0});
    }
    for (int i = 0; i <= curBucket; i ++)
    {
        UpdateBucket(i);
    }
    return;
}

void init(int N, int L, int X[]) {
    nbElephants = N;
    tailleIntervalle = L;
    for (int i = 0; i < nbElephants; i ++)
    {
        Positions[i] = X[i];
    }
    sort(X, X + nbElephants);
    int curBucket = 0;
    for (int i = 0; i < nbElephants; i ++)
    {
        if ((int)Elephants[curBucket].size() > SQRT && (nbElephants - i) >= SQRT / 2)
            curBucket ++;
        Elephants[curBucket].push_back(X[i]);
        Answer[curBucket].push_back({0, 0});
    }
    for (int i = 0; i <= curBucket; i ++)
    {
        UpdateBucket(i);
    }
    return;
}

int update(int id, int nouvPos) {
    
    int prev = Positions[id];
    Positions[id] = nouvPos;
    
    int curBucket = 0;
    bool reset = false;
    while ((int)Elephants[curBucket].size() > 0 && Elephants[curBucket].back() < prev)
        curBucket ++;
    if (Elephants[curBucket].size() == 0)
        curBucket --;
    Remove(curBucket, prev);
    if (Elephants[curBucket].size() == 1)
        reset = true;
    
    curBucket = 0;
    while ((int)Elephants[curBucket].size() > 0 && Elephants[curBucket].back() < nouvPos)
        curBucket ++;
    if (Elephants[curBucket].size() == 0)
        curBucket --;
    Insert(curBucket, nouvPos);
    if (Elephants[curBucket].size() >= 2 * SQRT)
        reset = true;
    
    if (reset)
        ResetBuckets();
    
    return FindAnswer();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 547 ms 1604 KB Output is correct
8 Correct 602 ms 1892 KB Output is correct
9 Correct 750 ms 3312 KB Output is correct
10 Correct 826 ms 2788 KB Output is correct
11 Correct 827 ms 2840 KB Output is correct
12 Correct 1069 ms 3136 KB Output is correct
13 Correct 804 ms 2796 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 547 ms 1604 KB Output is correct
8 Correct 602 ms 1892 KB Output is correct
9 Correct 750 ms 3312 KB Output is correct
10 Correct 826 ms 2788 KB Output is correct
11 Correct 827 ms 2840 KB Output is correct
12 Correct 1069 ms 3136 KB Output is correct
13 Correct 804 ms 2796 KB Output is correct
14 Correct 759 ms 2132 KB Output is correct
15 Correct 870 ms 2840 KB Output is correct
16 Correct 1617 ms 3788 KB Output is correct
17 Correct 1687 ms 4032 KB Output is correct
18 Correct 1772 ms 4052 KB Output is correct
19 Correct 1416 ms 4004 KB Output is correct
20 Correct 1734 ms 4032 KB Output is correct
21 Correct 1650 ms 3908 KB Output is correct
22 Correct 1542 ms 3920 KB Output is correct

Subtask #5
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 547 ms 1604 KB Output is correct
8 Correct 602 ms 1892 KB Output is correct
9 Correct 750 ms 3312 KB Output is correct
10 Correct 826 ms 2788 KB Output is correct
11 Correct 827 ms 2840 KB Output is correct
12 Correct 1069 ms 3136 KB Output is correct
13 Correct 804 ms 2796 KB Output is correct
14 Correct 759 ms 2132 KB Output is correct
15 Correct 870 ms 2840 KB Output is correct
16 Correct 1617 ms 3788 KB Output is correct
17 Correct 1687 ms 4032 KB Output is correct
18 Correct 1772 ms 4052 KB Output is correct
19 Correct 1416 ms 4004 KB Output is correct
20 Correct 1734 ms 4032 KB Output is correct
21 Correct 1650 ms 3908 KB Output is correct
22 Correct 1542 ms 3920 KB Output is correct
23 Correct 4509 ms 9876 KB Output is correct
24 Correct 4714 ms 9876 KB Output is correct
25 Correct 4001 ms 9916 KB Output is correct
26 Correct 4646 ms 8108 KB Output is correct
27 Correct 5060 ms 8144 KB Output is correct
28 Correct 2355 ms 3340 KB Output is correct
29 Correct 2336 ms 2588 KB Output is correct
30 Correct 2368 ms 3400 KB Output is correct
31 Correct 2332 ms 2552 KB Output is correct
32 Correct 3838 ms 8084 KB Output is correct
33 Correct 3390 ms 8064 KB Output is correct
34 Correct 4271 ms 8116 KB Output is correct
35 Correct 3746 ms 10404 KB Output is correct
36 Correct 1944 ms 8380 KB Output is correct
37 Correct 4343 ms 8392 KB Output is correct
38 Correct 4243 ms 7968 KB Output is correct
39 Correct 4648 ms 8284 KB Output is correct
40 Correct 4187 ms 8172 KB Output is correct
41 Correct 5205 ms 8124 KB Output is correct
42 Correct 5204 ms 7936 KB Output is correct