oj.uz

답안 #693107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
693107 2023-02-02T11:39:40 Z sharaelong 고대 책들 (IOI17_books) C++17
50 / 100
 282 ms 99304 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

struct DisjointSet {
    int n;
    vector<int> parent, rank;
    DisjointSet(int _n) : n(_n) {
        parent.resize(n);
        iota(parent.begin(), parent.end(), 0);
        rank.resize(n, 0);
    }

    int find(int u) {
        return parent[u] = (u == parent[u] ? u : find(parent[u]));
    }

    void merge(int u, int v) {
        u = find(u); v = find(v);
        if (u == v) return;
        if (rank[u] > rank[v]) swap(u, v);
        parent[u] = v;
        if (rank[u] == rank[v]) ++rank[v];
    }
};

struct FenwickTree {
    vector<int> tree;
    FenwickTree(int size) {
        tree.resize(size+1, 0);
    }

    int sum(int pos) {
        int ret = 0;
        for (int i=pos+1; i>0; i &= (i-1)) ret += tree[i];
        return ret;
    }

    void add(int pos, int val) {
        for (int i=pos+1; i<tree.size(); i+=(i & -i)) tree[i] += val;
    }
};

const int MAX_N = 1e6 + 1;
const ll INF = 4e18;

DisjointSet dsu(MAX_N);
FenwickTree fen(MAX_N);
bool visited[MAX_N];
vector<int> cycle[MAX_N];
vector<int> adj[MAX_N];
ll dp[MAX_N];

void dfs(int here, int parent = -1) {
    bool merged = false;
    if (parent != -1) {
        parent = dsu.find(parent);
        int mn = *min_element(cycle[here].begin(), cycle[here].end());
        int mx = *max_element(cycle[here].begin(), cycle[here].end());
        if (fen.sum(mx) - fen.sum(mn) > 0) {
            dsu.merge(here, parent);
            for (int x: cycle[here]) fen.add(x, 1);
            if (cycle[here].size() > cycle[parent].size()) swap(cycle[here], cycle[parent]);
            for (int x: cycle[here]) cycle[parent].push_back(x);
            merged = true;
        }
    }
    
    if (!merged) {
        for (int x: cycle[here]) fen.add(x, 1);
    }
    for (int there: adj[here]) {
        dfs(there, here);
    }
    if (!merged) {
        for (int x: cycle[dsu.find(here)]) fen.add(x, -1);
    }
}

ll minimum_walk(vector<int> p, int s) {
    int n = p.size();
    vector<pair<pii, int>> range;
    ll jump_len = 0;
    for (int i=0; i<n; ++i) {
        if (!visited[i]) {
            int l = i, r = i;
            jump_len += abs(i-p[i]);
            visited[i] = true;
            int x = p[i];
            while (x != i) {
                l = min(l, x);
                r = max(r, x);
                jump_len += abs(x-p[x]);
                visited[x] = true;
                dsu.merge(x, i);
                x = p[x];
            }
            if (l < r) range.push_back({ { l, r }, i });
        }
    }
    
    sort(range.begin(), range.end());
    for (int i=0; i<range.size(); ) {
        auto[l, r] = range[i].first;
        int j = i+1;
        while (j < range.size() && range[j].first.first < r) {
            dsu.merge(range[i].second, range[j].second);
            r = max(r, range[j].first.second);
            j++;
        }
        i = j;
    }
    
    vector<pair<pii, int>> dfs_order;
    for (int i=0; i<n; ++i) cycle[dsu.find(i)].push_back(i);
    for (int i=0; i<n; ++i) {
        if (dsu.find(i) == i && cycle[i].size() >= 2) {
            dfs_order.push_back({ { cycle[i][0], cycle[i].back() }, i });
        }
    }
    sort(dfs_order.begin(), dfs_order.end());
    
    vector<pii> st;
    vector<int> roots;
    for (int i=0; i<dfs_order.size(); ++i) {
        while (!st.empty() && st.back().first < dfs_order[i].first.first) st.pop_back();
        if (!st.empty()) adj[st.back().second].push_back(dfs_order[i].second);
        else roots.push_back(dfs_order[i].second);
        st.push_back({ dfs_order[i].first.second, dfs_order[i].second });
    }
    for (int r: roots) dfs(r);

    ll ans = 0;
    for (int i=0; i<roots.size(); ++i) {
        int r = dsu.find(roots[i]);
        sort(cycle[r].begin(), cycle[r].end());
        // cout << r << ": ";
        // for (int x:cycle[r]) cout << x << ' ';
        // cout << endl;
        if (i > 0) ans += cycle[r][0];
        if (i+1 < roots.size()) ans -= cycle[r].back();
        
        if (cycle[r][0] <= s && s <= cycle[r].back()) {
            ll tmp = INF;
            for (int x: cycle[r]) tmp = min(tmp, (ll)abs(x-s));
            ans += tmp;
        }
    }
    if (!roots.empty()) {
        if (s < cycle[dsu.find(roots[0])][0]) ans += cycle[dsu.find(roots[0])][0]-s;
        if (s > cycle[dsu.find(roots.back())].back()) ans += s-cycle[dsu.find(roots.back())].back();
    }
    return jump_len + 2ll * ans;
    
    ll accum = s;
    // ll ans = INF;
    for (int i=0; i<=s; ++i) {
        // cout << i << ' ' << accum << endl;
        ans = min(ans, accum-i);
        accum = max(accum, dp[i]);
    }
    // cout << jump_len << endl;
    return jump_len + 2ll * ans;
}

