oj.uz

답안 #939172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939172 2024-03-06T06:26:45 Z winter0101 City Mapping (NOI18_citymapping) C++14
85.33 / 100
 4 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(310197);
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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Correct: 7706 out of 500000 queries used.
2 Correct 4 ms 8536 KB Correct: 4970 out of 500000 queries used.
3 Correct 3 ms 8284 KB Correct: 6387 out of 500000 queries used.
4 Correct 3 ms 8536 KB Correct: 8059 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 7613 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Correct: 7706 out of 500000 queries used.
2 Correct 4 ms 8536 KB Correct: 4970 out of 500000 queries used.
3 Correct 3 ms 8284 KB Correct: 6387 out of 500000 queries used.
4 Correct 3 ms 8536 KB Correct: 8059 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 7613 out of 500000 queries used.
6 Correct 3 ms 8792 KB Correct: 3051 out of 500000 queries used.
7 Correct 3 ms 8540 KB Correct: 5867 out of 500000 queries used.
8 Correct 3 ms 8540 KB Correct: 7130 out of 500000 queries used.
9 Correct 4 ms 8540 KB Correct: 7724 out of 500000 queries used.
10 Correct 3 ms 8536 KB Correct: 7292 out of 500000 queries used.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8536 KB Correct: 6176 out of 12000 queries used.
2 Correct 4 ms 8536 KB Correct: 5566 out of 12000 queries used.
3 Correct 4 ms 8596 KB Correct: 7373 out of 12000 queries used.
4 Correct 3 ms 8540 KB Correct: 3731 out of 12000 queries used.
5 Correct 3 ms 8540 KB Correct: 5720 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8536 KB Correct: 6176 out of 12000 queries used.
2 Correct 4 ms 8536 KB Correct: 5566 out of 12000 queries used.
3 Correct 4 ms 8596 KB Correct: 7373 out of 12000 queries used.
4 Correct 3 ms 8540 KB Correct: 3731 out of 12000 queries used.
5 Correct 3 ms 8540 KB Correct: 5720 out of 12000 queries used.
6 Correct 4 ms 8540 KB Correct: 6300 out of 12000 queries used.
7 Correct 3 ms 8540 KB Correct: 3358 out of 12000 queries used.
8 Correct 3 ms 8540 KB Correct: 5765 out of 12000 queries used.
9 Correct 4 ms 8792 KB Correct: 5176 out of 12000 queries used.
10 Correct 4 ms 8540 KB Correct: 7682 out of 12000 queries used.

