oj.uz

Submission #407285

# Submission time Handle Problem Language Result Execution time Memory
407285 2021-05-18T17:21:12 Z arayi Evacuation plan (IZhO18_plan) C++17
100 / 100
 712 ms 268332 KB 
//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 0, -1, 0, 1, -1, -1, 1, 1, 0 };
int dy[] = { -1, 0, 1, 0, -1, 1, -1, 1, 0 };


const int N = 5e6 + 30;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const ld e = log2(3);
const int T = 1000;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
template<class T>
void maxi(T& a, T b)
{
    a = max(a, b);
}
template <class T>
void mini(T& a, T b)
{
    a = min(a, b);
}

int n, m, t;
int dp[N], p[N], pat[N], a[N], b[N], sm[N];
bool col[N];
vector<pir> g[N];
vii f[N];
int gp(int x)
{
    if (p[x] == x) return x;
    return p[x] = gp(p[x]);
}
int main()
{
    fastio;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) dp[i] = mod, p[i] = i;
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].ad(MP(b, c));
        g[b].ad(MP(a, c));
    }
    priority_queue<pir> q;
    cin >> t;
    for (itn i = 0; i < t; i++)
    {
        int a;
        cin >> a;
        q.push(MP(0, a));
    }
    vii fp;
    while (!q.empty())
    {
        auto p = q.top();
        q.pop();
        if (dp[p.sc] != mod) continue;
        dp[p.sc] = -p.fr;
        fp.ad(p.sc);
        for (auto& p1 : g[p.sc])
        {
            if (dp[p1.fr] != mod) continue;
            q.push(MP(p.fr - p1.sc, p1.fr));
        }
    }
    reverse(all(fp));
    //for (auto p : fp) cout << p << " " << dp[p] << endl;
    cin >> t;
    for (int i = 0; i < t; i++)
    {
        cin >> a[i] >> b[i];
        f[a[i]].ad(i);
        f[b[i]].ad(i);
        sm[i] = a[i] + b[i];
    }
    for (auto p : fp)
    {
        col[p] = 1;
        for (auto& p1 : g[p])
        {
            if (!col[p1.fr]) continue;
            int l = gp(p), r = gp(p1.fr);
            if (l == r) continue;
            if (f[r].size() > f[l].size()) swap(l, r);
            ::p[r] = l;
            for (auto x : f[r])
            {
                if (sm[x] == -1) continue;
                else if (sm[x] - r == l) pat[x] = dp[p], sm[x] = -1;
                else
                {
                    sm[x] -= r, sm[x] += l;
                    f[l].ad(x);
                }
            }
            f[r].clear();
        }
    }
    for (int i = 0; i < t; i++) cout << pat[i] << "\n";
    return 0;
}



