CCF CSP 竞赛试题——CIDR合并(201812-3)

#include <iostream>
#include <string>
#include <stdio.h>
#include <cctype>
#include <list>
using namespace std;

struct CIDR {
    unsigned address;
    int len;
};

CIDR to_cidr(const string& a) {
    CIDR res;
    int cnt = 0;
    int len = -1;
    for (int i = 0; i < a.size();) {
        int x = 0;
        while (i < a.size() && isdigit(a[i])) x = x * 10 + a[i++] - '0';
        res.address = (res.address << 8) ^ x;
        ++cnt;
        if (i < a.size()) {
            if (a[i] == '.')
                ++i;
            else if (a[i] == '/') {
                len = 0;
                while (++i < a.size() && isdigit(a[i])) len = len * 10 + a[i] - '0';
            }
        }
    }
    res.address <<= 4 - cnt << 3;
    res.len = len == -1 ? cnt << 3 : len;
    return res;
}

bool operator < (const CIDR& lhs, const CIDR& rhs) {
    return lhs.address != rhs.address ? lhs.address < rhs.address : lhs.len < rhs.len;
}

int main() {
    int n;
    cin >> n;
    list<CIDR> cidrs;
    while (n--) {
        string cidr;
        cin >> cidr;
        cidrs.push_back(to_cidr(cidr));
    }
    cidrs.sort();
    for (list<CIDR>::iterator it = cidrs.begin(); it != cidrs.end();) {
        list<CIDR>::iterator cur = it;
        list<CIDR>::iterator next = ++it;
        while (next != cidrs.end() && next->address + (1ull << 32 - next->len) <= cur->address + (1ull << 32 - cur->len))
            next = cidrs.erase(next);
        it = next;
    }
    for (list<CIDR>::iterator it = cidrs.begin(); it != cidrs.end();) {
        list<CIDR>::iterator cur = it;
        list<CIDR>::iterator next = ++it;
        if (next != cidrs.end() && cur->len == next->len && !((cur->address >> 32 - cur->len) & 1) && (cur->address >> 32 - cur->len) + 1 == (next->address >> 32 - next->len)) {
            CIDR newCidr;
            newCidr.address = cur->address;
            newCidr.len = cur->len - 1;
            cur = cidrs.erase(cur);
            cur = cidrs.erase(cur);
            cur = cidrs.insert(cur, newCidr);
            if (cur != cidrs.begin()) --cur;
            it = cur;
        }
    }
    for (list<CIDR>::iterator it = cidrs.begin(); it != cidrs.end(); ++it) {
        cout << (it->address >> 24) << "." << ((it->address >> 16) & 0xff) << "." << ((it->address >> 8) & 0xff) << "." << (it->address & 0xff);
        cout << "/" << it->len << endl;
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值