zoukankan      html  css  js  c++  java
  • Codeforces 29C Mail Stamps【离散化+DFS】

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    One day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B», they stamp it with «A B», or «B A». Unfortunately, often it is impossible to send a letter directly from the city of the sender to the city of the receiver, that's why the letter is sent via some intermediate cities. Post officers never send a letter in such a way that the route of this letter contains some city more than once. Bob is sure that the post officers stamp the letters accurately.

    There are n stamps on the envelope of Bob's letter. He understands that the possible routes of this letter are only two. But the stamps are numerous, and Bob can't determine himself none of these routes. That's why he asks you to help him. Find one of the possible routes of the letter.

    Input

    The first line contains integer n (1 ≤ n ≤ 105) — amount of mail stamps on the envelope. Then there follow n lines with two integers each — description of the stamps. Each stamp is described with indexes of the cities between which a letter is sent. The indexes of cities are integers from 1 to 109. Indexes of all the cities are different. Every time the letter is sent from one city to another, exactly one stamp is put on the envelope. It is guaranteed that the given stamps correspond to some valid route from some city to some other city.

    Output

    Output n + 1 numbers — indexes of cities in one of the two possible routes of the letter.

    Examples
    input
    2
    1 100
    100 2
    
    output
    2 100 1 
    input
    3
    3 1
    100 2
    3 2
    
    output

    100 2 3 1 
    #include <cstdio>
    #include <set>
    #include <map>
    #include <vector>
    #include <iostream>
    #include <algorithm>
    #define space " "
    using namespace std;
    const int MAXN = 1e6 + 10;
    int u[MAXN], v[MAXN], n;
    map<int, int> fp;
    vector<int> G[MAXN];
    bool vis[MAXN];
    int rec[MAXN];
    void DFS(int u) {
        for(int i = 0; i < G[u].size(); i++) {
            int v = G[u][i];
            if(vis[v]) continue;
            printf(" %d", rec[v]);
            vis[v] = true; DFS(v);
        }
    }
    int main() {
        while (scanf("%d", &n) != EOF) {
            int cnt = 0;
            for(int i = 1; i <= n; i++) {
                scanf("%d%d", &u[i], &v[i]);
                rec[cnt++] = u[i];
                rec[cnt++] = v[i];
                fp[u[i]]++; fp[v[i]]++;
            }
            //先排序
            sort(rec, rec + cnt);
            //去重
            int T = unique(rec, rec + cnt) - rec;
            for(int i = 0; i < T; i++) {
                G[i].clear(); vis[i] = false;
            }
            //离散化
            for(int i = 1; i <= n; i++) {
                int sx = lower_bound(rec, rec+T, u[i]) - rec;
                int ex = lower_bound(rec, rec+T, v[i]) - rec;
                G[sx].push_back(ex); G[ex].push_back(sx);
            }
            for(int i = 0; i < T; i++) {
                if(fp[rec[i]] == 1) {
                    printf("%d", rec[i]);
                    vis[i] = true;
                    DFS(i); break;
                }
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    PHP读取xlsx Excel 文件
    mysql无法创建外键问题
    MySQL数据库远程连接
    CentOS 配置防火墙操作实例(启、停、开、闭端口)
    linux实时查看更新日志命令
    国家/地区 语言缩写代码 查询备用
    php 滑动验证码
    php dirname(__FILE__) 获取当前文件的绝对路径
    PHP cannoy modify header information
    Mysql中用SQL增加、删除、修改(包括字段长度/注释/字段名)总结
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770816.html
Copyright © 2011-2022 走看看