oj.uz

답안 #745730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745730 2023-05-21T05:46:37 Z yeyso 꿈 (IOI13_dreaming) C++14
14 / 100
 149 ms 39628 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj; vector<vector<int>> dmj; vector<int> dist; vector<int> dist2; vector<set<pair<int, int>>> components; vector<set<pair<int, int>>> components2;
void dfs(int node, int parent, int distance, int component, int mode){
    if(mode == 0) components[component].insert({distance, node});
    if(mode == 1) components2[component].insert({distance, node});
    dist[node] = distance;
    for(int i = 0; i < adj[node].size(); i ++){
        if(adj[node][i] != parent){
            dfs(adj[node][i], node, distance + dmj[node][i], component, mode);
        }
    }
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    vector<vector<int>> adj0(N, vector<int>()); vector<vector<int>> dmj0(N, vector<int>());
    for(int i = 0; i < M; i ++){
        adj0[A[i]].push_back(B[i]); adj0[B[i]].push_back(A[i]);
        dmj0[A[i]].push_back(T[i]); dmj0[B[i]].push_back(T[i]);
    }
    vector<int> dist0(N, INT_MAX / 2);
    adj = adj0; dmj = dmj0; dist = dist0; dist2 = dist0;
    int component_ = 0;
    for(int i = 0; i < N; i ++){
        if(dist[i] >= INT_MAX / 2){
            components.push_back({}); components2.push_back({});
            dist[i] = 0;
            dfs(i, -1, 0, component_, 0);
            component_ += 1;
        }
    }
    for(int i = 0; i < components.size(); i ++){
        //cout << (*(--components[i].end())).second << " ";
        dfs((*(--components[i].end())).second, -1, 0, i, 1);
    } //cout << "\n";
    int furtherest = 0; int mid = 0; int mid2 = 0; int split = 0;
    set<pair<int, int>> components3;
    for(int i = 0; i < components2.size(); i ++){
        furtherest = (*(--components2[i].end())).first;
        mid = (*(components2[i].lower_bound({furtherest / 2, 0}))).first;
        mid2 = (*(--components2[i].lower_bound({furtherest / 2, 0}))).first;
        if(abs(furtherest - mid) > abs(furtherest - mid2)){ split = mid2;
        } else { split = mid; }
        if(split > furtherest / 2) components3.insert({split, furtherest - split}); 
        if(split <= furtherest / 2) components3.insert({furtherest - split, split});
    }
    int maxacross = (*(--components3.end())).first + (*(----components3.end())).first + L;
    int maxwithin = (*(--components3.end())).first + (*(--components3.end())).second;
    return max(maxacross, maxwithin);
}
/*
g++ -DEVAL -static -O2 -o dreaming grader.cpp dreaming.cpp

12 8 2
0 8 4
8 2 2
2 7 4
5 11 3
5 1 7
1 3 1
1 9 5
10 6 3

*/

Compilation message

dreaming.cpp: In function 'void dfs(int, int, int, int, int)':
dreaming.cpp:9:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i = 0; i < adj[node].size(); i ++){
      |                    ~~^~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i = 0; i < components.size(); i ++){
      |                    ~~^~~~~~~~~~~~~~~~~~~
dreaming.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i = 0; i < components2.size(); i ++){
      |                    ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 39628 KB Output is correct
2 Correct 149 ms 39564 KB Output is correct
3 Correct 87 ms 26056 KB Output is correct
4 Correct 14 ms 6100 KB Output is correct
5 Correct 11 ms 4220 KB Output is correct
6 Correct 25 ms 9052 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 48 ms 16152 KB Output is correct
9 Correct 71 ms 20960 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 104 ms 28448 KB Output is correct
12 Correct 130 ms 33796 KB Output is correct
13 Correct 1 ms 596 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 39628 KB Output is correct
2 Correct 149 ms 39564 KB Output is correct
3 Correct 87 ms 26056 KB Output is correct
4 Correct 14 ms 6100 KB Output is correct
5 Correct 11 ms 4220 KB Output is correct
6 Correct 25 ms 9052 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 48 ms 16152 KB Output is correct
9 Correct 71 ms 20960 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 104 ms 28448 KB Output is correct
12 Correct 130 ms 33796 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 39628 KB Output is correct
2 Correct 149 ms 39564 KB Output is correct
3 Correct 87 ms 26056 KB Output is correct
4 Correct 14 ms 6100 KB Output is correct
5 Correct 11 ms 4220 KB Output is correct
6 Correct 25 ms 9052 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 48 ms 16152 KB Output is correct
9 Correct 71 ms 20960 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 104 ms 28448 KB Output is correct
12 Correct 130 ms 33796 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Halted 0 ms 0 KB -