답안 #142844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
142844 2019-08-11T13:10:22 Z Milki 꿈 (IOI13_dreaming) C++14
32 / 100
105 ms 15476 KB
//#ifndef DREAMING_H_INCLUDED
//#define DREAMING_H_INCLUDED

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

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 1e5 + 5;

vector <point> E[MAXN];
vector <int> component[MAXN];
int boja[MAXN], dist[MAXN], dep[MAXN];
point par[MAXN], mx[MAXN];

void color(int x, int Time){
  boja[x] = Time;
  component[Time].pb(x);
  for(auto e : E[x]){
    if(boja[e.first] != -1) continue;
    color(e.first, Time);
  }
}

point find_furthest(int cmp, int x){
  for(auto it : component[cmp])
    dist[it] = 0;

  queue<int> Q;
  Q.push(x);

  point ret = point(0, 0);
  while(!Q.empty()){
    int nx = Q.front(); Q.pop();
    for(auto e : E[nx]){
      if(dist[e.first] || e.first == x)
        continue;

      par[e.first] = point(nx, e.second);
      dep[e.first] = dep[nx] + 1;
      dist[e.first] = dist[nx] + e.second;
      ret = max(ret, point(dist[e.first], e.first));
      Q.push(e.first);
    }
  }

  return ret;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
  REP(i, M){
    E[ A[i] ].pb( point( B[i], T[i] ) );
    E[ B[i] ].pb( point( A[i], T[i] ) );
  }

  memset(boja, -1, sizeof(boja));
  int Time = 0;
  REP(i, N)
    if(boja[i] == -1)
      color(i, Time ++);

  int ret = 0;
  REP(i, Time){
    int a = find_furthest(i, component[i][0]).second;
    point najdalji = find_furthest(i, a);
    int b = najdalji.second, d = najdalji.first;

    if(dep[a] < dep[b])
      swap(a, b);

    ret = max(ret, d);
    mx[i] = point(d, a);

    deque<point> lt, rt;

    while(dep[a] != dep[b]){
      lt.push_back(par[a]);
      a = par[a].first;
    }

    while(a != b){
      lt.push_back(par[a]);
      a = par[a].first;

      rt.push_front(point(b, par[b].second));
      b = par[b].first;
    }

    int sum = 0;
    for(auto it : lt){
      sum += it.second;
      mx[i] = min(mx[i], point(max(d - sum, sum), it.first));
    }
    for(auto it : rt){
      sum += it.second;
      mx[i] = min(mx[i], point(max(d - sum, sum), it.first));
    }

    mx[i] = max(mx[i], find_furthest(i, mx[i].second));
  }

  sort(mx, mx + Time, greater<point>());
  //TRACE(mx[0].first); TRACE(mx[1].first); TRACE(L);

  if(Time == 1)
    return ret;
  else if(Time == 2)
    return max(ret, mx[0].first + mx[1].first + L);
  else
    return max(mx[1].first + mx[2].first + 2 * L, max(ret, mx[0].first + mx[1].first + L));
}

