oj.uz

답안 #796126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796126 2023-07-28T06:45:21 Z 반딧불(#10068) Security Guard (JOI23_guard) C++17
37 / 100
 285 ms 55000 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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

    void init(int n){
        for(int i=1; i<=n; i++){
            par[i] = i;
            groupAdd[200002] = oneAdd[200002] = 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);
        if(x==y) return;
        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[200002], ex[400002], ey[400002];
vector<int> link[200002];
ll ans;

bool used[200002];
bool chk[200002];

int main(){
    scanf("%d %d %d", &n, &m, &q);
    for(int i=1; i<=n; i++){
        scanf("%lld", &arr[i]);
    }
    for(int i=1; i<=m; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        ex[i] = x, ey[i] = y;
        link[x].push_back(y);
        link[y].push_back(x);
    }

    dsu.init(n);

    vector<pair<int, ll> > 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<pair<int, ll> > reqVec; /// � �������� �������� �󸶳� �ʿ������� ����� ��
        used[x] = 1;
        for(auto y: link[x]){
            if(!used[y]) continue;
            reqVec.push_back(make_pair(max(arr[y], arr[x] - dsu.query(y)), y));
        }
        sort(reqVec.begin(), reqVec.end());

        ll allAdd = 0;
        for(auto [w, y]: reqVec){
            if(chk[dsu.find(y)]) continue;
            chk[dsu.find(y)] = 1;
            ans += w;
            if(w > arr[y]) dsu.add(y, w-arr[y]); /// y �ʿ� �̵��� �ִ�
            else{
                ll tmp = arr[y] + dsu.query(y) - arr[x];
                allAdd += tmp;
                dsu.add(y, -tmp);
            }
        }
        for(auto [w, y]: reqVec) dsu.merge(x, y), chk[dsu.find(y)] = 0;
        dsu.add(x, allAdd);
    }

    printf("%lld", ans);
}

Compilation message

guard.cpp: In function 'int main()':
guard.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     scanf("%d %d %d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
guard.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%lld", &arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~
guard.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
guard.cpp:15:45: warning: array subscript 200002 is above array bounds of 'll [200002]' {aka 'long long int [200002]'} [-Warray-bounds]
   15 |             groupAdd[200002] = oneAdd[200002] = 0;
      |                                ~~~~~~~~~~~~~^
guard.cpp:9:26: note: while referencing 'unionFind::oneAdd'
    9 |     ll groupAdd[200002], oneAdd[200002];
      |                          ^~~~~~
guard.cpp:45:3: note: defined here 'dsu'
   45 | } dsu;
      |   ^~~
guard.cpp:15:28: warning: array subscript 200002 is above array bounds of 'll [200002]' {aka 'long long int [200002]'} [-Warray-bounds]
   15 |             groupAdd[200002] = oneAdd[200002] = 0;
      |             ~~~~~~~~~~~~~~~^
guard.cpp:9:8: note: while referencing 'unionFind::groupAdd'
    9 |     ll groupAdd[200002], oneAdd[200002];
      |        ^~~~~~~~
guard.cpp:45:3: note: defined here 'dsu'
   45 | } dsu;
      |   ^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 95 ms 37776 KB Output is correct
