Submission #939173

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
939173	2024-03-06T06:28:52 Z	winter0101	City Mapping (NOI18_citymapping)	C++14	75.45 / 100	5 ms	8792 KB

citymapping

#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());
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);
}
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=tmp.back();
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});
//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){
	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	4 ms	8540 KB	Correct: 6238 out of 500000 queries used.
2	Correct	3 ms	8540 KB	Correct: 3260 out of 500000 queries used.
3	Correct	3 ms	8468 KB	Correct: 7640 out of 500000 queries used.
4	Correct	4 ms	8540 KB	Correct: 8439 out of 500000 queries used.
5	Correct	5 ms	8540 KB	Correct: 5970 out of 500000 queries used.

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	8540 KB	Correct: 6238 out of 500000 queries used.
2	Correct	3 ms	8540 KB	Correct: 3260 out of 500000 queries used.
3	Correct	3 ms	8468 KB	Correct: 7640 out of 500000 queries used.
4	Correct	4 ms	8540 KB	Correct: 8439 out of 500000 queries used.
5	Correct	5 ms	8540 KB	Correct: 5970 out of 500000 queries used.
6	Correct	3 ms	8536 KB	Correct: 5155 out of 500000 queries used.
7	Correct	4 ms	8540 KB	Correct: 5940 out of 500000 queries used.
8	Correct	4 ms	8536 KB	Correct: 12025 out of 500000 queries used.
9	Correct	3 ms	8536 KB	Correct: 8718 out of 500000 queries used.
10	Correct	3 ms	8540 KB	Correct: 6310 out of 500000 queries used.

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	8540 KB	Correct: 4264 out of 12000 queries used.
2	Correct	3 ms	8540 KB	Correct: 3423 out of 12000 queries used.
3	Correct	4 ms	8540 KB	Correct: 4382 out of 12000 queries used.
4	Correct	3 ms	8464 KB	Correct: 4112 out of 12000 queries used.
5	Correct	4 ms	8792 KB	Correct: 3953 out of 12000 queries used.

Subtask #4

19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	8540 KB	Correct: 4264 out of 12000 queries used.
2	Correct	3 ms	8540 KB	Correct: 3423 out of 12000 queries used.
3	Correct	4 ms	8540 KB	Correct: 4382 out of 12000 queries used.
4	Correct	3 ms	8464 KB	Correct: 4112 out of 12000 queries used.
5	Correct	4 ms	8792 KB	Correct: 3953 out of 12000 queries used.
6	Correct	4 ms	8540 KB	Correct: 4546 out of 12000 queries used.
7	Correct	3 ms	8540 KB	Correct: 7757 out of 12000 queries used.
8	Correct	4 ms	8540 KB	Correct: 5963 out of 12000 queries used.
9	Correct	4 ms	8540 KB	Correct: 5413 out of 12000 queries used.
10	Correct	4 ms	8540 KB	Correct: 4504 out of 12000 queries used.

Subtask #5

