Submission #887202

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
887202	2023-12-14T04:18:59 Z	Minbaev	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	203 ms	19936 KB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){
	int n,m,k;
	
	cin>>n;
	
	vector<int>v(n);
	map<int,int>mp;
	for(int i = 0;i<n;i++){
		cin>>v[i];
		mp[v[i]] = i;
	}
	vector<int>ans(n);
	for(int i = 0;i<n;){
		int val = v[i];
		int r = mp[v[i]];
		for(;i<=r;i++)cout<<val<<"\n";
	}
	
	
	
	
	









}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int cnt=0;
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:35:8: warning: unused variable 'm' [-Wunused-variable]
   35 |  int n,m,k;
      |        ^
Main.cpp:35:10: warning: unused variable 'k' [-Wunused-variable]
   35 |  int n,m,k;
      |          ^
Main.cpp: In function 'int main()':
Main.cpp:72:6: warning: unused variable 'cnt' [-Wunused-variable]
   72 |  int cnt=0;
      |      ^~~

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	344 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	1 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	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 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	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 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	1 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	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 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	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	18 ms	3908 KB	Output is correct
18	Correct	21 ms	3932 KB	Output is correct
19	Correct	19 ms	3928 KB	Output is correct
20	Correct	18 ms	3928 KB	Output is correct
21	Correct	18 ms	3912 KB	Output is correct
22	Correct	19 ms	3828 KB	Output is correct
23	Correct	18 ms	3932 KB	Output is correct
24	Correct	18 ms	3932 KB	Output is correct
25	Correct	22 ms	3932 KB	Output is correct
26	Correct	18 ms	3928 KB	Output is correct
27	Correct	18 ms	3928 KB	Output is correct
28	Correct	18 ms	3932 KB	Output is correct
29	Correct	18 ms	3932 KB	Output is correct
30	Correct	18 ms	3928 KB	Output is correct
31	Correct	18 ms	3928 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	344 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	1 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	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 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	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 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	1 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	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	1 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	1 ms	344 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	18 ms	3908 KB	Output is correct
48	Correct	21 ms	3932 KB	Output is correct
49	Correct	19 ms	3928 KB	Output is correct
50	Correct	18 ms	3928 KB	Output is correct
51	Correct	18 ms	3912 KB	Output is correct
52	Correct	19 ms	3828 KB	Output is correct
53	Correct	18 ms	3932 KB	Output is correct
54	Correct	18 ms	3932 KB	Output is correct
55	Correct	22 ms	3932 KB	Output is correct
56	Correct	18 ms	3928 KB	Output is correct
57	Correct	18 ms	3928 KB	Output is correct
58	Correct	18 ms	3932 KB	Output is correct
59	Correct	18 ms	3932 KB	Output is correct
60	Correct	18 ms	3928 KB	Output is correct
61	Correct	18 ms	3928 KB	Output is correct
62	Correct	38 ms	5352 KB	Output is correct
63	Correct	111 ms	19796 KB	Output is correct
64	Correct	115 ms	19792 KB	Output is correct
65	Correct	29 ms	7212 KB	Output is correct
66	Correct	31 ms	7080 KB	Output is correct
67	Correct	29 ms	7504 KB	Output is correct
68	Correct	28 ms	7504 KB	Output is correct
69	Correct	37 ms	7504 KB	Output is correct
70	Correct	36 ms	7508 KB	Output is correct
71	Correct	30 ms	7524 KB	Output is correct
72	Correct	36 ms	7260 KB	Output is correct
73	Correct	98 ms	13648 KB	Output is correct
74	Correct	77 ms	13904 KB	Output is correct
75	Correct	183 ms	19792 KB	Output is correct
76	Correct	103 ms	19864 KB	Output is correct
77	Correct	175 ms	19860 KB	Output is correct
78	Correct	203 ms	19936 KB	Output is correct

Submission #887202

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