oj.uz

Submission #796245

# Submission time Handle Problem Language Result Execution time Memory
796245 2023-07-28T08:19:08 Z 반딧불(#10068) Security Guard (JOI23_guard) C++17
37 / 100
 282 ms 57008 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct unionFind{
    int par[400002];
    ll groupAdd[400002], oneAdd[400002];
    vector<int> vec[400002];

    void init(int n){
        for(int i=1; i<=n; i++){
            par[i] = i;
            groupAdd[i] = oneAdd[i] = 0;
            vec[i].push_back(i);
        }
    }

    int find(int x){
        if(x==par[x]) return x;
        return par[x] = find(par[x]);
    }

    void merge(int x, int y){
        x = find(x), y = find(y);
        assert(x!=y);
        if(vec[x].size() < vec[y].size()) swap(x, y);
        for(int p: vec[y]){
            vec[x].push_back(p);
            oneAdd[p] += groupAdd[y] - groupAdd[x];
        }
        groupAdd[y] = 0;
        par[y] = x;
        vec[y].clear();
    }

    inline ll query(int x){
        return oneAdd[x] + groupAdd[find(x)];
    }

    inline void add(int x, ll y){
        groupAdd[find(x)] += y;
    }
} dsu;

int n, m, q;
ll arr[400002], ex[400002], ey[400002];
vector<int> link[400002];
ll ans;

struct dat{
    int y; ll cost, profit;
    dat(){}
    dat(int y, ll cost, ll profit): y(y), cost(cost), profit(profit){}
    bool operator<(const dat &r)const{
        if(y!=r.y) return arr[y] < arr[r.y];
        if(cost != r.cost) return cost < r.cost;
        return profit > r.profit;
    }
};

bool used[400002];
bool chk[400002];
ll yp[400002], yc[400002];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> q;
    for(int i=1; i<=n; i++){
        cin >> arr[i];
    }
    for(int i=1; i<=m; i++){
        int x, y;
        cin >> x >> y;
        ex[i] = x, ey[i] = y;
        link[x].push_back(y);
        link[y].push_back(x);
    }

    dsu.init(n);

    vector<pair<ll, int> > vec;
    for(int i=1; i<=n; i++) vec.push_back(make_pair(arr[i], i));
    sort(vec.begin(), vec.end());

    for(auto [v, x]: vec){
        vector<dat> reqVec; /// � �������� �������� �󸶳� �ʿ������� ����� ��
        used[x] = 1;
        for(auto y: link[x]){
            if(!used[y]) continue;
            ll w = arr[x] - dsu.query(y);
            reqVec.push_back(dat(y, max(arr[y], w), w > arr[y] ? 0 : arr[y] - w));
        }
        sort(reqVec.begin(), reqVec.end());

        ll allAdd = 0;
        for(dat pr: reqVec){
            int y = pr.y; ll w = pr.cost, p = pr.profit;
            if(chk[dsu.find(y)]){
                assert(-w+p <= -yc[dsu.find(y)]+yp[dsu.find(y)]);
                continue;
            }
            chk[dsu.find(y)] = 1, yp[dsu.find(y)] = p, yc[dsu.find(y)] = w;
            ans += w;
            if(w > arr[y]) dsu.add(y, w-arr[y]); /// y �ʿ� �̵��� �ִ�
            else{
                ll tmp = p;
                allAdd += tmp;
                dsu.add(y, -tmp);
            }
        }
        for(auto [y, w, p]: reqVec){
            if(!chk[dsu.find(y)]) continue;
            chk[dsu.find(y)] = 0;
        }
        for(auto [y, w, p]: reqVec){
            if(dsu.find(x) == dsu.find(y)) continue;
            dsu.merge(x, y);
        }
        dsu.add(x, allAdd);
    }

    cout << ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 89 ms 45376 KB Output is correct
3 Correct 89 ms 45368 KB Output is correct
4 Correct 108 ms 48892 KB Output is correct
5 Correct 114 ms 48880 KB Output is correct
6 Correct 103 ms 48812 KB Output is correct
7 Correct 110 ms 48872 KB Output is correct
8 Correct 10 ms 19116 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 89 ms 45376 KB Output is correct
3 Correct 89 ms 45368 KB Output is correct
4 Correct 108 ms 48892 KB Output is correct
5 Correct 114 ms 48880 KB Output is correct
6 Correct 103 ms 48812 KB Output is correct
7 Correct 110 ms 48872 KB Output is correct
8 Correct 10 ms 19116 KB Output is correct
9 Correct 10 ms 19156 KB Output is correct
10 Correct 204 ms 55072 KB Output is correct
11 Correct 95 ms 45376 KB Output is correct
12 Correct 94 ms 45436 KB Output is correct
13 Correct 90 ms 45620 KB Output is correct
14 Correct 206 ms 54884 KB Output is correct
15 Correct 199 ms 55588 KB Output is correct
16 Correct 208 ms 55152 KB Output is correct
17 Correct 213 ms 55152 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 89 ms 45376 KB Output is correct
3 Correct 89 ms 45368 KB Output is correct
4 Correct 108 ms 48892 KB Output is correct
5 Correct 114 ms 48880 KB Output is correct
6 Correct 103 ms 48812 KB Output is correct
7 Correct 110 ms 48872 KB Output is correct
8 Correct 10 ms 19116 KB Output is correct
9 Correct 10 ms 19156 KB Output is correct
10 Correct 204 ms 55072 KB Output is correct
11 Correct 95 ms 45376 KB Output is correct
12 Correct 94 ms 45436 KB Output is correct
13 Correct 90 ms 45620 KB Output is correct
14 Correct 206 ms 54884 KB Output is correct
15 Correct 199 ms 55588 KB Output is correct
16 Correct 208 ms 55152 KB Output is correct
17 Correct 213 ms 55152 KB Output is correct
18 Correct 10 ms 19156 KB Output is correct
19 Correct 243 ms 54712 KB Output is correct
20 Correct 282 ms 54360 KB Output is correct
21 Correct 239 ms 52648 KB Output is correct
22 Correct 222 ms 50756 KB Output is correct
23 Correct 215 ms 51860 KB Output is correct
24 Correct 209 ms 50768 KB Output is correct
25 Correct 212 ms 50948 KB Output is correct
26 Correct 217 ms 53164 KB Output is correct
27 Correct 217 ms 55052 KB Output is correct
28 Correct 266 ms 54488 KB Output is correct
29 Correct 262 ms 53240 KB Output is correct
30 Correct 230 ms 50780 KB Output is correct
31 Correct 177 ms 55124 KB Output is correct
32 Correct 224 ms 49172 KB Output is correct
33 Correct 239 ms 57008 KB Output is correct
34 Correct 198 ms 51384 KB Output is correct
35 Correct 178 ms 50908 KB Output is correct
36 Correct 144 ms 49780 KB Output is correct
37 Correct 147 ms 49736 KB Output is correct
38 Correct 189 ms 53612 KB Output is correct
39 Correct 181 ms 46560 KB Output is correct
40 Correct 212 ms 53428 KB Output is correct
41 Correct 219 ms 45432 KB Output is correct
42 Correct 216 ms 45432 KB Output is correct
43 Correct 199 ms 50016 KB Output is correct
44 Correct 237 ms 50020 KB Output is correct
45 Correct 199 ms 50416 KB Output is correct
46 Correct 212 ms 49944 KB Output is correct
47 Correct 267 ms 50332 KB Output is correct
48 Correct 240 ms 50348 KB Output is correct
49 Correct 222 ms 45668 KB Output is correct
50 Correct 255 ms 54572 KB Output is correct
51 Correct 189 ms 50604 KB Output is correct
52 Correct 166 ms 49980 KB Output is correct

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 89 ms 45376 KB Output is correct
3 Correct 89 ms 45368 KB Output is correct
4 Correct 108 ms 48892 KB Output is correct
5 Correct 114 ms 48880 KB Output is correct
6 Correct 103 ms 48812 KB Output is correct
7 Correct 110 ms 48872 KB Output is correct
8 Correct 10 ms 19116 KB Output is correct
9 Correct 10 ms 19156 KB Output is correct
10 Correct 204 ms 55072 KB Output is correct
11 Correct 95 ms 45376 KB Output is correct
12 Correct 94 ms 45436 KB Output is correct
13 Correct 90 ms 45620 KB Output is correct
14 Correct 206 ms 54884 KB Output is correct
15 Correct 199 ms 55588 KB Output is correct
16 Correct 208 ms 55152 KB Output is correct
17 Correct 213 ms 55152 KB Output is correct
18 Correct 10 ms 19156 KB Output is correct
19 Correct 243 ms 54712 KB Output is correct
20 Correct 282 ms 54360 KB Output is correct
21 Correct 239 ms 52648 KB Output is correct
22 Correct 222 ms 50756 KB Output is correct
23 Correct 215 ms 51860 KB Output is correct
24 Correct 209 ms 50768 KB Output is correct
25 Correct 212 ms 50948 KB Output is correct
26 Correct 217 ms 53164 KB Output is correct
27 Correct 217 ms 55052 KB Output is correct
28 Correct 266 ms 54488 KB Output is correct
29 Correct 262 ms 53240 KB Output is correct
30 Correct 230 ms 50780 KB Output is correct
31 Correct 177 ms 55124 KB Output is correct
32 Correct 224 ms 49172 KB Output is correct
33 Correct 239 ms 57008 KB Output is correct
34 Correct 198 ms 51384 KB Output is correct
35 Correct 178 ms 50908 KB Output is correct
36 Correct 144 ms 49780 KB Output is correct
37 Correct 147 ms 49736 KB Output is correct
38 Correct 189 ms 53612 KB Output is correct
39 Correct 181 ms 46560 KB Output is correct
40 Correct 212 ms 53428 KB Output is correct
41 Correct 219 ms 45432 KB Output is correct
42 Correct 216 ms 45432 KB Output is correct
43 Correct 199 ms 50016 KB Output is correct
44 Correct 237 ms 50020 KB Output is correct
45 Correct 199 ms 50416 KB Output is correct
46 Correct 212 ms 49944 KB Output is correct
47 Correct 267 ms 50332 KB Output is correct
48 Correct 240 ms 50348 KB Output is correct
49 Correct 222 ms 45668 KB Output is correct
50 Correct 255 ms 54572 KB Output is correct
51 Correct 189 ms 50604 KB Output is correct
52 Correct 166 ms 49980 KB Output is correct
53 Correct 10 ms 19176 KB Output is correct
54 Incorrect 229 ms 53868 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Incorrect 11 ms 19120 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Incorrect 11 ms 19120 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19156 KB Output is correct
2 Correct 89 ms 45376 KB Output is correct
3 Correct 89 ms 45368 KB Output is correct
4 Correct 108 ms 48892 KB Output is correct
5 Correct 114 ms 48880 KB Output is correct
6 Correct 103 ms 48812 KB Output is correct
7 Correct 110 ms 48872 KB Output is correct
8 Correct 10 ms 19116 KB Output is correct
9 Correct 10 ms 19156 KB Output is correct
10 Correct 204 ms 55072 KB Output is correct
11 Correct 95 ms 45376 KB Output is correct
12 Correct 94 ms 45436 KB Output is correct
13 Correct 90 ms 45620 KB Output is correct
14 Correct 206 ms 54884 KB Output is correct
15 Correct 199 ms 55588 KB Output is correct
16 Correct 208 ms 55152 KB Output is correct
17 Correct 213 ms 55152 KB Output is correct
18 Correct 10 ms 19156 KB Output is correct
19 Correct 243 ms 54712 KB Output is correct
20 Correct 282 ms 54360 KB Output is correct
21 Correct 239 ms 52648 KB Output is correct
22 Correct 222 ms 50756 KB Output is correct
23 Correct 215 ms 51860 KB Output is correct
24 Correct 209 ms 50768 KB Output is correct
25 Correct 212 ms 50948 KB Output is correct
26 Correct 217 ms 53164 KB Output is correct
27 Correct 217 ms 55052 KB Output is correct
28 Correct 266 ms 54488 KB Output is correct
29 Correct 262 ms 53240 KB Output is correct
30 Correct 230 ms 50780 KB Output is correct
31 Correct 177 ms 55124 KB Output is correct
32 Correct 224 ms 49172 KB Output is correct
33 Correct 239 ms 57008 KB Output is correct
34 Correct 198 ms 51384 KB Output is correct
35 Correct 178 ms 50908 KB Output is correct
36 Correct 144 ms 49780 KB Output is correct
37 Correct 147 ms 49736 KB Output is correct
38 Correct 189 ms 53612 KB Output is correct
39 Correct 181 ms 46560 KB Output is correct
40 Correct 212 ms 53428 KB Output is correct
41 Correct 219 ms 45432 KB Output is correct
42 Correct 216 ms 45432 KB Output is correct
43 Correct 199 ms 50016 KB Output is correct
44 Correct 237 ms 50020 KB Output is correct
45 Correct 199 ms 50416 KB Output is correct
46 Correct 212 ms 49944 KB Output is correct
47 Correct 267 ms 50332 KB Output is correct
48 Correct 240 ms 50348 KB Output is correct
49 Correct 222 ms 45668 KB Output is correct
50 Correct 255 ms 54572 KB Output is correct
51 Correct 189 ms 50604 KB Output is correct
52 Correct 166 ms 49980 KB Output is correct
53 Correct 10 ms 19176 KB Output is correct
54 Incorrect 229 ms 53868 KB Output isn't correct
55 Halted 0 ms 0 KB -