oj.uz

답안 #964020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964020 2024-04-16T07:58:06 Z 12345678 City Mapping (NOI18_citymapping) C++17
32 / 100
 2000 ms 956 KB 
#include "citymapping.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

mt19937 rng(time(0));

const ll nx=1e3+5;

ll ds[nx];
ll hv[nx], l[nx], sz[nx], rt, pa[nx], w[nx], t;
vector<pair<ll, ll>> k, rnd;
vector<ll> d[nx];
map<pair<ll, ll>, ll> mp;

ll dfssz(ll u)
{
    sz[u]=1;
    for (auto v:d[u]) sz[u]+=dfssz(v);
    if (d[u].size()==1) hv[u]=d[u][0], l[u]=-1;
    else if (d[u].size()==2)
    {
        if (sz[d[u][0]]<sz[d[u][1]]) swap(d[u][0], d[u][1]);
        hv[u]=d[u][0];
        l[u]=d[u][1];
    }  
    return sz[u];
}

ll query(ll u, ll v)
{
    if (u>v) swap(u, v);
    if (mp.find({u, v})!=mp.end()) return mp[{u, v}];
    return mp[{u, v}]=get_distance(u, v);
}

void find_roads(int N, int Q, int A[], int B[], int W[]) {
    pair<ll, ll> mx;
    for (ll i=2; i<=N; i++) rnd.push_back({rng(), i});
    sort(rnd.begin(), rnd.end());
    for (ll i=0; i<min(400, N); i++) mx=max(mx, {query(1, rnd[i].second), i});
    rt=mx.second;
    for (ll i=1; i<=N; i++) if (i!=rt) ds[i]=query(rt, i), k.push_back({ds[i], i});
    sort(k.begin(), k.end());
    for (auto [_, u]:k)
    {
        for (ll i=1; i<=N; i++) hv[i]=l[i]=-1;
        dfssz(rt);
        ll tmp=rt;
        while (1)
        {
            while (hv[tmp]!=-1) tmp=hv[tmp];
            ll ld=query(rt, tmp)-((query(rt, tmp)+query(rt, u))-query(u, tmp))/2;
            while (ld!=0) ld-=w[tmp], tmp=pa[tmp];
            if (d[tmp].size()<2)
            {
                d[tmp].push_back(u), pa[u]=tmp, w[u]=query(u, tmp), A[t]=u, B[t]=tmp, W[t++]=query(u, tmp);
                break;
            }
            else tmp=l[tmp];
        } 
    }
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 860 KB Correct: 2453 out of 500000 queries used.
2 Execution timed out 2052 ms 608 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 860 KB Correct: 2453 out of 500000 queries used.
2 Execution timed out 2052 ms 608 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 856 KB Correct: 2892 out of 12000 queries used.
2 Correct 9 ms 860 KB Correct: 3008 out of 12000 queries used.
3 Correct 9 ms 776 KB Correct: 3035 out of 12000 queries used.
4 Correct 10 ms 856 KB Correct: 3036 out of 12000 queries used.
5 Correct 10 ms 956 KB Correct: 3085 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 856 KB Correct: 2892 out of 12000 queries used.
2 Correct 9 ms 860 KB Correct: 3008 out of 12000 queries used.
3 Correct 9 ms 776 KB Correct: 3035 out of 12000 queries used.
4 Correct 10 ms 856 KB Correct: 3036 out of 12000 queries used.
5 Correct 10 ms 956 KB Correct: 3085 out of 12000 queries used.
6 Correct 9 ms 908 KB Correct: 2671 out of 12000 queries used.
7 Correct 9 ms 860 KB Correct: 2542 out of 12000 queries used.
8 Correct 9 ms 860 KB Correct: 2509 out of 12000 queries used.
9 Correct 9 ms 856 KB Correct: 2667 out of 12000 queries used.
10 Correct 9 ms 860 KB Correct: 2659 out of 12000 queries used.

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 860 KB Correct: 2453 out of 500000 queries used.
2 Execution timed out 2052 ms 608 KB Time limit exceeded
3 Halted 0 ms 0 KB -