oj.uz

답안 #884082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884082 2023-12-06T15:37:46 Z salyg1n Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 264 ms 23888 KB 
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define mp make_pair
#define uset unordered_set
#define umap unordered_map
#define mset multiset
#define lb lower_bound
#define ub upper_bound
//#define int long long

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef set<int> si;
typedef vector<si> vsi;
typedef mset<int> msi;
typedef vector<msi> vmsi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<vpi> vvpi;
typedef set<pi> spi;
typedef mset<pi> mspi;
typedef vector<spi> vspi;
typedef tuple<int, int, int> ti;
typedef vector<ti> vti;
typedef vector<vti> vvti;
typedef set<ti> sti;
typedef mset<ti> msti;
typedef vector<sti> vsti;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef map<int, int> mii;

mt19937 rnd(228);

template<typename t> bool minravno(t& a, t b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}
template<typename t> bool maxravno(t& a, t b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}
template<typename t> void input(t& a, int i = 0, int j = -1) {
	if (j == -1)
		j = a.size() - 1;
	for (int k = i; k <= j; ++k) {
		cin >> a[k];
	}
}

const int MAXN = 2e5 + 10, MAX = 1e4 + 10, INF = 1e18, MOD = 998244353;

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	vi a(n + 1);
	input(a, 1);
	spi s;
	mii m;
	s.insert({1, a[1]});
	m[a[1]] = 1;
	for (int i = 2; i <= n; ++i) {
		if (!m.count(a[i])) {
			m[a[i]] = i;
			s.insert({i, a[i]});
			continue;
		}
		int j = m[a[i]];
		while (s.ub({j, a[i]}) != s.end()) {
			auto [k, x] = *s.ub({j, a[i]});
			m.erase(x);
			s.erase({k, x});
		}
		m[a[i]] = i;
	}
	s.insert({n + 1, 0});
	while (s.size() >= 2) {
		auto [i, x] = *s.begin();
		auto [j, y] = *(++s.begin());
		for (int k = 0; k < j - i; ++k)
			cout << x << '\n';
		s.erase(s.begin());
	}


	return 0;
}

Compilation message

Main.cpp:64:50: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   64 | const int MAXN = 2e5 + 10, MAX = 1e4 + 10, INF = 1e18, MOD = 998244353;
      |                                                  ^~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 484 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 0 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 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 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 0 ms 600 KB Output is correct
29 Correct 1 ms 576 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
8 Correct 1 ms 460 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 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 348 KB Output is correct
17 Correct 17 ms 1900 KB Output is correct
18 Correct 19 ms 1884 KB Output is correct
19 Correct 23 ms 1880 KB Output is correct
20 Correct 22 ms 1872 KB Output is correct
21 Correct 27 ms 1884 KB Output is correct
22 Correct 23 ms 1872 KB Output is correct
23 Correct 31 ms 1884 KB Output is correct
24 Correct 29 ms 1872 KB Output is correct
25 Correct 22 ms 1872 KB Output is correct
26 Correct 23 ms 1872 KB Output is correct
27 Correct 31 ms 1884 KB Output is correct
28 Correct 23 ms 1872 KB Output is correct
29 Correct 25 ms 2136 KB Output is correct
30 Correct 18 ms 2136 KB Output is correct
31 Correct 18 ms 1884 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 484 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 0 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 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 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 0 ms 600 KB Output is correct
29 Correct 1 ms 576 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 1 ms 348 KB Output is correct
38 Correct 1 ms 460 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 348 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 17 ms 1900 KB Output is correct
48 Correct 19 ms 1884 KB Output is correct
49 Correct 23 ms 1880 KB Output is correct
50 Correct 22 ms 1872 KB Output is correct
51 Correct 27 ms 1884 KB Output is correct
52 Correct 23 ms 1872 KB Output is correct
53 Correct 31 ms 1884 KB Output is correct
54 Correct 29 ms 1872 KB Output is correct
55 Correct 22 ms 1872 KB Output is correct
56 Correct 23 ms 1872 KB Output is correct
57 Correct 31 ms 1884 KB Output is correct
58 Correct 23 ms 1872 KB Output is correct
59 Correct 25 ms 2136 KB Output is correct
60 Correct 18 ms 2136 KB Output is correct
61 Correct 18 ms 1884 KB Output is correct
62 Correct 27 ms 5072 KB Output is correct
63 Correct 158 ms 12368 KB Output is correct
64 Correct 154 ms 10308 KB Output is correct
65 Correct 33 ms 4824 KB Output is correct
66 Correct 31 ms 4692 KB Output is correct
67 Correct 32 ms 5084 KB Output is correct
68 Correct 33 ms 5204 KB Output is correct
69 Correct 36 ms 5204 KB Output is correct
70 Correct 35 ms 5060 KB Output is correct
71 Correct 35 ms 4996 KB Output is correct
72 Correct 39 ms 4944 KB Output is correct
73 Correct 160 ms 14356 KB Output is correct
74 Correct 139 ms 14420 KB Output is correct
75 Correct 169 ms 23780 KB Output is correct
76 Correct 264 ms 23888 KB Output is correct
77 Correct 164 ms 23768 KB Output is correct
78 Correct 225 ms 23852 KB Output is correct