#include <stdio.h> #include <iostream> using namespace std; struct klient{ unsigned long long int t; unsigned long int c; }kl[200000]; struct piecyk { unsigned long long int d; unsigned long c; }pi[200000]; unsigned long long int cz[200000]; unsigned long long int pi_t[200000]; int main() { unsigned long long int d,t, delta=0; long n,m,i,j,k,rt = 0, rp = 0; for(k=0; k<200000;k++) { cz[k] = 0; pi_t[k] = 0; kl[k].c = 0; kl[k].t = 0; pi[k].c = 0; pi[k].d = 0; } scanf("%lld %lld", &n, &m); scanf("%llu", &t); kl[rt].c = 1; kl[rt].t = t; for(i=0; i<n-1; i++) { scanf("%llu", &t); if(t == kl[rt].t) { kl[rt].c++; } else { kl[++rt].c = 1; kl[rt].t = t; } } scanf("%llu", &d); pi[rp].c = 1; pi[rp].d = d; for(i=0; i<m-1; i++) { scanf("%llu", &d); if(d == pi[rp].d) { pi[rp].c++; } else { pi[++rp].c = 1; pi[rp].d = d; } } for(i=0; i<rt+1; i++) { for(j=0; j<rp+1; j++) { if((pi_t[j]+pi[j].d)<kl[i].t) { pi_t[j] = kl[i].t; if(kl[i].c>1) { if((kl[i].c%2)==0) { delta = kl[i].c/2; delta *= (kl[i].c-1); } else { delta = (kl[i].c-1)/2; delta *= kl[i].c; } delta*=pi[j].d; cz[j]+= delta; pi_t[j]+=pi[j].d*(kl[i].c-1); } } else { if(kl[i].c>1) { if((kl[i].c%2)==0) { delta = kl[i].c/2; delta *= (kl[i].c-1); } else { delta = (kl[i].c-1)/2; delta *= kl[i].c; } delta*=pi[j].d; } else delta = 0; cz[j]+=(pi_t[j]+pi[j].d-kl[i].t)*kl[i].c+delta; pi_t[j]+=pi[j].d*kl[i].c; } } } for(j=0; j<rp+1; j++) { for(i=0; i<pi[j].c; i++) printf("%llu\n", cz[j]); } 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 | #include <stdio.h> #include <iostream> using namespace std; struct klient{ unsigned long long int t; unsigned long int c; }kl[200000]; struct piecyk { unsigned long long int d; unsigned long c; }pi[200000]; unsigned long long int cz[200000]; unsigned long long int pi_t[200000]; int main() { unsigned long long int d,t, delta=0; long n,m,i,j,k,rt = 0, rp = 0; for(k=0; k<200000;k++) { cz[k] = 0; pi_t[k] = 0; kl[k].c = 0; kl[k].t = 0; pi[k].c = 0; pi[k].d = 0; } scanf("%lld %lld", &n, &m); scanf("%llu", &t); kl[rt].c = 1; kl[rt].t = t; for(i=0; i<n-1; i++) { scanf("%llu", &t); if(t == kl[rt].t) { kl[rt].c++; } else { kl[++rt].c = 1; kl[rt].t = t; } } scanf("%llu", &d); pi[rp].c = 1; pi[rp].d = d; for(i=0; i<m-1; i++) { scanf("%llu", &d); if(d == pi[rp].d) { pi[rp].c++; } else { pi[++rp].c = 1; pi[rp].d = d; } } for(i=0; i<rt+1; i++) { for(j=0; j<rp+1; j++) { if((pi_t[j]+pi[j].d)<kl[i].t) { pi_t[j] = kl[i].t; if(kl[i].c>1) { if((kl[i].c%2)==0) { delta = kl[i].c/2; delta *= (kl[i].c-1); } else { delta = (kl[i].c-1)/2; delta *= kl[i].c; } delta*=pi[j].d; cz[j]+= delta; pi_t[j]+=pi[j].d*(kl[i].c-1); } } else { if(kl[i].c>1) { if((kl[i].c%2)==0) { delta = kl[i].c/2; delta *= (kl[i].c-1); } else { delta = (kl[i].c-1)/2; delta *= kl[i].c; } delta*=pi[j].d; } else delta = 0; cz[j]+=(pi_t[j]+pi[j].d-kl[i].t)*kl[i].c+delta; pi_t[j]+=pi[j].d*kl[i].c; } } } for(j=0; j<rp+1; j++) { for(i=0; i<pi[j].c; i++) printf("%llu\n", cz[j]); } return 0; } |