Submission #424045

#	Time	Username	Problem	Language	Result	Execution time	Memory
424045		cfalas	Ideal city (IOI12_city)	C++17	32 / 100	1086 ms	3344 KiB

city

#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000000
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

vi a, b;

ii diag[4] = {{0,-1}, {0,1}, {-1,0}, {1,0}};

ll paris(ii x){
	return ((ll)x.F)*(INT_MAX+1ll) + x.S;
}

ii unparis(ll x){
	return {x/(INT_MAX+1ll), x%(INT_MAX+1ll)};
}

int DistanceSum(int n, int *X, int *Y) {
	unordered_map<ll, vector<ll> > adj;
	FOR(i,n){
		FORi(j,i+1,n){
			if(abs(X[i]-X[j])+abs(Y[i]-Y[j])==1){
				adj[paris({X[i], Y[i]})].push_back(paris({X[j], Y[j]}));
				adj[paris({X[j], Y[j]})].push_back(paris({X[i], Y[i]}));
			}
		}
	}
	int ans=0;
	FOR(i,n){
		// bfs from i
		unordered_set<ll> used;
		queue<ll> q;
		q.push(paris({X[i], Y[i]}));
		used.insert(paris({X[i], Y[i]}));
		q.push(-1);
		int d=0;
		//cout<<X[i]<<" "<<Y[i]<<": "<<endl;
		while(q.size()>1){
			ll t = q.front();
			q.pop();
			if(t==-1){
				d++;
				q.push(-1);
				continue;
			}
			//cout<<t.F<<" "<<t.S<<" "<<d<<endl;
			ans+=d;
			ans%=MOD;

			FOA(x, adj[t]){
				if(!used.count(x)){
					q.push(x);
					used.insert(x);
				}
			}
		}
	}
	return ans/2;

}

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