oj.uz

답안 #280469

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
280469 2020-08-22T19:48:58 Z ElyesChaabouni 이상적인 도시 (IOI12_city) C++14
11 / 100
 1000 ms 3172 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)
{
	vector<int>v[N];
	for(int j = 0; j < N; j++)
	{
		for(int k = j+1; k< N; k++)
		{
			long long x1=abs(X[j]-X[k]), y1=abs(Y[j]-Y[k]);
			long long dis=x1+y1;
			if(dis==1)
			{
				v[k].push_back(j);
				v[j].push_back(k);
			}
		}
	}
	long long ans=0;
	for(int i = 0; i < N; i++)
	{
		//cout << i << ' ' << X[i] << ' ' << Y[i] << '\n';
		set<int>s;
		int nb=1, idx=0;
		vector<int>bfs;
		bfs.push_back(i);
		bool ok=1;
		s.insert(i);
		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 < v[bfs[j]].size(); k++)
				{
					if(!s.count(v[bfs[j]][k]))
					{
						s.insert(v[bfs[j]][k]);
						if(v[bfs[j]][k] < i)
							ans+=nb;
						bfs.push_back(v[bfs[j]][k]);
					}
				}
			}
			nb++;
			idx=l;
		}
	}
  	//ans*=( 1000000000);
	ans%= 1000000000;
	return ans;
}
//size

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 3 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 12 ms 384 KB Output is correct
7 Correct 14 ms 384 KB Output is correct
8 Correct 12 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 14 ms 384 KB Output is correct
11 Correct 15 ms 384 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 366 ms 384 KB Output is correct
2 Correct 398 ms 384 KB Output is correct
3 Correct 876 ms 632 KB Output is correct
4 Correct 953 ms 632 KB Output is correct
5 Execution timed out 1094 ms 512 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1085 ms 3172 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 2764 KB Time limit exceeded
2 Halted 0 ms 0 KB -