| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 910251 |
2024-01-18T03:06:00 Z |
gaga999 |
Teams (CEOI11_tea) |
C++17 |
|
507 ms |
62800 KB |
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;
// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);
void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }
inline char gc()
{
const static int SZ = 1 << 16;
static char buf[SZ], *p1, *p2;
if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
return -1;
return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
x = 0;
bool f = 0;
char c = gc();
while (!isdigit(c))
f ^= !(c ^ 45), c = gc();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
f && (x = -x), rd(y...);
}
template <typename T>
void prt(T x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
prt(x / 10);
putchar((x % 10) ^ 48);
}
const int N = 1e6 + 6;
int ar[N], br[N], dp[N], fr[N], ln[N], vl[N], t1[N], t2[N];
signed main()
{
int n;
rd(n);
for (int i = 1; i <= n; i++)
rd(ar[i]);
iota(br + 1, br + n + 1, 1);
sort(br + 1, br + n + 1, [&](int a, int b)
{ return ar[a] < ar[b]; });
#define mex(a, b) (mpr(dp[a], vl[a]) > mpr(dp[b], vl[b]) ? a : b)
auto pul = [&](int p, int *tr) -> void
{
tr[p] = mex(tr[ls(p)], tr[rs(p)]);
};
auto qy = [&](int l, int r, int *tr) -> int
{
int res = l;
for (l += n + 1, r += n + 1; l <= r; l >>= 1, r >>= 1)
{
if (l & 1)
res = mex(res, tr[l]), l++;
if (~r & 1)
res = mex(res, tr[r]), r--;
}
return res;
};
auto cg = [&](int p, int *tr) -> void
{
for (p = (p + n + 1) >> 1; p; p >>= 1)
pul(p, tr);
};
#define f(i) ar[br[i]]
fill(dp + 1, dp + n + 2, -INF);
for (int i = 0; i <= n; i++)
t1[i + n + 1] = t2[i + n + 1] = i;
for (int i = n; i > 0; i--)
pul(i, t1), pul(i, t2);
priority_queue<pii, vector<pii>, greater<pii>> pq;
pq.push(mpr(0, 0));
for (int i = 1; i <= n; i++)
{
if (i - f(i) < 0)
continue;
while (!pq.empty() && pq.top().F < i)
{
t1[pq.top().S + n + 1] = n + 1;
cg(pq.top().S, t1);
vl[pq.top().S] = pq.top().S;
pq.pop();
}
int tp = qy(0, i - f(i), t1);
pii res(dp[tp], -vl[tp]);
fr[i] = tp;
tp = qy(0, i - f(i), t2);
pii cr(dp[tp], i - vl[tp]);
if (cr > res)
res = cr, fr[i] = tp;
dp[i] = res.F + 1, vl[i] = -res.S;
pq.push(mpr(i - vl[i], i));
cg(i, t1);
}
prt(dp[n]), putchar('\n');
for (int i = n; i; i = fr[i])
{
prt(i - fr[i]);
for (int j = i; j > fr[i]; j--)
putchar(' '), prt(br[j]);
putchar('\n');
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
10584 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
10588 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
10740 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
10688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
10844 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
10856 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
10844 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
32 ms |
16596 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
38 ms |
16976 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
300 ms |
62800 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
507 ms |
43208 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
387 ms |
46232 KB |
Integer parameter [name=s_i] equals to 1500574, violates the range [1, 1000000] |
| 2 |
Halted |
0 ms |
0 KB |
- |
