oj.uz

Submission #1085177

# Submission time Handle Problem Language Result Execution time Memory
1085177 2024-09-07T16:37:34 Z Wansur Dancing Elephants (IOI11_elephants) C++17
97 / 100
 9000 ms 44484 KB 
#include <bits/stdc++.h>
#define ent '\n'

using namespace std;
const int maxn = 2e5 + 12;

set<pair<int, int>> s, t, q;
map<int, int> cnt;
vector<int> g[maxn];
int a[maxn], block[maxn];
int out[maxn], dp[maxn];
bool is[maxn];
int n, k, l, last;

void calc(vector<int> &c){
    for(int _=(int)c.size() - 1, ptr = (int)c.size();_>=0;_--){
        int i = c[_];
        assert(_ == 0 || a[i] >= a[c[_ - 1]]);
        while(ptr > 0 && a[c[ptr - 1]] > a[i] + l){
            ptr--;
        }
        if(a[c.back()] > a[i] + l){
            out[i] = out[c[ptr]];
            dp[i] = dp[c[ptr]] + 1;
        }
        else{
            out[i] = a[i] + l;
            dp[i] = 1;
        }
        assert(out[i] >= a[i] + l);
    }
}

void init(int N, int L, int X[]){
    n = N, l = L;
    k = 1000;
    for(int i=0;i<n;i++){
        a[i] = X[i];
    }
    sort(a, a+n);
    for(int i=0;i<n;i++){
        q.insert({a[i], i});
        cnt[a[i]]++;
        if(cnt[a[i]] > 1) continue;
        is[i] = 1;
        if(!g[last].size()){
            t.insert({a[i], last});
        }
        block[i] = last;
        g[last].push_back(i);
        s.insert({a[i], i});
        if(g[last].size() >= k){
            last++;
        }
    }
    for(int i=0;i<=last;i++){
        calc(g[i]);
    }
}

void del(int i){
    q.erase({a[i], i});
    cnt[a[i]]--;
    if(cnt[a[i]] > 0){
        if(!is[i]) return;
        is[i] = 0;
        auto it = q.lower_bound({a[i], 0});
        for(int _=0;_<g[block[i]].size();_++){
            if(g[block[i]][_] == i){
                g[block[i]][_] = it -> second;
                block[it -> second] = block[i];
            }
        }
        is[it -> second] = 1;
        s.erase({a[i], i});
        s.insert(*it);
        calc(g[block[i]]);
        return;
    }
    is[i] = 0;
    int pos = -1;
    for(int _=0;_<g[block[i]].size();_++){
        if(g[block[i]][_] == i){
            pos = _;
        }
    }
    if(pos < 0) exit(0);
    g[block[i]].erase(g[block[i]].begin() + pos);
    calc(g[block[i]]);
    s.erase({a[i], i});
}

void add(int i){
    q.insert({a[i], i});
    cnt[a[i]]++;
    is[i] = 0;
    if(cnt[a[i]] > 1) return;
    is[i] = 1;
    auto it = t.lower_bound({a[i] + 1, 0});
    int bl = 0;
    if(it == t.begin()){
        auto [x, y] = *it;
        t.erase(it);
        t.insert({a[i], y});
        bl = y;
    }
    else{
        it--;
        bl = it -> second;
    }
    block[i] = bl;
    g[bl].push_back(i);
    sort(g[bl].begin(), g[bl].end(), [](int i, int j){
        return a[i] < a[j];
    });
    if(g[bl].size() > k){
        last++;
        while(g[bl].size() > k / 2){
            g[last].push_back(g[bl].back());
            block[g[bl].back()] = last;
            g[bl].pop_back();
        }
        reverse(g[last].begin(), g[last].end());
        t.insert({a[g[last][0]], last});
        calc(g[last]);
    }
    calc(g[bl]);
    s.insert({a[i], i});
}

int get(){
    int val = -1, ans = 0;
    while(1){
        auto it = s.lower_bound({val + 1, 0});
        if(it == s.end()) break;
        auto [x, y] = *it;
        ans += dp[y];
        val = out[y];
    }
    return ans;
}

