Submission #234817

#	Time	Username	Problem	Language	Result	Execution time	Memory
234817		crossing0ver	Ideal city (IOI12_city)	C++17	55 / 100	260 ms	18456 KiB

city

#include<bits/stdc++.h>
using namespace std;
int vis[100001],x,y,t,help,d[1000001];
map<pair<int,int>,int> mp;
vector<int> adj[100000];
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
pair<int,int> A[100000];
int DistanceSum(int N, int *X, int *Y) {
  int sum = 0;
  for (int i = 0; i < N; i++) 
  	mp[{X[i],Y[i]}] = i + 1, A[i] = {X[i],Y[i]};
  for (int i = 0; i < N;i ++) {
  	for (int j = 0; j < 4; j++) {
  		x = X[i] + dx[j];
  		y = Y[i] + dy[j];
  		t = mp[{x,y}];
		if (t) adj[i].push_back(t-1);
	  } 
  }	 if ( N <= 5000) {
  for (int i = 0; i < N; i++) {
  	help++;
  	queue<int> q;
  	q.push(i);
  	d[i] = 0;
  	vis[i] = help;
  	while (!q.empty()) {
  		x = q.front();
  		q.pop();
  		sum += d[x];
  		for (int j:adj[x]) {
  			if (vis[j]  != help ) {
  				vis[j] = help;
  				d[j] = d[x] + 1;
  				q.push(j);
			  }
		  }
		  if (sum >= 1e9) sum -= 1e9;
	  }     }  	return sum/2;}
	  sort (A, A + N);
	  int s = 0;
	  for (int i = 0; i < N; i ++) {
	  	s += A[i].first;
	  	if (s >= 1e9) s-= 1e9;
	  	sum = (1ll*(i + 1)*A[i].first - s + sum)%(1000000000);
	  	if (sum < 0) sum += 1e9;
	  	swap(A[i].first,A[i].second);
	  }
	  sort (A , A+ N);
	  s = 0;
	  for (int i = 0; i < N; i ++) {
	  	s += A[i].first;
	  	if (s >= 1e9) s-= 1e9;
	  	sum = (1ll*(i + 1)*A[i].first - s + sum)%(1000000000);
	  	if (sum < 0) sum += 1e9;
	  	swap(A[i].first,A[i].second);
	  }
	
	  
	  
	  
	    return sum;
}

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 23 / 23
• Subtask 4: 0 / 45