/*

    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \

*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 235160 KB Output is correct
2 Correct 146 ms 235280 KB Output is correct
3 Correct 146 ms 235268 KB Output is correct
4 Correct 146 ms 235112 KB Output is correct
5 Correct 146 ms 235276 KB Output is correct
6 Correct 148 ms 235236 KB Output is correct
7 Correct 143 ms 235096 KB Output is correct
8 Correct 146 ms 235084 KB Output is correct
9 Correct 147 ms 235216 KB Output is correct
10 Correct 149 ms 235268 KB Output is correct
11 Correct 147 ms 235232 KB Output is correct
12 Correct 148 ms 235268 KB Output is correct
13 Correct 145 ms 235332 KB Output is correct
14 Correct 146 ms 235332 KB Output is correct
15 Correct 147 ms 235288 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 235160 KB Output is correct
2 Correct 146 ms 235280 KB Output is correct
3 Correct 146 ms 235268 KB Output is correct
4 Correct 146 ms 235112 KB Output is correct
5 Correct 146 ms 235276 KB Output is correct
6 Correct 148 ms 235236 KB Output is correct
7 Correct 143 ms 235096 KB Output is correct
8 Correct 146 ms 235084 KB Output is correct
9 Correct 147 ms 235216 KB Output is correct
10 Correct 149 ms 235268 KB Output is correct
11 Correct 147 ms 235232 KB Output is correct
12 Correct 148 ms 235268 KB Output is correct
13 Correct 145 ms 235332 KB Output is correct
14 Correct 146 ms 235332 KB Output is correct
15 Correct 147 ms 235288 KB Output is correct
16 Correct 301 ms 247880 KB Output is correct
17 Correct 691 ms 264284 KB Output is correct
18 Correct 179 ms 237940 KB Output is correct
19 Correct 283 ms 249604 KB Output is correct
20 Correct 708 ms 264316 KB Output is correct
21 Correct 416 ms 253868 KB Output is correct
22 Correct 281 ms 248252 KB Output is correct
23 Correct 703 ms 264256 KB Output is correct
24 Correct 712 ms 264372 KB Output is correct
25 Correct 686 ms 264304 KB Output is correct
26 Correct 290 ms 249312 KB Output is correct
27 Correct 278 ms 249536 KB Output is correct
28 Correct 276 ms 249316 KB Output is correct
29 Correct 278 ms 249412 KB Output is correct
30 Correct 281 ms 249528 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 235088 KB Output is correct
2 Correct 147 ms 235188 KB Output is correct
3 Correct 152 ms 235288 KB Output is correct
4 Correct 146 ms 235160 KB Output is correct
5 Correct 145 ms 235336 KB Output is correct
6 Correct 145 ms 235180 KB Output is correct
7 Correct 148 ms 235088 KB Output is correct
8 Correct 147 ms 235076 KB Output is correct
9 Correct 148 ms 235132 KB Output is correct
10 Correct 146 ms 235076 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 244144 KB Output is correct
2 Correct 617 ms 254516 KB Output is correct
3 Correct 596 ms 254408 KB Output is correct
4 Correct 206 ms 239680 KB Output is correct
5 Correct 599 ms 254448 KB Output is correct
6 Correct 601 ms 254408 KB Output is correct
7 Correct 610 ms 254544 KB Output is correct
8 Correct 603 ms 254536 KB Output is correct
9 Correct 605 ms 254444 KB Output is correct
10 Correct 597 ms 254416 KB Output is correct
11 Correct 619 ms 254520 KB Output is correct
12 Correct 599 ms 254524 KB Output is correct
13 Correct 594 ms 254412 KB Output is correct
14 Correct 608 ms 254484 KB Output is correct
15 Correct 602 ms 254416 KB Output is correct
16 Correct 603 ms 254504 KB Output is correct
17 Correct 606 ms 254660 KB Output is correct
18 Correct 604 ms 254428 KB Output is correct
19 Correct 201 ms 239628 KB Output is correct
20 Correct 606 ms 254588 KB Output is correct
21 Correct 611 ms 254768 KB Output is correct
22 Correct 225 ms 241692 KB Output is correct
23 Correct 216 ms 240224 KB Output is correct
24 Correct 220 ms 241596 KB Output is correct
25 Correct 221 ms 241588 KB Output is correct
26 Correct 221 ms 240236 KB Output is correct
27 Correct 202 ms 239720 KB Output is correct
28 Correct 232 ms 241604 KB Output is correct
29 Correct 205 ms 239724 KB Output is correct
30 Correct 228 ms 241776 KB Output is correct
31 Correct 201 ms 239656 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 235160 KB Output is correct
2 Correct 146 ms 235280 KB Output is correct
3 Correct 146 ms 235268 KB Output is correct
4 Correct 146 ms 235112 KB Output is correct
5 Correct 146 ms 235276 KB Output is correct
6 Correct 148 ms 235236 KB Output is correct
7 Correct 143 ms 235096 KB Output is correct
8 Correct 146 ms 235084 KB Output is correct
9 Correct 147 ms 235216 KB Output is correct
10 Correct 149 ms 235268 KB Output is correct
11 Correct 147 ms 235232 KB Output is correct
12 Correct 148 ms 235268 KB Output is correct
13 Correct 145 ms 235332 KB Output is correct
14 Correct 146 ms 235332 KB Output is correct
15 Correct 147 ms 235288 KB Output is correct
16 Correct 301 ms 247880 KB Output is correct
17 Correct 691 ms 264284 KB Output is correct
18 Correct 179 ms 237940 KB Output is correct
19 Correct 283 ms 249604 KB Output is correct
20 Correct 708 ms 264316 KB Output is correct
21 Correct 416 ms 253868 KB Output is correct
22 Correct 281 ms 248252 KB Output is correct
23 Correct 703 ms 264256 KB Output is correct
24 Correct 712 ms 264372 KB Output is correct
25 Correct 686 ms 264304 KB Output is correct
26 Correct 290 ms 249312 KB Output is correct
27 Correct 278 ms 249536 KB Output is correct
28 Correct 276 ms 249316 KB Output is correct
29 Correct 278 ms 249412 KB Output is correct
30 Correct 281 ms 249528 KB Output is correct
31 Correct 147 ms 235088 KB Output is correct
32 Correct 147 ms 235188 KB Output is correct
33 Correct 152 ms 235288 KB Output is correct
34 Correct 146 ms 235160 KB Output is correct
35 Correct 145 ms 235336 KB Output is correct
36 Correct 145 ms 235180 KB Output is correct
37 Correct 148 ms 235088 KB Output is correct
38 Correct 147 ms 235076 KB Output is correct
39 Correct 148 ms 235132 KB Output is correct
40 Correct 146 ms 235076 KB Output is correct
41 Correct 338 ms 244144 KB Output is correct
42 Correct 617 ms 254516 KB Output is correct
43 Correct 596 ms 254408 KB Output is correct
44 Correct 206 ms 239680 KB Output is correct
45 Correct 599 ms 254448 KB Output is correct
46 Correct 601 ms 254408 KB Output is correct
47 Correct 610 ms 254544 KB Output is correct
48 Correct 603 ms 254536 KB Output is correct
49 Correct 605 ms 254444 KB Output is correct
50 Correct 597 ms 254416 KB Output is correct
51 Correct 619 ms 254520 KB Output is correct
52 Correct 599 ms 254524 KB Output is correct
53 Correct 594 ms 254412 KB Output is correct
54 Correct 608 ms 254484 KB Output is correct
55 Correct 602 ms 254416 KB Output is correct
56 Correct 603 ms 254504 KB Output is correct
57 Correct 606 ms 254660 KB Output is correct
58 Correct 604 ms 254428 KB Output is correct
59 Correct 201 ms 239628 KB Output is correct
60 Correct 606 ms 254588 KB Output is correct
61 Correct 611 ms 254768 KB Output is correct
62 Correct 225 ms 241692 KB Output is correct
63 Correct 216 ms 240224 KB Output is correct
64 Correct 220 ms 241596 KB Output is correct
65 Correct 221 ms 241588 KB Output is correct
66 Correct 221 ms 240236 KB Output is correct
67 Correct 202 ms 239720 KB Output is correct
68 Correct 232 ms 241604 KB Output is correct
69 Correct 205 ms 239724 KB Output is correct
70 Correct 228 ms 241776 KB Output is correct
71 Correct 201 ms 239656 KB Output is correct
72 Correct 410 ms 253668 KB Output is correct
73 Correct 704 ms 266940 KB Output is correct
74 Correct 688 ms 266892 KB Output is correct
75 Correct 672 ms 266940 KB Output is correct
76 Correct 688 ms 267052 KB Output is correct
77 Correct 682 ms 267004 KB Output is correct
78 Correct 670 ms 266936 KB Output is correct
79 Correct 692 ms 266968 KB Output is correct
80 Correct 687 ms 267040 KB Output is correct
81 Correct 695 ms 266940 KB Output is correct
82 Correct 707 ms 267072 KB Output is correct
83 Correct 707 ms 266988 KB Output is correct
84 Correct 704 ms 266940 KB Output is correct
85 Correct 711 ms 267112 KB Output is correct
86 Correct 679 ms 266956 KB Output is correct
87 Correct 678 ms 267176 KB Output is correct
88 Correct 678 ms 266988 KB Output is correct
89 Correct 269 ms 248252 KB Output is correct
90 Correct 692 ms 267120 KB Output is correct
91 Correct 686 ms 268332 KB Output is correct
92 Correct 295 ms 249624 KB Output is correct
93 Correct 297 ms 251572 KB Output is correct
94 Correct 283 ms 249532 KB Output is correct
95 Correct 294 ms 249620 KB Output is correct
96 Correct 314 ms 251764 KB Output is correct
97 Correct 272 ms 248368 KB Output is correct
98 Correct 286 ms 249512 KB Output is correct
99 Correct 273 ms 248224 KB Output is correct
100 Correct 280 ms 249588 KB Output is correct