제출 #1362416

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1362416		ivaziva	Love Polygon (BOI18_polygon)	C++20	0 / 100	125 ms	18540 KiB

polygon

#include <bits/stdc++.h>

using namespace std;

#define MAXN 200001
#define int long long

int n;
vector<pair<string,string>> edges;
vector<string> kompresija;
bool loved[MAXN];
vector<int> adj[MAXN];
bool pos[MAXN];
int siz=0;

bool dfs(int node)
{
    pos[node]=true;
    for (int sled:adj[node])
    {
        if (!pos[sled]) dfs(sled);
    }
}

int32_t main()
{
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        string s1,s2;cin>>s1>>s2;edges.push_back({s1,s2});
        kompresija.push_back(s1);kompresija.push_back(s2);
    }
    if (n%2==1) {cout<<-1<<endl;return 0;}
    sort(kompresija.begin(),kompresija.end());kompresija.erase(unique(kompresija.begin(),kompresija.end()),kompresija.end());
    for (pair<string,string> edge:edges)
    {
        int u=lower_bound(kompresija.begin(),kompresija.end(),edge.first)-kompresija.begin()+1;
        int v=lower_bound(kompresija.begin(),kompresija.end(),edge.second)-kompresija.begin()+1;
        adj[u].push_back(v);loved[v]=true;
    }
    bool subtask2=true;
    for (int i=1;i<=(int)kompresija.size();i++)
    {
        if (!loved[i]) {subtask2=false;break;}
    }
    if (subtask2)
    {
        int answer=0;
        for (int node=1;node<=(int)kompresija.size();node++)
        {
            if (pos[node]) continue;
            siz=0;dfs(node);if (siz%2==1) answer++;
        }
        cout<<answer<<endl;return 0;
    }
    return 0;
}

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

polygon.cpp: In function 'bool dfs(long long int)':
polygon.cpp:23:1: warning: no return statement in function returning non-void [-Wreturn-type]
   23 | }
      | ^

• 서브태스크 1: 0 / 21
• 서브태스크 2: 0 / 25
• 서브태스크 3: 0 / 29
• 서브태스크 4: 0 / 25