oj.uz

Submission #796207

# Submission time Handle Problem Language Result Execution time Memory
796207 2023-07-28T07:54:23 Z 반딧불(#10068) Security Guard (JOI23_guard) C++17
37 / 100
 265 ms 47548 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;
            dsu.merge(x, y);
        }
        dsu.add(x, allAdd);
    }

    cout << ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 84 ms 35960 KB Output is correct
3 Correct 84 ms 35896 KB Output is correct
4 Correct 95 ms 39484 KB Output is correct
5 Correct 97 ms 39476 KB Output is correct
6 Correct 95 ms 39348 KB Output is correct
7 Correct 99 ms 39452 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 84 ms 35960 KB Output is correct
3 Correct 84 ms 35896 KB Output is correct
4 Correct 95 ms 39484 KB Output is correct
5 Correct 97 ms 39476 KB Output is correct
6 Correct 95 ms 39348 KB Output is correct
7 Correct 99 ms 39452 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 195 ms 45580 KB Output is correct
11 Correct 113 ms 35920 KB Output is correct
12 Correct 87 ms 35988 KB Output is correct
13 Correct 89 ms 36280 KB Output is correct
14 Correct 202 ms 45292 KB Output is correct
15 Correct 194 ms 46224 KB Output is correct
16 Correct 212 ms 45760 KB Output is correct
17 Correct 205 ms 45596 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 84 ms 35960 KB Output is correct
3 Correct 84 ms 35896 KB Output is correct
4 Correct 95 ms 39484 KB Output is correct
5 Correct 97 ms 39476 KB Output is correct
6 Correct 95 ms 39348 KB Output is correct
7 Correct 99 ms 39452 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 195 ms 45580 KB Output is correct
11 Correct 113 ms 35920 KB Output is correct
12 Correct 87 ms 35988 KB Output is correct
13 Correct 89 ms 36280 KB Output is correct
14 Correct 202 ms 45292 KB Output is correct
15 Correct 194 ms 46224 KB Output is correct
16 Correct 212 ms 45760 KB Output is correct
17 Correct 205 ms 45596 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 226 ms 45268 KB Output is correct
20 Correct 239 ms 44800 KB Output is correct
21 Correct 231 ms 43124 KB Output is correct
22 Correct 234 ms 41272 KB Output is correct
23 Correct 202 ms 42240 KB Output is correct
24 Correct 200 ms 41320 KB Output is correct
25 Correct 200 ms 41556 KB Output is correct
26 Correct 173 ms 43728 KB Output is correct
27 Correct 158 ms 45560 KB Output is correct
28 Correct 221 ms 44924 KB Output is correct
29 Correct 210 ms 43800 KB Output is correct
30 Correct 217 ms 41340 KB Output is correct
31 Correct 156 ms 45680 KB Output is correct
32 Correct 207 ms 39724 KB Output is correct
33 Correct 233 ms 47548 KB Output is correct
34 Correct 191 ms 41944 KB Output is correct
35 Correct 187 ms 41492 KB Output is correct
36 Correct 150 ms 40384 KB Output is correct
37 Correct 147 ms 40332 KB Output is correct
38 Correct 187 ms 44144 KB Output is correct
39 Correct 180 ms 37092 KB Output is correct
40 Correct 192 ms 43896 KB Output is correct
41 Correct 213 ms 35932 KB Output is correct
42 Correct 220 ms 36000 KB Output is correct
43 Correct 192 ms 40456 KB Output is correct
44 Correct 234 ms 40428 KB Output is correct
45 Correct 200 ms 40920 KB Output is correct
46 Correct 214 ms 40460 KB Output is correct
47 Correct 210 ms 40748 KB Output is correct
48 Correct 249 ms 40828 KB Output is correct
49 Correct 216 ms 36132 KB Output is correct
50 Correct 233 ms 44356 KB Output is correct
51 Correct 178 ms 41148 KB Output is correct
52 Correct 193 ms 40488 KB Output is correct

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 84 ms 35960 KB Output is correct
3 Correct 84 ms 35896 KB Output is correct
4 Correct 95 ms 39484 KB Output is correct
5 Correct 97 ms 39476 KB Output is correct
6 Correct 95 ms 39348 KB Output is correct
7 Correct 99 ms 39452 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 195 ms 45580 KB Output is correct
11 Correct 113 ms 35920 KB Output is correct
12 Correct 87 ms 35988 KB Output is correct
13 Correct 89 ms 36280 KB Output is correct
14 Correct 202 ms 45292 KB Output is correct
15 Correct 194 ms 46224 KB Output is correct
16 Correct 212 ms 45760 KB Output is correct
17 Correct 205 ms 45596 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 226 ms 45268 KB Output is correct
20 Correct 239 ms 44800 KB Output is correct
21 Correct 231 ms 43124 KB Output is correct
22 Correct 234 ms 41272 KB Output is correct
23 Correct 202 ms 42240 KB Output is correct
24 Correct 200 ms 41320 KB Output is correct
25 Correct 200 ms 41556 KB Output is correct
26 Correct 173 ms 43728 KB Output is correct
27 Correct 158 ms 45560 KB Output is correct
28 Correct 221 ms 44924 KB Output is correct
29 Correct 210 ms 43800 KB Output is correct
30 Correct 217 ms 41340 KB Output is correct
31 Correct 156 ms 45680 KB Output is correct
32 Correct 207 ms 39724 KB Output is correct
33 Correct 233 ms 47548 KB Output is correct
34 Correct 191 ms 41944 KB Output is correct
35 Correct 187 ms 41492 KB Output is correct
36 Correct 150 ms 40384 KB Output is correct
37 Correct 147 ms 40332 KB Output is correct
38 Correct 187 ms 44144 KB Output is correct
39 Correct 180 ms 37092 KB Output is correct
40 Correct 192 ms 43896 KB Output is correct
41 Correct 213 ms 35932 KB Output is correct
42 Correct 220 ms 36000 KB Output is correct
43 Correct 192 ms 40456 KB Output is correct
44 Correct 234 ms 40428 KB Output is correct
45 Correct 200 ms 40920 KB Output is correct
46 Correct 214 ms 40460 KB Output is correct
47 Correct 210 ms 40748 KB Output is correct
48 Correct 249 ms 40828 KB Output is correct
49 Correct 216 ms 36132 KB Output is correct
50 Correct 233 ms 44356 KB Output is correct
51 Correct 178 ms 41148 KB Output is correct
52 Correct 193 ms 40488 KB Output is correct
53 Correct 4 ms 9684 KB Output is correct
54 Incorrect 265 ms 44340 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 6 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 4 ms 9684 KB Output is correct
2 Correct 84 ms 35960 KB Output is correct
3 Correct 84 ms 35896 KB Output is correct
4 Correct 95 ms 39484 KB Output is correct
5 Correct 97 ms 39476 KB Output is correct
6 Correct 95 ms 39348 KB Output is correct
7 Correct 99 ms 39452 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 195 ms 45580 KB Output is correct
11 Correct 113 ms 35920 KB Output is correct
12 Correct 87 ms 35988 KB Output is correct
13 Correct 89 ms 36280 KB Output is correct
14 Correct 202 ms 45292 KB Output is correct
15 Correct 194 ms 46224 KB Output is correct
16 Correct 212 ms 45760 KB Output is correct
17 Correct 205 ms 45596 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 226 ms 45268 KB Output is correct
20 Correct 239 ms 44800 KB Output is correct
21 Correct 231 ms 43124 KB Output is correct
22 Correct 234 ms 41272 KB Output is correct
23 Correct 202 ms 42240 KB Output is correct
24 Correct 200 ms 41320 KB Output is correct
25 Correct 200 ms 41556 KB Output is correct
26 Correct 173 ms 43728 KB Output is correct
27 Correct 158 ms 45560 KB Output is correct
28 Correct 221 ms 44924 KB Output is correct
29 Correct 210 ms 43800 KB Output is correct
30 Correct 217 ms 41340 KB Output is correct
31 Correct 156 ms 45680 KB Output is correct
32 Correct 207 ms 39724 KB Output is correct
33 Correct 233 ms 47548 KB Output is correct
34 Correct 191 ms 41944 KB Output is correct
35 Correct 187 ms 41492 KB Output is correct
36 Correct 150 ms 40384 KB Output is correct
37 Correct 147 ms 40332 KB Output is correct
38 Correct 187 ms 44144 KB Output is correct
39 Correct 180 ms 37092 KB Output is correct
40 Correct 192 ms 43896 KB Output is correct
41 Correct 213 ms 35932 KB Output is correct
42 Correct 220 ms 36000 KB Output is correct
43 Correct 192 ms 40456 KB Output is correct
44 Correct 234 ms 40428 KB Output is correct
45 Correct 200 ms 40920 KB Output is correct
46 Correct 214 ms 40460 KB Output is correct
47 Correct 210 ms 40748 KB Output is correct
48 Correct 249 ms 40828 KB Output is correct
49 Correct 216 ms 36132 KB Output is correct
50 Correct 233 ms 44356 KB Output is correct
51 Correct 178 ms 41148 KB Output is correct
52 Correct 193 ms 40488 KB Output is correct
53 Correct 4 ms 9684 KB Output is correct
54 Incorrect 265 ms 44340 KB Output isn't correct
55 Halted 0 ms 0 KB -