#include <cstdio> #include <iostream> #include <vector> #include <list> using namespace std; struct SGrass { unsigned long grow; unsigned long count; unsigned long long sum; unsigned long sCount; }; struct SGroup { unsigned long from; unsigned long to; unsigned long long lastD; unsigned long long lastB; SGroup(unsigned long f, unsigned long t, unsigned long long d, unsigned long long b): from(f), to(t), lastD(d), lastB(b) {} }; typedef vector<SGrass> TField; typedef list<SGroup> TGropus; static TField gField; static TGropus gGroups; static vector<unsigned long> growMap; int main() { static const unsigned long invalidIdx = 999999; unsigned long N, M, A, i, tmpCount = 0, fSize = 0; long fIdx, fIdx1; unsigned long long D, B, pD = 0, pB = 0, dD = 0, tmpSum = 0; SGrass tmpGrass; growMap.resize(1000001, 0); cin >> N >> M; for (i = 0; i < N; ++ i) { cin >> A; ++ growMap[A]; } gField.reserve(N); for (i = 1; i <= 1000000; ++ i) { if(growMap[i] > 0) { tmpGrass.grow = i; tmpGrass.count = growMap[i]; tmpSum += i * growMap[i]; tmpGrass.sum = tmpSum; tmpCount += growMap[i]; tmpGrass.sCount = tmpCount; gField.push_back(tmpGrass); growMap[i] = fSize++; } else { growMap[i] = invalidIdx; } } SGrass &fLastIt = gField[fSize-1]; gGroups.push_back(SGroup(gField[0].grow, fLastIt.grow, 0, 0)); for (i = 0; i < M; ++ i) { SGroup &lastG = gGroups.back(); tmpSum = 0; cin >> D >> B; if (lastG.lastB + (D - lastG.lastD) * fLastIt.grow <= B) { cout << 0 << endl; } else { TGropus::iterator gIt, gIt1; for (gIt = gGroups.begin(); gIt != gGroups.end(); ++ gIt) { if (gIt->lastB + (D - gIt->lastD) * gIt->to > B) { long fsIdx; if(B > gIt->lastB) { unsigned long lowestA = (unsigned long)((B - gIt->lastB)/(D-gIt->lastD)); if(lowestA > gIt->from) { while(growMap[lowestA] == invalidIdx) { -- lowestA; } fIdx = growMap[lowestA]; } else { fIdx = growMap[gIt->from]; } } else { fIdx = growMap[gIt->from]; } while(gIt->lastB + (D - gIt->lastD) * gField[fIdx].grow <= B) { ++fIdx; } fsIdx = fIdx; tmpSum = (gIt->lastB + (D - gIt->lastD) * gField[fIdx].grow - B) * gField[fIdx].count; fIdx1 = growMap[gIt->to]; tmpSum += (gField[fIdx1].sum - gField[fIdx].sum) * (D - gIt->lastD) - (B - gIt->lastB) * (gField[fIdx1].sCount - gField[fIdx].sCount); gIt1 = gIt; ++ gIt1; for(; gIt1 != gGroups.end(); ++ gIt1) { fIdx = fIdx1; fIdx1 = growMap[gIt1->to]; tmpSum += (gField[fIdx1].sum - gField[fIdx].sum) * (D - gIt1->lastD) - (B - gIt1->lastB) * (gField[fIdx1].sCount - gField[fIdx].sCount); } -- fsIdx; if(fsIdx < 0 || gField[fsIdx].grow < gIt->from) { gIt->to = fLastIt.grow; gIt->lastD = D; gIt->lastB = B; ++ gIt; if (gIt != gGroups.end()) { gGroups.erase(gIt, gGroups.end()); } } else { gIt->to = gField[fsIdx].grow; ++ gIt; if (gIt != gGroups.end()) { gGroups.erase(gIt, gGroups.end()); } ++ fsIdx; gGroups.push_back(SGroup(gField[fsIdx].grow, fLastIt.grow, D, B)); } cout << tmpSum << endl; break; } } } } 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 | #include <cstdio> #include <iostream> #include <vector> #include <list> using namespace std; struct SGrass { unsigned long grow; unsigned long count; unsigned long long sum; unsigned long sCount; }; struct SGroup { unsigned long from; unsigned long to; unsigned long long lastD; unsigned long long lastB; SGroup(unsigned long f, unsigned long t, unsigned long long d, unsigned long long b): from(f), to(t), lastD(d), lastB(b) {} }; typedef vector<SGrass> TField; typedef list<SGroup> TGropus; static TField gField; static TGropus gGroups; static vector<unsigned long> growMap; int main() { static const unsigned long invalidIdx = 999999; unsigned long N, M, A, i, tmpCount = 0, fSize = 0; long fIdx, fIdx1; unsigned long long D, B, pD = 0, pB = 0, dD = 0, tmpSum = 0; SGrass tmpGrass; growMap.resize(1000001, 0); cin >> N >> M; for (i = 0; i < N; ++ i) { cin >> A; ++ growMap[A]; } gField.reserve(N); for (i = 1; i <= 1000000; ++ i) { if(growMap[i] > 0) { tmpGrass.grow = i; tmpGrass.count = growMap[i]; tmpSum += i * growMap[i]; tmpGrass.sum = tmpSum; tmpCount += growMap[i]; tmpGrass.sCount = tmpCount; gField.push_back(tmpGrass); growMap[i] = fSize++; } else { growMap[i] = invalidIdx; } } SGrass &fLastIt = gField[fSize-1]; gGroups.push_back(SGroup(gField[0].grow, fLastIt.grow, 0, 0)); for (i = 0; i < M; ++ i) { SGroup &lastG = gGroups.back(); tmpSum = 0; cin >> D >> B; if (lastG.lastB + (D - lastG.lastD) * fLastIt.grow <= B) { cout << 0 << endl; } else { TGropus::iterator gIt, gIt1; for (gIt = gGroups.begin(); gIt != gGroups.end(); ++ gIt) { if (gIt->lastB + (D - gIt->lastD) * gIt->to > B) { long fsIdx; if(B > gIt->lastB) { unsigned long lowestA = (unsigned long)((B - gIt->lastB)/(D-gIt->lastD)); if(lowestA > gIt->from) { while(growMap[lowestA] == invalidIdx) { -- lowestA; } fIdx = growMap[lowestA]; } else { fIdx = growMap[gIt->from]; } } else { fIdx = growMap[gIt->from]; } while(gIt->lastB + (D - gIt->lastD) * gField[fIdx].grow <= B) { ++fIdx; } fsIdx = fIdx; tmpSum = (gIt->lastB + (D - gIt->lastD) * gField[fIdx].grow - B) * gField[fIdx].count; fIdx1 = growMap[gIt->to]; tmpSum += (gField[fIdx1].sum - gField[fIdx].sum) * (D - gIt->lastD) - (B - gIt->lastB) * (gField[fIdx1].sCount - gField[fIdx].sCount); gIt1 = gIt; ++ gIt1; for(; gIt1 != gGroups.end(); ++ gIt1) { fIdx = fIdx1; fIdx1 = growMap[gIt1->to]; tmpSum += (gField[fIdx1].sum - gField[fIdx].sum) * (D - gIt1->lastD) - (B - gIt1->lastB) * (gField[fIdx1].sCount - gField[fIdx].sCount); } -- fsIdx; if(fsIdx < 0 || gField[fsIdx].grow < gIt->from) { gIt->to = fLastIt.grow; gIt->lastD = D; gIt->lastB = B; ++ gIt; if (gIt != gGroups.end()) { gGroups.erase(gIt, gGroups.end()); } } else { gIt->to = gField[fsIdx].grow; ++ gIt; if (gIt != gGroups.end()) { gGroups.erase(gIt, gGroups.end()); } ++ fsIdx; gGroups.push_back(SGroup(gField[fsIdx].grow, fLastIt.grow, D, B)); } cout << tmpSum << endl; break; } } } } return 0; } |