LSM — Sat, 18 Aug 2007 05:03:00 GMT

http://acm.pku.edu.cn/JudgeOnline/problem?id=3349
Snowflake Snow Snowflakes
原来用hash�q�的�Q�后来发现mill竟然排序��p��了，更惊奇的是用了一堆STL的东东�?br>
mill一直是“自食其力”型选手�Q�记得以前连STL里面的sort都懒得用�Q�说自己写快排快些，习惯了。这�ơ再看他代码�Q�吓一跻I��完全变了风格�Q�里面动不动��是STL的东西，copy()�Q�rotate()�Q�reverse()�Q�一堆，�q�有从没见过的lexicographical_compare()�Q�算是长见识了，于是照着写了个，把代码留下，以后�q�用得着�?br>

1//3349
2#include <algorithm>
3using namespace std;
4
5const int N = 100010;
6
7int a[N][6];
8int sign[N];
9
10bool cmp(const int &x, const int &y) {
11    return lexicographical_compare(a[x],a[x]+6,a[y],a[y]+6);
12}
13int main() {
14    freopen("in.txt", "r", stdin);
15    int n, i, j;
16    int b[6];
17    scanf("%d", &n);
18    for(i=0; i<n; i++) {
19        for(j=0; j<6; j++) {
20            scanf("%d", b+j);
21        }
22        copy(b, b+6, a[i]);
23        for(j=0; j<5; j++) {
24            rotate(b, b+1, b+6);
25            if(lexicographical_compare(b, b+6, a[i], a[i]+6))
26                copy(b, b+6, a[i]);
27        }
28        reverse(b, b+6);
29        for(j=0; j<6; j++) {
30            rotate(b, b+1, b+6);
31            if(lexicographical_compare(b, b+6, a[i], a[i]+6))
32                copy(b, b+6, a[i]);
33        }
34        sign[i] = i;
35    }
36    sort(sign, sign+n, cmp);
37    for(i=1; i<n; i++) {
38        if(memcmp(a[sign[i-1]], a[sign[i]], sizeof(a[0])) == 0) {
39            printf("Twin snowflakes found.\n");
40            return 0;
41        }
42    }
43    printf("No two snowflakes are alike.\n");
44    return 0;
45}
46

LSM 2007-08-18 13:03 发表评论

亚洲欧美日韩国产成人,午夜精品一区二区三区四区,亚洲午夜精品网