QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #85586 | #5657. Hungry Cow | kkio | 0 | 77ms | 521692kb | C++14 | 2.7kb | 2023-03-07 21:45:11 | 2023-03-07 21:45:13 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+10;
const int N=1e15;
struct node
{int ls,rs,cnt,val,tag;node(){ls=rs=cnt=val=tag=0;}};
struct segtree{
node tr[maxn*130];
int tot;
inline void pushtg(int i,int l,int r)
{
tr[i].tag=1;
tr[i].cnt=r-l+1;
tr[i].val=(r+l)*(r-l+1)/2;
}
inline void pushup(int i)
{
if(tr[i].tag)return;
tr[i].cnt=(tr[tr[i].ls].cnt+tr[tr[i].rs].cnt);
tr[i].val=(tr[tr[i].ls].val+tr[tr[i].rs].val);
return;
}
void update(int &i,int p,int l,int r,int L,int R)
{
tr[i=++tot]=tr[p];
if(L<=l&&r<=R)
{
pushtg(i,l,r);
return;
}
int mid=l+r>>1;
if(L<=mid)update(tr[i].ls,tr[i].ls,l,mid,L,R);
if(R>mid)update(tr[i].rs,tr[i].rs,mid+1,r,L,R);
pushup(i);
//printf("%lld %lld %lld %lld\n",l,r,tr[i].val,tr[i].cnt);
}
int query(int i,int l,int r,int L,int R,bool on)
{
if(!i)return on?(min(R,r)-max(L,l)+1):0;
on|=tr[i].tag;
if(L<=l&&r<=R)
return on?(r-l+1):tr[i].cnt;
int mid=l+r>>1;
if(R<=mid)return query(tr[i].ls,l,mid,L,R,on);
if(L>mid)return query(tr[i].rs,mid+1,r,L,R,on);
return query(tr[i].ls,l,mid,L,R,on)+query(tr[i].rs,mid+1,r,L,R,on);
}
int find(int i,int l,int r,int R,bool on)
{
if(!i)return l+R-1;
if(l==r)return l;
int mid=l+r>>1;
on|=tr[i].tag;
int suml=on?0:(mid-l+1-tr[tr[i].ls].cnt);
// printf("%lld %lld %lld\n",l,r,suml);
if(suml>R)return find(tr[i].ls,l,mid,R,on);
else return find(tr[i].rs,mid+1,r,R-suml,on);
}
}T;
vector< pair<int,int> > O[maxn<<2];
void addoption(int i,int l,int r,int L,int R,int d,int b)
{
if(L<=l&&r<=R)
{
O[i].push_back({d,b});
return;
}
int mid=l+r>>1;
if(L<=mid)addoption(i<<1,l,mid,L,R,d,b);
if(R>mid)addoption(i<<1|1,mid+1,r,L,R,d,b);
return;
}
int rt;
inline void add(int d,int b)
{
int x=T.query(rt,1,N,1,d-1,0);
// printf("%lld\n",x);
int to=T.find(rt,1,N,d+b-x-1,0);
// printf("!%lld %lld\n",d,to);
T.update(rt,rt,1,N,d,to);
}
int ans[maxn];
void dfs(int i,int l,int r)
{
int m=T.tot;
int rtnow=rt;
int mid=l+r>>1;
for(auto p:O[i])
{
printf("%lld %lld %lld %lld\n",l,r,p.first,p.second);
add(p.first,p.second);
}
if(l==r)
ans[l]=T.tr[rt].val;
else
{
dfs(i<<1,l,mid);
dfs(i<<1|1,mid+1,r);
}
rt=rtnow;
for(int i=m;i<=T.tot;i++)T.tr[i]=node();
T.tot=m;
}
int n;
map< int ,pair<int,int> > mp;
signed main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
int d,b;
scanf("%lld%lld",&d,&b);
if(mp.count(d))
addoption(1,1,n,mp[d].second,i-1,d,mp[d].first);
mp[d]={b,i};
}
for(auto p:mp)
{
int b=p.second.first,i=p.second.second;
addoption(1,1,n,i,n,p.first,b);
}
dfs(1,1,n);
for(int i=1;i<=n;i++)
printf("%lld\n",ans[i]);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 60ms
memory: 520828kb
input:
3 4 3 1 5 1 2
output:
1 3 4 3 2 2 1 5 3 3 1 2 15 36 18
result:
wrong answer 1st numbers differ - expected: '15', found: '1'
Test #2:
score: 0
Wrong Answer
time: 77ms
memory: 520908kb
input:
9 1 89 30 7 101 26 1 24 5 1 60 4 5 10 101 0 1 200
output:
1 3 1 89 2 2 30 7 3 3 101 26 3 3 30 7 4 5 101 26 4 5 1 24 4 5 30 7 5 5 5 1 6 9 30 7 6 9 60 4 6 7 101 26 6 7 1 24 6 6 5 1 7 7 5 10 8 9 5 10 8 9 101 0 8 8 1 24 9 9 1 200 4005 4656 7607 3482 3507 3753 4058 1107 24531
result:
wrong answer 1st numbers differ - expected: '4005', found: '1'
Test #3:
score: 0
Wrong Answer
time: 76ms
memory: 521692kb
input:
5000 1 255364995 414918035 212844 1 112266691 321122438 191414 1 277615842 848755093 61676 1 432591689 892259443 53755 1 263753018 173404455 173565 1 178341924 878941367 221276 1 65332960 439468128 240741 1 812238377 191076090 108732 1 180383041 927440330 112995 1 595696140 579818784 85614 1 5057816...
output:
1 2 1 255364995 2 2 414918035 212844 3 3 1 112266691 3 3 414918035 212844 4 5 321122438 191414 4 5 414918035 212844 4 4 1 112266691 5 5 1 277615842 6 10 321122438 191414 6 10 414918035 212844 6 10 848755093 61676 6 6 1 277615842 7 7 1 432591689 8 8 1 432591689 8 8 892259443 53755 9 10 1 263753018 9 ...
result:
wrong answer 1st numbers differ - expected: '235118030', found: '1'
Test #4:
score: 0
Memory Limit Exceeded
input:
100000 1 500000000 1000000001 500000000 2000000001 500000000 3000000001 500000000 4000000001 500000000 5000000001 500000000 6000000001 500000000 7000000001 500000000 8000000001 500000000 9000000001 500000000 10000000001 500000000 11000000001 500000000 12000000001 500000000 13000000001 500000000 1400...
output:
result:
Test #5:
score: 0
Memory Limit Exceeded
input:
100000 49998999950002 500000000 49997999950003 500000000 49996999950004 500000000 49995999950005 500000000 49994999950006 500000000 49993999950007 500000000 49992999950008 500000000 49991999950009 500000000 49990999950010 500000000 49989999950011 500000000 49988999950012 500000000 49987999950013 500...
output:
result:
Test #6:
score: 0
Memory Limit Exceeded
input:
100000 92303348842417 121458 92270522994821 852054850 93765096269940 752161890 97779083359973 984327853 90030769679569 439157849 99462493683485 45660 95578441605501 614317411 92236129196525 474149928 96065411631989 429943696 90394247621798 382840249 89263934750729 791122796 93577089467158 99679481 9...
output:
result:
Test #7:
score: 0
Memory Limit Exceeded
input:
100000 98001410246890 641673458 94816407430628 495030536 95979591652947 43208 95979591652947 183686 97163521776290 904784415 91640049592559 875129980 95914835187460 844802426 94846379383324 974270031 99639652388956 311664277 99298294827771 913614463 99476866913169 221766107 97248342663994 669489020 ...
output:
result:
Test #8:
score: 0
Memory Limit Exceeded
input:
100000 97338601145206 191999210 97657969728741 875988993 92559675348135 8552565 99354409480201 960853995 93648768326445 343671323 97400841247229 104463842 98844341051398 508718383 96144328794112 187050711 98030257583732 365513 92378049740181 852725611 98301676983212 360931360 99458914124366 80234576...
output:
result:
Test #9:
score: 0
Memory Limit Exceeded
input:
100000 96119987448606 658315028 98644701118435 280992389 98180676447908 56168 99822794299596 237183170 94655838918825 563695131 95744558879343 686204820 93739311062176 263266841 97630990881452 96901680 98683433984282 380708175 98141920320037 147598812 98095513966598 814629225 97882900659205 55097258...
output:
result:
Test #10:
score: 0
Memory Limit Exceeded
input:
100000 98169641631056 170946511 99452522210742 393032132 98797460964704 393706377 98747209012224 529219651 99152468691953 362194103 99410753036475 215295 97096873124809 1315725 96106202009957 124516158 95176405230280 853965254 99359463136784 622839995 96635771520630 550456203 96368792029394 93630831...
output:
result:
Test #11:
score: 0
Memory Limit Exceeded
input:
100000 97499080763005 475255826 97499083333242 9347 97499080763005 395470349 97499924236501 4654 97499080763005 148122052 97499213182916 2365 97499080763005 544025506 97499777050346 9912 97499080763005 41736833 97499401163067 12607 97499080763005 127843558 97499125181305 7144 97499080763005 13152858...
output:
result:
Test #12:
score: 0
Memory Limit Exceeded
input:
100000 98999026537234 929244389 98999182418499 5182 98999026537234 774643967 98999646433835 17857 98999026537234 760743518 98999980664456 7597 98999026537234 573421161 98999090975969 6621 98999026537234 95191521 98999947586610 17798 98999026537234 953104244 98999116462517 15643 98999026537234 100617...
output:
result:
Test #13:
score: 0
Memory Limit Exceeded
input:
100000 99499024212061 630391525 99499061152079 3864 99499024212061 16505706 99499878275777 4812 99499024212061 776185964 99499757280269 12059 99499024212061 356565635 99499399237611 8902 99499024212061 972528120 99499256994518 9171 99499024212061 419476867 99499909552451 17146 99499024212061 6767939...
output:
result:
Test #14:
score: 0
Memory Limit Exceeded
input:
99999 10490328589436 1000000000 13762508396295 1000000000 40632115714511 1000000000 32834989282081 1000000000 29091918306598 1000000000 24352818172350 1000000000 23447797352860 1000000000 38073075086135 1000000000 14288530509239 1000000000 36463049009868 1000000000 10562334120356 1000000000 34490016...
output:
result:
Test #15:
score: 0
Memory Limit Exceeded
input:
99999 61585049539216 1000000000 58981995705940 1000000000 44247484521936 1000000000 70916218483207 1000000000 47696673638497 1000000000 60781033156530 1000000000 55859922511212 1000000000 59143999312357 1000000000 57175954090596 1000000000 71328224891428 1000000000 46047599292678 1000000000 47510666...
output:
result:
Test #16:
score: 0
Memory Limit Exceeded
input:
99999 21219982576425 1000000000 42260400232639 1000000000 26412110792985 1000000000 11035481121988 1000000000 13219690258669 1000000000 19550933913223 1000000000 32679237390903 1000000000 15679803374289 1000000000 23896051833122 1000000000 20099950455987 1000000000 14778766729432 1000000000 21547991...
output:
result:
Test #17:
score: 0
Memory Limit Exceeded
input:
99999 28503598869279 1000000000 32397709666940 1000000000 25833502058723 1000000000 38020841213328 1000000000 54560138759501 1000000000 42230929758874 1000000000 28972613620824 1000000000 28498598787317 1000000000 54070131397843 1000000000 22084267818956 1000000000 37776835952805 1000000000 44465973...
output:
result:
Test #18:
score: 0
Memory Limit Exceeded
input:
99999 18175781548542 1000000000 40883228277118 1000000000 33828113807745 1000000000 17817771477758 1000000000 22749897023579 1000000000 18015777423352 1000000000 28920025506062 1000000000 18799798298070 1000000000 27979006765970 1000000000 17103749421004 1000000000 24329932307643 1000000000 29798042...
output:
result:
Test #19:
score: 0
Memory Limit Exceeded
input:
99999 13631696063382 1000000000 19095823575649 1000000000 18048800926387 1000000000 17060779354093 1000000000 15768748767399 1000000000 30886037572930 1000000000 26814970558482 1000000000 8165534157289 1000000000 27914989206121 1000000000 34170089895536 1000000000 27764986366439 1000000000 145187181...
output:
result:
Test #20:
score: 0
Memory Limit Exceeded
input:
99999 71091006018203 1000000000 42267334298998 1000000000 53421686894439 1000000000 52992676205010 1000000000 49055576058012 1000000000 70721000416119 1000000000 43151374327143 1000000000 70716000332404 1000000000 51528640431406 1000000000 65945925001029 1000000000 39524135856472 1000000000 66414932...
output:
result:
Test #21:
score: 0
Memory Limit Exceeded
input:
99999 43981987091230 1000000000 41793950053258 1000000000 23385527966154 1000000000 32049759202175 1000000000 48927065970165 1000000000 26694629471843 1000000000 27661655640242 1000000000 37241867113918 1000000000 49110069037684 1000000000 20323405372655 1000000000 43304975621086 1000000000 48021052...
output:
result:
Test #22:
score: 0
Memory Limit Exceeded
input:
99999 31159466866911 1000000000 28413414847308 1000000000 25948364344910 1000000000 31236468095715 1000000000 22036273821032 1000000000 24056321657736 1000000000 36031551606814 1000000000 37935581367999 1000000000 40624624246259 1000000000 18857191994835 1000000000 22179277697755 1000000000 29154428...