oj.uz

Submission #280453

# Submission time Handle Problem Language Result Execution time Memory
280453 2020-08-22T19:28:26 Z ElyesChaabouni Ideal city (IOI12_city) C++14
11 / 100
 1000 ms 2248 KB 
/*#pragma GCC optimize("O3")*/
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define ordered_set tree<int, null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#define eps 1e-9
#define MOD1 998244353
#define MOD2 1000000007
#define INV_10 299473306
#define INF 1000000000
#define PI 3.14159265358979323846
using namespace std;
int inc[4][2]={{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
struct hash_pair { 
    template <class T1, class T2> 
    size_t operator()(const pair<T1, T2>& p) const
    { 
        auto hash1 = hash<T1>{}(p.first); 
        auto hash2 = hash<T2>{}(p.second); 
        return hash1 ^ hash2; 
    } 
};
int DistanceSum(int N, int *X, int *Y)
{
	long long ans=0;
	for(int i = 0; i < N; i++)
	{
		//cout << i << ' ' << X[i] << ' ' << Y[i] << '\n';
		unordered_map<pair<int, int>, int, hash_pair>m;
		for(int j = 0; j < N; j++)
		{
			if(j!=i)
			{
				m[make_pair(X[j], Y[j])]=j;
			}
			else
			{
				m[make_pair(X[j], Y[j])]=-1;
			}
		}
		int nb=1, idx=0;
		vector<pair<int, int> >bfs;
		bfs.push_back(make_pair(X[i], Y[i]));
		bool ok=1;
		while(bfs.size()!=N)
		{
			//cout << nb << '\n';
			int l=bfs.size();
			for(int j = idx; j < l; j++)
			{
				//cout << bfs[j].first << ' ' << bfs[j].second << '\n';
				for(int k = 0; k < 4; k++)
				{
					int xx=bfs[j].first+inc[k][0], yy=bfs[j].second+inc[k][1];
					if(m.count(make_pair(xx, yy)) && m[make_pair(xx, yy)]!=-1)
					{
						if(m[make_pair(xx, yy)] < i)
						{
							ans+=nb;
							ans%=1000000000;
						}
						m[make_pair(xx, yy)]=-1;
						bfs.push_back(make_pair(xx, yy));
					}
				}
			}
			nb++;
			idx=l;
		}
	}
  	//ans*=( 1000000000);
	ans%= 1000000000;
	return ans;
}

Compilation message

city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:45:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |   while(bfs.size()!=N)
      |         ~~~~~~~~~~^~~
city.cpp:44:8: warning: unused variable 'ok' [-Wunused-variable]
   44 |   bool ok=1;
      |        ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 18 ms 384 KB Output is correct
7 Correct 18 ms 384 KB Output is correct
8 Correct 18 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 19 ms 384 KB Output is correct
11 Correct 19 ms 384 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 757 ms 452 KB Output is correct
2 Correct 529 ms 384 KB Output is correct
3 Execution timed out 1096 ms 504 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 2168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 2248 KB Time limit exceeded
2 Halted 0 ms 0 KB -