oj.uz

답안 #1105375

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105375 2024-10-26T08:54:03 Z monaxia Hotspot (NOI17_hotspot) C++17
64 / 100
 368 ms 524288 KB 
// credit: Mai Hong Kien
 
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fr first
#define sc second
#define all(v) v.begin(), v.end()
#define mod (long long)(1e9 + 7)
#define eps (long long)(1e-9)
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ll LIMIT = 2e3 + 5;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll random (ll l, ll r){return uniform_int_distribution <ll> (l, r)(rng);}
 
 
void solve(){
    ll n, m;
    long double mx = 0, res = 0;
    cin >> n >> m;
 
    vector <vector <ll>> graph(n + 1), dist(n + 1, vector <ll> (n + 1, INT_MAX)), path(n + 1, vector <ll> (m + 1, 0));
    vector <long double> e(n + 1, 0);
    vector <pair <ll, ll>> range;
 
    for(ll i = 1; i <= m; i ++){
        ll u, v;
        cin >> u >> v;
 
        graph[u].pb(v);
        graph[v].pb(u);
    }
 
    for(ll i = 0; i < n; i ++){
        dist[i][i] = 0;
        path[i][i] = 1;
 
        vector <ll> v(n + 1, 0);
        queue <ll> q;
 
        q.push(i);
 
        while(!q.empty()){
            ll s = q.front();
            for(auto& x : graph[s]){
                if(dist[i][x] > dist[i][s] + 1) {
                    dist[i][x] = dist[i][s] + 1;
                    path[i][x] = path[i][s];

                    v[x] = 1;
                    q.push(x);
                } 
 
                else if(dist[i][x] == dist[i][s] + 1) path[i][x] += path[i][s];
            }
 
            q.pop();
        }
    }
 
    ll k;
    cin >> k;
 
    for(ll i = 1; i <= k; i ++){
        ll u, v;
        cin >> u >> v;
 
        range.pb({u, v});
    }
 
    for(ll i = 0; i < n; i ++){
        for(auto& x : range){
            if(dist[i][x.fr] + dist[i][x.sc] > dist[x.fr][x.sc]) continue;
            else e[i] += ld(path[i][x.fr] * path[i][x.sc]) / ld(path[x.fr][x.sc]);
            // cout << x.fr << " " << x.sc << " " << ld(dist[i][x.fr] * dist[i][x.sc]) / ld(dist[x.fr][x.sc]) << "\n";
        }
 
        if(e[i] > mx) mx = e[i], res = i;
        // cout << e[i] << " ";
        // cout << "\n";
    }
 
    cout << res;
}
 
 
signed main()
{
    // cin.tie(0)->sync_with_stdio(0);
 
    if(fopen("TOY.inp", "r")){
        freopen("TOY.inp", "r", stdin);
        freopen("TOY.out", "w", stdout);
    }
    
    // cout << 1; return 0;
 
    ll n = 1;
 
    // cin >> n;
 
    while(n) {
        solve();
        n --;
        cout << "\n";
    }
 
    // cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}

Compilation message

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4688 KB Output is correct
2 Correct 16 ms 10576 KB Output is correct
3 Correct 15 ms 9052 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1992 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4688 KB Output is correct
2 Correct 16 ms 10576 KB Output is correct
3 Correct 15 ms 9052 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1992 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 8 ms 4944 KB Output is correct
10 Correct 17 ms 11088 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 3 ms 2128 KB Output is correct
14 Correct 9 ms 6224 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4688 KB Output is correct
2 Correct 16 ms 10576 KB Output is correct
3 Correct 15 ms 9052 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1992 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct
8 Correct 4 ms 2128 KB Output is correct
9 Correct 10 ms 6480 KB Output is correct
10 Correct 8 ms 5200 KB Output is correct
11 Correct 21 ms 11344 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 3 ms 2128 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4688 KB Output is correct
2 Correct 16 ms 10576 KB Output is correct
3 Correct 15 ms 9052 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1992 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 8 ms 4944 KB Output is correct
10 Correct 17 ms 11088 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 3 ms 2128 KB Output is correct
14 Correct 9 ms 6224 KB Output is correct
15 Correct 4 ms 2128 KB Output is correct
16 Correct 10 ms 6480 KB Output is correct
17 Correct 8 ms 5200 KB Output is correct
18 Correct 21 ms 11344 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 504 KB Output is correct
21 Correct 3 ms 2128 KB Output is correct
22 Correct 5 ms 3320 KB Output is correct
23 Correct 4 ms 2384 KB Output is correct
24 Correct 11 ms 6736 KB Output is correct
25 Correct 22 ms 13828 KB Output is correct
26 Correct 20 ms 11856 KB Output is correct
27 Correct 2 ms 592 KB Output is correct
28 Correct 5 ms 3320 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4688 KB Output is correct
2 Correct 16 ms 10576 KB Output is correct
3 Correct 15 ms 9052 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1992 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 8 ms 4944 KB Output is correct
10 Correct 17 ms 11088 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 3 ms 2128 KB Output is correct
14 Correct 9 ms 6224 KB Output is correct
15 Correct 16 ms 8528 KB Output is correct
16 Correct 18 ms 10832 KB Output is correct
17 Correct 74 ms 41064 KB Output is correct
18 Correct 32 ms 15452 KB Output is correct
19 Correct 87 ms 52172 KB Output is correct
20 Correct 15 ms 10576 KB Output is correct
21 Correct 4 ms 2128 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4688 KB Output is correct
2 Correct 16 ms 10576 KB Output is correct
3 Correct 15 ms 9052 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1992 KB Output is correct
6 Correct 2 ms 1360 KB Output is correct
7 Correct 8 ms 4688 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 8 ms 4944 KB Output is correct
10 Correct 17 ms 11088 KB Output is correct
11 Correct 1 ms 592 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 3 ms 2128 KB Output is correct
14 Correct 9 ms 6224 KB Output is correct
15 Correct 4 ms 2128 KB Output is correct
16 Correct 10 ms 6480 KB Output is correct
17 Correct 8 ms 5200 KB Output is correct
18 Correct 21 ms 11344 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 504 KB Output is correct
21 Correct 3 ms 2128 KB Output is correct
22 Correct 5 ms 3320 KB Output is correct
23 Correct 4 ms 2384 KB Output is correct
24 Correct 11 ms 6736 KB Output is correct
25 Correct 22 ms 13828 KB Output is correct
26 Correct 20 ms 11856 KB Output is correct
27 Correct 2 ms 592 KB Output is correct
28 Correct 5 ms 3320 KB Output is correct
29 Correct 16 ms 8528 KB Output is correct
30 Correct 18 ms 10832 KB Output is correct
31 Correct 74 ms 41064 KB Output is correct
32 Correct 32 ms 15452 KB Output is correct
33 Correct 87 ms 52172 KB Output is correct
34 Correct 15 ms 10576 KB Output is correct
35 Correct 4 ms 2128 KB Output is correct
36 Correct 40 ms 22896 KB Output is correct
37 Correct 203 ms 119432 KB Output is correct
38 Runtime error 368 ms 524288 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -