oj.uz

Submission #767165

# Submission time Handle Problem Language Result Execution time Memory
767165 2023-06-26T13:01:07 Z danikoynov Simurgh (IOI17_simurgh) C++14
30 / 100
 136 ms 49456 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);
        }
    }
}
vector<int> find_roads(int n, vector<int> u, vector<int> v)
{
    int m = u.size();
    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);
        }
    }

    for (int i = 0; i < m; i ++)
        if (!visit[i])
    {
        gold.push_back(i);
        span.push_back(i);
        is_gold[i] = 1;
    }

        for (vector < int > cycle : cycles)
        {
            for (int i = 0; i < n; i ++)
                used[i] = 0;
            for (int i = 0; i < cycle.size(); i ++)
            {
                int edge = cycle[i];
            used[v[edge]] = used[u[edge]] = 2;
            }

            tree.clear();
            for (int i = 0; i < n; i ++)
            {
                if (used[i] == 2)
                    trav(i);
            }
            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;
                }
            }
        }

        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 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:132:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |             for (int i = 0; i < cycle.size(); i ++)
      |                             ~~^~~~~~~~~~~~~~
simurgh.cpp:146:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |             for (int i = 0; i < cycle.size(); i ++)
      |                             ~~^~~~~~~~~~~~~~
simurgh.cpp:149:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |                 for (int j = 0; j < cycle.size(); j ++)
      |                                 ~~^~~~~~~~~~~~~~
simurgh.cpp:166:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |                 for (int i = 0; i < cycle.size(); i ++)
      |                                 ~~^~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 336 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 328 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 1 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 1 ms 340 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 336 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 328 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 17 ms 552 KB correct
15 Correct 17 ms 556 KB correct
16 Correct 17 ms 556 KB correct
17 Correct 14 ms 468 KB correct
18 Correct 5 ms 412 KB correct
19 Correct 15 ms 588 KB correct
20 Correct 13 ms 468 KB correct
21 Correct 12 ms 468 KB correct
22 Correct 7 ms 332 KB correct
23 Correct 5 ms 340 KB correct
24 Correct 5 ms 340 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 5 ms 332 KB correct
27 Correct 6 ms 424 KB correct
28 Correct 2 ms 332 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 8 ms 448 KB correct
31 Correct 8 ms 340 KB correct
32 Correct 8 ms 444 KB correct
33 Correct 8 ms 340 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 336 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 328 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 17 ms 552 KB correct
15 Correct 17 ms 556 KB correct
16 Correct 17 ms 556 KB correct
17 Correct 14 ms 468 KB correct
18 Correct 5 ms 412 KB correct
19 Correct 15 ms 588 KB correct
20 Correct 13 ms 468 KB correct
21 Correct 12 ms 468 KB correct
22 Correct 7 ms 332 KB correct
23 Correct 5 ms 340 KB correct
24 Correct 5 ms 340 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 5 ms 332 KB correct
27 Correct 6 ms 424 KB correct
28 Correct 2 ms 332 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 8 ms 448 KB correct
31 Correct 8 ms 340 KB correct
32 Correct 8 ms 444 KB correct
33 Correct 8 ms 340 KB correct
34 Incorrect 108 ms 11960 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Incorrect 136 ms 49456 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB correct
2 Correct 1 ms 340 KB correct
3 Correct 1 ms 332 KB correct
4 Correct 1 ms 336 KB correct
5 Correct 1 ms 340 KB correct
6 Correct 1 ms 340 KB correct
7 Correct 1 ms 328 KB correct
8 Correct 1 ms 332 KB correct
9 Correct 1 ms 340 KB correct
10 Correct 1 ms 340 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 340 KB correct
13 Correct 1 ms 340 KB correct
14 Correct 17 ms 552 KB correct
15 Correct 17 ms 556 KB correct
16 Correct 17 ms 556 KB correct
17 Correct 14 ms 468 KB correct
18 Correct 5 ms 412 KB correct
19 Correct 15 ms 588 KB correct
20 Correct 13 ms 468 KB correct
21 Correct 12 ms 468 KB correct
22 Correct 7 ms 332 KB correct
23 Correct 5 ms 340 KB correct
24 Correct 5 ms 340 KB correct
25 Correct 1 ms 340 KB correct
26 Correct 5 ms 332 KB correct
27 Correct 6 ms 424 KB correct
28 Correct 2 ms 332 KB correct
29 Correct 1 ms 340 KB correct
30 Correct 8 ms 448 KB correct
31 Correct 8 ms 340 KB correct
32 Correct 8 ms 444 KB correct
33 Correct 8 ms 340 KB correct
34 Incorrect 108 ms 11960 KB WA in grader: NO
35 Halted 0 ms 0 KB -