oj.uz

Submission #142834

# Submission time Handle Problem Language Result Execution time Memory
142834 2019-08-11T11:47:55 Z Milki Dreaming (IOI13_dreaming) C++14
24 / 100
 127 ms 14324 KB 
#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], mx[MAXN];
point par[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] = d;

    int sum = 0;
    while(dep[a] != dep[b]){
      sum += par[a].second;
      a = par[a].first;
      mx[i] = min(mx[i], max(d - sum, sum));
    }
    while(a != b){
      sum += par[a].second;
      mx[i] = min(mx[i], max(d - sum, sum));
      sum -= par[a].second;

      sum += par[b].second;
      mx[i] = min(mx[i], max(d - sum, sum));
      sum -= par[b].second;

      sum += par[a].second;
      sum += par[b].second;
      a = par[a].first;
      b = par[b].first;

      mx[i] = min(mx[i], max(d - sum, sum));
    }
  }

  sort(mx, mx + Time, greater<int>());

  if(Time == 1){
    assert(false);
    return ret;
  }
  else
    return max(ret, mx[0] + mx[1] + L);
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13936 KB Output is correct
2 Correct 82 ms 13684 KB Output is correct
3 Correct 55 ms 12020 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 7544 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 39 ms 9228 KB Output is correct
9 Correct 48 ms 10804 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 73 ms 11732 KB Output is correct
12 Correct 85 ms 12784 KB Output is correct
13 Correct 7 ms 5496 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13936 KB Output is correct
2 Correct 82 ms 13684 KB Output is correct
3 Correct 55 ms 12020 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 7544 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 39 ms 9228 KB Output is correct
9 Correct 48 ms 10804 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 73 ms 11732 KB Output is correct
12 Correct 85 ms 12784 KB Output is correct
13 Correct 7 ms 5496 KB Output is correct
14 Correct 7 ms 5496 KB Output is correct
15 Correct 7 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 6 ms 5368 KB Output is correct
19 Correct 6 ms 5368 KB Output is correct
20 Correct 7 ms 5496 KB Output is correct
21 Correct 7 ms 5368 KB Output is correct
22 Correct 7 ms 5496 KB Output is correct
23 Correct 6 ms 5496 KB Output is correct
24 Correct 7 ms 5368 KB Output is correct
25 Correct 6 ms 5496 KB Output is correct
26 Correct 7 ms 5368 KB Output is correct
27 Correct 7 ms 5496 KB Output is correct
28 Correct 7 ms 5496 KB Output is correct
29 Correct 7 ms 5496 KB Output is correct
30 Correct 8 ms 5496 KB Output is correct
31 Correct 7 ms 5496 KB Output is correct
32 Correct 7 ms 5496 KB Output is correct
33 Correct 7 ms 5444 KB Output is correct
34 Correct 7 ms 5496 KB Output is correct
35 Correct 7 ms 5368 KB Output is correct
36 Correct 8 ms 5436 KB Output is correct
37 Correct 7 ms 5496 KB Output is correct
38 Correct 7 ms 5496 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13936 KB Output is correct
2 Correct 82 ms 13684 KB Output is correct
3 Correct 55 ms 12020 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 7544 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 39 ms 9228 KB Output is correct
9 Correct 48 ms 10804 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 73 ms 11732 KB Output is correct
12 Correct 85 ms 12784 KB Output is correct
13 Correct 7 ms 5496 KB Output is correct
14 Correct 7 ms 5496 KB Output is correct
15 Correct 7 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 6 ms 5368 KB Output is correct
19 Correct 6 ms 5368 KB Output is correct
20 Correct 7 ms 5496 KB Output is correct
21 Correct 7 ms 5368 KB Output is correct
22 Correct 7 ms 5496 KB Output is correct
23 Correct 6 ms 5496 KB Output is correct
24 Correct 7 ms 5368 KB Output is correct
25 Correct 6 ms 5496 KB Output is correct
26 Correct 7 ms 5368 KB Output is correct
27 Correct 7 ms 5496 KB Output is correct
28 Correct 7 ms 5496 KB Output is correct
29 Correct 7 ms 5496 KB Output is correct
30 Correct 8 ms 5496 KB Output is correct
31 Correct 7 ms 5496 KB Output is correct
32 Correct 7 ms 5496 KB Output is correct
33 Correct 7 ms 5444 KB Output is correct
34 Correct 7 ms 5496 KB Output is correct
35 Correct 7 ms 5368 KB Output is correct
36 Correct 8 ms 5436 KB Output is correct
37 Correct 7 ms 5496 KB Output is correct
38 Correct 7 ms 5496 KB Output is correct
39 Correct 83 ms 14324 KB Output is correct
40 Correct 76 ms 13844 KB Output is correct
41 Correct 52 ms 12020 KB Output is correct
42 Correct 16 ms 6904 KB Output is correct
43 Correct 7 ms 5468 KB Output is correct
44 Correct 7 ms 5496 KB Output is correct
45 Correct 7 ms 5368 KB Output is correct
46 Correct 7 ms 5368 KB Output is correct
47 Correct 7 ms 5496 KB Output is correct
48 Correct 7 ms 5496 KB Output is correct
49 Correct 7 ms 5368 KB Output is correct
50 Correct 7 ms 5504 KB Output is correct
51 Correct 7 ms 5372 KB Output is correct
52 Correct 7 ms 5368 KB Output is correct
53 Correct 7 ms 5496 KB Output is correct
54 Correct 7 ms 5496 KB Output is correct
55 Correct 7 ms 5496 KB Output is correct
56 Correct 7 ms 5496 KB Output is correct
57 Correct 127 ms 13196 KB Output is correct
58 Correct 99 ms 13216 KB Output is correct
59 Correct 93 ms 13168 KB Output is correct
60 Correct 94 ms 13044 KB Output is correct
61 Correct 95 ms 13012 KB Output is correct
62 Correct 97 ms 13048 KB Output is correct
63 Correct 86 ms 12916 KB Output is correct
64 Incorrect 89 ms 12920 KB Output isn't correct
65 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 11860 KB Output is correct
2 Incorrect 73 ms 11896 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13936 KB Output is correct
2 Correct 82 ms 13684 KB Output is correct
3 Correct 55 ms 12020 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 7544 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 39 ms 9228 KB Output is correct
9 Correct 48 ms 10804 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 73 ms 11732 KB Output is correct
12 Correct 85 ms 12784 KB Output is correct
13 Correct 7 ms 5496 KB Output is correct
14 Correct 7 ms 5496 KB Output is correct
15 Correct 8 ms 5624 KB Output is correct
16 Correct 10 ms 5752 KB Output is correct
17 Correct 7 ms 5496 KB Output is correct
18 Correct 9 ms 5624 KB Output is correct
19 Correct 9 ms 5752 KB Output is correct
20 Incorrect 7 ms 5496 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 13936 KB Output is correct
2 Correct 82 ms 13684 KB Output is correct
3 Correct 55 ms 12020 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 7544 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 39 ms 9228 KB Output is correct
9 Correct 48 ms 10804 KB Output is correct
10 Correct 7 ms 5496 KB Output is correct
11 Correct 73 ms 11732 KB Output is correct
12 Correct 85 ms 12784 KB Output is correct
13 Correct 7 ms 5496 KB Output is correct
14 Correct 7 ms 5496 KB Output is correct
15 Correct 7 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 6 ms 5368 KB Output is correct
19 Correct 6 ms 5368 KB Output is correct
20 Correct 7 ms 5496 KB Output is correct
21 Correct 7 ms 5368 KB Output is correct
22 Correct 7 ms 5496 KB Output is correct
23 Correct 6 ms 5496 KB Output is correct
24 Correct 7 ms 5368 KB Output is correct
25 Correct 6 ms 5496 KB Output is correct
26 Correct 7 ms 5368 KB Output is correct
27 Correct 7 ms 5496 KB Output is correct
28 Correct 7 ms 5496 KB Output is correct
29 Correct 7 ms 5496 KB Output is correct
30 Correct 8 ms 5496 KB Output is correct
31 Correct 7 ms 5496 KB Output is correct
32 Correct 7 ms 5496 KB Output is correct
33 Correct 7 ms 5444 KB Output is correct
34 Correct 7 ms 5496 KB Output is correct
35 Correct 7 ms 5368 KB Output is correct
36 Correct 8 ms 5436 KB Output is correct
37 Correct 7 ms 5496 KB Output is correct
38 Correct 7 ms 5496 KB Output is correct
39 Correct 83 ms 14324 KB Output is correct
40 Correct 76 ms 13844 KB Output is correct
41 Correct 52 ms 12020 KB Output is correct
42 Correct 16 ms 6904 KB Output is correct
43 Correct 7 ms 5468 KB Output is correct
44 Correct 7 ms 5496 KB Output is correct
45 Correct 7 ms 5368 KB Output is correct
46 Correct 7 ms 5368 KB Output is correct
47 Correct 7 ms 5496 KB Output is correct
48 Correct 7 ms 5496 KB Output is correct
49 Correct 7 ms 5368 KB Output is correct
50 Correct 7 ms 5504 KB Output is correct
51 Correct 7 ms 5372 KB Output is correct
52 Correct 7 ms 5368 KB Output is correct
53 Correct 7 ms 5496 KB Output is correct
54 Correct 7 ms 5496 KB Output is correct
55 Correct 7 ms 5496 KB Output is correct
56 Correct 7 ms 5496 KB Output is correct
57 Correct 127 ms 13196 KB Output is correct
58 Correct 99 ms 13216 KB Output is correct
59 Correct 93 ms 13168 KB Output is correct
60 Correct 94 ms 13044 KB Output is correct
61 Correct 95 ms 13012 KB Output is correct
62 Correct 97 ms 13048 KB Output is correct
63 Correct 86 ms 12916 KB Output is correct
64 Incorrect 89 ms 12920 KB Output isn't correct
65 Halted 0 ms 0 KB -