CodeForces - 861D D. Polycarp's phone book STL map套set

最新推荐文章于 2019-05-23 20:59:20 发布

Adolphrocs

最新推荐文章于 2019-05-23 20:59:20 发布

阅读量189

点赞数

分类专栏： CodeForces

本文链接：https://blog.csdn.net/Adolphrocs/article/details/89482846

版权

CodeForces 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

problem

There are n phone numbers in Polycarp's contacts on his phone. Each number is a 9-digit integer, starting with a digit different from 0. All the numbers are distinct.

There is the latest version of Berdroid OS installed on Polycarp's phone. If some number is entered, is shows up all the numbers in the contacts for which there is a substring equal to the entered sequence of digits. For example, is there are three phone numbers in Polycarp's contacts: 123456789, 100000000 and 100123456, then:

if he enters 00 two numbers will show up: 100000000 and 100123456,
if he enters 123 two numbers will show up 123456789 and 100123456,
if he enters 01 there will be only one number 100123456.

For each of the phone numbers in Polycarp's contacts, find the minimum in length sequence of digits such that if Polycarp enters this sequence, Berdroid shows this only phone number.

input

The first line contains single integer n (1 ≤ n ≤ 70000) — the total number of phone contacts in Polycarp's contacts.

The phone numbers follow, one in each line. Each number is a positive 9-digit integer starting with a digit from 1 to 9. All the numbers are distinct.

output

Print exactly n lines: the i-th of them should contain the shortest non-empty sequence of digits, such that if Polycarp enters it, the Berdroid OS shows up only the i-th number from the contacts. If there are several such sequences, print any of them.

Examples

9
000
01

题意

给一大堆电话号码，问每个电话号码与其他串不重复的最短子串

题解：STL鬼题map<st, set<>> 表示能以st为标识符的字符串

#include <bits/stdc++.h>

using namespace std;

map <string , set<int> > cnt;
int n;
const int maxn = 7e4+2;
string st;
string Ans[maxn];
int vis[maxn];
int main()
{
    scanf("%d",&n);
    for (int i = 1; i <= n;i++){

        cin >> st;
        for (int l = 1; l <= 9;l++){
            for (int j = 0; j <= 9 - l; j++){
                string st2(st, j, l);
                cnt[st2].insert(i);
            }
        }
    }
    for (map <string, set<int> >::iterator ite = cnt.begin(); ite != cnt.end();ite++){
        pair<string, set<int> > x = *ite;
        string st3 = x.first;
        set <int> num = x.second;
        if (num.size() == 1){
            int x = *num.begin();
            if (Ans[x] == "" || st3.length() < Ans[x].length()) Ans[x] = st3;
        }
    }
    for (int i = 1; i <= n; i++){
        cout << Ans[i] << endl;
    }
    return 0;
}