Compilation message

books.cpp: In member function 'void FenwickTree::add(int, int)':
books.cpp:42:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (int i=pos+1; i<tree.size(); i+=(i & -i)) tree[i] += val;
      |                           ~^~~~~~~~~~~~
books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:105:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for (int i=0; i<range.size(); ) {
      |                   ~^~~~~~~~~~~~~
books.cpp:108:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         while (j < range.size() && range[j].first.first < r) {
      |                ~~^~~~~~~~~~~~~~
books.cpp:127:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |     for (int i=0; i<dfs_order.size(); ++i) {
      |                   ~^~~~~~~~~~~~~~~~~
books.cpp:136:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |     for (int i=0; i<roots.size(); ++i) {
      |                   ~^~~~~~~~~~~~~
books.cpp:143:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |         if (i+1 < roots.size()) ans -= cycle[r].back();
      |             ~~~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 59220 KB Output is correct
2 Correct 28 ms 59008 KB Output is correct
3 Correct 28 ms 59016 KB Output is correct
4 Correct 27 ms 58964 KB Output is correct
5 Correct 27 ms 58964 KB Output is correct
6 Correct 31 ms 59024 KB Output is correct
7 Correct 26 ms 58964 KB Output is correct
8 Correct 27 ms 58988 KB Output is correct
9 Correct 28 ms 58952 KB Output is correct
10 Correct 27 ms 58968 KB Output is correct
11 Correct 30 ms 58964 KB Output is correct
12 Correct 30 ms 59024 KB Output is correct
13 Correct 27 ms 58924 KB Output is correct
14 Correct 28 ms 58964 KB Output is correct
15 Correct 27 ms 58964 KB Output is correct
16 Correct 27 ms 58932 KB Output is correct
17 Correct 28 ms 58964 KB Output is correct
18 Correct 27 ms 58920 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 59220 KB Output is correct
2 Correct 28 ms 59008 KB Output is correct
3 Correct 28 ms 59016 KB Output is correct
4 Correct 27 ms 58964 KB Output is correct
5 Correct 27 ms 58964 KB Output is correct
6 Correct 31 ms 59024 KB Output is correct
7 Correct 26 ms 58964 KB Output is correct
8 Correct 27 ms 58988 KB Output is correct
9 Correct 28 ms 58952 KB Output is correct
10 Correct 27 ms 58968 KB Output is correct
11 Correct 30 ms 58964 KB Output is correct
12 Correct 30 ms 59024 KB Output is correct
13 Correct 27 ms 58924 KB Output is correct
14 Correct 28 ms 58964 KB Output is correct
15 Correct 27 ms 58964 KB Output is correct
16 Correct 27 ms 58932 KB Output is correct
17 Correct 28 ms 58964 KB Output is correct
18 Correct 27 ms 58920 KB Output is correct
19 Correct 31 ms 58940 KB Output is correct
20 Correct 27 ms 58928 KB Output is correct
21 Correct 29 ms 58992 KB Output is correct
22 Correct 27 ms 59072 KB Output is correct
23 Correct 27 ms 58956 KB Output is correct
24 Correct 28 ms 59032 KB Output is correct
25 Correct 28 ms 58976 KB Output is correct
26 Correct 27 ms 58972 KB Output is correct
27 Correct 30 ms 58948 KB Output is correct
28 Correct 26 ms 58964 KB Output is correct
29 Correct 32 ms 59020 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 59220 KB Output is correct
2 Correct 28 ms 59008 KB Output is correct
3 Correct 28 ms 59016 KB Output is correct
4 Correct 27 ms 58964 KB Output is correct
5 Correct 27 ms 58964 KB Output is correct
6 Correct 31 ms 59024 KB Output is correct
7 Correct 26 ms 58964 KB Output is correct
8 Correct 27 ms 58988 KB Output is correct
9 Correct 28 ms 58952 KB Output is correct
10 Correct 27 ms 58968 KB Output is correct
11 Correct 30 ms 58964 KB Output is correct
12 Correct 30 ms 59024 KB Output is correct
13 Correct 27 ms 58924 KB Output is correct
14 Correct 28 ms 58964 KB Output is correct
15 Correct 27 ms 58964 KB Output is correct
16 Correct 27 ms 58932 KB Output is correct
17 Correct 28 ms 58964 KB Output is correct
18 Correct 27 ms 58920 KB Output is correct
19 Correct 31 ms 58940 KB Output is correct
20 Correct 27 ms 58928 KB Output is correct
21 Correct 29 ms 58992 KB Output is correct
22 Correct 27 ms 59072 KB Output is correct
23 Correct 27 ms 58956 KB Output is correct
24 Correct 28 ms 59032 KB Output is correct
25 Correct 28 ms 58976 KB Output is correct
26 Correct 27 ms 58972 KB Output is correct
27 Correct 30 ms 58948 KB Output is correct
28 Correct 26 ms 58964 KB Output is correct
29 Correct 32 ms 59020 KB Output is correct
30 Correct 282 ms 72252 KB Output is correct
31 Correct 265 ms 72280 KB Output is correct
32 Correct 155 ms 99304 KB Output is correct
33 Correct 212 ms 96396 KB Output is correct
34 Correct 211 ms 96448 KB Output is correct
35 Correct 239 ms 92352 KB Output is correct
36 Correct 221 ms 81916 KB Output is correct
37 Correct 195 ms 74468 KB Output is correct
38 Correct 197 ms 73688 KB Output is correct
39 Correct 190 ms 73372 KB Output is correct
40 Correct 213 ms 72624 KB Output is correct
41 Correct 219 ms 72888 KB Output is correct
42 Correct 206 ms 72896 KB Output is correct
43 Correct 191 ms 88376 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 59056 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 59220 KB Output is correct
2 Correct 28 ms 59008 KB Output is correct
3 Correct 28 ms 59016 KB Output is correct
4 Correct 27 ms 58964 KB Output is correct
5 Correct 27 ms 58964 KB Output is correct
6 Correct 31 ms 59024 KB Output is correct
7 Correct 26 ms 58964 KB Output is correct
8 Correct 27 ms 58988 KB Output is correct
9 Correct 28 ms 58952 KB Output is correct
10 Correct 27 ms 58968 KB Output is correct
11 Correct 30 ms 58964 KB Output is correct
12 Correct 30 ms 59024 KB Output is correct
13 Correct 27 ms 58924 KB Output is correct
14 Correct 28 ms 58964 KB Output is correct
15 Correct 27 ms 58964 KB Output is correct
16 Correct 27 ms 58932 KB Output is correct
17 Correct 28 ms 58964 KB Output is correct
18 Correct 27 ms 58920 KB Output is correct
19 Correct 31 ms 58940 KB Output is correct
20 Correct 27 ms 58928 KB Output is correct
21 Correct 29 ms 58992 KB Output is correct
22 Correct 27 ms 59072 KB Output is correct
23 Correct 27 ms 58956 KB Output is correct
24 Correct 28 ms 59032 KB Output is correct
25 Correct 28 ms 58976 KB Output is correct
26 Correct 27 ms 58972 KB Output is correct
27 Correct 30 ms 58948 KB Output is correct
28 Correct 26 ms 58964 KB Output is correct
29 Correct 32 ms 59020 KB Output is correct
30 Correct 282 ms 72252 KB Output is correct
31 Correct 265 ms 72280 KB Output is correct
32 Correct 155 ms 99304 KB Output is correct
33 Correct 212 ms 96396 KB Output is correct
34 Correct 211 ms 96448 KB Output is correct
35 Correct 239 ms 92352 KB Output is correct
36 Correct 221 ms 81916 KB Output is correct
37 Correct 195 ms 74468 KB Output is correct
38 Correct 197 ms 73688 KB Output is correct
39 Correct 190 ms 73372 KB Output is correct
40 Correct 213 ms 72624 KB Output is correct
41 Correct 219 ms 72888 KB Output is correct
42 Correct 206 ms 72896 KB Output is correct
43 Correct 191 ms 88376 KB Output is correct
44 Incorrect 30 ms 59056 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -