oj.uz

답안 #1081233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081233 2024-08-29T20:02:14 Z ArthuroWich 봉쇄 시간 (IOI23_closing) C++17
52 / 100
 240 ms 52564 KB 
#include "closing.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long int
vector<pair<int, int>> adj[200005];
int32_t solve1234(int32_t n, int32_t X, int32_t Y, int k) {
    int ans = 0;
    vector<int> vis(n, 0), distx(n, -1), disty(n, -1);
    set<tuple<int, int, int>> pq; // let 0 be x, 1 be y
    distx[X] = 0;
    disty[Y] = 0;
    pq.insert({0, X, 0});
    pq.insert({0, Y, 1});
    while(!pq.empty()) {
        auto [d, a, ind] = *pq.begin();
        pq.erase(*pq.begin());
        if (vis[a] == 0 && distx[a] != -1 && disty[a] != -1) {
            if (ind == 0) {
                if (pq.count({disty[a], a, 1})) {
                    pq.erase({disty[a], a, 1});
                    pq.insert({disty[a]-distx[a], a, 1});
                }
            } else {
                if (pq.count({distx[a], a, 0})) {
                    pq.erase({distx[a], a, 0});
                    pq.insert({distx[a]-disty[a], a, 0});
                }
            }
        }
        vis[a] = d;
        if (k < d) {
            break;
        } else {
            k -= d;
            ans++;
        }
        if (ind == 0) {
            for (auto [b, w] : adj[a]) {
                if (distx[b] != -1) {
                    continue;
                }
                distx[b] = distx[a]+w;
                if (vis[b] >= distx[b]) {
                    pq.insert({0, b, 0});
                } else {
                    pq.insert({(distx[b]-vis[b]), b, 0});
                }
            }
        } else {
            for (auto [b, w] : adj[a]) {
                if (disty[b] != -1) {
                    continue;
                }
                disty[b] = disty[a]+w;
                if (vis[b] >= disty[b]) {
                    pq.insert({0, b, 1});
                } else {
                    pq.insert({(disty[b]-vis[b]), b, 1});
                }
            }
        }
    }
    return ans;
}
int32_t max_score(int32_t n, int32_t X, int32_t Y, int k, vector<int32_t> U, vector<int32_t> V, vector<int32_t> W) {
    int ans = 0, temp = 0;
    vector<int> vis(n, 0), distx(n, -1), disty(n, -1), csing(n, 0), cmult(n, 0);
    for (int i = 0; i < n; i++) {
        adj[i].clear();
    }
    for (int i = 0; i < n-1; i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    //temp = solve1234(n, X, Y, k); // subtask 1, 2, 3, 4, it works
    set<pair<int, int>> pq, pqex, pqf; // for normal, for disgusting cases, for last check 
    distx[X] = 0;
    disty[Y] = 0;
    queue<int> q;
    q.push(X);
    while(!q.empty()) {
        int a = q.front();
        q.pop();
        for (auto [b, w] : adj[a]) {
            if (distx[b] == -1) {
                distx[b] = distx[a]+w;
                q.push(b);
            }
        }
    }
    q.push(Y);
    while(!q.empty()) {
        int a = q.front();
        q.pop();
        for (auto [b, w] : adj[a]) {
            if (disty[b] == -1) {
                disty[b] = disty[a]+w;
                q.push(b);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        csing[i] = min(distx[i], disty[i]); // x take or y take
        pq.insert({csing[i], i});
        cmult[i] = max(distx[i], disty[i])-csing[i]; // both take
    }
    int test = k;
    while(!pq.empty()) {
        auto [a, i1] = *pq.begin();
        pq.erase(pq.begin());
        if (a <= test) {
            test -= a;
            temp++;
        } else {
            break;
        }
    }
    // best is to take all on path except not but that is checked by my 1st attempt
    for (int i = 0; i < n; i++) {
        if (distx[i]+disty[i] == distx[Y]) {
            k -= csing[i];
            ans++;
            pq.insert({cmult[i], i});
        }
    }
    if (k <= 0) {
        return temp;
    }
    for (int i = 0; i < n; i++) {
        if (distx[i]+disty[i] == distx[Y]) {
            continue;
        }
        if (csing[i] > cmult[i]) {
            pqex.insert({csing[i]+cmult[i], i});
            pqf.insert({csing[i], i});
        } else {
            pq.insert({csing[i], i});
            pq.insert({cmult[i], i});
        }
    }
    while(pq.size() > 1 && !pqex.empty()) {
        auto [c, i3] = *pqex.begin();
        pqex.erase(pqex.begin());
        auto [a, i1] = *pq.begin();
        pq.erase(pq.begin());
        auto [b, i2] = *pq.begin();
        pq.erase(pq.begin());
        if (c > k) {
            pq.insert({a, i1});
            pq.insert({b, i2});
            pqex.insert({c, i3});
            break;
        }
        if (a+b < c) {
            k -= a;
            ans++;
            pq.insert({b, i2});
            pqex.insert({c, i3});
        } else {
            k -= c;
            vis[i3] = 1;
            ans += 2;
            pq.insert({a, i1});
            pq.insert({b, i2});
        }
    }
    while(!pqex.empty()) {
        auto [a, i1] = *pqex.begin();
        pqex.erase(pqex.begin());
        if (a > k) {
            break;
        } else {
            k -= a;
            vis[i1] = 1;
            ans += 2;
        }
    }
    while(!pq.empty()) {
        auto [a, i1] = *pq.begin();
        pq.erase(pq.begin());
        if (a > k) {
            break;
        } else {
            k -= a;
            ans++;
        }
    }
    while(!pqf.empty()) {
        auto [a, i1] = *pqf.begin();
        pqf.erase(pqf.begin());
        if (vis[i1]) {
            continue;
        }
        if (a > k) {
            break;
        } else {
            k -= a;
            ans++;
        }
    }
    return max(temp, ans);
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 47696 KB Output is correct
2 Correct 240 ms 52564 KB Output is correct
3 Correct 83 ms 10104 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 5384 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 5384 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 5140 KB Output is correct
19 Correct 2 ms 5212 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5080 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 2 ms 5384 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 5140 KB Output is correct
19 Correct 2 ms 5212 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5080 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 4 ms 5208 KB Output is correct
26 Correct 4 ms 5896 KB Output is correct
27 Correct 4 ms 5980 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 5 ms 5516 KB Output is correct
30 Correct 4 ms 5468 KB Output is correct
31 Correct 4 ms 5660 KB Output is correct
32 Correct 4 ms 5660 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 5384 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 4 ms 5136 KB Output is correct
12 Correct 2 ms 5140 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4952 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 5136 KB Output is correct
17 Correct 3 ms 5212 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 5384 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4952 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 4 ms 5136 KB Output is correct
24 Correct 2 ms 5140 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4952 KB Output is correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 2 ms 5136 KB Output is correct
29 Correct 3 ms 5212 KB Output is correct
30 Correct 2 ms 4956 KB Output is correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Correct 2 ms 4956 KB Output is correct
34 Correct 2 ms 4956 KB Output is correct
35 Correct 3 ms 4956 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 3 ms 4956 KB Output is correct
38 Incorrect 3 ms 5140 KB 1st lines differ - on the 1st token, expected: '41', found: '40'
39 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 5384 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4952 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 5140 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 3 ms 5100 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 3 ms 5080 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 2 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 4 ms 5136 KB Output is correct
31 Correct 2 ms 5140 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Correct 2 ms 4952 KB Output is correct
34 Correct 2 ms 4956 KB Output is correct
35 Correct 2 ms 5136 KB Output is correct
36 Correct 3 ms 5212 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 2 ms 4956 KB Output is correct
39 Correct 2 ms 4956 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 3 ms 4956 KB Output is correct
43 Correct 2 ms 4956 KB Output is correct
44 Correct 3 ms 4956 KB Output is correct
45 Incorrect 3 ms 5140 KB 1st lines differ - on the 1st token, expected: '41', found: '40'
46 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 5384 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4952 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 5140 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 3 ms 5100 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 3 ms 5080 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 4 ms 5208 KB Output is correct
27 Correct 4 ms 5896 KB Output is correct
28 Correct 4 ms 5980 KB Output is correct
29 Correct 4 ms 5468 KB Output is correct
30 Correct 5 ms 5516 KB Output is correct
31 Correct 4 ms 5468 KB Output is correct
32 Correct 4 ms 5660 KB Output is correct
33 Correct 4 ms 5660 KB Output is correct
34 Correct 2 ms 4956 KB Output is correct
35 Correct 2 ms 4956 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 4 ms 5136 KB Output is correct
39 Correct 2 ms 5140 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4952 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 2 ms 5136 KB Output is correct
44 Correct 3 ms 5212 KB Output is correct
45 Correct 2 ms 4956 KB Output is correct
46 Correct 2 ms 4956 KB Output is correct
47 Correct 2 ms 4956 KB Output is correct
48 Correct 2 ms 4956 KB Output is correct
49 Correct 2 ms 4956 KB Output is correct
50 Correct 3 ms 4956 KB Output is correct
51 Correct 2 ms 4956 KB Output is correct
52 Correct 3 ms 4956 KB Output is correct
53 Incorrect 3 ms 5140 KB 1st lines differ - on the 1st token, expected: '41', found: '40'
54 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 5384 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 3 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4952 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 5140 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 3 ms 5100 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 3 ms 5080 KB Output is correct
24 Correct 2 ms 5212 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 4 ms 5208 KB Output is correct
27 Correct 4 ms 5896 KB Output is correct
28 Correct 4 ms 5980 KB Output is correct
29 Correct 4 ms 5468 KB Output is correct
30 Correct 5 ms 5516 KB Output is correct
31 Correct 4 ms 5468 KB Output is correct
32 Correct 4 ms 5660 KB Output is correct
33 Correct 4 ms 5660 KB Output is correct
34 Correct 2 ms 4956 KB Output is correct
35 Correct 2 ms 4956 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 4 ms 5136 KB Output is correct
39 Correct 2 ms 5140 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4952 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 2 ms 5136 KB Output is correct
44 Correct 3 ms 5212 KB Output is correct
45 Correct 2 ms 4956 KB Output is correct
46 Correct 2 ms 4956 KB Output is correct
47 Correct 2 ms 4956 KB Output is correct
48 Correct 2 ms 4956 KB Output is correct
49 Correct 2 ms 4956 KB Output is correct
50 Correct 3 ms 4956 KB Output is correct
51 Correct 2 ms 4956 KB Output is correct
52 Correct 3 ms 4956 KB Output is correct
53 Incorrect 3 ms 5140 KB 1st lines differ - on the 1st token, expected: '41', found: '40'
54 Halted 0 ms 0 KB -