poj 3349
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<vector>
#define MAXNUM 100010
using namespace std;
const int Prime = 99991;
vector<int> hash_mp[Prime];
int mp[MAXNUM][6], k;
bool IsSame(int i,int t)
{
int a, b, count, n;
bool flag;
//clockwise
for (a = 0; a < 6; a++)
{
count = 0;
for (b = 0; b < 6; b++)
{
if (mp[i][b] == mp[t][(b + a) % 6])
count++;
}
if (count == 6)
return true;
}
//counter clockwise
for (a = 0; a < 6; a++)
{
count = 0;
for (b = 0; b < 6; b++)
{
if (mp[i][b] == mp[t][(6 - b + a) % 6])
count++;
}
if (count == 6)
return true;
}
return false;
}
int main()
{
freopen("1.txt", "r", stdin);
int i, j, u, v, w;
long long sum, key, tmp;
scanf("%d", &k);
for (i = 0; i < k; i++)
for (j = 0; j < 6; j++)
scanf("%d", &mp[i][j]);
for (i = 0; i < k; i++)
{
sum = 0;
for (j = 0; j < 6; j++)
{
sum += mp[i][j];
sum = sum%Prime;
}
for (j = 0; j < hash_mp[sum].size(); j++)
{
if (IsSame(i, hash_mp[sum][j]))
{
printf("Twin snowflakes found.\n");
return 0;
}
}
hash_mp[sum].push_back(i);
}
printf("No two snowflakes are alike.\n");
}
poj 3274
本来想的是题目就转换为了这样的:
数组sum[i][j]表示从第1到第i头cow属性j的出现次数。
所以题目要求等价为求满足
sum[i][0]-sum[j][0]=sum[i][1]-sum[j][1]=…..=sum[i][k-1]-sum[j][k-1] (j
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<vector>
#define MAXNUM 100010
#define FORMAT 32
using namespace std;
int mp[MAXNUM][FORMAT];
int N, K;
void toBinary(int n, int* a)
{
int i = 0;
while (n > 0)
{
a[i++] = n%2;
n /= 2;
}
}
bool check(int i, int j)
{
int tmp[FORMAT], t;
tmp[0] = mp[i][0] - mp[j][0];
for (t = 1; t < K; t++)
{
tmp[t] = mp[i][t] - mp[j][t];
if (tmp[t] != tmp[0])
return false;
}
return true;
}
int main()
{
//freopen("1.txt", "r", stdin);
int i, j, u, v, w, tmp, ans;
long long sum, key;
scanf("%d%d", &N, &K);
memset(mp, 0, sizeof(mp));
for (i = 1; i <= N; i++)
{
scanf("%d", &tmp);
toBinary(tmp, mp[i]);
for (j = 0; j < K; j++)
{
mp[i][j] += mp[i - 1][j];
}
}
ans = 0;
for (i = 1; i <= N; i++)
{
for (j = 0; j < i; j++)
{
if (check(i, j))
ans = max(ans, i - j);
}
}
printf("%d\n", ans);
}
结果超时了
将上式变换可得到
sum[i][1]-sum[i][0] = sum[j][1]-sum[j][0]
sum[i][2]-sum[i][0] = sum[j][2]-sum[j][0]
……
sum[i][k-1]-sum[i][0] = sum[j][k-1]-sum[j][0]
而列的运算可以提前一次性完成,计算量会比较小
但是最大数据有10W个,即10W行,因此不能直接枚举找最大距离,必须用Hash查找相同行,找到相同行再比较最大距离。
注意C数组的值可能为负数,因此生成key值时要注意保证key为非负数。