oj.uz

Submission #767204

# Submission time Handle Problem Language Result Execution time Memory
767204 2023-06-26T13:49:28 Z danikoynov Simurgh (IOI17_simurgh) C++14
100 / 100
 425 ms 95656 KB 
#include "simurgh.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 510;
struct disjoint_set_union
{
    int par[maxn];

    disjoint_set_union() {};

    disjoint_set_union(int n)
    {
        for (int i = 0; i < n; i ++)
            par[i] = i;
    }

    int find_leader(int v)
    {
        if (v == par[v])
            return v;
        return (par[v] = find_leader(par[v]));
    }

    bool is_connected(int v, int u)
    {
        return find_leader(v) == find_leader(u);
    }

    void unite(int v, int u)
    {
        v = find_leader(v);
        u = find_leader(u);
        if (v == u)
            return;
        par[v] = u;
    }
};

int is_bridge[maxn * maxn];
int direction[maxn * maxn];
vector < pair < int, int > > adj[maxn];
int par[maxn], par_idx[maxn], used[maxn];
int depth[maxn];
void dfs(int v)
{
    used[v] = 1;
    for (pair < int, int > nb : adj[v])
    {
        if (nb.first == par[v])
            continue;
        if (!used[nb.first])
        {
            par_idx[nb.first] = nb.second;
            par[nb.first] = v;
            direction[nb.second] = 1;
            depth[nb.first] = depth[v] + 1;
            dfs(nb.first);
        }
        else
        {
            direction[nb.second] = -1;
        }
    }
}

vector < vector < int > > cycles;
vector < int > gold;
int visit[maxn * maxn], is_gold[maxn * maxn];
vector < int > span;
vector < int > tree;
void trav(int v)
{
    for (pair < int, int > nb : adj[v])
    {
        if (used[nb.first] == 0)
        {
            used[nb.first] = 1;
            tree.push_back(nb.second);
            trav(nb.first);
        }
    }
}


int N, M;
pair < int, int > ed[maxn * maxn];
vector < int > out[maxn];
int delta_gold(vector < int > edges)
{
    vector < int > res;
    res = edges;
    disjoint_set_union dsu(N);
    for (int i = 0; i < edges.size(); i ++)
        dsu.unite(ed[edges[i]].first, ed[edges[i]].second);


    int new_gold = 0;
    for (int i = 0; i < edges.size(); i ++)
        if (is_gold[edges[i]] == 1)
            new_gold --;
    for (int i = 0; i < span.size(); i ++)
    {
        int idx = span[i];
        int v = ed[idx].first, u = ed[idx].second;
        if (!dsu.is_connected(v, u))
        {
            dsu.unite(v, u);
            if (is_gold[idx] == 1)
            {
                ///cout << "--- " << v << " " << u << endl;
                new_gold --;
            }
            res.push_back(idx);
        }
    }
    ///cout << "delta" << endl;
    for (int i = 0; i < res.size(); i ++)
    {
        int idx = res[i];
        ///cout << ed[idx].first << " -- " << ed[idx].second << endl;
    }
    ///cout << new_gold << endl;
    new_gold = new_gold + count_common_roads(res);
    return new_gold;
}

