Submission #833011

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
833011	2023-08-21T19:08:00 Z	beepbeepsheep	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	259 ms	23044 KB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef tree<long long, null_type, less_equal<>,
        rb_tree_tag, tree_order_statistics_node_update>
        ordered_set;
#define ll long long
#define ii pair<ll,ll>

#ifndef DEBUG
#define cerr if (0) cerr
#define endl '\n'
#endif

const ll inf=1e15;
const ll maxn=2e5+5;
const ll mod=1e9+7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<ii> v;
ll par[maxn];
ll ans[maxn];
map<ll,ll> where;
ll root(ll x){
	if (par[x]==x) return x;
	return par[x]=root(par[x]);
}
void connect(ll a, ll b){
	a=root(a),b=root(b);
	if (a==b) return;
	par[a]=b;
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll n,ele;
	cin>>n;
	for (int i=0;i<maxn;i++) par[i]=i;
	for (int i=1;i<=n;i++){
		cin>>ele;
		if (where.find(ele)==where.end()) where[ele]=-1;
		cerr<<where[ele]<<endl;
		v.emplace_back(i,ele);
		ans[i]=ele;
		if (where[ele]!=-1){
			while (v.back().first!=where[ele]){
				connect(v.back().first,where[ele]);
				if (where[v.back().second]==v.back().first) where[v.back().second]=-1;
				v.pop_back();
			}
		}
		if (where[ele]==-1) where[ele]=i;
	}
	for (int i=1;i<=n;i++) cout<<ans[root(i)]<<endl;
	return 0;
}

