oj.uz

Submission #575777

# Submission time Handle Problem Language Result Execution time Memory
575777 2022-06-11T09:06:56 Z Mazaalai Dreaming (IOI13_dreaming) C++17
0 / 100
 60 ms 24780 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ALL(x) x.begin(),x.end()
using namespace std;
using VI = vector <int>;
using PII = pair <int, int>;
const int N = 1e5+5;
vector <PII> paths[N];
bool vis[N];
int n, m, L, sizes[N], len;
PII dp[N];
 
PII getFarthest(int pos, int par = 0) {
    dp[pos] = {0, pos};
    for (auto [a, b] : paths[pos]) {
        if (a == par) continue;
        PII tmp = getFarthest(a, pos);
        if (dp[pos].ff < tmp.ff + b) dp[pos] = {tmp.ff + b, tmp.ss};
    }
    return dp[pos];
}
int getSizes(int pos, int par = 0) {
    vis[pos] = 1;
    for (auto [a, b] : paths[pos]) {
        if (a == par) continue;
        sizes[pos] = max(sizes[pos], b + getSizes(a, pos));
    }
    return sizes[pos];
}
VI findCentroid(int pos, int par = 0, int pre = 0) {
    int suf = len - pre;
    VI res = {pos, pre, suf};
    for (auto [a, b] : paths[pos]) {
        if (a == par) continue;
        VI tmp = findCentroid(a, pos, pre+b);
        if (max(pre, suf) > max(tmp[1], tmp[2])) res = tmp;
    }
    return res;
}
VI getCentroid(int pos) {
    len = getSizes(pos);
    return findCentroid(pos);
}
int travelTime(int _N, int _M, int _L, int _A[], int _B[], int _T[]) {
    n = _N;
    m = _M;
    L = _L;
    vector <int> pts = {-1, -1, -1, -1};
    for (int i = 0; i < _M; i++) {
        // paths[_A[i]].pb({_B[i], _T[i]});
        // paths[_B[i]].pb({_A[i], _T[i]});
        paths[_A[i]+1].pb({_B[i]+1, _T[i]});
        paths[_B[i]+1].pb({_A[i]+1, _T[i]});
    }
    int res = 0, maxOnePoint = 0;
    for (int i = 1; i <= n; i++) {
        if (vis[i]) continue;
        PII tmp = getFarthest(i);
        VI point = getCentroid(tmp.ss);
        if (point[1] < point[2]) swap(point[1], point[2]);
         // cout << '\t';for (int i = 0; i < 3; i++) cout << point[i] << " \n"[i==2];
        pts[0] = (max(point[1], point[2]));
        maxOnePoint = max(maxOnePoint, point[1]+point[2]);
        sort(ALL(pts));
        // cout << i-1 << ": " << point[0]-1 << ' ' << point[1] << ' ' << point[2] << '\n';
        // cout << i << ": " << point[0] << ' ' << point[1] << ' ' << point[2] << '\n';
    }
    if (pts[1] > -1) res = max(res, pts[2] + pts[3] + L);
    if (pts[0] > -1) res = max(res, pts[1] + pts[2] + 2*L);
 
    res = max(res, maxOnePoint);
    return res;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 24780 KB Output is correct
2 Correct 60 ms 24752 KB Output is correct
3 Correct 35 ms 17176 KB Output is correct
4 Correct 8 ms 5844 KB Output is correct
5 Correct 7 ms 4180 KB Output is correct
6 Correct 13 ms 7508 KB Output is correct
7 Incorrect 1 ms 2644 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 24780 KB Output is correct
2 Correct 60 ms 24752 KB Output is correct
3 Correct 35 ms 17176 KB Output is correct
4 Correct 8 ms 5844 KB Output is correct
5 Correct 7 ms 4180 KB Output is correct
6 Correct 13 ms 7508 KB Output is correct
7 Incorrect 1 ms 2644 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 6188 KB Output is correct
2 Correct 20 ms 6188 KB Output is correct
3 Correct 21 ms 6588 KB Output is correct
4 Correct 20 ms 6604 KB Output is correct
5 Correct 24 ms 6572 KB Output is correct
6 Correct 25 ms 6772 KB Output is correct
7 Correct 22 ms 6764 KB Output is correct
8 Correct 19 ms 6484 KB Output is correct
9 Correct 20 ms 6384 KB Output is correct
10 Correct 20 ms 6740 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 6 ms 3796 KB Output is correct
13 Correct 6 ms 3940 KB Output is correct
14 Correct 6 ms 3864 KB Output is correct
15 Correct 7 ms 3812 KB Output is correct
16 Correct 6 ms 3816 KB Output is correct
17 Correct 6 ms 3640 KB Output is correct
18 Correct 7 ms 3924 KB Output is correct
19 Correct 6 ms 3796 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Incorrect 2 ms 2644 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 24780 KB Output is correct
2 Correct 60 ms 24752 KB Output is correct
3 Correct 35 ms 17176 KB Output is correct
4 Correct 8 ms 5844 KB Output is correct
5 Correct 7 ms 4180 KB Output is correct
6 Correct 13 ms 7508 KB Output is correct
7 Incorrect 1 ms 2644 KB Output isn't correct
8 Halted 0 ms 0 KB -