zoukankan      html  css  js  c++  java
  • POJ ---2531

    Network Saboteur
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 8751   Accepted: 4070

    Description

    A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts. 
    A disgruntled computer science student Vasya, after being expelled from the university, decided to have his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between two subnetworks. 
    Unfortunately, he found that calculating such worst subdivision is one of those problems he, being a student, failed to solve. So he asks you, a more successful CS student, to help him. 
    The traffic data are given in the form of matrix C, where Cij is the amount of data sent between ith and jth nodes (Cij = Cji, Cii = 0). The goal is to divide the network nodes into the two disjointed subsets A and B so as to maximize the sum ∑Cij (i∈A,j∈B).

    Input

    The first line of input contains a number of nodes N (2 <= N <= 20). The following N lines, containing N space-separated integers each, represent the traffic matrix C (0 <= Cij <= 10000). 
    Output file must contain a single integer -- the maximum traffic between the subnetworks. 

    Output

    Output must contain a single integer -- the maximum traffic between the subnetworks.

    Sample Input

    3
    0 50 30
    50 0 40
    30 40 0
    

    Sample Output

    90

    思路:通过位运算来枚举集合,由于集合的互补性只需要枚举2^(n-1)个集合。

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 using namespace std;
     5 int map[30][30];
     6 int main(){
     7     int N, temp, flow, ans;
     8     //freopen("in.c", "r", stdin);
     9     while(~scanf("%d", &N)){
    10         for(int i = 1;i <= N;i ++){
    11             for(int j = 1;j <= N;j ++)
    12                 scanf("%d", &map[i][j]);
    13         }
    14         ans = -1;
    15         for(int i = 1;i <= (1 << N-1);i ++){
    16             flow = 0;
    17             for(int j = 0;j <= 19;j ++){
    18                 if(i & (1 << j)){
    19                     for(int k = 0;k <= 20;k ++){
    20                         if(!(i & (1 << k))) flow += map[j+1][k+1];
    21                     }
    22                 }
    23             }
    24             ans = max(ans, flow);
    25         }
    26         printf("%d
    ", ans);
    27     }
    28 }


  • 相关阅读:
    获取其他线程的数据用 queue, 多进程Q
    self: 限制并发量asyncio
    asyncio 中给running 的loop 动态添加 Future Task
    雾里看花之 Python Asyncio
    python协程之动态添加任务
    异步IO( asyncio) 协程
    加快phpstorm、rubymine、pycharm系列IDE运行速度的方法
    scrapy 'fcntl' has no attribute 'F_GETFD
    sitemap index
    Django模板系统 运算
  • 原文地址:https://www.cnblogs.com/anhuizhiye/p/3619296.html
Copyright © 2011-2022 走看看