int deg[maxn];
vector<int> find_roads(int n, vector<int> u, vector<int> v)
{
    int m = u.size();
    N = n;
    M = m;
    for (int i = 0; i < m; i ++)
    {
        ed[i] = {u[i], v[i]};
    }
    for (int i = 0; i < m; i ++)
    {
        adj[u[i]].push_back({v[i], i});
        adj[v[i]].push_back({u[i], i});
    }

    par[0] = -1;
    par_idx[0] = -1;
    dfs(0);

    for (int i = 0; i < m; i ++)
    {
        int V = u[i], U = v[i];
        if (direction[i] == -1)
        {
            if (depth[V] < depth[U])
                swap(V, U);
            vector < int > cycle;
            int cur = V;
            while(cur != U)
            {
                visit[par_idx[cur]] = 1;
                cycle.push_back(par_idx[cur]);
                cur = par[cur];

            }
            visit[i] = 1;
            cycle.push_back(i);
            cycles.push_back(cycle);
        }
    }
    /**cout << "--------------" << endl;
    for (int i = 0; i < m; i ++)
    {
        if (direction[i] == 1)
            cout << u[i] << " : " << v[i] << endl;
    }
    cout << "-------------" << endl;*/
    for (int i = 0; i < m; i ++)
    {
        if (!visit[i])
        {
            gold.push_back(i);
            span.push_back(i);
            is_gold[i] = 1;
        }
        else
        {
            if (direction[i] == 1)
                span.push_back(i);
        }
    }

    for (vector < int > cycle : cycles)
    {
        for (int i = 0; i < n; i ++)
            used[i] = 0;

        bool need = false;
        int mx = -1;
        for (int i = 0; i < cycle.size() - 1; i ++)
        {
            int edge = cycle[i];
            if (is_gold[edge] == 0)
                need = true;
            else
                mx = i;
            used[v[edge]] = used[u[edge]] = 2;
        }

        if (!need)
            continue;


        tree.clear();
        for (int i = 0; i < n; i ++)
        {
            if (used[i] == 2)
                trav(i);
        }

        if (mx == -1)
        {

            vector < int > values;
            int max_val = -1, min_val = 1e9;
            for (int i = 0; i < cycle.size(); i ++)
            {
                vector < int > res = tree;
                for (int j = 0; j < cycle.size(); j ++)
                {
                    if (i != j)
                        res.push_back(cycle[j]);
                }
                values.push_back(count_common_roads(res));
                max_val = max(max_val, values.back());
                min_val = min(min_val, values.back());
            }

            if (max_val == min_val)
            {
                for (int idx : cycle)
                    is_gold[idx] = -1;
            }
            else
            {
                for (int i = 0; i < cycle.size(); i ++)
                {
                    if (values[i] == min_val)
                        is_gold[cycle[i]] = 1;
                    else
                        is_gold[cycle[i]] = -1;
                }
            }
        }
        else
        {

                        /**cout << "base" << endl;
            for (int i = 0; i < cycle.size(); i ++)
            {
                int idx = cycle[i];
                cout << u[idx] << " " << v[idx] << endl;
            }*/

            int max_val = 0, min_val = 1e9;
            vector < int > res = tree;
            ///cout << res.size() << " : " << cycle.size() << " " << mx << endl;
            for (int i = 0; i < cycle.size(); i ++)
                if (i != mx)
                    res.push_back(cycle[i]);

            int val = count_common_roads(res);
            if (is_gold[cycle[mx]] == 1)
            {
                min_val = val;
                max_val = val + 1;
            }
            else
            {
                min_val = val - 1;
                max_val = val;
            }

            for (int i = 0; i < cycle.size() - 1; i ++)
            {
                if (is_gold[cycle[i]] == 0)
                {
                    res = tree;
                    for (int j = 0; j < cycle.size(); j ++)
                        if (j != i)
                            res.push_back(cycle[j]);

                    val = count_common_roads(res);
                    if (val == max_val)
                        is_gold[cycle[i]] = -1;
                    else
                        is_gold[cycle[i]] = 1;
                }
            }
        }
    }

    /**cout << "Span" << endl;
    for (int i = 0; i < span.size(); i ++)
    {
        int idx = span[i];
        cout << u[idx] << " : " << v[idx] << " " << is_gold[idx] << endl;
    }*/
    queue < int > q;
    for (int i = 0; i < n; i ++)
    {

        for (int j = 0; j < m; j ++)
        {
            if (v[j] == i || u[j] == i)
                out[i].push_back(j);
        }

        deg[i] = delta_gold(out[i]);
        if (deg[i] == 1)
            q.push(i);
    }

    //cout << delta_gold(out[1]) << endl;
    //exit(0);
    while(!q.empty())
    {
        int cur = q.front();
        q.pop();
        if (deg[cur] == 0)
            continue;
        int l = 0, r = out[cur].size() - 1;
        while(l <= r)
        {
            int m = (l + r) / 2;
            vector < int > st;
            for (int i = 0; i <= m; i ++)
                st.push_back(out[cur][i]);
            if (delta_gold(st) > 0)
                r = m - 1;
            else
                l = m + 1;
        }
        is_gold[out[cur][l]] = 1;
        int oth = u[out[cur][l]];
        if (oth == cur)
            oth = v[out[cur][l]];
        deg[oth] --;
        deg[cur] --;
        if (deg[oth] == 1)
            q.push(oth);
    }

    vector < int > ans;
    for (int i = 0; i < m; i ++)
        if (is_gold[i] == 1)
            ans.push_back(i);
    return ans;

}

Compilation message

