QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #340118 | #8229. 栈 | le0n | 0 | 17ms | 102884kb | C++20 | 1.1kb | 2024-02-28 15:29:08 | 2024-02-28 15:29:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int top[5005];
pair<int, int> stk[5005][5005];
int main()
{
int n, m, i, j, l, r, o;
ll x, y, sum, P;
scanf("%d%d", &n, &m);
while(m--)
{
scanf("%d", &o);
if(o == 1)
{
scanf("%d%d%lld%lld", &l, &r, &x, &y);
for(i = l; i <= r; i++)
stk[i][++top[i]] = make_pair(x, y);
}
if(o == 2)
{
scanf("%d%d%lld", &l, &r, &x);
for(i = l; i <= r; i++)
{
y = x;
while(y && top[i])
{
if(stk[i][top[i]].first > y)
{
stk[i][top[i]].first -= y;
y = 0;
}
else
y -= stk[i][top[i]--].first;
}
}
}
if(o == 3)
{
sum = 0;
scanf("%d%lld%lld", &l, &x, &y);
P = 0;
for(i = 1; i <= top[l]; i++)
{
sum += min(0ll, min(y, P + stk[l][i].first) - max(x - 1, P)) * stk[l][i].second;
P += stk[l][i].first;
}
printf("%lld\n", sum);
}
// for(i = 1; i <= n; i++)
// {
// printf("#%d: ", i);
// for(j = 1; j <= top[i]; j++)
// printf("(%d, %d) ", stk[i][j].first, stk[i][j].second);
// printf("\n");
// }
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 17ms
memory: 102884kb
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:
0 0 0 -1741439031 0 0 0 0 -1545613890 0 0 0 0 0 -47900611 -248154416 -66285786 -942837956 0 -467517424 0 -1266299298 -3297849286 -5386147940 0 0 -2078987358 0 -8578723590 -24534075032 -2825947150 0 -3263776925 0 0 -181612083 0 0 0 0 0 0 0 -5008706813 0 0 0 0 -644277942 0 0 -2046942638 -120313960 0 0...
result:
wrong answer 2nd numbers differ - expected: '3032090730', found: '0'
Subtask #2:
score: 0
Runtime Error
Test #6:
score: 0
Runtime Error
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:
Subtask #3:
score: 0
Runtime Error
Test #12:
score: 0
Runtime Error
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:
Subtask #4:
score: 0
Runtime Error
Test #17:
score: 0
Runtime Error
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:
Subtask #5:
score: 0
Skipped
Dependency #1:
0%