QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #405086 | #8229. 栈 | wxqwq# | 0 | 0ms | 3704kb | C++14 | 1.4kb | 2024-05-05 10:53:03 | 2024-05-05 10:53:03 |
answer
#include <bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0;bool f=0;char ch=getchar();
while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return f?-x:x;
}
#define x first
#define y second
#define pb push_back
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long LL;
typedef pair<int,int> PII;
typedef unsigned long long ull;
const int N=1e5+10,M=5010;
int n,m;
void solve1()
{
int op,l,r,x,y;
vector<PII> a[M];
while(m--) {
op=read();
if(op==1) {
l=read(),r=read(),x=read(),y=read();
rep(i,l,r) a[i].pb({x,y});
}
else if(op==2) {
l=read(),r=read(),x=read();
rep(i,l,r) {
while(a[i].size()>0 && a[i].back().x<=x) x-=a[i].back().x,a[i].pop_back();
if(x) a[i].back().x-=x;
}
}
else {
x=read(); LL l,r;
scanf("%lld%lld",&l,&r);
LL ans=0,tot=0;
for(int j=0;j<(int)a[x].size() && tot<=r;j++) {
if(tot>=l && tot+a[x][j].x<=r) ans+=(LL)a[x][j].x*a[x][j].y;
tot+=a[x][j].x;
if(tot-a[x][j].x<l) ans+=(LL)(min(tot,r)-l+1)*a[x][j].y;
else if(tot>r) ans+=(LL)(r-(tot-a[x][j].x))*a[x][j].y;
}
printf("%lld\n",ans);
}
}
}
// struct Query {int op,l,r,x,y;} q[N];
int main()
{
n=read(),m=read();
if(n<=5000 && m<=5000) solve1();
// else {
// int op,l,
// }
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Runtime Error
Test #1:
score: 0
Runtime Error
input:
4907 4910 2 763 3330 1 3 307 1 1 1 2262 3430 22699 89397 1 1915 4000 51541 67587 2 212 2990 9763 2 1086 2162 1 2 1813 4496 16760 1 51 2796 68005 99390 1 1267 1519 74236 66178 3 1768 23808 54314 2 900 4122 27758 3 3287 17350 28989 2 3277 4024 3633 2 444 4866 1 2 353 4219 1061 1 987 3141 99906 17320 2...
output:
result:
Subtask #2:
score: 0
Wrong Answer
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 3460kb
input:
99999 99998 1 5026 18575 27178 90423 3 30623 1 1 3 76936 1 1 1 77021 95683 84664 24734 1 46085 74886 40512 11266 3 5048 8594 22468 1 53318 77721 97151 70784 1 70645 91192 37556 13013 1 56752 56940 91812 62887 1 7928 34576 87339 69404 3 74875 32807 100970 3 22338 17221 25771 3 21421 20602 57957 3 717...
output:
result:
wrong answer Answer contains longer sequence [length = 49797], but output contains 0 elements
Subtask #3:
score: 0
Wrong Answer
Test #12:
score: 0
Wrong Answer
time: 0ms
memory: 3704kb
input:
100000 99993 1 47773 70467 16065 1 2 52349 78446 2304 3 40821 1 1 1 40216 93069 78144 1 1 41089 43671 76025 1 2 35263 68629 31066 3 79881 13534 57327 3 5556 1 1 2 21962 38192 1 1 664 58116 9417 1 3 28089 6039 7989 2 88500 90302 9946 3 63215 49410 60770 2 11069 89527 57581 2 70303 97603 12363 1 3420 ...
output:
result:
wrong answer Answer contains longer sequence [length = 33281], but output contains 0 elements
Subtask #4:
score: 0
Wrong Answer
Test #17:
score: 0
Wrong Answer
time: 0ms
memory: 3540kb
input:
99999 99996 3 77889 1 10000000000 1 6316 86327 89644 386 3 9260 1 10000000000 2 2603 47234 69717 2 20260 73011 19290 2 62477 81233 26127 1 50140 68508 37004 98794 2 14449 22788 16063 1 43860 84932 50375 21777 1 67345 94584 28202 66610 2 661 68654 1 1 14411 94422 82738 61196 1 16563 94416 4920 38408 ...
output:
result:
wrong answer Answer contains longer sequence [length = 33196], but output contains 0 elements
Subtask #5:
score: 0
Skipped
Dependency #1:
0%