oj.uz

Submission #66039

# Submission time Handle Problem Language Result Execution time Memory
66039 2018-08-09T12:49:46 Z mhnd Ideal city (IOI12_city) C++14
23 / 100
 77 ms 63600 KB 
//#include "grader.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const int N = 5e5+50;
const ll oo = 1e18;
const ll mod = 1e9;

int cost[2010][2010],r[2010][2010];
ll ans = 0;
int cur;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};

void bfs(pair<int,int> st){
	queue<pair<int,int>> q;
	q.push(st);
	int fr = r[st.first][st.second];
	cost[fr][fr] = 0;
	while(q.size()){
		pair<int,int> u = q.front();
		q.pop();
		int bf  = r[u.first][u.second];
		if(fr < bf)ans += cost[fr][bf];
		for(int i=0;i<4;i++){
			pair<int,int> v = {u.first+dx[i],u.second+dy[i]};
			int idx = r[v.first][v.second];
			if(idx==-1 || cost[fr][idx]!=-1)continue;
			cost[fr][idx] = cost[fr][bf]+1;
			q.push(v);
		}
	}
}

int DistanceSum(int N, int *X, int *Y) {
	if(N<=2000){
		int mn1=-1,mn2=-1;
		for(int i=0;i<N;i++){
			if(mn1==-1||mn1 > X[i])mn1=X[i];
			if(mn2==-1||mn2 > Y[i])mn2=Y[i];
		}
		for(int i=0;i<2000;i++)
			for(int j=0;j<2000;j++)
				r[i][j] = cost[i][j] = -1;
		for(int i=0;i<N;i++){
			X[i]-=mn1;
			Y[i]-=mn2;
			r[X[i]][Y[i]]=i;
		}
		for(int i=0;i<N;i++)bfs({X[i],Y[i]});
		return ans;
	}
	sort(X,X+N);
	int sum=0,ret=0,lst=X[0];
	for(int i=0;i<N;i++){
		if(X[i]!=lst){
			ret = (ret + (X[i]-lst)*1ll*(sum*1ll*(N-sum))%mod)%mod;
			lst = X[i];
		}
		sum++;
	}
	ans = ret;
	sort(Y,Y+N);
	sum=0;ret=0;lst=Y[0];
	for(int i=0;i<N;i++){
		if(Y[i]!=lst){
			ret = (ret + (Y[i]-lst)*1ll*(sum*1ll*(N-sum))%mod)%mod;
			lst = Y[i];
		}
		sum++;
	}
	ans = (ans+ret)%mod;
	return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 61 ms 63352 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 77 ms 63600 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 63600 KB Output is correct
2 Correct 9 ms 63600 KB Output is correct
3 Correct 22 ms 63600 KB Output is correct
4 Correct 20 ms 63600 KB Output is correct
5 Correct 36 ms 63600 KB Output is correct
6 Correct 39 ms 63600 KB Output is correct
7 Correct 36 ms 63600 KB Output is correct
8 Correct 42 ms 63600 KB Output is correct
9 Correct 38 ms 63600 KB Output is correct
10 Correct 41 ms 63600 KB Output is correct

Subtask #4
0 / 45.0

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