제출 #813123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
813123		andrei_boaca	수천개의 섬 (IOI22_islands)	C++17	55 / 100	180 ms	31820 KiB

islands

#include "islands.h"

#include <variant>
#include <vector>
#include <algorithm>
#include <assert.h>
#include <map>
//#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int n,m;
map<int,vector<int>> c[100005];
vector<int> muchii[100005];
vector<int> sol;
void n2(int x,int y)
{
    int A=c[y][x][0];
    int B=c[x][y][0];
    int C=c[x][y][1];
    vector<int> aux={B,A,C,B,A,C};
    for(int i:aux)
        sol.push_back(i);
}
bool use[100005];
vector<int> lant;
bool good;
bool inst[100005];
int from[100005];
int who;
int comp[100005],lg[100005];
void s1(int nod)
{
    if(good)
        return;
    use[nod]=1;
    inst[nod]=1;
    for(int i:muchii[nod])
    {
        if(good)
            return;
        if(!inst[i])
        {
            if(c[nod][i].size()>=2&&c[i][nod].size()>=1)
            {
                who=i;
                good=1;
                int x=nod;
                while(true)
                {
                    lant.push_back(x);
                    if(x==0)
                        break;
                    x=from[x];
                }
                return;
            }
            if(!use[i])
            {
                from[i]=nod;
                s1(i);
            }
        }
    }
    inst[nod]=0;
}
void build(int x,int y,int z)
{
    assert(x>=0&&y>=0&&z>=0);
    int A=c[x][y][0];
    int B=c[y][x][0];
    int C=c[x][z][0];
    int D=c[z][x][0];
    if(y==z)
    {
        C=c[x][z][1];
        D=c[z][x][1];
    }
    vector<int> aux={A,B,C,D,B,A,D,C};
    for(int i:aux)
        sol.push_back(i);
}
int A,B;
void s2(int nod)
{
    if(good)
        return;
    use[nod]=1;
    inst[nod]=1;
    vector<int> dub;
    for(int i:muchii[nod])
    {
        if(!inst[i])
        {
            for(int j=1;dub.size()<2&&j<=min(c[nod][i].size(),c[i][nod].size());j++)
                dub.push_back(i);
        }
    }
    if(dub.size()>=2)
    {
        good=1;
        A=dub[0];
        B=dub[1];
        int x=nod;
        while(true)
        {
            lant.push_back(x);
            if(x==0)
                break;
            x=from[x];
        }
        return;
    }
    for(int i:muchii[nod])
    {
        if(good)
            return;
        if(!use[i])
        {
            from[i]=nod;
            s2(i);
        }
    }
    inst[nod]=0;
}
void reset()
{
    for(int i=0;i<n;i++)
    {
        use[i]=0;
        inst[i]=0;
        from[i]=0;
    }
}
int nr;
vector<int> st;
vector<int> ee[100005];
void dfs1(int nod)
{
    use[nod]=1;
    for(int i:muchii[nod])
        if(c[nod][i].size()>=2)
            if(!use[i])
                dfs1(i);
    st.push_back(nod);
}
void dfs2(int nod)
{
    comp[nod]=nr;
    lg[nr]++;
    for(int i:ee[nod])
        if(c[i][nod].size()>=2)
            if(comp[i]==0)
                dfs2(i);
}
void s3(int nod)
{
    if(good)
        return;
    use[nod]=1;
    if(lg[comp[nod]]>=2)
    {
        good=1;
        int x=nod;
        while(true)
        {
            lant.push_back(x);
            if(x==0)
                break;
            x=from[x];
        }
    }
    for(int i:muchii[nod])
        if(!use[i])
        {
            from[i]=nod;
            s3(i);
        }
}
vector<int> ciclu;
void calc(int nod)
{
    if(!ciclu.empty())
        return;
    use[nod]=1;
    for(int i:muchii[nod])
    {
        if(!ciclu.empty())
            return;
        if(comp[i]==comp[nod]&&c[nod][i].size()>=2)
        {
            if(!use[i])
            {
                from[i]=nod;
                calc(i);
            }
            else if(i==who)
            {
                int x=nod;
                while(true)
                {
                    ciclu.push_back(x);
                    if(x==who)
                        break;
                    x=from[x];
                }
            }
        }
    }
}
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V)
{
    n=N;
    m=M;
    for(int i=0;i<m;i++)
    {
        int a=U[i],b=V[i];
        c[a][b].push_back(i);
        if(c[a][b].size()==1)
            muchii[a].push_back(b);
    }
    s1(0);
    if(good)
    {
        assert(!lant.empty());
        reverse(lant.begin(),lant.end());
        for(int i=1;i<lant.size();i++)
            sol.push_back(c[lant[i-1]][lant[i]][0]);
        n2(lant.back(),who);
        reverse(lant.begin(),lant.end());
        for(int i=1;i<lant.size();i++)
            sol.push_back(c[lant[i]][lant[i-1]][0]);
        return sol;
    }
    reset();
    lant.clear();
    s2(0);
    if(good)
    {
        reverse(lant.begin(),lant.end());
        for(int i=1;i<lant.size();i++)
            sol.push_back(c[lant[i-1]][lant[i]][0]);
        build(lant.back(),A,B);
        reverse(lant.begin(),lant.end());
        for(int i=1;i<lant.size();i++)
            sol.push_back(c[lant[i]][lant[i-1]][0]);
        return sol;
    }
    reset();
    for(int i=0;i<n;i++)
        if(!use[i])
            dfs1(i);
    reverse(st.begin(),st.end());
    for(int i=0;i<n;i++)
        for(int j:muchii[i])
            ee[j].push_back(i);
    for(int i:st)
        if(comp[i]==0)
        {
            nr++;
            dfs2(i);
        }
    reset();
    s3(0);
    if(good)
    {
        reverse(lant.begin(),lant.end());
        for(int i=1;i<lant.size();i++)
            sol.push_back(c[lant[i-1]][lant[i]][0]);
        who=lant.back();
        reset();
        calc(who);
        reverse(ciclu.begin(),ciclu.end());
        int lg=ciclu.size();
        for(int i=0;i<ciclu.size();i++)
        {
            int x=ciclu[i];
            int y=ciclu[(i+1)%lg];
            sol.push_back(c[x][y][0]);
        }
        for(int i=0;i<ciclu.size();i++)
        {
            int x=ciclu[i];
            int y=ciclu[(i+1)%lg];
            sol.push_back(c[x][y][1]);
        }
        for(int i=0;;i=(i-1+lg)%lg)
        {
            int x=ciclu[i];
            int y=ciclu[(i-1+lg)%lg];
            sol.push_back(c[y][x][0]);
            if(i==1)
                break;
        }
        for(int i=0;;i=(i-1+lg)%lg)
        {
            int x=ciclu[i];
            int y=ciclu[(i-1+lg)%lg];
            sol.push_back(c[y][x][1]);
            if(i==1)
                break;
        }
        reverse(lant.begin(),lant.end());
        for(int i=1;i<lant.size();i++)
            sol.push_back(c[lant[i]][lant[i-1]][0]);
        return sol;
    }
    return false;
}

컴파일 시 표준 에러 (stderr) 메시지

islands.cpp: In function 'void s2(int)':
islands.cpp:94:40: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   94 |             for(int j=1;dub.size()<2&&j<=min(c[nod][i].size(),c[i][nod].size());j++)
      |                                       ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:226:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  226 |         for(int i=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~
islands.cpp:230:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  230 |         for(int i=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~
islands.cpp:240:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  240 |         for(int i=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~
islands.cpp:244:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  244 |         for(int i=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~
islands.cpp:267:22: 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=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~
islands.cpp:274:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  274 |         for(int i=0;i<ciclu.size();i++)
      |                     ~^~~~~~~~~~~~~
islands.cpp:280:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  280 |         for(int i=0;i<ciclu.size();i++)
      |                     ~^~~~~~~~~~~~~
islands.cpp:303:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  303 |         for(int i=1;i<lant.size();i++)
      |                     ~^~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 21 / 21
• Subtask 4: 24 / 24
• Subtask 5: 0 / 45