| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1307393 | the_commando_x | Money (IZhO17_money) | C++17 | 4 ms | 8260 KiB |
// #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using vii = vector<pii>;
using vvii = vector<vii>;
using l = long long;
using vl = vector<l>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using pll = pair<l, l>;
using vll = vector<pll>;
using vvll = vector<vll>;
using d = double;
using vd = vector<d>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using ld = long double;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pbb = pair<bool, bool>;
using vbb = vector<pbb>;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
void setIO(string name = "")
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if (!name.empty())
{
(void)freopen((name + ".in").c_str(), "r", stdin);
(void)freopen((name + ".out").c_str(), "w", stdout);
}
}
const ld pi = 3.14159265358979323846;
const l LINF = 1e18;
const l INF = 1e9;
const l MOD = 1e9 + 7;
// const l MOD = 998244353;
const l MAXN = 2e5 + 5;
struct BIT
{
l n;
vl table;
BIT(l _n = MAXN)
{
n = _n;
table.assign(n + 1, 0);
}
BIT(const vl &a) : BIT(a.size())
{
n = a.size();
for (l i = 1; i <= n; ++i)
table[i] = a[i - 1];
for (l i = 1; i <= n; ++i)
{
l j = i + (i & -i);
if (j <= n)
table[j] += table[i];
}
// for (int i = 0; i < a.size(); ++i)
// update(i + 1, a[i]);
}
void update(l i, l delta)
{
while (i <= n)
{
table[i] += delta;
i += (i & -i);
}
}
l sum(l i)
{
l s = 0;
while (i != 0)
{
s += table[i];
i -= (i & -i);
}
return s;
}
l rangeSum(l i, l j)
{
return sum(j) - sum(i - 1);
}
};
void solve()
{
int n;
cin >> n;
vi a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a[i];
BIT bit(1E6 + 1);
int cuts = 1;
int start = 1;
for (int end = 2; end <= n; ++end)
{
if (a[end - 1] > a[end] || bit.rangeSum(a[start] + 1, a[end] - 1) != 0)
{
while (start < end)
bit.update(a[start++], 1);
++cuts;
}
}
cout << cuts;
}
int main()
{
setIO("");
#ifndef ONLINE_JUDGE
// setIO("filename");
#endif
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
