oj.uz

Submission #796239

# Submission time Handle Problem Language Result Execution time Memory
796239 2023-07-28T08:17:03 Z 반딧불(#10068) Security Guard (JOI23_guard) C++17
37 / 100
 311 ms 56916 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;

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(cost != r.cost) return cost < r.cost;
        return profit > r.profit;
    }
};

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

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 9 ms 19156 KB Output is correct
2 Correct 98 ms 45396 KB Output is correct
3 Correct 90 ms 45432 KB Output is correct
4 Correct 104 ms 48852 KB Output is correct
5 Correct 113 ms 48900 KB Output is correct
6 Correct 102 ms 48892 KB Output is correct
7 Correct 112 ms 48848 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 98 ms 45396 KB Output is correct
3 Correct 90 ms 45432 KB Output is correct
4 Correct 104 ms 48852 KB Output is correct
5 Correct 113 ms 48900 KB Output is correct
6 Correct 102 ms 48892 KB Output is correct
7 Correct 112 ms 48848 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 9 ms 19156 KB Output is correct
10 Correct 222 ms 55036 KB Output is correct
11 Correct 112 ms 45432 KB Output is correct
12 Correct 91 ms 45416 KB Output is correct
13 Correct 89 ms 45648 KB Output is correct
14 Correct 223 ms 54760 KB Output is correct
15 Correct 230 ms 55620 KB Output is correct
16 Correct 220 ms 55184 KB Output is correct
17 Correct 214 ms 55028 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 98 ms 45396 KB Output is correct
3 Correct 90 ms 45432 KB Output is correct
4 Correct 104 ms 48852 KB Output is correct
5 Correct 113 ms 48900 KB Output is correct
6 Correct 102 ms 48892 KB Output is correct
7 Correct 112 ms 48848 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 9 ms 19156 KB Output is correct
10 Correct 222 ms 55036 KB Output is correct
11 Correct 112 ms 45432 KB Output is correct
12 Correct 91 ms 45416 KB Output is correct
13 Correct 89 ms 45648 KB Output is correct
14 Correct 223 ms 54760 KB Output is correct
15 Correct 230 ms 55620 KB Output is correct
16 Correct 220 ms 55184 KB Output is correct
17 Correct 214 ms 55028 KB Output is correct
18 Correct 13 ms 19204 KB Output is correct
19 Correct 311 ms 54728 KB Output is correct
20 Correct 302 ms 54260 KB Output is correct
21 Correct 279 ms 52548 KB Output is correct
22 Correct 267 ms 50752 KB Output is correct
23 Correct 229 ms 51680 KB Output is correct
24 Correct 225 ms 50748 KB Output is correct
25 Correct 239 ms 50964 KB Output is correct
26 Correct 215 ms 53244 KB Output is correct
27 Correct 202 ms 55032 KB Output is correct
28 Correct 265 ms 54460 KB Output is correct
29 Correct 254 ms 53216 KB Output is correct
30 Correct 205 ms 50860 KB Output is correct
31 Correct 200 ms 55120 KB Output is correct
32 Correct 254 ms 49192 KB Output is correct
33 Correct 251 ms 56916 KB Output is correct
34 Correct 230 ms 51260 KB Output is correct
35 Correct 227 ms 50872 KB Output is correct
36 Correct 198 ms 49748 KB Output is correct
37 Correct 163 ms 49796 KB Output is correct
38 Correct 214 ms 53612 KB Output is correct
39 Correct 228 ms 46452 KB Output is correct
40 Correct 226 ms 53320 KB Output is correct
41 Correct 240 ms 45412 KB Output is correct
42 Correct 248 ms 45388 KB Output is correct
43 Correct 240 ms 49952 KB Output is correct
44 Correct 251 ms 49832 KB Output is correct
45 Correct 220 ms 50312 KB Output is correct
46 Correct 209 ms 49820 KB Output is correct
47 Correct 267 ms 50256 KB Output is correct
48 Correct 251 ms 50176 KB Output is correct
49 Correct 225 ms 45612 KB Output is correct
50 Correct 249 ms 53792 KB Output is correct
51 Correct 200 ms 50612 KB Output is correct
52 Correct 182 ms 50008 KB Output is correct

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 98 ms 45396 KB Output is correct
3 Correct 90 ms 45432 KB Output is correct
4 Correct 104 ms 48852 KB Output is correct
5 Correct 113 ms 48900 KB Output is correct
6 Correct 102 ms 48892 KB Output is correct
7 Correct 112 ms 48848 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 9 ms 19156 KB Output is correct
10 Correct 222 ms 55036 KB Output is correct
11 Correct 112 ms 45432 KB Output is correct
12 Correct 91 ms 45416 KB Output is correct
13 Correct 89 ms 45648 KB Output is correct
14 Correct 223 ms 54760 KB Output is correct
15 Correct 230 ms 55620 KB Output is correct
16 Correct 220 ms 55184 KB Output is correct
17 Correct 214 ms 55028 KB Output is correct
18 Correct 13 ms 19204 KB Output is correct
19 Correct 311 ms 54728 KB Output is correct
20 Correct 302 ms 54260 KB Output is correct
21 Correct 279 ms 52548 KB Output is correct
22 Correct 267 ms 50752 KB Output is correct
23 Correct 229 ms 51680 KB Output is correct
24 Correct 225 ms 50748 KB Output is correct
25 Correct 239 ms 50964 KB Output is correct
26 Correct 215 ms 53244 KB Output is correct
27 Correct 202 ms 55032 KB Output is correct
28 Correct 265 ms 54460 KB Output is correct
29 Correct 254 ms 53216 KB Output is correct
30 Correct 205 ms 50860 KB Output is correct
31 Correct 200 ms 55120 KB Output is correct
32 Correct 254 ms 49192 KB Output is correct
33 Correct 251 ms 56916 KB Output is correct
34 Correct 230 ms 51260 KB Output is correct
35 Correct 227 ms 50872 KB Output is correct
36 Correct 198 ms 49748 KB Output is correct
37 Correct 163 ms 49796 KB Output is correct
38 Correct 214 ms 53612 KB Output is correct
39 Correct 228 ms 46452 KB Output is correct
40 Correct 226 ms 53320 KB Output is correct
41 Correct 240 ms 45412 KB Output is correct
42 Correct 248 ms 45388 KB Output is correct
43 Correct 240 ms 49952 KB Output is correct
44 Correct 251 ms 49832 KB Output is correct
45 Correct 220 ms 50312 KB Output is correct
46 Correct 209 ms 49820 KB Output is correct
47 Correct 267 ms 50256 KB Output is correct
48 Correct 251 ms 50176 KB Output is correct
49 Correct 225 ms 45612 KB Output is correct
50 Correct 249 ms 53792 KB Output is correct
51 Correct 200 ms 50612 KB Output is correct
52 Correct 182 ms 50008 KB Output is correct
53 Correct 9 ms 19156 KB Output is correct
54 Incorrect 286 ms 53744 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 12 ms 19156 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 12 ms 19156 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 98 ms 45396 KB Output is correct
3 Correct 90 ms 45432 KB Output is correct
4 Correct 104 ms 48852 KB Output is correct
5 Correct 113 ms 48900 KB Output is correct
6 Correct 102 ms 48892 KB Output is correct
7 Correct 112 ms 48848 KB Output is correct
8 Correct 9 ms 19156 KB Output is correct
9 Correct 9 ms 19156 KB Output is correct
10 Correct 222 ms 55036 KB Output is correct
11 Correct 112 ms 45432 KB Output is correct
12 Correct 91 ms 45416 KB Output is correct
13 Correct 89 ms 45648 KB Output is correct
14 Correct 223 ms 54760 KB Output is correct
15 Correct 230 ms 55620 KB Output is correct
16 Correct 220 ms 55184 KB Output is correct
17 Correct 214 ms 55028 KB Output is correct
18 Correct 13 ms 19204 KB Output is correct
19 Correct 311 ms 54728 KB Output is correct
20 Correct 302 ms 54260 KB Output is correct
21 Correct 279 ms 52548 KB Output is correct
22 Correct 267 ms 50752 KB Output is correct
23 Correct 229 ms 51680 KB Output is correct
24 Correct 225 ms 50748 KB Output is correct
25 Correct 239 ms 50964 KB Output is correct
26 Correct 215 ms 53244 KB Output is correct
27 Correct 202 ms 55032 KB Output is correct
28 Correct 265 ms 54460 KB Output is correct
29 Correct 254 ms 53216 KB Output is correct
30 Correct 205 ms 50860 KB Output is correct
31 Correct 200 ms 55120 KB Output is correct
32 Correct 254 ms 49192 KB Output is correct
33 Correct 251 ms 56916 KB Output is correct
34 Correct 230 ms 51260 KB Output is correct
35 Correct 227 ms 50872 KB Output is correct
36 Correct 198 ms 49748 KB Output is correct
37 Correct 163 ms 49796 KB Output is correct
38 Correct 214 ms 53612 KB Output is correct
39 Correct 228 ms 46452 KB Output is correct
40 Correct 226 ms 53320 KB Output is correct
41 Correct 240 ms 45412 KB Output is correct
42 Correct 248 ms 45388 KB Output is correct
43 Correct 240 ms 49952 KB Output is correct
44 Correct 251 ms 49832 KB Output is correct
45 Correct 220 ms 50312 KB Output is correct
46 Correct 209 ms 49820 KB Output is correct
47 Correct 267 ms 50256 KB Output is correct
48 Correct 251 ms 50176 KB Output is correct
49 Correct 225 ms 45612 KB Output is correct
50 Correct 249 ms 53792 KB Output is correct
51 Correct 200 ms 50612 KB Output is correct
52 Correct 182 ms 50008 KB Output is correct
53 Correct 9 ms 19156 KB Output is correct
54 Incorrect 286 ms 53744 KB Output isn't correct
55 Halted 0 ms 0 KB -