제출 #102417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102417		CaroLinda	Towns (IOI15_towns)	C++14	25 / 100	36 ms	1152 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
 
#define lp(i,a,b) for(int i = a ; i < b ; i++)
#define ff first
#define ss second
#define pii pair<int,int>
#define INF  1000010*110
const int MAXN = 120 ;
 
using namespace std;
 
 
int m[MAXN][MAXN] ;
int d[MAXN] ;
 
void ini()
{
  lp(i,0,MAXN) lp(j, 0 , MAXN) m[i][j] = -1 ;
}
 


int query(int A ,int N)
{
  pii p = pii(-1,-1) ;
  lp(i,0,N)
  {
    if( i == A ) continue ;
    m[A][i] = getDistance(A,i) ;
    if(m[A][i]>p.ss) p = pii( i , m[A][i] ) ;
  }
  return p.ff ;
}
 
int hubDistance( int N , int sub )
{
  ini();
 
  int B = query(0 , N) ;
  int C = query(B , N) ;


  query(C , N) ;
 
  int R = INF , esq = 0 , dir = 0 , meio = 0, antigo, cara;
 
  lp(i,0,N)
 
  if(i!=C and i!=B)
  {
    int b = (m[B][i]+m[C][i] - m[B][C])/2 ;
    
    d[i] = b ;
    
    antigo=R;
    R = min( R , max( m[B][i] , m[C][i] ) - b ) ; 
    if(R<antigo)  cara = m[B][i]>m[C][i] ? B : C ;

  }

  if(sub == 1 or sub == 2) return R ;

  lp(i,0,N)
  {
    if(d[i]!=0) { meio++ ; continue; }

    if(m[cara][i]<R) esq++ ;
    else if(m[cara][i]>R) dir++ ;

  }

  if(meio>N/2 or esq>N/2 or dir>N/2) return -R ;

  return R ;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:46:55: warning: 'cara' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int R = INF , esq = 0 , dir = 0 , meio = 0, antigo, cara;
                                                       ^~~~

• Subtask 1: 13 / 13
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39