코딩하는 회사원 코딩하는 회사원

#include #include #include using namespace std;using ll = long long;using pii = pair;int N;vector v;stack s;int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N; v.resize(N); for (int i = 0; i > v[i]; ll res = 0; for (int h : v) { int cnt = 1; while (!s.empty() && s.top().first

#include #include #include #include using namespace std;int N, M, arr[10][10];int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tc; cin >> tc; while (tc--) { cin >> N >> M; memset(arr, 0, sizeof(arr)); for (int i = 0; i > v >> a >> b; arr[a][b] += v; } vector p; for (int i = 0; i mxx) { mxx = sum; cnt = 1; } else if (sum == mxx) { cnt++; } ..

#include #include #include using namespace std;int N, M, K;vector gen_sums(vector &v, int n) { vector sums; vector perm(n); fill(perm.begin() + n - K, perm.end(), true); do { int sum = 0; for (int i = 0; i > tc; while (tc--) { cin >> N >> M >> K; vector b(N), a(M); for (int i = 0; i > b[i]; for (int i = 0; i > a[i]; vector bs = gen_sums(b, N); vector as = gen_sums(a, M); sort(bs.begin()..

어이가 없게도 res 를 갱신할 떄, res = s.top() + res; 이런 식으로 채워나갔는데 여기가 시간 초과가 발생하는 지점이었다.#include #include #include #include using namespace std;int N, K;int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N >> K; string num; cin >> num; stack s; for (int i = 0; i 0 && !s.empty() && s.top()

#include #include #include using namespace std;int main() { string S, T; cin >> S >> T; while (T.length() > S.length()) { if (T.back() == 'A') { T.pop_back(); } else if (T.back() == 'B') { T.pop_back(); reverse(T.begin(), T.end()); } } int res = 0; if (S.compare(T) == 0) res = 1; cout

#include #include #include #include using namespace std;using ll = long long;const ll INF = 1e18;ll __pow(ll p) { return p * p;}int main() { int T; cin >> T; while (T--) { ll N, K, a, b; cin >> N >> K >> a >> b; vector S(N); for (int i = 0; i > S[i]; ll accum = accumulate(S.begin(), S.end(), 0); vector dp(accum + 1, INF); dp[0] = 0; for (int i = 0; i 1) ? (a * __pow(S[i] - 1) + b) : 0..

#include #include using namespace std;const int MOD = 9901;int N, M, dp[15*15][1 = N * M) return 0; int &ret = dp[num][status]; if (ret != -1) return ret; ret = 0; if (status & 1) { ret = dfs(num + 1, status >> 1); } else { // 세로 채우기 ret = dfs(num + 1, (status >> 1) | (1 > 2)); } } return ret %= MOD;}int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N >> M;..

#include using namespace std;using ll = long long;const ll MOD = 1e9;ll dp[101][101], N;int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N; for (int i = 0; i