oj.uz

Submission #592696

# Submission time Handle Problem Language Result Execution time Memory
592696 2022-07-09T13:26:44 Z Blagojce City Mapping (NOI18_citymapping) C++11
32 / 100
 6 ms 8148 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define st first
#define nd second
#define pb push_back
#define pq priority_queue
#define all(x) begin(x), end(x)

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int mxn = 1003;
mt19937 _rand(time(NULL));
clock_t z;

#include "citymapping.h"

ll dist[mxn][mxn];/*
ll get_distance(int x, int y){
	cout<<"? "<<x<<' '<<y<<endl;
	ll ret;
	cin >> ret;
	return ret;
}*/
ll ask(int x, int y){
	if(x != y && dist[x][y] == 0){
		dist[x][y] = dist[y][x] = get_distance(x+1, y+1);
	}
	return dist[x][y];
}
vector<int> g;
int R1, R2;


int AA[mxn], BB[mxn], WW[mxn];
int edge_id = 0;

void add_edge(int x, int y, int w){
	AA[edge_id] = x;
	BB[edge_id] = y;
	WW[edge_id] = w;
	edge_id ++;
}




void decompose(vector<int> v){
	int r1 = v[_rand() % (int)v.size()];
	g = v;
	
	if((int)g.size() <= 1) return;
	
	for(auto u : g){
		ask(u, r1);
	}
	int r2 = r1;
	for(auto u : g){
		if(dist[r1][u] > dist[r1][r2]){
			r2 = u;
		}
	}
	//r1 -> r2 initial diameter
	
	for(auto u : g){
		ask(u, r2);
	}
	R1 = r1;
	R2 = r2;
	
	sort(all(g), [](const int &i, const int &j){
		return dist[R1][i] < dist[R1][j];
	});
	
	vector<int> diam;
	for(auto u : g){
		if(dist[r1][u] + dist[u][r2] == dist[r1][r2]){
			diam.pb(u);
		}
	}
	
	fr(i, 1, (int)diam.size()){
		add_edge(diam[i-1], diam[i], dist[r1][diam[i]] - dist[r1][diam[i-1]]);
	}
	vector<int> sub[(int)diam.size()];
	fr(i, 0, (int)diam.size()){
		sub[i].pb(diam[i]);
	}
	
	for(auto u : g){
		if(dist[r1][u] + dist[u][r2] == dist[r1][r2]) continue;
		fr(i, 0, (int)diam.size()){
			auto d = diam[i];
			if(dist[r1][u] - dist[r2][u] == dist[r1][d] - dist[r2][d]){
				sub[i].pb(u);
				break;
			}
		}
	}
	fr(i, 0, (int)diam.size()){
		auto d = diam[i];
		for(auto s : sub[i]){
			dist[d][s] = dist[r1][s] - dist[r1][d];
		}
	}
	fr(i, 0, (int)diam.size()){
		decompose(sub[i]);
	}
}

void find_roads(int N, int Q, int A[], int B[], int W[]) {
	vector<int> v;
	fr(i, 0, N) v.pb(i);
	/*int r1 = 0;
	fr(i, 0, N){
		ask(0, i);
		if(dist[0][i] > dist[0][r1]) r1 = i;
	}*/
	decompose(v);
	fr(i, 0, N-1){
		A[i] = AA[i] + 1;
		B[i] = BB[i] + 1;
		W[i] = WW[i];
		//cout<<A[i]<<' '<<B[i]<<' '<<W[i]<<endl;
	}
	return;
}/*
int A[100], B[100], W[100];
int main(){
	
	find_roads(5, 0, A, B, W); 
}
*/

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7124 KB Correct: 2124 out of 500000 queries used.
2 Correct 6 ms 8068 KB Correct: 3344 out of 500000 queries used.
3 Incorrect 5 ms 8148 KB Reported list of edges differ from actual.
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7124 KB Correct: 2124 out of 500000 queries used.
2 Correct 6 ms 8068 KB Correct: 3344 out of 500000 queries used.
3 Incorrect 5 ms 8148 KB Reported list of edges differ from actual.
4 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8020 KB Correct: 2689 out of 12000 queries used.
2 Correct 4 ms 6868 KB Correct: 2658 out of 12000 queries used.
3 Correct 5 ms 7736 KB Correct: 2254 out of 12000 queries used.
4 Correct 5 ms 7588 KB Correct: 2794 out of 12000 queries used.
5 Correct 4 ms 6868 KB Correct: 2323 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8020 KB Correct: 2689 out of 12000 queries used.
2 Correct 4 ms 6868 KB Correct: 2658 out of 12000 queries used.
3 Correct 5 ms 7736 KB Correct: 2254 out of 12000 queries used.
4 Correct 5 ms 7588 KB Correct: 2794 out of 12000 queries used.
5 Correct 4 ms 6868 KB Correct: 2323 out of 12000 queries used.
6 Correct 5 ms 7320 KB Correct: 2634 out of 12000 queries used.
7 Correct 5 ms 7892 KB Correct: 2906 out of 12000 queries used.
8 Correct 5 ms 7636 KB Correct: 3016 out of 12000 queries used.
9 Correct 5 ms 7536 KB Correct: 2368 out of 12000 queries used.
10 Correct 6 ms 8148 KB Correct: 3052 out of 12000 queries used.

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7124 KB Correct: 2124 out of 500000 queries used.
2 Correct 6 ms 8068 KB Correct: 3344 out of 500000 queries used.
3 Incorrect 5 ms 8148 KB Reported list of edges differ from actual.
4 Halted 0 ms 0 KB -