C++ 解法, 执行用时: 57ms, 内存消耗: 12160KB, 提交时间: 2020-12-21

#include <bits/stdc++.h>
 
using namespace std;
 
const int BUFSIZE = 512;
 
unordered_map<int, int> m;
 
struct Node {
    string a;
    int val;
    Node(char *s): a(s){}
};
 
int process(int r, const char *s) {
    int res = 0;
    for (int i = 0; i < strlen(s); ++i) {
        if (s[i] >= '0' && s[i] <= '9') res = res * r + s[i] - '0';
        else res = res * r + s[i] - 'A' + 10;
    }
    return res;
}
 
int main() {
 
    char a[BUFSIZE];
    vector<Node> v;
    while (1) {
        scanf("%s", a);
        if (!strcmp(a, "END")) break;
        Node node(a);
        char *x, *y;
        x = strtok(a, "#");
        y = strtok(NULL, "#");
        int p = process(atoi(x), y);
        node.val = p;
        v.push_back(node);
        m[p]++;
    }
    int cnt = 0;
    for (auto &c : v) {
        if (m[c.val] == 1) {printf("%s\n", c.a.data()); cnt++;}
    }
    if (!cnt) printf("None\n");
    return 0;
}

C++ 解法, 执行用时: 58ms, 内存消耗: 10640KB, 提交时间: 2020-10-29

#include <bits/stdc++.h>
 
using namespace std;
 
const int BUFSIZE = 512;
 
unordered_map<int, int> m;
 
struct Node {
    string a;
    int val;
    Node(char *s): a(s){}
};
 
int process(int r, const char *s) {
    int res = 0;
    for (int i = 0; i < strlen(s); ++i) {
        if (s[i] >= '0' && s[i] <= '9') res = res * r + s[i] - '0';
        else res = res * r + s[i] - 'A' + 10;
    }
    return res;
}
 
int main() {
 
    char a[BUFSIZE];
    vector<Node> v;
    while (1) {
        scanf("%s", a);
        if (!strcmp(a, "END")) break;
        Node node(a);
        char *x, *y;
        x = strtok(a, "#");
        y = strtok(NULL, "#");
        int p = process(atoi(x), y);
        node.val = p;
        v.push_back(node);
        m[p]++;
    }
    int cnt = 0;
    for (auto &c : v) {
        if (m[c.val] == 1) {printf("%s\n", c.a.data()); cnt++;}
    }
    if (!cnt) printf("None\n");
    return 0;
}