#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod = 1000000007 ;
const int mod1 = 998244353 ;
const int N = 2e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;
vector < int > v[ N ] ;
void solve(){
int n ; cin >> n ;
int a[ n ] ;
set < int > se ;
FOR( i , n ){
cin >> a[ i ] ;
se.insert( a[ i ] ) ;
}
int cnt = 1 ;
for( auto x : se ){
ma[ x ] = cnt ;
ma1[ cnt ] = x ;
cnt ++ ;
}
FOR( i , n ) a[ i ] = ma[ a[ i ] ] ;
set < pair < int , int > > ps ;
FOR( i , n ){
int x = a[ i ] ;
if( v[ x ].size() == 0 ){
v[ x ].pb( i ) ;
ps.insert( { i , x } ) ;
continue ;
}
int ls = v[ x ][ v[ x ].size() - 1 ] ;
while( true ){
if( ps.size() == 0 ) break ;
pair < int , int > p ;
p = *( -- ps.end() ) ;
if( p.f < ls ) break ;
//cout << p.f << " " << i << " dugu " <<endl ;
if( p.f != ls )
v[ p.s ].pop_back() ;
ps.erase( -- ps.end() ) ;
}
ps.insert( { ls , x } ) ;
}
int lst = 0 ;
int bef = 0 ;
for( auto x : ps ){
int pos = x.f ;
while( lst < pos ){
a[ lst ] = bef ;
lst ++ ;
}
bef = x.second ;
}
pair < int , int > x = ( *--ps.end() ) ;
int pos = x.f ;
while( lst < n ){
a[ lst ] = x.s ;
lst ++ ;
}
// debug ;
FOR( i , n ) cout << ma1[ a[ i ] ] << "\n" ;
}
signed main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int t = 1 ;// cin >> t ;
while( t -- ){
solve() ;
}
}
Compilation message
Main.cpp: In function 'void solve()':
Main.cpp:80:6: warning: unused variable 'pos' [-Wunused-variable]
80 | int pos = x.f ;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5024 KB |
Output is correct |
2 |
Correct |
3 ms |
5116 KB |
Output is correct |
3 |
Correct |
3 ms |
4948 KB |
Output is correct |
4 |
Correct |
3 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4948 KB |
Output is correct |
6 |
Correct |
3 ms |
5020 KB |
Output is correct |
7 |
Correct |
3 ms |
5024 KB |
Output is correct |
8 |
Correct |
3 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4948 KB |
Output is correct |
10 |
Correct |
3 ms |
4948 KB |
Output is correct |
11 |
Correct |
3 ms |
4948 KB |
Output is correct |
12 |
Correct |
3 ms |
4960 KB |
Output is correct |
13 |
Correct |
3 ms |
5020 KB |
Output is correct |
14 |
Correct |
3 ms |
4948 KB |
Output is correct |
15 |
Correct |
3 ms |
4948 KB |
Output is correct |
16 |
Correct |
3 ms |
4948 KB |
Output is correct |
17 |
Correct |
4 ms |
5588 KB |
Output is correct |
18 |
Correct |
4 ms |
5588 KB |
Output is correct |
19 |
Correct |
3 ms |
4948 KB |
Output is correct |
20 |
Correct |
3 ms |
5076 KB |
Output is correct |
21 |
Correct |
3 ms |
5036 KB |
Output is correct |
22 |
Correct |
3 ms |
5076 KB |
Output is correct |
23 |
Correct |
3 ms |
4948 KB |
Output is correct |
24 |
Correct |
3 ms |
5076 KB |
Output is correct |
25 |
Correct |
3 ms |
5076 KB |
Output is correct |
26 |
Correct |
3 ms |
4948 KB |
Output is correct |
27 |
Correct |
3 ms |
5020 KB |
Output is correct |
28 |
Correct |
3 ms |
4948 KB |
Output is correct |
29 |
Correct |
4 ms |
5292 KB |
Output is correct |
30 |
Correct |
5 ms |
5288 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5024 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
3 ms |
4940 KB |
Output is correct |
4 |
Correct |
3 ms |
5024 KB |
Output is correct |
5 |
Correct |
3 ms |
4948 KB |
Output is correct |
6 |
Correct |
2 ms |
4948 KB |
Output is correct |
7 |
Correct |
3 ms |
4948 KB |
Output is correct |
8 |
Correct |
3 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
5012 KB |
Output is correct |
10 |
Correct |
3 ms |
5020 KB |
Output is correct |
11 |
Correct |
3 ms |
4948 KB |
Output is correct |
12 |
Correct |
4 ms |
5076 KB |
Output is correct |
13 |
Correct |
3 ms |
4948 KB |
Output is correct |
14 |
Correct |
3 ms |
4948 KB |
Output is correct |
15 |
Correct |
3 ms |
4948 KB |
Output is correct |
16 |
Correct |
3 ms |
5020 KB |
Output is correct |
17 |
Correct |
27 ms |
7288 KB |
Output is correct |
18 |
Correct |
26 ms |
7312 KB |
Output is correct |
19 |
Correct |
30 ms |
7324 KB |
Output is correct |
20 |
Correct |
30 ms |
7184 KB |
Output is correct |
21 |
Correct |
30 ms |
7308 KB |
Output is correct |
22 |
Correct |
33 ms |
7260 KB |
Output is correct |
23 |
Correct |
30 ms |
7244 KB |
Output is correct |
24 |
Correct |
30 ms |
7348 KB |
Output is correct |
25 |
Correct |
30 ms |
7336 KB |
Output is correct |
26 |
Correct |
30 ms |
7244 KB |
Output is correct |
27 |
Correct |
29 ms |
7252 KB |
Output is correct |
28 |
Correct |
35 ms |
7324 KB |
Output is correct |
29 |
Correct |
27 ms |
7264 KB |
Output is correct |
30 |
Correct |
29 ms |
7180 KB |
Output is correct |
31 |
Correct |
27 ms |
7300 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
5024 KB |
Output is correct |
2 |
Correct |
3 ms |
5116 KB |
Output is correct |
3 |
Correct |
3 ms |
4948 KB |
Output is correct |
4 |
Correct |
3 ms |
4948 KB |
Output is correct |
5 |
Correct |
3 ms |
4948 KB |
Output is correct |
6 |
Correct |
3 ms |
5020 KB |
Output is correct |
7 |
Correct |
3 ms |
5024 KB |
Output is correct |
8 |
Correct |
3 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4948 KB |
Output is correct |
10 |
Correct |
3 ms |
4948 KB |
Output is correct |
11 |
Correct |
3 ms |
4948 KB |
Output is correct |
12 |
Correct |
3 ms |
4960 KB |
Output is correct |
13 |
Correct |
3 ms |
5020 KB |
Output is correct |
14 |
Correct |
3 ms |
4948 KB |
Output is correct |
15 |
Correct |
3 ms |
4948 KB |
Output is correct |
16 |
Correct |
3 ms |
4948 KB |
Output is correct |
17 |
Correct |
4 ms |
5588 KB |
Output is correct |
18 |
Correct |
4 ms |
5588 KB |
Output is correct |
19 |
Correct |
3 ms |
4948 KB |
Output is correct |
20 |
Correct |
3 ms |
5076 KB |
Output is correct |
21 |
Correct |
3 ms |
5036 KB |
Output is correct |
22 |
Correct |
3 ms |
5076 KB |
Output is correct |
23 |
Correct |
3 ms |
4948 KB |
Output is correct |
24 |
Correct |
3 ms |
5076 KB |
Output is correct |
25 |
Correct |
3 ms |
5076 KB |
Output is correct |
26 |
Correct |
3 ms |
4948 KB |
Output is correct |
27 |
Correct |
3 ms |
5020 KB |
Output is correct |
28 |
Correct |
3 ms |
4948 KB |
Output is correct |
29 |
Correct |
4 ms |
5292 KB |
Output is correct |
30 |
Correct |
5 ms |
5288 KB |
Output is correct |
31 |
Correct |
3 ms |
5024 KB |
Output is correct |
32 |
Correct |
3 ms |
4948 KB |
Output is correct |
33 |
Correct |
3 ms |
4940 KB |
Output is correct |
34 |
Correct |
3 ms |
5024 KB |
Output is correct |
35 |
Correct |
3 ms |
4948 KB |
Output is correct |
36 |
Correct |
2 ms |
4948 KB |
Output is correct |
37 |
Correct |
3 ms |
4948 KB |
Output is correct |
38 |
Correct |
3 ms |
4948 KB |
Output is correct |
39 |
Correct |
3 ms |
5012 KB |
Output is correct |
40 |
Correct |
3 ms |
5020 KB |
Output is correct |
41 |
Correct |
3 ms |
4948 KB |
Output is correct |
42 |
Correct |
4 ms |
5076 KB |
Output is correct |
43 |
Correct |
3 ms |
4948 KB |
Output is correct |
44 |
Correct |
3 ms |
4948 KB |
Output is correct |
45 |
Correct |
3 ms |
4948 KB |
Output is correct |
46 |
Correct |
3 ms |
5020 KB |
Output is correct |
47 |
Correct |
27 ms |
7288 KB |
Output is correct |
48 |
Correct |
26 ms |
7312 KB |
Output is correct |
49 |
Correct |
30 ms |
7324 KB |
Output is correct |
50 |
Correct |
30 ms |
7184 KB |
Output is correct |
51 |
Correct |
30 ms |
7308 KB |
Output is correct |
52 |
Correct |
33 ms |
7260 KB |
Output is correct |
53 |
Correct |
30 ms |
7244 KB |
Output is correct |
54 |
Correct |
30 ms |
7348 KB |
Output is correct |
55 |
Correct |
30 ms |
7336 KB |
Output is correct |
56 |
Correct |
30 ms |
7244 KB |
Output is correct |
57 |
Correct |
29 ms |
7252 KB |
Output is correct |
58 |
Correct |
35 ms |
7324 KB |
Output is correct |
59 |
Correct |
27 ms |
7264 KB |
Output is correct |
60 |
Correct |
29 ms |
7180 KB |
Output is correct |
61 |
Correct |
27 ms |
7300 KB |
Output is correct |
62 |
Correct |
37 ms |
10444 KB |
Output is correct |
63 |
Correct |
382 ms |
53312 KB |
Output is correct |
64 |
Correct |
386 ms |
53672 KB |
Output is correct |
65 |
Correct |
39 ms |
10224 KB |
Output is correct |
66 |
Correct |
40 ms |
10056 KB |
Output is correct |
67 |
Correct |
41 ms |
10452 KB |
Output is correct |
68 |
Correct |
49 ms |
9932 KB |
Output is correct |
69 |
Correct |
44 ms |
8956 KB |
Output is correct |
70 |
Correct |
41 ms |
10216 KB |
Output is correct |
71 |
Correct |
50 ms |
10316 KB |
Output is correct |
72 |
Correct |
44 ms |
9436 KB |
Output is correct |
73 |
Correct |
258 ms |
36832 KB |
Output is correct |
74 |
Correct |
218 ms |
37008 KB |
Output is correct |
75 |
Correct |
538 ms |
63260 KB |
Output is correct |
76 |
Correct |
370 ms |
63732 KB |
Output is correct |
77 |
Correct |
494 ms |
63692 KB |
Output is correct |
78 |
Correct |
507 ms |
62460 KB |
Output is correct |