oj.uz

답안 #356277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
356277 2021-01-23T08:58:47 Z sean617 꿈 (IOI13_dreaming) C++14
0 / 100
 84 ms 18924 KB 
#include "dreaming.h"
#include <iostream>
#include <cstdio>
#include <vector>
#define SZ 100005
using namespace std;

int MM = 2e9;
int n, m, mx, po, cnt, mn, md, ans, m1, m2, m3, v[SZ];
vector<int> a[SZ], b[SZ], c;
void f(int p, int q, int w) {
    int i, t;
    if (w > mx) {
        mx = w;
        po = p;
    }
    v[p] = cnt;
    for (i = 0; i < a[p].size(); i++) {
        t = a[p][i];
        if (t == q) continue;
        f(t, p, w + b[p][i]);
    }
}

int g(int p, int q, int w) {
    int i, t, t2;
    if (p == c[1]) return 1;
    for (i = 0; i < a[p].size(); i++) {
        t = a[p][i];
        if (t == q) continue;
        if (g(t, p, w + b[p][i])) {
            t2 = max(w, mx - w);
            mn = min(mn, t2);
            return 1;
        }
    }
    return 0;
}


int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    int i, j, t1, t2, t3;
    n = N;
    m = M;
    for (i = 0; i < m; i++) {
//        scanf ("%d %d %d", &t1, &t2, &t3);
        t1 = A[i];
        t2 = B[i];
        t3 = T[i];
        a[t1].push_back(t2);
        a[t2].push_back(t1);
        b[t1].push_back(t3);
        b[t2].push_back(t3);
    }
    for (i = 0; i < n; i++) {
        if (v[i]) continue;
        cnt++;
        mx = -1;
        c.clear();
        f(i, 0, 0);
        c.push_back(po);
        mx = -1;
        f(po, 0, 0);
        ans = max(ans, mx);
        c.push_back(po);
        if (mx == 0) {
            continue;
        }
        mn = MM;
        g(c[0], 0, 0);
        if (mn > m1) {
            m3 = m2;
            m2 = m1;
            m1 = mn;
        } else if (mn > m2) {
            m3 = m2;
            m2 = mn;
        } else if (mn > m3) {
            m3 = mn;
        }
//        printf("%d %d\n", c[0], c[1]);
    }
    if (m == n - 1) {
        cout << ans;
        return 0;
    }
    ans = max(ans, m1 + m2 + L);
    ans = max(ans, m2 + m3 + L * 2);
    return ans;
}

Compilation message

dreaming.cpp: In function 'void f(int, int, int)':
dreaming.cpp:18:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (i = 0; i < a[p].size(); i++) {
      |                 ~~^~~~~~~~~~~~~
dreaming.cpp: In function 'int g(int, int, int)':
dreaming.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (i = 0; i < a[p].size(); i++) {
      |                 ~~^~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:42:12: warning: unused variable 'j' [-Wunused-variable]
   42 |     int i, j, t1, t2, t3;
      |            ^

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 18924 KB Output is correct
2 Correct 84 ms 18924 KB Output is correct
3 Correct 58 ms 14444 KB Output is correct
4 Correct 14 ms 7148 KB Output is correct
5 Correct 11 ms 6252 KB Output is correct
6 Correct 19 ms 8172 KB Output is correct
7 Incorrect 4 ms 5100 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Incorrect 4 ms 5100 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 18924 KB Output is correct
2 Correct 84 ms 18924 KB Output is correct
3 Correct 58 ms 14444 KB Output is correct
4 Correct 14 ms 7148 KB Output is correct
5 Correct 11 ms 6252 KB Output is correct
6 Correct 19 ms 8172 KB Output is correct
7 Incorrect 4 ms 5100 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 10092 KB Output is correct
2 Correct 36 ms 10092 KB Output is correct
3 Correct 43 ms 10092 KB Output is correct
4 Correct 39 ms 10092 KB Output is correct
5 Correct 36 ms 10092 KB Output is correct
6 Correct 42 ms 10348 KB Output is correct
7 Correct 51 ms 10348 KB Output is correct
8 Correct 38 ms 9964 KB Output is correct
9 Correct 35 ms 9964 KB Output is correct
10 Correct 39 ms 10220 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 6 ms 5484 KB Output is correct
13 Correct 6 ms 5484 KB Output is correct
14 Correct 7 ms 5484 KB Output is correct
15 Correct 6 ms 5484 KB Output is correct
16 Correct 7 ms 5484 KB Output is correct
17 Correct 6 ms 5484 KB Output is correct
18 Correct 6 ms 5484 KB Output is correct
19 Correct 6 ms 5484 KB Output is correct
20 Incorrect 4 ms 4972 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Incorrect 4 ms 5100 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 18924 KB Output is correct
2 Correct 84 ms 18924 KB Output is correct
3 Correct 58 ms 14444 KB Output is correct
4 Correct 14 ms 7148 KB Output is correct
5 Correct 11 ms 6252 KB Output is correct
6 Correct 19 ms 8172 KB Output is correct
7 Incorrect 4 ms 5100 KB Output isn't correct
8 Halted 0 ms 0 KB -