이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
using ll = long long;
int lp[200005], rp[200005], w[200005], rem[200005], n, m;
ll val[200005], lazy[200005];
std::vector<int> vec[200005];
struct comp { bool operator ()(int x, int y) { return rp[x] < rp[y]; } };
inline bool check(int pos, ll cnt, ll lim)
{
if (cnt > lim)
return false;
for (int i = 0; i < n; i++)
{
vec[i].clear();
lazy[i] = 0;
}
for (int i = 0; i < m; i++)
{
if (lp[i] <= pos && pos < rp[i])
{
vec[lp[i]].push_back(i);
rem[i] = w[i];
}
}
std::priority_queue<int, std::vector<int>, comp> que;
for (int i = 0; i <= pos; i++)
{
for (int x : vec[i])
que.push(x);
ll cur = std::max(0ll, val[i] + cnt - lim) + 1 >> 1;
while (cur && !que.empty())
{
int x = que.top();
que.pop();
int sub = std::min<ll>(cur, rem[x]);
cur -= sub;
rem[x] -= sub;
cnt -= sub << 1;
lazy[lp[x]] -= sub;
lazy[rp[x]] += sub << 1;
if (rem[x])
que.push(x);
}
if (cur)
return false;
}
for (int i = 0; i < n; i++)
{
if (i)
lazy[i] += lazy[i - 1];
if (lazy[i] + val[i] > lim)
return false;
}
return true;
}
int main()
{
// freopen("JOISC2017-D2T1.in", "r", stdin);
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
{
scanf("%d%d%d", lp + i, rp + i, w + i);
if (lp[i] > rp[i])
std::swap(lp[i], rp[i]);
val[lp[i]] += w[i];
val[rp[i]] -= w[i];
}
int fir = 0, lst = 0;
for (int i = 1; i < n; i++)
{
val[i] += val[i - 1];
if (val[i] > val[fir])
fir = i;
if (val[i] == val[fir])
lst = i;
}
ll l = 0, r = val[lst], res = -1;
while (l <= r)
{
ll mid = l + r >> 1;
bool ok = false;
for (int x : {fir, lst})
{
for (int y = 0; y < 2; y++)
ok |= check(x, val[fir] - mid + y, mid);
}
if (ok)
{
res = mid;
r = mid - 1;
}
else
l = mid + 1;
}
printf("%lld\n", res);
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
~~~~~^~~~~~~~~~~~~~~~
arranging_tickets.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", lp + i, rp + i, w + i);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |