func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; void add(int &a, int b) { a += b; if (a >= mod) a -= mod; } int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<int> dp(20002), pre(20002, 0); int zero = 10000; int ans = 0; for (int i = 1; i <= n; ++i) { int x; cin >> x; ++pre[zero]; for (int j = 0; j <= zero << 1; ++j) { if (j >= x) add(dp[j], pre[j - x]); if (j + x <= zero * 2) add(dp[j], pre[j + x]); } add(ans, dp[zero]); if (i == n) continue; pre = dp; memset(&dp[0], 0, sizeof dp[0] * dp.size()); } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; int n, k; map<int, int> m; string s; long long ans; bool flag; void solve() { cin >> n; cin >> k; vector<int> a(n); int maxi = 0; for (auto i = 0; i < n; i++) cin >> a[i]; ; for (auto i = 0; i < n; i++) { maxi = max(maxi, a[i]); m[a[i]]++; if (m[a[i]] >= k) { cout << 0; return; } } long long ans = INT_MAX; for (auto x = 1; x < 200000; x++) { queue<int> q; q.push(x); long long an = 0; int mul = 0; int K = 0; while (!q.empty() && K < k) { int N = q.size(); while (N-- && K < k) { int y = q.front(); q.pop(); int count = m[y]; if ((y * 2 - 1) < maxi) { q.push(y * 2); q.push(y * 2 + 1); } if (count > (k - K)) count = (k - K); an += count * mul; K += count; } mul++; } if (K == k) ans = min(an, ans); } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> const int S = 400004; int last, tr[S][26], fail[S], len[S], tot = 0, eg = 1, h[S], nx[S << 1], v[S << 1], e[S]; char c[S]; void insert(int &last, char c) { c -= a ; int p = last, now = ++tot; len[now] = len[last] + 1; while (p != -1 && !tr[p][c]) { tr[p][c] = now; p = fail[p]; } if (p == -1) fail[now] = 0; else { int q = tr[p][c]; if (len[p] + 1 == len[q]) fail[now] = q; else { int w = ++tot; len[w] = len[p] + 1; fail[w] = fail[q]; for (int i = 0; i < 26; ++i) tr[w][i] = tr[q][i]; fail[q] = fail[now] = w; while (p != -1 && tr[p][c] == q) { tr[p][c] = w; p = fail[p]; } } } last = now; } inline void egadd(int uu, int vv) { nx[++eg] = h[uu]; h[uu] = eg; v[eg] = vv; } long long res = 0; void dfs(int x) { for (int i = h[x]; i; i = nx[i]) { dfs(v[i]); e[x] += e[v[i]]; } res += (len[x] - len[fail[x]]) * 1ll * e[x] * e[x]; } int main() { int T; scanf( %d , &T); while (T--) { tot = last = 0; fail[0] = -1; res = 0; scanf( %s , c + 1); for (int i = 1; c[i]; ++i) insert(last, c[i]); int p = 0; for (int i = 1; c[i]; ++i) { p = tr[p][c[i] - a ]; e[p] = 1; } for (int i = 1; i <= tot; ++i) egadd(fail[i], i); dfs(0); printf( %lld n , res); for (int i = 0; i <= tot; ++i) { fail[i] = len[i] = 0; h[i] = 0; e[i] = 0; for (int j = 0; j < 26; ++j) tr[i][j] = 0; } eg = 1; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1000 + 3; void read(int &x) { char ch; bool flag = 0; for (ch = getchar(); !isdigit(ch) && ((flag |= (ch == - )) || 1); ch = getchar()) ; for (x = 0; isdigit(ch); x = (x << 1) + (x << 3) + ch - 48, ch = getchar()) ; x *= 1 - 2 * flag; } string fuck[maxn]; int edge[105][105]; map<string, int> cou; int a[105], b[105]; int out = -1; vector<string> output; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { string tmp; cin >> tmp; fuck[i] = tmp; cou[tmp] = i; } for (int i = 0; i < m; i++) { string c, d; cin >> c >> d; edge[cou[c]][cou[d]] = 1; edge[cou[d]][cou[c]] = 1; } int aa[50]; for (int i = 0; i < (1 << n); i++) { memset(aa, 0, sizeof(aa)); int top = 0; for (int j = 0; j < n; j++) { if (i & (1 << j)) { aa[j] = 1; top++; } } bool f = 1; for (int j = 0; j < n; j++) { for (int k = j + 1; k < n; k++) { if (aa[j] && aa[k] && edge[j][k]) { f = 0; break; } } } if (!f) continue; if (top > out) { out = top; output.clear(); for (int j = 0; j < n; j++) { if (aa[j]) output.push_back(fuck[j]); } } } cout << output.size() << endl; sort(output.begin(), output.begin() + out); for (int i = 0; i < output.size(); i++) cout << output[i] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long inf = 10000000; int main() { int n; string s; scanf( %d , &n); cin >> s; for (int i = 0; i < s.size(); i++) { for (int j = 1; j < 25; j++) { if (i + j * 4 < 100) { if (s[i] == * && s[i + j] == * && s[i + j * 2] == * && s[i + j * 3] == * && s[i + j * 4] == * ) { printf( yes ); return 0; } } } } printf( no ); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void print_array(T* arr, int num) { for (int(i) = (0); (i) < (num); (i)++) cout << arr[i] << ; cout << n ; } template <typename T> void print_vector(vector<T> vec) { for (int(i) = (0); (i) < (vec.size()); (i)++) cout << vec[i] << ; cout << n ; } void setIO() {} int n, x, p0[5010], b0[5010], arr[5010], b[5010], p[5010]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); setIO(); cin >> n; for (int(i) = (0); (i) < (n); (i)++) { cout << ? << 0 << << i << n ; cout.flush(); cin >> p0[i]; } for (int(i) = (0); (i) < (n); (i)++) { cout << ? << i << << 0 << n ; cout.flush(); cin >> b0[i]; } int ans = 0; bitset<5010> chk; for (int(i) = (0); (i) < (n); (i)++) { chk.reset(); int found = 1; for (int(j) = (0); (j) < (n); (j)++) { p[j] = b0[j] ^ i; if (p[j] >= n || chk[p[j]]) { found = 0; break; } chk[p[j]] = 1; } if (!found) continue; for (int(j) = (0); (j) < (n); (j)++) b[p[j]] = j; for (int(j) = (0); (j) < (n); (j)++) { if (p0[j] != (p[0] ^ b[j]) || b0[j] != (p[j] ^ b[0])) { found = 0; break; } } if (found) { ans++; if (ans == 1) for (int(j) = (0); (j) < (n); (j)++) arr[j] = p[j]; } } cout << ! << n << ans << n ; for (int(i) = (0); (i) < (n); (i)++) cout << arr[i] << ; cout.flush(); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; double L, v1, v2; cin >> n >> L >> v1 >> v2 >> k; double p = 2 * (n / k - (n % k == 0)) + 1; printf( %.10f , double(L * (p * v2 + v1)) / double(v2 * (p * v1 + v2))); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tt; cin >> tt; while (tt--) { int k; cin >> k; string s, a, b; cin >> s >> a >> b; int n = (int)(s).size(); vector<int> x; vector<int> p(k, -1); bool goodx = true; for (int i = 0; i < n; ++i) { int c = s[i] - a ; if (p[c] != -1) { if (p[c] < a[i] - a ) { goodx = false; break; } else if (p[c] == a[i] - a ) { continue; } else { goodx = true; break; } } p[c] = a[i] - a ; x.push_back(i); } bool found = false; for (int u = 0; u <= (int)(x).size(); ++u) { if (u == (int)(x).size() && !goodx) { continue; } p.assign(k, -1); vector<bool> occ(k, false); bool ok = true; for (int i = 0; i < u; ++i) { if (occ[a[x[i]] - a ]) { ok = false; break; } occ[a[x[i]] - a ] = true; p[s[x[i]] - a ] = a[x[i]] - a ; } if (u < (int)(x).size()) { int pos = a[x[u]] - a + 1; while (pos < k && occ[pos]) { ++pos; } if (pos == k) { ok = false; } else { p[s[x[u]] - a ] = pos; occ[pos] = true; } } if (!ok) { continue; } int pos = 0; for (int i = 0; i < n; ++i) { if (p[s[i] - a ] != -1) { continue; } while (occ[pos]) { ++pos; } p[s[i] - a ] = pos; occ[pos] = true; } string res = ; for (int i = 0; i < n; ++i) { res += char(p[s[i] - a ] + a ); } if (res > b) { continue; } found = true; cout << YES n ; for (int i = 0; i < k; ++i) { if (p[i] != -1) { continue; } while (occ[pos]) { ++pos; } p[i] = pos; occ[pos] = true; } for (int i = 0; i < k; ++i) { cout << char(p[i] + a ); } cout << n ; break; } if (!found) { cout << NO n ; } } }
|
#include <bits/stdc++.h> using namespace std; struct Point { long long x, y; int id; }; long long judge(Point p0, Point p1, Point p2) { return (p1.x - p0.x) * (p2.y - p1.y) - (p2.x - p1.x) * (p1.y - p0.y); } long long cmp(Point a, Point b) { if (a.x == b.x) return a.y < b.y; return a.x < b.x; } Point s[100005]; int main() { int n; while (~scanf( %d , &n)) { for (int i = 1; i <= n; i++) scanf( %lld%lld , &s[i].x, &s[i].y), s[i].id = i; sort(s + 1, s + 1 + n, cmp); int flag, ans; int a = 0, b = 0, c = 0; for (int i = 3; i <= n; i++) { flag = 0, ans = 0; if (judge(s[1], s[2], s[i]) == 0) ans++; if (ans == 0) { a = s[1].id, b = s[2].id, c = s[i].id; flag = 1; break; } } printf( %d %d %d n , a, b, c); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int clique_size(vector<int> *graph, vector<int> &govs, int *visited, int starting) { visited[starting] = 1; int size = 1; for (int i = 0; i < graph[starting].size(); i++) { if (!visited[graph[starting][i]]) { size += clique_size(graph, govs, visited, graph[starting][i]); } } return size; } int main(int argc, char *argv[]) { vector<int> graph[1001]; vector<int> govs; int visited[1001] = {0}; int n, m, k; cin >> n >> m >> k; for (int i = 0; i < k; i++) { int c; cin >> c; govs.push_back(c); } for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; graph[u].push_back(v); graph[v].push_back(u); } int connected_points = 0; int max_state_size = 0; int answer = 0; for (int i = 0; i < k; i++) { int count = clique_size(graph, govs, visited, govs[i]); connected_points += count; max_state_size = (count > max_state_size) ? count : max_state_size; answer += count * (count - 1) / 2; } int remaining = n - connected_points; answer -= max_state_size * (max_state_size - 1) / 2; max_state_size += remaining; answer += max_state_size * (max_state_size - 1) / 2; cout << answer - m << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long s = 0; bool f = 0; char ch = ; while (!isdigit(ch)) { f |= (ch == - ); ch = getchar(); } while (isdigit(ch)) { s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar(); } return (f) ? (-s) : (s); } inline void write(long long x) { if (x < 0) { putchar( - ); x = -x; } if (x < 10) { putchar(x + 0 ); return; } write(x / 10); putchar((x % 10) + 0 ); return; } const int N = 100005; int n, Num, a[N]; struct Zidianshu { int Trie[N * 25][25], cnt; int End[N * 25]; inline void Init() { cnt = 0; } inline void Insert(int Num) { int i, Root = 0; for (i = 0; i <= 23; i++) { int oo = (Num & (1 << i)) >> i; if (!Trie[Root][oo]) Trie[Root][oo] = ++cnt; Root = Trie[Root][oo]; } End[Root]++; } inline int Query(int Num, int Want) { int i, Root = 0; for (i = 0; i <= 23; i++) { int oo = ((Want & (1 << i)) >> i) ^ ((Num & (1 << i)) >> i); if (!Trie[Root][oo]) return 0; Root = Trie[Root][oo]; } return End[Root]; } } Trie; int main() { Trie.Init(); int i; long long ans = 0; n = read(); Num = read(); for (i = 1; i <= n; i++) { a[i] = read(); ans += 1ll * Trie.Query(a[i], Num); Trie.Insert(a[i]); } write(ans), putchar( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 2e9; long long sum(long long l, long long r) { return (l + r) * (r - l + 1) / 2; } int main() { long long n, H; cin >> n >> H; long long l = H, r = 2e9, ans = -1; while (l <= r) { long long mid = (l + r) >> 1; if (n >= sum(H, mid) + sum(1, mid) - mid) ans = mid, l = mid + 1; else r = mid - 1; } if (ans != -1) { cout << 2 * ans - H + ((n - sum(H, ans) - sum(1, ans) + ans) + ans - 1) / ans << endl; } else { l = 1, r = min(H, N); while (l <= r) { long long mid = (l + r) >> 1; if (n >= sum(1, mid)) ans = mid, l = mid + 1; else r = mid - 1; } cout << ans + (n - sum(1, ans) + ans - 1) / ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d n , &n); string str; getline(cin, str); int ans = 0; int subans = 0; for (int i = 0; i < n; i++) { if (str[i] != ) { int ascii = (int)str[i]; if (ascii >= 65 && ascii <= 90) { subans++; } ans = max(ans, subans); } else { subans = 0; } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; long long s, x; string S, X; long long dp[64][2]; long long d__p(int i, int st) { if (i == S.size() && st) return 0; else if (i == S.size()) return 1; long long &res = dp[i][st]; if (res != -1) return res; res = 0; int x = S[i] - 0 ; int y = X[i] - 0 ; for (int a = 0; a <= 1; a++) { for (int b = 0; b <= 1; b++) { int remember = (a + b + st) > 1; int Sum = a + b + st; Sum %= 2; int Xor = a ^ b; if (Sum != x || Xor != y) continue; res += d__p(i + 1, remember); } } return res; } int main() { cin >> s >> x; for (int i = 63; i >= 0; i--) { if (s & (1LL << i)) S += 1 ; else S += 0 ; if (x & (1LL << i)) X += 1 ; else X += 0 ; } reverse(S.begin(), S.end()); reverse(X.begin(), X.end()); memset(dp, -1, sizeof dp); cout << d__p(0, 0) - 2 * (s == x); return 0; }
|
#include <bits/stdc++.h> using namespace std; class DREAD { friend int fread(); static const int buff_max = 20000000 + 10; char buf[buff_max], *pt; public: void clear() { for (; isspace(*pt); ++pt) ; } void Init() { buf[fread(buf, 1, buff_max, stdin)] = EOF; pt = buf; } bool eoln() { return *pt == n ; } inline bool eof() { return *pt == EOF; } int Int() { bool pos = 1; int res = 0; for (; !isdigit(*pt) && *pt != - && !eof(); ++pt) ; if (*pt == - ) pos = 0, ++pt; for (; isdigit(*pt); ++pt) res = res * 10 + (*pt - 0 ); return pos ? res : -res; } } READ; const int N_MAX = 5000 + 10; int N, M, seq[N_MAX], bad[N_MAX]; namespace Nwork { int gcd[N_MAX]; int GCD(int a, int b) { return b ? GCD(b, a % b) : a; } int p[N_MAX], e[N_MAX], cnt; int exist(int p) { return *lower_bound(bad + 1, bad + M + 1, p) == p ? -1 : 1; } int calc(int x) { cnt = 0; for (int i = 2, k = int(sqrt(x)); i <= k; ++i) { if (x == 1) break; if (x % i == 0) { p[++cnt] = i; for (e[cnt] = 0; x % i == 0; x /= i) ++e[cnt]; } } if (x != 1) p[++cnt] = x, e[cnt] = 1; int ret = 0; for (int i = 1; i <= cnt; ++i) ret += exist(p[i]) * e[i]; return ret; } void main() { gcd[1] = seq[1]; for (int i = 2; i <= N; ++i) gcd[i] = GCD(gcd[i - 1], seq[i]); sort(bad + 1, bad + M + 1); for (int r = N; r >= 1; --r) if (calc(gcd[r]) < 0) for (int i = 1; i <= r; ++i) { seq[i] /= gcd[r]; gcd[i] /= gcd[r]; } int ret = 0; for (int i = 1; i <= N; ++i) ret += calc(seq[i]); printf( %d n , ret); } } // namespace Nwork namespace Ninit { void init() { N = READ.Int(), M = READ.Int(); for (int i = 1; i <= N; ++i) seq[i] = READ.Int(); for (int i = 1; i <= M; ++i) bad[i] = READ.Int(); } } // namespace Ninit int main() { READ.Init(); Ninit::init(); Nwork::main(); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) using namespace std; enum { MOD0 = 1000000000, MOD7 = 1000000007, MOD9 = 1000000009 }; template <typename T> ostream &operator<<(ostream &cout, vector<T> &a) { for (size_t i = 0; i < a.size(); ++i) cout << a[i] << ; return cout; } template <typename T> ostream &operator<<(ostream &cout, vector<vector<T> > &a) { for (size_t i = 0; i < a.size(); ++i) cout << a[i] << endl; return cout; } int p[256]; inline bool eq(int a, int b) { return p[a] == p[b]; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); for (int i = 0; i < sizeof(p) / sizeof(*p); ++i) { p[i] = i; } p[ 1 ] = p[ i ] = p[ l ]; p[ 0 ] = p[ o ]; for (int i = A ; i <= Z ; ++i) { p[i] = p[i - A + a ]; } string s; cin >> s; int n; cin >> n; string a; for (int i = 0; i < n; ++i) { cin >> a; if (a.size() != s.size()) { continue; } bool bad = 1; for (int j = 0; j < a.size(); ++j) { if (!eq(a[j], s[j])) { bad = 0; break; } } if (bad) { cout << No << n ; return 0; } } cout << Yes << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const double err = 1e-12; const double PI = 3.141592653589793; const int N = 1e5 + 5; int n; vector<int> res; void solve() { cin >> n; if (n & 1) { cout << 1 << ; n--; for (int i = 2; i <= n; i += 2) cout << i + 1 << << i << ; cout << endl; } else { cout << n << ; n--; for (int i = 2; i <= (n - 1); i += 2) cout << i + 1 << << i << ; cout << 1 << endl; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int maxn = 55; long long f[maxn][maxn][maxn][maxn]; long long pw[maxn]; int c[maxn]; void init() { f[0][0][0][0] = 1; pw[0] = 1; for (int i = 1; i < maxn; i++) pw[i] = (pw[i - 1] * 2ll) % mod; } long long cal(int x, bool xx) { return x ? pw[x - 1] : xx; } void cal_ans(int ew, int ow, int eb, int ob, int now, long long& ret) { if (now != 0 && ew) (ret += f[ew - 1][ow][eb][ob] * pw[ew + ow - 1 + eb] % mod * cal(ob, 0) % mod) %= mod; if (now != 0 && ow) (ret += f[ew][ow - 1][eb][ob] * pw[ew + ow - 1 + eb] % mod * cal(ob, 1) % mod) %= mod; if (now != 1 && eb) (ret += f[ew][ow][eb - 1][ob] * pw[eb + ob - 1 + ew] % mod * cal(ow, 0) % mod) %= mod; if (now != 1 && ob) (ret += f[ew][ow][eb][ob - 1] * pw[eb + ob - 1 + ew] % mod * cal(ow, 1) % mod) %= mod; } int main(int argc, const char** argv) { init(); int n, p; cin >> n >> p; for (int i = 1; i <= n; i++) scanf( %d , c + i); long long ans = 0; for (int i = 1; i <= n; i++) for (int ew = 0; ew <= i; ew++) for (int ow = 0; ow + ew <= i; ow++) for (int eb = 0; ow + ew + eb <= i; eb++) { int ob = i - ow - ew - eb; cal_ans(ew, ow, eb, ob, c[i], f[ew][ow][eb][ob]); if (i == n && ((ow + ob) & 1) == p) (ans += f[ew][ow][eb][ob]) %= mod; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 6; vector<int> G[N]; int d[N]; void dfs(int u, int f, int dep) { d[u] = dep; for (int i = 0, iend = G[u].size(); i < iend; ++i) { int v = G[u][i]; if (v != f) dfs(v, u, dep + 1); } } int main() { int T; scanf( %d , &T); while (T--) { int n, a, b, da, db; scanf( %d%d%d%d%d , &n, &a, &b, &da, &db); for (int i = 1; i <= n; ++i) G[i].clear(); for (int i = 1; i <= n - 1; ++i) { int u, v; scanf( %d%d , &u, &v); G[u].push_back(v), G[v].push_back(u); } if (2 * da >= db) { puts( Alice ); continue; } dfs(1, 0, 0); int u = 0; for (int i = 1; i <= n; ++i) if (d[i] > d[u]) u = i; dfs(u, 0, 0); int mx = 0; for (int i = 1; i <= n; ++i) mx = max(mx, d[i]); if (da >= (mx + 1) / 2) { puts( Alice ); continue; } dfs(a, 0, 0); puts(da >= d[b] ? Alice : Bob ); } return 0; }
|
#include<bits/stdc++.h> #define int long long #define f first #define s second #define N 1010 #define M 1010 #define MOD 998244353 #define oo 1e18 using namespace std; typedef pair<int,int> ii; int v[N][N], estado[N]; set<int>freq[N][N]; int n; void eraseLine(int line, queue<int>&unique) { for(int c=0; c<n; c++) { int val = v[line][c]; freq[c][val].erase(line); if(freq[c][val].size() == 1) { int line = *freq[c][val].begin(); unique.push(line); freq[c][val].clear(); } } } int32_t main() { int t; cin >> t; while(t--) { cin >> n; for(int l=0; l<2*n; l++) { estado[l] = 0; for(int i=0; i<=n; i++) { freq[l][i].clear(); } } for(int l=0; l<2*n; l++) { for(int c=0; c<n; c++) { cin >> v[l][c]; freq[c][v[l][c]].insert(l); } } queue<int>unique; for(int c=0; c<n; c++) { for(int i=1; i<=n; i++) { if(freq[c][i].size() == 1) { int line = *freq[c][i].begin(); unique.push(line); freq[c][i].clear(); } } } int quantityAnswers = 1; vector<int>example; while(example.size() != n) { int choosenLine = -1; if(unique.size()) { choosenLine = unique.front(); unique.pop(); if(estado[choosenLine]) continue; } else { quantityAnswers *= 2; quantityAnswers %= MOD; choosenLine = -1; for(int l=0; l<=2*n; l++) { if(estado[l]) continue; choosenLine = l; break; } } estado[choosenLine] = 2; example.push_back(choosenLine); for(int curLine=0; curLine<2*n; curLine++) { if(estado[curLine]) continue; for(int c=0; c<n; c++) { if(v[choosenLine][c] == v[curLine][c]) { estado[curLine] = 1; break; } } if(estado[curLine]) { eraseLine(curLine, unique); } } eraseLine(choosenLine, unique); } sort(example.begin(), example.end()); cout << quantityAnswers << endl; for(int val:example) cout << val + 1 << ; cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ii = pair<ll, ll>; using vi = vector<ll>; using vb = vector<bool>; using vvi = vector<vi>; using vii = vector<ii>; using vvii = vector<vii>; constexpr int INF = 2000000000; constexpr ll LLINF = 9000000000000000000; struct abc { ll a, b, c; }; ll remove_from_front(map<ll, ll> &pareto, ll a, ll b, ll ma, ll mb) { auto ait = pareto.find(a); pareto.erase(ait); auto it = pareto.lower_bound(a); mb = max(mb, it->second); --it; ma = max(ma, it->first); return max(0LL, a - ma) * max(0LL, b - mb); } ll insert_in_front(map<ll, ll> &pareto, ll a, ll b, ll ma, ll mb) { ll ret = 0LL; while (true) { auto it = pareto.lower_bound(a); if (it->second >= b) return 0LL; while (it->first > a) --it; if (it->second > b) break; ll ra = it->first, rb = it->second; ret += remove_from_front(pareto, ra, rb, ma, mb); } auto it = pareto.lower_bound(a); mb = max(mb, it->second); --it; ma = max(ma, it->first); ret -= max(0LL, a - ma) * max(0LL, b - mb); pareto.insert({a, b}); return ret; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; ll p, q, r; cin >> n >> p >> q >> r; vector<abc> vs(n, {0, 0, 0}); for (abc &v : vs) cin >> v.a >> v.b >> v.c; sort(vs.begin(), vs.end(), [](const abc &l, const abc &r) { return l.c < r.c; }); vi amax(n, 0LL), bmax(n, 0LL); amax.back() = vs.back().a; bmax.back() = vs.back().b; for (int i = n - 2; i >= 0; --i) amax[i] = max(amax[i + 1], vs[i].a), bmax[i] = max(bmax[i + 1], vs[i].b); ll cur = (p - amax[0]) * (q - bmax[0]), ans = 0LL; map<ll, ll> pareto; pareto.insert({0LL, q + 1LL}); pareto.insert({p + 1LL, 0LL}); int i = 0; for (ll c = 1LL; c <= r; ++c) { ans += cur; for (; i < n && vs[i].c == c; ++i) { ll ai = vs[i].a, bi = vs[i].b; cur += insert_in_front(pareto, ai, bi, amax[i], bmax[i]); ll af = amax[i], bf = bmax[i]; ll at = (i + 1 < n ? amax[i + 1] : 0LL), bt = (i + 1 < n ? bmax[i + 1] : 0LL); if (af == at && bf == bt) continue; auto it = pareto.lower_bound(af); while (it->first > at) { auto it2 = it; --it2; ll h = it->second; cur += (min(af, it->first) - max(at, it2->first)) * (q - max(h, bf)); it = it2; } ll l = 0LL, r = p; while (l < r) { ll m = (l + r + 1) / 2LL; auto it = pareto.lower_bound(m); if (it->second > bf) l = m; else r = m - 1; } it = pareto.lower_bound(l); while (it->second > bt) { auto it2 = it; ++it2; ll h = it->first; cur += (min(bf, it->second) - max(bt, it2->second)) * (p - max(h, at)); it = it2; } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> int main() { int n; std::cin >> n; int a[n][n]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) std::cin >> a[i][j]; int sum = 0; int l = (n - 1) / 2, j = n - 1; for (int i = 0; i < n; i++) { sum = sum + a[i][l] + a[l][i] + a[i][i] + a[i][j--]; } sum = sum - 3 * a[l][l]; std::cout << sum; }
|
#include <bits/stdc++.h> const int mxn = 1 << 19, mod = 998244353; inline int qpow(int x, int n) { int ans = 1; for (; n; n >>= 1, x = 1LL * x * x % mod) if (n & 1) ans = 1LL * ans * x % mod; return ans; } int r[mxn], w[mxn]; void fft_init(int n) { for (int i = 1; i < n - 1; ++i) r[i] = r[i >> 1] >> 1 | (i & 1 ? n >> 1 : 0); for (int h = 1; h < n; h <<= 1) { int temp = qpow(3, (mod - 1) / (h << 1)); for (int i = 0; i < (int)(h); ++i) w[h + i] = i ? 1LL * temp * w[h + i - 1] % mod : 1; } } void fft(int a[], int n, bool flag = false) { fft_init(n); for (int i = 1; i < n - 1; ++i) if (i < r[i]) std::swap(a[i], a[r[i]]); for (int h = 1; h < n; h <<= 1) for (int i = 0; i < n; i += h << 1) for (int j = 0; j < h; ++j) { int v = 1LL * a[i + h + j] * w[h + j] % mod; a[i + h + j] = a[i + j] - v >= 0 ? a[i + j] - v : a[i + j] + mod - v; a[i + j] = a[i + j] + v < mod ? a[i + j] + v : a[i + j] + v - mod; } if (flag) { std::reverse(a + 1, a + n); int in = qpow(n, mod - 2); for (int i = 0; i < (int)(n); ++i) a[i] = 1LL * a[i] * in % mod; } } struct poly : std::vector<int> { poly(int n, int x = 0) { assign(n, x); } poly(std::initializer_list<int> l) { clear(); for (int x : l) push_back(x); } friend inline poly operator*(const poly &a, const poly &b) { int sz = 1; while (sz < (int)a.size() + (int)b.size() - 1) sz <<= 1; static int A[mxn], B[mxn]; for (int i = 0; i < (int)(sz); ++i) A[i] = i < (int)a.size() ? a[i] : 0; for (int i = 0; i < (int)(sz); ++i) B[i] = i < (int)b.size() ? b[i] : 0; fft(A, sz), fft(B, sz); for (int i = 0; i < (int)(sz); ++i) A[i] = 1LL * A[i] * B[i] % mod; fft(A, sz, true); poly c(a.size() + b.size() - 1); for (int i = 0; i < (int)(c.size()); ++i) c[i] = A[i]; return c; } }; int n; int deg[mxn]; int fac[mxn]; poly calc(int l, int r) { if (l + 1 == r) return {1, deg[l]}; int m = (l + r) >> 1; return calc(l, m) * calc(m, r); } int main() { for (int i = 0; i < (int)(mxn); ++i) fac[i] = i ? 1LL * i * fac[i - 1] % mod : 1; scanf( %d , &n); for (int i = 0; i < (int)(n - 1); ++i) { int u, v; scanf( %d %d , &u, &v); --u, --v; ++deg[u]; ++deg[v]; } for (int i = 0; i < (int)(n); ++i) if (i) --deg[i]; poly p = calc(0, n); int ans = 0; for (int i = 0; i < (int)(p.size()); ++i) { int cur = 1LL * p[i] * fac[n - i] % mod; if (i & 1) ans = (ans + mod - cur) % mod; else ans = (ans + cur) % mod; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 40; long long int dp[maxn][maxn], P[maxn], par[maxn][maxn]; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(0); P[0] = 1; for (int i = 1; i < maxn; i++) P[i] = P[i - 1] * 10; cin >> s >> s; for (int i = ((int)(s).size()) - 1; i >= 0; i--) { for (int j = 0; j <= ((int)(s).size()) - i; j++) { long long int pnt1, pnt2; if (j == 0) dp[i][j] = dp[i + 1][j] + (s[i] - 0 ) * P[((int)(s).size()) - i - 1], par[i][j] = j; else if (j == ((int)(s).size()) - i) dp[i][j] = dp[i + 1][j - 1] + (s[i] - 0 ) * P[j - 1], par[i][j] = j - 1; else if ((pnt1 = dp[i + 1][j - 1] + (s[i] - 0 ) * P[j - 1]) > (pnt2 = dp[i + 1][j] + (s[i] - 0 ) * P[((int)(s).size()) - i - j - 1])) dp[i][j] = pnt1, par[i][j] = j - 1; else dp[i][j] = pnt2, par[i][j] = j; } } int row = 0, col = ((int)(s).size()) / 2; while (row < ((int)(s).size())) { if (par[row][col] == col) cout << H ; else cout << M ; col = par[row][col]; row++; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; int b[5005], cnt, pr[800], f[800][5001], n, at[5005], sum[800][5001]; long long ans; int ss[5005], tmp[5005], sa, st; int main() { for (int i = 2; i <= 5000; i++) { if (b[i]) continue; for (int j = 2; j * i <= 5000; j++) b[i * j] = 1; } for (int i = 2; i <= 5000; i++) if (b[i] == 0) pr[++cnt] = i; for (int i = 1; i <= cnt; i++) { for (int j = 1; j <= 5000; j++) { if (j >= pr[i]) f[i][j] = j / pr[i] + f[i][j / pr[i]]; sum[i][j] = sum[i - 1][j] + f[i][j]; } } scanf( %d , &n); for (int i = 1, x; i <= n; i++) { scanf( %d , &x); if (x == 0) x = 1; ++at[x]; ans += sum[cnt][x]; } for (int i = 1; i <= 5000; i++) if (at[i]) ss[++sa] = i; for (int i = cnt; i >= 1;) { int s = 0, minn = 0x7fffffff; st = 0; for (int j = 1, a; j <= sa; j++) { a = ss[j]; if (f[i][a]) s += at[a], minn = min(minn, f[i][a]); } if (s > n - s) { ans -= 1ll * minn * (s - n + s); for (int j = 1, a; j <= sa; j++) { a = ss[j]; if (f[i][a]) f[i][a] -= minn, tmp[++st] = a; } for (int i = 1; i <= st; i++) ss[i] = tmp[i]; sa = st; } else if (n - s > s) { for (int j = 1, a; j <= sa; j++) { a = ss[j]; if (!f[i][a]) tmp[++st] = a; } for (int i = 1; i <= st; i++) ss[i] = tmp[i]; sa = st; --i; } else { break; } } printf( %lld , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long M = 200100; long long b[M]; long long fre[M]; int main() { long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; b[a[i]]++; fre[b[a[i]]]++; } long long q; cin >> q; while (q--) { char s; long long x; cin >> s >> x; if (s == + ) { b[x]++; fre[b[x]]++; } else { assert(b[x] > 0); fre[b[x]]--; b[x]--; } if ((fre[8] > 0) || (fre[4] >= 2) || (fre[2] >= 2 && fre[6] > 0) || (fre[2] >= 3 && fre[4] > 0)) cout << YES << endl; else cout << NO << endl; } }
|
#include <bits/stdc++.h> #define int long long int const int INF = 1e9 + 7; using namespace std; const int m = 1e9 + 7; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; string a[n], b[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; for (int j = 0; j < n; j++) { if (a[0][j] != b[0][j]) { for (int i = 0; i < n; i++) { a[i][j] ^= 1; } } } for (int i = 1; i < n; i++) { for (int j = 1; j < n; j++) { if (a[i][j] != b[i][j]) { for (int j = 0; j < n; j++) a[i][j] ^= 1; } } } bool ans = true; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) if (a[i][j] != b[i][j]) { ans = false; break; } if (ans == false) break; } if (ans) cout << YES n ; else cout << NO n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxlen = 81; char s[maxlen]; int base; long long int greedy(int r) { if (!r) return 0; int l = r; long long val = 0, t = 1; for (int i = r; i >= 1 && t < base; --i, t *= 10) if (val + (s[i] - 0 ) * t < base) { val += (s[i] - 0 ) * t; if (s[i] != 0 ) l = i; } else break; return greedy(l - 1) * base + val; } int main() { scanf( %d%s , &base, s + 1); cout << greedy(strlen(s + 1)) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 100000; long long l[MX], a[MX + 1], mn[MX + 1]; char s[MX + 1]; int main() { int n; ignore = scanf( %d , &n); for (int i = 0; i < n; i++) ignore = scanf( %lld , l + i); ignore = scanf( %s , s); long long e = 0, ans = 0; for (int i = 0, p = 5; i < n; i++) { a[i] = e; if (s[i] == G ) { ans += 5 * l[i]; e += l[i]; } else if (s[i] == W ) { ans += 3 * l[i]; e += l[i]; p = 3; } else { long long f = min(l[i], e); ans += l[i] + (l[i] - f) * p; e -= f; } a[i + 1] = e; } auto opt = [&](char c, int t) { mn[n] = a[n]; for (int i = n - 1; i >= 0; i--) mn[i] = min(mn[i + 1], a[i]); long long delta = 0; for (int i = 0; i < n; i++) { if (s[i] == c) { long long x = min(mn[i + 1] - delta, 2 * l[i]); ans -= x * (t - 1) / 2; delta += x; } a[i + 1] -= delta; } }; opt( G , 5); opt( W , 3); printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long ax, ay, bx, by, tx, ty; int n; long long x[110000]; long long y[110000]; long double solve(int cnt) { long double res = 0; int p = 0; long double v = sqrt((x[0] - ax) * (x[0] - ax) + (y[0] - ay) * (y[0] - ay)) - sqrt((x[0] - tx) * (x[0] - tx) + (y[0] - ty) * (y[0] - ty)); for (int i = 1; i < n; ++i) { long double cur = sqrt((x[i] - ax) * (x[i] - ax) + (y[i] - ay) * (y[i] - ay)) - sqrt((x[i] - tx) * (x[i] - tx) + (y[i] - ty) * (y[i] - ty)); if (cur < v) v = cur, p = i; } res += v; if (cnt == 1) return res; int q = 0; v = sqrt((x[0] - bx) * (x[0] - bx) + (y[0] - by) * (y[0] - by)) - sqrt((x[0] - tx) * (x[0] - tx) + (y[0] - ty) * (y[0] - ty)); for (int i = 1; i < n; ++i) { if (i == p) continue; long double cur = sqrt((x[i] - bx) * (x[i] - bx) + (y[i] - by) * (y[i] - by)) - sqrt((x[i] - tx) * (x[i] - tx) + (y[i] - ty) * (y[i] - ty)); if (cur < v || p == q) v = cur, q = i; } res += v; return res; } int main() { ios::sync_with_stdio(0); cin >> ax >> ay >> bx >> by >> tx >> ty; cin >> n; for (int i = 0; i < n; ++i) cin >> x[i] >> y[i]; if (n == 1) { long double v = sqrt((x[0] - tx) * (x[0] - tx) + (y[0] - ty) * (y[0] - ty)); cout << setprecision(10) << fixed << min(sqrt((x[0] - ax) * (x[0] - ax) + (y[0] - ay) * (y[0] - ay)), sqrt((x[0] - bx) * (x[0] - bx) + (y[0] - by) * (y[0] - by))) + v << n ; return 0; } long double ans = 0; for (int i = 0; i < n; ++i) ans += 2.0 * sqrt((x[i] - tx) * (x[i] - tx) + (y[i] - ty) * (y[i] - ty)); long double res = ans + solve(1); res = min(res, ans + solve(2)); swap(ax, bx); swap(ay, by); res = min(res, ans + solve(1)); res = min(res, ans + solve(2)); cout << setprecision(10) << fixed << res << n ; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int result = a; int temp = 0; while ((a + temp) >= b) { int t1 = temp; result += (a + temp) / b; temp = (a + temp) % b; a = (a + t1) / b; } cout << result << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 100000 + 10; struct node { int x, h; int num; int ans; }; node a[maxn]; int ans[maxn]; stack<int> s; int n; void init() { cin >> n; for (int i = 1; i <= n; i++) { a[i].num = i; cin >> a[i].x >> a[i].h; } } bool cmp1(const node &a, const node &b) { return a.x < b.x; } bool cmp2(const node &a, const node &b) { return a.num < b.num; } void solve() { s.push(n); a[n].ans = 1; for (int i = n - 1; i >= 1; i--) { int j = i; while (!s.empty() && a[i].x + a[i].h > a[s.top()].x) { j = s.top(); s.pop(); } s.push(i); if (j == i) a[i].ans = 1; else a[i].ans = j - i + a[j].ans; } sort(a + 1, a + 1 + n, cmp2); for (int i = 1; i < n; i++) cout << a[i].ans << ; cout << a[n].ans << endl; } int main() { init(); sort(a + 1, a + 1 + n, cmp1); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100000 + 50; const int X = 1024; int n, k, x; int arr[N]; int freq[X], freq2[X]; inline void brute() { int seen_till = 0; for (int i = 0; i < X; i++) { if (freq[i] != 0) { if (!seen_till) { int dec = (freq[i] + 1) / 2; freq2[i ^ x] += dec; freq2[i] += (freq[i] - dec); } else { int dec = (freq[i]) / 2; freq2[i ^ x] += dec; freq2[i] += (freq[i] - dec); } } seen_till += freq[i]; seen_till %= 2; } for (int i = 0; i < X; i++) { freq[i] = freq2[i]; } memset(freq2, 0, sizeof freq2); } int main() { ios ::sync_with_stdio(false); cin >> n >> k >> x; for (int i = 1; i <= n; i++) { cin >> arr[i]; freq[arr[i]]++; } while (k--) { brute(); } int mn = 1e9, mx = -1; for (int i = 0; i < X; i++) { if (freq[i] != 0) { if (i < mn) mn = i; if (i > mx) mx = i; } } cout << mx << << mn << endl; }
|
#include <bits/stdc++.h> using namespace std; int n, m, OO = 1e8; int dp[100001]; int solve(int x) { if (x <= 0 || x > 1e5) return OO; if (x == m) return 0; int &ret = dp[x]; if (ret != -1) return ret; ret = OO; if (x > m) ret = min(ret, 1 + solve(x - 1)); else { ret = min(ret, 1 + solve(x * 2)); ret = min(ret, 1 + solve(x - 1)); } return ret; } int main() { cin >> n >> m; memset(dp, -1, sizeof(dp)); cout << solve(n) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; vector<int> *mapo; long long Montgomery(long long a, long long b) { long long ans = 1; a = a % mod; while (b > 0) { if (b & 1) ans = ans * a % mod; b >>= 1; a = a * a % mod; } return ans; } bool inQueue[size_t(3e5 + 10)]; int status[size_t(3e5 + 10)]; long long dfs_detect_possibility(int, int); int main() { int t; scanf( %d , &t); for (int i = 0; i < t; ++i) { int n, m; scanf( %d%d , &n, &m); fill(inQueue, inQueue + n + 2, false); fill(status, status + n + 2, -1); vector<int> links[n + 1]; mapo = links; for (int j = 0; j < m; ++j) { int t1, t2; scanf( %d%d , &t1, &t2); links[t1].push_back(t2); links[t2].push_back(t1); } long long ans = 1; for (int j = 1; j <= n; j++) { if (inQueue[j]) continue; ans = ans * dfs_detect_possibility(n, j) % mod; } cout << ans << endl; } return 0; } long long dfs_detect_possibility(int n, int st) { int same = 1; status[st] = 1; queue<int> q; q.push(st); inQueue[st] = true; long long dans = 1; int cnt = 1; while (!q.empty()) { int poi = q.front(); q.pop(); for (int &i : mapo[poi]) { if (status[i] == status[poi]) { return 0; } else if (status[i] == -1) { cnt++; if (status[poi] == 1) status[i] = 0; else { status[i] = 1; same++; } q.push(i); inQueue[i] = true; } } } dans = Montgomery(2, same) + Montgomery(2, cnt - same); return dans % mod; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, y, x1, y1, a, b, c, d, e; cin >> x >> y >> x1 >> y1; a = x1 - x; b = y1 - y; { if (a < 0) { c = (-1) * a; } else c = a; } { if (b < 0) { d = (-1) * b; } else d = b; } e = max(d, c); cout << e; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int infint = 1e9; const long long inf = 1e18; const int MOD = (int)1e9 + 7; const int MAXN = (int)3e5 + 7; const int LOG = 17; int a[MAXN], n, IL[MAXN], IR[MAXN], Lp, Rp, ans, L, R; pair<int, int> G, seg[LOG][2 * MAXN]; pair<int, int> operator*(const pair<int, int> &a, pair<int, int> b) { return {min(a.first, b.first), max(a.second, b.second)}; } void update(int BASE, int idx, int x, int y) { for (seg[BASE][idx += 3 * n] = {x, y}; idx > 1; idx >>= 1) seg[BASE][idx >> 1] = seg[BASE][idx] * seg[BASE][idx ^ 1]; } pair<int, int> get(int BASE, int l, int r) { pair<int, int> res = {3 * n, 0}; for (l += 3 * n, r += 3 * n; l < r; l >>= 1, r >>= 1) { if (l & 1) res = res * seg[BASE][l++]; if (r & 1) res = res * seg[BASE][--r]; } return res; } int main() { scanf( %d , &n); for (int i = 0; i < n; i++) scanf( %d , &a[i]); for (int i = n; i < 3 * n; i++) a[i] = a[i % n]; for (int i = 0; i < LOG; i++) for (int j = 0; j < MAXN; j++) seg[i][j] = {3 * n, 0}; for (int i = 0; i < 3 * n; i++) { update(0, i, max(0, i - a[i]), min(i + a[i], 3 * n - 1)); IL[i] = max(0, i - a[i]), IR[i] = min(i + a[i], 3 * n - 1); } for (int i = 1; i < LOG; i++) { for (int j = 0; j < 3 * n; j++) { G = get(i - 1, IL[j], IR[j] + 1); Lp = G.first, Rp = G.second; IL[j] = Lp, IR[j] = Rp; update(i, j, Lp, Rp); } } if (n == 1) return cout << 0, 0; for (int j = n; j < 2 * n; j++) { ans = 0, L = j, R = j; for (int lg = 16; lg >= 0; lg--) { G = get(lg, L, R + 1); if (G.second - G.first + 1 < n) { ans += (1 << lg); Lp = G.first, Rp = G.second; L = Lp, R = Rp; } } printf( %d , ans + 1); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, n; double res, t = 1e99; cin >> a >> b >> n; int x, y, v; int i; for (i = 0; i < n; i++) { cin >> x >> y >> v; res = hypot(x - a + 0., y - b + 0.) / v; t = min(t, res); } printf( %.10f n , t); return 0; }
|
#include <bits/stdc++.h> using namespace std; /* * * * * * * * * * */ #define mp make_pair typedef long long ll; typedef long double ld; typedef pair<int, int> pii; /* * * * * * * * * * */ /* * * * Too many mind, no mind. * * */ bool can(int med, int k, vector <int> &a) { int n = a.size(); vector <int> pre(n), mn(n); for (int i = 0; i < n; ++i) pre[i] = a[i] < med ? -1 : 1; mn[0] = pre[0]; for (int i = 1; i < k; ++i) { pre[i] += pre[i - 1]; mn[i] = min(pre[i], mn[i - 1]); } if (pre[k - 1] > 0) return 1; for (int i = k; i < n; ++i) { pre[i] += pre[i - 1]; mn[i] = min(pre[i], mn[i - 1]); if (mn[i - k] <= pre[i] - 1 || pre[i] > 0) return 1; } return 0; } int main(){ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); //freopen( input.txt , r , stdin); //freopen( output.txt , w , stdout); int n, k; cin >> n >> k; vector <int> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; int lo = 1, hi = n; while (lo < hi) { int mid = lo + (hi - lo + 1) / 2; if (can(mid, k, a)) lo = mid; else hi = mid - 1; } cout << lo << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 22; int cache[1 << N]; int next_element[1 << N]; int already_done(const vector<int>& adj); int memo(int set, const vector<int>& adj); int main() { int n, m; cin >> n >> m; vector<int> adj(n); for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; v--; adj[u] |= 1 << v; adj[v] |= 1 << u; } for (int i = 0; i < n; i++) adj[i] |= 1 << i; if (already_done(adj)) { cout << 0 n ; return 0; } cout << memo(0, adj) << n ; int set = 0; while (cache[set]) { cout << next_element[set] + 1 << ; int n = next_element[set]; set = set | (1 << n) | adj[n]; } } int already_done(const vector<int>& adj) { int all = (1 << adj.size()) - 1; for (int i = 0; i < adj.size(); i++) if (adj[i] != all) { return false; } return true; } int memo(int set, const vector<int>& adj) { if (cache[set]) return cache[set]; int& ret = cache[set] = adj.size(); if (set == (1 << adj.size()) - 1) return ret = 0; for (int i = 0; i < adj.size(); i++) if ((set & (1 << i)) && (set | adj[i]) != set || set == 0) { int next_set = set | (1 << i) | adj[i]; int now = 1 + memo(next_set, adj); if (now < ret) { ret = now; next_element[set] = i; } } return ret; }
|
#include <bits/stdc++.h> const long long MOD = 1e9 + 7; const long long MAXN = 35000 + 1; using namespace std; long long readInt() { bool minus1 = false; long long result = 0; char ch; ch = getchar(); while (true) { if (ch == - ) break; if (ch >= 0 && ch <= 9 ) break; ch = getchar(); } if (ch == - ) minus1 = true; else result = ch - 0 ; while (true) { ch = getchar(); if (ch < 0 || ch > 9 ) break; result = result * 10 + (ch - 0 ); } if (minus1) return -result; else return result; } int a[MAXN]; int maps[MAXN]; int last[MAXN]; int dp[55][MAXN]; int kek[MAXN]; int n, k; vector<int> t[MAXN << 2]; void build(int v = 1, int tl = 1, int tr = n) { if (tl == tr) { t[v].push_back(last[tl]); return; } int tm = tl + tr >> 1; build(v + v, tl, tm); build(v + v + 1, tm + 1, tr); t[v].resize(tr - tl + 1); merge(t[v + v].begin(), t[v + v].end(), t[v + v + 1].begin(), t[v + v + 1].end(), t[v].begin()); } int get(int l, int r, int v = 1, int tl = 1, int tr = n) { if (l > r) return 0; if (l <= tl && tr <= r) return t[v].end() - upper_bound(t[v].begin(), t[v].end(), r); if (tl > r || tr < l) return 0; int tm = tl + tr >> 1; return get(l, r, v + v, tl, tm) + get(l, r, v + v + 1, tm + 1, tr); } map<int, int> q[MAXN]; void go(int v, int l, int r, int optl, int optr) { if (l > r) return; int mid = (l + r) >> 1; int opt = mid; dp[v][mid] = 0; int cst = get(min(mid, optr) + 1, mid); for (int i = min(mid, optr); i >= min(optl, l); i--) { if (last[i] > mid) cst++; int tmp = cst + dp[v - 1][i - 1]; if (dp[v][mid] < tmp) { dp[v][mid] = tmp; opt = i; } } go(v, l, mid - 1, optl, opt); go(v, mid + 1, r, opt, optr); } int tmp = 0; int main() { n = readInt(), k = readInt(); for (int i = 1; i <= n; i++) { a[i] = readInt(); } for (int i = n; i >= 1; i--) { if (maps[a[i]]) { last[i] = maps[a[i]]; } else { last[i] = n + 1; } maps[a[i]] = i; } build(); for (int i = 1; i <= n; i++) { dp[1][i] = get(1, i); } for (int i = 2; i <= k; i++) { go(i, 1, n, 1, n); } cout << dp[k][n]; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 0; i < n; i++) { cout << 1 ; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; char s[256]; int vis[8]; int main() { while (~scanf( %d , &n)) { scanf( %s , s); int len = strlen(s); if (n % 4) { printf( === n ); continue; } for (int i = 0; i < n; i++) { if (s[i] == A ) vis[0]++; else if (s[i] == C ) vis[1]++; else if (s[i] == G ) vis[2]++; else if (s[i] == T ) vis[3]++; } int ave = n / 4; for (int i = 0; i < 4; i++) { if (vis[i] > ave) { printf( === n ); return 0; } } for (int i = 0; i < len; i++) { if (s[i] == ? ) { if (vis[0] < ave) { printf( A ); vis[0]++; continue; } else if (vis[1] < ave) { printf( C ); vis[1]++; continue; } else if (vis[2] < ave) { printf( G ); vis[2]++; continue; } else if (vis[3] < ave) { printf( T ); vis[3]++; continue; } } else printf( %c , s[i]); } printf( n ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { double n; cin >> n; while (n--) { double ele; cin >> ele; if (ele < 4 && ele > 0) cout << N n ; else { double a = (ele + sqrt((ele * ele) - (4 * ele))) / 2; double b = (ele - sqrt((ele * ele) - (4 * ele))) / 2; double res = max(a, b); cout << setprecision(19) << Y << << ele - res << << res << endl; } } }
|
/* THINK ALOUD !! */ #include <bits/stdc++.h> using namespace std; using ll=long long int; using lld=long double; #define mp make_pair #define pb push_back #define accu accumulate #define vi vector<int> #define vb vector<bool> #define vc vector<char> #define vd vector<double> #define vlld vector<long double> #define vll vector<long long int> #define vvi vector<vector<int>> #define vvb vector<vector<bool>> #define vvc vector<vector<char>> #define vvd vector<vector<double>> #define vvlld vector<vector<long double>> #define vvll vector<vector<long long int>> #define pll pair<ll, ll> #define pii pair<int, int> #define pci pair<char, int> #define pic pair<int, char> #define pls pair<ll, string> #define psl pair<string, ll> #define pis pair<int, string> #define psi paid<string, int> #define fast std::ios_base::sync_with_stdio(0);std::cin.tie(0);std::cout.tie(0); #define INF (int)1e9 // for INT_MAX which still allows for INF + INF #define rep(i, a, n) for (ll i = a; i < n; i++) #define per(i, a, n) for (ll i = n-1; i >= a; i--) #define repp(i, a, n, p) for (ll i = a; i < n; i += p) #define all(c) (c).begin(), (c).end() #define lla(c) (c).rbegin(), (c).rend() #define print_arr(arr, n) for (int i = 0; i < n; i++) std::cout << arr[i] << ; std::cout << n ; #define mod 1000000007 #define primeSize 2000000 void solve() { int n; cin >> n; int q; cin >> q; string s; cin >> s; vvi hash(n + 1, vi(27, 0)); for (int i = 0; i < n; i++) { hash[i][s[i] - a ] ++; if (i != 0) { for (int j = 0; j < 27; j++) { hash[i][j] += hash[i - 1][j]; } } } while (q --) { int l, r; cin >> l >> r; l --, r --; ll ans = 0; for (ll i = 0; i < 27; i++) { ll one = 0; if (l > 0) one = hash[r][i] - hash[l - 1][i]; else one = hash[r][i]; ans += (one) * (i + 1); } cout << ans << n ; } } int main() { fast; int t = 1; while (t--) solve(); }
|
#include <bits/stdc++.h> using namespace std; inline long long read() { long long w = 0, x = 0; char c = getchar(); while (!isdigit(c)) w |= c == - , c = getchar(); while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); return w ? -x : x; } namespace star { const long long maxn = 1005, maxm = 2e5 + 10, delta = 3e8 + 10, INF = 0x3f3f3f3f3f3f3f3f; long long ecnt = 1, n, head[maxn], to[maxm], nxt[maxm], v[maxm], S, T, ans; inline void addedge(long long a, long long b, long long val) { to[++ecnt] = b, nxt[ecnt] = head[a], head[a] = ecnt, v[ecnt] = val; to[++ecnt] = a, nxt[ecnt] = head[b], head[b] = ecnt, v[ecnt] = 0; } long long dep[maxn]; inline bool bfs() { memset(dep, -1, sizeof dep); queue<long long> q; dep[S] = 0; q.push(S); while (!q.empty()) { long long x = q.front(); q.pop(); for (long long i = head[x]; i; i = nxt[i]) { long long u = to[i]; if (v[i] and dep[u] == -1) dep[u] = dep[x] + 1, q.push(u); } } return dep[T] != -1; } long long dfs(long long x, long long flow) { if (x == T) return flow; long long w = 0, used = 0; for (long long i = head[x]; i; i = nxt[i]) { long long u = to[i]; if (v[i] and dep[u] == dep[x] + 1) { w = dfs(u, min(v[i], flow - used)); used += w; v[i] -= w, v[i ^ 1] += w; if (used == flow) return flow; } } if (!used) dep[x] = -1; return used; } inline void work() { n = read(); S = n * 2 + 1, T = n * 2 + 2; for (long long i = 1; i <= n; i++) { long long x = read(); while (x--) { long long u = read(); addedge(i, n + u, INF); } } for (long long tmp, i = 1; i <= n; i++) addedge(S, i, tmp = delta - read()), ans += tmp; for (long long i = 1; i <= n; i++) addedge(i + n, T, delta); while (bfs()) ans -= dfs(S, INF); printf( %lld n , min(0LL, -ans)); } } // namespace star signed main() { star::work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long m = 0, cost = 0; ; int a, b; priority_queue<pair<int, int> > q; for (int i = 0; i < s.size(); i++) { m--; if (s[i] == ( ) m += 2; if (s[i] == ? ) { s[i] = ) ; cin >> a >> b; q.push(make_pair(b - a, i)); cost += b; } if (m < 0) { if (q.empty()) break; pair<int, int> x = q.top(); q.pop(); s[x.second] = ( ; cost -= x.first; m += 2; } } if (m != 0) { cout << -1; return 0; } cout << cost << endl << s; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { vector<int> a; vector<string> size = { S , M , L , XL , XXL }; int i; int n = 5; for (i = 0; i < 5; i++) { int x; cin >> x; a.push_back(x); } int q; cin >> q; while (q--) { int k = 0; string inp; cin >> inp; if (inp == S ) k = 0; if (inp == M ) k = 1; if (inp == L ) k = 2; if (inp == XL ) k = 3; if (inp == XXL ) k = 4; int shirt = 0; int p = 0; while (shirt == 0) { if (k + p < n && a[k + p] != 0) { shirt = 1; a[k + p]--; cout << size[k + p] << endl; break; } else if (k - p >= 0 && a[k - p] != 0) { shirt = 1; a[k - p]--; cout << size[k - p] << endl; break; } p++; } } }
|
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c* x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { template <class c> debug& operator<<(const c&) { return *this; } }; using ll = long long; using ld = long double; constexpr int nax = 305; constexpr int infty = 1000 * 1000 * 1000 + 5; constexpr int mod = 1000 * 1000 * 1000 + 7; int n; vector<vector<int>> wynik; int jest[nax][nax]; int main() { scanf( %d , &n); int i; for (i = n; i >= 5; i -= 2) { vector<int> cyk; for (int j = 1; j < i - 1; j++) { cyk.push_back(j); } const int s = (int)cyk.size(); for (int j = 0; j < s; j++) { const int k = (j + 1) % s; if (j == 0) { wynik.emplace_back(); wynik.back().push_back(i); wynik.back().push_back(cyk[j]); wynik.back().push_back(i - 1); wynik.emplace_back(); wynik.back().push_back(i); wynik.back().push_back(cyk[k]); wynik.back().push_back(i - 1); } else { wynik.emplace_back(); wynik.back().push_back(i); wynik.back().push_back(cyk[j]); wynik.back().push_back(i - 1); wynik.back().push_back(cyk[k]); } } } assert(i < 5); if (i == 4) { for (int i = 1; i <= 4; i++) { wynik.emplace_back(); for (int j = 1; j <= 4; j++) { if (i != j) { wynik.back().push_back(j); } } } } else if (i == 3) { wynik.emplace_back(); wynik.back().push_back(1); wynik.back().push_back(2); wynik.back().push_back(3); wynik.emplace_back(); wynik.back().push_back(1); wynik.back().push_back(2); wynik.back().push_back(3); } else { assert(false); } printf( %d n , (int)wynik.size()); for (const auto& p : wynik) { const int s = (int)p.size(); assert(s == 3 or s == 4); printf( %d , s); for (int i = 0; i < s; i++) { assert(1 <= p[i] and p[i] <= n); printf( %d , p[i]); jest[p[i]][p[(i + 1) % s]]++; } printf( n ); } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i != j) { assert(jest[i][j] + jest[j][i] == 2); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int x, sum1 = 0, Min = 0, sum = 0; cin >> x; int p; vector<int> v; for (int j = 0; j < x; j++) { cin >> p; sum += p; v.push_back(p); } sort(v.begin(), v.end()); int s = v.size(); sum1 = 0; for (int i = s - 1; i >= 0; i--) { sum = sum - v[i]; sum1 = sum1 + v[i]; ++Min; if (sum1 > sum) break; } cout << Min; return 0; }
|
#include <bits/stdc++.h> using namespace std; char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } long long read() { char ch = getchar(); long long x = 0; int op = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) op = -1; for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - 0 ; return x * op; } long long n, t, a[200005], b[200005], x[200005], tg[200005]; int main() { n = read(), t = read(); for (int i = (1); i <= (n); i++) a[i] = read(); for (int i = (1); i <= (n); i++) { x[i] = read(); if (x[i] < i) return puts( No ), 0; } for (int i = (1); i <= (n); i++) b[i] = a[i] + t; for (int i = (1); i <= (n); i++) if (x[i] > i) tg[i]++, tg[x[i]]--; for (int i = (1); i <= (n); i++) { tg[i] += tg[i - 1]; b[i] = max(b[i], b[i - 1] + 1); if (tg[i]) b[i] = max(b[i], a[i + 1] + t); } for (int i = (1); i <= (n); i++) if (x[i] + 1 <= n) if (b[x[i]] - a[x[i] + 1] >= t) return puts( No ), 0; puts( Yes ); for (int i = (1); i <= (n); i++) cout << b[i] << ; return 0; }
|
#include <bits/stdc++.h> using namespace std; map<int, int> frontc; map<int, int> backc; int main() { int n, ans, a, b, x, i, x1; cin >> n; ans = n; for (i = 0; i < n; i++) { cin >> a >> b; if (a != b) backc[b]++; frontc[a]++; } map<int, int>::iterator it; for (it = frontc.begin(); it != frontc.end(); it++) { x = it->first; a = frontc[x]; b = backc[x]; if (a >= (n + 1) / 2) { cout << 0 << endl; return 0; } if (a + b >= (n + 1) / 2) if ((n + 1) / 2 - a < ans) ans = (n + 1) / 2 - a; } if (ans != n) { cout << ans << endl; return 0; } for (it = backc.begin(); it != backc.end(); it++) { x = it->first; b = backc[x]; if (b >= (n + 1) / 2) { cout << (n + 1) / 2 << endl; return 0; } } if (ans == n) { cout << -1 << endl; return 0; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100001; void print(vector<int>& vec) { printf( ? ); for (int i : vec) printf( %d , i); printf( n ); fflush(stdout); } int main() { int n, k; scanf( %d%d , &n, &k); vector<int> tmp; for (int i = 1; i <= k + 1; i++) { vector<int> vec; for (int j = 1; j <= k + 1; j++) if (i != j) vec.push_back(j); print(vec); int a, b; scanf( %d%d , &a, &b); tmp.push_back(b); } int maxi = tmp[0], cnt = 1; for (int i = 1; i < tmp.size(); i++) if (tmp[i] > maxi) maxi = tmp[i], cnt = 1; else if (tmp[i] == maxi) cnt++; printf( ! %d , cnt); fflush(stdout); return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<string> names; char *cnames[] = { Anka , Chapay , Cleo , Troll , Dracul , Snowy , Hexadecimal }; int n = 7; int id(const string &s) { for (int i = 0; i < (int(names.size())); ++i) if (s == names[i]) return i; } vector<pair<int, int> > s; const int INF = 2000000100; int bdif = INF, bs = 0; int cp[7]; int pts[3]; void solve(int k = 0) { if (k == 7) { int ex[7]; int ngr[3] = {}; for (int i = 0; i < 7; ++i) ngr[cp[i]]++; for (int i = 0; i < 3; ++i) if (ngr[i] == 0) return; for (int i = 0; i < 7; ++i) ex[i] = pts[cp[i]] / ngr[cp[i]]; int maxex = -1, minex = INF; for (int i = 0; i < 7; ++i) { if (maxex < ex[i]) maxex = ex[i]; if (minex > ex[i]) minex = ex[i]; } double cdif = maxex - minex; int cs = 0; for (int i = 0; i < (int(s.size())); ++i) if (cp[s[i].first] == cp[s[i].second]) ++cs; if (cdif < bdif || (cdif == bdif && cs > bs)) bdif = cdif, bs = cs; } else { for (int i = 0; i < 3; ++i) { cp[k] = i; solve(k + 1); } } } int main() { for (int i = 0; i < n; ++i) names.push_back(string(cnames[i])); int k; cin >> k; while (k--) { string n1, n2; cin >> n1 >> n2 >> n2; s.push_back(make_pair(id(n1), id(n2))); } cin >> pts[0] >> pts[1] >> pts[2]; solve(); cout << bdif << << bs << endl; return 0; }
|
#include <bits/stdc++.h> int main() { int a, b, c, x = 0; scanf( %d%d%d , &a, &b, &c); if ((a + b) <= c) { x = x + (c - (a + b)) + 1; } if ((b + c) <= a) { x = x + (a - (b + c)) + 1; } if ((a + c) <= b) { x = x + (b - (a + c)) + 1; } printf( %d , x); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (a % b == 0) return b; else return gcd(b, a % b); } long long lcm(long long a, long long b) { double d = (double)(a * b); return (long long)d / gcd(a, b); } int main() { long long i, j, k, t, w, b, s, ans = 0; double prdt = 1; cin >> t >> w >> b; long long g = gcd(w, b); prdt = (double)w * b; long long l = (long long)(prdt / g); s = w; if (s > b) s = b; ans = s * (t / l) - 1 + min(t % l + 1, s); long long num = ans; long long den = t; g = gcd(num, den); cout << num / g << / << den / g << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1 << 30; const int mod = 998244353; const int maxn = 2005; string s; long long ans = 0; int n; vector<pair<int, int> > edges[maxn]; int col[maxn], vis[maxn]; int isbi = 1; void flood(int x, int curcol) { if (vis[x]) { if (col[x] != curcol) { isbi = 0; } return; } vis[x] = 1; col[x] = curcol; for (int i = 0; i < edges[x].size(); i++) { int u = edges[x][i].first, v = edges[x][i].second; flood(u, curcol ^ v); } } int pw(int x, int y) { if (!y) return 1; if (y == 1) return x; int mid = pw(x, y >> 1); if (y & 1) return 1ll * mid * mid % mod * x % mod; return 1ll * mid * mid % mod; } int sear() { isbi = 1; int con = 0; for (int i = 0; i <= 2 * n + 1; i++) { if (!vis[i]) { flood(i, 0); ++con; } } if (!isbi) return 0; return pw(2, con - 1); } int solve(int m) { memset(vis, 0, sizeof vis); memset(col, -1, sizeof col); for (int i = 0; i <= maxn - 1; i++) edges[i].clear(); for (int i = 0; i < n; i++) { edges[i].push_back(make_pair(n - 1 - i, 0)); } for (int i = 0; i < m; i++) { edges[i + n].push_back(make_pair(n + (m - 1 - i), 0)); } for (int i = m; i < n; i++) { edges[i + n].push_back(make_pair(2 * n, 0)); edges[2 * n].push_back(make_pair(i + n, 0)); } for (int i = 0; i < n; i++) { if (s[n - 1 - i] == 0 ) { edges[i].push_back(make_pair(i + n, 0)); edges[i + n].push_back(make_pair(i, 0)); } else if (s[n - 1 - i] == 1 ) { edges[i].push_back(make_pair(i + n, 1)); edges[i + n].push_back(make_pair(i, 1)); } } edges[2 * n].push_back(make_pair(2 * n + 1, 1)); edges[2 * n + 1].push_back(make_pair(2 * n, 1)); edges[n].push_back(make_pair(2 * n + 1, 0)); edges[2 * n + 1].push_back(make_pair(n, 0)); edges[0].push_back(make_pair(2 * n + 1, 0)); edges[2 * n + 1].push_back(make_pair(0, 0)); return sear(); } int main() { ios::sync_with_stdio(false); cin >> s; n = s.size(); for (int i = 1; i < n; i++) { ans = (ans + solve(i)) % mod; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; char mp[510][510]; int minln, maxln, minrw, maxrw, cnt; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , mp[i] + 1); minln = n + 1; maxln = 0; minrw = m + 1; maxrw = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (mp[i][j] == X ) { minln = min(i, minln); minrw = min(j, minrw); maxln = max(i, maxln); maxrw = max(j, maxrw); cnt++; } if (minln > maxln || minrw > maxrw || (maxln - minln + 1) * (maxrw - minrw + 1) != cnt) printf( NO n ); else printf( YES n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> p(n); for (int i = 0; i < n; ++i) cin >> p[i]; double ans = 0; int cnt[102] = {0}; double loser[102] = {0}; for (int i = 0; i < n; ++i) loser[i] = 1.0; for (int i = 1; i < n; ++i) { ++cnt[i]; loser[i] *= 1.0 - p[i] / 100.0; } for (int st = n; st <= 300004; ++st) { int bi = -1; double pw = 0; double win[102] = {0}, pref[102] = {0}, suf[102] = {0}; for (int i = 0; i < n; ++i) { win[i] = 1.0 - loser[i]; } pref[0] = win[0]; for (int i = 1; i < n; ++i) pref[i] = pref[i - 1] * win[i]; suf[n - 1] = win[n - 1]; for (int i = n - 2; i >= 0; --i) suf[i] = suf[i + 1] * win[i]; for (int i = 0; i < n; ++i) { double curP = 1.0 * p[i] / 100 * loser[i]; if (i) curP *= pref[i - 1]; if (i + 1 < n) curP *= suf[i + 1]; if (curP > pw) { pw = curP; bi = i; } } ans += st * pw; cnt[bi]++; loser[bi] *= 1.0 - p[bi] / 100.0; } printf( %.10lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k; vector<int> adj[100005]; int col[100005], att[100005], dep[100005]; void dfs(int u, int d = 1, int p = -1) { att[d] = u, dep[u] = d, col[u] = (d & 1) + 1; for (int& v : adj[u]) if (v != p) { if (dep[v] && d - dep[v] + 1 >= k) { printf( 2 n ); printf( %d n , d - dep[v] + 1); for (int i = dep[v]; i <= d; i++) printf( %d , att[i]); printf( n ); exit(0); } else if (!dep[v]) dfs(v, d + 1, u); else col[v] = (col[u] == col[v] ? 3 : col[v]); } } int main() { scanf( %d%d , &n, &m); while (k * k < n) k++; for (int a, b, i = 0; i < m; i++) { scanf( %d%d , &a, &b); adj[a].push_back(b); adj[b].push_back(a); } srand(time(0)); for (int i = 1; i <= n; i++) random_shuffle(adj[i].begin(), adj[i].end()); dfs(1); for (int c : {1, 2}) { int cnt = count(col, col + n + 1, c); if (cnt >= k) { printf( 1 n ); for (int i = 1; i <= n && k; i++) if (col[i] == c) printf( %d , i), k--; printf( n ); return 0; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<vector<int> > a(n, vector<int>(n)); vector<int> b(n * n), q(n * n); for (int i = 0; i < n * n; ++i) { cin >> b[i]; q[i] = i; } do { for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) a[i][j] = b[q[n * i + j]]; int s = a[0][0]; if (n == 3) { s = a[0][0] + a[0][1] + a[0][2]; if (s != a[1][0] + a[1][1] + a[1][2]) continue; if (s != a[2][0] + a[2][1] + a[2][2]) continue; if (s != a[0][0] + a[1][0] + a[2][0]) continue; if (s != a[0][1] + a[1][1] + a[2][1]) continue; if (s != a[0][2] + a[1][2] + a[2][2]) continue; if (s != a[0][0] + a[1][1] + a[2][2]) continue; if (s != a[0][2] + a[1][1] + a[2][0]) continue; } if (n == 2) { s = a[0][0] + a[0][1]; if (s != a[1][0] + a[1][1]) continue; if (s != a[0][0] + a[1][0]) continue; if (s != a[0][1] + a[1][1]) continue; if (s != a[0][0] + a[1][1]) continue; if (s != a[0][1] + a[1][0]) continue; } cout << s << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) cout << a[i][j] << ; cout << endl; } break; } while (next_permutation(q.begin(), q.end())); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, p1[2010][2010], p2[2010][2010], p3[2010][2010], p4[2010][2010]; int sun[2010][2010]; int dir[8][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}}; int vis[2010][2010]; int nw, nwr, bel[4000010], cnt[4000010]; int tr[2010][2010]; void col(int x, int y, int c) { sun[x][y] = c; for (int k = 0; k <= 7; ++k) { int tx = x + dir[k][0], ty = y + dir[k][1]; if (tx > 0 && tx <= n && ty > 0 && ty <= m && p1[tx][ty] && p2[tx][ty] && !sun[tx][ty]) { col(tx, ty, c); } } } void hehe(int x, int y, int c) { tr[x][y] = c; for (int k = 0; k <= 7; ++k) { int tx = x + dir[k][0], ty = y + dir[k][1]; if (tx > 0 && tx <= n && ty > 0 && ty <= m) { if (sun[tx][ty]) bel[c] = sun[tx][ty]; else if (p1[tx][ty] && !tr[tx][ty]) hehe(tx, ty, c); } } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) scanf( %d , &p1[i][j]), p2[i][j] = p1[i][j]; for (int k = 1; k <= 3; ++k) { for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) p3[i][j] = 0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { int tmp = 1; for (int l = 0; l <= 7; ++l) { int ti = i + dir[l][0], tj = j + dir[l][1]; if (ti > 0 && ti <= n && tj > 0 && tj <= m) { if (p2[ti][tj] == 0) tmp = 0; } } p3[i][j] = tmp; } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) swap(p2[i][j], p3[i][j]); } for (int k = 1; k <= 6; ++k) { for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) p3[i][j] = 0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { int tmp = 0; for (int l = 0; l <= 7; ++l) { int ti = i + dir[l][0], tj = j + dir[l][1]; if (ti > 0 && ti <= n && tj > 0 && tj <= m) { if (p2[ti][tj] == 1) tmp = 1; } } p3[i][j] = tmp; } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) swap(p2[i][j], p3[i][j]); } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (p1[i][j] && p2[i][j] && !sun[i][j]) col(i, j, ++nw); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (p1[i][j] && !sun[i][j] && !tr[i][j]) hehe(i, j, ++nwr); for (int i = 1; i <= nwr; ++i) ++cnt[bel[i]]; vector<int> huhu; for (int i = 1; i <= nw; ++i) huhu.push_back(cnt[i]); sort(huhu.begin(), huhu.end()); printf( %d n , nw); for (int i = 0; i < huhu.size(); ++i) printf( %d%c , huhu[i], i + 1 == huhu.size() ? n : ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1000000007 + 1; const int N = 200000; long long a[200006], b[200006]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; long long mx = 0; int cnt2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; mx = max(mx, a[i]); if (a[i] == 0) cnt2++; } int cnt = 0; for (int i = 0; i < n; i++) if (mx == a[i]) cnt++; if (cnt == n) { if (cnt2 == n) { cout << YES << n ; for (int i = 1; i <= n; i++) cout << 1 << ; cout << n ; return 0; } cout << NO << n ; return 0; } int j = -1; for (int i = 1; i < n; i++) if (a[i - 1] < a[i] && a[i] == mx) { j = i; break; } if (j == -1) j = 0; cout << YES << n ; b[j] = a[j]; int f = (j - 1 + n) % n; b[f] = 2LL * b[j] + a[f]; int u = j; j = (j - 2 + n) % n; while (j != u) { b[j] = a[j] + b[(j + 1) % n]; j = (j - 1 + n) % n; } for (int i = 0; i < n; i++) cout << b[i] << ; cout << n ; return 0; }
|
#include <bits/stdc++.h> const int MAXN = 100100; int st[20][MAXN]; char str[MAXN]; int n; void SparseTable() { for (int i = 0; i < n; i++) st[0][i] = i; for (int j = 1; (1 << j) < n; j++) for (int i = 0; i + (1 << (j - 1)) < n; i++) st[j][i] = (str[st[j - 1][i]] >= str[st[j - 1][i + (1 << (j - 1))]] ? st[j - 1][i] : st[j - 1][i + (1 << (j - 1))]); } int get(int x, int y) { int k = int(log(double(y - x + 1)) / log(2.0)); return (str[st[k][x]] >= str[st[k][y - (1 << k) + 1]] ? st[k][x] : st[k][y - (1 << k) + 1]); } int main() { scanf( %s , str); n = strlen(str); SparseTable(); int p = 0; while (p != n) { p = get(p, n - 1); printf( %c , str[p]); p++; } printf( n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d %d , &n, &m); vector<pair<int, int> > f(n); vector<int> b(m); vector<int> array(1000005, 0); for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); array[temp]++; f.push_back(make_pair(temp, i)); } int ambuiguity = 0; int impossible = 0; sort(f.begin(), f.end()); vector<int> ans; for (int i = 0; i < m; i++) { int temp; scanf( %d , &temp); vector<pair<int, int> >::iterator it = upper_bound(f.begin(), f.end(), make_pair(temp, -1)); if (it == f.end()) { impossible = 1; break; } if (it->first == temp) { if (array[temp] > 1) { ambuiguity = 1; } else { ans.push_back(it->second + 1); } } else { impossible = 1; break; } } if (impossible == 1) { cout << Impossible << endl; } else if (ambuiguity == 1) { cout << Ambiguity << endl; } else { cout << Possible << endl; for (int i = 0; i < ans.size() - 1; i++) { printf( %d , ans[i]); } cout << ans[ans.size() - 1] << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; int cnt = 0, val; for (int k = 0; k < n; k++) { cin >> val; cnt += val; } if (n == 1 && val == 1) cout << YES ; else if (cnt == n - 1 && n != 1) cout << YES ; else cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int INF = 1000000005; long long INFF = 1000000000000000005LL; int main() { long long s, n; cin >> s >> n; long long x, y; vector<pair<long long, long long>> strengths; for (long long i = 0; i < n; i++) { cin >> x >> y; strengths.push_back(make_pair(x, y)); } sort(strengths.begin(), strengths.end()); bool win = true; for (long long i = 0; i < n; i++) { if (s <= strengths[i].first) { win = false; break; } s += strengths[i].second; } if (win) { cout << YES << n ; ; } else { cout << NO << n ; ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, s, q; cin >> t >> s >> q; int cnt = 0; while (s < t) { s = s * q; cnt++; } cout << cnt << endl; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100100, M = 200200; int i, j, k, n, q, m, nm, ch, ii; int l[N], r[N], fg[N]; struct cc { int x, y; } t, A[M], P[M]; void R(int &x) { x = 0; ch = getchar(); while (ch < 0 || 9 < ch) ch = getchar(); while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); } void W(int x) { if (x >= 10) W(x / 10); putchar(x % 10 + 0 ); } long long dis(const cc &a, const cc &b) { return (long long)(a.x - b.x) * (a.x - b.x) + (long long)(a.y - b.y) * (a.y - b.y); } bool cmp1(const cc &a, const cc &b) { if (a.x == b.x) return a.y < b.y; return a.x < b.x; } bool cmp2(const cc &a, const cc &b) { int x1, y1, x2, y2; x1 = a.x - A[1].x; y1 = a.y - A[1].y; x2 = b.x - a.x; y2 = b.y - a.y; if ((long long)x1 * y2 == (long long)x2 * y1) return dis(A[1], a) < dis(A[1], b); return (long long)x1 * y2 < (long long)x2 * y1; } bool check(const cc &a, const cc &b, const cc &c) { int x1, y1, x2, y2; x1 = b.x - a.x; y1 = b.y - a.y; x2 = c.x - b.x; y2 = c.y - b.y; if ((long long)x1 * y2 == (long long)x2 * y1) return dis(a, b) < dis(a, c); return (long long)x1 * y2 > (long long)x2 * y1; } bool check2(const cc &a, const cc &b, const cc &c) { int x1, y1, x2, y2; x1 = b.x - a.x; y1 = b.y - a.y; x2 = c.x - b.x; y2 = c.y - b.y; return (long long)x1 * y2 < (long long)x2 * y1; } bool find(int x, int y) { if (fg[x] != ii) return 0; if (y < l[x] || r[x] < y) return 0; return 1; } int main() { R(n); R(q); while (n && q) { ii++; m = 0; for (i = 1; i <= q; i++) { R(P[i].x); R(P[i].y); if (fg[P[i].x] != ii) { fg[P[i].x] = ii; l[P[i].x] = r[P[i].x] = P[i].y; } else { l[P[i].x] = ((l[P[i].x]) < (P[i].y) ? (l[P[i].x]) : (P[i].y)); r[P[i].x] = ((r[P[i].x]) < (P[i].y) ? (P[i].y) : (r[P[i].x])); } } for (k = 1; k <= q; k++) { i = P[k].x; j = P[k].y; if (!find(i + 1, j - 1) && !find(i + 1, j) && !find(i, j - 1)) A[++m].x = i - 1, A[m].y = j; if (!find(i + 1, j + 1) && !find(i + 1, j) && !find(i, j + 1)) A[++m].x = i - 1, A[m].y = j - 1; if (!find(i - 1, j + 1) && !find(i - 1, j) && !find(i, j + 1)) A[++m].x = i, A[m].y = j - 1; if (!find(i - 1, j - 1) && !find(i - 1, j) && !find(i, j - 1)) A[++m].x = i, A[m].y = j; } sort(A + 1, A + m + 1, cmp1); A[m + 1].x = -1; nm = 0; for (i = 1; i <= m; i++) if (A[i].x != A[i + 1].x || A[i].y != A[i + 1].y) A[++nm] = A[i]; sort(A + 2, A + nm + 1, cmp2); m = 2; for (i = 3; i <= nm; i++) { while (m >= 2 && check(A[m - 1], A[m], A[i])) m--; if (m < 2) A[++m] = A[i]; else if (check2(A[m - 1], A[m], A[i])) A[++m] = A[i]; } while (m >= 2 && check(A[m - 1], A[m], A[1])) m--; W(m); puts( ); for (i = 1; i <= m; i++) W(A[i].x), putchar( ), W(A[i].y), puts( ); R(n); R(q); } }
|
#include <bits/stdc++.h> using namespace std; int main() { int length; bool true_false; char S[100], aux, digits[4] = 123 ; cin >> S; length = strlen(S); for (int i = 0, x = 0, j; i < length; i += 2) { true_false = false; if (S[i] != digits[x]) { for (j = i + 2; j < length; j += 2) { if (S[i] != digits[x]) { if (S[j] == digits[x]) { aux = S[i]; S[i] = S[j]; S[j] = aux; i += 2; } else { if (j == length - 1) { true_false = true; } } } else { i += 2; } } } if (true_false) { x++; i -= 2; } } for (int i = 0, x = 0, j; i < length; i += 2) { if (S[i] != digits[x]) { x++; if (S[i] != digits[x]) { for (j = i + 2; j < length; j++) { if (S[j] == S[i]) { aux = S[j - 2]; S[j - 2] = S[i]; S[i] = aux; break; } } } } } cout << S << endl; }
|
#include <bits/stdc++.h> using namespace std; long long k, n, a, b, val; void solve() { cin >> k >> n >> a >> b; k -= a * n; if (k <= 0) { k *= -1, k++; val = (k + a - b - 1) / (a - b); if (val > n) { cout << -1 << endl; return; } n -= val; } cout << n << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; char arr[108]; int main() { int i, j, k, t, n, m, a, b, c, x, y, z; cin >> n; int flag = 0; for (i = 1; i <= n; i++) { cin >> arr[i]; } int gap, cnt = 0; for (i = 1; i <= n; i++) { if (arr[i] == * ) { for (j = i + 1; j <= i + n / 4; j++) { if (arr[j] == * ) { cnt = 0; gap = j - i; for (k = j; k <= n; k += gap) { if (arr[k] == * ) { cnt++; if (cnt >= 4) { flag = 1; break; } } else break; } } if (flag == 1) break; } if (flag == 1) break; } } if (flag == 1) cout << yes ; else cout << no ; return 0; }
|
#include <stdio.h> #include <math.h> #include<bits/stdc++.h> using namespace std; // C = a^2 - b and C^2 = a^2 + b^2 hence (a^2 - b)^2 = a^2 + b^2 , evaluate and subtract then, a^2 = 2*b+1 // Since a^2 - b = C , then 2*b+1 - b = C , then C = b+1 !!!!! , We can observe that the difference between b and c are just 1 // b and c are nearly equal , so we must find integer a so that its square is odd number since odd / 2 gives you two numbers // the floor and the ceil , which are basically b and b+1 -> b and c ^^ int main() { int t; scanf( %d ,&t); while(t--) { int n; scanf( %d ,&n); int odd_Square = sqrt(n << 1); // --> sqrt ( n / 2 ); printf( %d n ,(odd_Square-1) >> 1); // --> (odd_Square - 1) / 2 ; } return 0; }
|
#include <bits/stdc++.h> const int mod = 1000000007; int k, w; int fac[1000010]; int invfac[1000010]; inline int gcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1; y = 0; return a; } int d = gcd(b, a % b, x, y); int t = x; x = y; y = t - a / b * y; return d; } inline int inv(int a) { int x, y, d = gcd(a, -mod, x, y); return ((long long)x * d % mod + mod) % mod; } inline int perm(int a, int b) { if (b > a || b < 0) return 0; return (long long)fac[a] * invfac[a - b] % mod; } inline int pow(int a, int b) { int g = 1; for (; b; b >>= 1) { if (b & 1) g = (long long)g * a % mod; a = (long long)a * a % mod; } return g; } void predo() { fac[0] = 1; for (int i = 1; i <= k; i++) fac[i] = (long long)fac[i - 1] * i % mod; invfac[k] = inv(fac[k]); for (int i = k - 1; i >= 0; i--) invfac[i] = (long long)invfac[i + 1] * (i + 1) % mod; } int solve() { int maxl = k + w, minl = w + 1; int ans = 0; predo(); for (int l = minl; l <= maxl; l++) { int tmp; if (w * 2 > l + 1) { int sl = l - w; int midl = 2 * w - l; tmp = (long long)perm(k, sl) * perm(k, sl) % mod * pow(k, midl - 2) % mod * ((long long)k * k % mod - (long long)(k - sl) * (k - sl) % mod + mod) % mod; } else if (w * 2 == l + 1) { int sl = w - 1; int midl = 1; tmp = (long long)k * ((long long)perm(k, sl) * perm(k, sl) % mod - (long long)perm(k - 1, sl) * perm(k - 1, sl) % mod + mod) % mod; } else { int sl = w; int midl = l - 2 * w; int k2 = k - midl; tmp = ((long long)perm(k, midl) * perm(k2, sl) % mod * perm(k2, sl) % mod - (long long)perm(k, midl + 2) * perm(k2 - 2, sl - 1) % mod * perm(k2 - 2, sl - 1) % mod + mod) % mod; } ans = (ans + tmp) % mod; } return ans; } int main() { scanf( %d %d n , &k, &w); printf( %d n , solve()); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1 << 18; int n, r; double sum = 0; long long c[MAXN + 10]; int main() { scanf( %d%d , &n, &r); for (int i = 0; i < (1 << n); i++) { scanf( %lld , &c[i]); sum += c[i]; } double dv = 1 << n; printf( %.9lf n , sum / dv); for (int i = 0; i < r; i++) { int z; long long x; scanf( %d%lld , &z, &x); sum += x - c[z]; c[z] = x; printf( %.9lf n , sum / dv); } }
|
#include <bits/stdc++.h> using namespace std; bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; } long long n, k; long long a[105]; vector<long long> vec; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (long long(i) = (1); (i) <= (k); (i)++) cin >> a[i]; for (long long(i) = (1); (i) <= (n); (i)++) vec.push_back(i); long long p = 0; for (long long(i) = (1); (i) <= (k); (i)++) { long long np = (p + a[i]) % (long long)vec.size(); cout << vec[np] << ; vec.erase(vec.begin() + np); p = np % (long long)vec.size(); } cout << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int M = 1e2 + 10; long long int n, m, x, y, cnt[M][M], ask, mx, mn = 1e18; void go(long long int k, long long int i, long long int j, long long int dir) { if (k == 0) return; cnt[i][j]++; if (j < m) go(k - 1, i, j + 1, dir); else if (dir == 1 && i < n) go(k - 1, i + 1, 1, dir); else if (dir == -1) go(k - 1, i - 1, 1, dir); else if (i == n) go(k - 1, i - 1, 1, -1); } int main() { long long int k, K; cin >> n >> m >> K >> x >> y; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (n == 1) cnt[i][j] = K / m; else if (i == 1) cnt[i][j] = K / ((2 * n - 2) * m); else if (i == n) cnt[i][j] = K / ((2 * n - 2) * m); else cnt[i][j] = (K / ((2 * n - 2) * m)) * 2; ask += cnt[i][j]; } K -= ask; go(K, 1, 1, 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) mx = max(mx, cnt[i][j]), mn = min(mn, cnt[i][j]); cout << mx << << mn << << cnt[x][y]; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18 + 239; vector<long long> used; vector<vector<pair<long long, long long> > > gr; long long ans = -inf; vector<long long> dp; long long n; void dfs(long long p1) { used[p1] = 1; if (gr[p1].size() == 1 && p1 != 0) { ans = max(ans, dp[p1]); return; } vector<long long> neib; for (long long i = 0; i < gr[p1].size(); i++) { long long p2 = gr[p1][i].first; if (used[p2] == 1) continue; dfs(p2); neib.push_back(dp[p2] - gr[p1][i].second); } sort(neib.rbegin(), neib.rend()); if (neib.size() > 1) { ans = max(ans, dp[p1] + neib[0] + neib[1]); } dp[p1] = max(dp[p1], dp[p1] + neib[0]); ans = max(ans, dp[p1]); } signed main() { cin >> n; vector<long long> val(n, 0); for (long long i = 0; i < n; i++) cin >> val[i]; long long mx = -1; for (long long i = 0; i < n; i++) mx = max(mx, val[i]); long long cnt = 0, ana = 1; for (long long i = 0; i < n; i++) { if (val[i] == mx) ++cnt; else cnt = 0; ana = max(ana, cnt); } cout << ana << endl; }
|
#include <bits/stdc++.h> using namespace std; int M, R, C, S, T, a[8], b[8], id[8]; vector<vector<vector<int> > > ver; void createVer(int prod, int cur) { if (cur == M) return; for (int i = 1; i <= (int)(a[0]); ++i) for (int j = 1; j <= (int)(prod); ++j) { ver[i][j][cur] = 1; } for (int k = 2; k <= a[cur]; ++k) { for (int i = 1; i <= (int)(a[0]); ++i) { int tmp = ver[i].size(); for (int j = tmp - 1; j >= tmp - prod; --j) ver[i].push_back(ver[i][j]); } for (int i = 1; i <= (int)(a[0]); ++i) for (int j = ver[1].size() - prod; j < ver[1].size(); ++j) { ver[i][j][cur] = k; } } createVer(prod * a[cur], cur + 1); } void print(int r1, int c1, int r2, int c2) { for (int k = 0; k < (int)(M); ++k) if (ver[r1][c1][k] != ver[r2][c2][k]) { if (ver[r1][c1][k] < ver[r2][c2][k]) printf( inc %d n , id[k] + 1); else printf( dec %d n , id[k] + 1); } } void rightRotate(int& s, int& t) { vector<vector<vector<int> > > new_ver( C + 1, vector<vector<int> >(R + 1, vector<int>(M))); for (int i = 1; i <= (int)(R); ++i) for (int j = 1; j <= (int)(C); ++j) { new_ver[j][R - i + 1] = ver[i][j]; } swap(s, t); t = R - t + 1; swap(R, C); ver = new_ver; } void solve_corner(int s, int t) { int dx, dy; dx = s == 1 ? 1 : -1; for (;; s += dx) { dy = t == 1 ? 1 : -1; for (;; t += dy) { if (t + dy > C || t + dy < 1) break; print(s, t, s, t + dy); } if (s + dx > R || s + dx < 1) break; print(s, t, s + dx, t); } } void solve_border(int s, int t) { while (t != 1) rightRotate(s, t); S = s, T = t; int dx, dy; dx = -1; for (;; s += dx) { dy = t == 1 ? 1 : -1; for (;; t += dy) { if (t + dy >= C || t + dy < 1) break; print(s, t, s, t + dy); } if (s + dx < 1) break; print(s, t, s + dx, t); } print(s, t, s, t + 1); t++; while (s <= S) print(s, t, s + 1, t), s++; dx = 1; for (;; s += dx) { dy = t == 1 ? 1 : -1; for (;; t += dy) { if (t + dy > C || t + dy < 1) break; print(s, t, s, t + dy); } if (s + dx > R) break; print(s, t, s + dx, t); } } void solve_odd(int s, int t) { S = s, T = t; int dx, dy; while (s < R) print(s, t, s + 1, t), s++; print(s, t, s, t - 1); t--; dx = -1; for (;; s += dx) { dy = t == 1 ? 1 : -1; for (;; t += dy) { if (t + dy >= T || t + dy < 1) break; print(s, t, s, t + dy); } if (s + dx < S) break; print(s, t, s + dx, t); } print(s, t, s - 1, t); s--; dy = 1; for (;; t += dy) { dx = s == 1 ? 1 : -1; for (;; s += dx) { if (s + dx >= S || s + dx < 1) break; print(s, t, s + dx, t); } if (t + dy > T) break; print(s, t, s, t + dy); } print(s, t, s, t + 1); t++; for (;; t += dy) { dx = s == 1 ? 1 : -1; for (;; s += dx) { if (s + dx > R || s + dx < 1) break; print(s, t, s + dx, t); } if (t + dy > C) break; print(s, t, s, t + dy); } } void solve_even(int s, int t) { S = s, T = t; int dx, dy; dy = -1; for (;; t += dy) { dx = s == R ? -1 : 1; for (;; s += dx) { if (s + dx < S || s + dx > R) break; print(s, t, s + dx, t); } if (t + dy < 1) break; print(s, t, s, t + dy); } while (s > 1) print(s, t, s - 1, t), s--; print(s, t, s, t + 1), t++; dx = 1; for (;; s += dx) { dy = t == 2 ? 1 : -1; for (;; t += dy) { if (t + dy > T + 1 || t + dy < 2) break; print(s, t, s, t + dy); } if (s + dx == S) break; print(s, t, s + dx, t); } while (s < R) print(s, t, s + 1, t), s++; if (t == C) return; print(s, t, s, t + 1), t++; dy = 1; for (;; t += dy) { dx = s == 1 ? 1 : -1; for (;; s += dx) { if (s + dx < 1 || s + dx > R) break; print(s, t, s + dx, t); } if (t + dy > C) break; print(s, t, s, t + dy); } } void solve_path(int s, int t) { printf( Path n ); if ((s == 1 || s == R) && (t == 1) || (t == C)) solve_corner(s, t); else if (s == 1 || s == R || t == 1 || t == C) solve_border(s, t); else if (s & 1) solve_odd(s, t); else solve_even(s, t); } void solve_cycle(int s, int t) { printf( Cycle n ); while (C & 1 || s == 1) rightRotate(s, t); S = s, T = t; int dx, dy; if (T == 1) goto NEXT; if (T & 1) print(s, t, s, t - 1), t--; dy = -1; for (;; t += dy) { dx = s == R ? -1 : 1; for (;; s += dx) { if (s + dx > R || s + dx < S) break; print(s, t, s + dx, t); } if (t + dy < 1) break; print(s, t, s, t + dy); } NEXT: print(s, t, s - 1, t); s--; dy = 1; for (;; t += dy) { dx = s == 1 ? 1 : -1; for (;; s += dx) { if (s + dx >= S || s + dx < 1) break; print(s, t, s + dx, t); } if (t + dy > C) break; print(s, t, s, t + dy); } print(s, t, s + 1, t), s++; dy = -1; for (;; t += dy) { if (t == T && (T & 1) == 0) break; dx = s == R ? -1 : 1; for (;; s += dx) { if (s + dx > R || s + dx < S) break; print(s, t, s + dx, t); } if (t + dy < T) break; print(s, t, s, t + dy); } } int main() { scanf( %d , &M); for (int i = 0; i < (int)(M); ++i) scanf( %d , &a[i]); for (int i = 0; i < (int)(M); ++i) scanf( %d , &b[i]); if (M == 1) { if (a[0] == 2) { printf( Cycle n ); printf( %s , b[0] == 1 ? inc 1 ndec 1 n : dec 1 ninc 1 n ); } else if (b[0] == 1 || b[0] == a[0]) { printf( Path n ); for (int i = 0; i < (int)(a[0] - 1); ++i) printf( %s , b[0] == 1 ? inc 1 n : dec 1 n ); } else { printf( No n ); } return 0; } for (int i = 0; i < (int)(M); ++i) id[i] = i; for (int i = 0; i < (int)(M); ++i) if ((a[i] & 1) == 0) { swap(a[i], a[0]), swap(b[i], b[0]); swap(id[i], id[0]); break; } ver.resize(a[0] + 1, vector<vector<int> >(a[1] + 1, vector<int>(M, 0))); for (int i = 1; i <= (int)(a[0]); ++i) for (int j = 1; j <= (int)(a[1]); ++j) { ver[i][j][0] = i, ver[i][j][1] = j; } createVer(a[1], 2); R = a[0], C = ver[1].size() - 1; int s, t; for (int i = 1; i <= (int)(R); ++i) for (int j = 1; j <= (int)(C); ++j) { bool ok = true; for (int k = 0; k < (int)(M); ++k) if (ver[i][j][k] != b[k]) { ok = false; break; } if (ok) { s = i, t = j; break; } } if (R & 1 && C & 1 && (s + t) & 1) { printf( No n ); return 0; } if (R & 1 && C & 1) solve_path(s, t); else solve_cycle(s, t); return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 1e9; const int SIZE = 2e5 + 5; const int MOD = 1e9 + 7; void solve(int CASE) { long long x; cin >> x; vector<long long> res; for (long long i = 1; i <= x; i *= 2LL) { res.push_back(i); x -= i; } if (x) res.push_back(x); sort(res.begin(), res.end()); cout << res.size() - 1 << endl; for (int i = 1; i < res.size(); i++) cout << res[i] - res[i - 1] << ; cout << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int IT; cin >> IT; for (int i = 1; i <= IT; i++) { solve(i); }; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int x, y; double f, s; cin >> x >> y; f = y * (log10(x)); s = x * (log10(y)); if (abs(f - s) < pow(10, -8)) cout << = ; else if (f < s) cout << < ; else if (f > s) cout << > ; }
|
#include <bits/stdc++.h> using namespace std; const int Maxn = 10005; const int Maxb = 31; struct linker { int x, y, id; linker(int x = 0, int y = 0, int id = 0) : x(x), y(y), id(id) {} bool operator<(const linker &b) const { if (y != b.y) return y > b.y; if (x != b.x) return x > b.x; return id < b.id; } }; int n; linker L[Maxn]; int xbas[Maxb]; int rval[Maxb], masktaken[Maxn]; vector<pair<int, int> > res; int getBit(int x) { if (x == 0) return -1; for (int i = Maxb - 1; i >= 0; i--) if (x & 1 << i) return i; } void Swap(int a, int b) { if (a == b) return; res.push_back(pair<int, int>(L[a].id, L[b].id)); res.push_back(pair<int, int>(L[b].id, L[a].id)); res.push_back(pair<int, int>(L[a].id, L[b].id)); swap(L[a].x, L[b].x); int ab = getBit(L[a].x), bb = getBit(L[b].x); if (ab != -1) xbas[ab] = a; if (bb != -1) xbas[bb] = b; } void writeMask(int x) { for (int i = 0; i < Maxb; i++) if (masktaken[L[x].id] & 1 << i) res.push_back(pair<int, int>(L[x].id, rval[i])); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &L[i].x); L[i].id = i; for (int b = Maxb - 1; b >= 0; b--) if (L[i].x & 1 << b) if (xbas[b]) { res.push_back(pair<int, int>(i, xbas[b])); L[i].x ^= L[xbas[b]].x; } else { xbas[b] = i; break; } } for (int i = 1; i <= n; i++) { scanf( %d , &L[i].y); int num = L[i].y; L[i].y = 0; for (int b = Maxb - 1; b >= 0; b--) if (num & 1 << b) if (xbas[b]) { num ^= L[xbas[b]].x; L[i].y |= 1 << b; } else { printf( -1 n ); return 0; } } int cur = 1; while (true) { sort(L + cur, L + n + 1); for (int i = cur; i <= n; i++) { int b = getBit(L[i].x); if (b != -1) xbas[b] = i; } int b = getBit(L[cur].y); if (b == -1) { for (int i = cur; i <= n; i++) { if (L[i].x) res.push_back(pair<int, int>(L[i].id, L[i].id)); writeMask(i); } break; } else { Swap(cur, xbas[b]); writeMask(cur); for (int i = b - 1; i >= 0; i--) if (L[cur].y & 1 << i) res.push_back(pair<int, int>(L[cur].id, L[xbas[i]].id)); rval[b] = L[cur].id; masktaken[L[cur].id] ^= 1 << b; for (int i = cur + 1; i <= n; i++) if (L[i].y & 1 << b) { L[i].y ^= L[cur].y; masktaken[L[i].id] ^= masktaken[L[cur].id]; } } cur++; } printf( %d n , res.size()); for (int i = 0; i < res.size(); i++) printf( %d %d n , res[i].first, res[i].second); return 0; }
|
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long int t; cin >> t; while (t--) { long long int n, k, i, c = 1, p; cin >> n >> k; long long int a[n]; set<long long int> s; for (i = 0; i < n; i++) { cin >> a[i]; s.insert(a[i]); } if (s.size() <= k) { cout << 1; } else { if (k == 1) cout << -1; else { p = s.size(); p -= k; if (p % (k - 1) != 0) c++; c += p / (k - 1); cout << c; } } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int TC; cin >> TC; while (TC--) { int N; cin >> N; string s; cin >> s; int ans = 0; int cnt = 0; for (int i = N - 1; i >= 0; i--) { if (s[i] == P ) cnt++; else { ans = max(ans, cnt); cnt = 0; } } cout << ans << n ; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n % 2 == 0) { cout << -1; } else { for (int i = 0; i < n; i++) { cout << (2 * i) % n << ; } cout << endl; cout << 0 << ; for (int i = n - 1; i > 0; i--) { cout << i << ; } cout << endl; for (int i = 0; i < n; i++) { cout << i << ; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m, a; cin >> n >> m; a = n % m; for (int i = 1; i <= m; i++) { if (a > 0) { cout << n / m + 1 << ; a--; } else { cout << n / m << ; } } }
|
#include <bits/stdc++.h> using namespace std; using vi = vector<int>; using vvi = vector<vi>; using ii = pair<int, int>; using vii = vector<ii>; using l = long long; using vl = vector<l>; using vvl = vector<vl>; using ll = pair<l, l>; using vll = vector<ll>; using vvll = vector<vll>; using lu = unsigned long long; using vb = vector<bool>; using vvb = vector<vb>; using vd = vector<double>; using vvd = vector<vd>; const int INF = numeric_limits<int>::max(); const double EPS = 1e-10; const l e0 = 1, e5 = 100000, e6 = 1000000, e7 = 10000000, e9 = 1000000000; const bool enable_log = false; struct VoidStream { void operator&(std::ostream&) {} }; const l dx[] = {0, 0, 1, -1}; const l dy[] = {-1, 1, 0, 0}; struct point { l x, y; }; const l Z = 26; const l MAX = 50; point start, finish; l n, m, k; l around_start, around_finish; l shortest; string answer; l D[MAX][MAX]; vector<string> M; bool fit(l x, l y) { return (x >= 0) and (x < n) and (y >= 0) and (y < m); } l to_bit(char c) { return e0 << (c - a ); } void check(l mask) { if ((mask & around_finish) == 0) return; fill(&D[0][0], &D[MAX][0], 0); queue<point> q; q.emplace(finish); D[finish.x][finish.y] = 1; while (not q.empty()) { auto u = q.front(); q.pop(); l r = D[u.x][u.y]; if (r > shortest) return; for (l d = 0; d < 4; d++) { l x = u.x + dx[d], y = u.y + dy[d]; if ((not fit(x, y)) or D[x][y] != 0) continue; if (M[x][y] == S ) { string candidate = ; vector<point> wave; wave.push_back({x, y}); for (l i = r; i > 1; i--) { vector<point> next; char c = z + 1; for (const auto p : wave) { for (l j = 0; j < 4; j++) { l a = p.x + dx[j], b = p.y + dy[j]; if ((not fit(a, b)) or (D[a][b] != i)) continue; D[a][b] = -1; if (M[a][b] < c) { next.clear(); c = M[a][b]; } if (M[a][b] == c) next.push_back({a, b}); } } candidate += c; swap(next, wave); } if (r < shortest) { answer = candidate; shortest = r; } else if (candidate < answer) { answer = candidate; } return; } if (mask & to_bit(M[x][y])) { D[x][y] = r + 1; q.push({x, y}); } else { D[x][y] = -1; } } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); while (cin >> n >> m >> k) { shortest = INF; M.resize(n); for (l i = 0; i < n; i++) cin >> M[i]; l mask = 0; for (l i = 0; i < n; i++) { for (l j = 0; j < m; j++) { if (M[i][j] == S ) { start = {i, j}; continue; } if (M[i][j] == T ) { finish = {i, j}; continue; } mask = mask | to_bit(M[i][j]); } } around_start = 0; for (l d = 0; d < 4; d++) { if (fit(start.x + dx[d], start.y + dy[d])) { if (M[start.x + dx[d]][start.y + dy[d]] == T ) { shortest = 0; break; } around_start = around_start | to_bit(M[start.x + dx[d]][start.y + dy[d]]); } } if (shortest == 0) { cout << n ; continue; } around_finish = 0; for (l d = 0; d < 4; d++) { if (fit(finish.x + dx[d], finish.y + dy[d])) around_finish = around_finish | to_bit(M[finish.x + dx[d]][finish.y + dy[d]]); } for (l a = 0; a < Z; a++) { if ((around_start & (e0 << a)) == 0) continue; check(e0 << a); if (k == 1) continue; for (l b = 0; b < Z; b++) { if ((b == a) or ((mask & (e0 << b)) == 0)) continue; check((e0 << a) | (e0 << b)); if (k == 2) continue; for (l c = b + 1; c < Z; c++) { if ((c == a) or ((mask & (e0 << c)) == 0)) continue; check((e0 << a) | (e0 << b) | (e0 << c)); if (k == 3) continue; for (l d = c + 1; d < Z; d++) { if ((d == a) or ((mask & (e0 << d)) == 0)) continue; check((e0 << a) | (e0 << b) | (e0 << c) | (e0 << d)); } } } } if (shortest == INF) { cout << -1 n ; } else { cout << answer << n ; } } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int nax = 1e5 + 10; vector<int> tree(4 * nax); long long i, j, x, y, k; bool sortbysec(const pair<long long, long long> &a, const pair<long long, long long> &b) { return (a.second < b.second); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, cnt = 0; cin >> n; vector<vector<long long>> a(n + 1); for (i = 0; i < n - 1; i++) { cin >> x >> y; a[x].push_back(y); a[y].push_back(x); } for (i = 1; i <= n; i++) { if (a[i].size() == 1) cnt++; } cout << cnt << endl; }
|
#include <bits/stdc++.h> using namespace std; double max(double a, double b) { return a > b ? a : b; } double min(double a, double b) { return a > b ? b : a; } double x[10101], y[10101], z[10101], A, B; int n, m, k; void slv() { double minx = -1; sort(x + 1, x + n + 1); sort(y + 1, y + m + 1); sort(z + 1, z + k + 1); double tmp = sqrt(x[n] * x[n] / (1 + ((A * z[1]) / (B * y[m])))); printf( %lf n , tmp); } int main() { while (cin >> n) { for (int i = 1; i <= n; i++) { cin >> x[i]; } cin >> m; for (int i = 1; i <= m; i++) { cin >> y[i]; } cin >> k; for (int i = 1; i <= k; i++) { cin >> z[i]; } cin >> A >> B; slv(); } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 200000 + 10; int n; long long area, cnt; double fac[200], ans, calc; struct Point { long long x, y; Point() {} Point(long long x, long long y) : x(x), y(y) {} Point operator-(const Point& tmp) const { return Point(x - tmp.x, y - tmp.y); } } p[maxn]; inline long long read() { long long x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); } long long cross(Point A, Point B) { return A.x * B.y - A.y * B.x; } int main() { if (fopen( D.in , r ) != NULL) { freopen( D.in , r , stdin); freopen( D.out , w , stdout); } n = read(); for (int i = 0; i < n; i++) p[i].x = read(), p[i].y = read(); fac[0] = 1; for (int i = 1; i <= 100; i++) fac[i] = fac[i - 1] * 2; if (n <= 100) calc = fac[n] - 1 - n - n * (n - 1) / 2; for (int i = 0; i < n; i++) cnt += gcd(abs(p[i].x - p[(i + 1) % n].x), abs(p[i].y - p[(i + 1) % n].y)); for (int i = 1; i < n - 1; i++) area += cross(p[i] - p[0], p[i + 1] - p[0]); ans = (area - cnt) / 2 + 1; for (int i = 0; i < n; i++) { area = 0, cnt = gcd(abs(p[i].x - p[(i + 1) % n].x), abs(p[i].y - p[(i + 1) % n].y)) + 1; for (int k = 2, j; k <= 60; k++) { j = (i + k) % n; if ((j + 1) % n == i) break; cnt += gcd(abs(p[j].x - p[(j - 1 + n) % n].x), abs(p[j].y - p[(j - 1 + n) % n].y)); area += cross(p[(j + n - 1) % n] - p[i], p[j] - p[i]); long long tmp = gcd(abs(p[j].x - p[i].x), abs(p[j].y - p[i].y)) - 1; long long s = (area - (cnt + tmp)) / 2 + 1; if (n <= 100) ans -= (double)(tmp + s) * (fac[n - k - 1] - 1) / calc; else ans -= (double)(tmp + s) * (1.0 / fac[k + 1]); } } printf( %.12lf n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string x, y; cin >> x >> y; int length = x.length(); for (int i = 0; i < length; i++) { int c = x[i]; if (islower(c)) x[i] = toupper(c); } int length1 = y.length(); for (int i = 0; i < length1; i++) { int c = y[i]; if (islower(c)) y[i] = toupper(c); } int xx = 0, yy = 0; for (int i = 0; i < length; i++) { int r = int(x[i]); xx += r; int d = int(y[i]); yy += d; } cout << x.compare(y); }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 100; int dp[N], x[N]; int main() { int k, n, b, t; scanf( %d%d%d%d , &k, &n, &b, &t); int lim = min(t, min(n, b)) * n; while (k--) { for (int i = 0; i < n; i++) scanf( %d , &x[i]); memset(dp, 0, sizeof dp); for (int i = 0; i < lim; i++) { int v = x[i % n]; for (int j = v; j <= b && dp[j] == dp[v - 1]; j++) dp[j]++; } printf( %d n , dp[b]); } }
|
#include <bits/stdc++.h> using namespace std; vector<long long> v; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long a = 0, b = 0, c, d, e, f = 0, l, g, m, n, k, i, j, t, p, q; cin >> t; while (t--) { cin >> n; f = 0; v.clear(); for (i = 2; f < 2 && i <= sqrt(n) + 1; i++) { if (n % i == 0) { v.push_back(i); n /= i; f++; } } if (v.size() < 2 || n == 1 || n == v[0] || n == v[1]) { cout << NO n ; } else { cout << YES n << v[0] << << v[1] << << n << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long N = 105; const long long MOD = 1e9 + 7; long long n, m, k; long long cache[N][N * N], cache2[N][N]; long long fact[N], invfact[N]; long long pow(long long a, long long b, long long m) { long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % m; b /= 2; a = (a * a) % m; } return ans; } long long modinv(long long k) { return pow(k, MOD - 2, MOD); } void precompute() { fact[0] = fact[1] = 1; for (long long i = 2; i < N; i++) { fact[i] = fact[i - 1] * i; fact[i] %= MOD; } invfact[N - 1] = modinv(fact[N - 1]); for (long long i = N - 2; i >= 0; i--) { invfact[i] = invfact[i + 1] * (i + 1); invfact[i] %= MOD; } } long long nCr(long long x, long long y) { if (y > x) return 0; long long num = fact[x]; num *= invfact[y]; num %= MOD; num *= invfact[x - y]; num %= MOD; return num; } long long get(long long idx, long long cur) { long long &ans = cache2[idx][cur]; if (ans != -1) return ans; long long ways = nCr(n, cur); long long have = m / n; if (m % n >= (idx)) have++; ways = pow(ways, have, MOD); return ans = ways; } long long dp(long long idx, long long rem) { if (idx == n + 1) return (rem == 0); long long &ans = cache[idx][rem]; if (ans != -1) return ans; ans = 0; for (long long cur = 0; cur <= min(n, rem); cur++) { long long ways = get(idx, cur); ans += ways * dp(idx + 1, rem - cur); ans %= MOD; } return ans; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; precompute(); memset(cache, -1, sizeof(cache)); memset(cache2, -1, sizeof(cache2)); cin >> n >> m >> k; cout << dp(1, k); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = (int)1e6 + 7; const long long INF = (long long)1e9 + 7; char st[N]; map<long long, long long> s[200]; long long c[N]; int main() { int n; long long t, ans = 0, x = 0; for (char i = a ; i <= z ; i++) cin >> c[i]; gets(st); gets(st); n = strlen(st); for (int i = 0; i < n; i++) { x += c[st[i]]; ans += s[st[i]][x - c[st[i]]]; s[st[i]][x]++; } cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; char a[1000011]; int main() { while (~scanf( %s , a)) { int t = strlen(a); if (t % 2 != 0) printf( Impossible n ); else { stack<char> sta; int ans = 0, p = 0; for (int i = 0; i < t; i++) { if (a[i] == { || a[i] == [ || a[i] == ( || a[i] == < ) { sta.push(a[i]); ans++; } else { if (sta.empty()) { p++; printf( Impossible n ); break; } else { char s = sta.top(); if ((s == { && a[i] == } ) || (s == ( && a[i] == ) ) || (s == [ && a[i] == ] ) || (s == < && a[i] == > )) { ans--; } sta.pop(); } } } if (p == 0) { if (sta.empty()) { if (ans < 0) printf( Impossible n ); else printf( %d n , ans); } else printf( Impossible n ); } } memset(a, 0, sizeof(a)); } return 0; }
|
#include <bits/stdc++.h> using namespace std; typedef long long lli; #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define pb push_back #define int long long int dp[201][20001]; int numSubseq(int n , vector<int>& a, int s , int pos1 = -2 , int pos2 = -2 ) { if( n == pos1 || n == pos2 ) return numSubseq( n - 1 , a , s ) ; if(n==-1) { if(s==0) return 1; return 0; } if(s<0) return 0; if(s==0) return 1; if(dp[n][s]!=-1) return dp[n][s]; return dp[n][s] = numSubseq(n-1,a,s-a[n]) || numSubseq(n-1,a,s); } signed main() { memset(dp,-1,sizeof(dp)); int n , sum = 0 ; cin >> n ; vector<int> a(n) ; for( auto &it : a ) cin >> it , sum += it ; if( sum % 2 ) { cout << 0 ; return 0 ; } if( !numSubseq( n -1 , a , sum / 2 ) ) { cout << 0; return 0 ; } for( int i = 0 ; i< n ; i++ ) { int target = sum - a[i] ; if( target % 2 ) { cout << 1 << endl; cout << i + 1; return 0 ; } if( !numSubseq(n-1, a , target / 2 , i ) ) { cout << 1 << endl ; cout << i + 1 << endl ; return 0 ; } } for( int i = 0 ; i < n; i++ ) { for( int j = 0 ; j < n ; j++ ) { if( i == j ) continue ; int target = sum - a[i] - a[j] ; if( target % 2 ) { cout << 2 << endl ; cout << i +1 << << j + 1 << endl ; return 0 ; } if( !numSubseq(n-1, a , target / 2 , i , j ) ) { cout << 2 << endl ; cout << i + 1 << << j + 1 <<endl ; return 0 ; } } } }
|
#include <bits/stdc++.h> using namespace std; bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; } int main(void) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int n, m, ta, tb, k; cin >> n >> m >> ta >> tb >> k; long long int a[n], b[m]; for (int i = 0; i < n; i++) cin >> a[i], a[i] += ta; for (int i = 0; i < m; i++) cin >> b[i]; if (k >= n || k >= m) { cout << -1 << n ; return 0; } long long int d = 0; for (int i = 0, index; i < n && k >= 0; i++, k--) { index = lower_bound(b, b + m, a[i]) - b + k; if (index >= m) { cout << -1 << n ; return 0; } d = max(d, b[index] + tb); } cout << d << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; if (n == 12) { string hour = ; hour += s[0]; hour += s[1]; string min = ; min += s[3]; min += s[4]; if (hour == 00 ) s[0] = 1 ; if (stoi(hour) > 12) { if (s[1] == 0 ) s[0] = 1 ; else if (s[1] == 2 || s[1] == 1 ) s[0] = 1 ; else { s[0] = 0 ; } } if (stoi(min) > 59) { s[3] = 0 ; } } else { string hour = ; hour += s[0]; hour += s[1]; string min = ; min += s[3]; min += s[4]; if (stoi(hour) > 23) { s[0] = 0 ; } if (stoi(min) > 59) s[3] = 0 ; } cout << s << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; cout << n * 2 - n / 2; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.