oj.uz

Submission #939200

# Submission time Handle Problem Language Result Execution time Memory
939200 2024-03-06T06:43:50 Z winter0101 City Mapping (NOI18_citymapping) C++17
76.41 / 100
 7 ms 8792 KB 
#include<bits/stdc++.h>
#include "citymapping.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
vector<pii>aaa[1009];
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int>cc[1009];
int f[1009];
long long d[1009][1009];
long long ask(int x,int y){
if (d[x][y]!=-1)return d[x][y];
return d[x][y]=d[y][x]=get_distance(x,y);
}
int fs(int u){
if (f[u]<0)return u;
return f[u]=fs(f[u]);
}
void unite(int u,int v,int w){
int u1=u,v1=v;
u=fs(u),v=fs(v);
if (u==v)return;
if (f[u]>f[v]){
swap(u,v);
swap(u1,v1);
}
f[u]+=f[v];
for (auto vx:cc[u]){
for (auto vy:cc[v]){
d[vx][vy]=d[vy][vx]=1ll*w+d[vx][u1]+d[vy][v1];
}
}
for (auto vx:cc[v]){
cc[u].pb(vx);
}
cc[v].clear();
}
bool add[1009];
vector<int>xd[1009];
void solve(vector<int>&tmp){
if (sz(tmp)<=1)return;
shuffle(all(tmp),rng);
for (auto v:tmp)add[v]=0;
shuffle(all(tmp),rng);
int s=tmp[0],t;
while (true){
t=tmp[rng()%sz(tmp)];
if (s==t)continue;
break;
}
ask(s,t);
vector<int>vertice;
for (auto v:tmp){
if (ask(s,v)+ask(t,v)==ask(s,t)){
vertice.pb(v);
add[v]=1;
}
}
//cout<<s<<" "<<t<<'\n';
sort(all(vertice),[&](int i,int j){
return ask(s,i)<ask(s,j);
});
auto add_edg=[&](int u,int v,int w){
aaa[u].pb({v,w});
aaa[v].pb({u,w});
d[u][v]=d[v][u]=w;
unite(u,v,w);
//cerr<<u<<" "<<v<<" "<<w<<'\n';
return;
};
for1(i,1,sz(vertice)-1){
add_edg(vertice[i],vertice[i-1],ask(vertice[i],s)-ask(vertice[i-1],s));
}
for(auto v:tmp){
if (add[v])continue;
for (auto u:vertice){
if (ask(s,v)-ask(s,u)==ask(t,v)-ask(t,u)&&ask(s,v)>ask(s,u)){
xd[u].pb(v);
//cerr<<u<<" "<<v<<'\n';
}
}
}
for (auto u:vertice){
if (!xd[u].empty()){
if ((u!=s&&u!=t)||sz(aaa[u])>=2){
vector<int>cop;
cop.swap(xd[u]);
int mn=cop[0];
for (auto v:cop){
if (ask(s,v)<ask(s,mn)){
mn=v;
}
}
add_edg(u,mn,ask(s,mn)-ask(s,u));
solve(cop);
}
else {
vector<int>cop;
cop.swap(xd[u]);
cop.pb(u);
solve(cop);
}
}
}
}
void find_roads(int N, int Q, int A[], int B[], int W[]) {
	for1(i,1,N){
    f[i]=-1;
    cc[i].pb(i);
	for1(j,1,N){
	d[i][j]=-1;
	}
	d[i][i]=0;
	}
	vector<int>tree;
	for1(i,1,N)tree.pb(i);
	solve(tree);
	int cnt=0;
	for1(i,1,N){
	for (auto v:aaa[i]){
    if (v.fi>i){
    A[cnt]=v.fi,B[cnt]=i,W[cnt]=v.se;
    cnt++;
    }
	}
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8540 KB Correct: 4157 out of 500000 queries used.
2 Correct 3 ms 8540 KB Correct: 3791 out of 500000 queries used.
3 Correct 3 ms 8540 KB Correct: 8675 out of 500000 queries used.
4 Correct 3 ms 8540 KB Correct: 7069 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 7968 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8540 KB Correct: 4157 out of 500000 queries used.
2 Correct 3 ms 8540 KB Correct: 3791 out of 500000 queries used.
3 Correct 3 ms 8540 KB Correct: 8675 out of 500000 queries used.
4 Correct 3 ms 8540 KB Correct: 7069 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 7968 out of 500000 queries used.
6 Correct 3 ms 8540 KB Correct: 2790 out of 500000 queries used.
7 Correct 4 ms 8540 KB Correct: 3939 out of 500000 queries used.
8 Correct 3 ms 8540 KB Correct: 6948 out of 500000 queries used.
9 Correct 3 ms 8540 KB Correct: 7604 out of 500000 queries used.
10 Correct 3 ms 8540 KB Correct: 5790 out of 500000 queries used.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8540 KB Correct: 4119 out of 12000 queries used.
2 Correct 4 ms 8540 KB Correct: 6086 out of 12000 queries used.
3 Correct 3 ms 8540 KB Correct: 3963 out of 12000 queries used.
4 Correct 4 ms 8540 KB Correct: 4481 out of 12000 queries used.
5 Correct 4 ms 8492 KB Correct: 5200 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8540 KB Correct: 4119 out of 12000 queries used.
2 Correct 4 ms 8540 KB Correct: 6086 out of 12000 queries used.
3 Correct 3 ms 8540 KB Correct: 3963 out of 12000 queries used.
4 Correct 4 ms 8540 KB Correct: 4481 out of 12000 queries used.
5 Correct 4 ms 8492 KB Correct: 5200 out of 12000 queries used.
6 Correct 4 ms 8540 KB Correct: 6467 out of 12000 queries used.
7 Correct 3 ms 8736 KB Correct: 2578 out of 12000 queries used.
8 Correct 3 ms 8540 KB Correct: 3942 out of 12000 queries used.
9 Correct 5 ms 8632 KB Correct: 4030 out of 12000 queries used.
10 Correct 3 ms 8540 KB Correct: 3757 out of 12000 queries used.

Subtask #5
19.41 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8540 KB Correct: 4157 out of 500000 queries used.
2 Correct 3 ms 8540 KB Correct: 3791 out of 500000 queries used.
3 Correct 3 ms 8540 KB Correct: 8675 out of 500000 queries used.
4 Correct 3 ms 8540 KB Correct: 7069 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 7968 out of 500000 queries used.
6 Correct 3 ms 8540 KB Correct: 2790 out of 500000 queries used.
7 Correct 4 ms 8540 KB Correct: 3939 out of 500000 queries used.
8 Correct 3 ms 8540 KB Correct: 6948 out of 500000 queries used.
9 Correct 3 ms 8540 KB Correct: 7604 out of 500000 queries used.
10 Correct 3 ms 8540 KB Correct: 5790 out of 500000 queries used.
11 Correct 3 ms 8540 KB Correct: 4119 out of 12000 queries used.
12 Correct 4 ms 8540 KB Correct: 6086 out of 12000 queries used.
13 Correct 3 ms 8540 KB Correct: 3963 out of 12000 queries used.
14 Correct 4 ms 8540 KB Correct: 4481 out of 12000 queries used.
15 Correct 4 ms 8492 KB Correct: 5200 out of 12000 queries used.
16 Correct 4 ms 8540 KB Correct: 6467 out of 12000 queries used.
17 Correct 3 ms 8736 KB Correct: 2578 out of 12000 queries used.
18 Correct 3 ms 8540 KB Correct: 3942 out of 12000 queries used.
19 Correct 5 ms 8632 KB Correct: 4030 out of 12000 queries used.
20 Correct 3 ms 8540 KB Correct: 3757 out of 12000 queries used.
21 Correct 3 ms 8540 KB Correct: 4945 out of 25000 queries used.
22 Correct 3 ms 8540 KB Correct: 4885 out of 25000 queries used.
23 Correct 3 ms 8540 KB Correct: 2717 out of 25000 queries used.
24 Correct 3 ms 8540 KB Correct: 7814 out of 25000 queries used.
25 Correct 3 ms 8536 KB Correct: 6835 out of 25000 queries used.
26 Correct 3 ms 8536 KB Correct: 6847 out of 25000 queries used.
27 Correct 3 ms 8540 KB Correct: 9559 out of 25000 queries used.
28 Correct 3 ms 8540 KB Correct: 7254 out of 25000 queries used.
29 Correct 3 ms 8540 KB Correct: 6660 out of 25000 queries used.
30 Correct 3 ms 8580 KB Correct: 7235 out of 25000 queries used.
31 Correct 3 ms 8536 KB Correct: 7602 out of 25000 queries used.
32 Correct 3 ms 8540 KB Correct: 2867 out of 25000 queries used.
33 Correct 3 ms 8540 KB Correct: 7643 out of 25000 queries used.
34 Correct 3 ms 8536 KB Correct: 7476 out of 25000 queries used.
35 Correct 3 ms 8536 KB Correct: 10275 out of 25000 queries used.
36 Correct 3 ms 8540 KB Correct: 10026 out of 25000 queries used.
37 Correct 3 ms 8540 KB Correct: 10084 out of 25000 queries used.
38 Correct 3 ms 8540 KB Correct: 7425 out of 25000 queries used.
39 Correct 4 ms 8536 KB Correct: 8974 out of 25000 queries used.
40 Correct 3 ms 8540 KB Correct: 7231 out of 25000 queries used.
41 Correct 3 ms 8540 KB Correct: 7296 out of 25000 queries used.
42 Correct 3 ms 8540 KB Correct: 8564 out of 25000 queries used.
43 Correct 3 ms 8540 KB Correct: 2998 out of 25000 queries used.
44 Correct 3 ms 8540 KB Correct: 6952 out of 25000 queries used.
45 Correct 3 ms 8540 KB Correct: 7253 out of 25000 queries used.
46 Correct 3 ms 8792 KB Correct: 8528 out of 25000 queries used.
47 Correct 3 ms 8540 KB Correct: 7359 out of 25000 queries used.
48 Correct 5 ms 8536 KB Correct: 7306 out of 25000 queries used.
49 Correct 4 ms 8628 KB Correct: 7556 out of 25000 queries used.
50 Correct 3 ms 8540 KB Correct: 7419 out of 25000 queries used.
51 Correct 3 ms 8540 KB Correct: 7537 out of 25000 queries used.
52 Correct 3 ms 8540 KB Correct: 7344 out of 25000 queries used.
53 Correct 4 ms 8616 KB Correct: 7152 out of 25000 queries used.
54 Correct 7 ms 8540 KB Correct: 5175 out of 25000 queries used.
55 Correct 3 ms 8560 KB Correct: 7058 out of 25000 queries used.
56 Correct 3 ms 8540 KB Correct: 8251 out of 25000 queries used.
57 Correct 3 ms 8540 KB Correct: 8523 out of 25000 queries used.
58 Correct 3 ms 8540 KB Correct: 7951 out of 25000 queries used.
59 Correct 3 ms 8540 KB Correct: 7168 out of 25000 queries used.
60 Correct 4 ms 8536 KB Correct: 6016 out of 25000 queries used.
61 Correct 3 ms 8540 KB Correct: 6384 out of 25000 queries used.
62 Correct 3 ms 8540 KB Correct: 6812 out of 25000 queries used.
63 Correct 3 ms 8536 KB Correct: 7516 out of 25000 queries used.
64 Correct 4 ms 8540 KB Correct: 6893 out of 25000 queries used.
65 Correct 4 ms 8496 KB Correct: 6266 out of 25000 queries used.
66 Correct 4 ms 8792 KB Correct: 6127 out of 25000 queries used.
67 Correct 4 ms 8540 KB Correct: 3894 out of 25000 queries used.
68 Correct 3 ms 8792 KB Correct: 5588 out of 25000 queries used.
69 Correct 4 ms 8540 KB Correct: 5515 out of 25000 queries used.
70 Correct 4 ms 8540 KB Correct: 6485 out of 25000 queries used.