oj.uz

Submission #140417

# Submission time Handle Problem Language Result Execution time Memory
140417 2019-08-02T20:39:15 Z MvC Ideal city (IOI12_city) C++11
55 / 100
 180 ms 4348 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "job.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const ll mod=1e9;
using namespace std;
int dx[]={-1,0,0,1},dy[]={0,-1,1,0};
int i,j,a,b,x[nmax],y[nmax],di[nmax],vz[nmax],n,rs,sx,sy;
vector<int>g[nmax];
queue<int>q;
map<pair<int,int>,int>mp;
void ad(int &x,int y)
{
	x+=y;
	if(x>=mod)x-=mod;
	if(x<0)x+=mod;
}
void rec(int a,int b)
{
	int c=mp[mkp(a,b)],d;
	if(vz[c])return;
	vz[c]=1;
	for(int i=0;i<4;i++)
	{
		d=mp[mkp(a+dx[i],b+dy[i])];
		if(!d)continue;
		g[c].pb(d);
		rec(a+dx[i],b+dy[i]);
	}
}
int DistanceSum(int N,int X[],int Y[])
{
	n=N;
	for(i=1;i<=n;i++)
	{
		x[i]=X[i-1],y[i]=Y[i-1];
		if(n<=2000)mp[mkp(x[i],y[i])]=i;
	}
	if(n<=2000)
	{
		rec(x[1],y[1]);
		for(i=1;i<=n;i++)
		{
			while(!q.empty())q.pop();
			q.push(i);
			for(j=1;j<=n;j++)vz[j]=di[j]=0;
			vz[i]=1;
			while(!q.empty())
			{
				a=q.front();
				q.pop();
				if(a>i)ad(rs,di[a]);
				for(j=0;j<g[a].size();j++)
				{
					b=g[a][j];
					if(!vz[b])
					{
						vz[b]=1;
						q.push(b);
						di[b]=di[a]+1;
					}
				}
			}
		}
	}
	else
	{
		sort(x+1,x+n+1);
		sort(y+1,y+n+1);
		for(i=1;i<=n;i++)
		{
			ad(sx,x[i]);
			ad(sy,y[i]);
		}
		for(i=n;i>=1;i--)
		{
			ad(rs,((1LL*x[i]*i%mod)-sx+mod)%mod);
			ad(rs,((1LL*y[i]*i%mod)-sy+mod)%mod);
			ad(sx,-x[i]);
			ad(sy,-y[i]);
		}
	}
	return rs;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>x[i]>>y[i];
		mp[mkp(x[i],y[i])]=i;
	}
	rec(x[1],y[1]);
	if(n<=2000)
	{
		for(i=1;i<=n;i++)
		{
			while(!q.empty())q.pop();
			q.push(i);
			for(j=1;j<=n;j++)vz[j]=di[j]=0;
			vz[i]=1;
			while(!q.empty())
			{
				a=q.front();
				q.pop();
				if(a>i)ad(rs,di[a]);
				for(j=0;j<g[a].size();j++)
				{
					b=g[a][j];
					if(!vz[b])
					{
						vz[b]=1;
						q.push(b);
						di[b]=di[a]+1;
					}
				}
			}
		}
	}
	else
	{
		sort(x+1,x+n+1);
		sort(y+1,y+n+1);
		for(i=1;i<=n;i++)
		{
			ad(sx,x[i]);
			ad(sy,y[i]);
		}
		for(i=n;i>=1;i--)
		{
			ad(rs,((x[i]*i%mod)-sx+mod)%mod);
			ad(rs,((y[i]*i%mod)-sy+mod)%mod);
			ad(sx,-x[i]);
			ad(sy,-y[i]);
		}
	}
	cout<<rs<<endl;
    return 0;
}
/*
11
2 5
2 6
3 3
3 6
4 3
4 4
4 5
4 6
5 3
5 4
5 6
*/

Compilation message

city.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
city.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
city.cpp:159:1: warning: "/*" within comment [-Wcomment]
 /*
  
city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:68:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=0;j<g[a].size();j++)
             ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 5 ms 2680 KB Output is correct
4 Correct 7 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 7 ms 2808 KB Output is correct
10 Correct 6 ms 2684 KB Output is correct
11 Correct 5 ms 2680 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2812 KB Output is correct
2 Correct 42 ms 2920 KB Output is correct
3 Correct 98 ms 3012 KB Output is correct
4 Correct 93 ms 2908 KB Output is correct
5 Correct 180 ms 3196 KB Output is correct
6 Correct 139 ms 3064 KB Output is correct
7 Correct 169 ms 3164 KB Output is correct
8 Correct 150 ms 3196 KB Output is correct
9 Correct 141 ms 3064 KB Output is correct
10 Correct 135 ms 3192 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3064 KB Output is correct
2 Correct 11 ms 3064 KB Output is correct
3 Correct 20 ms 3592 KB Output is correct
4 Correct 20 ms 3624 KB Output is correct
5 Correct 36 ms 4344 KB Output is correct
6 Correct 37 ms 4344 KB Output is correct
7 Correct 39 ms 4344 KB Output is correct
8 Correct 38 ms 4272 KB Output is correct
9 Correct 39 ms 4344 KB Output is correct
10 Correct 37 ms 4348 KB Output is correct

Subtask #4
0 / 45.0

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