Brief description:
A: 二分答案贪心。
B: 两次 bfs();
C: 。子集合问题，问是否存在两个不相交的子集，使得它们的和相等 0w0。。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 | /** ` Micro Mezzo Macro Flation -- Overheated Economy ., **/#include <algorithm>#include <iostream>#include <iomanip>#include <sstream>#include <cstring>#include <cstdio>#include <string>#include <vector>#include <bitset>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <list>#include <set>#include <map>using namespace std;#define REP(i, n) for (int i=0;i<int(n);++i)#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)#define REP_1(i, n) for (int i=1;i<=int(n);++i)#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)#define REP_N(i, n) for (i=0;i<int(n);++i)#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)#define REP_1_N(i, n) for (i=1;i<=int(n);++i)#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)#define REP_C_N(i, n) for (n____=int(n),i=0;i<n____;++i)#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)#define DO(n) while(n--)#define DO_C(n) int n____ = n; while(n____--)#define TO(i, a, b) int s_=a<b?1:-1,b_=b+s_;for(int i=a;i!=b_;i+=s_)#define TO_1(i, a, b) int s_=a<b?1:-1,b_=b;for(int i=a;i!=b_;i+=s_)#define SQZ(i, j, a, b) for (int i=int(a),j=int(b)-1;i<j;++i,--j)#define SQZ_1(i, j, a, b) for (int i=int(a),j=int(b);i<=j;++i,--j)#define REP_2(i, j, n, m) REP(i, n) REP(j, m)#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)#define ALL(A) A.begin(), A.end()#define LLA(A) A.rbegin(), A.rend()#define CPY(A, B) memcpy(A, B, sizeof(A))#define INS(A, P, B) A.insert(A.begin() + P, B)#define ERS(A, P) A.erase(A.begin() + P)#define BSC(A, X) find(ALL(A), X) // != A.end()#define CTN(T, x) (T.find(x) != T.end())#define SZ(A) int(A.size())#define PB push_back#define MP(A, B) make_pair(A, B)#define Rush int T____; RD(T____); DO(T____)#pragma comment(linker, "/STACK:36777216")//#pragma GCC optimize ("O2")#define Ruby system("ruby main.rb")#define Haskell system("runghc main.hs")#define Pascal system("fpc main.pas")typedef long long LL;typedef double DB;typedef unsigned UINT;typedef unsigned long long ULL;typedef vector<int> VI;typedef vector<char> VC;typedef vector<string> VS;typedef vector<LL> VL;typedef vector<DB> VD;typedef set<int> SI;typedef set<string> SS;typedef set<LL> SL;typedef set<DB> SD;typedef map<int, int> MII;typedef map<string, int> MSI;typedef map<LL, int> MLI;typedef map<DB, int> MDI;typedef map<int, bool> MIB;typedef map<string, bool> MSB;typedef map<LL, bool> MLB;typedef map<DB, bool> MDB;typedef pair<int, int> PII;typedef pair<int, bool> PIB;typedef vector<PII> VII;typedef vector<VI> VVI;typedef vector<VII> VVII;typedef set<PII> SII;typedef map<PII, int> MPIII;typedef map<PII, bool> MPIIB;/** I/O Accelerator **//* ... :" We are I/O Accelerator ... Use us at your own risk ;) ... " .. */template<class T> inline void RD(T &);template<class T> inline void OT(const T &);inline int RD(){ int x; RD(x); return x;}template<class T> inline T& _RD(T &x){ RD(x); return x;}inline void RC(char &c){scanf(" %c", &c);}inline void RS(char *s){scanf("%s", s);}template<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}template<class T0, class T1, class T2> inline void RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2);}template<class T0, class T1, class T2, class T3> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3);}template<class T0, class T1, class T2, class T3, class T4> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4);}template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5);}template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6);}template<class T0, class T1> inline void OT(T0 &x0, T1 &x1){OT(x0), OT(x1);}template<class T0, class T1, class T2> inline void OT(T0 &x0, T1 &x1, T2 &x2){OT(x0), OT(x1), OT(x2);}template<class T0, class T1, class T2, class T3> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}template<class T0, class T1, class T2, class T3, class T4> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}template<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}template<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}template<class T> inline void CLR(T &A){A.clear();}template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}template<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}template<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}template<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}template<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2){FLC(A0), FLC(A1), FLC(A2);}template<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3){FLC(A0), FLC(A1), FLC(A2), FLC(A3);}template<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4);}template<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5);}template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5), FLC(A6);}template<class T> inline void SRT(T &A){sort(ALL(A));}template<class T, class C> inline void SRT(T &A, C B){sort(ALL(A), B);}/** Add - On **/const int MOD = 1000000007;const int INF = 0x3f3f3f3f;const DB EPS = 1e-9;const DB OO = 1e15;const DB PI = 3.14159265358979323846264;//M_PI;// <<= ` 0. Daily Use .,template<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}template<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}template <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}template <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}template<class T> inline T max(T a, T b, T c, T d){return max(min(a, b), max(c, d));}template<class T> inline T sqr(T a){return a*a;}template<class T> inline T cub(T a){return a*a*a;}int Ceil(int x, int y){return (x - 1) / y + 1;}// <<= ` 1. Bitwise Operation .,inline bool _1(int x, int i){return x & 1<<i;}inline int _1(int i){return 1<<i;}inline int _U(int i){return _1(i) - 1;};inline int count_bits(int x){ x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1); x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2); x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4); x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8); x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16); return x;}template<class T> inline T low_bit(T x) { return x & -x;}template<class T> inline T high_bit(T x) { T p = low_bit(x); while (p != x) x -= p, p = low_bit(x); return p;}// <<= ' 0. I/O Accelerator interface .,template<class T> inline void RD(T &x){ //cin >> x; scanf("%d", &x); //char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0'; //char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';}int ____Case;template<class T> inline void OT(const T &x){ //printf("Case #%d: ", ++____Case); printf("%d", x); puts("");}/* .................................................................................................................................. */const int dx[] = {0, 1, 0, -1};const int dy[] = {1, 0, -1, 0};const int N = 109;int bottom[N][N], upper[N][N];int h, n, m;inline int water_leval(int t){ return h - t;}struct state{ int x, y, t; state(int _x, int _y, int _t):x(_x), y(_y), t(_t){} int speed(){ if (water_leval(t) - bottom[x][y] >= 20) return 10; return 100; } friend bool operator <(const state& lhs, const state& rhs){ return lhs.t < rhs.t; } friend bool operator >(const state& lhs, const state& rhs){ return lhs.t > rhs.t; }};priority_queue<state, vector<state>, greater<state> > Q;vector<PII> _Q; int head;inline bool legal(int x, int y){ return upper[x][y] - bottom[x][y] >= 50;}inline bool link(int x, int y, int xx, int yy){ return legal(xx, yy) && upper[xx][yy] - bottom[x][y] >= 50 && upper[x][y] - bottom[xx][yy] >= 50;}int open_time(int x, int y, int xx, int yy, int t){ if (!legal(xx, yy)) return INF; return max( (upper[xx][yy] - bottom[x][y] >= 50) ? (water_leval(t) - upper[xx][yy] + 50) : INF, (upper[x][y] - bottom[xx][yy] >= 50) ? (water_leval(t) - upper[x][y] + 50) : INF, 0);}void init(){ RD(h, n, m); RST(bottom, upper); REP_2_1(i, j, n, m) RD(upper[i][j]); REP_2_1(i, j, n, m) RD(bottom[i][j]); CLR(_Q); while (!Q.empty()) Q.pop();}bool C[N][N];void bfs1(){ _Q.PB(MP(1, 1)); RST(C); C[1][1] = true; head = 0; while (head < SZ(_Q)){ int x = _Q[head].first, y = _Q[head].second; REP(i, 4){ int xx = x + dx[i], yy = y + dy[i]; if (!C[xx][yy] && link(x, y, xx, yy)){ if (!open_time(x, y, xx, yy, 0)){ _Q.PB(MP(xx, yy)); C[xx][yy] = true; } } } ++head; }}void bfs2(){ RST(C); REP(i, SZ(_Q)) Q.push(state(_Q[i].first, _Q[i].second, 0)); while (!Q.empty()){ state u = Q.top(); Q.pop(); if (C[u.x][u.y]) continue; C[u.x][u.y] = true; if (u.x == n && u.y == m){ printf("%.1lf\n", (DB) u.t / 10); return; } REP(i, 4){ int xx = u.x + dx[i], yy = u.y + dy[i]; if (C[xx][yy]) continue; if (link(u.x, u.y, xx, yy)){ int tt = open_time(u.x, u.y, xx, yy, u.t); u.t += tt; Q.push( state(xx, yy, u.t + u.speed())); u.t -= tt; } } }}int main(){ //freopen("B-large-practice.in", "r", stdin); //freopen("A-large.in", "r", stdin); freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); Rush{ printf("Case #%d: ", ++____Case); init(); bfs1(); bfs2(); }} |
Alca
Amber
Belleve Invis
Chensiting123
Edward_mj
Fotile96
Hlworld
Kuangbin
Liyaos
Lwins
LYPenny
Mato 完整版
Mikeni2006
Mzry
Nagatsuki
Neko13
Oneplus
Rukata
Seter
Sevenkplus
Sevenzero
Shirleycrow
Vfleaking
wangzhpp
Watashi
WJMZBMR
Wywcgs
XadillaX
Yangzhe
三途川玉子
About.me
Vijos
