oj.uz

Submission #94208

# Submission time Handle Problem Language Result Execution time Memory
94208 2019-01-16T16:28:59 Z johnjq Pictionary (COCI18_pictionary) C++17
140 / 140
 505 ms 52584 KB 
#include <bits/stdc++.h>
using namespace std;
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int, int> ii;
/////////////////////////////////////////////////////// BEGIN OF UNION-FIND WITH PARTIAL PERSISTENCY ///////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////////////////////////
//////////////// Note: this class supports both 0-indexed and 1-indexed elements ////////////////
/////////////////////////////////////////////////////////////////////////////////////////////////
class UnionFindPartial {
private:
    int m_current_time;
    std::vector<int> m_parent; // [0 .. size]
    std::vector<int> m_time;   // [0 .. size]
    std::vector<int> m_size;   // [0 .. size]
public:
    UnionFindPartial(const int size) {
        m_current_time = 0;
        m_parent.reserve(size+1);
        m_time.reserve(size+1);
        m_size.reserve(size+1);
        for (int i = 0; i <= size; ++i) {
            m_parent.push_back(i);
            m_time.push_back(0);
            m_size.push_back(1);
        }
    }
    inline int time() const {
        return m_current_time;
    }
    inline int find(int x, const int last_time) const {
        while (m_time[x] <= last_time && x != m_parent[x])
            x = m_parent[x];
        return x;
    }
    inline int find(const int x) const {
        return find(x, time());
    }
    void merge(const int a, const int b) {
        const int gpa = find(a);
        const int gpb = find(b);
        m_current_time += 1;
        if (gpa != gpb) {
            if (m_size[gpa] < m_size[gpb]) {
                m_parent[gpa] = gpb;
                m_time[gpa] = m_current_time;
                m_size[gpb] += m_size[gpa];
            } else {
                m_parent[gpb] = gpa;
                m_time[gpb] = m_current_time;
                m_size[gpa] += m_size[gpb];
            }
        }
    }
    bool same(const int a, const int b) {
        return find(a) == find(b);
    }
    bool same(const int a, const int b, const int last_time) {
        return find(a, last_time) == find(b, last_time);
    }
    inline int find_time(int a, int b) {
        int ans = 0;
        while (a != b) {
            if (m_parent[a] == a && m_parent[b] == b) return -1;
            if ((m_time[a] <= m_time[b] && m_parent[a] != a) || m_parent[b] == b) {
                ans = max(ans, m_time[a]);
                a = m_parent[a];
            } else {
                ans = max(ans, m_time[b]);
                b = m_parent[b];
            }
        }
        return ans;
    }
    int size(const int a) {
        const int gpa = find(a);
        return m_size[gpa];
    }
};
/////////////////////////////////////////////////////// END OF UNION-FIND WITH PARTIAL PERSISTENCY ///////////////////////////////////////////////////////
 
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
 
    int n, m, q;
    cin>>n>>m>>q;
    UnionFindPartial uf(n);
    map<int, int> ans;
    ans[uf.time()] = 0;
    for (int day = m; day >= 1; --day) {
        for (int i = 2; i*day <= n; ++i) {
            uf.merge(day, i*day);
            ans[uf.time()] = m-day+1;
        }
    }
    while (q--) {
        int a, b;
        cin>>a>>b;
        int time = uf.find_time(a, b);
        cout<<ans[time]<<'\n';
    }
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 632 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1144 KB Output is correct
2 Correct 26 ms 888 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1424 KB Output is correct
2 Correct 32 ms 1100 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10744 KB Output is correct
2 Correct 90 ms 10448 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 15352 KB Output is correct
2 Correct 114 ms 13804 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 22804 KB Output is correct
2 Correct 191 ms 24068 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 17144 KB Output is correct
2 Correct 350 ms 35420 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 40172 KB Output is correct
2 Correct 408 ms 44792 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 505 ms 52584 KB Output is correct
2 Correct 470 ms 51228 KB Output is correct