제출 #1250796

#제출 시각아이디문제언어결과실행 시간메모리
1250796alex0152World Map (IOI25_worldmap)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;


vector<int>adj[41];
int grad[41],x,y,z,cnt,dist[41];
void dfs(int node,int parent)
{
    dist[cnt]=node;
    cnt++;
    for(auto it : adj[node])
        if(it!=parent)
            dfs(it,node);
}
vector<vector<int>>create_map(int n, int m,vector<int> a, vector<int> b)
{
    for(int i=1; i<=n; ++i)
        grad[i]=0,adj[i].clear();
    cnt=0;
    for(int i=0; i<a.size(); ++i)
    {
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
        grad[a[i]]++;
        grad[b[i]]++;
    }
    for(int i=1; i<=n; ++i)
        if(grad[i]==1)
            x=i;
    vector<vector<int>>mp(n,vector<int>(n));
    if(m==n-1)
    {
        for(int i=0; i<n; ++i)
        {
            z=dist[i];
            x=i;
            y=0;
            for(; x>=0 && y<n; x--,y++)
                mp[x][y]=x;
        }
        for(int i=0; i<n; ++i)
            for(int j=0; j<n; ++j)
                if(!mp[i][j])
                    mp[i][j]=x;
                    return mp;
    }
    else if(m==n*(n-1)/2)
    {

    }
}


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

worldmap.cpp: In function 'std::vector<std::vector<int> > create_map(int, int, std::vector<int>, std::vector<int>)':
worldmap.cpp:47:23: warning: control reaches end of non-void function [-Wreturn-type]
   47 |     else if(m==n*(n-1)/2)
      |                ~~~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...