oj.uz

Submission #526235

# Submission time Handle Problem Language Result Execution time Memory
526235 2022-02-14T02:46:24 Z armashka Shymbulak (IZhO14_shymbulak) C++17
50 / 100
 1500 ms 13160 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 2e5 + 10;
const int M = 1e3 + 5;
const ll inf = 2e18;
const ll mod = 1e9 + 7;
const double Pi = acos(-1); 

ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, d[N], cnt[N], mx, col[N];
vector <ll> g[N];
bool used[N];

const void solve(/*Armashka*/) {
    cin >> n;
    for (int i = 1; i <= n; ++ i) {
        ll u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    for (int i = 1; i <= n; ++ i){
        for (int j = 1; j <= n; ++ j) d[j] = inf;
        d[i] = 0;
        queue <ll> q;
        q.push(i);
        while (q.sz) {
            ll v = q.front();
            q.pop();
            for (auto to : g[v]) {
                if (d[to] > d[v] + 1) {
                    d[to] = d[v] + 1;
                    q.push(to);
                }
            }
        } 
        ll res = 0;
        for (int j = 1; j <= n; ++ j) {
            if (d[j] != inf) res = max(res, d[j]);
        }
        if (res < mx) continue;
        mx = max(mx, res);
        memset(col, 0, sizeof(col));
        memset(used, 0, sizeof(used));
        q.push(i);
        col[i] = 1;
        while (q.sz) {
            ll v = q.front();
            q.pop();
            if (used[v]) continue;
            used[v] = 1;
            for (auto to : g[v]) {
                if (d[to] == d[v] + 1)  {
                    col[to] += col[v];
                    q.push(to);
                }
            }
        }
        // cout << i << " " << res << ":\n";
        for (int j = 1; j <= n; ++ j) {
            if (d[j] == res) cnt[res] += col[j]; 
            // cout << j << " -> " << col[j] << "\n";
        }
    }
    cout << cnt[mx] / 2;
}  
 
signed main() {
    srand(time(NULL));
    fast;
    // file("");
    int tt = 1;
    // cin >> tt;
    while (tt --) {                                                             
        solve();
    }                            
}
// Uaqyt, otedi, ketedi, mulde bilinbei, ulger
// Kunder seni kutpeidi, susyz ospeidi gulder

Compilation message

shymbulak.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6732 KB Output is correct
2 Correct 4 ms 6732 KB Output is correct
3 Correct 4 ms 6688 KB Output is correct
4 Correct 3 ms 6688 KB Output is correct
5 Correct 4 ms 6732 KB Output is correct
6 Correct 3 ms 6732 KB Output is correct
7 Correct 4 ms 6692 KB Output is correct
8 Correct 4 ms 6688 KB Output is correct
9 Correct 4 ms 6732 KB Output is correct
10 Correct 4 ms 6732 KB Output is correct
11 Correct 4 ms 6732 KB Output is correct
12 Correct 5 ms 6708 KB Output is correct
13 Correct 10 ms 6732 KB Output is correct
14 Correct 7 ms 6812 KB Output is correct
15 Correct 7 ms 6732 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 6732 KB Output is correct
2 Correct 48 ms 6732 KB Output is correct
3 Correct 21 ms 6820 KB Output is correct
4 Correct 21 ms 6732 KB Output is correct
5 Correct 434 ms 7028 KB Output is correct
6 Correct 724 ms 7092 KB Output is correct
7 Correct 755 ms 7080 KB Output is correct
8 Correct 718 ms 6988 KB Output is correct
9 Correct 406 ms 7048 KB Output is correct
10 Correct 448 ms 7044 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1552 ms 13160 KB Time limit exceeded
2 Halted 0 ms 0 KB -