3 Correct 93 ms 37736 KB Output is correct
4 Correct 106 ms 38656 KB Output is correct
5 Correct 106 ms 38564 KB Output is correct
6 Correct 106 ms 38660 KB Output is correct
7 Correct 108 ms 38604 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 95 ms 37776 KB Output is correct
3 Correct 93 ms 37736 KB Output is correct
4 Correct 106 ms 38656 KB Output is correct
5 Correct 106 ms 38564 KB Output is correct
6 Correct 106 ms 38660 KB Output is correct
7 Correct 108 ms 38604 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 216 ms 50616 KB Output is correct
11 Correct 100 ms 37756 KB Output is correct
12 Correct 96 ms 37696 KB Output is correct
13 Correct 100 ms 37848 KB Output is correct
14 Correct 196 ms 50124 KB Output is correct
15 Correct 207 ms 51868 KB Output is correct
16 Correct 202 ms 51132 KB Output is correct
17 Correct 209 ms 50760 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 95 ms 37776 KB Output is correct
3 Correct 93 ms 37736 KB Output is correct
4 Correct 106 ms 38656 KB Output is correct
5 Correct 106 ms 38564 KB Output is correct
6 Correct 106 ms 38660 KB Output is correct
7 Correct 108 ms 38604 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 216 ms 50616 KB Output is correct
11 Correct 100 ms 37756 KB Output is correct
12 Correct 96 ms 37696 KB Output is correct
13 Correct 100 ms 37848 KB Output is correct
14 Correct 196 ms 50124 KB Output is correct
15 Correct 207 ms 51868 KB Output is correct
16 Correct 202 ms 51132 KB Output is correct
17 Correct 209 ms 50760 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 253 ms 49856 KB Output is correct
20 Correct 235 ms 49108 KB Output is correct
21 Correct 229 ms 45844 KB Output is correct
22 Correct 233 ms 42032 KB Output is correct
23 Correct 202 ms 43076 KB Output is correct
24 Correct 187 ms 40484 KB Output is correct
25 Correct 200 ms 39680 KB Output is correct
26 Correct 161 ms 40904 KB Output is correct
27 Correct 147 ms 41340 KB Output is correct
28 Correct 233 ms 49252 KB Output is correct
29 Correct 216 ms 46612 KB Output is correct
30 Correct 187 ms 40744 KB Output is correct
31 Correct 146 ms 41372 KB Output is correct
32 Correct 223 ms 38580 KB Output is correct
33 Correct 232 ms 55000 KB Output is correct
34 Correct 200 ms 42860 KB Output is correct
35 Correct 170 ms 41180 KB Output is correct
36 Correct 149 ms 39040 KB Output is correct
37 Correct 152 ms 38964 KB Output is correct
38 Correct 186 ms 46136 KB Output is correct
39 Correct 170 ms 38216 KB Output is correct
40 Correct 203 ms 44796 KB Output is correct
41 Correct 231 ms 37752 KB Output is correct
42 Correct 215 ms 37724 KB Output is correct
43 Correct 227 ms 40328 KB Output is correct
44 Correct 222 ms 40360 KB Output is correct
45 Correct 207 ms 41316 KB Output is correct
46 Correct 271 ms 40264 KB Output is correct
47 Correct 263 ms 41008 KB Output is correct
48 Correct 226 ms 41000 KB Output is correct
49 Correct 224 ms 38008 KB Output is correct
50 Correct 247 ms 48408 KB Output is correct
51 Correct 232 ms 41748 KB Output is correct
52 Correct 223 ms 40400 KB Output is correct

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 95 ms 37776 KB Output is correct
3 Correct 93 ms 37736 KB Output is correct
4 Correct 106 ms 38656 KB Output is correct
5 Correct 106 ms 38564 KB Output is correct
6 Correct 106 ms 38660 KB Output is correct
7 Correct 108 ms 38604 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 216 ms 50616 KB Output is correct
11 Correct 100 ms 37756 KB Output is correct
12 Correct 96 ms 37696 KB Output is correct
13 Correct 100 ms 37848 KB Output is correct
14 Correct 196 ms 50124 KB Output is correct
15 Correct 207 ms 51868 KB Output is correct
16 Correct 202 ms 51132 KB Output is correct
17 Correct 209 ms 50760 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 253 ms 49856 KB Output is correct
20 Correct 235 ms 49108 KB Output is correct
21 Correct 229 ms 45844 KB Output is correct
22 Correct 233 ms 42032 KB Output is correct
23 Correct 202 ms 43076 KB Output is correct
24 Correct 187 ms 40484 KB Output is correct
25 Correct 200 ms 39680 KB Output is correct
26 Correct 161 ms 40904 KB Output is correct
27 Correct 147 ms 41340 KB Output is correct
28 Correct 233 ms 49252 KB Output is correct
29 Correct 216 ms 46612 KB Output is correct
30 Correct 187 ms 40744 KB Output is correct
31 Correct 146 ms 41372 KB Output is correct
32 Correct 223 ms 38580 KB Output is correct
33 Correct 232 ms 55000 KB Output is correct
34 Correct 200 ms 42860 KB Output is correct
35 Correct 170 ms 41180 KB Output is correct
36 Correct 149 ms 39040 KB Output is correct
37 Correct 152 ms 38964 KB Output is correct
38 Correct 186 ms 46136 KB Output is correct
39 Correct 170 ms 38216 KB Output is correct
40 Correct 203 ms 44796 KB Output is correct
41 Correct 231 ms 37752 KB Output is correct
42 Correct 215 ms 37724 KB Output is correct
43 Correct 227 ms 40328 KB Output is correct
44 Correct 222 ms 40360 KB Output is correct
45 Correct 207 ms 41316 KB Output is correct
46 Correct 271 ms 40264 KB Output is correct
47 Correct 263 ms 41008 KB Output is correct
48 Correct 226 ms 41000 KB Output is correct
49 Correct 224 ms 38008 KB Output is correct
50 Correct 247 ms 48408 KB Output is correct
51 Correct 232 ms 41748 KB Output is correct
52 Correct 223 ms 40400 KB Output is correct
53 Correct 6 ms 9684 KB Output is correct
54 Incorrect 285 ms 47964 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 95 ms 37776 KB Output is correct
3 Correct 93 ms 37736 KB Output is correct
4 Correct 106 ms 38656 KB Output is correct
5 Correct 106 ms 38564 KB Output is correct
6 Correct 106 ms 38660 KB Output is correct
7 Correct 108 ms 38604 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 216 ms 50616 KB Output is correct
11 Correct 100 ms 37756 KB Output is correct
12 Correct 96 ms 37696 KB Output is correct
13 Correct 100 ms 37848 KB Output is correct
14 Correct 196 ms 50124 KB Output is correct
15 Correct 207 ms 51868 KB Output is correct
16 Correct 202 ms 51132 KB Output is correct
17 Correct 209 ms 50760 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 253 ms 49856 KB Output is correct
20 Correct 235 ms 49108 KB Output is correct
21 Correct 229 ms 45844 KB Output is correct
22 Correct 233 ms 42032 KB Output is correct
23 Correct 202 ms 43076 KB Output is correct
24 Correct 187 ms 40484 KB Output is correct
25 Correct 200 ms 39680 KB Output is correct
26 Correct 161 ms 40904 KB Output is correct
27 Correct 147 ms 41340 KB Output is correct
28 Correct 233 ms 49252 KB Output is correct
29 Correct 216 ms 46612 KB Output is correct
30 Correct 187 ms 40744 KB Output is correct
31 Correct 146 ms 41372 KB Output is correct
32 Correct 223 ms 38580 KB Output is correct
33 Correct 232 ms 55000 KB Output is correct
34 Correct 200 ms 42860 KB Output is correct
35 Correct 170 ms 41180 KB Output is correct
36 Correct 149 ms 39040 KB Output is correct
37 Correct 152 ms 38964 KB Output is correct
38 Correct 186 ms 46136 KB Output is correct
39 Correct 170 ms 38216 KB Output is correct
40 Correct 203 ms 44796 KB Output is correct
41 Correct 231 ms 37752 KB Output is correct
42 Correct 215 ms 37724 KB Output is correct
43 Correct 227 ms 40328 KB Output is correct
44 Correct 222 ms 40360 KB Output is correct
45 Correct 207 ms 41316 KB Output is correct
46 Correct 271 ms 40264 KB Output is correct
47 Correct 263 ms 41008 KB Output is correct
48 Correct 226 ms 41000 KB Output is correct
49 Correct 224 ms 38008 KB Output is correct
50 Correct 247 ms 48408 KB Output is correct
51 Correct 232 ms 41748 KB Output is correct
52 Correct 223 ms 40400 KB Output is correct
53 Correct 6 ms 9684 KB Output is correct
54 Incorrect 285 ms 47964 KB Output isn't correct
55 Halted 0 ms 0 KB -