oj.uz

Submission #547931

# Submission time Handle Problem Language Result Execution time Memory
547931 2022-04-12T03:29:42 Z tengiz05 The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 295 ms 262144 KB 
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif

using namespace std;

/*


6 5 11 4
2 42 1000 54 68 234
0 1
2 0
3 4
3 5
3 5
1 3
5 3
0 5
3 0
1 3
3 5
0 3 4 26
3 0 8 0
0 5 5 1000000000
3 0 11 14


*/

namespace sOlUTiON {
    using u32 = unsigned int;
    // 282
    using bit = array<u32, 283>;
    constexpr int N = 1E5, M = 2E5;
    int n, D;
    int h[N];
    vector<int> f[N];
    vector<bit> a[N];
    bit compress(vector<int> &a) {
        int j = 0, k = 0;
        bit res{};
        for (int i = 0; i < int(a.size()); i++) {
            if (j + 18 <= 32) {
                res[k] |= a[i] << j;
                j += 18;
                if (j == 32) {
                    j = 0;
                    k++;
                }
            } else {
                res[k] |= a[i] << j;
                int x = 32 - j;
                j += 18;
                j -= 32;
                k++;
                res[k] |= a[i] >> x;
            }
        }
        res[282] = a.size();
        return res;
    }
    vector<int> decompress(bit a) {
        int n = a[282];
        int j = 0, k = 0;
        vector<int> ans(n);
        for (int i = 0; i < n; i++) {
            if (j + 18 <= 32) {
                ans[i] = a[k] >> j;
                j += 18;
                if (j == 32) {
                    j = 0;
                    k++;
                }
            } else {
                ans[i] |= a[k] >> j;
                int x = 32 - j;
                j += 18;
                j -= 32;
                k++;
                ans[i] |= a[k] << x;
            }
        }
        for (int &x : ans) x &= (1 << 18) - 1;
        return ans;
    }
};
using namespace sOlUTiON;

void init(int _N, int _D, int H[]) {
    n = _N;
    D = _D;
    for (int i = 0; i < n; i++) {
        f[i].push_back(0);
        h[i] = H[i];
    }
}

void curseChanges(int U, int A[], int B[]) {
    int cnt[n] {};
    for (int i = 0; i < U; i++) {
        cnt[A[i]]++;
        cnt[B[i]]++;
    }
    
    int res = 0;
    for (int i = 0; i < n; i++) {
        a[i].resize(1 + cnt[i], bit{});
        res += a[i].size();
        a[i].shrink_to_fit();
        a[i].clear();
        a[i].push_back(bit{});
    }
    
    for (int i = 0; i < U; i++) {
        int u = A[i];
        int v = B[i];
        
        {
            vector<int> b = decompress(a[u].back()), w;
            int j = 0;
            while (j < int(b.size()) && (b[j] != v && h[b[j]] <= h[v]))
                w.push_back(b[j++]);
            
            if (j < int(b.size()) && b[j] == v) {
                j++;
            } else {
                w.push_back(v);
            }
            
            while (j < int(b.size()))
                w.push_back(b[j++]);
            
            a[u].push_back(compress(w));
        }
        {
            vector<int> b = decompress(a[v].back()), w;
            int j = 0;
            while (j < int(b.size()) && (b[j] != u && h[b[j]] <= h[u]))
                w.push_back(b[j++]);
            
            if (j < int(b.size()) && b[j] == u) {
                j++;
            } else {
                w.push_back(u);
            }
            
            while (j < int(b.size()))
                w.push_back(b[j++]);
            
            a[v].push_back(compress(w));
        }
        
        f[u].push_back(i + 1);
        f[v].push_back(i + 1);
    }
}

int question(int x, int y, int v) {
    int p1 = upper_bound(f[x].begin(), f[x].end(), v) - f[x].begin() - 1;
    int p2 = upper_bound(f[y].begin(), f[y].end(), v) - f[y].begin() - 1;
    
    int ans = 1E9;
    int s1 = a[x][p1][282];
    int s2 = a[y][p2][282];
    
    if (s1 == 0 || s2 == 0)
        return ans;
    
    vector<int> f = decompress(a[x][p1]);
    vector<int> s = decompress(a[y][p2]);
    
    int j = 0;
    for (int i = 0; i < s1; i++) {
        int t = h[f[i]];
        while (j + 1 < s2 && h[s[j]] < t)
            j++;
        ans = min(ans, abs(h[f[i]] - h[s[j]]));
    }
    j = 0;
    for (int i = 0; i < s2; i++) {
        int t = h[s[i]];
        while (j + 1 < s1 && h[f[j]] < t)
            j++;
        ans = min(ans, abs(h[s[i]] - h[f[j]]));
    }
    
    return ans;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8400 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 8 ms 8400 KB Output is correct
4 Correct 102 ms 124200 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 169 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 179 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 38888 KB Output is correct
2 Correct 104 ms 39020 KB Output is correct
3 Correct 117 ms 39100 KB Output is correct
4 Correct 295 ms 39040 KB Output is correct
5 Correct 262 ms 39044 KB Output is correct
6 Correct 97 ms 28564 KB Output is correct
7 Correct 234 ms 39132 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 8 ms 8400 KB Output is correct
3 Correct 8 ms 8400 KB Output is correct
4 Correct 8 ms 8400 KB Output is correct
5 Correct 102 ms 124200 KB Output is correct
6 Runtime error 169 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -