oj.uz

Submission #553199

# Submission time Handle Problem Language Result Execution time Memory
553199 2022-04-25T04:32:02 Z Tien_Noob Evacuation plan (IZhO18_plan) C++17
100 / 100
 610 ms 55060 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5;
priority_queue< pair<int, int>, deque<pair<int, int> > , greater<pair<int, int> > > PQ;
vector<pair<int, int> > Adj[N + 1];
int n, m, d[N + 1], res[N + 1], lab[N + 1], q;
set<int> dp[N + 1];
vector<int> id = {0};
int cnt[N + 1];
void read()
{
    cin >> n >> m;
    for (int i = 1; i <= m; ++ i)
    {
        int u, v, w;
        cin >> u >> v >> w;
        Adj[u].push_back({v, w});
        Adj[v].push_back({u, w});
    }
    memset(d, 0x3f, sizeof(d));
    memset(lab, -1, sizeof(lab));
    int k;
    cin >> k;
    for (int i = 1; i <= k; ++ i)
    {
        int u;
        cin >> u;
        d[u] = 0;
        PQ.push({0, u});
    }
    cin >> q;
    for (int i = 1; i <= q; ++ i)
    {
        int u, v;
        cin >> u >> v;
        dp[u].insert(i);
        dp[v].insert(i);
    }
}
int FindSet(int u)
{
    return lab[u] < 0 ? u : lab[u] = FindSet(lab[u]);
}
void Unite(int r, int s, int w)
{
    r = FindSet(r);
    s = FindSet(s);
    if (r == s)
    {
        return ;
    }
    if (lab[r] < lab[s])
    {
        swap(r, s);
    }
    lab[r] += lab[s];
    lab[s] = r;
    if (dp[r].size() < dp[s].size())
    {
        swap(dp[r], dp[s]);
    }
    for (int i : dp[s])
    {
        if (dp[r].find(i) != dp[r].end())
        {
            dp[r].erase(i);
            res[i] = w;
        }
        else
        {
            dp[r].insert(i);
        }
    }
}
void Dijkstra()
{
    while(!PQ.empty())
    {
        pair<int, int> p = PQ.top();
        PQ.pop();
        if (d[p.second] != p.first)
        {
            continue;
        }
        id.push_back(p.second);
        int u = p.second;
        for (auto p : Adj[u])
        {
            int v = p.first, w = p.second;
            if (d[v] > d[u] + w)
            {
                d[v] = d[u] + w;
                PQ.push({d[v], v});
            }
        }
    }
}
void solve()
{
    Dijkstra();
    for (int i = n; i >= 1; -- i)
    {
        int u = id[i];
        for (auto p : Adj[u])
        {
            int v = p.first;
            if (d[v] >= d[u])
            {
                Unite(u, v, d[u]);
            }
        }
    }
    for (int i = 1; i <= q; ++ i)
    {
        cout << res[i] << '\n';
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:128:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  128 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 5 ms 8304 KB Output is correct
3 Correct 5 ms 8276 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 6 ms 8276 KB Output is correct
6 Correct 7 ms 8276 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 5 ms 8276 KB Output is correct
10 Correct 5 ms 8276 KB Output is correct
11 Correct 5 ms 8276 KB Output is correct
12 Correct 5 ms 8276 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 5 ms 8276 KB Output is correct
15 Correct 5 ms 8276 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 5 ms 8304 KB Output is correct
3 Correct 5 ms 8276 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 6 ms 8276 KB Output is correct
6 Correct 7 ms 8276 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 5 ms 8276 KB Output is correct
10 Correct 5 ms 8276 KB Output is correct
11 Correct 5 ms 8276 KB Output is correct
12 Correct 5 ms 8276 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 5 ms 8276 KB Output is correct
15 Correct 5 ms 8276 KB Output is correct
16 Correct 208 ms 22736 KB Output is correct
17 Correct 565 ms 43712 KB Output is correct
18 Correct 34 ms 11292 KB Output is correct
19 Correct 198 ms 26528 KB Output is correct
20 Correct 544 ms 43736 KB Output is correct
21 Correct 336 ms 32780 KB Output is correct
22 Correct 133 ms 25336 KB Output is correct
23 Correct 551 ms 43752 KB Output is correct
24 Correct 541 ms 43588 KB Output is correct
25 Correct 561 ms 43692 KB Output is correct
26 Correct 202 ms 26576 KB Output is correct
27 Correct 215 ms 26496 KB Output is correct
28 Correct 203 ms 26176 KB Output is correct
29 Correct 231 ms 26476 KB Output is correct
30 Correct 206 ms 26616 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 4 ms 8148 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 15608 KB Output is correct
2 Correct 338 ms 23676 KB Output is correct
3 Correct 346 ms 23680 KB Output is correct
4 Correct 50 ms 11840 KB Output is correct
5 Correct 335 ms 23696 KB Output is correct
6 Correct 344 ms 23716 KB Output is correct
7 Correct 331 ms 23684 KB Output is correct
8 Correct 346 ms 23744 KB Output is correct
9 Correct 347 ms 23680 KB Output is correct
10 Correct 336 ms 23764 KB Output is correct
11 Correct 337 ms 23668 KB Output is correct
12 Correct 328 ms 23708 KB Output is correct
13 Correct 342 ms 23672 KB Output is correct
14 Correct 338 ms 23744 KB Output is correct
15 Correct 341 ms 23672 KB Output is correct
16 Correct 329 ms 23712 KB Output is correct
17 Correct 358 ms 23680 KB Output is correct
18 Correct 334 ms 23732 KB Output is correct
19 Correct 47 ms 11860 KB Output is correct
20 Correct 353 ms 23776 KB Output is correct
21 Correct 351 ms 23500 KB Output is correct
22 Correct 77 ms 13500 KB Output is correct
23 Correct 66 ms 12380 KB Output is correct
24 Correct 78 ms 13776 KB Output is correct
25 Correct 71 ms 13488 KB Output is correct
26 Correct 74 ms 12360 KB Output is correct
27 Correct 50 ms 11904 KB Output is correct
28 Correct 73 ms 13688 KB Output is correct
29 Correct 49 ms 11844 KB Output is correct
30 Correct 84 ms 13504 KB Output is correct
31 Correct 50 ms 11920 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 5 ms 8304 KB Output is correct
3 Correct 5 ms 8276 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 6 ms 8276 KB Output is correct
6 Correct 7 ms 8276 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 5 ms 8276 KB Output is correct
10 Correct 5 ms 8276 KB Output is correct
11 Correct 5 ms 8276 KB Output is correct
12 Correct 5 ms 8276 KB Output is correct
13 Correct 5 ms 8276 KB Output is correct
14 Correct 5 ms 8276 KB Output is correct
15 Correct 5 ms 8276 KB Output is correct
16 Correct 208 ms 22736 KB Output is correct
17 Correct 565 ms 43712 KB Output is correct
18 Correct 34 ms 11292 KB Output is correct
19 Correct 198 ms 26528 KB Output is correct
20 Correct 544 ms 43736 KB Output is correct
21 Correct 336 ms 32780 KB Output is correct
22 Correct 133 ms 25336 KB Output is correct
23 Correct 551 ms 43752 KB Output is correct
24 Correct 541 ms 43588 KB Output is correct
25 Correct 561 ms 43692 KB Output is correct
26 Correct 202 ms 26576 KB Output is correct
27 Correct 215 ms 26496 KB Output is correct
28 Correct 203 ms 26176 KB Output is correct
29 Correct 231 ms 26476 KB Output is correct
30 Correct 206 ms 26616 KB Output is correct
31 Correct 4 ms 8148 KB Output is correct
32 Correct 4 ms 8148 KB Output is correct
33 Correct 4 ms 8148 KB Output is correct
34 Correct 4 ms 8148 KB Output is correct
35 Correct 4 ms 8148 KB Output is correct
36 Correct 4 ms 8148 KB Output is correct
37 Correct 4 ms 8148 KB Output is correct
38 Correct 5 ms 8148 KB Output is correct
39 Correct 4 ms 8148 KB Output is correct
40 Correct 4 ms 8148 KB Output is correct
41 Correct 163 ms 15608 KB Output is correct
42 Correct 338 ms 23676 KB Output is correct
43 Correct 346 ms 23680 KB Output is correct
44 Correct 50 ms 11840 KB Output is correct
45 Correct 335 ms 23696 KB Output is correct
46 Correct 344 ms 23716 KB Output is correct
47 Correct 331 ms 23684 KB Output is correct
48 Correct 346 ms 23744 KB Output is correct
49 Correct 347 ms 23680 KB Output is correct
50 Correct 336 ms 23764 KB Output is correct
51 Correct 337 ms 23668 KB Output is correct
52 Correct 328 ms 23708 KB Output is correct
53 Correct 342 ms 23672 KB Output is correct
54 Correct 338 ms 23744 KB Output is correct
55 Correct 341 ms 23672 KB Output is correct
56 Correct 329 ms 23712 KB Output is correct
57 Correct 358 ms 23680 KB Output is correct
58 Correct 334 ms 23732 KB Output is correct
59 Correct 47 ms 11860 KB Output is correct
60 Correct 353 ms 23776 KB Output is correct
61 Correct 351 ms 23500 KB Output is correct
62 Correct 77 ms 13500 KB Output is correct
63 Correct 66 ms 12380 KB Output is correct
64 Correct 78 ms 13776 KB Output is correct
65 Correct 71 ms 13488 KB Output is correct
66 Correct 74 ms 12360 KB Output is correct
67 Correct 50 ms 11904 KB Output is correct
68 Correct 73 ms 13688 KB Output is correct
69 Correct 49 ms 11844 KB Output is correct
70 Correct 84 ms 13504 KB Output is correct
71 Correct 50 ms 11920 KB Output is correct
72 Correct 355 ms 35012 KB Output is correct
73 Correct 578 ms 44520 KB Output is correct
74 Correct 578 ms 44484 KB Output is correct
75 Correct 610 ms 44488 KB Output is correct
76 Correct 572 ms 44412 KB Output is correct
77 Correct 579 ms 44552 KB Output is correct
78 Correct 573 ms 44520 KB Output is correct
79 Correct 567 ms 44548 KB Output is correct
80 Correct 585 ms 44452 KB Output is correct
81 Correct 578 ms 44464 KB Output is correct
82 Correct 590 ms 44600 KB Output is correct
83 Correct 591 ms 44492 KB Output is correct
84 Correct 567 ms 44356 KB Output is correct
85 Correct 568 ms 44484 KB Output is correct
86 Correct 569 ms 44556 KB Output is correct
87 Correct 577 ms 44456 KB Output is correct
88 Correct 607 ms 44456 KB Output is correct
89 Correct 228 ms 27548 KB Output is correct
90 Correct 582 ms 44504 KB Output is correct
91 Correct 543 ms 45344 KB Output is correct
92 Correct 266 ms 27804 KB Output is correct
93 Correct 345 ms 51520 KB Output is correct
94 Correct 269 ms 27708 KB Output is correct
95 Correct 257 ms 27780 KB Output is correct
96 Correct 366 ms 55060 KB Output is correct
97 Correct 259 ms 29472 KB Output is correct
98 Correct 250 ms 27588 KB Output is correct
99 Correct 259 ms 29576 KB Output is correct
100 Correct 254 ms 27772 KB Output is correct