제출 #975730

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975730		Nexus	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	1703 ms	2097152 KiB

cyberland

#define ll long long
#include "cyberland.h"

#include <bits/stdc++.h>
using namespace std;

const ll N=1e5+9;

ll a[N],h,k;
bool balt;
vector<ll>v[N],r;
map<pair<ll,ll>,ll>m;

void dfs(ll node,ll pa)
{
    if(node==h)
    {
        r.push_back(node);
        balt=1;
        return;
    }

            //cout<<node<<' ';

    for(auto i:v[node])
    {
        if(i!=pa)
        dfs(i,node);

        if(balt)
        {
            r.push_back(node);
            return;
        }
    }
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {

    h=H,k=K;

    for(ll i=0;i<M;++i)
    {
        v[x[i]].push_back(y[i]);
        v[y[i]].push_back(x[i]);
        m[{x[i],y[i]}]=c[i];
        m[{y[i],x[i]}]=c[i];
    }


    dfs(0,0);

    if(!balt)return -1;

    //cout<<r.size();

    ll s=0;
    for(ll i=0;i<r.size();++i)
    {
        if(!arr[r[i]])s=i;
    }

    for(ll i=r.size()-1;i>=s;--i)
    {
        //cout<<r[i]<<' ';
        if(arr[r[i]]==2 && k)--k,a[i]=1;
    }



    double ans=0;


    for(ll i=s;i<r.size()-1;++i)
    {
        //cout<<m[{r[i],r[i+1]}];
        ans+=m[{r[i],r[i+1]}];
        if(a[i])ans/=2.0;
    }

    return ans;
}

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

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:58:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(ll i=0;i<r.size();++i)
      |                ~^~~~~~~~~
cyberland.cpp:74:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(ll i=s;i<r.size()-1;++i)
      |                ~^~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3