int update(int i, int y){
    del(i);
    a[i] = y;
    add(i);
    return get();
}

Compilation message

elephants.cpp: In function 'void init(int, int, int*)':
elephants.cpp:52:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |         if(g[last].size() >= k){
      |            ~~~~~~~~~~~~~~~^~~~
elephants.cpp: In function 'void del(int)':
elephants.cpp:68:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(int _=0;_<g[block[i]].size();_++){
      |                     ~^~~~~~~~~~~~~~~~~~~
elephants.cpp:82:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int _=0;_<g[block[i]].size();_++){
      |                 ~^~~~~~~~~~~~~~~~~~~
elephants.cpp: In function 'void add(int)':
elephants.cpp:116:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  116 |     if(g[bl].size() > k){
      |        ~~~~~~~~~~~~~^~~
elephants.cpp:118:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  118 |         while(g[bl].size() > k / 2){
      |               ~~~~~~~~~~~~~^~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 1711 ms 10836 KB Output is correct
8 Correct 1718 ms 11876 KB Output is correct
9 Correct 1949 ms 16364 KB Output is correct
10 Correct 775 ms 18004 KB Output is correct
11 Correct 816 ms 18040 KB Output is correct
12 Correct 1866 ms 17712 KB Output is correct
13 Correct 1027 ms 17748 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 1711 ms 10836 KB Output is correct
8 Correct 1718 ms 11876 KB Output is correct
9 Correct 1949 ms 16364 KB Output is correct
10 Correct 775 ms 18004 KB Output is correct
11 Correct 816 ms 18040 KB Output is correct
12 Correct 1866 ms 17712 KB Output is correct
13 Correct 1027 ms 17748 KB Output is correct
14 Correct 880 ms 11940 KB Output is correct
15 Correct 1331 ms 14300 KB Output is correct
16 Correct 2301 ms 18560 KB Output is correct
17 Correct 2366 ms 22604 KB Output is correct
18 Correct 3062 ms 22444 KB Output is correct
19 Correct 3224 ms 23272 KB Output is correct
20 Correct 2506 ms 23120 KB Output is correct
21 Correct 2839 ms 22888 KB Output is correct
22 Correct 1759 ms 22864 KB Output is correct

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 4 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 1711 ms 10836 KB Output is correct
8 Correct 1718 ms 11876 KB Output is correct
9 Correct 1949 ms 16364 KB Output is correct
10 Correct 775 ms 18004 KB Output is correct
11 Correct 816 ms 18040 KB Output is correct
12 Correct 1866 ms 17712 KB Output is correct
13 Correct 1027 ms 17748 KB Output is correct
14 Correct 880 ms 11940 KB Output is correct
15 Correct 1331 ms 14300 KB Output is correct
16 Correct 2301 ms 18560 KB Output is correct
17 Correct 2366 ms 22604 KB Output is correct
18 Correct 3062 ms 22444 KB Output is correct
19 Correct 3224 ms 23272 KB Output is correct
20 Correct 2506 ms 23120 KB Output is correct
21 Correct 2839 ms 22888 KB Output is correct
22 Correct 1759 ms 22864 KB Output is correct
23 Correct 7491 ms 40336 KB Output is correct
24 Correct 6084 ms 38772 KB Output is correct
25 Correct 6628 ms 38484 KB Output is correct
26 Correct 3762 ms 43884 KB Output is correct
27 Correct 8380 ms 43588 KB Output is correct
28 Correct 3645 ms 15056 KB Output is correct
29 Correct 2914 ms 14420 KB Output is correct
30 Correct 3484 ms 14924 KB Output is correct
31 Correct 2846 ms 14420 KB Output is correct
32 Correct 5167 ms 44428 KB Output is correct
33 Correct 2845 ms 36116 KB Output is correct
34 Correct 3628 ms 44484 KB Output is correct
35 Correct 984 ms 36692 KB Output is correct
36 Correct 129 ms 19540 KB Output is correct
37 Correct 1661 ms 36432 KB Output is correct
38 Correct 7940 ms 43600 KB Output is correct
39 Execution timed out 9069 ms 42688 KB Time limit exceeded
40 Halted 0 ms 0 KB -