#include <cstdio> #include <cstring> #include <iostream> #include <string> #include <vector> using namespace std; typedef long long TInt64; typedef unsigned long TUint32; struct SBoy { TInt64 pocket; TInt64 balance; TInt64 minimum; }; typedef vector<TUint32> TCandidates; static const long HAZ_MAX_SIZE = 1000000; static const long HAZ_INVALID_IDX = HAZ_MAX_SIZE + 1; static SBoy gBoys[HAZ_MAX_SIZE]; static string gCycle; static long N, M; static TInt64 NM;//, G4C; inline TInt64 getNWW(TInt64 a, TInt64 b) { TInt64 tmp = a%b, a1, b1 = b; while(tmp != 0) { a1 = b1; b1 = tmp; tmp = a1%b1; } return (a*b)/b1; } inline TUint32 min(TUint32 a, TUint32 b) { return (a < b)? a:b; } inline TInt64 getCycleNum(TUint32 idx) { TInt64 loss = -gBoys[idx].balance, maxLoss = -gBoys[idx].minimum, pocket = gBoys[idx].pocket, result = 0; while(true) { if(pocket - maxLoss <= 0) { break; } pocket -= loss; ++ result; } return result; } int main() { long i, boyIdx = 0, cycleIdx = 0, maxI, diff; TInt64 NMCycles = HAZ_INVALID_IDX, tmpCycles, gameIdx = 0;//, tmpRest; bool bFinish = false; TCandidates cand; cin >> N; memset(gBoys, 0, N*sizeof(SBoy)); for (i = 0; i < N; ++ i) { cin >> gBoys[i].pocket; } cin >> M; NM = getNWW(N, M); //G4C = NM/N; gCycle.resize(M+1); cin.getline(&gCycle[0], 1); cin.getline(&gCycle[0], M+1); while(!bFinish && gameIdx < NM) { if (boyIdx >= N) { boyIdx = 0; } if (cycleIdx >= M) { cycleIdx = 0; } maxI = min(N-boyIdx, M-cycleIdx); for (i = 0; i < maxI; ++ i) { if(gCycle[cycleIdx] == 'W') { gBoys[boyIdx].balance += 1; } else { gBoys[boyIdx].balance -= 1; if(gBoys[boyIdx].balance < gBoys[boyIdx].minimum) { gBoys[boyIdx].minimum = gBoys[boyIdx].balance; } } if (gBoys[boyIdx].pocket + gBoys[boyIdx].balance <= 0) { bFinish = true; break; } ++ boyIdx; ++ cycleIdx; ++ gameIdx; } } if (bFinish) { cout << gameIdx + 1; } else { boyIdx = HAZ_INVALID_IDX; for(i = 0; i < N; ++ i) { if(gBoys[i].balance < 0) { tmpCycles = getCycleNum(i); if(tmpCycles < NMCycles) { NMCycles = tmpCycles; cand.clear(); cand.push_back(i); } else if(tmpCycles == NMCycles) { cand.push_back(i); } } } if(cand.empty()) { cout << -1; } else { gameIdx = cand[0]; boyIdx = 0; diff = cand[0]; cycleIdx = 0; for(i = 0; i < cand.size(); ++ i) { gBoys[cand[i]].pocket += NMCycles * gBoys[cand[i]].balance; } while(gameIdx < NM) { cycleIdx += diff; cycleIdx %= M; gBoys[cand[boyIdx]].pocket += (gCycle[cycleIdx] == 'W')? 1 : -1; if(gBoys[cand[boyIdx]].pocket <= 0) { cout << NMCycles*NM + gameIdx + 1; break; } if(boyIdx == cand.size()-1) { diff = N - cand[boyIdx] + cand[0]; boyIdx = 0; } else { diff = cand[boyIdx+1] - cand[boyIdx]; ++ boyIdx; } gameIdx += diff; } } } return 0; }
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 | #include <cstdio> #include <cstring> #include <iostream> #include <string> #include <vector> using namespace std; typedef long long TInt64; typedef unsigned long TUint32; struct SBoy { TInt64 pocket; TInt64 balance; TInt64 minimum; }; typedef vector<TUint32> TCandidates; static const long HAZ_MAX_SIZE = 1000000; static const long HAZ_INVALID_IDX = HAZ_MAX_SIZE + 1; static SBoy gBoys[HAZ_MAX_SIZE]; static string gCycle; static long N, M; static TInt64 NM;//, G4C; inline TInt64 getNWW(TInt64 a, TInt64 b) { TInt64 tmp = a%b, a1, b1 = b; while(tmp != 0) { a1 = b1; b1 = tmp; tmp = a1%b1; } return (a*b)/b1; } inline TUint32 min(TUint32 a, TUint32 b) { return (a < b)? a:b; } inline TInt64 getCycleNum(TUint32 idx) { TInt64 loss = -gBoys[idx].balance, maxLoss = -gBoys[idx].minimum, pocket = gBoys[idx].pocket, result = 0; while(true) { if(pocket - maxLoss <= 0) { break; } pocket -= loss; ++ result; } return result; } int main() { long i, boyIdx = 0, cycleIdx = 0, maxI, diff; TInt64 NMCycles = HAZ_INVALID_IDX, tmpCycles, gameIdx = 0;//, tmpRest; bool bFinish = false; TCandidates cand; cin >> N; memset(gBoys, 0, N*sizeof(SBoy)); for (i = 0; i < N; ++ i) { cin >> gBoys[i].pocket; } cin >> M; NM = getNWW(N, M); //G4C = NM/N; gCycle.resize(M+1); cin.getline(&gCycle[0], 1); cin.getline(&gCycle[0], M+1); while(!bFinish && gameIdx < NM) { if (boyIdx >= N) { boyIdx = 0; } if (cycleIdx >= M) { cycleIdx = 0; } maxI = min(N-boyIdx, M-cycleIdx); for (i = 0; i < maxI; ++ i) { if(gCycle[cycleIdx] == 'W') { gBoys[boyIdx].balance += 1; } else { gBoys[boyIdx].balance -= 1; if(gBoys[boyIdx].balance < gBoys[boyIdx].minimum) { gBoys[boyIdx].minimum = gBoys[boyIdx].balance; } } if (gBoys[boyIdx].pocket + gBoys[boyIdx].balance <= 0) { bFinish = true; break; } ++ boyIdx; ++ cycleIdx; ++ gameIdx; } } if (bFinish) { cout << gameIdx + 1; } else { boyIdx = HAZ_INVALID_IDX; for(i = 0; i < N; ++ i) { if(gBoys[i].balance < 0) { tmpCycles = getCycleNum(i); if(tmpCycles < NMCycles) { NMCycles = tmpCycles; cand.clear(); cand.push_back(i); } else if(tmpCycles == NMCycles) { cand.push_back(i); } } } if(cand.empty()) { cout << -1; } else { gameIdx = cand[0]; boyIdx = 0; diff = cand[0]; cycleIdx = 0; for(i = 0; i < cand.size(); ++ i) { gBoys[cand[i]].pocket += NMCycles * gBoys[cand[i]].balance; } while(gameIdx < NM) { cycleIdx += diff; cycleIdx %= M; gBoys[cand[boyIdx]].pocket += (gCycle[cycleIdx] == 'W')? 1 : -1; if(gBoys[cand[boyIdx]].pocket <= 0) { cout << NMCycles*NM + gameIdx + 1; break; } if(boyIdx == cand.size()-1) { diff = N - cand[boyIdx] + cand[0]; boyIdx = 0; } else { diff = cand[boyIdx+1] - cand[boyIdx]; ++ boyIdx; } gameIdx += diff; } } } return 0; } |