//#endif // DREAMING_H_INCLUDED
# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 15476 KB Output is correct
2 Correct 105 ms 15324 KB Output is correct
3 Correct 54 ms 13044 KB Output is correct
4 Correct 16 ms 6904 KB Output is correct
5 Correct 14 ms 6392 KB Output is correct
6 Correct 24 ms 7672 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 41 ms 9592 KB Output is correct
9 Correct 52 ms 11512 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 75 ms 12896 KB Output is correct
12 Correct 88 ms 14188 KB Output is correct
13 Correct 7 ms 5500 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 15476 KB Output is correct
2 Correct 105 ms 15324 KB Output is correct
3 Correct 54 ms 13044 KB Output is correct
4 Correct 16 ms 6904 KB Output is correct
5 Correct 14 ms 6392 KB Output is correct
6 Correct 24 ms 7672 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 41 ms 9592 KB Output is correct
9 Correct 52 ms 11512 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 75 ms 12896 KB Output is correct
12 Correct 88 ms 14188 KB Output is correct
13 Correct 7 ms 5500 KB Output is correct
14 Correct 7 ms 5368 KB Output is correct
15 Correct 6 ms 5496 KB Output is correct
16 Correct 6 ms 5496 KB Output is correct
17 Correct 7 ms 5496 KB Output is correct
18 Correct 7 ms 5496 KB Output is correct
19 Correct 7 ms 5496 KB Output is correct
20 Correct 6 ms 5368 KB Output is correct
21 Correct 6 ms 5368 KB Output is correct
22 Correct 6 ms 5368 KB Output is correct
23 Correct 6 ms 5368 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5368 KB Output is correct
26 Correct 6 ms 5496 KB Output is correct
27 Correct 6 ms 5496 KB Output is correct
28 Correct 7 ms 5368 KB Output is correct
29 Correct 6 ms 5496 KB Output is correct
30 Incorrect 7 ms 5496 KB Output isn't correct
31 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 15476 KB Output is correct
2 Correct 105 ms 15324 KB Output is correct
3 Correct 54 ms 13044 KB Output is correct
4 Correct 16 ms 6904 KB Output is correct
5 Correct 14 ms 6392 KB Output is correct
6 Correct 24 ms 7672 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 41 ms 9592 KB Output is correct
9 Correct 52 ms 11512 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 75 ms 12896 KB Output is correct
12 Correct 88 ms 14188 KB Output is correct
13 Correct 7 ms 5500 KB Output is correct
14 Correct 7 ms 5368 KB Output is correct
15 Correct 6 ms 5496 KB Output is correct
16 Correct 6 ms 5496 KB Output is correct
17 Correct 7 ms 5496 KB Output is correct
18 Correct 7 ms 5496 KB Output is correct
19 Correct 7 ms 5496 KB Output is correct
20 Correct 6 ms 5368 KB Output is correct
21 Correct 6 ms 5368 KB Output is correct
22 Correct 6 ms 5368 KB Output is correct
23 Correct 6 ms 5368 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5368 KB Output is correct
26 Correct 6 ms 5496 KB Output is correct
27 Correct 6 ms 5496 KB Output is correct
28 Correct 7 ms 5368 KB Output is correct
29 Correct 6 ms 5496 KB Output is correct
30 Incorrect 7 ms 5496 KB Output isn't correct
31 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 12024 KB Output is correct
2 Correct 92 ms 12180 KB Output is correct
3 Correct 94 ms 12196 KB Output is correct
4 Correct 96 ms 12156 KB Output is correct
5 Correct 89 ms 12152 KB Output is correct
6 Correct 89 ms 12536 KB Output is correct
7 Correct 87 ms 12512 KB Output is correct
8 Correct 84 ms 11900 KB Output is correct
9 Correct 85 ms 11944 KB Output is correct
10 Correct 93 ms 12280 KB Output is correct
11 Correct 6 ms 5368 KB Output is correct
12 Correct 73 ms 10872 KB Output is correct
13 Correct 74 ms 10872 KB Output is correct
14 Correct 73 ms 10892 KB Output is correct
15 Correct 76 ms 10972 KB Output is correct
16 Correct 73 ms 10744 KB Output is correct
17 Correct 73 ms 10204 KB Output is correct
18 Correct 73 ms 10872 KB Output is correct
19 Correct 72 ms 10864 KB Output is correct
20 Correct 6 ms 5368 KB Output is correct
21 Correct 6 ms 5496 KB Output is correct
22 Correct 8 ms 5624 KB Output is correct
23 Correct 73 ms 10872 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 15476 KB Output is correct
2 Correct 105 ms 15324 KB Output is correct
3 Correct 54 ms 13044 KB Output is correct
4 Correct 16 ms 6904 KB Output is correct
5 Correct 14 ms 6392 KB Output is correct
6 Correct 24 ms 7672 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 41 ms 9592 KB Output is correct
9 Correct 52 ms 11512 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 75 ms 12896 KB Output is correct
12 Correct 88 ms 14188 KB Output is correct
13 Correct 7 ms 5500 KB Output is correct
14 Correct 7 ms 5496 KB Output is correct
15 Correct 8 ms 5624 KB Output is correct
16 Correct 9 ms 5624 KB Output is correct
17 Correct 7 ms 5496 KB Output is correct
18 Correct 8 ms 5624 KB Output is correct
19 Correct 9 ms 5748 KB Output is correct
20 Correct 7 ms 5496 KB Output is correct
21 Correct 8 ms 5624 KB Output is correct
22 Correct 8 ms 5756 KB Output is correct
23 Correct 6 ms 5440 KB Output is correct
24 Correct 7 ms 5368 KB Output is correct
25 Correct 6 ms 5496 KB Output is correct
26 Correct 6 ms 5496 KB Output is correct
27 Correct 6 ms 5496 KB Output is correct
28 Correct 6 ms 5496 KB Output is correct
29 Correct 8 ms 5496 KB Output is correct
30 Correct 8 ms 5368 KB Output is correct
31 Correct 8 ms 5496 KB Output is correct
32 Correct 6 ms 5496 KB Output is correct
33 Correct 6 ms 5372 KB Output is correct
34 Correct 6 ms 5368 KB Output is correct
35 Correct 7 ms 5396 KB Output is correct
36 Correct 7 ms 5368 KB Output is correct
37 Correct 7 ms 5496 KB Output is correct
38 Correct 6 ms 5496 KB Output is correct
39 Correct 7 ms 5496 KB Output is correct
40 Correct 6 ms 5368 KB Output is correct
41 Correct 6 ms 5368 KB Output is correct
42 Correct 10 ms 5752 KB Output is correct
43 Correct 10 ms 5752 KB Output is correct
44 Correct 8 ms 5628 KB Output is correct
45 Correct 9 ms 5624 KB Output is correct
46 Correct 9 ms 5752 KB Output is correct
47 Correct 9 ms 5624 KB Output is correct
48 Correct 9 ms 5624 KB Output is correct
49 Correct 9 ms 5624 KB Output is correct
50 Correct 9 ms 5684 KB Output is correct
51 Correct 9 ms 5752 KB Output is correct
52 Correct 9 ms 5624 KB Output is correct
53 Correct 8 ms 5624 KB Output is correct
54 Correct 9 ms 5624 KB Output is correct
55 Correct 8 ms 5752 KB Output is correct
56 Correct 11 ms 5624 KB Output is correct
57 Correct 9 ms 5624 KB Output is correct
58 Correct 9 ms 5624 KB Output is correct
59 Correct 8 ms 5624 KB Output is correct
60 Correct 8 ms 5752 KB Output is correct
61 Correct 9 ms 5752 KB Output is correct
62 Correct 8 ms 5624 KB Output is correct
63 Correct 8 ms 5624 KB Output is correct
64 Correct 9 ms 5624 KB Output is correct
65 Correct 8 ms 5752 KB Output is correct
66 Correct 10 ms 5624 KB Output is correct
67 Correct 9 ms 5624 KB Output is correct
68 Correct 9 ms 5624 KB Output is correct
69 Correct 9 ms 5624 KB Output is correct
70 Correct 9 ms 5716 KB Output is correct
71 Correct 9 ms 5756 KB Output is correct
72 Correct 9 ms 5624 KB Output is correct
73 Correct 10 ms 5624 KB Output is correct
74 Correct 9 ms 5624 KB Output is correct
75 Correct 9 ms 5752 KB Output is correct
76 Correct 9 ms 5624 KB Output is correct
77 Correct 9 ms 5756 KB Output is correct
78 Correct 11 ms 5624 KB Output is correct
79 Correct 9 ms 5624 KB Output is correct
80 Correct 8 ms 5624 KB Output is correct
81 Correct 8 ms 5624 KB Output is correct
82 Correct 8 ms 5624 KB Output is correct
83 Correct 10 ms 5752 KB Output is correct
84 Correct 8 ms 5624 KB Output is correct
85 Correct 8 ms 5624 KB Output is correct
86 Correct 10 ms 5624 KB Output is correct
87 Correct 8 ms 5624 KB Output is correct
88 Correct 9 ms 5652 KB Output is correct
89 Correct 8 ms 5624 KB Output is correct
90 Correct 6 ms 5368 KB Output is correct
91 Incorrect 6 ms 5496 KB Output isn't correct
92 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 15476 KB Output is correct
2 Correct 105 ms 15324 KB Output is correct
3 Correct 54 ms 13044 KB Output is correct
4 Correct 16 ms 6904 KB Output is correct
5 Correct 14 ms 6392 KB Output is correct
6 Correct 24 ms 7672 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 41 ms 9592 KB Output is correct
9 Correct 52 ms 11512 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 75 ms 12896 KB Output is correct
12 Correct 88 ms 14188 KB Output is correct
13 Correct 7 ms 5500 KB Output is correct
14 Correct 7 ms 5368 KB Output is correct
15 Correct 6 ms 5496 KB Output is correct
16 Correct 6 ms 5496 KB Output is correct
17 Correct 7 ms 5496 KB Output is correct
18 Correct 7 ms 5496 KB Output is correct
19 Correct 7 ms 5496 KB Output is correct
20 Correct 6 ms 5368 KB Output is correct
21 Correct 6 ms 5368 KB Output is correct
22 Correct 6 ms 5368 KB Output is correct
23 Correct 6 ms 5368 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5368 KB Output is correct
26 Correct 6 ms 5496 KB Output is correct
27 Correct 6 ms 5496 KB Output is correct
28 Correct 7 ms 5368 KB Output is correct
29 Correct 6 ms 5496 KB Output is correct
30 Incorrect 7 ms 5496 KB Output isn't correct
31 Halted 0 ms 0 KB -