oj.uz

답안 #796149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796149 2023-07-28T07:07:24 Z 반딧불(#10068) Security Guard (JOI23_guard) C++17
37 / 100
 281 ms 44356 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[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;

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];

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<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(auto [y, w, p]: 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 = 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);
    }

    printf("%lld", ans);
}

Compilation message

guard.cpp: In function 'int main()':
guard.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%d %d %d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
guard.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         scanf("%lld", &arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~
guard.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         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 5 ms 9684 KB Output is correct
2 Correct 94 ms 35908 KB Output is correct
3 Correct 94 ms 35856 KB Output is correct
4 Correct 107 ms 36240 KB Output is correct
5 Correct 104 ms 36240 KB Output is correct
6 Correct 105 ms 36244 KB Output is correct
7 Correct 107 ms 36224 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 94 ms 35908 KB Output is correct
3 Correct 94 ms 35856 KB Output is correct
4 Correct 107 ms 36240 KB Output is correct
5 Correct 104 ms 36240 KB Output is correct
6 Correct 105 ms 36244 KB Output is correct
7 Correct 107 ms 36224 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9748 KB Output is correct
10 Correct 204 ms 42664 KB Output is correct
11 Correct 99 ms 35872 KB Output is correct
12 Correct 98 ms 35872 KB Output is correct
13 Correct 97 ms 36016 KB Output is correct
14 Correct 190 ms 42100 KB Output is correct
15 Correct 199 ms 43076 KB Output is correct
16 Correct 190 ms 42600 KB Output is correct
17 Correct 189 ms 42504 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 94 ms 35908 KB Output is correct
3 Correct 94 ms 35856 KB Output is correct
4 Correct 107 ms 36240 KB Output is correct
5 Correct 104 ms 36240 KB Output is correct
6 Correct 105 ms 36244 KB Output is correct
7 Correct 107 ms 36224 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9748 KB Output is correct
10 Correct 204 ms 42664 KB Output is correct
11 Correct 99 ms 35872 KB Output is correct
12 Correct 98 ms 35872 KB Output is correct
13 Correct 97 ms 36016 KB Output is correct
14 Correct 190 ms 42100 KB Output is correct
15 Correct 199 ms 43076 KB Output is correct
16 Correct 190 ms 42600 KB Output is correct
17 Correct 189 ms 42504 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 241 ms 42144 KB Output is correct
20 Correct 237 ms 41688 KB Output is correct
21 Correct 227 ms 39968 KB Output is correct
22 Correct 220 ms 38084 KB Output is correct
23 Correct 193 ms 39080 KB Output is correct
24 Correct 179 ms 38072 KB Output is correct
25 Correct 192 ms 38328 KB Output is correct
26 Correct 170 ms 40644 KB Output is correct
27 Correct 156 ms 42568 KB Output is correct
28 Correct 220 ms 41856 KB Output is correct
29 Correct 228 ms 40572 KB Output is correct
30 Correct 201 ms 38188 KB Output is correct
31 Correct 173 ms 42556 KB Output is correct
32 Correct 207 ms 36568 KB Output is correct
33 Correct 204 ms 44356 KB Output is correct
34 Correct 183 ms 38712 KB Output is correct
35 Correct 168 ms 38340 KB Output is correct
36 Correct 140 ms 37184 KB Output is correct
37 Correct 149 ms 37156 KB Output is correct
38 Correct 190 ms 41016 KB Output is correct
39 Correct 210 ms 36400 KB Output is correct
40 Correct 183 ms 40792 KB Output is correct
41 Correct 215 ms 35880 KB Output is correct
42 Correct 217 ms 35888 KB Output is correct
43 Correct 184 ms 37260 KB Output is correct
44 Correct 229 ms 37256 KB Output is correct
45 Correct 210 ms 37760 KB Output is correct
46 Correct 248 ms 37268 KB Output is correct
47 Correct 205 ms 37636 KB Output is correct
48 Correct 281 ms 37576 KB Output is correct
49 Correct 229 ms 36184 KB Output is correct
50 Correct 236 ms 41168 KB Output is correct
51 Correct 222 ms 37952 KB Output is correct
52 Correct 210 ms 37428 KB Output is correct

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 94 ms 35908 KB Output is correct
3 Correct 94 ms 35856 KB Output is correct
4 Correct 107 ms 36240 KB Output is correct
5 Correct 104 ms 36240 KB Output is correct
6 Correct 105 ms 36244 KB Output is correct
7 Correct 107 ms 36224 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9748 KB Output is correct
10 Correct 204 ms 42664 KB Output is correct
11 Correct 99 ms 35872 KB Output is correct
12 Correct 98 ms 35872 KB Output is correct
13 Correct 97 ms 36016 KB Output is correct
14 Correct 190 ms 42100 KB Output is correct
15 Correct 199 ms 43076 KB Output is correct
16 Correct 190 ms 42600 KB Output is correct
17 Correct 189 ms 42504 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 241 ms 42144 KB Output is correct
20 Correct 237 ms 41688 KB Output is correct
21 Correct 227 ms 39968 KB Output is correct
22 Correct 220 ms 38084 KB Output is correct
23 Correct 193 ms 39080 KB Output is correct
24 Correct 179 ms 38072 KB Output is correct
25 Correct 192 ms 38328 KB Output is correct
26 Correct 170 ms 40644 KB Output is correct
27 Correct 156 ms 42568 KB Output is correct
28 Correct 220 ms 41856 KB Output is correct
29 Correct 228 ms 40572 KB Output is correct
30 Correct 201 ms 38188 KB Output is correct
31 Correct 173 ms 42556 KB Output is correct
32 Correct 207 ms 36568 KB Output is correct
33 Correct 204 ms 44356 KB Output is correct
34 Correct 183 ms 38712 KB Output is correct
35 Correct 168 ms 38340 KB Output is correct
36 Correct 140 ms 37184 KB Output is correct
37 Correct 149 ms 37156 KB Output is correct
38 Correct 190 ms 41016 KB Output is correct
39 Correct 210 ms 36400 KB Output is correct
40 Correct 183 ms 40792 KB Output is correct
41 Correct 215 ms 35880 KB Output is correct
42 Correct 217 ms 35888 KB Output is correct
43 Correct 184 ms 37260 KB Output is correct
44 Correct 229 ms 37256 KB Output is correct
45 Correct 210 ms 37760 KB Output is correct
46 Correct 248 ms 37268 KB Output is correct
47 Correct 205 ms 37636 KB Output is correct
48 Correct 281 ms 37576 KB Output is correct
49 Correct 229 ms 36184 KB Output is correct
50 Correct 236 ms 41168 KB Output is correct
51 Correct 222 ms 37952 KB Output is correct
52 Correct 210 ms 37428 KB Output is correct
53 Correct 6 ms 9684 KB Output is correct
54 Incorrect 259 ms 41140 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 5 ms 9684 KB Output is correct
2 Correct 94 ms 35908 KB Output is correct
3 Correct 94 ms 35856 KB Output is correct
4 Correct 107 ms 36240 KB Output is correct
5 Correct 104 ms 36240 KB Output is correct
6 Correct 105 ms 36244 KB Output is correct
7 Correct 107 ms 36224 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9748 KB Output is correct
10 Correct 204 ms 42664 KB Output is correct
11 Correct 99 ms 35872 KB Output is correct
12 Correct 98 ms 35872 KB Output is correct
13 Correct 97 ms 36016 KB Output is correct
14 Correct 190 ms 42100 KB Output is correct
15 Correct 199 ms 43076 KB Output is correct
16 Correct 190 ms 42600 KB Output is correct
17 Correct 189 ms 42504 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 241 ms 42144 KB Output is correct
20 Correct 237 ms 41688 KB Output is correct
21 Correct 227 ms 39968 KB Output is correct
22 Correct 220 ms 38084 KB Output is correct
23 Correct 193 ms 39080 KB Output is correct
24 Correct 179 ms 38072 KB Output is correct
25 Correct 192 ms 38328 KB Output is correct
26 Correct 170 ms 40644 KB Output is correct
27 Correct 156 ms 42568 KB Output is correct
28 Correct 220 ms 41856 KB Output is correct
29 Correct 228 ms 40572 KB Output is correct
30 Correct 201 ms 38188 KB Output is correct
31 Correct 173 ms 42556 KB Output is correct
32 Correct 207 ms 36568 KB Output is correct
33 Correct 204 ms 44356 KB Output is correct
34 Correct 183 ms 38712 KB Output is correct
35 Correct 168 ms 38340 KB Output is correct
36 Correct 140 ms 37184 KB Output is correct
37 Correct 149 ms 37156 KB Output is correct
38 Correct 190 ms 41016 KB Output is correct
39 Correct 210 ms 36400 KB Output is correct
40 Correct 183 ms 40792 KB Output is correct
41 Correct 215 ms 35880 KB Output is correct
42 Correct 217 ms 35888 KB Output is correct
43 Correct 184 ms 37260 KB Output is correct
44 Correct 229 ms 37256 KB Output is correct
45 Correct 210 ms 37760 KB Output is correct
46 Correct 248 ms 37268 KB Output is correct
47 Correct 205 ms 37636 KB Output is correct
48 Correct 281 ms 37576 KB Output is correct
49 Correct 229 ms 36184 KB Output is correct
50 Correct 236 ms 41168 KB Output is correct
51 Correct 222 ms 37952 KB Output is correct
52 Correct 210 ms 37428 KB Output is correct
53 Correct 6 ms 9684 KB Output is correct
54 Incorrect 259 ms 41140 KB Output isn't correct
55 Halted 0 ms 0 KB -