Submission #758671

#	Time	Username	Problem	Language	Result	Execution time	Memory
758671		boris_mihov	Simurgh (IOI17_simurgh)	C++17	30 / 100	71 ms	4004 KiB

simurgh

#include "simurgh.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 500 + 10;
const int INF  = 1e9;

int n, m;
int timer;
int inComp[MAXN];
std::set <int> s;
std::vector <int> ans;
std::vector <int> spanning;
std::vector <std::pair <int,int>> edges;
std::vector <std::pair <int,int>> g[MAXN];

void dfs(int node)
{
    inComp[node] = timer;
    for (const auto &[i, idx] : g[node])
    {
        if (inComp[i] == 0)
        {
            spanning.push_back(idx);
            dfs(i);
        }
    }
}

std::vector <int> find_roads(int N, std::vector <int> u, std::vector <int> v)
{
	n = N;
    m = u.size();
    for (int i = 0 ; i < m ; ++i)
    {
        g[u[i] + 1].push_back({v[i] + 1, i});
        g[v[i] + 1].push_back({u[i] + 1, i});
    }

    int last = -1;
    int res = -1;

    for (int i = 1 ; i <= n ; ++i)
    {
        timer = 0;
        spanning.clear();
        std::fill(inComp + 1, inComp + 1 + n, 0);
        inComp[i] = -1;

        for (int j = 1 ; j <= n ; ++j)
        {
            if (inComp[j] != 0)
            {
                continue;
            }

            timer++;
            dfs(j);
        }

        std::sort(g[i].begin(), g[i].end(), [&](auto x, auto y)
        {
            return inComp[x.first] < inComp[y.first];
        });

        int curr = spanning.size();
        for (int j = 0 ; j < g[i].size() ; ++j)
        {
            if (j == 0 || inComp[g[i][j - 1].first] < inComp[g[i][j].first])
            {
                spanning.push_back(g[i][j].second);
            }
        }

        for (int j = 0 ; j <= g[i].size() ; ++j)
        {
            if (j == g[i].size() || (j > 0 && inComp[g[i][j - 1].first] < inComp[g[i][j].first]))
            {
                if (edges.size())
                {
                    std::sort(edges.begin(), edges.end(), [&](auto x, auto y)
                    {
                        return x.second < y.second;
                    });

                    ans.push_back(edges.back().first);
                    // std::cout << "in for: " << edges.back().first << ' ' << edges.back().second << '\n';
                    for (int k = (int)edges.size() - 2 ; k >= 0 ; --k)
                    {
                        if (edges[k].second != edges[k + 1].second)
                        {
                            // std::cout << "break: " << edges[k].second << ' ' << edges[k + 1].second << '\n';
                            break;
                        }

                        // std::cout << "in for: " << edges[k].first << ' ' << edges[k].second << ' ' << edges[k + 1].second << '\n';
                        ans.push_back(edges[k].first);
                    }
                }

                curr++;
                edges.clear();
                if (j == g[i].size())
                {
                    break;
                }
            }

            spanning[curr] = g[i][j].second;
            res = count_common_roads(spanning);
            // std::cout << "push: " << edges.size() << ' ' << g[i][j].second << ' ' << res << '\n';
            edges.push_back({g[i][j].second, res});
        }
    }

    for (const int &i : ans)
    {
        s.insert(i);
    }

    ans.clear();
    for (const int &i : s)
    {
        ans.push_back(i);
    }

    return ans;
}

Compilation message (stderr)

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:72:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for (int j = 0 ; j < g[i].size() ; ++j)
      |                          ~~^~~~~~~~~~~~~
simurgh.cpp:80:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for (int j = 0 ; j <= g[i].size() ; ++j)
      |                          ~~^~~~~~~~~~~~~~
simurgh.cpp:82:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             if (j == g[i].size() || (j > 0 && inComp[g[i][j - 1].first] < inComp[g[i][j].first]))
      |                 ~~^~~~~~~~~~~~~~
simurgh.cpp:108:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |                 if (j == g[i].size())
      |                     ~~^~~~~~~~~~~~~~
simurgh.cpp:45:9: warning: unused variable 'last' [-Wunused-variable]
   45 |     int last = -1;
      |         ^~~~

• Subtask 1: 13 / 13
• Subtask 2: 17 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30