Subtask #5
28.33 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Correct: 7706 out of 500000 queries used.
2 Correct 4 ms 8536 KB Correct: 4970 out of 500000 queries used.
3 Correct 3 ms 8284 KB Correct: 6387 out of 500000 queries used.
4 Correct 3 ms 8536 KB Correct: 8059 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 7613 out of 500000 queries used.
6 Correct 3 ms 8792 KB Correct: 3051 out of 500000 queries used.
7 Correct 3 ms 8540 KB Correct: 5867 out of 500000 queries used.
8 Correct 3 ms 8540 KB Correct: 7130 out of 500000 queries used.
9 Correct 4 ms 8540 KB Correct: 7724 out of 500000 queries used.
10 Correct 3 ms 8536 KB Correct: 7292 out of 500000 queries used.
11 Correct 3 ms 8536 KB Correct: 6176 out of 12000 queries used.
12 Correct 4 ms 8536 KB Correct: 5566 out of 12000 queries used.
13 Correct 4 ms 8596 KB Correct: 7373 out of 12000 queries used.
14 Correct 3 ms 8540 KB Correct: 3731 out of 12000 queries used.
15 Correct 3 ms 8540 KB Correct: 5720 out of 12000 queries used.
16 Correct 4 ms 8540 KB Correct: 6300 out of 12000 queries used.
17 Correct 3 ms 8540 KB Correct: 3358 out of 12000 queries used.
18 Correct 3 ms 8540 KB Correct: 5765 out of 12000 queries used.
19 Correct 4 ms 8792 KB Correct: 5176 out of 12000 queries used.
20 Correct 4 ms 8540 KB Correct: 7682 out of 12000 queries used.
21 Correct 4 ms 8540 KB Correct: 3394 out of 25000 queries used.
22 Correct 3 ms 8540 KB Correct: 8037 out of 25000 queries used.
23 Correct 4 ms 8540 KB Correct: 3182 out of 25000 queries used.
24 Correct 4 ms 8540 KB Correct: 6588 out of 25000 queries used.
25 Correct 3 ms 8540 KB Correct: 6783 out of 25000 queries used.
26 Correct 3 ms 8536 KB Correct: 7638 out of 25000 queries used.
27 Correct 3 ms 8540 KB Correct: 6559 out of 25000 queries used.
28 Correct 3 ms 8540 KB Correct: 7286 out of 25000 queries used.
29 Correct 3 ms 8540 KB Correct: 6890 out of 25000 queries used.
30 Correct 3 ms 8540 KB Correct: 8097 out of 25000 queries used.
31 Correct 3 ms 8540 KB Correct: 6885 out of 25000 queries used.
32 Correct 4 ms 8540 KB Correct: 4267 out of 25000 queries used.
33 Correct 3 ms 8540 KB Correct: 8271 out of 25000 queries used.
34 Correct 3 ms 8540 KB Correct: 8163 out of 25000 queries used.
35 Correct 3 ms 8540 KB Correct: 7447 out of 25000 queries used.
36 Correct 4 ms 8536 KB Correct: 6928 out of 25000 queries used.
37 Correct 3 ms 8540 KB Correct: 6704 out of 25000 queries used.
38 Correct 3 ms 8540 KB Correct: 7549 out of 25000 queries used.
39 Correct 3 ms 8540 KB Correct: 6798 out of 25000 queries used.
40 Correct 3 ms 8592 KB Correct: 7474 out of 25000 queries used.
41 Correct 3 ms 8540 KB Correct: 7683 out of 25000 queries used.
42 Correct 3 ms 8540 KB Correct: 7525 out of 25000 queries used.
43 Correct 4 ms 8792 KB Correct: 5374 out of 25000 queries used.
44 Correct 3 ms 8284 KB Correct: 7734 out of 25000 queries used.
45 Correct 3 ms 8540 KB Correct: 7538 out of 25000 queries used.
46 Correct 3 ms 8284 KB Correct: 8281 out of 25000 queries used.
47 Correct 3 ms 8536 KB Correct: 6970 out of 25000 queries used.
48 Correct 3 ms 8536 KB Correct: 7564 out of 25000 queries used.
49 Correct 4 ms 8536 KB Correct: 6989 out of 25000 queries used.
50 Correct 3 ms 8540 KB Correct: 7794 out of 25000 queries used.
51 Correct 3 ms 8540 KB Correct: 7655 out of 25000 queries used.
52 Correct 3 ms 8540 KB Correct: 7454 out of 25000 queries used.
53 Correct 3 ms 8540 KB Correct: 7359 out of 25000 queries used.
54 Correct 4 ms 8540 KB Correct: 6363 out of 25000 queries used.
55 Correct 3 ms 8540 KB Correct: 7091 out of 25000 queries used.
56 Correct 3 ms 8536 KB Correct: 7184 out of 25000 queries used.
57 Correct 3 ms 8540 KB Correct: 8462 out of 25000 queries used.
58 Correct 3 ms 8536 KB Correct: 8640 out of 25000 queries used.
59 Correct 3 ms 8492 KB Correct: 8616 out of 25000 queries used.
60 Correct 3 ms 8540 KB Correct: 6226 out of 25000 queries used.
61 Correct 3 ms 8540 KB Correct: 8167 out of 25000 queries used.
62 Correct 3 ms 8284 KB Correct: 8237 out of 25000 queries used.
63 Correct 4 ms 8540 KB Correct: 6856 out of 25000 queries used.
64 Correct 3 ms 8540 KB Correct: 7472 out of 25000 queries used.
65 Correct 3 ms 8540 KB Correct: 4994 out of 25000 queries used.
66 Correct 3 ms 8540 KB Correct: 7189 out of 25000 queries used.
67 Correct 3 ms 8540 KB Correct: 3642 out of 25000 queries used.
68 Correct 3 ms 8540 KB Correct: 2299 out of 25000 queries used.
69 Correct 3 ms 8364 KB Correct: 4906 out of 25000 queries used.
70 Correct 3 ms 8540 KB Correct: 6737 out of 25000 queries used.