#include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef unsigned long long int ull_t; struct mow { int l, r; ull_t d, b; }; int sb( const vector< mow > & mowv, int i, int C ) { int l = 0, r = C - 1; while( l < r ) { int m = ( l + r ) / 2; if( mowv[m].l <= i && i <= mowv[m].r ) return m; else if( i < mowv[m].l ) r = m - 1; else if( i > mowv[m].r ) l = m + 1; } return l; } int ub( const vector<int> & a, const vector< mow > & mowv, int C, ull_t day, ull_t b ) { int l = 0, r = a.size() - 1; while( l < r ) { int m = ( l + r ) / 2; int mowm = sb( mowv, m, C ); if( mowv[ mowm ].b + ( day - mowv[ mowm ].d ) * a[m] <= b ) { l = m + 1; } else { r = m; } } return l; } void solve( vector<int> & a, const vector< mow > & mowv ) { sort( begin(a), end(a) ); // vector< ull_t > suml( a.size() ); ull_t s = a[0]; for( int i = 1; i < a.size(); ++i ) { suml[i] = s; s += a[i]; } // vector< ull_t > sumr( a.size() ); s = a[ a.size() - 1 ]; for( int i = a.size() - 2; i >= 0; --i ) { sumr[i] = s; s += a[i]; } int C = 1; vector< mow > cmowv( a.size(), { 0, 0, 0, 0 } ); cmowv[0] = { 0, a.size() - 1, 0, 0 }; for( const mow & emow : mowv ) { int l = ub( a, cmowv, C, emow.d, emow.b ); int mowm = sb( cmowv, l, C ); ull_t h = cmowv[ mowm ].b + ( emow.d - cmowv[ mowm ].d ) * a[l]; if( h > emow.b ) { ull_t w = 0; // if( cmowv[ mowm ].b > emow.b ) { w += ( cmowv[ mowm ].b - emow.b ) * ( cmowv[ mowm ].r - cmowv[ mowm ].l + 1 ); w += ( emow.d - cmowv[ mowm ].d ) * ( s - suml[ cmowv[ mowm ].l ] - sumr[ cmowv[ mowm ].r ] ); } else { w += ( emow.d - cmowv[ mowm ].d ) * ( s - suml[ l ] - sumr[ cmowv[ mowm ].r ] ) - ( cmowv[ mowm ].r - l + 1 ) * ( emow.b - cmowv[ mowm ].b ); } // for( int mowi = mowm + 1; mowi < C; ++mowi ) { if( cmowv[ mowi ].b > emow.b ) { w += ( cmowv[ mowi ].b - emow.b ) * ( cmowv[ mowi ].r - cmowv[ mowi ].l + 1 ); w += ( emow.d - cmowv[ mowi ].d ) * ( s - suml[ cmowv[ mowi ].l ] - sumr[ cmowv[ mowi ].r ] ); } else { w += ( emow.d - cmowv[ mowi ].d ) * ( s - suml[ cmowv[ mowi ].l ] - sumr[ cmowv[ mowi ].r ] ) - ( cmowv[ mowi ].r - cmowv[ mowi ].l + 1 ) * ( emow.b - cmowv[ mowi ].b ); } } printf("%llu\n", w); if( l == cmowv[ mowm ].l ) { C = mowm + 1; cmowv[ mowm ].r = a.size() - 1; cmowv[ mowm ].d = emow.d; cmowv[ mowm ].b = emow.b; } else { C = mowm + 2; cmowv[ mowm ].r = l - 1; cmowv[ mowm + 1 ].l = l; cmowv[ mowm + 1 ].r = a.size() - 1; cmowv[ mowm + 1 ].d = emow.d; cmowv[ mowm + 1 ].b = emow.b; } } else { printf("0\n"); } } } int main( int argc, char* argv[] ) { int n, m; scanf("%d %d", & n, & m ); vector< int > a; for( int i = 0; i < n; ++i ) { int aa; scanf("%d", & aa); a.push_back(aa); } vector< mow > mowv; for( int i = 0; i < m; ++i ) { mow amow; scanf("%lld %lld", & amow.d, & amow.b ); mowv.push_back(amow); } solve( a, mowv ); 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 | #include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef unsigned long long int ull_t; struct mow { int l, r; ull_t d, b; }; int sb( const vector< mow > & mowv, int i, int C ) { int l = 0, r = C - 1; while( l < r ) { int m = ( l + r ) / 2; if( mowv[m].l <= i && i <= mowv[m].r ) return m; else if( i < mowv[m].l ) r = m - 1; else if( i > mowv[m].r ) l = m + 1; } return l; } int ub( const vector<int> & a, const vector< mow > & mowv, int C, ull_t day, ull_t b ) { int l = 0, r = a.size() - 1; while( l < r ) { int m = ( l + r ) / 2; int mowm = sb( mowv, m, C ); if( mowv[ mowm ].b + ( day - mowv[ mowm ].d ) * a[m] <= b ) { l = m + 1; } else { r = m; } } return l; } void solve( vector<int> & a, const vector< mow > & mowv ) { sort( begin(a), end(a) ); // vector< ull_t > suml( a.size() ); ull_t s = a[0]; for( int i = 1; i < a.size(); ++i ) { suml[i] = s; s += a[i]; } // vector< ull_t > sumr( a.size() ); s = a[ a.size() - 1 ]; for( int i = a.size() - 2; i >= 0; --i ) { sumr[i] = s; s += a[i]; } int C = 1; vector< mow > cmowv( a.size(), { 0, 0, 0, 0 } ); cmowv[0] = { 0, a.size() - 1, 0, 0 }; for( const mow & emow : mowv ) { int l = ub( a, cmowv, C, emow.d, emow.b ); int mowm = sb( cmowv, l, C ); ull_t h = cmowv[ mowm ].b + ( emow.d - cmowv[ mowm ].d ) * a[l]; if( h > emow.b ) { ull_t w = 0; // if( cmowv[ mowm ].b > emow.b ) { w += ( cmowv[ mowm ].b - emow.b ) * ( cmowv[ mowm ].r - cmowv[ mowm ].l + 1 ); w += ( emow.d - cmowv[ mowm ].d ) * ( s - suml[ cmowv[ mowm ].l ] - sumr[ cmowv[ mowm ].r ] ); } else { w += ( emow.d - cmowv[ mowm ].d ) * ( s - suml[ l ] - sumr[ cmowv[ mowm ].r ] ) - ( cmowv[ mowm ].r - l + 1 ) * ( emow.b - cmowv[ mowm ].b ); } // for( int mowi = mowm + 1; mowi < C; ++mowi ) { if( cmowv[ mowi ].b > emow.b ) { w += ( cmowv[ mowi ].b - emow.b ) * ( cmowv[ mowi ].r - cmowv[ mowi ].l + 1 ); w += ( emow.d - cmowv[ mowi ].d ) * ( s - suml[ cmowv[ mowi ].l ] - sumr[ cmowv[ mowi ].r ] ); } else { w += ( emow.d - cmowv[ mowi ].d ) * ( s - suml[ cmowv[ mowi ].l ] - sumr[ cmowv[ mowi ].r ] ) - ( cmowv[ mowi ].r - cmowv[ mowi ].l + 1 ) * ( emow.b - cmowv[ mowi ].b ); } } printf("%llu\n", w); if( l == cmowv[ mowm ].l ) { C = mowm + 1; cmowv[ mowm ].r = a.size() - 1; cmowv[ mowm ].d = emow.d; cmowv[ mowm ].b = emow.b; } else { C = mowm + 2; cmowv[ mowm ].r = l - 1; cmowv[ mowm + 1 ].l = l; cmowv[ mowm + 1 ].r = a.size() - 1; cmowv[ mowm + 1 ].d = emow.d; cmowv[ mowm + 1 ].b = emow.b; } } else { printf("0\n"); } } } int main( int argc, char* argv[] ) { int n, m; scanf("%d %d", & n, & m ); vector< int > a; for( int i = 0; i < n; ++i ) { int aa; scanf("%d", & aa); a.push_back(aa); } vector< mow > mowv; for( int i = 0; i < m; ++i ) { mow amow; scanf("%lld %lld", & amow.d, & amow.b ); mowv.push_back(amow); } solve( a, mowv ); return 0; } |