oj.uz

Submission #576485

# Submission time Handle Problem Language Result Execution time Memory
576485 2022-06-13T06:34:09 Z benson1029 Ideal city (IOI12_city) C++14
55 / 100
 157 ms 2952 KB 
#include<bits/stdc++.h>
using namespace std;

int mp[2005][2005], vis[2005][2005], dis[2005][2005];
queue< pair<int,int> > q;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
vector<long long> XX, YY;


int DistanceSum(int N, int *X, int *Y) {
	for(int i=0; i<N; i++) {
		XX.push_back(X[i]);
		YY.push_back(Y[i]);
	}
	sort(XX.begin(), XX.end()); sort(YY.begin(), YY.end());
	if(N <= 2000) {
		for(int i=0; i<N; i++) {
			X[i] -= XX[0];
			Y[i] -= YY[0];
		}
		for(int i=0; i<N; i++) {
			mp[X[i]][Y[i]] = 1;
		}
		long long ans = 0;
		for(int i=0; i<N; i++) {
			for(int j=0; j<N; j++) vis[X[j]][Y[j]] = 0;
			vis[X[i]][Y[i]] = 1;
			q.push({X[i], Y[i]});
			dis[X[i]][Y[i]] = 0;
			while(!q.empty()) {
				int x = q.front().first;
				int y = q.front().second;
				ans += dis[x][y];
				q.pop();
				for(int j=0; j<4; j++) {
					if(mp[x+dx[j]][y+dy[j]] == 1 && vis[x+dx[j]][y+dy[j]] == 0) {
						vis[x+dx[j]][y+dy[j]] = 1;
						dis[x+dx[j]][y+dy[j]] = dis[x][y] + 1;
						q.push({x+dx[j], y+dy[j]});
					}
				}
			}
		}
		return (ans/2) % 1000000000;
	} else {
		long long tmp = 0, ans = 0;
		for(int i=0; i<N; i++) {
			ans += XX[i] * i - tmp;
			ans %= 1000000000;
			tmp += XX[i];
		}
		tmp = 0;
		for(int i=0; i<N; i++) {
			ans += YY[i] * i - tmp;
			ans %= 1000000000;
			tmp += YY[i];
		}
		return ans % 1000000000;
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 720 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 980 KB Output is correct
2 Correct 30 ms 968 KB Output is correct
3 Correct 86 ms 1340 KB Output is correct
4 Correct 71 ms 1292 KB Output is correct
5 Correct 147 ms 1492 KB Output is correct
6 Correct 100 ms 1468 KB Output is correct
7 Correct 157 ms 2004 KB Output is correct
8 Correct 119 ms 2004 KB Output is correct
9 Correct 98 ms 1212 KB Output is correct
10 Correct 95 ms 1184 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1024 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct
3 Correct 15 ms 1700 KB Output is correct
4 Correct 14 ms 1744 KB Output is correct
5 Correct 37 ms 2932 KB Output is correct
6 Correct 26 ms 2932 KB Output is correct
7 Correct 27 ms 2884 KB Output is correct
8 Correct 29 ms 2888 KB Output is correct
9 Correct 26 ms 2888 KB Output is correct
10 Correct 26 ms 2952 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1024 KB Output isn't correct
2 Halted 0 ms 0 KB -