Submission #899607

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
899607	2024-01-06T14:38:28 Z	simona1230	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	220 ms	29668 KB

Main

#include <bits/stdc++.h>

using namespace std;
int n;
map<int,vector<int> > mp;
int t[800001];

int query(int i,int l,int r,int idx)
{
    if(l==r||t[i])return t[i];
    int m=(l+r)/2;
    if(idx<=m)return query(i*2,l,m,idx);
    else return query(i*2+1,m+1,r,idx);
}

void update(int i,int l,int r,int ql,int qr)
{
    if(ql>qr||t[i])return;
    if(ql<=l&&r<=qr)
    {
        t[i]=1;
        return;
    }
    int m=(l+r)/2;
    update(i*2,l,m,ql,min(m,qr));
    update(i*2+1,m+1,r,max(m+1,ql),qr);
}

int l[200001],val[200001];
void solve()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        val[i]=x;
        while(mp[x].size()&&query(1,1,n,mp[x][mp[x].size()-1])==1)
            mp[x].pop_back();

        if(mp[x].size())
        {
            l[i]=mp[x][mp[x].size()-1];
            update(1,1,n,mp[x][mp[x].size()-1],i-1);
        }
        else l[i]=i;
        mp[x].push_back(i);
    }
}

void print()
{
    int curr=n;
    vector<int> ans;
    for(int i=n;i>=1;i--)
    {
        while(curr>=l[i])
        {
            ans.push_back(val[i]);
            curr--;
        }
    }
    for(int i=n-1;i>=0;i--)
        cout<<ans[i]<<" ";
    cout<<endl;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	solve();
	print();
	return 0;
}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	2 ms	2392 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	53 ms	6744 KB	Output is correct
18	Correct	52 ms	6608 KB	Output is correct
19	Correct	55 ms	5976 KB	Output is correct
20	Correct	53 ms	6120 KB	Output is correct
21	Correct	53 ms	6084 KB	Output is correct
22	Correct	55 ms	6092 KB	Output is correct
23	Correct	53 ms	5972 KB	Output is correct
24	Correct	56 ms	5976 KB	Output is correct
25	Correct	58 ms	6052 KB	Output is correct
26	Correct	55 ms	6028 KB	Output is correct
27	Correct	56 ms	5968 KB	Output is correct
28	Correct	55 ms	5980 KB	Output is correct
29	Correct	45 ms	5976 KB	Output is correct
30	Correct	53 ms	6600 KB	Output is correct
31	Correct	53 ms	6612 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2512 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2512 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2512 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2444 KB	Output is correct
12	Correct	2 ms	2652 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	2 ms	2904 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2520 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2528 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	2 ms	2652 KB	Output is correct
30	Correct	2 ms	2652 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	0 ms	2396 KB	Output is correct
33	Correct	0 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2392 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	2 ms	2392 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	53 ms	6744 KB	Output is correct
48	Correct	52 ms	6608 KB	Output is correct
49	Correct	55 ms	5976 KB	Output is correct
50	Correct	53 ms	6120 KB	Output is correct
51	Correct	53 ms	6084 KB	Output is correct
52	Correct	55 ms	6092 KB	Output is correct
53	Correct	53 ms	5972 KB	Output is correct
54	Correct	56 ms	5976 KB	Output is correct
55	Correct	58 ms	6052 KB	Output is correct
56	Correct	55 ms	6028 KB	Output is correct
57	Correct	56 ms	5968 KB	Output is correct
58	Correct	55 ms	5980 KB	Output is correct
59	Correct	45 ms	5976 KB	Output is correct
60	Correct	53 ms	6600 KB	Output is correct
61	Correct	53 ms	6612 KB	Output is correct
62	Correct	57 ms	9548 KB	Output is correct
63	Correct	161 ms	29452 KB	Output is correct
64	Correct	159 ms	29384 KB	Output is correct
65	Correct	60 ms	8872 KB	Output is correct
66	Correct	65 ms	8784 KB	Output is correct
67	Correct	64 ms	9284 KB	Output is correct
68	Correct	64 ms	9300 KB	Output is correct
69	Correct	63 ms	9208 KB	Output is correct
70	Correct	63 ms	9044 KB	Output is correct
71	Correct	64 ms	9044 KB	Output is correct
72	Correct	64 ms	9020 KB	Output is correct
73	Correct	159 ms	18444 KB	Output is correct
74	Correct	192 ms	20024 KB	Output is correct
75	Correct	174 ms	29300 KB	Output is correct
76	Correct	151 ms	29244 KB	Output is correct
77	Correct	181 ms	29280 KB	Output is correct
78	Correct	220 ms	29668 KB	Output is correct

Submission #899607

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