| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 198943 |
2020-01-28T08:44:45 Z |
SamAnd |
Salesman (IOI09_salesman) |
C++17 |
|
1000 ms |
49528 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 500005, m = 500001, INF = 1000000009;
struct ban
{
int t, x, m;
};
bool operator<(const ban& a, const ban& b)
{
return a.t < b.t;
}
bool so1(const ban& a, const ban& b)
{
return a.x < b.x;
}
int n;
int d, u;
int s;
ban a[N];
vector<int> t1, t2;
void ubd(vector<int>& t, int tl, int tr, int l, int r, int b, int k, int pos)
{
if (l > r)
return;
if (tl == l && tr == r)
{
t[pos] = max(t[pos], b);
return;
}
int m = (tl + tr) / 2;
ubd(t, tl, m, l, min(m, r), b, k, pos * 2);
ubd(t, m + 1, tr, max(m + 1, l), r, b, k, pos * 2 + 1);
}
int qry(vector<int>& t, int tl, int tr, int x, int k, int pos)
{
if (tl == tr)
{
return t[pos] + (k * x);
}
int m = (tl + tr) / 2;
if (x <= m)
return max(qry(t, tl, m, x, k, pos * 2), t[pos] + (k * x));
else
return max(qry(t, m + 1, tr, x, k, pos * 2 + 1), t[pos] + (k * x));
}
void solv1()
{
sort(a + 1, a + n + 1);
t1.assign(4 * N, -INF);
t2.assign(4 * N, -INF);
ubd(t1, 1, m, 1, s, -s * d, d, 1);
ubd(t2, 1, m, s, m, s * u, -u, 1);
for (int i = 1; i <= n; ++i)
{
int ans = max(qry(t1, 1, m, a[i].x, d, 1), qry(t2, 1, m, a[i].x, -u, 1)) + a[i].m;
ubd(t1, 1, m, 1, a[i].x, ans - a[i].x * d, d, 1);
ubd(t2, 1, m, a[i].x, m, ans + a[i].x * u, -u, 1);
}
int ans = max(qry(t1, 1, m, s, d, 1), qry(t2, 1, m, s, -u, 1));
printf("%d\n", ans);
}
vector<ban> v[N];
int ansv[N];
int qryy[N];
int main()
{
//freopen("input.txt", "r", stdin);
scanf("%d%d%d%d", &n, &d, &u, &s);
for (int i = 1; i <= n; ++i)
scanf("%d%d%d", &a[i].t, &a[i].x, &a[i].m);
//solv1();
for (int i = 1; i <= n; ++i)
v[a[i].t].push_back(a[i]);
t1.assign(4 * N, -INF);
t2.assign(4 * N, -INF);
ubd(t1, 1, m, 1, s, -s * d, d, 1);
ubd(t2, 1, m, s, m, s * u, -u, 1);
for (int i = 1; i < N; ++i)
{
if (v[i].empty())
continue;
sort(v[i].begin(), v[i].end(), so1);
int vs = v[i].size();
for (int j = 0; j < vs; ++j)
{
ansv[j] = -INF;
qryy[j] = max(qry(t1, 1, m, v[i][j].x, d, 1), qry(t2, 1, m, v[i][j].x, -u, 1)) + v[i][j].m;
}
int yans = -INF;
for (int j = 0; j < vs; ++j)
{
if (j)
yans -= (v[i][j].x - v[i][j - 1].x) * u;
int yansv = -INF;
yansv = qryy[j];
yansv = max(yansv, yans + v[i][j].m);
yans = max(yans, yansv);
ansv[j] = max(ansv[j], yansv);
}
yans = -INF;
for (int j = (int)vs - 1; j >= 0; --j)
{
if (j != (int)vs - 1)
yans -= (v[i][j + 1].x - v[i][j].x) * d;
int yansv = -INF;
yansv = qryy[j];
yansv = max(yansv, yans + v[i][j].m);
yans = max(yans, yansv);
ansv[j] = max(ansv[j], yansv);
}
for (int j = 0; j < vs; ++j)
{
int ans = ansv[j];//max(qry(t1, 1, m, a[i].x, d, 1), qry(t2, 1, m, a[i].x, -u, 1)) + a[i].m;
ubd(t1, 1, m, 1, v[i][j].x, ans - v[i][j].x * d, d, 1);
ubd(t2, 1, m, v[i][j].x, m, ans + v[i][j].x * u, -u, 1);
}
}
int ans = max(qry(t1, 1, m, s, d, 1), qry(t2, 1, m, s, -u, 1));
printf("%d\n", ans);
return 0;
}
Compilation message
salesman.cpp: In function 'int main()':
salesman.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d", &n, &d, &u, &s);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
salesman.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &a[i].t, &a[i].x, &a[i].m);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
27768 KB |
Output is correct |
| 2 |
Correct |
22 ms |
27772 KB |
Output is correct |
| 3 |
Correct |
23 ms |
27768 KB |
Output is correct |
| 4 |
Correct |
25 ms |
27768 KB |
Output is correct |
| 5 |
Correct |
28 ms |
27896 KB |
Output is correct |
| 6 |
Correct |
58 ms |
28536 KB |
Output is correct |
| 7 |
Correct |
116 ms |
30072 KB |
Output is correct |
| 8 |
Correct |
207 ms |
32216 KB |
Output is correct |
| 9 |
Correct |
299 ms |
34168 KB |
Output is correct |
| 10 |
Correct |
523 ms |
40696 KB |
Output is correct |
| 11 |
Correct |
605 ms |
40672 KB |
Output is correct |
| 12 |
Correct |
809 ms |
45048 KB |
Output is correct |
| 13 |
Correct |
800 ms |
45048 KB |
Output is correct |
| 14 |
Correct |
984 ms |
49272 KB |
Output is correct |
| 15 |
Correct |
893 ms |
49272 KB |
Output is correct |
| 16 |
Execution timed out |
1057 ms |
49528 KB |
Time limit exceeded |
| 17 |
Correct |
23 ms |
27768 KB |
Output is correct |
| 18 |
Correct |
22 ms |
27768 KB |
Output is correct |
| 19 |
Correct |
25 ms |
27768 KB |
Output is correct |
| 20 |
Correct |
25 ms |
27768 KB |
Output is correct |
| 21 |
Correct |
25 ms |
27768 KB |
Output is correct |
| 22 |
Correct |
28 ms |
27896 KB |
Output is correct |
| 23 |
Correct |
30 ms |
27896 KB |
Output is correct |
| 24 |
Correct |
29 ms |
27896 KB |
Output is correct |
| 25 |
Correct |
192 ms |
30584 KB |
Output is correct |
| 26 |
Correct |
312 ms |
33444 KB |
Output is correct |
| 27 |
Correct |
515 ms |
37728 KB |
Output is correct |
| 28 |
Correct |
579 ms |
37816 KB |
Output is correct |
| 29 |
Correct |
780 ms |
41080 KB |
Output is correct |
| 30 |
Correct |
751 ms |
41796 KB |
Output is correct |
