# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091500 | 2024-09-21T03:29:58 Z | quangminh412 | Stove (JOI18_stove) | C++14 | 1 ms | 856 KB |
#include <bits/stdc++.h> using namespace std; /* John Watson Mua Code nhu mua Florentino !! */ #define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long const int maxn = 130; int n; ll k; ll dp[maxn][2 * maxn][2]; ll magic(int idx, int cur, int isneg) { if (idx == -1) return (cur == 0 && !isneg ? 0 : 1); if (dp[idx][120 + cur][isneg] != -1) return dp[idx][120 + cur][isneg]; ll res = 0; for (int i = 0; i < 2; i++) { int v = (i == 0 ? 1 : -1); res += magic(idx - 1, cur + v, isneg | (cur + v < 0)); } return dp[idx][120 + cur][isneg] = res; } string ans = ""; string solve(int idx, int cur) { if (idx == -1) return ans; ll s1 = magic(idx - 1, cur + 1, (cur < 0)); if (s1 >= k) { ans += '1'; return solve(idx - 1, cur + 1); } k -= s1; ans += '0'; return solve(idx - 1, cur - 1); } signed main() { if (fopen("test.inp", "r")) { freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout); } faster(); cin >> n >> k; memset(dp, -1, sizeof(dp)); solve(n - 1, 0); for (char c : ans) cout << (c == '1' ? '(' : ')'); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 856 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 856 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 856 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |