| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1092059 | quangminh412 | Stove (JOI18_stove) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
/*
John Watson
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const ll oo = 1e18;
const int maxn = 1e5 + 9;
int n, m;
int arr[maxn];
signed main()
{
if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
faster();
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> arr[i];
vector<ll> res(m + 5, 0);
for (int i = 1; i < n; i++)
{
int fi = arr[i], se = arr[i + 1];
int app = (fi < se ? se - fi : m - fi + se);
for (int j = 1; j <= m; j++)
{
int new_app = (j < se ? se - j : m - j + se);
res[j] += min(app, new_app);
}
}
ll ans = oo;
for (int i = 1; i <= m; i++)
ans = min(ans, res[i]), cout << res[i] << ' '; cout << '\n';
cout << ans << '\n';
return 0;
}
#include <bits/stdc++.h>
using namespace std;
/*
John Watson
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const ll oo = 1e18;
const int maxn = 1e5 + 9;
int n, m;
int arr[maxn];
ll segment(int st, int sz) { return 1ll * st * sz - (1ll * (sz - 1) * sz) / 2; }
struct SegmentTree
{
struct Node
{
ll sum;
int a, b;
Node(ll sum = 0ll, int a = -1, int b = -1) : sum(sum), a(a), b(b) {}
Node operator + (const Node& other)
{
Node res;
res.sum = sum + other.sum;
return res;
}
};
vector<Node> st;
int n;
SegmentTree(int n) : n(n) { st.resize(4 * n + 10); }
void pass(int head, int l, int r)
{
if (st[head].a == -1) return;
int mid = l + r >> 1;
int sz = r - l + 1;
int &a = st[head].a, &b = st[head].b;
st[head].sum += min(1ll * sz * b, segment(a, sz));
// cout << l << ' ' << r << ' ' << a << ' ' << sz << ' ' << segment(a, sz) << '\n';
// cout << a << ' ' << a - (mid - l + 1) << ' ' << l << ' ' << r << '\n';
if (l != r)
{
// if (st[2 * head].a != -1)
// {
// pass(2 * head, l, mid);
st[2 * head].a = a;
st[2 * head].b = b;
// }
// if (st[2 * head + 1].a != -1)
// {
// pass(2 * head + 1, mid + 1, r);
st[2 * head + 1].a = a - (mid - l + 1);
st[2 * head + 1].b = b;
// }
}
a = -1;
b = -1;
}
void update(int head, int l, int r, int u, int v, int a, int b)
{
int mid = l + r >> 1;
if (l != r)
{
pass(2 * head, l, mid);
pass(2 * head + 1, mid + 1, r);
}
pass(head, l, r);
if (l > v || r < u) return;
if (u <= l && r <= v)
{
int num = l - u;
st[head].a = a - num;
st[head].b = b;
pass(head, l, r);
return;
}
update(2 * head, l, mid, u, v, a, b);
update(2 * head + 1, mid + 1, r, u, v, a, b);
st[head] = st[2 * head] + st[2 * head + 1];
}
void update(int u, int v, int a, int b) { update(1, 1, n, u, v, a, b); }
ll get(int head, int l, int r, int pos)
{
pass(head, l, r);
if (l == r)
return st[head].sum;
int mid = l + r >> 1;
if (pos <= mid)
return get(2 * head, l, mid, pos);
return get(2 * head + 1, mid + 1, r, pos);
}
ll get(int pos) { return get(1, 1, n, pos); }
};
signed main()
{
if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
faster();
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> arr[i];
SegmentTree seg(m);
for (int i = 1; i < n; i++)
{
int fi = arr[i];
int se = arr[i + 1];
int tmp = (fi < se ? se - fi : m - fi + se);
seg.update(1, se, se, tmp);
if (se + 1 <= m) seg.update(se + 1, m, m, tmp);
}
ll ans = oo;
for (int i = 1; i <= m; i++)
ans = min(ans, seg.get(i)), cout << seg.get(i) << ' '; cout << '\n';
cout << ans << '\n';
return 0;
}