Submission #856999

# Submission time Handle Problem Language Result Execution time Memory
856999 2023-10-05T07:43:22 Z jmyszka2007 Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
157 ms 23672 KB
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); }
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#define check(x) 
#endif
typedef long long ll;
#define pi pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
unordered_map<int, vi>wys;
void solve() {
	//ifstream cin("nazwa.in");
	//ofstream cout("nazwa.out");
	int n;
	cin >> n;
	vi tab(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> tab[i];
		wys[tab[i]].eb(i);
	}
	for(int i = 1; i <= n; i++) {
		auto it = upper_bound(all(wys[tab[i]]), i);
		if(it != wys[tab[i]].end()) {
			for(int j = i + 1; j <= *it; j++) {
				tab[j] = tab[i];
			}
			i = *it - 1;
		}
	}
	for(int i = 1; i <= n; i++) {
		cout << tab[i] << '\n';
	}
}
int main() {
	fastio();
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 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 1 ms 348 KB Output is correct
16 Correct 1 ms 436 KB Output is correct
17 Correct 2 ms 444 KB Output is correct
18 Correct 2 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 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 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 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
# 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 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 436 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 53 ms 2784 KB Output is correct
18 Correct 46 ms 2760 KB Output is correct
19 Correct 42 ms 2868 KB Output is correct
20 Correct 40 ms 2800 KB Output is correct
21 Correct 40 ms 2760 KB Output is correct
22 Correct 40 ms 2756 KB Output is correct
23 Correct 40 ms 2796 KB Output is correct
24 Correct 41 ms 2760 KB Output is correct
25 Correct 40 ms 2884 KB Output is correct
26 Correct 40 ms 2760 KB Output is correct
27 Correct 42 ms 2912 KB Output is correct
28 Correct 42 ms 2964 KB Output is correct
29 Correct 39 ms 2760 KB Output is correct
30 Correct 46 ms 2832 KB Output is correct
31 Correct 45 ms 2788 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 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 1 ms 348 KB Output is correct
16 Correct 1 ms 436 KB Output is correct
17 Correct 2 ms 444 KB Output is correct
18 Correct 2 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 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 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 1 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 348 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 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 436 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 53 ms 2784 KB Output is correct
48 Correct 46 ms 2760 KB Output is correct
49 Correct 42 ms 2868 KB Output is correct
50 Correct 40 ms 2800 KB Output is correct
51 Correct 40 ms 2760 KB Output is correct
52 Correct 40 ms 2756 KB Output is correct
53 Correct 40 ms 2796 KB Output is correct
54 Correct 41 ms 2760 KB Output is correct
55 Correct 40 ms 2884 KB Output is correct
56 Correct 40 ms 2760 KB Output is correct
57 Correct 42 ms 2912 KB Output is correct
58 Correct 42 ms 2964 KB Output is correct
59 Correct 39 ms 2760 KB Output is correct
60 Correct 46 ms 2832 KB Output is correct
61 Correct 45 ms 2788 KB Output is correct
62 Correct 94 ms 5868 KB Output is correct
63 Correct 122 ms 23480 KB Output is correct
64 Correct 139 ms 23552 KB Output is correct
65 Correct 76 ms 5696 KB Output is correct
66 Correct 74 ms 5576 KB Output is correct
67 Correct 78 ms 6172 KB Output is correct
68 Correct 84 ms 5912 KB Output is correct
69 Correct 77 ms 6072 KB Output is correct
70 Correct 80 ms 6088 KB Output is correct
71 Correct 74 ms 5924 KB Output is correct
72 Correct 73 ms 5820 KB Output is correct
73 Correct 99 ms 14156 KB Output is correct
74 Correct 93 ms 14232 KB Output is correct
75 Correct 148 ms 23508 KB Output is correct
76 Correct 140 ms 23672 KB Output is correct
77 Correct 157 ms 23376 KB Output is correct
78 Correct 132 ms 23464 KB Output is correct