CCF认证 201812-3 CIDR合并

最新推荐文章于 2020-09-01 18:26:43 发布

策马奔腾向前冲

最新推荐文章于 2020-09-01 18:26:43 发布

阅读量299

点赞数

分类专栏： CCF认证考试

本文链接：https://blog.csdn.net/qq_40597059/article/details/106593397

版权

CCF认证考试专栏收录该内容

14 篇文章 0 订阅

订阅专栏

本文介绍了一种用于合并连续IP地址范围的算法，通过定义IP结构体并实现比较、合并及标准化功能，确保了IP地址的有效性和正确性。该算法首先对输入的IP地址进行预处理，包括标准化和分离具体信息，然后使用自定义的比较和合并操作来消除重复和连续的地址范围，最终输出合并后的IP地址列表。

摘要由CSDN通过智能技术生成

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int N = 100005;
int cnt;
struct IP{ 
    string info;
    unsigned int val;
    int a[4], len;
    bool operator< (const IP & others)const{//重载运算符
        return val != others.val? val < others.val: len < others.len;
    }
    void init(IP others){//同级合并得到a'
        val = others.val, len = others.len - 1;
        for(int i = 0; i < 4; i ++) a[i] = others.a[i];
        info = others.info.substr(0, others.info.find('/') + 1) + to_string(len);
    }
    void norm(){//标准化
        int pos = info.find('/'), counts = count(info.begin(), info.end(), '.');
        if(pos == string::npos)
            info += ("/" + to_string((counts + 1) * 8));
        for(int i = 0; i < 3 - counts; i ++)
            info.insert(info.find('/'), ".0");
    }
    void discrate(){//分离具体信息
        len = stoi(info.substr(info.find('/') + 1));
        string str = info.substr(0, info.find('/'));
        int last = -1;
        val = 0;
        for(int i = 0, now = str.find_first_of('.', last + 1); i < 4; i ++){
            a[i] = stoi(str.substr(last + 1, now - last - 1));
            val = val * 256 + (unsigned int)a[i];
            if(now == str.size()) break;
            last = now, now = str.find_first_of('.', last + 1);
            if(now == string::npos) now = str.size();
        }
    }
    bool legal(){//判断合法性
        return val >> (32 - len) << (32 - len) == val;
        //return (val >> (32 - len - 1) & 1) ^ 1;
    }
    void interval(unsigned int& l, unsigned int& r){//一个ip地址所匹配的所有地址区间
        l = val;
        r = val | (unsigned int)((1ull << (32 - len)) - 1);
    }
}v[N];
bool sub_union(IP ip1, IP ip2, IP& ip){
    if(ip1.len != ip2.len) return false;
    ip.init(ip1);
    if(!ip.legal()) return false;
    unsigned int l, r, l1, r1, l2, r2;
    ip.interval(l, r), ip1.interval(l1, r1), ip2.interval(l2, r2);
    if(r1 + 1 == l2 && l == l1 && r == r2) return true;
    return false;
}
void Union1(){
    int x = 0;
    for(int i = 1; i < cnt; i ++){
        unsigned int l1, r1, l2, r2;
        v[x].interval(l1, r1), v[i].interval(l2, r2);
        if(!(l1 <= l2 && r2 <= r1)) v[++ x] = v[i];
    }
    cnt = x + 1;
}
void Union2(){
    int x = 0;
    IP res; 
    for(int i = 1; i < cnt; i ++){
        if(sub_union(v[x], v[i], res)){
            v[x] = res;
            while(x > 0 && sub_union(v[x - 1], v[x], res))
                v[-- x] = res;
        }
        else v[++ x] = v[i];
    }
    cnt = x + 1;
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
    int n;
    cin >> n;
    for(int i = 0; i < n; i ++){
        cin >> v[i].info;
        v[i].norm(), v[i].discrate(); 
    }
    sort(v, v + n);
    cnt = n;
    Union1(), Union2();
    for(int i = 0; i < cnt; i ++)
        cout << v[i].info << endl;
    return 0;
}