oj.uz

Submission #761903

# Submission time Handle Problem Language Result Execution time Memory
761903 2023-06-20T11:12:37 Z Sohsoh84 Ideal city (IOI12_city) C++17
32 / 100
 1000 ms 4556 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define X		first
#define Y		second
#define all(x)		(x).begin(),(x).end()

const ll MAXN = 1e5 + 10;
const ll MOD = 1000000000;

int n;
vector<pll> vec;
ll ans = 0, dist[MAXN];
vector<int> adj[MAXN];

inline int get(ll x, ll y) {
	pll e = pll(x, y);
	auto it = lower_bound(all(vec), e);
	if (it != vec.end() && *it == e) return it - vec.begin() + 1;
	return 0;
}

inline void BFS(int v) {
	memset(dist, 63, sizeof dist);
	dist[v] = 0;

	queue<int> q;
	q.push(v);
	while (!q.empty()) {
		int v = q.front();
		q.pop();
		for (int u : adj[v]) {
			if (dist[v] + 1 < dist[u]) {
				dist[u] = dist[v] + 1;
				q.push(u);
			}
		}
	}
}

int DistanceSum(int N, int *X, int *Y) {
	n = N;	
	for (int i = 0; i < n; i++)
		vec.push_back({X[i], Y[i]});

	sort(all(vec));
	for (int i = 1; i <= n; i++) {
		int x = vec[i - 1].X, y = vec[i - 1].Y;
		
		int j = get(x - 1, y);
		if (j) adj[i].push_back(j);	
		j = get(x, y - 1);
		if (j) adj[i].push_back(j);
		j = get(x + 1, y);
		if (j) adj[i].push_back(j);
		j = get(x, y + 1);
		if (j) adj[i].push_back(j);
	} 

	for (int i = 1; i <= n; i++) {
		BFS(i);
		for (int j = i + 1; j <= n; j++)
			ans = (ans + dist[j]) % MOD;
	}

	return ans % MOD;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 3 ms 3432 KB Output is correct
5 Correct 3 ms 3412 KB Output is correct
6 Correct 5 ms 3540 KB Output is correct
7 Correct 5 ms 3412 KB Output is correct
8 Correct 5 ms 3412 KB Output is correct
9 Correct 5 ms 3412 KB Output is correct
10 Correct 5 ms 3412 KB Output is correct
11 Correct 5 ms 3432 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3412 KB Output is correct
2 Correct 31 ms 3440 KB Output is correct
3 Correct 51 ms 3540 KB Output is correct
4 Correct 49 ms 3540 KB Output is correct
5 Correct 81 ms 3572 KB Output is correct
6 Correct 80 ms 3560 KB Output is correct
7 Correct 85 ms 3556 KB Output is correct
8 Correct 88 ms 3552 KB Output is correct
9 Correct 77 ms 3544 KB Output is correct
10 Correct 76 ms 3552 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 4488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 4556 KB Time limit exceeded
2 Halted 0 ms 0 KB -