oj.uz

Submission #1085155

# Submission time Handle Problem Language Result Execution time Memory
1085155 2024-09-07T15:57:32 Z Wansur Dancing Elephants (IOI11_elephants) C++17
97 / 100
 8156 ms 24892 KB 
#include <bits/stdc++.h>
#define ent '\n'

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

set<pair<int, int>> s, t;
vector<int> g[maxn];
int a[maxn], block[maxn];
int out[maxn], dp[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 = 1200;
    for(int i=0;i<n;i++){
        a[i] = X[i];
    }
    sort(a, a+n);
    for(int i=0;i<n;i++){
        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){
    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){
    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:46:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |         if(g[last].size() >= k){
      |            ~~~~~~~~~~~~~~~^~~~
elephants.cpp: In function 'void del(int)':
elephants.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int _=0;_<g[block[i]].size();_++){
      |                 ~^~~~~~~~~~~~~~~~~~~
elephants.cpp: In function 'void add(int)':
elephants.cpp:86:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |     if(g[bl].size() > k){
      |        ~~~~~~~~~~~~~^~~
elephants.cpp:88:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   88 |         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 2 ms 4956 KB Output is correct
5 Correct 2 ms 5148 KB Output is correct
6 Correct 2 ms 5148 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 2 ms 4956 KB Output is correct
5 Correct 2 ms 5148 KB Output is correct
6 Correct 2 ms 5148 KB Output is correct
7 Correct 1586 ms 7444 KB Output is correct
8 Correct 1740 ms 8024 KB Output is correct
9 Correct 2044 ms 10356 KB Output is correct
10 Correct 690 ms 11088 KB Output is correct
11 Correct 732 ms 10832 KB Output is correct
12 Correct 1831 ms 10576 KB Output is correct
13 Correct 917 ms 11092 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 2 ms 4956 KB Output is correct
5 Correct 2 ms 5148 KB Output is correct
6 Correct 2 ms 5148 KB Output is correct
7 Correct 1586 ms 7444 KB Output is correct
8 Correct 1740 ms 8024 KB Output is correct
9 Correct 2044 ms 10356 KB Output is correct
10 Correct 690 ms 11088 KB Output is correct
11 Correct 732 ms 10832 KB Output is correct
12 Correct 1831 ms 10576 KB Output is correct
13 Correct 917 ms 11092 KB Output is correct
14 Correct 1140 ms 9364 KB Output is correct
15 Correct 1394 ms 9052 KB Output is correct
16 Correct 2123 ms 11616 KB Output is correct
17 Correct 2255 ms 13212 KB Output is correct
18 Correct 3377 ms 13136 KB Output is correct
19 Correct 3538 ms 13564 KB Output is correct
20 Correct 2308 ms 13492 KB Output is correct
21 Correct 2785 ms 13140 KB Output is correct
22 Correct 1549 ms 13492 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 2 ms 4956 KB Output is correct
5 Correct 2 ms 5148 KB Output is correct
6 Correct 2 ms 5148 KB Output is correct
7 Correct 1586 ms 7444 KB Output is correct
8 Correct 1740 ms 8024 KB Output is correct
9 Correct 2044 ms 10356 KB Output is correct
10 Correct 690 ms 11088 KB Output is correct
11 Correct 732 ms 10832 KB Output is correct
12 Correct 1831 ms 10576 KB Output is correct
13 Correct 917 ms 11092 KB Output is correct
14 Correct 1140 ms 9364 KB Output is correct
15 Correct 1394 ms 9052 KB Output is correct
16 Correct 2123 ms 11616 KB Output is correct
17 Correct 2255 ms 13212 KB Output is correct
18 Correct 3377 ms 13136 KB Output is correct
19 Correct 3538 ms 13564 KB Output is correct
20 Correct 2308 ms 13492 KB Output is correct
21 Correct 2785 ms 13140 KB Output is correct
22 Correct 1549 ms 13492 KB Output is correct
23 Correct 7540 ms 22676 KB Output is correct
24 Correct 7100 ms 22952 KB Output is correct
25 Correct 6921 ms 22868 KB Output is correct
26 Correct 3007 ms 24892 KB Output is correct
27 Correct 8156 ms 23644 KB Output is correct
28 Correct 3223 ms 10084 KB Output is correct
29 Incorrect 30 ms 9808 KB Output isn't correct
30 Halted 0 ms 0 KB -