Submission #758696

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
758696	2023-06-15T06:52:09 Z	PoPularPlusPlus	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	256 ms	28480 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	int arr[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	map<int,vector<int>> m;
	int parent[n];
	memset(parent,-1,sizeof parent);
	priority_queue<int> pq;
	for(int i = 0; i < n; i++){
		if(m[arr[i]].size() != 0){
			int pos = m[arr[i]].back();
			while(pq.size() && pq.top() > pos){
				int idx = pq.top();
				pq.pop();
				parent[idx] = i;
				m[arr[idx]].pop_back();
			}
		}
		pq.push(i);
		m[arr[i]].pb(i);
	}
	for(int i = n - 1; i >= 0; i--){
		if(parent[i] == -1)continue;
		arr[i] = arr[parent[i]];
	}
	for(int i = 0; i < n; i++)cout << arr[i] << '\n';
}

int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("deleg.in", "r", stdin);
//freopen("deleg.out", "w", stdout);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
25.0 / 25.0

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

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	24 ms	4288 KB	Output is correct
18	Correct	25 ms	4404 KB	Output is correct
19	Correct	32 ms	3648 KB	Output is correct
20	Correct	31 ms	3500 KB	Output is correct
21	Correct	31 ms	3648 KB	Output is correct
22	Correct	32 ms	3596 KB	Output is correct
23	Correct	35 ms	3648 KB	Output is correct
24	Correct	31 ms	3628 KB	Output is correct
25	Correct	36 ms	3648 KB	Output is correct
26	Correct	31 ms	3640 KB	Output is correct
27	Correct	32 ms	3520 KB	Output is correct
28	Correct	33 ms	3648 KB	Output is correct
29	Correct	31 ms	3592 KB	Output is correct
30	Correct	26 ms	4244 KB	Output is correct
31	Correct	25 ms	4416 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	1 ms	316 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	468 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	324 KB	Output is correct
39	Correct	1 ms	324 KB	Output is correct
40	Correct	1 ms	324 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	340 KB	Output is correct
43	Correct	1 ms	324 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	24 ms	4288 KB	Output is correct
48	Correct	25 ms	4404 KB	Output is correct
49	Correct	32 ms	3648 KB	Output is correct
50	Correct	31 ms	3500 KB	Output is correct
51	Correct	31 ms	3648 KB	Output is correct
52	Correct	32 ms	3596 KB	Output is correct
53	Correct	35 ms	3648 KB	Output is correct
54	Correct	31 ms	3628 KB	Output is correct
55	Correct	36 ms	3648 KB	Output is correct
56	Correct	31 ms	3640 KB	Output is correct
57	Correct	32 ms	3520 KB	Output is correct
58	Correct	33 ms	3648 KB	Output is correct
59	Correct	31 ms	3592 KB	Output is correct
60	Correct	26 ms	4244 KB	Output is correct
61	Correct	25 ms	4416 KB	Output is correct
62	Correct	34 ms	7584 KB	Output is correct
63	Correct	233 ms	27948 KB	Output is correct
64	Correct	222 ms	27940 KB	Output is correct
65	Correct	43 ms	6484 KB	Output is correct
66	Correct	40 ms	6376 KB	Output is correct
67	Correct	46 ms	6824 KB	Output is correct
68	Correct	41 ms	6200 KB	Output is correct
69	Correct	51 ms	5020 KB	Output is correct
70	Correct	43 ms	6336 KB	Output is correct
71	Correct	46 ms	6344 KB	Output is correct
72	Correct	44 ms	5472 KB	Output is correct
73	Correct	144 ms	16780 KB	Output is correct
74	Correct	155 ms	17064 KB	Output is correct
75	Correct	176 ms	28036 KB	Output is correct
76	Correct	256 ms	28480 KB	Output is correct
77	Correct	162 ms	28412 KB	Output is correct
78	Correct	187 ms	27108 KB	Output is correct

Submission #758696

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