Subtask #1
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1876 KB	Output is correct
2	Correct	1 ms	1876 KB	Output is correct
3	Correct	1 ms	1876 KB	Output is correct
4	Correct	1 ms	1876 KB	Output is correct
5	Correct	1 ms	1876 KB	Output is correct
6	Correct	1 ms	1876 KB	Output is correct
7	Correct	1 ms	1876 KB	Output is correct
8	Correct	1 ms	1876 KB	Output is correct
9	Correct	1 ms	1876 KB	Output is correct
10	Correct	1 ms	1876 KB	Output is correct
11	Correct	1 ms	1876 KB	Output is correct
12	Correct	1 ms	1876 KB	Output is correct
13	Correct	1 ms	1876 KB	Output is correct
14	Correct	1 ms	1876 KB	Output is correct
15	Correct	1 ms	1876 KB	Output is correct
16	Correct	2 ms	1876 KB	Output is correct
17	Correct	2 ms	2004 KB	Output is correct
18	Correct	2 ms	2004 KB	Output is correct
19	Correct	1 ms	1876 KB	Output is correct
20	Correct	1 ms	1876 KB	Output is correct
21	Correct	1 ms	1876 KB	Output is correct
22	Correct	1 ms	1876 KB	Output is correct
23	Correct	1 ms	1876 KB	Output is correct
24	Correct	2 ms	1876 KB	Output is correct
25	Correct	1 ms	1876 KB	Output is correct
26	Correct	1 ms	1876 KB	Output is correct
27	Correct	1 ms	1876 KB	Output is correct
28	Correct	1 ms	1876 KB	Output is correct
29	Correct	2 ms	2004 KB	Output is correct
30	Correct	2 ms	2004 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1876 KB	Output is correct
2	Correct	1 ms	1876 KB	Output is correct
3	Correct	1 ms	1876 KB	Output is correct
4	Correct	1 ms	1876 KB	Output is correct
5	Correct	1 ms	1876 KB	Output is correct
6	Correct	1 ms	1876 KB	Output is correct
7	Correct	1 ms	1876 KB	Output is correct
8	Correct	1 ms	1788 KB	Output is correct
9	Correct	1 ms	1876 KB	Output is correct
10	Correct	1 ms	1836 KB	Output is correct
11	Correct	1 ms	1876 KB	Output is correct
12	Correct	1 ms	1876 KB	Output is correct
13	Correct	1 ms	1876 KB	Output is correct
14	Correct	1 ms	1876 KB	Output is correct
15	Correct	1 ms	1876 KB	Output is correct
16	Correct	1 ms	1876 KB	Output is correct
17	Correct	26 ms	3764 KB	Output is correct
18	Correct	25 ms	4116 KB	Output is correct
19	Correct	26 ms	4184 KB	Output is correct
20	Correct	25 ms	4216 KB	Output is correct
21	Correct	26 ms	4112 KB	Output is correct
22	Correct	27 ms	4220 KB	Output is correct
23	Correct	30 ms	4180 KB	Output is correct
24	Correct	34 ms	4120 KB	Output is correct
25	Correct	25 ms	4128 KB	Output is correct
26	Correct	26 ms	4120 KB	Output is correct
27	Correct	27 ms	4184 KB	Output is correct
28	Correct	27 ms	4228 KB	Output is correct
29	Correct	23 ms	4184 KB	Output is correct
30	Correct	30 ms	4172 KB	Output is correct
31	Correct	26 ms	4184 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1876 KB	Output is correct
2	Correct	1 ms	1876 KB	Output is correct
3	Correct	1 ms	1876 KB	Output is correct
4	Correct	1 ms	1876 KB	Output is correct
5	Correct	1 ms	1876 KB	Output is correct
6	Correct	1 ms	1876 KB	Output is correct
7	Correct	1 ms	1876 KB	Output is correct
8	Correct	1 ms	1876 KB	Output is correct
9	Correct	1 ms	1876 KB	Output is correct
10	Correct	1 ms	1876 KB	Output is correct
11	Correct	1 ms	1876 KB	Output is correct
12	Correct	1 ms	1876 KB	Output is correct
13	Correct	1 ms	1876 KB	Output is correct
14	Correct	1 ms	1876 KB	Output is correct
15	Correct	1 ms	1876 KB	Output is correct
16	Correct	2 ms	1876 KB	Output is correct
17	Correct	2 ms	2004 KB	Output is correct
18	Correct	2 ms	2004 KB	Output is correct
19	Correct	1 ms	1876 KB	Output is correct
20	Correct	1 ms	1876 KB	Output is correct
21	Correct	1 ms	1876 KB	Output is correct
22	Correct	1 ms	1876 KB	Output is correct
23	Correct	1 ms	1876 KB	Output is correct
24	Correct	2 ms	1876 KB	Output is correct
25	Correct	1 ms	1876 KB	Output is correct
26	Correct	1 ms	1876 KB	Output is correct
27	Correct	1 ms	1876 KB	Output is correct
28	Correct	1 ms	1876 KB	Output is correct
29	Correct	2 ms	2004 KB	Output is correct
30	Correct	2 ms	2004 KB	Output is correct
31	Correct	1 ms	1876 KB	Output is correct
32	Correct	1 ms	1876 KB	Output is correct
33	Correct	1 ms	1876 KB	Output is correct
34	Correct	1 ms	1876 KB	Output is correct
35	Correct	1 ms	1876 KB	Output is correct
36	Correct	1 ms	1876 KB	Output is correct
37	Correct	1 ms	1876 KB	Output is correct
38	Correct	1 ms	1788 KB	Output is correct
39	Correct	1 ms	1876 KB	Output is correct
40	Correct	1 ms	1836 KB	Output is correct
41	Correct	1 ms	1876 KB	Output is correct
42	Correct	1 ms	1876 KB	Output is correct
43	Correct	1 ms	1876 KB	Output is correct
44	Correct	1 ms	1876 KB	Output is correct
45	Correct	1 ms	1876 KB	Output is correct
46	Correct	1 ms	1876 KB	Output is correct
47	Correct	26 ms	3764 KB	Output is correct
48	Correct	25 ms	4116 KB	Output is correct
49	Correct	26 ms	4184 KB	Output is correct
50	Correct	25 ms	4216 KB	Output is correct
51	Correct	26 ms	4112 KB	Output is correct
52	Correct	27 ms	4220 KB	Output is correct
53	Correct	30 ms	4180 KB	Output is correct
54	Correct	34 ms	4120 KB	Output is correct
55	Correct	25 ms	4128 KB	Output is correct
56	Correct	26 ms	4120 KB	Output is correct
57	Correct	27 ms	4184 KB	Output is correct
58	Correct	27 ms	4228 KB	Output is correct
59	Correct	23 ms	4184 KB	Output is correct
60	Correct	30 ms	4172 KB	Output is correct
61	Correct	26 ms	4184 KB	Output is correct
62	Correct	33 ms	7340 KB	Output is correct
63	Correct	255 ms	21144 KB	Output is correct
64	Correct	226 ms	20720 KB	Output is correct
65	Correct	34 ms	6992 KB	Output is correct
66	Correct	45 ms	6944 KB	Output is correct
67	Correct	37 ms	7340 KB	Output is correct
68	Correct	37 ms	7372 KB	Output is correct
69	Correct	38 ms	7368 KB	Output is correct
70	Correct	38 ms	7336 KB	Output is correct
71	Correct	38 ms	7336 KB	Output is correct
72	Correct	44 ms	7340 KB	Output is correct
73	Correct	201 ms	15032 KB	Output is correct
74	Correct	191 ms	15200 KB	Output is correct
75	Correct	179 ms	23044 KB	Output is correct
76	Correct	259 ms	22960 KB	Output is correct
77	Correct	207 ms	22964 KB	Output is correct
78	Correct	172 ms	22960 KB	Output is correct

Submission #833011

Compilation message

Subtask #1 25.0 / 25.0

Subtask #2 35.0 / 35.0

Subtask #3 40.0 / 40.0

Subtask #1
25.0 / 25.0

Subtask #2
35.0 / 35.0

Subtask #3
40.0 / 40.0