답안 #967836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967836	2024-04-23T01:41:53 Z	marvinthang	Homework (CEOI22_homework)	C++17	100 / 100	56 ms	31440 KB

Main

/*************************************
*    author: marvinthang             *
*    created: 23.04.2024 08:21:34    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	string s; cin >> s;
	stack <array <int, 4>> st;
	REP(i, s.size()) {
		if (s[i] == 'm') {
			st.push({s[i + 1] == 'a', -1, -1, -1});
			i += 3;
		} else if (s[i] == '?') {
			int l = 1, r = 1, n = 1;
			while (!st.empty() && st.top()[1] != -1) {
				if (!st.top()[0]) {
					l = min(st.top()[2], l);
					r += st.top()[3] - 1;
				} else {
					l += st.top()[2];
					r = max(r + st.top()[1], st.top()[3] + n);
				}
				n += st.top()[1];
				st.pop();
			}
			if (st.empty()) return void(cout << r - l + 1 << '\n');
			st.top()[1] = n;
			st.top()[2] = l;
			st.top()[3] = r;
			++i;
		}
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("homework");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:76:2: note: in expansion of macro 'file'
   76 |  file("homework");
      |  ^~~~
Main.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:76:2: note: in expansion of macro 'file'
   76 |  file("homework");
      |  ^~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 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	0 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	0 ms	600 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	452 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 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	0 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	0 ms	600 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	452 KB	Output is correct
29	Correct	1 ms	452 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	0 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	0 ms	348 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	1 ms	548 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	1 ms	344 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	344 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	0 ms	504 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	31172 KB	Output is correct
2	Correct	33 ms	31188 KB	Output is correct
3	Correct	38 ms	30548 KB	Output is correct
4	Correct	37 ms	30420 KB	Output is correct
5	Correct	35 ms	30732 KB	Output is correct
6	Correct	33 ms	31440 KB	Output is correct
7	Correct	38 ms	30676 KB	Output is correct
8	Correct	33 ms	30444 KB	Output is correct
9	Correct	35 ms	31180 KB	Output is correct
10	Correct	34 ms	30496 KB	Output is correct
11	Correct	36 ms	30500 KB	Output is correct
12	Correct	33 ms	31440 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 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	0 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	0 ms	600 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	452 KB	Output is correct
29	Correct	1 ms	452 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	0 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	0 ms	348 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	1 ms	548 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	1 ms	344 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	344 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	0 ms	504 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	460 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	1 ms	348 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	600 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	1 ms	348 KB	Output is correct
74	Correct	1 ms	348 KB	Output is correct
75	Correct	0 ms	348 KB	Output is correct
76	Correct	1 ms	348 KB	Output is correct
77	Correct	1 ms	348 KB	Output is correct
78	Correct	1 ms	348 KB	Output is correct
79	Correct	1 ms	344 KB	Output is correct
80	Correct	1 ms	344 KB	Output is correct
81	Correct	0 ms	348 KB	Output is correct
82	Correct	0 ms	348 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	1 ms	348 KB	Output is correct
85	Correct	0 ms	348 KB	Output is correct
86	Correct	0 ms	348 KB	Output is correct

Subtask #5
34.0 / 34.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 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	0 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	0 ms	600 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	600 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	452 KB	Output is correct
29	Correct	1 ms	452 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	0 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	0 ms	348 KB	Output is correct
40	Correct	0 ms	344 KB	Output is correct
41	Correct	1 ms	548 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	1 ms	344 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	344 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	0 ms	504 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	35 ms	31172 KB	Output is correct
58	Correct	33 ms	31188 KB	Output is correct
59	Correct	38 ms	30548 KB	Output is correct
60	Correct	37 ms	30420 KB	Output is correct
61	Correct	35 ms	30732 KB	Output is correct
62	Correct	33 ms	31440 KB	Output is correct
63	Correct	38 ms	30676 KB	Output is correct
64	Correct	33 ms	30444 KB	Output is correct
65	Correct	35 ms	31180 KB	Output is correct
66	Correct	34 ms	30496 KB	Output is correct
67	Correct	36 ms	30500 KB	Output is correct
68	Correct	33 ms	31440 KB	Output is correct
69	Correct	0 ms	344 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	1 ms	348 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	0 ms	460 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	1 ms	348 KB	Output is correct
76	Correct	1 ms	348 KB	Output is correct
77	Correct	0 ms	348 KB	Output is correct
78	Correct	0 ms	348 KB	Output is correct
79	Correct	0 ms	348 KB	Output is correct
80	Correct	1 ms	348 KB	Output is correct
81	Correct	0 ms	348 KB	Output is correct
82	Correct	0 ms	600 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	0 ms	348 KB	Output is correct
85	Correct	0 ms	348 KB	Output is correct
86	Correct	1 ms	348 KB	Output is correct
87	Correct	1 ms	348 KB	Output is correct
88	Correct	0 ms	348 KB	Output is correct
89	Correct	1 ms	348 KB	Output is correct
90	Correct	1 ms	348 KB	Output is correct
91	Correct	1 ms	348 KB	Output is correct
92	Correct	1 ms	344 KB	Output is correct
93	Correct	1 ms	344 KB	Output is correct
94	Correct	0 ms	348 KB	Output is correct
95	Correct	0 ms	348 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	1 ms	348 KB	Output is correct
98	Correct	0 ms	348 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct
100	Correct	30 ms	15004 KB	Output is correct
101	Correct	30 ms	15060 KB	Output is correct
102	Correct	26 ms	14956 KB	Output is correct
103	Correct	25 ms	14808 KB	Output is correct
104	Correct	23 ms	15320 KB	Output is correct
105	Correct	37 ms	19404 KB	Output is correct
106	Correct	34 ms	19384 KB	Output is correct
107	Correct	30 ms	19404 KB	Output is correct
108	Correct	30 ms	20292 KB	Output is correct
109	Correct	36 ms	20696 KB	Output is correct
110	Correct	35 ms	14124 KB	Output is correct
111	Correct	34 ms	14036 KB	Output is correct
112	Correct	35 ms	14284 KB	Output is correct
113	Correct	29 ms	14036 KB	Output is correct
114	Correct	30 ms	14040 KB	Output is correct
115	Correct	56 ms	30404 KB	Output is correct
116	Correct	44 ms	30752 KB	Output is correct
117	Correct	50 ms	30416 KB	Output is correct
118	Correct	38 ms	31184 KB	Output is correct
119	Correct	39 ms	30412 KB	Output is correct
120	Correct	28 ms	14044 KB	Output is correct
121	Correct	28 ms	15400 KB	Output is correct
122	Correct	33 ms	14140 KB	Output is correct
123	Correct	41 ms	14860 KB	Output is correct
124	Correct	29 ms	22220 KB	Output is correct
125	Correct	34 ms	22328 KB	Output is correct
126	Correct	36 ms	22992 KB	Output is correct
127	Correct	26 ms	23472 KB	Output is correct
128	Correct	14 ms	7652 KB	Output is correct
129	Correct	15 ms	8856 KB	Output is correct
130	Correct	10 ms	7896 KB	Output is correct
131	Correct	1 ms	348 KB	Output is correct

답안 #967836

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 13.0 / 13.0

Subtask #3 13.0 / 13.0

Subtask #4 30.0 / 30.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
13.0 / 13.0

Subtask #3
13.0 / 13.0

Subtask #4
30.0 / 30.0

Subtask #5
34.0 / 34.0