제출 #693300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
693300		NemanjaSo2005	Stations (IOI20_stations)	C++14	5 / 100	897 ms	784 KiB

stations

#include<bits/stdc++.h>
#include "stations.h"
#define ll long long
using namespace std;
ll N,K,in[1005],out[1005],vrem=0;
vector<ll> stablo[1005];
vector<int> L;
void dfs(ll gde,ll pret){
  // cout<<gde<<" dfs "<<pret<<endl;
   in[gde]=++vrem;
   for(int i=0;i<stablo[gde].size();i++)
      if(stablo[gde][i]!=pret)
         dfs(stablo[gde][i],gde);
   out[gde]=vrem;
   return;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v){
   N=n;
   K=k;
   for(ll i=0;i<N;i++)
      stablo[i].clear();
   for(ll i=0;i<N-1;i++){
      stablo[u[i]].push_back(v[i]);
      stablo[v[i]].push_back(u[i]);
   }

   vrem=0;
   for(int i=0;i<N;i++)
      if(stablo[i].size()==1){
         dfs(i,i);
         break;
      }
   for(int i=0;i<N;i++){
      in[i]--;
      out[i]--;
   }
   L.clear();
   for(ll i=0;i<N;i++){
     // cout<<in[i]<<" "<<out[i]<<endl;
      L.push_back(in[i]);
   }
   return L;
}
struct slog{
   ll in,out;
}niz[1005],tren,tar;
bool isparent(slog a,slog b){
   return a.in<=b.in and a.out>=b.out;
}
int find_next_station(int s,int t,vector<int> c){
   if(c.size()==1)
      return c[0];
   if(s>t)
      return c[0];
   return c[1];
}

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

stations.cpp: In function 'void dfs(long long int, long long int)':
stations.cpp:11:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |    for(int i=0;i<stablo[gde].size();i++)
      |                ~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61