Hello World!

https://www.acmicpc.net/problem/17952 코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);typedef long long ll;stack> st;int main() { FASTIO; int n, a, t, order; ll ans = 0; cin >> n; while (n--) { cin >> order; if (order == 1) { cin >> a >> t; if (t == 1) ans += a; else st.push({ a, t-1 }); } else { if (!st.empty()) { st.top().second-..

https://www.acmicpc.net/problem/14267코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);int n, m;vector> v;vector dp;void spread(int start, int sum) { if (v[start].size() == 0) return; else { for (int t : v[start]) { dp[t] += sum; spread(t, dp[t]); } }}int main() { FASTIO; cin >> n >> m; v.resize(n + 1); dp.resize(n + 1, 0); for (int i = 1, ..