Submission #1160750

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160750		pan	Volontiranje (COCI21_volontiranje)	C++20	10 / 110	11 ms	23888 KiB

Main

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll v[1000005], idx[1000005];
vector<ll> p[1000005];
vector<vector<ll> > ans;

int main()
{
	ll n;
	cin >> n;
	for (ll i=1; i<=n; ++i) {cin >> v[i]; idx[v[i]] = i;}
	vector<ll> lis;
	// calculate lis[i]
	for (ll i=1; i<=n; ++i) 
	{
		ll pos = lb(all(lis), v[i])-lis.begin();
		if (pos >= lis.size()) lis.pb(v[i]);
		else lis[pos] = v[i];
		p[pos].pb(i);
	}
	show(lis.size());
	for (ll i=0; i<=n; ++i) reverse(all(p[i]));
	vector<ll> cur;
	while (1)
	{
		if (cur.size() == 0)
		{
			if (p[0].empty()) break;
			ll now = p[0].back();
			p[0].pop_back();
			cur.pb(now);
		}
		else if (cur.size() < lis.size())
		{
			ll siz = cur.size();
			while (p[siz].size() && p[siz].back() < cur.back()) p[siz].pop_back();
			if (cur.size() && v[p[siz].back()] > v[cur.back()]) // can add
			{
				cur.pb(p[siz].back());
				p[siz].pop_back();
			}
			else {cur.pop_back();} // backtrack
		}
		else
		{
			// complete
			ans.pb(cur);
			cur.clear();
		}
	}
	cout << ans.size() << ' ' << lis.size() << endl;
	for (auto u: ans) 
	{
		for (ll x: u) cout << x << ' ';
		cout << endl;
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 60