oj.uz

답안 #576456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576456 2022-06-13T06:22:36 Z benson1029 이상적인 도시 (IOI12_city) C++14
32 / 100
 1000 ms 5308 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<int> 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());
	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;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 716 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 1024 KB Output is correct
2 Correct 36 ms 852 KB Output is correct
3 Correct 87 ms 1316 KB Output is correct
4 Correct 78 ms 1272 KB Output is correct
5 Correct 198 ms 1552 KB Output is correct
6 Correct 108 ms 1456 KB Output is correct
7 Correct 169 ms 2052 KB Output is correct
8 Correct 112 ms 2044 KB Output is correct
9 Correct 100 ms 1192 KB Output is correct
10 Correct 96 ms 1164 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 4540 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1087 ms 5308 KB Time limit exceeded
2 Halted 0 ms 0 KB -