# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
591308 |
2022-07-07T09:03:18 Z |
장태환(#8418) |
Two Dishes (JOI19_dishes) |
C++17 |
|
457 ms |
9640 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int psuma[200100];
int psumb[200100];
int lima[200100], limb[200100];
int vala[200100], valb[200100];
signed main()
{
int N, M;
cin >> N >> M;
int i;
for (i = 0; i < N; i++)
{
cin >> psuma[i+1];
cin >> lima[i];
cin >> vala[i+1];
vala[i + 1] += vala[i];
if (i)
psuma[i+1] += psuma[i];
}
for (i = 0; i < M; i++)
{
cin >> psumb[i+1];
cin >> limb[i];
cin >> valb[i+1];
valb[i + 1] += valb[i];
if (i)
psumb[i+1] += psumb[i];
}
int l = M;
int ans = 0;
for (i = 0; i <= N; i++)
{
if (l >= 0 && psumb[l]+psuma[i] > limb[0])
{
l--;
}
if (l >= 0)
ans = max(vala[i], valb[l]);
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
457 ms |
9640 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
457 ms |
9640 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
457 ms |
9640 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |