oj.uz

답안 #672946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
672946 2022-12-19T04:35:57 Z vuavisao Hotspot (NOI17_hotspot) C++14
100 / 100
 843 ms 1260 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
using namespace std;

template<typename Lhs, typename Rhs> inline bool Max_self(Lhs &a, Rhs b) { if(b > a) { a = b; return true; } return false; }
template<typename Lhs, typename Rhs> inline bool Min_self(Lhs &a, Rhs b) { if(b < a) { a = b; return true; } return false; }

const int N = 5e3 + 10;
const int INF = 1e9;

int n, m, q;
vector<int> g[N];

int dist[2][N];
ld cnt[2][N];
ld res[N];

void Dijkstra(int u, int* dist, ld* cnt);
void Dijkstra(int u, int* dist, ld* cnt) {
    for(int i = 1; i <= n; ++ i) {
        dist[i] = INF;
        cnt[i] = 0;
    }
    dist[u] = 0; cnt[u] = 1;
    queue<int> q = {};
    q.push(u);
    while(!q.empty()) {
        int u = q.front(); q.pop();
        for(const auto& v : g[u]) {
            if(Min_self(dist[v], dist[u] + 1)) {
                cnt[v] = cnt[u];
                q.push(v);
            }
            else if(dist[v] == dist[u] + 1) {
                cnt[v] += cnt[u];
            }
        }
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen("NOI17_hotspot.inp", "r")) {
        freopen("NOI17_hotspot.inp", "r", stdin);
        freopen("NOI17_hotspot.out", "w", stdout);
    }
    cin >> n >> m;
    for(int i = 1; i <= m; ++ i) {
        int u, v; cin >> u >> v;
        ++ u; ++ v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    cin >> q;
    while(q--) {
        int u, v; cin >> u >> v; ++ u; ++ v;
        Dijkstra(u, dist[0], cnt[0]);
        Dijkstra(v, dist[1], cnt[1]);
        for(int i = 1; i <= n; ++ i) {
//            cout << dist[0][i] << ' ' << dist[1][i] << '\n';
            if(dist[0][i] + dist[1][i] == dist[0][v]) {
                res[i] += cnt[0][i] * cnt[1][i] / cnt[0][v];
            }
        }
    }
    cout << max_element(res + 1, res + 1 + n) - res - 1;
    return 0;
}

/// Code by vuavisao

Compilation message

hotspot.cpp: In function 'int32_t main()':
hotspot.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen("NOI17_hotspot.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hotspot.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen("NOI17_hotspot.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 4 ms 528 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 4 ms 528 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 408 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 4 ms 452 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 5 ms 596 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 468 KB Output is correct

Subtask #6
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 4 ms 528 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 408 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 4 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 4 ms 452 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 5 ms 596 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 68 ms 712 KB Output is correct
37 Correct 167 ms 852 KB Output is correct
38 Correct 843 ms 1252 KB Output is correct
39 Correct 531 ms 1200 KB Output is correct
40 Correct 84 ms 876 KB Output is correct
41 Correct 520 ms 1260 KB Output is correct
42 Correct 624 ms 1252 KB Output is correct
43 Correct 47 ms 728 KB Output is correct
44 Correct 34 ms 720 KB Output is correct