simurgh.cpp: In function 'int delta_gold(std::vector<int>)':
simurgh.cpp:95:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for (int i = 0; i < edges.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~
simurgh.cpp:100:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for (int i = 0; i < edges.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~
simurgh.cpp:103:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for (int i = 0; i < span.size(); i ++)
      |                     ~~^~~~~~~~~~~~~
simurgh.cpp:119:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for (int i = 0; i < res.size(); i ++)
      |                     ~~^~~~~~~~~~~~
simurgh.cpp:121:13: warning: unused variable 'idx' [-Wunused-variable]
  121 |         int idx = res[i];
      |             ^~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:199:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |         for (int i = 0; i < cycle.size() - 1; i ++)
      |                         ~~^~~~~~~~~~~~~~~~~~
simurgh.cpp:225:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  225 |             for (int i = 0; i < cycle.size(); i ++)
      |                             ~~^~~~~~~~~~~~~~
simurgh.cpp:228:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  228 |                 for (int j = 0; j < cycle.size(); j ++)
      |                                 ~~^~~~~~~~~~~~~~
simurgh.cpp:245:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  245 |                 for (int i = 0; i < cycle.size(); i ++)
      |                                 ~~^~~~~~~~~~~~~~
simurgh.cpp:267:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  267 |             for (int i = 0; i < cycle.size(); i ++)
      |                             ~~^~~~~~~~~~~~~~
simurgh.cpp:283:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  283 |             for (int i = 0; i < cycle.size() - 1; i ++)
      |                             ~~^~~~~~~~~~~~~~~~~~
simurgh.cpp:288:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  288 |                     for (int j = 0; j < cycle.size(); j ++)
      |                                     ~~^~~~~~~~~~~~~~
simurgh.cpp:264:30: warning: variable 'min_val' set but not used [-Wunused-but-set-variable]
  264 |             int max_val = 0, min_val = 1e9;
      |                              ^~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 0 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 340 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 0 ms 340 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 0 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 340 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 0 ms 340 KB correct
14 Correct 2 ms 596 KB correct
15 Correct 2 ms 596 KB correct
16 Correct 2 ms 468 KB correct
17 Correct 2 ms 468 KB correct
18 Correct 1 ms 340 KB correct
19 Correct 2 ms 468 KB correct
20 Correct 3 ms 468 KB correct
21 Correct 2 ms 468 KB correct
22 Correct 2 ms 468 KB correct
23 Correct 1 ms 468 KB correct
24 Correct 1 ms 468 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 1 ms 468 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 2 ms 340 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 1 ms 468 KB correct
31 Correct 1 ms 468 KB correct
32 Correct 2 ms 468 KB correct
33 Correct 1 ms 468 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 0 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 340 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 0 ms 340 KB correct
14 Correct 2 ms 596 KB correct
15 Correct 2 ms 596 KB correct
16 Correct 2 ms 468 KB correct
17 Correct 2 ms 468 KB correct
18 Correct 1 ms 340 KB correct
19 Correct 2 ms 468 KB correct
20 Correct 3 ms 468 KB correct
21 Correct 2 ms 468 KB correct
22 Correct 2 ms 468 KB correct
23 Correct 1 ms 468 KB correct
24 Correct 1 ms 468 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 1 ms 468 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 2 ms 340 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 1 ms 468 KB correct
31 Correct 1 ms 468 KB correct
32 Correct 2 ms 468 KB correct
33 Correct 1 ms 468 KB correct
34 Correct 57 ms 12260 KB correct
35 Correct 72 ms 12076 KB correct
36 Correct 61 ms 8708 KB correct
37 Correct 9 ms 832 KB correct
38 Correct 70 ms 12424 KB correct
39 Correct 52 ms 10784 KB correct
40 Correct 45 ms 8580 KB correct
41 Correct 57 ms 12548 KB correct
42 Correct 73 ms 12420 KB correct
43 Correct 25 ms 4832 KB correct
44 Correct 19 ms 3376 KB correct
45 Correct 30 ms 4140 KB correct
46 Correct 18 ms 2872 KB correct
47 Correct 9 ms 1108 KB correct
48 Correct 3 ms 340 KB correct
49 Correct 5 ms 468 KB correct
50 Correct 9 ms 1140 KB correct
51 Correct 22 ms 4184 KB correct
52 Correct 19 ms 3436 KB correct
53 Correct 17 ms 2960 KB correct
54 Correct 23 ms 4836 KB correct
55 Correct 25 ms 6348 KB correct
56 Correct 24 ms 6400 KB correct
57 Correct 24 ms 6352 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 221 ms 50632 KB correct
4 Correct 388 ms 95484 KB correct
5 Correct 385 ms 95476 KB correct
6 Correct 397 ms 95600 KB correct
7 Correct 392 ms 95512 KB correct
8 Correct 425 ms 95508 KB correct
9 Correct 387 ms 95504 KB correct
10 Correct 403 ms 95420 KB correct
11 Correct 386 ms 95508 KB correct
12 Correct 402 ms 95536 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 394 ms 95528 KB correct
15 Correct 385 ms 95468 KB correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 0 ms 340 KB correct
3 Correct 0 ms 340 KB correct
4 Correct 1 ms 340 KB correct
5 Correct 0 ms 340 KB correct
6 Correct 0 ms 340 KB correct
7 Correct 0 ms 340 KB correct
8 Correct 0 ms 340 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 0 ms 340 KB correct
11 Correct 0 ms 340 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 0 ms 340 KB correct
14 Correct 2 ms 596 KB correct
15 Correct 2 ms 596 KB correct
16 Correct 2 ms 468 KB correct
17 Correct 2 ms 468 KB correct
18 Correct 1 ms 340 KB correct
19 Correct 2 ms 468 KB correct
20 Correct 3 ms 468 KB correct
21 Correct 2 ms 468 KB correct
22 Correct 2 ms 468 KB correct
23 Correct 1 ms 468 KB correct
24 Correct 1 ms 468 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 1 ms 468 KB correct
27 Correct 1 ms 340 KB correct
28 Correct 2 ms 340 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 1 ms 468 KB correct
31 Correct 1 ms 468 KB correct
32 Correct 2 ms 468 KB correct
33 Correct 1 ms 468 KB correct
34 Correct 57 ms 12260 KB correct
35 Correct 72 ms 12076 KB correct
36 Correct 61 ms 8708 KB correct
37 Correct 9 ms 832 KB correct
38 Correct 70 ms 12424 KB correct
39 Correct 52 ms 10784 KB correct
40 Correct 45 ms 8580 KB correct
41 Correct 57 ms 12548 KB correct
42 Correct 73 ms 12420 KB correct
43 Correct 25 ms 4832 KB correct
44 Correct 19 ms 3376 KB correct
45 Correct 30 ms 4140 KB correct
46 Correct 18 ms 2872 KB correct
47 Correct 9 ms 1108 KB correct
48 Correct 3 ms 340 KB correct
49 Correct 5 ms 468 KB correct
50 Correct 9 ms 1140 KB correct
51 Correct 22 ms 4184 KB correct
52 Correct 19 ms 3436 KB correct
53 Correct 17 ms 2960 KB correct
54 Correct 23 ms 4836 KB correct
55 Correct 25 ms 6348 KB correct
56 Correct 24 ms 6400 KB correct
57 Correct 24 ms 6352 KB correct
58 Correct 0 ms 340 KB correct
59 Correct 0 ms 340 KB correct
60 Correct 221 ms 50632 KB correct
61 Correct 388 ms 95484 KB correct
62 Correct 385 ms 95476 KB correct
63 Correct 397 ms 95600 KB correct
64 Correct 392 ms 95512 KB correct
65 Correct 425 ms 95508 KB correct
66 Correct 387 ms 95504 KB correct
67 Correct 403 ms 95420 KB correct
68 Correct 386 ms 95508 KB correct
69 Correct 402 ms 95536 KB correct
70 Correct 1 ms 340 KB correct
71 Correct 394 ms 95528 KB correct
72 Correct 385 ms 95468 KB correct
73 Correct 1 ms 340 KB correct
74 Correct 393 ms 95656 KB correct
75 Correct 385 ms 92152 KB correct
76 Correct 151 ms 28416 KB correct
77 Correct 386 ms 95436 KB correct
78 Correct 396 ms 95352 KB correct
79 Correct 392 ms 95212 KB correct
80 Correct 385 ms 92616 KB correct
81 Correct 362 ms 78968 KB correct
82 Correct 398 ms 92020 KB correct
83 Correct 245 ms 47652 KB correct
84 Correct 173 ms 39004 KB correct
85 Correct 156 ms 30960 KB correct
86 Correct 100 ms 16508 KB correct
87 Correct 74 ms 9352 KB correct
88 Correct 57 ms 6412 KB correct
89 Correct 56 ms 5940 KB correct
90 Correct 47 ms 4612 KB correct
91 Correct 15 ms 648 KB correct
92 Correct 10 ms 468 KB correct
93 Correct 150 ms 30856 KB correct
94 Correct 108 ms 16448 KB correct
95 Correct 95 ms 14720 KB correct
96 Correct 51 ms 5064 KB correct
97 Correct 59 ms 6464 KB correct
98 Correct 70 ms 9484 KB correct
99 Correct 59 ms 6920 KB correct
100 Correct 23 ms 1288 KB correct
101 Correct 10 ms 500 KB correct
102 Correct 186 ms 47580 KB correct
103 Correct 183 ms 47708 KB correct
104 Correct 194 ms 47136 KB correct
105 Correct 168 ms 47188 KB correct