oj.uz

Submission #1074169

# Submission time Handle Problem Language Result Execution time Memory
1074169 2024-08-25T08:32:56 Z Trumling Dreaming (IOI13_dreaming) C++14
14 / 100
 46 ms 15828 KB 
//Dedicated to my love, ivaziva 
#include <bits/stdc++.h> 
#include "dreaming.h"
using namespace std; 
 
using pii = pair<int, int>;
using ll = int64_t;
 
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define dbg(x) cerr << #x << ": " << x << '\n';
 
constexpr int mxN = 1e5 + 20;
vector<pii> g[mxN]; 
int dist1[mxN], dist2[mxN], par[mxN];  
bool vis[mxN];
vector<int> vec, dijametar;
 
void dfs(int x, int p) {  
    vis[x] = true;   
    vec.push_back(x);  
    for (auto ptr: g[x]) {
        if (ptr.first != p) {  
            dist1[ptr.first] = dist1[x] + ptr.second;
            dfs(ptr.first, x);  
        }
    }
}  
void dfs2(int x, int p) {   
    par[x] = p;
    for (auto ptr: g[x]) {
        if (ptr.first != p) {  
            dist2[ptr.first] = dist2[x] + ptr.second;
            dfs2(ptr.first, x);  
        }
    }
}  
 
int travelTime(int N, int M, int L, int* A, int* B, int* T) {
    for (int i = 0; i < M; i++) {
        g[A[i]].push_back({B[i], T[i]});
        g[B[i]].push_back({A[i], T[i]});
    } 
    for (int i = 0; i < N; i++) {
        dist1[i] = 0, dist2[i] = 0;
        vis[i] = false;
    }
    vector<int> diams, anss;
    for (int i = 0; i < N; i++) {
        if (!vis[i] && g[i].size()==1) { 
            dijametar.clear();
            vec.clear(); 
            dfs(i, -1); 
            int mx = 0, root = 0; 
            for (int x: vec) { 
                if (mx < dist1[x]) {
                    root = x;
                    mx = dist1[x];
                }
            }  
            dfs2(i, -1);
            int diamend = 0;
            mx = 0; 
            for (int x: vec) {
                if (mx < dist2[x]) {
                    mx = dist2[x];
                    diamend = x;
                }
            }    
            diams.push_back(mx);
            while (diamend != -1) {  
                dijametar.push_back(diamend); 
                diamend = par[diamend];
            }  
            int diff = (int)(2e9), cen = 0, krc = 0;
            for (int x: dijametar) {
                if (diff > abs(dist2[x] - (mx - dist2[x]) )) {
                    diff = abs(dist2[x] - (mx - dist2[x]) );
                    cen = x;
                    krc = dist2[x];
                }
            }
            anss.push_back(max(krc, mx - krc));
        } 
    }     
    int ans = max(diams[0], diams[1]);
    ans = max(ans, anss[0] + anss[1] + L); 
    return ans;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:54:25: warning: variable 'root' set but not used [-Wunused-but-set-variable]
   54 |             int mx = 0, root = 0;
      |                         ^~~~
dreaming.cpp:75:36: warning: variable 'cen' set but not used [-Wunused-but-set-variable]
   75 |             int diff = (int)(2e9), cen = 0, krc = 0;
      |                                    ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 15828 KB Output is correct
2 Correct 46 ms 15824 KB Output is correct
3 Correct 43 ms 11344 KB Output is correct
4 Correct 6 ms 4700 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 12 ms 5724 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 29 ms 7368 KB Output is correct
9 Correct 24 ms 9448 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 32 ms 11448 KB Output is correct
12 Correct 41 ms 13412 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 15828 KB Output is correct
2 Correct 46 ms 15824 KB Output is correct
3 Correct 43 ms 11344 KB Output is correct
4 Correct 6 ms 4700 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 12 ms 5724 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 29 ms 7368 KB Output is correct
9 Correct 24 ms 9448 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 32 ms 11448 KB Output is correct
12 Correct 41 ms 13412 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct
14 Incorrect 3 ms 2652 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 7000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 15828 KB Output is correct
2 Correct 46 ms 15824 KB Output is correct
3 Correct 43 ms 11344 KB Output is correct
4 Correct 6 ms 4700 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 12 ms 5724 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 29 ms 7368 KB Output is correct
9 Correct 24 ms 9448 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 32 ms 11448 KB Output is correct
12 Correct 41 ms 13412 KB Output is correct
13 Correct 3 ms 2908 KB Output is correct
14 Incorrect 3 ms 2652 KB Output isn't correct
15 Halted 0 ms 0 KB -