oj.uz

Submission #796218

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

using namespace std;

typedef long long ll;

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

    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[200002], ex[400002], ey[400002];
vector<int> link[200002];
ll ans;

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

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 5 ms 9736 KB Output is correct
2 Correct 88 ms 35924 KB Output is correct
3 Correct 99 ms 35960 KB Output is correct
4 Correct 98 ms 39372 KB Output is correct
5 Correct 102 ms 39452 KB Output is correct
6 Correct 113 ms 39376 KB Output is correct
7 Correct 118 ms 39364 KB Output is correct
8 Correct 5 ms 9696 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9736 KB Output is correct
2 Correct 88 ms 35924 KB Output is correct
3 Correct 99 ms 35960 KB Output is correct
4 Correct 98 ms 39372 KB Output is correct
5 Correct 102 ms 39452 KB Output is correct
6 Correct 113 ms 39376 KB Output is correct
7 Correct 118 ms 39364 KB Output is correct
8 Correct 5 ms 9696 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 204 ms 45640 KB Output is correct
11 Correct 93 ms 35916 KB Output is correct
12 Correct 102 ms 35952 KB Output is correct
13 Correct 109 ms 36260 KB Output is correct
14 Correct 197 ms 45344 KB Output is correct
15 Correct 215 ms 46212 KB Output is correct
16 Correct 212 ms 45792 KB Output is correct
17 Correct 195 ms 45608 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9736 KB Output is correct
2 Correct 88 ms 35924 KB Output is correct
3 Correct 99 ms 35960 KB Output is correct
4 Correct 98 ms 39372 KB Output is correct
5 Correct 102 ms 39452 KB Output is correct
6 Correct 113 ms 39376 KB Output is correct
7 Correct 118 ms 39364 KB Output is correct
8 Correct 5 ms 9696 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 204 ms 45640 KB Output is correct
11 Correct 93 ms 35916 KB Output is correct
12 Correct 102 ms 35952 KB Output is correct
13 Correct 109 ms 36260 KB Output is correct
14 Correct 197 ms 45344 KB Output is correct
15 Correct 215 ms 46212 KB Output is correct
16 Correct 212 ms 45792 KB Output is correct
17 Correct 195 ms 45608 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 296 ms 45336 KB Output is correct
20 Correct 272 ms 44836 KB Output is correct
21 Correct 260 ms 43160 KB Output is correct
22 Correct 246 ms 41416 KB Output is correct
23 Correct 201 ms 42256 KB Output is correct
24 Correct 185 ms 41288 KB Output is correct
25 Correct 216 ms 41512 KB Output is correct
26 Correct 203 ms 43772 KB Output is correct
27 Correct 165 ms 45604 KB Output is correct
28 Correct 233 ms 44928 KB Output is correct
29 Correct 217 ms 43820 KB Output is correct
30 Correct 234 ms 41408 KB Output is correct
31 Correct 162 ms 45608 KB Output is correct
32 Correct 246 ms 39880 KB Output is correct
33 Correct 207 ms 47564 KB Output is correct
34 Correct 205 ms 41908 KB Output is correct
35 Correct 213 ms 41448 KB Output is correct
36 Correct 162 ms 40320 KB Output is correct
37 Correct 145 ms 40300 KB Output is correct
38 Correct 183 ms 44200 KB Output is correct
39 Correct 251 ms 37024 KB Output is correct
40 Correct 194 ms 43912 KB Output is correct
41 Correct 208 ms 36024 KB Output is correct
42 Correct 221 ms 35988 KB Output is correct
43 Correct 260 ms 40528 KB Output is correct
44 Correct 246 ms 40420 KB Output is correct
45 Correct 203 ms 40880 KB Output is correct
46 Correct 242 ms 40496 KB Output is correct
47 Correct 249 ms 40896 KB Output is correct
48 Correct 271 ms 40768 KB Output is correct
49 Correct 253 ms 36152 KB Output is correct
50 Correct 280 ms 44348 KB Output is correct
51 Correct 189 ms 41104 KB Output is correct
52 Correct 181 ms 40512 KB Output is correct

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9736 KB Output is correct
2 Correct 88 ms 35924 KB Output is correct
3 Correct 99 ms 35960 KB Output is correct
4 Correct 98 ms 39372 KB Output is correct
5 Correct 102 ms 39452 KB Output is correct
6 Correct 113 ms 39376 KB Output is correct
7 Correct 118 ms 39364 KB Output is correct
8 Correct 5 ms 9696 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 204 ms 45640 KB Output is correct
11 Correct 93 ms 35916 KB Output is correct
12 Correct 102 ms 35952 KB Output is correct
13 Correct 109 ms 36260 KB Output is correct
14 Correct 197 ms 45344 KB Output is correct
15 Correct 215 ms 46212 KB Output is correct
16 Correct 212 ms 45792 KB Output is correct
17 Correct 195 ms 45608 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 296 ms 45336 KB Output is correct
20 Correct 272 ms 44836 KB Output is correct
21 Correct 260 ms 43160 KB Output is correct
22 Correct 246 ms 41416 KB Output is correct
23 Correct 201 ms 42256 KB Output is correct
24 Correct 185 ms 41288 KB Output is correct
25 Correct 216 ms 41512 KB Output is correct
26 Correct 203 ms 43772 KB Output is correct
27 Correct 165 ms 45604 KB Output is correct
28 Correct 233 ms 44928 KB Output is correct
29 Correct 217 ms 43820 KB Output is correct
30 Correct 234 ms 41408 KB Output is correct
31 Correct 162 ms 45608 KB Output is correct
32 Correct 246 ms 39880 KB Output is correct
33 Correct 207 ms 47564 KB Output is correct
34 Correct 205 ms 41908 KB Output is correct
35 Correct 213 ms 41448 KB Output is correct
36 Correct 162 ms 40320 KB Output is correct
37 Correct 145 ms 40300 KB Output is correct
38 Correct 183 ms 44200 KB Output is correct
39 Correct 251 ms 37024 KB Output is correct
40 Correct 194 ms 43912 KB Output is correct
41 Correct 208 ms 36024 KB Output is correct
42 Correct 221 ms 35988 KB Output is correct
43 Correct 260 ms 40528 KB Output is correct
44 Correct 246 ms 40420 KB Output is correct
45 Correct 203 ms 40880 KB Output is correct
46 Correct 242 ms 40496 KB Output is correct
47 Correct 249 ms 40896 KB Output is correct
48 Correct 271 ms 40768 KB Output is correct
49 Correct 253 ms 36152 KB Output is correct
50 Correct 280 ms 44348 KB Output is correct
51 Correct 189 ms 41104 KB Output is correct
52 Correct 181 ms 40512 KB Output is correct
53 Correct 4 ms 9684 KB Output is correct
54 Incorrect 328 ms 44344 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Incorrect 5 ms 9684 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Incorrect 5 ms 9684 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9736 KB Output is correct
2 Correct 88 ms 35924 KB Output is correct
3 Correct 99 ms 35960 KB Output is correct
4 Correct 98 ms 39372 KB Output is correct
5 Correct 102 ms 39452 KB Output is correct
6 Correct 113 ms 39376 KB Output is correct
7 Correct 118 ms 39364 KB Output is correct
8 Correct 5 ms 9696 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 204 ms 45640 KB Output is correct
11 Correct 93 ms 35916 KB Output is correct
12 Correct 102 ms 35952 KB Output is correct
13 Correct 109 ms 36260 KB Output is correct
14 Correct 197 ms 45344 KB Output is correct
15 Correct 215 ms 46212 KB Output is correct
16 Correct 212 ms 45792 KB Output is correct
17 Correct 195 ms 45608 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 296 ms 45336 KB Output is correct
20 Correct 272 ms 44836 KB Output is correct
21 Correct 260 ms 43160 KB Output is correct
22 Correct 246 ms 41416 KB Output is correct
23 Correct 201 ms 42256 KB Output is correct
24 Correct 185 ms 41288 KB Output is correct
25 Correct 216 ms 41512 KB Output is correct
26 Correct 203 ms 43772 KB Output is correct
27 Correct 165 ms 45604 KB Output is correct
28 Correct 233 ms 44928 KB Output is correct
29 Correct 217 ms 43820 KB Output is correct
30 Correct 234 ms 41408 KB Output is correct
31 Correct 162 ms 45608 KB Output is correct
32 Correct 246 ms 39880 KB Output is correct
33 Correct 207 ms 47564 KB Output is correct
34 Correct 205 ms 41908 KB Output is correct
35 Correct 213 ms 41448 KB Output is correct
36 Correct 162 ms 40320 KB Output is correct
37 Correct 145 ms 40300 KB Output is correct
38 Correct 183 ms 44200 KB Output is correct
39 Correct 251 ms 37024 KB Output is correct
40 Correct 194 ms 43912 KB Output is correct
41 Correct 208 ms 36024 KB Output is correct
42 Correct 221 ms 35988 KB Output is correct
43 Correct 260 ms 40528 KB Output is correct
44 Correct 246 ms 40420 KB Output is correct
45 Correct 203 ms 40880 KB Output is correct
46 Correct 242 ms 40496 KB Output is correct
47 Correct 249 ms 40896 KB Output is correct
48 Correct 271 ms 40768 KB Output is correct
49 Correct 253 ms 36152 KB Output is correct
50 Correct 280 ms 44348 KB Output is correct
51 Correct 189 ms 41104 KB Output is correct
52 Correct 181 ms 40512 KB Output is correct
53 Correct 4 ms 9684 KB Output is correct
54 Incorrect 328 ms 44344 KB Output isn't correct
55 Halted 0 ms 0 KB -