oj.uz

답안 #576451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576451 2022-06-13T06:19:04 Z benson1029 이상적인 도시 (IOI12_city) C++14
11 / 100
 1000 ms 4760 KB 
#include<bits/stdc++.h>
using namespace std;

struct hash_pair{
	size_t operator()(const pair<int,int> &x) const {
		auto hash1 = hash<int>{}(x.first);
		auto hash2 = hash<int>{}(x.second+12345);
		return hash1^hash2;
	}
};

unordered_map< pair<int,int>, int, hash_pair > mp, vis, dis;
queue< pair<int,int> > q;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};



int DistanceSum(int N, int *X, int *Y) {
	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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 15 ms 344 KB Output is correct
7 Correct 16 ms 340 KB Output is correct
8 Correct 14 ms 340 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 17 ms 340 KB Output is correct
11 Correct 17 ms 340 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 864 ms 512 KB Output is correct
2 Correct 588 ms 500 KB Output is correct
3 Execution timed out 1072 ms 596 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

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

Subtask #4
0 / 45.0

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