제출 #345797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345797		daniel920712	악어의 지하 도시 (IOI11_crocodile)	C++14	46 / 100	184 ms	262148 KiB

crocodile

#include "crocodile.h"
#include "assert.h"
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
vector < pair < long long , long long > > Next[100005];
map < long long , long long > how[100005];
bool is[100005];
long long F(long long fa,long long here)
{
    long long t,ok=0;
    vector < long long > tt;
    if(is[here]) return 0;
    if(how[here].find(fa)!=how[here].end()) return how[here][fa];
    for(auto i:Next[here])
    {
        if(i.first!=fa)
        {
            t=F(here,i.first);
            if(t!=-1) tt.push_back(t+i.second);
        }
        else ok=1;
    }
    sort(tt.begin(),tt.end());
    if(tt.size()>=2) how[here][fa]=tt[1];
    else how[here][fa]=-1;
    //printf("%lld %lld %lld\n",here,fa,how[here][fa]);
    return how[here][fa];
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    int i;
    long long a,b,c;
    for(i=0;i<M;i++)
    {
        Next[R[i][0]].push_back(make_pair((long long) R[i][1],(long long) L[i]));
        Next[R[i][1]].push_back(make_pair((long long) R[i][0],(long long) L[i]));
    }
    for(i=0;i<K;i++) is[P[i]]=1;
    return (int) F(-1,0);
}

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

crocodile.cpp: In function 'long long int F(long long int, long long int)':
crocodile.cpp:14:17: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   14 |     long long t,ok=0;
      |                 ^~
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:36:15: warning: unused variable 'a' [-Wunused-variable]
   36 |     long long a,b,c;
      |               ^
crocodile.cpp:36:17: warning: unused variable 'b' [-Wunused-variable]
   36 |     long long a,b,c;
      |                 ^
crocodile.cpp:36:19: warning: unused variable 'c' [-Wunused-variable]
   36 |     long long a,b,c;
      |                   ^

• Subtask 1: 46 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11