QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#504473 | #9104. Zayin and Forest | WorldFinalEscaped# | AC ✓ | 619ms | 130452kb | C++14 | 2.0kb | 2024-08-04 13:22:59 | 2024-08-04 13:23:00 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO {
const int SIZE = 1 << 21;
char ibuf[SIZE]; int iS, iT;
char obuf[SIZE]; int oT;
inline char gc() {
if (iS == iT) iS = 0, iT = fread(ibuf, 1, SIZE, stdin);
return iS == iT ? EOF : ibuf[iS++];
}
inline void pc(char c) {
obuf[oT++] = c;
if (oT == SIZE) fwrite(obuf, 1, SIZE, stdout), oT = 0;
}
inline ll read() {
ll x = 0, f = 0;
char ch = gc();
while (!isdigit(ch)) f |= ch == '-', ch = gc();
while (isdigit(ch)) x = 10 * x + ch - '0', ch = gc();
return f ? -x : x;
}
inline void print(int64_t x) {
static char buf[65];
int len = 0;
if (x < 0) pc('-'), x = -x;
do { buf[++len] = x % 10 + '0', x /= 10; } while (x);
while (len) pc(buf[len--]);
}
struct Flusher {
~Flusher() {
if (oT)
fwrite(obuf, 1, oT, stdout);
}
} flusher;
}
ll n;
int q;
map<long long, long long> c;
void ins(ll x, int val) {
ll t = 1;
while (x <= n) {
c[x] += t * val;
t++;
x += x & -x;
}
}
ll qry(ll x) {
ll ret = 0;
while (x) {
if (c.count(x)) ret += c[x];
x ^= x & -x;
}
return ret;
}
int main() {
scanf("%lld%d", &n, &q);
while (q--) {
int type = IO::read();
if (type == 1) {
ll x = IO::read();
int v = IO::read();
ins(x, v);
// while (x <= n) {
// ins(x, v);
// x += x & -x;
// }
} else {
ll l = IO::read(), r = IO::read();
IO::print(qry(r) - qry(l - 1));
IO::pc('\n');
}
}
return 0;
}
/*
8 6
1 1 1
1 3 2
1 5 3
1 7 4
2 1 5
2 4 8
*/
/*
1000000000000000000 2
1 1 1
2 1 1000000000000000000
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 47ms
memory: 11340kb
input:
1000000000 20000 2 384578735 526547442 1 64211261 592970906 1 512065247 448267721 1 44993150 127180320 1 880319036 927623947 1 170536687 572121854 1 896600029 804033011 1 666246328 754201635 1 654066651 179982083 2 240989825 984888006 2 372004567 858916479 2 76127818 98606736 1 181794163 902842353 1...
output:
0 43148875202 17613404710 0 32808578044 28190043566 15641637055 78276219892 14955165236 20262224725 105057452192 17002492367 57916137452 27165464255 72766353838 39458327919 38294102627 264448717384 0 70928519548 279674530483 88885017175 111664599432 69703816663 211506104092 104120007714 34403738515 ...
result:
ok 6649 lines
Test #2:
score: 0
Accepted
time: 314ms
memory: 45740kb
input:
1000000000000000000 100000 1 384578735 526547442 1 64211261 592970906 1 512065247 448267721 1 44993150 127180320 1 880319036 927623947 1 170536687 572121854 1 896600029 804033011 2 666246328 931651408754201635 1 654066651 179982083 1 984888006 240989825 1 372004567 858916479 1 76127818 98606736 1 18...
output:
144205553442 497561506762 903930740555 878459229726 689906696633 859703313829 735231510045 1177875391120 1461659121798 1612314483744 2027462020547 1991476058156 2381861014705 2033973986301 2117738140401 2946661001323 2187638958334 2593068002437 1854182975909 2262561461341 3038788266419 3070435321746...
result:
ok 12561 lines
Test #3:
score: 0
Accepted
time: 619ms
memory: 130452kb
input:
1000000000000000000 100000 1 395661363384578735 526547442 1 843068846064211261 592970906 1 550209039512065247 448267721 1 79278526044993150 127180320 1 193676380880319036 927623947 1 81194098170536687 572121854 1 223947079896600029 804033011 2 921340893666246328 931651408754201635 1 3605022006540666...
output:
0 152171177084 261154456848 98759395571 132967101279 214003153997 109857765028 569583036989 221377921411 943235254745 1036051470108 1290577544766 795223506189 1251272020902 662604469794 907615793356 1786684858550 488655543368 1495388560030 1818589934911 151873013358 717984689394 2039336496945 378996...
result:
ok 12561 lines