18.45 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	8540 KB	Correct: 6238 out of 500000 queries used.
2	Correct	3 ms	8540 KB	Correct: 3260 out of 500000 queries used.
3	Correct	3 ms	8468 KB	Correct: 7640 out of 500000 queries used.
4	Correct	4 ms	8540 KB	Correct: 8439 out of 500000 queries used.
5	Correct	5 ms	8540 KB	Correct: 5970 out of 500000 queries used.
6	Correct	3 ms	8536 KB	Correct: 5155 out of 500000 queries used.
7	Correct	4 ms	8540 KB	Correct: 5940 out of 500000 queries used.
8	Correct	4 ms	8536 KB	Correct: 12025 out of 500000 queries used.
9	Correct	3 ms	8536 KB	Correct: 8718 out of 500000 queries used.
10	Correct	3 ms	8540 KB	Correct: 6310 out of 500000 queries used.
11	Correct	3 ms	8540 KB	Correct: 4264 out of 12000 queries used.
12	Correct	3 ms	8540 KB	Correct: 3423 out of 12000 queries used.
13	Correct	4 ms	8540 KB	Correct: 4382 out of 12000 queries used.
14	Correct	3 ms	8464 KB	Correct: 4112 out of 12000 queries used.
15	Correct	4 ms	8792 KB	Correct: 3953 out of 12000 queries used.
16	Correct	4 ms	8540 KB	Correct: 4546 out of 12000 queries used.
17	Correct	3 ms	8540 KB	Correct: 7757 out of 12000 queries used.
18	Correct	4 ms	8540 KB	Correct: 5963 out of 12000 queries used.
19	Correct	4 ms	8540 KB	Correct: 5413 out of 12000 queries used.
20	Correct	4 ms	8540 KB	Correct: 4504 out of 12000 queries used.
21	Correct	4 ms	8540 KB	Correct: 5262 out of 25000 queries used.
22	Correct	4 ms	8540 KB	Correct: 3838 out of 25000 queries used.
23	Correct	4 ms	8540 KB	Correct: 3924 out of 25000 queries used.
24	Correct	4 ms	8736 KB	Correct: 6575 out of 25000 queries used.
25	Correct	3 ms	8536 KB	Correct: 8177 out of 25000 queries used.
26	Correct	3 ms	8284 KB	Correct: 7581 out of 25000 queries used.
27	Correct	3 ms	8540 KB	Correct: 9930 out of 25000 queries used.
28	Correct	3 ms	8536 KB	Correct: 7652 out of 25000 queries used.
29	Correct	3 ms	8536 KB	Correct: 8714 out of 25000 queries used.
30	Correct	3 ms	8284 KB	Correct: 7365 out of 25000 queries used.
31	Correct	3 ms	8540 KB	Correct: 7406 out of 25000 queries used.
32	Correct	3 ms	8540 KB	Correct: 5370 out of 25000 queries used.
33	Correct	3 ms	8540 KB	Correct: 7334 out of 25000 queries used.
34	Correct	3 ms	8460 KB	Correct: 7362 out of 25000 queries used.
35	Correct	3 ms	8540 KB	Correct: 8371 out of 25000 queries used.
36	Correct	3 ms	8536 KB	Correct: 8185 out of 25000 queries used.
37	Correct	3 ms	8540 KB	Correct: 7567 out of 25000 queries used.
38	Correct	3 ms	8540 KB	Correct: 7442 out of 25000 queries used.
39	Correct	3 ms	8540 KB	Correct: 7276 out of 25000 queries used.
40	Correct	3 ms	8540 KB	Correct: 7481 out of 25000 queries used.
41	Correct	4 ms	8540 KB	Correct: 8688 out of 25000 queries used.
42	Correct	3 ms	8540 KB	Correct: 7252 out of 25000 queries used.
43	Correct	4 ms	8536 KB	Correct: 3888 out of 25000 queries used.
44	Correct	4 ms	8284 KB	Correct: 7704 out of 25000 queries used.
45	Correct	3 ms	8284 KB	Correct: 6840 out of 25000 queries used.
46	Correct	3 ms	8284 KB	Correct: 9991 out of 25000 queries used.
47	Correct	3 ms	8540 KB	Correct: 7917 out of 25000 queries used.
48	Correct	3 ms	8540 KB	Correct: 8016 out of 25000 queries used.
49	Correct	3 ms	8540 KB	Correct: 6772 out of 25000 queries used.
50	Correct	3 ms	8540 KB	Correct: 8247 out of 25000 queries used.
51	Correct	4 ms	8540 KB	Correct: 9163 out of 25000 queries used.
52	Correct	4 ms	8540 KB	Correct: 8691 out of 25000 queries used.
53	Correct	3 ms	8452 KB	Correct: 7767 out of 25000 queries used.
54	Correct	4 ms	8540 KB	Correct: 5350 out of 25000 queries used.
55	Correct	3 ms	8540 KB	Correct: 9775 out of 25000 queries used.
56	Correct	3 ms	8540 KB	Correct: 7460 out of 25000 queries used.
57	Correct	3 ms	8536 KB	Correct: 7720 out of 25000 queries used.
58	Correct	3 ms	8540 KB	Correct: 7173 out of 25000 queries used.
59	Correct	3 ms	8540 KB	Correct: 8368 out of 25000 queries used.
60	Correct	3 ms	8540 KB	Correct: 6225 out of 25000 queries used.
61	Correct	4 ms	8540 KB	Correct: 6597 out of 25000 queries used.
62	Correct	3 ms	8284 KB	Correct: 7267 out of 25000 queries used.
63	Correct	3 ms	8540 KB	Correct: 10450 out of 25000 queries used.
64	Correct	4 ms	8540 KB	Correct: 7460 out of 25000 queries used.
65	Correct	4 ms	8540 KB	Correct: 4050 out of 25000 queries used.
66	Correct	3 ms	8540 KB	Correct: 6718 out of 25000 queries used.
67	Correct	3 ms	8540 KB	Correct: 3277 out of 25000 queries used.
68	Correct	4 ms	8536 KB	Correct: 7600 out of 25000 queries used.
69	Correct	3 ms	8540 KB	Correct: 5661 out of 25000 queries used.
70	Correct	3 ms	8536 KB	Correct: 2992 out of 25000 queries used.