oj.uz

답안 #1042084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042084 2024-08-02T14:17:29 Z RecursiveCo 자매 도시 (APIO20_swap) C++17
6 / 100
 158 ms 33044 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

//#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

vector<int> parent;
vector<vector<int>> comps;
vector<int> deg;
vector<int> maxdeg;
vector<int> edges;
vector<bool> marked;
vector<int> nonline;
vector<vector<pair<int, int>>> merges;

int find(int v) {
    if (v == parent[v]) return v;
    return parent[v] = find(parent[v]);
}

void unite(int u, int v, int val) {
    int a = find(u);
    int b = find(v);
    deg[u]++;
    deg[v]++;
    if (a == b) {
        maxdeg[a] = max({maxdeg[a], deg[u], deg[v]});
        edges[a]++;
        if (!marked[a] && (maxdeg[a] >= 3 || edges[a] == comps[a].size())) {
            marked[a] = true;
            for (int node: comps[a]) nonline[node] = min(nonline[node], val);
        }
    } else {
        if (comps[a].size() > comps[b].size()) swap(a, b);
        if (marked[a] && !marked[b]) for (int node: comps[b]) nonline[node] = min(nonline[node], val);
        while (!comps[a].empty()) {
            int node = comps[a].back();
            comps[a].pop_back();
            comps[b].push_back(node);
            merges[node].push_back({val, b});
            maxdeg[b] = max(maxdeg[b], deg[node]);
            if (marked[b] && !marked[a]) nonline[node] = min(nonline[node], val);
        }
        if (!marked[a] && !marked[b] && (maxdeg[b] >= 3 || edges[b] == comps[b].size())) {
            marked[b] = true;
            for (int node: comps[b]) nonline[node] = min(nonline[node], val);
        }
        parent[a] = b;
        edges[b] += edges[a] + 1;
    }
}

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    forto(N, i) {
        parent.push_back(i);

        vector<int> here1;
        here1.push_back(i);
        comps.push_back(here1);

        deg.push_back(0);

        maxdeg.push_back(0);

        edges.push_back(0);

        marked.push_back(false);

        nonline.push_back(1e9 + 5);

        vector<pair<int, int>> here2;
        merges.push_back(here2);
    }

    vector<array<int, 3>> sorted;
    forto(M, i) sorted.push_back({W[i], U[i], V[i]});
    sortl(sorted);
    forto(M, i) {
        int w = sorted[i][0];
        int u = sorted[i][1];
        int v = sorted[i][2];
        unite(u, v, w);
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    int one = nonline[X];
    if (one == 1e9 + 5) return -1;
    vector<array<int, 3>> events;
    for (pair<int, int> event: merges[X]) events.push_back({event.first, event.second, 0});
    for (pair<int, int> event: merges[Y]) events.push_back({event.first, event.second, 1});
    sortl(events);
    int parX = X;
    int parY = Y;
    int two;
    for (array<int, 3> event: events) {
        if (event[2] == 0) parX = event[1];
        else parY = event[1];
        if (parX == parY) {
            two = event[0];
            break;
        }
    }
    return max(one, two);
}

Compilation message

swap.cpp: In function 'void unite(int, int, int)':
swap.cpp:93:55: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         if (!marked[a] && (maxdeg[a] >= 3 || edges[a] == comps[a].size())) {
swap.cpp:108:69: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         if (!marked[a] && !marked[b] && (maxdeg[b] >= 3 || edges[b] == comps[b].size())) {
swap.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
swap.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
swap.cpp:118:5: note: in expansion of macro 'forto'
  118 |     forto(N, i) {
      |     ^~~~~
swap.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
swap.cpp:140:5: note: in expansion of macro 'forto'
  140 |     forto(M, i) sorted.push_back({W[i], U[i], V[i]});
      |     ^~~~~
swap.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
swap.cpp:142:5: note: in expansion of macro 'forto'
  142 |     forto(M, i) {
      |     ^~~~~
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:159:9: warning: 'two' may be used uninitialized in this function [-Wmaybe-uninitialized]
  159 |     int two;
      |         ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 59 ms 22552 KB Output is correct
10 Correct 74 ms 26660 KB Output is correct
11 Correct 75 ms 26288 KB Output is correct
12 Correct 77 ms 28336 KB Output is correct
13 Correct 46 ms 19892 KB Output is correct
14 Correct 60 ms 22708 KB Output is correct
15 Correct 103 ms 30720 KB Output is correct
16 Correct 98 ms 29872 KB Output is correct
17 Correct 108 ms 31272 KB Output is correct
18 Correct 84 ms 23468 KB Output is correct
19 Correct 67 ms 9420 KB Output is correct
20 Correct 150 ms 31652 KB Output is correct
21 Correct 148 ms 31344 KB Output is correct
22 Correct 158 ms 33044 KB Output is correct
23 Correct 98 ms 25108 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Incorrect 69 ms 21428 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Incorrect 1 ms 604 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 59 ms 22552 KB Output is correct
11 Correct 74 ms 26660 KB Output is correct
12 Correct 75 ms 26288 KB Output is correct
13 Correct 77 ms 28336 KB Output is correct
14 Correct 46 ms 19892 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Incorrect 1 ms 604 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 59 ms 22552 KB Output is correct
10 Correct 74 ms 26660 KB Output is correct
11 Correct 75 ms 26288 KB Output is correct
12 Correct 77 ms 28336 KB Output is correct
13 Correct 46 ms 19892 KB Output is correct
14 Correct 60 ms 22708 KB Output is correct
15 Correct 103 ms 30720 KB Output is correct
16 Correct 98 ms 29872 KB Output is correct
17 Correct 108 ms 31272 KB Output is correct
18 Correct 84 ms 23468 KB Output is correct
19 Incorrect 69 ms 21428 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 59 ms 22552 KB Output is correct
11 Correct 74 ms 26660 KB Output is correct
12 Correct 75 ms 26288 KB Output is correct
13 Correct 77 ms 28336 KB Output is correct
14 Correct 46 ms 19892 KB Output is correct
15 Correct 60 ms 22708 KB Output is correct
16 Correct 103 ms 30720 KB Output is correct
17 Correct 98 ms 29872 KB Output is correct
18 Correct 108 ms 31272 KB Output is correct
19 Correct 84 ms 23468 KB Output is correct
20 Incorrect 69 ms 21428 KB Output isn't correct
21 Halted 0 ms 0 KB -