题解 | Stammering Chemists-2019牛客暑期多校训练营第十场H题

题目来源于牛客竞赛：https://ac.nowcoder.com/acm/contest/discuss
题目描述：

输入描述：

输出描述：

示例1：

题解：

代码：

#include <bits/stdc++.h>
using namespace std;

typedef array<pair<int, int>, 5> molecule;
molecule isomer[] = {
    { { {1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6} } }, // n-hexane
    { { {1, 3}, {2, 3}, {3, 4}, {4, 5}, {5, 6} } }, // 2-methylpentane
    { { {1, 4}, {2, 3}, {3, 4}, {4, 5}, {5, 6} } }, // 3-methylpentane
    { { {1, 4}, {2, 5}, {3, 4}, {4, 5}, {5, 6} } }, // 2,3-dimethylbutane
    { { {1, 4}, {2, 4}, {3, 4}, {4, 5}, {5, 6} } }, // 2,2-dimethylbutane
};

const char *name[] = {
    "n-hexane", "2-methylpentane", "3-methylpentane",
    "2,3-dimethylbutane", "2,2-dimethylbutane"
};

molecule canonicalize(molecule mol) {
    for (auto& p : mol) if (p.first > p.second) swap(p.first, p.second);
    sort(mol.begin(), mol.end());
    return mol;
}

map<molecule, int> moltype;

void init() {
    for (int i = 0; i < 5; i++) {
        molecule mol = isomer[i];
        int perm[7]; iota(perm + 1, perm + 7, 1);
        do {
            molecule cm = mol;
            for (auto& p : cm) {
                p.first = perm[p.first];
                p.second = perm[p.second];
            }
            moltype[canonicalize(cm)] = i;
        } while (next_permutation(perm + 1, perm + 7));
    }
}

int main() {
    init();
    int T; scanf("%d", &T);
    while (T--) {
        molecule mol;
        for (int i = 0; i < 5; i++)
            scanf("%d%d", &mol[i].first, &mol[i].second);
        puts(name[moltype.at(canonicalize(mol))]);
    }
    return 0;
}

更多问题，更详细题解可关注牛客竞赛区，一个刷题、比赛、分享的社区。
传送门：https://ac.nowcoder.com/acm/contest/discuss