Submission #990259

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
990259	2024-05-30T03:44:52 Z	thelegendary08	Stone Arranging 2 (JOI23_ho_t1)	C++14	100 / 100	213 ms	24728 KB

Main

#include<bits/stdc++.h>
#define pb push_back
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long int>
#define vvll vector<vector<long long int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define mii map<int,int>
#define mll map<long long int, long long int>
#define mivi map<int,vector<int>>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
using namespace std;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	int n;
	cin>>n;
	vi v(n);
	f0r(i,n){
        cin>>v[i];
	}

	mii p;
	vi nxt(n, -1);
	f0r(i,n){
        if(p.count(v[i]) != 0){
            nxt[i] = p[v[i]];
        }
        p[v[i]] = i;
	}

	mii lo;
	f0r(i,n)lo[v[i]] = i;
	vb done(n, false);
	f0r(i,n){
        if(done[i])continue;
        else{
            done[i] = 1;
            if(lo[v[i]] != i){
                FOR(j, i, lo[v[i]] + 1){
                    done[j] = 1;
                    v[j] = v[i];
                }
            }
        }
	}

	f0r(i,n)cout<<v[i]<<'\n';


}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	17 ms	2296 KB	Output is correct
18	Correct	17 ms	2396 KB	Output is correct
19	Correct	19 ms	2396 KB	Output is correct
20	Correct	19 ms	2304 KB	Output is correct
21	Correct	19 ms	2388 KB	Output is correct
22	Correct	19 ms	2396 KB	Output is correct
23	Correct	18 ms	2396 KB	Output is correct
24	Correct	19 ms	2396 KB	Output is correct
25	Correct	18 ms	2392 KB	Output is correct
26	Correct	21 ms	2388 KB	Output is correct
27	Correct	19 ms	2396 KB	Output is correct
28	Correct	19 ms	2396 KB	Output is correct
29	Correct	17 ms	2392 KB	Output is correct
30	Correct	17 ms	2272 KB	Output is correct
31	Correct	16 ms	2396 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	504 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	17 ms	2296 KB	Output is correct
48	Correct	17 ms	2396 KB	Output is correct
49	Correct	19 ms	2396 KB	Output is correct
50	Correct	19 ms	2304 KB	Output is correct
51	Correct	19 ms	2388 KB	Output is correct
52	Correct	19 ms	2396 KB	Output is correct
53	Correct	18 ms	2396 KB	Output is correct
54	Correct	19 ms	2396 KB	Output is correct
55	Correct	18 ms	2392 KB	Output is correct
56	Correct	21 ms	2388 KB	Output is correct
57	Correct	19 ms	2396 KB	Output is correct
58	Correct	19 ms	2396 KB	Output is correct
59	Correct	17 ms	2392 KB	Output is correct
60	Correct	17 ms	2272 KB	Output is correct
61	Correct	16 ms	2396 KB	Output is correct
62	Correct	25 ms	3920 KB	Output is correct
63	Correct	184 ms	22608 KB	Output is correct
64	Correct	167 ms	24656 KB	Output is correct
65	Correct	27 ms	5716 KB	Output is correct
66	Correct	26 ms	5468 KB	Output is correct
67	Correct	28 ms	5972 KB	Output is correct
68	Correct	28 ms	5980 KB	Output is correct
69	Correct	29 ms	5968 KB	Output is correct
70	Correct	28 ms	5960 KB	Output is correct
71	Correct	28 ms	5968 KB	Output is correct
72	Correct	29 ms	5712 KB	Output is correct
73	Correct	153 ms	15188 KB	Output is correct
74	Correct	133 ms	15184 KB	Output is correct
75	Correct	213 ms	24656 KB	Output is correct
76	Correct	175 ms	24624 KB	Output is correct
77	Correct	211 ms	24524 KB	Output is correct
78	Correct	201 ms	24728 KB	Output is correct

Submission #990259

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