2019 牛客多校第六场 B Shorten IPv6 Address

题目链接：https://ac.nowcoder.com/acm/contest/886/B

题目大意

　　给定一个 128 位的二进制 ip 地址，让你以 16 位一组，每组转成 16 进制，用冒号连接，并且可以选择一次且仅一次把 ip 数组中值连续为 0 的组删去（详情看样例），求如此操作后最短且字典序最小的 ip 字符串。

分析

　　bitset + sprintf。

代码如下

  1 #include <bits/stdc++.h>
  2 using namespace std;
  3  
  4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  5 #define Rep(i,n) for (int i = 0; i < (n); ++i)
  6 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
  7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
  8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
  9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 12  
 13 #define pr(x) cout << #x << " = " << x << "  "
 14 #define prln(x) cout << #x << " = " << x << endl
 15  
 16 #define LOWBIT(x) ((x)&(-x))
 17  
 18 #define ALL(x) x.begin(),x.end()
 19 #define INS(x) inserter(x,x.begin())
 20 #define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
 21 #define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // ?? x ?????? c 
 22 #define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
 23 #define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);
 24  
 25 #define ms0(a) memset(a,0,sizeof(a))
 26 #define msI(a) memset(a,inf,sizeof(a))
 27 #define msM(a) memset(a,-1,sizeof(a))
 28 
 29 #define MP make_pair
 30 #define PB push_back
 31 #define ft first
 32 #define sd second
 33  
 34 template<typename T1, typename T2>
 35 istream &operator>>(istream &in, pair<T1, T2> &p) {
 36     in >> p.first >> p.second;
 37     return in;
 38 }
 39  
 40 template<typename T>
 41 istream &operator>>(istream &in, vector<T> &v) {
 42     for (auto &x: v)
 43         in >> x;
 44     return in;
 45 }
 46 
 47 template<typename T>
 48 ostream &operator<<(ostream &out, vector<T> &v) {
 49     Rep(i, v.size()) out << v[i] << " \n"[i == v.size()];
 50     return out;
 51 }
 52 
 53 template<typename T1, typename T2>
 54 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
 55     out << "[" << p.first << ", " << p.second << "]" << "\n";
 56     return out;
 57 }
 58 
 59 inline int gc(){
 60     static const int BUF = 1e7;
 61     static char buf[BUF], *bg = buf + BUF, *ed = bg;
 62     
 63     if(bg == ed) fread(bg = buf, 1, BUF, stdin);
 64     return *bg++;
 65 } 
 66 
 67 inline int ri(){
 68     int x = 0, f = 1, c = gc();
 69     for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
 70     for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
 71     return x*f;
 72 }
 73 
 74 template<class T>
 75 inline string toString(T x) {
 76     ostringstream sout;
 77     sout << x;
 78     return sout.str();
 79 }
 80 
 81 inline int toInt(string s) {
 82     int v;
 83     istringstream sin(s);
 84     sin >> v;
 85     return v;
 86 }
 87 
 88 //min <= aim <= max
 89 template<typename T>
 90 inline bool BETWEEN(const T aim, const T min, const T max) {
 91     return min <= aim && aim <= max;
 92 }
 93  
 94 typedef long long LL;
 95 typedef unsigned long long uLL;
 96 typedef pair< double, double > PDD;
 97 typedef pair< int, int > PII;
 98 typedef pair< int, PII > PIPII;
 99 typedef pair< string, int > PSI;
100 typedef pair< int, PSI > PIPSI;
101 typedef set< int > SI;
102 typedef set< PII > SPII;
103 typedef vector< int > VI;
104 typedef vector< double > VD;
105 typedef vector< VI > VVI;
106 typedef vector< SI > VSI;
107 typedef vector< PII > VPII;
108 typedef vector< LL > VLL;
109 typedef vector< VLL > VVLL;
110 typedef map< int, int > MII;
111 typedef map< int, string > MIS;
112 typedef map< int, PII > MIPII;
113 typedef map< PII, int > MPIII;
114 typedef map< string, int > MSI;
115 typedef map< string, string > MSS;
116 typedef map< PII, string > MPIIS;
117 typedef map< PII, PII > MPIIPII;
118 typedef multimap< int, int > MMII;
119 typedef multimap< string, int > MMSI;
120 //typedef unordered_map< int, int > uMII;
121 typedef pair< LL, LL > PLL;
122 typedef vector< LL > VL;
123 typedef vector< VL > VVL;
124 typedef priority_queue< int > PQIMax;
125 typedef priority_queue< int, VI, greater< int > > PQIMin;
126 const double EPS = 1e-8;
127 const LL inf = 0x7fffffff;
128 const LL infLL = 0x7fffffffffffffffLL;
129 LL mod = 1e9 + 7;
130 const int maxN = 1e6 + 7;
131 const LL ONE = 1;
132 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
133 const LL oddBits = 0x5555555555555555;
134 
135 int T;
136 bitset< 16 > ip[8];
137 string IP, ans;
138 
139 int main(){
140     //freopen("MyOutput.txt","w",stdout);
141     //freopen("input.txt","r",stdin);
142     //INIT();
143     scanf("%d", &T);
144     For(cases, 1, T) {
145         IP = ":";
146         Rep(i, 8) {
147             cin >> ip[i];
148             char buf[20];
149             
150             sprintf(buf, "%x", ip[i].to_ulong());
151             IP += string(buf) + ":";
152         }
153         
154         string ans = IP.substr(1, IP.size() - 2);
155         rFor(i, IP.size() - 2, 0) {
156             if(IP[i] == '0') { // 记录连续 0 的数量并更新答案 
157                 int cnt = 1, j = i - 3;
158                 
159                 while(j >= 0 && IP[j] == ':' && IP[j + 1] == '0') {
160                     j -= 2;
161                     ++cnt;
162                 }
163                 
164                 if(cnt >= 2) {
165                     j += 3;
166                     string ret = IP.substr(0, j) + IP.substr(i + 1);
167                     
168                     if(ret[1] != ':') ret = ret.substr(1);
169                     if(ret[ret.size() - 2] != ':') ret = ret.substr(0, ret.size() - 1);
170                     
171                     if(ans.size() > ret.size()) ans = ret;
172                     else if(ans.size() == ret.size()) ans = min(ans, ret);
173                     i = j;
174                 }
175             }
176         }
177         
178         cout << "Case #" << cases << ": " << ans << endl;
179     }
180     return 0;
181 }

View Code

 

转载于:https://www.cnblogs.com/zaq19970105/p/11299232.html