제출 #19033

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
19033	2016-02-17 06:36:05	suhgyuho_william	철로 (IOI14_rail)	C++98	100 / 100	201 ms	892 KiB

rail

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "rail.h"
#include <algorithm>
#include <stdio.h>
using namespace std;
int dis0[5010];
int disx[5010];
int bef[5010],next[5010];
int op[5010],num[5010];
bool cmp(int x,int y){
  return dis0[x] < dis0[y];
}
bool cmp2(int x,int y){
  return disx[x] < disx[y];
}
void findLocation(int N, int first, int location[], int stype[]){
  int i,j,k;
  int small,x;
  int t,v,nv;
  int rear,tmp;
  location[0] = first; stype[0] = 1;
  small = 999999999;
    for(i=1; i<N; i++){
    dis0[i] = getDistance(0,i);
    if(small > dis0[i]){
      small = dis0[i];
      x = i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:33:31: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
     location[x] = first+dis0[x];
                         ~~~~~~^

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 26 / 26
• Subtask 4: 44 / 44