func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; bool posible(int a, int b, int a2, int b2) { if ((a + a2 == b && b == b2) || (a + b2 == b && b == a2) || (b + b2 == a && a == a2) || (b + a2 == a && a == b2)) { return true; } return false; } int main() { int t; cin >> t; for (int i = 0; i < t; i++) { int a, b, a2, b2; cin >> a >> b >> a2 >> b2; if (posible(a, b, a2, b2)) { cout << YES n ; } else { cout << NO n ; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, p, last[10]; struct node { int x, y; }; int s[10]; char a[1005][1005]; int vis[1005][1005], ans[10], can[10]; queue<node> que[10]; int d[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; void bfs() { for (int i = 1; i <= p; i++) { while (!que[i].empty()) que[i].pop(); } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] != . && a[i][j] != # ) { que[a[i][j] - 0 ].push({i, j}); vis[i][j] = a[i][j] - 0 ; last[a[i][j] - 0 ]++; } } } bool flag = true; while (flag) { flag = false; for (int idx = 1; idx <= p; idx++) { for (int ss = 1; ss <= s[idx] && can[idx] == 0; ss++) { int num = last[idx]; last[idx] = 0; for (int t = 1; t <= num; t++) { node now = que[idx].front(); que[idx].pop(); ans[idx]++; for (int i = 0; i < 4; i++) { int xx = now.x + d[i][0], yy = now.y + d[i][1]; if (xx >= 0 && xx < n && yy >= 0 && yy < m && vis[xx][yy] == 0 && a[xx][yy] == . ) { que[idx].push({xx, yy}); vis[xx][yy] = idx; last[idx]++; } } } if (que[idx].empty()) can[idx] = idx; } } for (int i = 1; i <= p; i++) if (!que[i].empty()) flag = true; } for (int i = 1; i <= p; i++) printf( %d , ans[i]); printf( n ); } int main() { while (scanf( %d %d %d , &n, &m, &p) != EOF) { memset(a, 0, sizeof(a)); memset(s, 0, sizeof(s)); memset(ans, 0, sizeof(ans)); memset(vis, 0, sizeof(vis)); memset(last, 0, sizeof(last)); memset(can, 0, sizeof(can)); for (int i = 1; i <= p; i++) scanf( %d , &s[i]); getchar(); for (int i = 0; i < n; i++) scanf( %s , a[i]); bfs(); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; const int inf = 1e9; int main() { long long n, m, grt = 0, eq = 0, less = 0, i; cin >> n >> m; for (i = 0; i < n; i++) { long long temp; cin >> temp; if (temp == m) eq++; else if (temp < m) less++; else grt++; } long long ans = 0, tot; if (eq == 0) { eq++; ans++; } tot = less + eq + grt; long long temp = (tot + 1) / 2; if (less + eq < temp) { ans += grt - less - eq; less += grt - less - eq; } else if (tot - (grt + eq) > temp) { ans += less - eq - grt; grt += less - eq - grt; } tot = less + eq + grt; temp = (tot + 1) / 2; if (less == temp) ans++; if (grt == tot - temp + 1) ans++; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; bool prime(int n) { for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } int main() { int n; cin >> n; if (prime(n)) { cout << 1 << n << n << endl; return 0; } if (prime(n - 2)) { cout << 2 << n << 2 << n << n - 2 << endl; return 0; } cout << 3 << n << 3 << endl; n -= 3; for (int i = 2; i <= n; i++) { if (prime(i) and prime(n - i)) { cout << i << n << n - i << endl; break; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, k, a[300]; double p[300], d[202][202][402], ans; int main() { scanf( %d%d%d , &n, &m, &k); for (int i = 1; i <= n; ++i) { scanf( %lf , &p[i]); p[i] /= 100; } for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); } if (k >= n) k = n; d[0][0][k + n] = 1; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { for (int l = 0; l <= 2 * n; ++l) { if (a[i + 1] != -1) { d[i + 1][j + 1][min(2 * n, l + a[i + 1])] += d[i][j][l] * p[i + 1]; d[i + 1][j][l] += d[i][j][l] * (1 - p[i + 1]); } if (a[i + 1] == -1) { if (l > 0) d[i + 1][j + 1][l - 1] += d[i][j][l] * p[i + 1]; d[i + 1][j][l] += d[i][j][l] * (1 - p[i + 1]); } } } } for (int i = n; i <= n; ++i) { for (int j = m; j <= n; ++j) for (int l = n; l <= 2 * n; ++l) { ans += d[i][j][l]; } } printf( %.9lf , ans); 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>; const int INF = 2000000000; const ll LLINF = 9000000000000000000; int main() { int N; scanf( %d , &N); vi A(N, 0LL), B(N, 0LL); for (int i = 0; i < N; ++i) { int v; scanf( %d , &v); A[i] = ll(v); B[i] = A[i] + (i > 0 ? B[i - 1] : 0LL); } ll mx = 0LL; for (int i = 0; i < N; ++i) mx += ll(i + 1) * A[i]; vii lns; vector<ld> start(1, -std::numeric_limits<ld>::infinity()); lns.push_back({0, 0}); for (int i = 0; i < N; ++i) { while (lns.size() > 1 && start.back() >= ld(-B[i] - lns.back().second) / ld(lns.back().first - i - 1)) { lns.pop_back(); start.pop_back(); } start.push_back(ld(-B[i] - lns.back().second) / ld(lns.back().first - i - 1)); lns.push_back({i + 1, -B[i]}); } ll bestchange = 0LL; int D = 5; for (int i = 0; i < N; ++i) { ll change = B[i] - A[i] * ll(i + 1); int l = 0, r = int(lns.size()) - 1; while (l < r) { int m = (l + r + 1) / 2; if (start[m] > A[i]) r = m - 1; else l = m; } for (int j = max(0, l - D); j < min(int(lns.size()), l + D + 1); ++j) { if (bestchange < change + A[i] * lns[j].first + lns[j].second) { bestchange = change + A[i] * lns[j].first + lns[j].second; } } } cout << (mx + bestchange) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> void read(vector<T> &a, long long n) { T x; a.clear(); for (long long i = 0; i < n; i++) { cin >> x; a.push_back(x); } } template <class T> void write(vector<T> &a) { for (T x : a) cout << x << ; cout << endl; } const int N = 300005; const int S = 500; long long sum[S][S]; long long ans[N]; vector<pair<pair<int, int>, int> > q; int n, m; int w[N]; int main() { ios_base::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) cin >> w[i]; cin >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; q.push_back(make_pair(make_pair(a, b), i)); } sort(q.begin(), q.end()); reverse(q.begin(), q.end()); int pos = n; for (int i = 0; i < q.size(); i++) { int a = q[i].first.first; int b = q[i].first.second; int id = q[i].second; while (pos >= a) { for (int j = 1; j < S; j++) sum[j][pos % j] += w[pos]; pos--; } if (b < S) ans[id] = sum[b][a % b]; else { long long res = 0; for (int j = a; j <= n; j += b) res += w[j]; ans[id] = res; } } for (int i = 0; i < m; i++) cout << ans[i] << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; map<int, int> mp1, mp2; map<int, int>::iterator it; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; mp1[a] = b; } int m; cin >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; if (mp1.find(a) != mp1.end()) { it = mp1.find(a); if (it->second > b) { continue; } else { mp1.erase(it); mp2[a] = b; } } else { mp2[a] = b; } } long long sum = 0; it = mp1.begin(); while (it != mp1.end()) { sum += it->second; it++; } it = mp2.begin(); while (it != mp2.end()) { sum += it->second; it++; } cout << sum << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long test(long long k) { long long a[] = {-1, 1, k + 2}; int c = -1; long long cur = 0, res = 0; for (int i = 0; i < 3; i++) { cur += a[i]; if (cur < 0) { cur = 0; c = i; } res = max(res, (i - c) * cur); } return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); long long k; cin >> k; int a = k + 2000; cout << 2000 << endl << -1 << ; for (int i = 1; i < 2000; i++) { cout << min(a, (int)1e6) << ; a -= min(a, (int)1e6); } return 0; } |
#include <bits/stdc++.h> #define task suffixarray #define ll long long #define FOR( i, l, r) for(int i = (l), _r = (r); i <= _r; ++i) #define FOD( i, l, r) for(int i = (l), _r = (r); i >= _r; --i) #define REP( i, n) for(int i = 0, _n = (n); i < _n; ++i) #define pii pair<int,int> #define fi first #define se second #define MASK(x) (1ll << (x)) #define BIT(x,k) (((x) >> (k)) & 1ll) #define OFF(x,k) ((x) & ~(1ll << (k))) #define ON(x,k) ((1ll << (k)) | (x)) #define endl n #define __builtin_popcount __builtin_popcountll /* Author: Diem Quynh :>> //d_quynh_2811 */ using namespace std; int const N = 4e5 + 5; int const mod = 998244353; int n, k, a[N], idx[N], fact[N], ifact[N]; int num = 1, ans; void inp() { cin >> n >> k; FOR( i, 1, n) { cin >> a[i]; ++a[i]; idx[a[i]] = i; } } int Pow(int a, int b) { if(b == 0) return 1; int tmp = Pow(a, b / 2); if(b & 2) return (1ll * tmp * tmp) % mod * a % mod; return 1ll * tmp * tmp % mod; } int nCk(int n, int k) { return 1ll * fact[n] * ifact[k] % mod * ifact[n - k] % mod; } void solve() { FOR( i, 1, n - 1) k += idx[a[i] + 1] < idx[a[i + 1] + 1]; if(n > k) { cout << 0; return; } fact[0] = 1; FOR( i, 1, k) fact[i] = (1ll * fact[i - 1] * i) % mod; ifact[k] = Pow(fact[k], mod - 2); FOD( i, k - 1, 0) ifact[i] = 1ll * (i + 1) * ifact[i + 1] % mod; cout << nCk(k, n); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); // freopen(task .inp , r ,stdin); // freopen(task .out , w ,stdout); inp(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename _T> inline void read(_T &f) { f = 0; _T fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); } f *= fu; } template <typename T> void print(T x) { if (x < 0) putchar( - ), x = -x; if (x < 10) putchar(x + 48); else print(x / 10), putchar(x % 10 + 48); } template <typename T> void print(T x, char t) { print(x); putchar(t); } template <typename T> struct hash_map_t { vector<T> v, val, nxt; vector<int> head; int mod, tot, lastv; T lastans; bool have_ans; hash_map_t(int md = 0) { head.clear(); v.clear(); val.clear(); nxt.clear(); tot = 0; mod = md; nxt.resize(1); v.resize(1); val.resize(1); head.resize(mod); have_ans = 0; } bool count(int x) { int u = x % mod; for (register int i = head[u]; i; i = nxt[i]) { if (v[i] == x) { have_ans = 1; lastv = x; lastans = val[i]; return 1; } } return 0; } void ins(int x, int y) { int u = x % mod; nxt.push_back(head[u]); head[u] = ++tot; v.push_back(x); val.push_back(y); } int qry(int x) { if (have_ans && lastv == x) return lastans; count(x); return lastans; } }; const int N = 755, MAXN = 1e7 + 5; queue<int> q; char c[MAXN]; vector<int> adj[N << 1]; int ch[MAXN][2], fail[MAXN], id[MAXN], l[N], r[N], pre[N << 1], used[N << 1], vis[N << 1]; int f[N][N], n, len, tot, dfn, ans; int dfs1(int u) { for (register unsigned i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (used[v] != dfn) { used[v] = dfn; if (!pre[v] || dfs1(pre[v])) { pre[v] = u; pre[u] = v; return 1; } } } return 0; } void dfs2(int u) { vis[u] = 1; for (register unsigned i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (!vis[v] && pre[v]) vis[v] = 1, dfs2(pre[v]); } } int main() { read(n); for (register int i = 1; i <= n; i++) { scanf( %s , c + r[i - 1] + 1); len = strlen(c + r[i - 1] + 1); l[i] = r[i - 1] + 1; r[i] = l[i] + len - 1; int now = 0; for (register int j = l[i]; j <= r[i]; j++) { int x = c[j] - a ; if (!ch[now][x]) ch[now][x] = ++tot; now = ch[now][x]; } id[now] = i; } for (register int i = 0; i <= 1; i++) if (ch[0][i]) q.push(ch[0][i]); while (!q.empty()) { int u = q.front(); q.pop(); for (register int i = 0; i <= 1; i++) { int v = ch[u][i]; if (!v) continue; int now = fail[u], last = 1; while (last) { if (ch[now][i]) { fail[v] = ch[now][i]; break; } last = now; now = fail[now]; } if (!id[v]) id[v] = id[fail[v]]; q.push(v); } } for (register int i = 1; i <= n; i++) { int now = 0; for (register int j = l[i]; j <= r[i]; j++) { int x = c[j] - a ; now = ch[now][x]; if (j == r[i]) f[i][id[fail[now]]] = 1; else f[i][id[now]] = 1; } } for (register int k = 1; k <= n; k++) { for (register int i = 1; i <= n; i++) { for (register int j = 1; j <= n; j++) { f[i][j] |= (f[i][k] & f[k][j]); } } } for (register int i = 1; i <= n; i++) { for (register int j = 1; j <= n; j++) { if (f[i][j]) { adj[i].push_back(j + n); adj[j + n].push_back(i); } } } ans = n; for (register int i = 1; i <= n; i++) if (!pre[i]) ++dfn, ans -= dfs1(i); print(ans, n ); for (register int i = 1; i <= n; i++) if (!pre[i]) dfs2(i); for (register int i = 1; i <= n; i++) if (vis[i] && !vis[i + n]) print(i, ); putchar( n ); return 0; } |
#include <bits/stdc++.h> int main() { int arr[1000], n, i, j, k, counter = 99999999, x, y; scanf( %d , &n); for (i = 0; i < n; ++i) { scanf( %d , &arr[i]); } for (j = 1; j < n; ++j) { for (k = j - 1; k < j; ++k) { if (abs(arr[j] - arr[k]) < counter) { counter = abs(arr[j] - arr[k]); x = j + 1; y = k + 1; } } } if (abs(arr[0] - arr[n - 1]) < counter) { counter = abs(arr[0] - arr[n - 1]); x = 1; y = n; } printf( %d %d , y, x); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int eps = -1e6; const int MAX = 200010; long long int n, k, x; long long int a[MAX], pre[MAX], s[MAX]; long long int expo(long long int a, long long int b) { long long int x = 1, y = a; while (b > 0) { if (b & 1) x = (x * y); y = (y * y); b >>= 1; } return x; } int main() { ios_base::sync_with_stdio(0); cin >> n >> k >> x; for (int i = 0, _n = (n); i < _n; ++i) { cin >> a[i]; if (i == 0) pre[i] = a[i]; else pre[i] = pre[i - 1] | a[i]; } for (int i = n - 1; i >= 0; i--) { if (i == n - 1) s[i] = a[i]; else s[i] = s[i + 1] | a[i]; } long long int tmp = expo(x, k); long long int res = 0; for (int i = 0, _n = (n); i < _n; ++i) { long long int z = a[i] * 1ll * tmp; if (i == 0) res = max(res, z | s[1]); else if (i == n - 1) res = max(res, pre[n - 2] | z); else res = max(res, pre[i - 1] | z | s[i + 1]); } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int arr[100000]; int pre[100000]; int leftMax; int main() { ios_base ::sync_with_stdio(false); cin.tie(NULL); ; int t; cin >> t; while (t--) { int maxLen = 0; int n, x; cin >> n >> x; for (int i = 0; i < n; i++) cin >> arr[i]; pre[0] = arr[0]; for (int i = 1; i < n; i++) pre[i] = arr[i] + pre[i - 1]; leftMax = -1; for (int i = 0; i < n; i++) { pre[i] = pre[i] % x; if (pre[i] != 0) maxLen = i + 1; if (pre[i] != 0 && leftMax == -1) leftMax = i; } if (maxLen == 0) cout << -1 n ; else { int finalLen = maxLen; for (int i = 0; i < n; i++) { if (pre[i] == 0) finalLen = max(finalLen, max(abs(i - leftMax), abs(i - maxLen))); } cout << finalLen << n ; } } return 0; } |
#include <bits/stdc++.h> using ll = long long; constexpr int INF = 1073741823; constexpr int MINF = -1073741823; constexpr ll LINF = ll(4661686018427387903); constexpr ll MOD = 1000000007; const long double PI = acosl(-1.0L); using namespace std; void scans(string& str) { char c; str = ; scanf( %c , &c); if (c == n ) scanf( %c , &c); while (c != n && c != -1 && c != ) { str += c; scanf( %c , &c); } } void scanc(char& str) { char c; scanf( %c , &c); if (c == -1) return; while (c == n ) { scanf( %c , &c); } str = c; } double acot(double x) { return PI / 2 - atan(x); } ll LSB(ll n) { return (n & (-n)); } ll p(ll a) { return a * a; } int main() { int t; scanf( %d , &t); while (t--) { int r, g, b; scanf( %d%d%d , &r, &g, &b); vector<int> R(r), G(g), B(b); for (int i = 0; i < (r); ++i) scanf( %d , &R[i]); for (int i = 0; i < (g); ++i) scanf( %d , &G[i]); for (int i = 0; i < (b); ++i) scanf( %d , &B[i]); sort((R).begin(), (R).end()); sort((G).begin(), (G).end()); sort((B).begin(), (B).end()); ll ans = LINF; for (int i = 0; i < (r); ++i) { auto itegreen1 = lower_bound((G).begin(), (G).end(), R[i]), iteblue1 = lower_bound((B).begin(), (B).end(), R[i]); ll green1 = -1; if (itegreen1 != G.end()) green1 = *itegreen1; else green1 = G[G.size() - 1]; if (itegreen1 != G.begin()) --itegreen1; ll green2 = -1; if (itegreen1 != G.begin()) green2 = *itegreen1; else green2 = G[0]; ll blue1 = -1; if (iteblue1 != B.end()) blue1 = *iteblue1; else blue1 = B[B.size() - 1]; if (iteblue1 != B.begin()) --iteblue1; ll blue2 = -1; if (iteblue1 != B.begin()) blue2 = *iteblue1; else blue2 = B[0]; ans = min<ll>({(green1 != -1 and blue1 != -1) ? p(green1 - R[i]) + p(R[i] - blue1) + p(blue1 - green1) : LINF, (green2 != -1 and blue1 != -1) ? p(green2 - R[i]) + p(R[i] - blue1) + p(blue1 - green2) : LINF, (green1 != -1 and blue2 != -1) ? p(green1 - R[i]) + p(R[i] - blue2) + p(blue2 - green1) : LINF, (green2 != -1 and blue2 != -1) ? p(green2 - R[i]) + p(R[i] - blue2) + p(blue2 - green2) : LINF, ans}); } for (int i = 0; i < (g); ++i) { auto itered1 = lower_bound((R).begin(), (R).end(), G[i]), iteblue1 = lower_bound((B).begin(), (B).end(), G[i]); ll red1 = -1; if (itered1 != R.end()) red1 = *itered1; else red1 = R[R.size() - 1]; if (itered1 != R.begin()) --itered1; ll red2 = -1; if (itered1 != R.begin()) red2 = *itered1; else red2 = R[0]; ll blue1 = -1; if (iteblue1 != B.end()) blue1 = *iteblue1; else blue1 = B[B.size() - 1]; if (iteblue1 != B.begin()) --iteblue1; ll blue2 = -1; if (iteblue1 != B.begin()) blue2 = *iteblue1; else blue2 = B[0]; ans = min<ll>({(red1 != -1 and blue1 != -1) ? p(red1 - G[i]) + p(G[i] - blue1) + p(blue1 - red1) : LINF, (red2 != -1 and blue1 != -1) ? p(red2 - G[i]) + p(G[i] - blue1) + p(blue1 - red2) : LINF, (red1 != -1 and blue2 != -1) ? p(red1 - G[i]) + p(G[i] - blue2) + p(blue2 - red1) : LINF, (red2 != -1 and blue2 != -1) ? p(red2 - G[i]) + p(G[i] - blue2) + p(blue2 - red2) : LINF, ans}); } for (int i = 0; i < (b); ++i) { auto itered1 = lower_bound((R).begin(), (R).end(), B[i]), itegreen1 = lower_bound((G).begin(), (G).end(), B[i]); ll green1 = -1; if (itegreen1 != G.end()) green1 = *itegreen1; else green1 = G[G.size() - 1]; if (itegreen1 != G.begin()) --itegreen1; ll green2 = -1; if (itegreen1 != G.begin()) green2 = *itegreen1; else green2 = G[0]; ll red1 = -1; if (itered1 != R.end()) red1 = *itered1; else red1 = R[R.size() - 1]; if (itered1 != R.begin()) --itered1; ll red2 = -1; if (itered1 != R.begin()) red2 = *itered1; else red2 = R[0]; ans = min<ll>({(red1 != -1 and green1 != -1) ? p(red1 - B[i]) + p(B[i] - green1) + p(green1 - red1) : LINF, (red2 != -1 and green1 != -1) ? p(red2 - B[i]) + p(B[i] - green1) + p(green1 - red2) : LINF, (red1 != -1 and green2 != -1) ? p(red1 - B[i]) + p(B[i] - green2) + p(green2 - red1) : LINF, (red2 != -1 and green2 != -1) ? p(red2 - B[i]) + p(B[i] - green2) + p(green2 - red2) : LINF, ans}); } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct cmp { bool operator()(long long a, long long b) { return a > b; } }; multiset<long long> mex, msy; multiset<long long, cmp> msx, mey; int main() { long long n; cin >> n; long long sx[n], ex[n], sy[n], ey[n]; for (long long i = 0; i < n; i++) { cin >> sx[i] >> ey[i] >> ex[i] >> sy[i]; msx.insert(sx[i]); mex.insert(ex[i]); msy.insert(sy[i]); mey.insert(ey[i]); } for (long long i = 0; i < n; i++) { msx.erase(msx.find(sx[i])); mex.erase(mex.find(ex[i])); msy.erase(msy.find(sy[i])); mey.erase(mey.find(ey[i])); if (*msx.begin() <= *mex.begin() && *msy.begin() >= *mey.begin()) { cout << *msx.begin() << << *msy.begin() << endl; return 0; } msx.insert(sx[i]); mex.insert(ex[i]); msy.insert(sy[i]); mey.insert(ey[i]); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; pair<int, int> cc[105]; for (int i = 1; i <= m; i++) { int a, b, c, d; cin >> a >> b >> c >> d; for (int j = a; j <= b; j++) { if (!cc[j].first || c < cc[j].first) { cc[j].first = c; cc[j].second = d; } } } int ans = 0; for (int i = 1; i <= n; i++) ans += cc[i].second; cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long n, m; long long q_pow(long long a, long long b, long long c) { if (b == 0) return 1; long long ret = q_pow(a, b / 2, c); ret = (ret * ret) % c; if (b & 1) ret = (ret * a) % c; return ret; } int main() { scanf( %d%d , &n, &m); long long ans = (q_pow(3, n, m) + m - 1) % m; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const char nl = n ; const int mod = 1000000007; const double pi = 4 * atan(1); const int inf = 2000000000; const long long linf = (long long)1e18; const int pr = 37; const int maxn = 1000001; const int maxn_big = 1000001; string s; vector<int> v; unsigned long long h[maxn], p[maxn]; unsigned long long get_hash(int l, int r) { int len = (r - l) + 1; if (!l) return h[r]; return h[r] - h[l - 1] * p[len]; } bool check(int pf) { unsigned long long pref_hash = get_hash(0, pf); bool has_ans = 0; for (int i = 1; i < ((int)(s.size())) - 1; ++i) { int r = i + pf; if (r >= ((int)(s.size())) - 1) break; if (get_hash(i, r) == pref_hash) { has_ans = 1; break; } } return has_ans; } int main() { ios_base ::sync_with_stdio(0); cin.tie(0); srand(time(NULL)); cin >> s; h[0] = s[0]; p[0] = 1; for (int i = 1; i < ((int)(s.size())); ++i) { h[i] = h[i - 1] * pr + s[i]; p[i] = p[i - 1] * pr; } for (int i = 0; i < ((int)(s.size())); ++i) { int l = ((int)(s.size())) - 1 - i; if (get_hash(0, i) == get_hash(l, ((int)(s.size())) - 1)) v.push_back(i); } if (!((int)(v.size()))) { cout << Just a legend ; return 0; } int l = -1, r = ((int)(v.size())); bool has = 0; while (r - l > 1) { int mid = (r + l) / 2; if (check(v[mid])) { l = mid; has = 1; } else { r = mid; } } if (!has) { cout << Just a legend ; return 0; } string res = ; for (int i = 0; i <= v[l]; ++i) res += s[i]; cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 25; int main(int argc, char *argv[]) { long long n; cin >> n; long long ret1 = (1LL << 60); long long ret2 = 0; for (long long x = 1; x * x <= n; ++x) { if (n % x) continue; long long m = n / x; for (long long y = 1; y * y <= m; ++y) { if ((n / x) % y) continue; long long z = m / y; long long a = x + 1; long long b = y + 2; long long c = z + 2; ret1 = min(a * b * c - n, ret1); ret2 = max(a * b * c - n, ret2); b = x + 2; c = z + 2; a = y + 1; ret1 = min(a * b * c - n, ret1); ret2 = max(a * b * c - n, ret2); a = z + 1; b = x + 2; c = y + 2; ret1 = min(a * b * c - n, ret1); ret2 = max(a * b * c - n, ret2); } } cout << ret1 << << ret2 << n ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1000000000 ) using namespace std; inline void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); } string abc = abcdefghijklmnopqrstuvwxyz ; string ABC = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; string digits = 0123456789 ; void solve() { vector<long long> ind[30]; string s; cin >> s; long long n = s.length(); for (long long i = 0; i < n; i++) ind[s[i] - a ].push_back(i); double ans = 0; s = s + s; long long p[30] = {0}; for (long long i = 0; i < 26; i++) { for (long long len = 1; len < n; len++) { long long c[30] = {0}; for (long long l = 0; l < ind[i].size(); l++) { c[s[ind[i][l] + len] - a ]++; } long long cnt = 0; for (long long j = 0; j < 30; j++) if (c[j] == 1) cnt++; p[i] = max(p[i], cnt); } ans += p[i] * 1. / n; } cout << setprecision(15) << fixed << ans; } |
#include <bits/stdc++.h> using namespace std; void qmax(long long &x, long long y) { if (x < y) x = y; } void qmin(long long &x, long long y) { if (x > y) x = y; } inline long long read() { char s; long long k = 0, base = 1; while ((s = getchar()) != - && s != EOF && !(isdigit(s))) ; if (s == EOF) exit(0); if (s == - ) base = -1, s = getchar(); while (isdigit(s)) { k = k * 10 + (s ^ 0 ); s = getchar(); } return k * base; } inline void write(long long x) { static char cnt, num[15]; cnt = 0; if (!x) { putchar( 0 ); return; } for (; x; x /= 10) num[++cnt] = x % 10; for (; cnt; putchar(num[cnt--] + 48)) ; } const long long maxn = 100000 + 100; long long n, d, b, d1; long long a[maxn]; long long s1[maxn], s2[maxn]; signed main() { n = read(); d = read(); b = read(); d1 = n / 2 * b; for (long long i = 1; i <= n; i++) a[i] = read(); for (long long i = 1; i <= n; i++) { s1[i] = min(a[i], d1) + s1[i - 1]; d1 -= min(d1, a[i]); } d1 = n / 2 * b; for (long long i = n; i >= 1; i--) { s2[i] = min(a[i], d1) + s2[i + 1]; d1 -= min(d1, a[i]); } d1 = 0; long long R = n / 2, r = 0, ans1 = 0, ans2 = 0; for (long long i = 1; i <= R; i++) { r += d + 1; r = min(n, r); if (d1 + b <= s1[r]) d1 += b; else ans1++; } R = (n + 1) / 2 + 1; d1 = 0; r = 0; long long l = n + 1; for (long long i = n; i >= R; i--) { l -= d + 1; l = max(1ll, l); if (d1 + b <= s2[l]) d1 += b; else ans2++; } cout << max(ans1, ans2); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, d, x, y, javab1, javab2, ans[1000]; cin >> t; for (int i = 0; i < t; i++) { cin >> n >> x >> y >> d; javab1 = javab2 = n; if ((y - x) % d == 0) { ans[i] = ((abs(y - x)) / d); } else if ((y - 1) % d == 0 || (n - y) % d == 0) { if ((n - y) % d == 0) { javab1 = (n - x + d - 1) / d; javab1 += (n - y) / d; } if ((y - 1) % d == 0) { javab2 = (x - 1 + d - 1) / d; javab2 += (y - 1) / d; } ans[i] = (min(javab2, javab1)); } else { ans[i] = -1; } } for (int i = 0; i < t; i++) { cout << ans[i] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; using gg = long long; constexpr gg MAX = 1e6 + 5; constexpr gg mod = 1e9 + 7; constexpr gg INF = 1e10; constexpr double thre = 1e-7; gg ti, ni, mi, ki, di, pi, xi, yi; int main() { ios::sync_with_stdio(false); cin.tie(0); ti = 1; cin >> ti; while (ti--) { string a, b; cin >> ni >> a >> b; map<char, set<char>> m; for (gg i = 0; i < ni; ++i) { if (a[i] != b[i]) { m[a[i]].insert(b[i]); } } gg ans = 0; bool f = true; while (not m.empty()) { auto& [i, j] = *m.begin(); if (*j.begin() < i) { f = false; break; } if (j.size() != 1) { for (auto k = next(j.begin()); k != j.end(); ++k) { m[*j.begin()].insert(*k); } } m.erase(m.begin()); ans++; } cout << (f ? ans : -1) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, s, h, m, qh, qm, qhm, d; cin >> n >> s; qh = 0, qm = 0; qhm = 0; for (int i = 0; i < n; i++) { cin >> h >> m; d = h * 60 + m; if (i == 0 && d >= s + 1) { cout << 0 << << 0; return 0; } if (d - qhm >= 2 * s + 2) { qhm += s + 1; cout << qhm / 60 << << qhm % 60; return 0; } qhm = d; } qhm += s + 1; cout << qhm / 60 << << qhm % 60; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); } long long power(long long a, long long n) { long long p = 1; while (n > 0) { if (n % 2) { p = p * a; } n >>= 1; a *= a; } return p; } const int maxN = 3000; int dist[maxN + 10][maxN + 10], n, m, a, b, s[2], t[2], l[2], ans; vector<int> e[maxN + 10]; void bfs(int u) { memset(dist[u], -1, sizeof(dist[u])); dist[u][u] = 0; queue<int> q; q.push(u); while (!q.empty()) { int x = q.front(); q.pop(); for (int i = 0; i < e[x].size(); i++) { int y = e[x][i]; if (dist[u][y] == -1) { dist[u][y] = dist[u][x] + 1; q.push(y); } } } } int main() { ios_base::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i < m; i++) { cin >> a >> b; a--; b--; e[a].push_back(b); e[b].push_back(a); } for (int i = 0; i < 2; i++) { cin >> s[i] >> t[i] >> l[i]; s[i]--; t[i]--; } for (int i = 0; i < n; i++) { bfs(i); } if (dist[s[0]][t[0]] > l[0] || dist[s[1]][t[1]] > l[1]) return cout << -1, 0; ans = dist[s[0]][t[0]] + dist[s[1]][t[1]]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { int d1 = dist[s[0]][i] + dist[i][j] + dist[j][t[0]]; int d2 = dist[s[1]][i] + dist[i][j] + dist[j][t[1]]; if (d1 <= l[0] && d2 <= l[1]) { ans = min(ans, d1 + d2 - dist[i][j]); } d2 = dist[t[1]][i] + dist[i][j] + dist[j][s[1]]; if (d1 <= l[0] && d2 <= l[1]) { ans = min(ans, d1 + d2 - dist[i][j]); } d1 = dist[t[0]][i] + dist[i][j] + dist[j][s[0]]; if (d1 <= l[0] && d2 <= l[1]) { ans = min(ans, d1 + d2 - dist[i][j]); } d2 = dist[s[1]][i] + dist[i][j] + dist[j][t[1]]; if (d1 <= l[0] && d2 <= l[1]) { ans = min(ans, d1 + d2 - dist[i][j]); } } } cout << m - ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; const int maxn = 2e3 + 1; const int maxm = 2e3 + 1; char a[maxn], b[maxn]; int num[maxn]; int m, d; long long dp[maxn][maxm]; int len; int judge(const char* s, int lena) { int mod = 0; for (int i = 1; i <= lena; i++) { mod = (mod * 10 + s[i]) % m; if ((i & 1) == 0 && s[i] != d) { return 0; } if ((i & 1) && s[i] == d) return 0; } return (mod == 0); } int val[maxn]; long long dfs(int pos, int mod, bool limit) { if (pos == len + 1) { return mod == 0; } if (!limit && dp[pos][mod] != -1) return dp[pos][mod]; int up = (limit ? num[pos] : 9); long long res = 0; for (int i = 0; i <= up; i++) { int tmod = (mod * 10 + i) % m; if ((pos & 1) && (i == d)) continue; if (!(pos & 1) && (i != d)) continue; res = (res + dfs(pos + 1, tmod, limit && i == up)) % MOD; } if (!limit) dp[pos][mod] = res; return res; } long long solve(const char* s, int lena) { for (int i = 1; i <= lena; i++) num[i] = s[i]; len = lena; memset(dp, -1, sizeof(dp)); return dfs(1, 0, true) % MOD; } int main() { cin >> m >> d; cin >> (a + 1); cin >> (b + 1); int lena = strlen(a + 1), lenb = strlen(b + 1); for (int i = 1; i <= lena; i++) a[i] -= 0 ; for (int i = 1; i <= lenb; i++) b[i] -= 0 ; cout << ((solve(b, lenb) - solve(a, lena) + judge(a, lena)) % MOD + MOD) % MOD << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = LLONG_MAX; struct minimum_cost_bipartite_matching { int nl, nr; long long mc = 0; vector<int> ml, mr, ly; minimum_cost_bipartite_matching(int nl, int nr, vector<vector<long long>> &c) : nl(nl), nr(nr), ml(nl, -1), mr(nr, -1), ly(nr) { vector<long long> s(nl), t(nr); for (int i = 0; i < nl; i++) { int x = i, y = -1; vector<bool> u(nr); vector<long long> md(nr, inf); while (x != -1) { long long ny = -1, d = inf; for (int j = 0; j < nr; j++) if (!u[j]) { long long v = c[x][j] - s[x] - t[j]; if (v < md[j]) md[j] = v, ly[j] = y; if (md[j] < d) d = md[j], ny = j; } s[i] += d; mc += d; for (int j = 0; j < nr; j++) if (u[j]) s[mr[j]] += d, t[j] -= d; else md[j] -= d; y = ny; u[y] = true; x = mr[y]; } while (y != -1) { mr[y] = ly[y] != -1 ? mr[ly[y]] : i; ml[mr[y]] = y; y = ly[y]; } } } }; int charToInt(char c) { return c >= a && c <= z ? c - a : c - A + 26; } char intToChar(int c) { return c < 26 ? a + c : A + c - 26; } int main() { int n, k; cin >> n >> k; string s[2]; cin >> s[0] >> s[1]; vector<vector<long long>> c(k, vector<long long>(k)); for (int i = 0; i < n; i++) c[charToInt(s[0][i])][charToInt(s[1][i])]--; minimum_cost_bipartite_matching mcbm(k, k, c); cout << -mcbm.mc << n ; for (int i = 0; i < k; i++) cout << intToChar(mcbm.ml[i]); cout << n ; } |
#include <bits/stdc++.h> #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( O8 ) #pragma GCC optimization( unroll-loops ) using namespace std; const long long int N = 4e6 + 20, mod = 1e9 + 7, inf = 1e9, dlt = 12250, maxm = 2e6; int poww(long long a, int k) { if (!k) return 1; if (k == 1) return a; long long r = poww(a, k / 2); return (((r * r) % mod) * poww(a, k & 1)) % mod; } int trie[N][3], cnt; long long a[N / 10]; void build(string s) { int p = 0; string t = ; for (char ch : s) { int u = ch - 0 ; t += ch; if (!trie[p][u]) { cnt++; trie[p][u] = cnt; } p = trie[p][u]; } } long long que(long long x) { int p = 0, h = 0; long long y = 0; for (int i = 0; i < 40; i++) { if (!trie[p][0] && !trie[p][1]) return y; bool f = (!(x & (1ll << (39 - i)))); if (!trie[p][0] || (trie[p][1] && f)) { if (f) y += (1ll << (39 - i)); p = trie[p][1]; continue; } if (!f) y += (1ll << (39 - i)); p = trie[p][0]; } return y; } int main() { ios ::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; long long x = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; x ^= a[i]; } long long ans = x; string st = ; for (int i = 0; i < 40; i++) st += 0 ; build(st); long long y = 0; for (int i = 0; i < n; i++) { x ^= a[i]; y ^= a[i]; string s = ; for (int j = 0; j < 40; j++) { if (y & (1ll << j)) s = 1 + s; else s = 0 + s; } build(s); ans = max(que(x), ans); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } int main() { long long a, b; scanf( %lld , &a); scanf( %lld , &b); while (a > 0 && b > 0 && (a >= 2 * b || b >= 2 * a)) if (a >= 2 * b) a %= 2 * b; else b %= 2 * a; printf( %lld %lld n , a, b); } |
#include <bits/stdc++.h> using namespace std; void boost() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const long long mod = 1000000007; int tablica[2]; long long potega(long long base, long long pot) { if (pot == 0) return 1; if (pot == 1) return base; if (pot % 2 == 0) { long long res = potega(base, pot / 2); return ((res * res) % mod); } else return ((potega(base, pot - 1) * base) % mod); } int bs(int pocz, int kon, int szu) { int sr; while (pocz < kon) { sr = (pocz + kon) / 2; if (tablica[sr] >= szu) kon = sr; else pocz = sr + 1; } return pocz; } int n, k, a[1007], ile; void reset_arrays() { ile = 0; } void solve() { reset_arrays(); scanf( %d%d , &n, &k); for (int i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); for (int i = 1; i < n; i++) { int pom = (k - a[i]) / a[0]; ile += pom; } printf( %d n , ile); } int main() { int t = 1; scanf( %d , &t); while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long UNDEF = -1; const long long INF = 1e18; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; } static char stdinBuffer[1024]; static char *stdinDataEnd = stdinBuffer + sizeof(stdinBuffer); static const char *stdinPos = stdinDataEnd; void readAhead(size_t amount) { size_t remaining = stdinDataEnd - stdinPos; if (remaining < amount) { memmove(stdinBuffer, stdinPos, remaining); size_t sz = fread(stdinBuffer + remaining, 1, sizeof(stdinBuffer) - remaining, stdin); stdinPos = stdinBuffer; stdinDataEnd = stdinBuffer + remaining + sz; if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0; } } int readInt() { readAhead(16); int x = 0; bool neg = false; while (*stdinPos == || *stdinPos == n ) ++stdinPos; if (*stdinPos == - ) { ++stdinPos; neg = true; } while (*stdinPos >= 0 && *stdinPos <= 9 ) { x *= 10; x += *stdinPos - 0 ; ++stdinPos; } return neg ? -x : x; } char readCh() { readAhead(16); while (*stdinPos == || *stdinPos == n ) ++stdinPos; char ans = *stdinPos; ++stdinPos; return ans; } inline int rri() { char c; while (c = getchar(), c <= ) ; bool sign = c == - ; if (sign) { c = getchar(); } int res = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) { res = res * 10 + (c - 0 ); } return sign ? -res : res; } inline long long rrl() { char c; while (c = getchar(), c <= ) ; bool sign = c == - ; if (sign) { c = getchar(); } long long res = c - 0 ; while (c = getchar(), c >= 0 && c <= 9 ) { res = res * 10 + (c - 0 ); } return sign ? -res : res; } inline char rrc() { char c; while (c = getchar(), c <= ) ; return c; } inline int rrs(char *target) { char c; while (c = getchar(), c <= ) ; int idx = -1; target[++idx] = c; while (1) { c = getchar(); if (c <= ) { target[++idx] = 0 ; return idx; } target[++idx] = c; } } vector<vector<int> > matrixUnit(long long n) { vector<vector<int> > res(n, vector<int>(n)); for (long long i = 0; i < n; i++) res[i][i] = 1; return res; } vector<vector<int> > matrixMul(const vector<vector<int> > &a, const vector<vector<int> > &b) { long long n = a.size(); long long m = a[0].size(); long long k = b[0].size(); vector<vector<int> > res(n, vector<int>(k)); for (long long i = 0; i < n; i++) for (long long j = 0; j < k; j++) for (long long p = 0; p < m; p++) res[i][j] = (res[i][j] + (long long)a[i][p] * b[p][j]) % 1000000007LL; return res; } void matrixMult(vector<vector<int> > &res, const vector<vector<int> > &a, const vector<vector<int> > &b) { long long n = a.size(); long long m = a[0].size(); long long k = b[0].size(); for (long long i = 0; i < n; i++) for (long long j = 0; j < k; j++) { long long ans = 0; for (long long p = 0; p < m; p++) ans = (ans + (long long)a[i][p] * b[p][j]) % 1000000007LL; res[i][j] = ans; } } const int mn = 2004; bitset<mn> g[mn]; bool bf(int n) { vector<vector<int> > inp; inp.resize(n); for (int x = 0; x < n; x++) { inp[x].resize(n); for (int y = 0; y < n; y++) inp[x][y] = g[x][y]; } vector<vector<int> > a = inp; for (int k = 0; k < 500; k++) { bool ok = 1; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { if (a[i][j] == 0) { ok = 0; break; } } if (ok) return 1; a = matrixMul(a, inp); } return 0; } bitset<mn> h[mn]; bitset<mn> seen; bool solve2(int n) { queue<int> q; for (int x = 0; x < n; x++) { if (h[0][x]) q.push(x); } seen = h[0]; while (!q.empty()) { int x = q.front(); q.pop(); for (int y = 0; y < n; y++) { if ((!seen[y]) && h[x][y]) { q.push(y); seen[y] = true; } } } assert(seen.count() <= n); return (int)seen.count() == n; } bool solve(int n) { int spec = -1; for (int k = 0; k < n; k++) if (g[k][k]) spec = k; assert(spec != -1); for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) { int sx = (x == spec || x == 0) ? x ^ spec : x; int sy = (y == spec || y == 0) ? y ^ spec : y; h[sx][sy] = g[x][y]; } assert(h[0][0]); if (!solve2(n)) return 0; for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) { g[x][y] = h[y][x]; } for (int x = 0; x < n; x++) h[x] = g[x]; if (!solve2(n)) return 0; return 1; } void test() { srand(time(0) + clock() + rand()); for (int j = 0; j < 1000; j++) { int n = (rand() % 6) + 1; for (int x = 0; x < n; x++) { h[x].reset(); g[x].reset(); for (int y = 0; y < n; y++) g[x][y] = rand() & 1; } int k = rand() % n; g[k][k] = 1; bool b = bf(n); bool s = solve(n); if (b != s) { for (int x = 0; x < n; x++) { for (int y = 0; y < n; y++) printf( %d , (int)g[x][y]); printf( n ); } printf( b:%d s:%d n , b, s); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n = readInt(); for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) { int t = readInt(); t = (t > 0) ? 1 : 0; g[x][y] = t; } bool final = solve(n); if (final) printf( YES n ); else printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; scanf( %lld%lld , &n, &m); long long t = m / 2; if (t >= n) { printf( 0 n ); } else { if (m % 2 == 1) { printf( %lld n , min(t, n - (t + 1) + 1)); } else { printf( %lld n , min(t - 1, n - (t + 1) + 1)); } } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long M = 3e4 + 1; long long n, m, d; const long long K = 3e4 + 5; const long long huge = 1e15; long long dp[K][500]; long long a[K], ps[K]; long long solve(long long i, long long j) { if (i >= M) return 0; long long jj = j - (d - 250); if (dp[i][jj] != -1) return dp[i][jj]; long long ans = 0; if (j != 1) ans = a[i] + max(solve(i + j, j), max(solve(i + j + 1, j + 1), solve(i + j - 1, j - 1))); else ans = a[i] + max(solve(i + j, j), solve(i + j + 1, j + 1)); return dp[i][jj] = ans; } signed main() { ios::sync_with_stdio(0); cin.tie(0); ; cin >> n; cin >> d; while (n--) { cin >> m; a[m]++; } memset(dp, -1, sizeof dp); cout << a[0] + solve(d, d); } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; int n = s.length(); for (int i = 1; i < n - 1; i++) if (s[i] == s[i - 1] && s[i] == s[i + 1]) { if (s[i] == a ) s[i] = b ; else s[i] = a ; } for (int i = 1; i < n; i++) if (s[i] == s[i - 1]) { if (s[i] == a ) { if (i != n - 1 && s[i + 1] != b ) s[i] = b ; else s[i] = c ; } else if (s[i + 1] != a ) s[i] = a ; else if (s[i] != b ) s[i] = b ; else s[i] = c ; } cout << s; } |
#include <bits/stdc++.h> using namespace std; int a[5]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); cout << a[n / 2]; } |
#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin >> n >> m; if (n == 1) { cout << 1; exit(0); } cout << fixed << setprecision(12) << 1.0 / n + (1.0 * (n - 1)) / n * (1.0 * (m - 1)) / (m * n - 1); } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > p; int a[n + 1], b[n + 1]; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; for (int i = 1; i <= n; i++) { if (a[i] != b[i]) { for (int j = i + 1; j <= n; j++) { if (a[i] == b[j]) { for (int k = j; k > i; k--) { p.push_back(make_pair(k - 1, k)); swap(b[k], b[k - 1]); } break; } } } } cout << p.size() << endl; for (int i = 0; i < p.size(); i++) cout << p[i].first << << p[i].second << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int a[1002], b[1002], n, m; while (cin >> n >> m) { for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; double be = m; bool flag = 0; for (int i = n - 1; i >= 0; i--) { be = be * b[(i + 1) % n] / (b[(i + 1) % n] - 1); if (be > 1000000000) { flag = 1; break; } be = be * a[i] / (a[i] - 1); } if (flag) cout << -1 << endl; else cout << fixed << setprecision(10) << be - m << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { a %= 1000000007; long long int res = 1; while (b > 0) { if (b & 1) res = res * a % 1000000007; a = a * a % 1000000007; b >>= 1; } return res; } long long int modinv(long long int p) { return power(p, 1000000007 - 2); } vector<long long int> arr[200000]; long long int dp[100005][2] = {0}; void dfs(long long int s, long long int p, long long int a[]) { if (a[s] == 0) { long long int su = 1; dp[s][1] = 0; for (auto it : arr[s]) { if (it != p) { dfs(it, s, a); su *= (dp[it][0] + dp[it][1]); su %= 1000000007; } } dp[s][0] = su % 1000000007; for (auto it : arr[s]) { if (it != p) { if (dp[it][0] + dp[it][1] > 0) { dp[s][1] += (dp[it][1] * ((su * modinv(dp[it][0] + dp[it][1])) % 1000000007)) % 1000000007; dp[s][1] %= 1000000007; } } } } else { dp[s][0] = 0; dp[s][1] = 1; for (auto it : arr[s]) { if (it != p) { dfs(it, s, a); dp[s][1] *= (dp[it][0] + dp[it][1]) % 1000000007; dp[s][1] %= 1000000007; } } } } int main() { long long int n; cin >> n; long long int q; for (long long int x = 1; x < n; x++) { cin >> q; arr[q].push_back(x); arr[x].push_back(q); } long long int a[n]; for (int x = 0; x < n; x++) { cin >> a[x]; } dfs(0, -1, a); cout << dp[0][1] % 1000000007 << n ; } |
#include <bits/stdc++.h> const int N = 2e4 + 42, M = 1e6 + 61, LN = 16; struct edge { int to, next, w; } e[M << 1]; int head[M], cnt = 1, nc; void addedge(int x, int y, int z) { if (!y) return; e[++cnt] = (edge){y, x[head], z}, x[head] = cnt; e[++cnt] = (edge){x, y[head], 0}, y[head] = cnt; } int fa[N][LN], pt[N][LN], dep[N], eid[N]; std::vector<std::pair<int, int> > g[N]; void dfs(int x, int p) { x[fa][0] = p, x[pt][0] = ++nc; addedge(nc, x, 1e9); for (int i = 1; i < LN; i++) { x[fa][i] = x[fa][i - 1][fa][i - 1], x[pt][i] = ++nc; addedge(nc, x[pt][i - 1], 1e9), addedge(nc, x[fa][i - 1][pt][i - 1], 1e9); } for (auto [nx, id] : x[g]) if (nx != p) nx[eid] = id, nx[dep] = x[dep] + 1, dfs(nx, x); } int lca(int x, int y) { if (x[dep] < y[dep]) std::swap(x, y); for (int i = LN - 1; i >= 0; i--) if (x[fa][i][dep] >= y[dep]) x = x[fa][i]; if (x == y) return x; for (int i = LN - 1; i >= 0; i--) if (x[fa][i] != y[fa][i]) x = x[fa][i], y = y[fa][i]; return x[fa][0]; } int get(int x, int k) { for (int i = 0; i < LN; i++) if ((k >> i) & 1) x = x[fa][i]; return x; } void link(int p, int x, int y) { if (x == y) return; int sub = x[dep] - y[dep]; int k = 31 - __builtin_clz(sub); addedge(p, x[pt][k], 1e9); addedge(p, get(x, sub - (1 << k))[pt][k], 1e9); } int lv[M], cur[M]; bool bfs(int s, int t) { memset(lv, 0, sizeof lv); std::queue<int> q; for (s[lv] = 1, q.push(s); !q.empty(); q.pop()) for (int x = q.front(), i = x[cur] = x[head], nx; i; i = e[i].next) if (!(nx = e[i].to)[lv] && e[i].w) nx[lv] = x[lv] + 1, q.push(nx); return t[lv]; } int dfs(int s, int t, int f) { if (s == t || !f) return f; int r = 0, tt; for (int &i = s[cur], nx; i; i = e[i].next) if ((nx = e[i].to)[lv] == s[lv] + 1 && (tt = dfs(nx, t, std::min(f, (int)e[i].w)))) { e[i].w -= tt, e[i ^ 1].w += tt, r += tt, f -= tt; if (!f) return r; } if (f) s[lv] = 0; return r; } int dinic(int s, int t) { int r = 0; while (bfs(s, t)) r += dfs(s, t, 1e9); return r; } bool vis[M]; void dfs2(int x) { x[vis] = true; for (int i = x[head], nx; i; i = e[i].next) if (e[i].w && !(nx = e[i].to)[vis]) dfs2(nx); } std::vector<int> v1, v2; int n, m, S, T, c_pt[N]; int main() { scanf( %d%d , &n, &m), nc = n; for (int i = 1, x, y; i < n; i++) { scanf( %d%d , &x, &y); x[g].push_back({y, i}); y[g].push_back({x, i}); } dep[1] = 1, dfs(1, 0); S = ++nc, T = ++nc; for (int i = 1; i <= n; i++) addedge(i, T, 1); for (int i = 1, x, y; i <= m; i++) { scanf( %d%d , &x, &y); int l = lca(x, y), p = ++nc; c_pt[i] = p; addedge(S, p, 1); link(p, x, l), link(p, y, l); } printf( %d n , dinic(S, T)); dfs2(S); for (int i = 1; i <= m; i++) if (!c_pt[i][vis]) v1.push_back(i); for (int i = 2; i <= n; i++) if (i[vis]) v2.push_back(eid[i]); printf( %lu , v1.size()); for (int i : v1) printf( %d , i); puts( ); printf( %lu , v2.size()); for (int i : v2) printf( %d , i); puts( ); } |
#include <bits/stdc++.h> using namespace std; const double one = 1.0; const double PI = 3.14159265; const long long maxn = 2e3 + 10; const long long maxx = 1e6 + 10; const long double eps = 1e-14; const long long max_len = 1e6 + 1; const long long mod1 = 1000000007; const long long mod2 = 998244353; long long dp[maxn][maxn]; void solve() { long long n, k; cin >> n >> k; vector<long long> vl(n + 2); for (long long i = 1; i < long long(n + 1); i++) cin >> vl[i]; for (long long i = 0; i < long long(n + 1); i++) { for (long long j = 0; j < long long(n + 1); j++) dp[i][j] = 0; } for (long long i = 1; i < long long(n + 1); i++) { for (long long j = 0; j < long long(i + 1); j++) { dp[i][j] = max(dp[i][j], dp[i - 1][j] + (i - j == vl[i])); if (j > 0) dp[i][j] = max(dp[i - 1][j - 1], dp[i][j]); } } long long ans = 1000000000000000000; for (long long j = 0; j < long long(n + 1); j++) { if (dp[n][j] >= k) ans = min(ans, j); } if (ans >= 1000000000000000000) ans = -1; cout << ans << endl; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cerr.tie(0); long long t; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> int a, b, k; int main() { scanf( %d%d%d , &b, &a, &k); if (b + k < a) { printf( %.12f n , 0.0f); return 0; } double ans = 1; for (int i = 0; i <= k; i++) { ans *= (a - i); ans /= (b + 1 + i); } ans = 1 - ans; printf( %.12f n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int SZ = (int)3e7 + 10; int cnt[SZ]; int n[3], t[3], sum[3]; int main() { int k; cin >> k; for (int i = 0; i < 3; i++) cin >> n[i]; for (int i = 0; i < 3; i++) cin >> t[i]; for (int i = 0; i < 3; i++) sum[i] = 0; for (int tme = 0;; tme++) { int mn = k; for (int s = 0; s < 3; s++) { mn = min(mn, n[s] - sum[s]); } cnt[tme] = mn; k -= mn; if (k == 0) { printf( %d , tme + t[0] + t[1] + t[2]); return 0; } for (int s = 0; s < 3; s++) { sum[s] += mn; if (tme - t[s] + 1 >= 0) sum[s] -= cnt[tme - t[s] + 1]; } } return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, k; long double ans, eps = 1e-10, l, v1, v2; bool solve(long double mid) { int x = (n + k - 1) / k; long double tl = mid, pos = l; while (x--) { if (tl < 0) return 0; long double trav = (v2 * v1 * tl - v2 * pos) / (v1 - v2); if (trav > pos) return 0; long double oldTime = tl; tl -= trav / v2 + (trav - v1 * trav / v2) / (v1 + v2); pos -= v1 * (oldTime - tl); } return 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> l >> v1 >> v2 >> k; double long hi = 1e10, lo = 0; while (hi - lo >= eps) { long double mid = (hi + lo) / 2; if (solve(mid)) { ans = mid; hi = mid - eps; } else lo = mid + eps; } cout << setprecision(12) << ans; solve(ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 3010; const int MOD = 1000000007; int n, m; long long f[MAXN][MAXN], ans1, ans2, ans3, ans4; char a[MAXN][MAXN]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , a[i] + 1); if (a[1][2] == . ) f[1][2] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (i == 1 && j == 2) continue; if (a[i][j] == . ) f[i][j] = (f[i - 1][j] + f[i][j - 1]) % MOD; } ans1 = f[n - 1][m]; memset(f, 0, sizeof(f)); if (a[2][1] == . ) f[2][1] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (i == 2 && j == 1) continue; if (a[i][j] == . ) f[i][j] = (f[i - 1][j] + f[i][j - 1]) % MOD; } ans2 = f[n][m - 1]; memset(f, 0, sizeof(f)); if (a[1][2] == . ) f[1][2] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (i == 1 && j == 2) continue; if (a[i][j] == . ) f[i][j] = (f[i - 1][j] + f[i][j - 1]) % MOD; } ans3 = f[n][m - 1]; memset(f, 0, sizeof(f)); if (a[2][1] == . ) f[2][1] = 1; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (i == 2 && j == 1) continue; if (a[i][j] == . ) f[i][j] = (f[i - 1][j] + f[i][j - 1]) % MOD; } ans4 = f[n - 1][m]; memset(f, 0, sizeof(f)); printf( %I64d n , ((ans1 * ans2) % MOD - (ans3 * ans4) % MOD + MOD) % MOD); return 0; } |
#include <bits/stdc++.h> using namespace std; int a[212345], s1[212345], s2[212345], pos1[212345], pos2[212345], n; vector<pair<int, int> > res; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { s1[i] = s1[i - 1] + (a[i] == 1); s2[i] = s2[i - 1] + (a[i] == 2); } for (int i = n; i >= 1; i--) { pos1[s1[i]] = i; pos2[s2[i]] = i; } for (int i = 1; i <= n; i++) pos1[s1[n] + i] = pos2[s2[n] + i] = n + 1; for (int t = 1; t <= n; t++) { int curPos = 0; int win1 = 0; int win2 = 0; while (curPos < n) { curPos = min(pos1[s1[curPos] + t], pos2[s2[curPos] + t]); if (curPos <= n) { if (a[curPos] == 1) win1++; else win2++; } } if (curPos == n && win1 != win2 && ((win1 > win2) == (a[curPos] == 1))) res.push_back(make_pair(max(win1, win2), t)); } sort(res.begin(), res.end()); cout << (int)res.size() << endl; for (int i = 0; i < (int)res.size(); i++) cout << res[i].first << << res[i].second << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long d = 0; for (int i = 9; n > 0; i *= 10) { d += n; n -= i; } cout << d << endl; } |
#include <bits/stdc++.h> using namespace std; namespace FGF { const int N = 1e5 + 5, mo = 1e9 + 7, inv2 = (mo + 1) / 2; int a[N], b[N], pre[N], lst[N], nxt[N], sum[N << 2][4], ta[N << 2][2], n, st[N], tp, mi[N], mx[N], ans, cnt[N]; void pushtag(int ro, int l, int r, int x, int o) { sum[ro][3] = 1ll * x * sum[ro][o ^ 1] % mo; sum[ro][o] = 1ll * (r - l + 1) * x % mo; ta[ro][o] = x; if (!o) sum[ro][2] = 1ll * (r + l) * (r - l + 1) % mo * inv2 % mo * x % mo; } void pushdown(int ro, int l, int r) { for (int i = 0; i <= 1; i++) if (ta[ro][i]) pushtag(ro << 1, l, ((l + r) >> 1), ta[ro][i], i), pushtag(ro << 1 | 1, ((l + r) >> 1) + 1, r, ta[ro][i], i), ta[ro][i] = 0; } void pushup(int ro) { for (int i = 0; i < 4; i++) sum[ro][i] = (sum[ro << 1][i] + sum[ro << 1 | 1][i]) % mo; } void updat(int ro, int l, int r, int L, int R, int x, int o) { if (L <= l && r <= R) return pushtag(ro, l, r, x, o); pushdown(ro, l, r); if (L <= ((l + r) >> 1)) updat(ro << 1, l, ((l + r) >> 1), L, R, x, o); if (R > ((l + r) >> 1)) updat(ro << 1 | 1, ((l + r) >> 1) + 1, r, L, R, x, o); pushup(ro); } int query(int ro, int l, int r, int L, int R, int o) { if (L <= l && r <= R) return sum[ro][o]; pushdown(ro, l, r); return ((L <= ((l + r) >> 1) ? query(ro << 1, l, ((l + r) >> 1), L, R, o) : 0) + (R > ((l + r) >> 1) ? query(ro << 1 | 1, ((l + r) >> 1) + 1, r, L, R, o) : 0)) % mo; } void work() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), b[i] = a[i]; sort(b + 1, b + n + 1); for (int i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + n + 1, a[i]) - b; for (int i = 1; i <= n; i++) pre[i] = lst[a[i]] + 1, lst[a[i]] = i; for (int i = n; i; i--) lst[i] = n + 1; for (int i = n; i; i--) nxt[i] = lst[a[i]] - 1, lst[a[i]] = i; for (int i = n; i; i--) { while (tp && pre[i] > pre[st[tp]]) tp--; mx[i] = tp ? st[tp] - 1 : n, st[++tp] = i; } tp = 0; for (int i = n; i; i--) { while (tp && nxt[i] < nxt[st[tp]]) tp--; mi[i] = tp ? st[tp] - 1 : n, st[++tp] = i; } for (int i = n, j = n; i; i--) { updat(1, 1, n, i, mx[i], pre[i], 0), updat(1, 1, n, i, mi[i], nxt[i], 1); cnt[a[i]]++; while (cnt[a[i]] > 1) cnt[a[j]]--, j--; ans = (ans + 1ll * i * query(1, 1, n, i, j, 1) % mo + query(1, 1, n, i, j, 2) - 1ll * i * (i + j) % mo * (j - i + 1) % mo * inv2 % mo - query(1, 1, n, i, j, 3)) % mo; } printf( %d n , (ans + mo) % mo); } } // namespace FGF int main() { FGF::work(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double PI = 3.14159265; const double E = 2.718281828459; const double EPS = 1e-8; const int M = 2e5 + 5; long long n, A; long long a[M]; int main() { while (~scanf( %I64d %I64d , &n, &A)) { long long sumb = 0; for (int i = 0; i < n; i++) { scanf( %I64d , a + i); sumb += a[i]; } long long minb = n - 1; bool first = true; for (int i = 0; i < n; i++) { long long cnt = 0; long long x = A - minb; if (a[i] > x) cnt += a[i] - x; long long y = A - (sumb - a[i]); if (y > 0) cnt += y - 1; if (first) { printf( %I64d , cnt); first = false; } else printf( %I64d , cnt); } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; struct Node { int v; int id; } node[110]; int t[110]; bool cmp(Node x, Node y) { return x.v > y.v; } int main() { int n, w; cin.sync_with_stdio(false); while (cin >> n >> w) { for (int i = 0; i < n; i++) { cin >> node[i].v; node[i].id = i; } bool flag = true; for (int i = 0; i < n; i++) { if (node[i].v & 1) t[i] = node[i].v / 2 + 1, w -= t[i]; else t[i] = node[i].v / 2, w -= t[i]; if (w < 0) { flag = false; printf( -1 n ); break; } } if (!flag) continue; sort(node, node + n, cmp); for (int i = 0; i < n; i++) { if (w > (node[i].v - t[node[i].id])) { int d = node[i].v - t[node[i].id]; t[node[i].id] = node[i].v; w = w - d; } else { t[node[i].id] += w; break; } } for (int i = 0; i < n - 1; i++) cout << t[i] << ; cout << t[n - 1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 2; int n; struct Node { int l, r; }; Node a[maxn]; bool cmp(Node x, Node y) { if (x.r == y.r) return x.l < y.l; return x.r < y.r; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x, w; scanf( %d%d , &x, &w); a[i].l = x - w; a[i].r = x + w; } sort(a + 1, a + n + 1, cmp); int max = a[1].r, ans = 1; for (int i = 2; i <= n; i++) if (a[i].l >= max) { ans++; max = a[i].r; } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned int dp[100100]; char s[100100]; int main() { unsigned int n; cin >> n; if (n & 1) { return !printf( 0 ); } scanf( %s , s + 1); int m = n / 2; dp[0] = 1; for (int i = 1; i <= n; i++) { if (s[i] == ? ) { for (int j = i / 2; j >= max(1, i - m); j--) dp[j] += dp[j - 1]; } } for (int i = 1; i <= n; i++) { if (s[i] == ? ) continue; m--; } for (int i = 1; i <= m; i++) dp[n / 2] *= 25; cout << dp[n / 2] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int modInverse(int a, int m); int gcd(int a, int b); int power(int x, unsigned int y, unsigned int m); void pairsort(int a[], int b[], int n); int logint(int x, int y); int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int power(int x, unsigned int y, unsigned int m) { if (y == 0) return 1; int p = power(x, y / 2, m) % m; p = (p * p) % m; return (y % 2 == 0) ? p : (x * p) % m; } int modInverse(int a, int m) { int m0 = m; int y = 0, x = 1; if (m == 1) return 0; while (a > 1) { int q = a / m; int t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } void pairsort(int a[], int b[], int n) { pair<int, int> pairt[n]; for (int i = 0; i < n; i++) { pairt[i].first = a[i]; pairt[i].second = b[i]; } sort(pairt, pairt + n); for (int i = 0; i < n; i++) { a[i] = pairt[i].first; b[i] = pairt[i].second; } } int logint(int x, int y) { int ans = 0; int a = 1; for (int i = 0; i < x; i++) { if (x <= a) { return ans; } ans++; a *= y; } return -1; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int mink; int k = 0; int a[n]; for (int i = 0; i < n; i++) { int t; cin >> t; a[i] = t; if (i == 0) mink = t; else mink = min(mink, t); } for (int i = 0; i < n; i++) { int t = a[i]; if (t == mink) k++; } if (k > (n / 2)) { cout << Bob ; } else { cout << Alice ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int visit[210000]; int ans[210000]; queue<int> q; int a[210000]; int n; vector<int> g[210000]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { if (a[i] & 1) { q.push(i); visit[i] = 1; } if (i - a[i] >= 1) g[i - a[i]].push_back(i); if (i + a[i] <= n) g[i + a[i]].push_back(i); } while (!q.empty()) { int pos = q.front(); q.pop(); for (auto p : g[pos]) if (!visit[p]) { q.push(p); ans[p] = visit[p] = visit[pos] + 1; } } memset((visit), (0), sizeof(visit)); for (int i = 1; i <= n; i++) if (!(a[i] & 1)) { q.push(i); visit[i] = 1; } while (!q.empty()) { int pos = q.front(); q.pop(); for (auto p : g[pos]) if (!visit[p]) { q.push(p); ans[p] = visit[p] = visit[pos] + 1; } } for (int i = 1; i <= n; i++) cout << ans[i] - 1 << ; return ~~(0 ^ 0 ^ 0); } |
#include <bits/stdc++.h> using namespace std; const int P = 998244353, INF = 0x3f3f3f3f; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long qpow(long long a, long long n) { long long r = 1 % P; for (a %= P; n; a = a * a % P, n >>= 1) if (n & 1) r = r * a % P; return r; } long long inv(long long first) { return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P; } inline int rd() { int first = 0; char p = getchar(); while (p < 0 || p > 9 ) p = getchar(); while (p >= 0 && p <= 9 ) first = first * 10 + p - 0 , p = getchar(); return first; } const int N = 1e6 + 10; int n, m, a[N], w[N], s1, s0; int in[N]; int dp[55][55][55]; int solve(int a, int w) { memset(dp, 0, sizeof dp); dp[0][0][0] = 1; int ans = 0; if (a) { for (int i = 1; i <= m + 1; ++i) for (int j = 0; j <= i - 1; ++j) for (int k = 0; k <= j; ++k) if (dp[i - 1][j][k]) { int &r = dp[i - 1][j][k]; int now = w + k, tot = s1 + s0 + j - (i - 1 - j), p = (long long)now * in[tot] % P; dp[i][j + 1][k + 1] = (dp[i][j + 1][k + 1] + (long long)p * r) % P; now = s1 - w + j - k, p = (long long)now * in[tot] % P; dp[i][j + 1][k] = (dp[i][j + 1][k] + (long long)p * r) % P; now = s0 - (i - 1 - j), p = (long long)now * in[tot] % P; dp[i][j][k] = (dp[i][j][k] + (long long)p * r) % P; if (i - 1 == m) ans = (ans + (long long)(w + k) * r) % P; } return ans; } for (int i = 1; i <= m + 1; ++i) for (int j = 0; j <= i - 1; ++j) for (int k = 0; k <= min(w, j); ++k) if (dp[i - 1][j][k]) { int &r = dp[i - 1][j][k]; int now = w - k, tot = s0 + s1 - j + (i - 1 - j), p = (long long)now * in[tot] % P; dp[i][j + 1][k + 1] = (dp[i][j + 1][k + 1] + (long long)p * r) % P; now = s1 + (i - 1 - j), p = (long long)now * in[tot] % P; dp[i][j][k] = (dp[i][j][k] + (long long)p * r) % P; now = s0 - w - j + k, p = (long long)now * in[tot] % P; dp[i][j + 1][k] = (dp[i][j + 1][k] + (long long)p * r) % P; if (i - 1 == m) ans = (ans + (long long)(w - k) * r) % P; } return ans; } int main() { in[0] = 1; for (int i = 1; i <= N - 1; ++i) in[i] = inv(i); scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , a + i); for (int i = 1; i <= n; ++i) { scanf( %d , w + i); if (a[i]) s1 += w[i]; else s0 += w[i]; } for (int i = 1; i <= n; ++i) printf( %d n , solve(a[i], w[i])); } |
#include <bits/stdc++.h> using namespace std; inline int read() { int num = 0; char c = getchar(); if (c == - ) return -read(); while (c >= 0 && c <= 9 ) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } return num; } inline long long READ() { long long num = 0; char c = getchar(); if (c == - ) return -READ(); while (c >= 0 && c <= 9 ) { num = (num << 3) + (num << 1) + c - 0 ; c = getchar(); } return num; } struct prob { long long ss, sl, ts, tl; long double ps, psl, ptl; void input() { cin >> ss >> sl >> ts >> tl >> ps; ps = 1 - ps; psl = sl * ps; ptl = tl * ps; } }; int n, t; prob pr[1007]; inline bool cmp(const prob& a, const prob& b) { return a.tl * (1 - a.ps) / a.ps < b.tl * (1 - b.ps) / b.ps; } inline bool eq(const long double& a, const long double& b) { return a - b > -1e-16 && a - b < 1e-16; } inline bool sm(const long double& a, const long double& b) { return a - b < -1e-16; } inline bool bg(const long double& a, const long double& b) { return a - b > 1e-16; } long double dps[1007][1607], dpt[1007][1607]; int main() { scanf( %d%d , &n, &t); for (int i = 1; i <= n; i++) pr[i].input(); sort(pr + 1, pr + n + 1, cmp); for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) dps[i][j] = -((long long)0x7f7f7f7f7f7f7f7f); for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) dpt[i][j] = ((long long)0x7f7f7f7f7f7f7f7f); long double ansa = -((long long)0x7f7f7f7f7f7f7f7f), ansb = ((long long)0x7f7f7f7f7f7f7f7f); for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) { if (sm(dps[i][j], dps[i][j - 1]) || (eq(dps[i][j], dps[i][j - 1]) && bg(dpt[i][j], dpt[i][j - 1]))) { dps[i][j] = dps[i][j - 1]; dpt[i][j] = dpt[i][j - 1]; } if (j >= pr[i].ts + pr[i].tl) { long double wls = dps[i - 1][j - pr[i].ts - pr[i].tl] + pr[i].ss + pr[i].psl; long double wlt = (1 - pr[i].ps) * (dpt[i - 1][j - pr[i].ts - pr[i].tl] + pr[i].ts) + pr[i].ps * j; if (sm(dps[i][j], wls) || (eq(dps[i][j], wls) && bg(dpt[i][j], wlt))) { dps[i][j] = wls; dpt[i][j] = wlt; } } if (j >= pr[i].ts) { long double wls = dps[i - 1][j - pr[i].ts] + pr[i].ss; long double wlt = dpt[i - 1][j - pr[i].ts] + pr[i].ts; if (sm(dps[i][j], wls) || (eq(dps[i][j], wls) && bg(dpt[i][j], wlt))) { dps[i][j] = wls; dpt[i][j] = wlt; } } if (sm(dps[i][j], dps[i - 1][j]) || (eq(dps[i][j], dps[i - 1][j]) && bg(dpt[i][j], dpt[i - 1][j]))) { dps[i][j] = dps[i - 1][j]; dpt[i][j] = dpt[i - 1][j]; } if (sm(ansa, dps[i][j]) || (eq(ansa, dps[i][j]) && bg(ansb, dpt[i][j]))) { ansa = dps[i][j]; ansb = dpt[i][j]; } } return printf( %.15Lf %.15Lf n , ansa, ansb), 0; } |
#include <bits/stdc++.h> using namespace std; long long num[505]; int n; long long minval = 0x3f3f3f3f3f3f3f3fll; long long check(int x) { long long ans = 0; for (int i = 1; i <= n; i++) { if (num[i] % x == 0) { ans += num[i] / x; } else { if (num[i] % x + num[i] / x >= x - 1) { ans += num[i] / x + 1; } else { return 0; } } } return ans; } void solve(int x) { long long t = check(x); if (t) { printf( %I64d n , t); exit(0); } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %I64d , &num[i]); minval = min(minval, num[i]); } long long t = (long long)sqrt(minval); for (long long i = 1; i <= t; i++) { solve(minval / i + 1); solve(minval / i); solve(minval / i - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; double tick() { static clock_t oldt, newt = clock(); double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC; oldt = newt; return diff; } inline long long int read() { long long int f = 1, x = 0; 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 int fastExpo(long long int a, long long int n) { long long int res = 1; while (n) { if (n % 2) res = res * a; n /= 2; a = a * a; } return res; } int dx[] = {-1, 0, 1, 0}; int dy[] = {0, 1, 0, -1}; vector<int> v[200010]; int col[200010]; vector<int> l, r; void dfs(int n, int c) { col[n] = c; for (int j : v[n]) { if (col[j] == -1) dfs(j, 1 - c); } } int main() { int t = read(); while (t--) { int n = read(), m = read(); while (m--) { int a, b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a); } for (int i = 1; i <= n; i++) col[i] = -1; dfs(1, 0); long long int c1 = 0, c2 = 0; for (int i = 1; i <= n; i++) { if (col[i]) c1++; else c2++; } if (c1 <= n / 2) { cout << c1 << endl; for (int i = 1; i <= n; i++) if (col[i]) cout << i << ; } else { cout << c2 << endl; for (int i = 1; i <= n; i++) if (!col[i]) cout << i << ; } cout << endl; for (int i = 1; i <= n; i++) v[i].clear(), col[i] = -1; } cerr << execution time is: << tick() << n ; } |
#include <bits/stdc++.h> using namespace std; int a[100100]; int main() { int i, n; scanf( %d , &n); for (i = 0; i < n; i++) scanf( %d , &a[i]); sort(a, a + n); int sign = 1; for (i = 0; i < n; i++) { if (a[i] >= sign) { a[i] = sign; sign++; } } printf( %d n , sign); return 0; } |
#include<bits/stdc++.h> typedef int LL; typedef double dl; #define opt operator #define pb push_back #define pii std::pair<LL,LL> const LL maxn=2e4+9,mod=998244353,inf=0x3f3f3f3f; LL Read(){ LL x(0),f(1); char c=getchar(); while(c< 0 || c> 9 ){ if(c== - ) f=-1; c=getchar(); } while(c>= 0 && c<= 9 ){ x=(x<<3ll)+(x<<1ll)+c- 0 ; c=getchar(); }return x*f; } void Chkmin(LL &x,LL y){ if(y<x) x=y; } void Chkmax(LL &x,LL y){ if(y>x) x=y; } LL add(LL x,LL y){ return x+=y,x>=mod?x-mod:x; } LL dec(LL x,LL y){ return x-=y,x<0?x+mod:x; } LL mul(LL x,LL y){ return 1ll*x*y%mod; } LL Pow(LL base,LL b){ LL ret(1); while(b){ if(b&1) ret=mul(ret,base); base=mul(base,base); b>>=1; }return ret; } const LL Ul=15,Ku=30; namespace Rmq{ LL lg[maxn]; pii mx[maxn][16]; void Init(LL *A,LL N){ for(LL i=1;i<=N;++i){ mx[i][0]=pii(A[i],i); } for(LL i=1;i<=15;++i){ for(LL j=1;j+(1<<i)-1<=N;++j){ mx[j][i]=std::max(mx[j][i-1],mx[j+(1<<i-1)][i-1]); } } for(LL i=1;i<=N;++i) lg[i]=lg[i>>1]+1; } LL Query(LL l,LL r){ LL len(lg[r-l+1]-1); return std::max(mx[l][len],mx[r-(1<<len)+1][len]).second; } } LL n,q; LL a[maxn],f[16][maxn][31]; void Init(){ n=Read(); q=Read(); for(LL i=1;i<=n;++i){ a[i]=Read(); } for(LL i=1;i<=n+1;++i){ a[i]+=i; } // for(LL i=1;i<=n;++i) printf( %d ,a[i]-i); puts( ); Rmq::Init(a,n+1); // puts( #1 ); for(LL j=0;j<=Ul;++j){ for(LL k=0;k<=Ku;++k) f[j][n+1][k]=n+1; } // puts( #2 ); for(LL i=n;i>=1;--i){ // printf( (%d) n ,i); for(LL k=0;k<=Ku;++k){ f[0][i][k]=std::min(a[i]+k,n+1); } for(LL j=1;j<=Ul;++j){ for(LL k=0;k<=Ku;++k){ LL mx(0); for(LL k1=k;k1>=0 && mx<n;--k1){ Chkmax(mx,f[j-1][Rmq::Query(i,f[j-1][i][k1])][k-k1]); } f[j][i][k]=mx; } } } } void Solve(LL l,LL r,LL K){ static LL g[31]; if(l==r){ puts( 0 ); return; } Chkmin(K,r-l-1); for(LL i=0;i<=Ku;++i){ g[i]=std::min(n+1,a[l]+i); } LL ret(1); for(LL i=0;i<=K;++i) if(g[i]>=r){ puts( 1 ); return; } for(LL i=Ul;i>=0;--i){ LL flag(0); static LL h[31]; for(LL k=K;k>=0;--k){ LL mx(0); for(LL k1=0;k1<=k && mx<r;++k1){ Chkmax(mx,f[i][Rmq::Query(l,g[k1])][k-k1]); } h[k]=mx; if(mx>=r){ flag=1; break; } } if(!flag){ for(LL k=0;k<=Ku;++k) g[k]=h[k]; ret+=(1<<i); } } printf( %d n ,ret+1); // exit(0); } void Solve(){ while(q--){ LL l(Read()),r(Read()),K(Read()); Solve(l,r,K); } } int main(){ Init(); Solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[1001]; long long b[2001]; int main() { long long n, k, p; cin >> n >> k >> p; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) cin >> b[i]; sort(a + 1, a + n + 1); sort(b + 1, b + k + 1); long long ans = (long long)2e15 + 1; for (int i = 1; i <= k - n + 1; i++) { long long maks = 0; for (int j = 1; j <= n; j++) { maks = max(abs(a[j] - b[i + j - 1]) + abs(b[i + j - 1] - p), maks); } ans = min(maks, ans); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int s1, s2, t1, t2; char ch1, ch2; cin >> s1 >> ch1 >> s2; cin >> t1 >> ch2 >> t2; int a = s1 - t1; int b = s2 - t2; if (b < 0) { b += 60; a--; } if (a < 0) { a += 24; } cout << right << setw(2) << setfill( 0 ) << a << : ; cout << right << setw(2) << setfill( 0 ) << b << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, a; cin >> n >> a; int arr[n]; int sum = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sum += (n - 1) * 10; if (sum > a) { cout << -1 << endl; } else { cout << (n - 1) * 2 + (a - sum) / 5 << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000 + 5; vector<int> g[N]; bool used[N]; int n, m; int main() { scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { int u, v; scanf( %d %d , &u, &v); u--, v--; g[u].push_back(v); } for (int i = 0; i < n; i++) { if (!used[i]) { for (auto x : g[i]) { if (x > i) used[x] = true; } } } for (int i = n - 1; i >= 0; i--) { if (!used[i]) { for (auto x : g[i]) { used[x] = true; } } } int ans = 0; for (int i = 0; i < n; i++) { if (!used[i]) ans++; } printf( %d n , ans); for (int i = 0; i < n; i++) { if (!used[i]) printf( %d , i + 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 500 + 5; const int maxM = 100000 + 5; inline long long read() { long long sum = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { sum = sum * 10 + ch - 0 ; ch = getchar(); } return f * sum; } int dp[maxN][maxN]; char G[maxN][maxN]; const int dr[] = {1, 0}; const int dc[] = {0, 1}; int main() { ios::sync_with_stdio(false); int n = read(), m = read(), len = (n + m) / 2; for (int i = 1; i <= n; i++) scanf( %s , G[i] + 1); if (G[1][1] != G[n][m]) { printf( 0 n ); return 0; } dp[1][n] = 1; for (int k = 2; k <= len; k++) { for (int i = k; i >= 1; i--) { int x1 = i, y1 = 1 + k - x1; if (x1 > n || y1 < 1 || y1 > m) continue; for (int j = n - k + 1; j <= n; j++) { int x2 = j, y2 = n + m - k - x2 + 1; if (x2 < 1 || x2 > n || y2 < 1 || y2 > m) continue; else if (G[x1][y1] != G[x2][y2]) { dp[x1][x2] = 0; continue; } dp[x1][x2] = (dp[x1][x2] + dp[x1][x2 + 1]) % 1000000007; dp[x1][x2] = (dp[x1][x2] + dp[x1 - 1][x2]) % 1000000007; dp[x1][x2] = (dp[x1][x2] + dp[x1 - 1][x2 + 1]) % 1000000007; } } } int ans = 0; if ((n + m) % 2 == 0) { for (int x1 = 1; x1 <= len; x1++) { int y1 = 1 + len - x1; if (x1 >= 1 && x1 <= n && y1 >= 1 && y1 <= m) ans = (ans + dp[x1][x1]) % 1000000007; } } else { for (int x1 = 1; x1 <= len; x1++) { int y1 = 1 + len - x1; if (x1 < 1 || x1 > n || y1 < 1 || y1 > m) continue; if (y1 + 1 <= m) ans = (ans + dp[x1][x1]) % 1000000007; if (x1 + 1 <= n) ans = (ans + dp[x1][x1 + 1]) % 1000000007; } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> int main() { long int n, s, sum = 0, z, count = 0; scanf( %ld%ld , &n, &s); z = s; do { if (s >= n) { sum = sum + (s / n) * n; count = count + (s / n); s = s - (s / n) * n; } else n = n - 1; } while (s != 0 && n != 0); printf( %ld , count); return 0; } |
#include <bits/stdc++.h> const double EPS = 0.00000001; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int32_t t; std::cin >> t; for (int32_t cs = 1; cs <= t; cs++) { int32_t n, l; std::cin >> n >> l; std::vector<int32_t> a(n); for (auto &x : a) { std::cin >> x; } int32_t indL = 0, indR = n - 1, speed1 = 1, speed2 = 1; double pos1 = 0, pos2 = l; double currT = 0.0, ans; while (1) { if (indL > indR) { ans = currT + (pos2 - pos1) / (speed1 + speed2); break; } double t1 = ((double)a[indL] - pos1) / speed1; double t2 = ((double)pos2 - a[indR]) / speed2; if (indL == indR) { if (fabs(t1 - t2) < EPS) { ans = currT + t1; break; } } if (t1 < t2) { indL++; currT += t1; speed1++; pos1 = a[indL - 1]; pos2 -= t1 * speed2; } else { indR--; currT += t2; speed2++; pos1 += t2 * speed1; pos2 = a[indR + 1]; } } std::cout << std::fixed << std::setprecision(8); std::cout << ans << n ; } } |
#include <bits/stdc++.h> using namespace std; void solve() {} const long long maxn = 1050; long long n, a, b; long long ans[maxn][maxn]; void no() { cout << NO << n ; exit(0); } signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> a >> b; if (min(a, b) > 1) no(); if ((n == 2 or n == 3) and a == 1 and b == 1) no(); long long c = 1, d = 0; if (b != 1) { swap(a, b); swap(c, d); } for (long long i = 1; i <= n; i++) { ans[i][i] = 0; for (long long j = 1; j <= n; j++) { if (i != j) { ans[i][j] = ans[j][i] = d; } } } for (long long i = a; i + 1 <= n; i++) { ans[i][i + 1] = ans[i + 1][i] = c; } cout << YES << n ; for (long long i = 1; i <= n; i++) { for (long long j = 1; j <= n; j++) { cout << ans[i][j]; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; int main() { int i, n; int a, b, c; int sum_a, sum_b, sum_c; sum_a = 0; sum_b = 0; sum_c = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> a >> b >> c; sum_a = sum_a + a; sum_b = sum_b + b; sum_c = sum_c + c; } if (sum_a == 0 && sum_b == 0 && sum_c == 0) { cout << YES << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[1001][2 * 1001][2]; long long MOD = 998244353; int main() { ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; dp[1][1][0] = 2; dp[1][2][0] = 0; dp[1][1][1] = 0; dp[1][2][1] = 2; for (int i = 2; i <= n; ++i) { for (int j = 1; j <= min(2 * n, k); ++j) { dp[i][j][0] = dp[i - 1][j][0] + dp[i - 1][j - 1][0] + dp[i - 1][j][1] * 2; dp[i][j][0] %= MOD; dp[i][j][1] = dp[i - 1][j][1] + dp[i - 1][j - 2][1] + dp[i - 1][j - 1][0] * 2; dp[i][j][1] %= MOD; } } cout << (dp[n][k][0] + dp[n][k][1]) % MOD << n ; } |
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double eps = 1e-6; const long long _mod = 1000000007LL; const int save[10][4] = {{0}, {0}, {6, 2, 4, 8}, {1, 3, 9, 7}, {6, 4}, {0}, {0}, {1, 7, 9, 3}, {6, 8, 4, 2}, {1, 9}}; int todigit(char c) { return (isdigit(c)) ? (c - 48) : c; } int toint(string s) { int r = 0; istringstream sin(s); sin >> r; return r; } long long tolong(string s) { long long r = 0; istringstream sin(s); sin >> r; return r; } double todouble(string s) { double r = 0.0; istringstream sin(s); sin >> r; return r; } bool bit_check(int k, int p) { return (bool)(k & (1 << p)); } int bit_set(int k, int p) { return k = (k | (1 << p)); } template <class T> string toString(T n) { ostringstream ost; ost << n; ost.flush(); return ost.str(); } template <class T> T Abs(T x) { return x > 0 ? x : -x; } template <class T> T power(T N, T P) { return (P == 0) ? 1 : N * power(N, P - 1); } template <class T> inline T max_(T a, T b) { return a > b ? a : b; } template <class T> inline T min_(T a, T b) { return a < b ? a : b; } template <class T> inline T gcd(T a, T b) { if (a < 0) return gcd(-a, b); if (b < 0) return gcd(a, -b); return (b == 0) ? a : gcd(b, a % b); } template <class T> inline T lcm(T a, T b) { if (a < 0) return lcm(-a, b); if (b < 0) return lcm(a, -b); return a * (b / gcd(a, b)); } int di(string num, int b); int dig(int num); int main() { int a, b; cin >> a >> b; int mn = max(dig(a), dig(b)); mn++; int mx = 0; for (int i = mn; i < 17; ++i) { mx = max(mx, di(toString(a + b), i)); } printf( %d n , mx); return 0; } int di(string num, int b) { int n = 0; for (int i = 0; i < num.size(); ++i) { n = (n * b) + (num[i] - 0 ); } int cnt = 0; while (n) { n = n / b; ++cnt; } return cnt; } int dig(int num) { int mn = 0; while (num) { mn = max(mn, num % 10); num = num / 10; } return mn; } |
#include <bits/stdc++.h> using namespace std; int n, mem[505][505]; string s; int dp(int i, int j) { if (i > j) return 0; int &ans = mem[i][j]; if (ans != -1) return ans; ans = dp(i + 1, j) + 1; for (int k = i + 1; k <= j; k++) if (s[i] == s[k]) ans = min(ans, dp(i + 1, k - 1) + dp(k, j)); return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); memset(mem, -1, sizeof(mem)); cin >> n >> s; cout << dp(0, n - 1) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n][2]; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; } int sum1 = 0; int sum2 = 0; for (int i = 0; i < n; i++) { if (abs(sum1 + a[i][0] - sum2) <= 500) { sum1 += a[i][0]; a[i][0] = -1; } else { sum2 += a[i][1]; } } if (abs(sum1 - sum2) > 500) { cout << -1 ; } else { for (int i = 0; i < n; i++) { if (a[i][0] == -1) { cout << A ; } else { cout << G ; } } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, j; cin >> t; for (j = 0; j <= t - 1; j++) { int a, b, c, n; cin >> a >> b >> n; n = n % 3; c = a ^ b; if (n == 0) { cout << a << endl; } else if (n == 1) { cout << b << endl; } else { cout << c << endl; } } } |
#include <bits/stdc++.h> char _; using namespace std; int N, C, D; pair<int, int> A[400000]; long long Z, ZO, ZOZ, O, OZ, OZO; inline bool cmp(const pair<int, int>& a, const pair<int, int>& b) { if ((b.second < 0) ^ (a.second < 0)) return 1LL * a.first * b.second > 1LL * b.first * a.second; return 1LL * a.first * b.second < 1LL * b.first * a.second; } inline bool eq(const pair<int, int>& a, const pair<int, int>& b) { return 1LL * a.first * b.second == 1LL * b.first * a.second; } int main() { do { while ((N = getchar()) < 0 ) ; for (N -= 0 ; 0 <= (_ = getchar()); N = (N << 3) + (N << 1) + _ - 0 ) ; } while (0); do { while ((C = getchar()) < 0 ) ; for (C -= 0 ; 0 <= (_ = getchar()); C = (C << 3) + (C << 1) + _ - 0 ) ; } while (0); do { while ((D = getchar()) < 0 ) ; for (D -= 0 ; 0 <= (_ = getchar()); D = (D << 3) + (D << 1) + _ - 0 ) ; } while (0); for (int i = 0; i < N; i++) { do { while ((A[i].first = getchar()) < 0 ) ; for (A[i].first -= 0 ; 0 <= (_ = getchar()); A[i].first = (A[i].first << 3) + (A[i].first << 1) + _ - 0 ) ; } while (0); do { while ((A[i].second = getchar()) < 0 ) ; for (A[i].second -= 0 ; 0 <= (_ = getchar()); A[i].second = (A[i].second << 3) + (A[i].second << 1) + _ - 0 ) ; } while (0); A[i].first -= C, A[i].second -= D; } sort(A, A + N, cmp); for (int i = 0, j; i < N; i = j) { long long NZ = Z, NZO = ZO, NZOZ = ZOZ, NO = O, NOZ = OZ, NOZO = OZO; for (j = i; j < N && eq(A[i], A[j]); j++) { if (A[j].second < 0) { NOZO += OZ; NZO += Z; NO++; } else { NZOZ += ZO; NOZ += O; NZ++; } } Z = NZ, ZO = NZO, ZOZ = NZOZ, O = NO, OZ = NOZ, OZO = NOZO; } int L = 0, R = 0, D = 0; for (int i = 0; i < N; i++) if (A[i].second == 0) { if (A[i].first < 0) L++; else R++; } for (int i = 0; i < N; i++) if (A[i].second < 0) D++; printf( %lld n , OZO + ZOZ - 1LL * L * R * D); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3F3F3F3F; const int NEGINF = 0xC0C0C0C0; const double EPS = 1e-8; int cmp(double x, double y = 0, double tol = EPS) { return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1; } string s; bool test(long long inx) { int pos = 0; int m = 0; int im = 0; for (auto &x : s) { if (x == R ) pos++; else pos--; if (inx >= 0 && pos == inx) pos--; if (pos < m) { m = pos; im = &x - &(s[0]); } } return im == s.size() - 1; } int main() { cin >> s; if (s.back() == R ) for (auto &x : s) x = R + L - x; if (test(-1)) { cout << 1 n ; return 0; } else if (!test(1)) { cout << 0 n ; return 0; } long long m = 1, M = 0x7fffffffffffffffll; long long ans = 1; while (M >= m) { long long med = m + (M - m) / 2; if (test(med)) { ans = med; m = med + 1; } else M = med - 1; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[500005]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int kk = 1; sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { if (a[i] >= a[kk] * 2) { ++kk; } } --kk; kk = min(n / 2, kk); printf( %d n , n - kk); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200005; int now[30]; char s[maxn]; int num[maxn]; int main() { int n; scanf( %d , &n); scanf( %s , s + 1); int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= 30; j++) { if (s[i] >= now[j]) { num[i] = j; now[j] = s[i]; ans = max(ans, j); break; } } } printf( %d n , ans); for (int i = 1; i <= n; i++) { printf( %d , num[i]); } printf( n ); } |
#include <bits/stdc++.h> using namespace std; int read() { char ch; for (ch = getchar(); ch < 0 || ch > 9 ; ch = getchar()) ; int x = ch - 0 ; for (ch = getchar(); ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; return x; } const int N = 3e5 + 5; int n, m, q, p[N], u[N], v[N]; struct Graph { int t[N << 1], nxt[N << 1], lst[N], l; void add(int x, int y) { t[++l] = y; nxt[l] = lst[x]; lst[x] = l; } int n, dfn[N], low[N], sta[N], col[N], top, tot, id; void init(int N) { n = N; l = 1; tot = id = 0; for (int i = 1; i <= n; i++) col[i] = low[i] = dfn[i] = lst[i] = 0; } void tarjan(int x, int y) { dfn[x] = low[x] = ++tot; sta[++top] = x; for (int i = lst[x]; i; i = nxt[i]) { if (i == y) continue; if (!dfn[t[i]]) { tarjan(t[i], i ^ 1); low[x] = min(low[x], low[t[i]]); } else low[x] = min(low[x], dfn[t[i]]); } if (dfn[x] == low[x]) for (sta[top + 1] = 0, id++; sta[top + 1] != x; top--) col[sta[top]] = id; } } g1, g2; struct Tree { int t[N << 1], nxt[N << 1], lst[N], l; void add(int x, int y) { t[++l] = y; nxt[l] = lst[x]; lst[x] = l; } int dfn[N], ed[N], dep[N], fa[N][19], tot; void dfs(int x, int y) { dfn[x] = ++tot; fa[x][0] = y; dep[x] = dep[y] + 1; for (int i = lst[x]; i; i = nxt[i]) if (t[i] != y) dfs(t[i], x); ed[x] = tot; } void init(int n) { for (int i = 1; i <= n; i++) if (!dfn[i]) dfs(i, 0); for (int j = 1; j <= 18; j++) for (int i = 1; i <= n; i++) fa[i][j] = fa[fa[i][j - 1]][j - 1]; } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); for (int j = 18; j >= 0; j--) if (dep[fa[x][j]] > dep[y]) x = fa[x][j]; x = dep[x] == dep[y] ? x : fa[x][0]; for (int j = 18; j >= 0; j--) if (fa[x][j] != fa[y][j]) x = fa[x][j], y = fa[y][j]; return x == y ? x : fa[x][0]; } } t; bool cmp(int x, int y) { return t.dfn[x] < t.dfn[y]; } int sta[N], pr[N], id[N], sz, top; vector<int> pt; void build() { sort(pt.begin(), pt.end(), cmp); sz = pt.size(); for (int i = 1; i <= sz - 1; i++) { int x = t.lca(pt[i], pt[i - 1]); if (x) pt.push_back(x); } sort(pt.begin(), pt.end(), cmp); sz = unique(pt.begin(), pt.end()) - pt.begin(); while (pt.size() > sz) pt.pop_back(); for (int i = 0; i <= sz - 1; i++) pr[pt[i]] = 0; top = 0; for (int i = 0; i < sz; i++) { for (; top && t.ed[sta[top]] < t.dfn[pt[i]]; top--) ; if (top) pr[pt[i]] = sta[top]; sta[++top] = pt[i]; } g2.init(sz); for (int i = 0; i <= sz - 1; i++) id[pt[i]] = i + 1; for (int i = 0; i <= sz - 1; i++) { int x = id[pr[pt[i]]], y = i + 1; if (x) g2.add(x, y), g2.add(y, x); } } int main() { n = read(); m = read(); q = read(); g1.init(n); for (int i = 1; i <= m; i++) { u[i] = read(); v[i] = read(); g1.add(u[i], v[i]); g1.add(v[i], u[i]); } for (int i = 1; i <= n; i++) if (!g1.dfn[i]) g1.tarjan(i, 0); for (int i = 1; i <= m; i++) { int x = g1.col[u[i]], y = g1.col[v[i]]; if (x != y) t.add(x, y), t.add(y, x); } t.init(g1.id); int cnt = 0; for (int ty = 1; ty <= q; ty++) { int nn = read(), mm = read(); pt.clear(); for (int i = 1; i <= nn; i++) { p[i] = g1.col[(read() + cnt + n - 1) % n + 1]; pt.push_back(p[i]); } for (int i = 1; i <= mm; i++) { u[i] = g1.col[(read() + cnt + n - 1) % n + 1]; v[i] = g1.col[(read() + cnt + n - 1) % n + 1]; pt.push_back(u[i]); pt.push_back(v[i]); } build(); for (int i = 1; i <= mm; i++) { int x = id[u[i]], y = id[v[i]]; if (x != y) g2.add(x, y), g2.add(y, x); } for (int i = 1; i <= sz; i++) if (!g2.dfn[i]) g2.tarjan(i, 0); bool ok = 1; for (int i = 2; i <= nn; i++) if (g2.col[id[p[i]]] != g2.col[id[p[1]]]) { ok = 0; break; } if (ok) { puts( YES ); (cnt += ty) %= n; } else puts( NO ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 305; long long dist[10][N][N], I[2][N][N]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { if (i != j) dist[0][i][j] = INT_MIN; I[0][i][j] = dist[0][i][j]; } for (int i = 1; i <= m; i++) { int x, y, c1, c2; cin >> x >> y >> c1 >> c2; dist[0][x][y] = c1; dist[0][y][x] = c2; } for (int c = 1; c < 10; c++) { for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dist[c][i][j] = dist[c - 1][i][j]; for (int i = 1; i <= n; i++) for (int k = 1; k <= n; k++) for (int j = 1; j <= n; j++) dist[c][i][j] = max(dist[c][i][j], dist[c - 1][i][k] + dist[c - 1][k][j]); } bool ok = 0; for (int i = 1; i <= n; i++) if (dist[9][i][i] > 0) { ok = 1; break; } if (!ok) { cout << 0; return 0; } int ans = 1; for (int bit = 9; bit >= 0; bit--) { ok = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) I[1][i][j] = I[0][i][j]; for (int i = 1; i <= n; i++) for (int k = 1; k <= n; k++) for (int j = 1; j <= n; j++) I[1][i][j] = max(I[1][i][j], I[0][i][k] + dist[bit][k][j]); for (int i = 1; i <= n; i++) if (I[1][i][i] > 0) { ok = 1; break; } if (!ok) { ans += (1 << bit); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) I[0][i][j] = I[1][i][j]; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 200025; int n, m, i, j, t, k, s, mod, a[maxn], fat[maxn]; bool flg, vis[maxn << 1]; inline int Pow(int x, int y, int mo) { int ret = 1; while (y) { if (y & 1) ret = 1ll * ret * x % mo; x = 1ll * x * x % mo; y >>= 1; } return ret; } int father(int x) { return x == fat[x] ? x : fat[x] = father(fat[x]); } void solve(int delt) { for (i = 1; i <= n; ++i) fat[i] = i; for (i = 1; i <= n; ++i) { k = (a[i] - delt + mod) % mod; t = lower_bound(a + 1, a + n + 1, k) - a; if (a[t] == k) fat[father(t)] = father(i); } t = 0; for (i = 1; i <= n; ++i) { if (fat[i] == i) t++; else fat[i] = i; } delt = delt * 1ll * Pow(t, mod - 2, mod) % mod; for (i = 1; i <= n; ++i) { k = (a[i] - delt + mod) % mod; t = lower_bound(a + 1, a + n + 1, k) - a; if (a[t] == k) fat[father(t)] = father(i); } for (i = 2; i <= n; ++i) if (father(i) ^ father(1)) break; if (i > n) { for (i = 1; i <= n; ++i) { k = (a[i] - delt + mod) % mod; t = lower_bound(a + 1, a + n + 1, k) - a; if (a[t] != k) break; } if (i > n) { if (flg) printf( %d %d n , a[1], delt); else t = (1ll * n * delt + a[1]) % mod, printf( %d %d n , t, delt); } else { if (flg) printf( %d %d n , a[i], delt); else t = (1ll * n * delt + a[i]) % mod, printf( %d %d n , t, delt); } exit(0); } } int main() { scanf( %d%d , &mod, &n); for (i = 1; i <= n; ++i) scanf( %d , &a[i]); a[n + 1] = mod + 114514; if (n == 1 || n == mod) { printf( %d %d n , a[1], 1); return 0; } if (n == 2) { printf( %d %d n , a[1], (a[2] - a[1] + mod) % mod); return 0; } sort(a + 1, a + n + 1); flg = 1; if (2 * n > mod) { flg = 0; for (i = 1; i <= n; ++i) vis[a[i]] = 1; n = 0; for (i = 0; i < mod; ++i) if (!vis[i]) a[++n] = i; a[n + 1] = mod + 114514; if (n == 1) { printf( %d %d n , (a[1] + 1) % mod, 1); return 0; } } solve(a[2] - a[1]); solve((a[1] - a[2] + mod) % mod); puts( -1 ); return 0; } |
#include <bits/stdc++.h> using namespace std; char mainstr[111111]; char substr1[111]; char substr2[111]; int main() { while (scanf( %s %s %s , mainstr, substr1, substr2) != EOF) { bool flag1 = false, flag2 = false; int len = strlen(mainstr); int len1 = strlen(substr1); int len2 = strlen(substr2); char *pos = search(mainstr, mainstr + len, substr1, substr1 + len1); if (pos != mainstr + len && search(pos + len1, mainstr + len, substr2, substr2 + len2) != mainstr + len) flag1 = true; reverse(mainstr, mainstr + len); pos = search(mainstr, mainstr + len, substr1, substr1 + len1); if (pos != mainstr + len && search(pos + len1, mainstr + len, substr2, substr2 + len2) != mainstr + len) flag2 = true; if (flag1 && flag2) printf( both n ); else if (flag1) printf( forward n ); else if (flag2) printf( backward n ); else printf( fantasy n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; const double pi = acos(-1); long long n; string str; int main() { cin >> n >> str; sort(str.begin(), str.end()); cout << str << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 10, LG = 20; int n, h[N], st[N], en[N], par[N][LG], seg[N << 2], lazy[N << 2], TM, ver[N], ans[N]; vector<int> adj[N]; struct Query { int l, r, id; Query(int x = 0, int y = 0, int z = 0) { l = x, r = y, id = z; } }; vector<Query> query[N]; void dfs(int v) { st[v] = TM++; ver[st[v]] = h[v]; for (int i = 1; i < LG; i++) par[v][i] = par[par[v][i - 1]][i - 1]; for (auto u : adj[v]) if (u != par[v][0]) { par[u][0] = v; h[u] = h[v] + 1; dfs(u); } en[v] = TM; } int k_par(int v, int k) { for (int i = 0; i < LG; i++) if (k >> i & 1) v = par[v][i]; return v; } int lca(int v, int u) { if (h[v] < h[u]) swap(v, u); v = k_par(v, h[v] - h[u]); if (v == u) return v; for (int i = LG - 1; i >= 0; i--) if (par[v][i] != par[u][i]) v = par[v][i], u = par[u][i]; return par[v][0]; } int d(int v, int u) { return h[v] + h[u] - 2 * h[lca(v, u)]; } void build(int l = 0, int r = n, int id = 1) { if (l + 1 == r) { seg[id] = ver[l]; return; } int mid = l + r >> 1; build(l, mid, id << 1), build(mid, r, id << 1 | 1); seg[id] = max(seg[id << 1], seg[id << 1 | 1]); } void add(int id, int x) { seg[id] += x; lazy[id] += x; } void shift(int id) { add(id << 1, lazy[id]); add(id << 1 | 1, lazy[id]); lazy[id] = 0; } int get(int s, int e, int l = 0, int r = n, int id = 1) { if (s <= l && e >= r) return seg[id]; if (s >= r || e <= l) return 0; shift(id); int mid = l + r >> 1; return max(get(s, e, l, mid, id << 1), get(s, e, mid, r, id << 1 | 1)); } void upd(int s, int e, int x, int l = 0, int r = n, int id = 1) { if (s <= l && e >= r) { add(id, x); return; } if (s >= r || e <= l) return; shift(id); int mid = l + r >> 1; upd(s, e, x, l, mid, id << 1), upd(s, e, x, mid, r, id << 1 | 1); seg[id] = max(seg[id << 1], seg[id << 1 | 1]); } void dfs_ans(int v) { for (auto q : query[v]) ans[q.id] = max(ans[q.id], get(q.l, q.r)); for (auto u : adj[v]) if (u != par[v][0]) { upd(st[u], en[u], -1); upd(0, st[u], +1); upd(en[u], n, +1); dfs_ans(u); upd(st[u], en[u], +1); upd(0, st[u], -1); upd(en[u], n, -1); } } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 1, v, u; i < n; i++) { cin >> v >> u; --v, --u; adj[v].push_back(u); adj[u].push_back(v); } dfs(0); build(); int Q; cin >> Q; for (int i = 0, v, u; i < Q; i++) { cin >> v >> u; --v, --u; if (h[v] < h[u]) swap(v, u); int dis = d(v, u); int w = k_par(v, (dis - 1) / 2); query[v].push_back(Query(st[w], en[w], i)); query[u].push_back(Query(0, st[w], i)); query[u].push_back(Query(en[w], n, i)); } dfs_ans(0); for (int i = 0; i < Q; i++) cout << ans[i] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int ans = 0; function<void(int, int)> dfs = [&](int p, int s) { if (p == n) { if (!s) { ++ans; } return; } dfs(p + 1, s - a[p]); dfs(p + 1, s); dfs(p + 1, s + a[p]); }; dfs(0, 0); cout << (ans >= 2 ? YES : NO ) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void print(vector<int> v) { for (int i = 0; i < v.size(); i++) { if (v[i] != 0) { cout << v[i]; } } cout << endl; } void solve(vector<int>& v, int even, int odd) { if (v.size() == 1) { cout << -1 << endl; return; } else if (v.size() == 2) { if (odd != 2) { cout << -1 << endl; return; } else { print(v); return; } } else if (odd == 0) { cout << -1 << endl; return; } else { while (v[v.size() - 1] % 2 == 0) { v.pop_back(); even--; } if (odd == 1) { cout << -1 << endl; return; } else if (odd % 2 == 0) { print(v); return; } else { for (int i = 0; i < v.size(); i++) { if (v[i] % 2 == 1) { v.erase(v.begin() + i); print(v); return; } } } } } int main() { int t; cin >> t; while (t--) { int e = 0, o = 0; int n; cin >> n; string s; cin >> s; vector<int> v(n); for (int i = 0; i < s.size(); i++) { v[i] = s[i] - 48; if (v[i] % 2 == 0) e++; else o++; } solve(v, e, o); } } |
#include <bits/stdc++.h> using std::max; using std::min; const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x3f3f3f3f3f3f3f3f; std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count()); template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> inline _Tp abs(const _Tp &a) { return a >= 0 ? a : -a; } template <typename _Tp> inline void chmax(_Tp &a, const _Tp &b) { (a < b) && (a = b); } template <typename _Tp> inline void chmin(_Tp &a, const _Tp &b) { (b < a) && (a = b); } template <typename _Tp> inline void read(_Tp &x) { char ch(getchar()); bool f(false); while (!isdigit(ch)) f |= ch == 45, ch = getchar(); x = ch & 15, ch = getchar(); while (isdigit(ch)) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar(); f && (x = -x); } template <typename _Tp, typename... Args> inline void read(_Tp &t, Args &...args) { read(t); read(args...); } inline int read_str(char *s) { char ch(getchar()); while (ch == || ch == r || ch == n ) ch = getchar(); char *tar = s; *tar++ = ch, ch = getchar(); while (ch != && ch != r && ch != n && ch != EOF) *tar++ = ch, ch = getchar(); return *tar = 0, tar - s; } const int max_len = 1 << 18; const int N = max_len + 9; const int mod = 998244353; int _inv_[N]; template <typename _Tp1, typename _Tp2> inline void add(_Tp1 &a, _Tp2 b) { (a += b) >= mod && (a -= mod); } template <typename _Tp1, typename _Tp2> inline void sub(_Tp1 &a, _Tp2 b) { (a -= b) < 0 && (a += mod); } template <typename _Tp> inline _Tp _sub(_Tp a, const _Tp &b) { (a += mod - b) >= mod && (a -= mod); return a; } long long ksm(long long a, long long b = mod - 2) { long long res = 1; while (b) { if (b & 1) res = res * a % mod; a = a * a % mod, b >>= 1; } return res; } void print(const std::vector<int> &a) { for (auto it : a) printf( %d , it); printf( n ); } std::vector<int> operator<<(const std::vector<int> &a, unsigned int b) { std::vector<int> o(a.size() + b); for (unsigned int i = 0; i < b; ++i) o[i] = 0; for (unsigned int i = 0; i < a.size(); ++i) o[i + b] = a[i]; return o; } inline std::vector<int> operator<<=(std::vector<int> &a, unsigned int b) { return a = a << b; } inline std::vector<int> operator>>(const std::vector<int> &a, unsigned int b) { return b >= a.size() ? std::vector<int>() : std::vector<int>{a.begin() + b, a.end()}; } inline std::vector<int> operator>>=(std::vector<int> &a, unsigned int b) { return a = b >= a.size() ? std::vector<int>() : std::vector<int>{a.begin() + b, a.end()}; } std::vector<int> operator+=(std::vector<int> &a, const std::vector<int> &b) { if (((int)b.size()) > ((int)a.size())) a.resize(((int)b.size())); for (unsigned int i = 0; i < b.size(); ++i) add(a[i], b[i]); return a; } inline std::vector<int> operator+(const std::vector<int> &a, const std::vector<int> &b) { std::vector<int> tmp(a); tmp += b; return tmp; } std::vector<int> operator-=(std::vector<int> &a, const std::vector<int> &b) { if (((int)b.size()) > ((int)a.size())) a.resize(((int)b.size())); for (unsigned int i = 0; i < b.size(); ++i) sub(a[i], b[i]); return a; } inline std::vector<int> operator-(const std::vector<int> &a, const std::vector<int> &b) { std::vector<int> tmp(a); tmp -= b; return tmp; } int Omgs[N], r[N]; const long long G = ksm(3, (mod - 1) / max_len); int calc(int len) { int limit = 1; while (limit < len) limit <<= 1; for (int i = 0; i < limit; ++i) r[i] = (r[i >> 1] >> 1) | ((i & 1) ? (limit >> 1) : 0); return limit; } void setup() { _inv_[0] = _inv_[1] = 1; for (int i = 2; i < N; ++i) _inv_[i] = 1ll * _inv_[mod % i] * (mod - mod / i) % mod; Omgs[max_len >> 1] = 1; for (int i = (max_len >> 1) + 1; i < max_len; ++i) Omgs[i] = 1LL * Omgs[i - 1] * G % mod; for (int i = (max_len >> 1) - 1; i >= 0; --i) Omgs[i] = Omgs[i << 1]; } void dft(std::vector<int> &a, int limit) { static int A[N]; for (int i = 0; i < limit; ++i) A[r[i]] = a[i]; for (int len = 2, hf = 1; len <= limit; len <<= 1, hf <<= 1) for (int pos = 0; pos < limit; pos += len) { int *w(Omgs + hf), *p(A + pos), *q(A + pos + hf); for (int i = 0; i < hf; ++i, ++p, ++q) { int tmp = 1LL * (*w++) * (*q) % mod; *q = _sub(*p, tmp), add(*p, tmp); } } for (int i = 0; i < limit; ++i) a[i] = A[i] % mod; } void idft(std::vector<int> &a, int limit) { std::reverse(&a[1], &a[limit]); dft(a, limit); unsigned long long inv = mod - (mod - 1) / limit; for (int i = 0; i < limit; ++i) a[i] = inv * a[i] % mod; } std::vector<int> operator*(std::vector<int> a, std::vector<int> b) { if (a.size() <= 40u || b.size() <= 40u) { std::vector<int> c(((int)a.size()) + ((int)b.size()) - 1); for (unsigned int i = 0; i < a.size(); ++i) for (unsigned int j = 0; j < b.size(); ++j) add(c[i + j], 1ull * a[i] * b[j] % mod); return c; } int tmp = ((int)a.size()) + ((int)b.size()), limit = calc(tmp); a.resize(limit), b.resize(limit), dft(a, limit), dft(b, limit); for (int i = 0; i < limit; ++i) a[i] = 1ull * a[i] * b[i] % mod; return idft(a, limit), a.resize(tmp - 1), a; } std::vector<int> sqr(std::vector<int> a) { if (a.size() <= 40u) { std::vector<int> c(((int)a.size()) + ((int)a.size()) - 1); for (unsigned int i = 0; i < a.size(); ++i) for (unsigned int j = 0; j < a.size(); ++j) add(c[i + j], 1ull * a[i] * a[j] % mod); return c; } int tmp = ((int)a.size()) << 1, limit = calc(tmp); a.resize(limit), dft(a, limit); for (int i = 0; i < limit; ++i) a[i] = 1ull * a[i] * a[i] % mod; return idft(a, limit), a.resize(tmp - 1), a; } inline std::vector<int> operator*=(std::vector<int> &a, const std::vector<int> &b) { return a = a * b; } template <typename _Tp> inline std::vector<int> operator*=(std::vector<int> &a, const _Tp &b) { for (auto &&it : a) it = 1ll * it * b % mod; return a; } template <typename _Tp> inline std::vector<int> operator*(std::vector<int> a, const _Tp &b) { return a *= b; } template <typename _Tp> inline std::vector<int> operator*(const _Tp &b, std::vector<int> a) { return a *= b; } template <typename _Tp> inline std::vector<int> operator/=(std::vector<int> &a, const _Tp &b) { long long inv = ksm(b); for (auto &&it : a) it = 1ll * it * inv % mod; return a; } template <typename _Tp> inline std::vector<int> operator/(std::vector<int> a, const _Tp &b) { return a /= b; } template <typename _Tp> inline std::vector<int> operator/(const _Tp &b, std::vector<int> a) { return a /= b; } std::vector<int> _inv(const std::vector<int> &F) { int len = ((int)F.size()); if (len == 1) return {(int)ksm(F[0])}; std::vector<int> H(_inv({F.begin(), F.begin() + (len >> 1)})), tmp(F * H), ans(H); tmp = std::vector<int>{tmp.begin() + (len >> 1), tmp.end()} * H; ans.resize(len); for (int i = 0; i < len >> 1; ++i) tmp[i] && (ans[(len >> 1) + i] = mod - tmp[i]); return ans; } std::vector<int> Inv(std::vector<int> F) { int tmp = ((int)F.size()), L = 1; for (; L < tmp; L <<= 1) ; F.resize(L); std::vector<int> ans(_inv(F)); return ans.resize(tmp), ans; } std::pair<std::vector<int>, std::vector<int> > divide( const std::vector<int> &f, const std::vector<int> &g) { int n = ((int)f.size()), m = ((int)g.size()); std::vector<int> F(f), G(g); std::reverse(F.begin(), F.end()), F.resize(n - m + 1); std::reverse(G.begin(), G.end()), G.resize(n - m + 1); std::vector<int> Q(F * Inv(G)); Q.resize(n - m + 1), std::reverse(Q.begin(), Q.end()); std::vector<int> R(f - Q * g); return R.resize(m - 1), std::make_pair(Q, R); } inline std::vector<int> Mod(const std::vector<int> &f, const std::vector<int> &g) { return divide(f, g).second; } std::vector<int> _sqrt(const std::vector<int> &F) { int len = ((int)F.size()); if (len == 1) return {1}; std::vector<int> H(_sqrt({F.begin(), F.begin() + (len >> 1)})); H.resize(len); return (H + F * _inv(H)) / 2; } std::vector<int> Sqrt(std::vector<int> F) { int tmp = ((int)F.size()), L = 1; for (; L < tmp; L <<= 1) ; F.resize(L); std::vector<int> ans(_sqrt(F)); return ans.resize(tmp), ans; } std::vector<int> deri(std::vector<int> a) { for (int i = 0; i + 1 < ((int)a.size()); ++i) a[i] = 1ll * (i + 1) * a[i + 1] % mod; return a.pop_back(), a; } std::vector<int> inte(std::vector<int> a) { a.resize(((int)a.size()) + 1); for (int i = ((int)a.size()) - 1; i >= 1; --i) a[i] = 1ll * a[i - 1] * _inv_[i] % mod; return a[0] = 0, a; } std::vector<int> Ln(std::vector<int> F) { std::vector<int> ans(inte(deri(F) * Inv(F))); return ans.resize(((int)F.size())), ans; } std::vector<int> _exp(const std::vector<int> &F) { int len = ((int)F.size()); if (len == 1) return {1}; std::vector<int> H(_exp({F.begin(), F.begin() + (len >> 1)})); H.resize(len); std::vector<int> ans(F - Ln(H)); add(ans[0], 1); H.resize(len >> 1); return ans *= H, ans.resize(len), ans; } std::vector<int> Exp(std::vector<int> F) { int tmp = ((int)F.size()), L = 1; for (; L < tmp; L <<= 1) ; F.resize(L); std::vector<int> ans(_exp(F)); return ans.resize(tmp), ans; } std::vector<int> ksm(std::vector<int> a, int b) { a = Ln(a); for (auto &&it : a) it = 1ll * it * b % mod; return Exp(a); } long long fac[N], inv[N], ifac[N]; int main() { setup(); fac[0] = fac[1] = inv[0] = inv[1] = ifac[0] = ifac[1] = 1; for (int i = 2; i < N; ++i) fac[i] = fac[i - 1] * i % mod, inv[i] = inv[mod % i] * (mod - mod / i) % mod, ifac[i] = ifac[i - 1] * inv[i] % mod; int n; read(n); std::vector<int> H(n + 5); for (int i = 0; i < n + 5; ++i) H[i] = i & 1 ? mod - inv[i + 1] : inv[i + 1]; H = Inv(H); std::vector<int> tp(Inv((std::vector<int>{1} - H) >> 1)), tmp(ksm(H, n + 1)), B(tmp * tp); B.resize(n + 5); std::vector<int> A(deri(H) * B); A.resize(n + 5), A *= tp, A.resize(n + 5); std::vector<int> C(n + 5); for (int i = 0; i <= n; ++i) C[i] = 1LL * inv[n + 1] * ((A[i + 1] + 1LL * B[i + 1] * (n - i + 1)) % mod) % mod; std::vector<int> D(n + 5); for (int i = 2; i < n + 5; ++i) D[i - 2] = mod - ifac[i]; D = Inv(D) >> 1; std::vector<int> F(D - C); sub(F[0], 1), F.resize(n + 1); for (int i = 0; i < ((int)F.size()); ++i) F[i] = fac[i] * F[i] % mod; std::vector<int> G(n + 5); for (int i = 0; i <= n; ++i) G[n - i] = i & 1 ? mod - ifac[i] : ifac[i]; F *= G; for (int i = 0; i < n; ++i) printf( %lld%c , 1LL * fac[n] * ifac[i] % mod * F[i + n] % mod, n [i == n]); return 0; } |
#include <bits/stdc++.h> const long long N = 200200; const long long Q = 100100; const long long mod = 998244353; const long long block = 500; using namespace std; string s; int cnt; bool t; void solve() { cin >> s; for (int i = 0; i < s.size(); i++) { if (s[i] == 1 ) { t = 1; } else if (t) { cnt++; } } if (cnt >= 6) { cout << yes << n ; } else { cout << no << n ; } } bool mtest = false; int main() { ios_base::sync_with_stdio(0); int TE = 1; if (mtest) cin >> TE; while (TE--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100005; int N; int a[MAXN]; vector<int> lol; int main(int argc, char *argv[]) { scanf( %d , &N); int p = 1; while (p < MAXN) { lol.push_back(p); p <<= 1; } for (int i = 0, _i = N; i < _i; ++i) { scanf( %d , a + i); } long long ans = 0; for (int i = 0, _i = N - 1; i < _i; ++i) { ans += a[i]; cout << ans << n ; a[i + *(--upper_bound(lol.begin(), lol.end(), N - i - 1))] += a[i]; a[i] = 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; void display(vector<int> &a) { for (int z : a) cout << z << ; cout << endl; } int dx[4] = {0, 0, 1, -1}; int dy[4] = {1, -1, 0, 0}; const int mod = 998244353; const long long INF64 = 3e18; void smxl(long long &a, long long b) { if (a < b) a = b; } void smnl(long long &a, long long b) { if (a > b) a = b; } void adsl(long long &a, long long b) { a += b; if (a >= mod) a -= mod; } void misl(long long &a, long long b) { a -= b; if (a >= mod) a -= mod; if (a < 0) a += mod; } void smx(long long &a, long long b) { if (a < b) a = b; } void smn(long long &a, long long b) { if (a > b) a = b; } void ads(long long &a, long long b) { a += b; if (a >= mod) a -= mod; } void mis(long long &a, long long b) { a -= b; if (a >= mod) a -= mod; if (a < 0) a += mod; } long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); } long long egcd(long long a, long long b, long long &x, long long &y) { if (a == 0) { x = 0; y = 1; return b; } long long x1, y1; long long d = egcd(b % a, a, x1, y1); x = y1 - (b / a) * x1; y = x1; return d; } long long mbinp(long long a, long long b) { a %= mod; if (b == 0) return 1; long long ans = mbinp(a, b / 2); long long tmp = (ans * ans) % mod; if (b % 2) return ((tmp * a) % mod); return ((tmp) % mod); } long long binp(long long a, long long b) { if (b == 0) return 1; long long ans = binp(a, b / 2); long long tmp = (ans * ans); if (b % 2) return ((tmp * a)); return ((tmp)); } long long C(int n, int m) { long long ret = 1; for (int i = 1; i <= m; i++) { ret *= (n - i + 1); ret /= i; } return ret; } long long overbinp(long long a, int b) { long long res = 1; while (b) { if (b & 1) { if (res < INF64 / a) res *= a; else return INF64; } if (b > 1) { if (a < INF64 / a) a *= a; else return INF64; } b >>= 1; } return res; } class DSU { vector<int> par; vector<int> siize; public: DSU(int n) { par.resize(n); siize.resize(n); for (int i = 0; i < n; i++) { par[i] = i; siize[i] = 1; } } public: int get(int x) { return (x == par[x] ? x : par[x] = get(par[x])); } public: void merge(int a, int b) { int x = get(a); int y = get(b); if (x == y) return; if (siize[x] < siize[y]) swap(x, y); par[y] = x; siize[x] += siize[y]; } }; class BinaryLift { vector<vector<int> > binlift; int n; public: BinaryLift(vector<int> rnk, vector<int> par) { n = (int)par.size(); binlift.resize(n); for (int i = 0; i < n; i++) binlift[i].resize(20); for (int i = 0; i < n; i++) binlift[i][0] = par[i]; for (int j = 1; j < 20; j++) for (int i = 0; i < n; i++) { if ((1 << j) < rnk[i]) binlift[i][j] = binlift[binlift[i][j - 1]][j - 1]; else binlift[i][j] = -1; } } public: int get_kth_ancestor(int x, int k) { int pt = x; for (int i = 19; i >= 0; i--) { if (pt == -1) exit(0); if (k & (1 << i)) pt = binlift[pt][i]; } return pt; } public: int get_th_ancestor(int x, int k) { int pt = x; for (int i = 19; i >= 0; i--) { if (k & (1 << i)) pt = binlift[pt][i]; } return pt; } }; class SparseTable2D { vector<vector<vector<vector<int> > > > sparse; vector<vector<int> > inp; int m, n; private: int lg2(int x) { int out = 0; while ((1 << out) <= x) out++; return out - 1; } public: int rmin(int x1, int y1, int x2, int y2) { int lenx = x2 - x1 + 1; int lx = lg2(lenx) + 1; int leny = y2 - y1 + 1; int ly = lg2(leny) + 1; return min( min(sparse[lx][x1][ly][y1], sparse[lx][x1][ly][y2 + 1 - (1 << ly)]), min(sparse[lx][x2 + 1 - (1 << lx)][ly][y1], sparse[lx][x2 + 1 - (1 << lx)][ly][y2 + 1 - (1 << ly)])); } public: SparseTable2D(vector<vector<int> > input, string param) { n = input.size(); m = input[0].size(); inp = input; if (param == min ) prepromin(); } private: void prepromin() { int lln, lm; lln = lg2(n) + 1; lm = lg2(m) + 1; sparse.resize(lln); for (int i = 0; i < lln; i++) sparse[i].resize(n); for (int i = 0; i < lln; i++) for (int j = 0; j < n; j++) sparse[i][j].resize(lm); for (int i = 0; i < lln; i++) for (int j = 0; j < n; j++) for (int k = 0; k < lm; k++) sparse[i][j][k].resize(m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) sparse[0][i][0][j] = inp[i][j]; for (int j = 1; j < lm; j++) for (int k = 0; k + (1 << j) - 1 < m; k++) sparse[0][i][j][k] = min(sparse[0][i][j - 1][k], sparse[0][i][j - 1][k + (1 << (j - 1))]); } for (int i = 1; i < lln; i++) for (int j = 0; j + (1 << i) - 1 < n; j++) for (int k = 0; k < lm; k++) for (int h = 0; h < m; h++) sparse[i][j][k][h] = min(sparse[i - 1][j][k][h], sparse[i - 1][j + (1 << (i - 1))][k][h]); } }; class SparseTable { vector<vector<long long> > sparse; int n; vector<int> input; private: int lg2(int x) { int out = 0; while ((1 << out) <= x) out++; return out - 1; } public: int rmaxpos(int left, int right) { int len = right - left + 1; int lg = lg2(len); return (input[sparse[left][lg]] > input[sparse[left + len - (1 << lg)][lg]] ? sparse[left][lg] : sparse[left + len - (1 << lg)][lg]); } public: int rmaxval(int left, int right) { int len = right - left + 1; int lg = lg2(len); return (input[sparse[left][lg]] > input[sparse[left + len - (1 << lg)][lg]] ? input[sparse[left][lg]] : input[sparse[left + len - (1 << lg)][lg]]); } public: int rminpos(int left, int right) { int len = right - left + 1; int lg = lg2(len); return (input[sparse[left][lg]] < input[sparse[left + len - (1 << lg)][lg]] ? sparse[left][lg] : sparse[left + len - (1 << lg)][lg]); } public: int rminval(int left, int right) { int len = right - left + 1; int lg = lg2(len); return (input[sparse[left][lg]] < input[sparse[left + len - (1 << lg)][lg]] ? input[sparse[left][lg]] : input[sparse[left + len - (1 << lg)][lg]]); } public: long long rsum(int left, int right) { long long ans = 0; int pos; while (left <= right) { for (int i = 19; i >= 0; i--) if ((1 << i) <= right - left + 1) { pos = i; break; } ans += sparse[left][pos]; left = left + (1 << pos); } return ans; } public: SparseTable(vector<int> inp, string operation) { input = inp; n = inp.size(); if (operation == min ) prepromin(); else if (operation == max ) prepromax(); else if (operation == sum ) preprosum(); } private: void prepromin() { sparse.resize(n); int x = lg2(n) + 1; for (int i = 0; i < n; i++) sparse[i].resize(x); for (int i = 0; i < n; i++) sparse[i][0] = i; for (int j = 1; j < x; j++) for (int i = 0; i + (1 << (j)) - 1 < n; i++) sparse[i][j] = (input[sparse[i][j - 1]] < input[sparse[i + (1 << (j - 1))][j - 1]] ? sparse[i][j - 1] : sparse[i + (1 << (j - 1))][j - 1]); } void prepromax() { sparse.resize(n); int x = lg2(n) + 1; for (int i = 0; i < n; i++) sparse[i].resize(x); for (int i = 0; i < n; i++) sparse[i][0] = i; for (int j = 1; j < x; j++) for (int i = 0; i + (1 << (j)) - 1 < n; i++) sparse[i][j] = (input[sparse[i][j - 1]] > input[sparse[i + (1 << (j - 1))][j - 1]] ? sparse[i][j - 1] : sparse[i + (1 << (j - 1))][j - 1]); } void preprosum() { sparse.resize(n); int x = lg2(n) + 1; for (int i = 0; i < n; i++) sparse[i].resize(x); for (int i = 0; i < n; i++) sparse[i][0] = input[i]; for (int j = 1; j < x; j++) for (int i = 0; i + (1 << (j)) - 1 < n; i++) sparse[i][j] = sparse[i][j - 1] + sparse[i + (1 << (j - 1))][j - 1]; } }; class Vector { public: pair<long long, long long> x; public: Vector(pair<long long, long long> a, pair<long long, long long> b) { x.first = b.first - a.first; x.second = b.second - a.second; } public: long double getMagnitude() { return sqrtl(x.first * x.first + x.second * x.second); } }; class Line { public: pair<long long, long long> x, y; public: Line(pair<long long, long long> a, pair<long long, long long> b) { x = a; y = b; } private: long double dotProduct(Vector a, Vector b) { return a.x.first * b.x.first + a.x.second * b.x.second; } private: long double crossProduct(Vector a, Vector b) { return a.x.first * b.x.second - a.x.second * b.x.first; } private: long double magnitude(Vector a) { return a.getMagnitude(); } public: long double distanceToA(pair<long long, long long> c) { return dotProduct(Vector(x, y), Vector(x, c)) / magnitude(Vector(x, y)); } public: long double orthogonalDistance(pair<long long, long long> c) { return crossProduct(Vector(x, y), Vector(x, c)) / magnitude(Vector(x, y)); } public: pair<long double, long double> intersection(Line l) { pair<long double, long double> ans; ans.first = (long double)((x.first * y.second - x.second * y.first) * (l.x.first - l.y.first) - (x.first - y.first) * (l.x.first * l.y.second - l.x.second * l.y.first)) / ((x.first - y.first) * (l.x.second - l.y.second) - (x.second - y.second) * (l.x.first - l.y.first)); ans.second = (long double)((x.first * y.second - x.second * y.first) * (l.x.second - l.y.second) - (x.second - y.second) * (l.x.first * l.y.second - l.x.second * l.y.first)) / ((x.first - y.first) * (l.x.second - l.y.second) - (x.second - y.second) * (l.x.first - l.y.first)); return ans; } }; class PruferCode { vector<int> code; vector<pair<int, int> > edges; public: PruferCode(vector<int> cc) { code = cc; findEdges(); } private: void findEdges() { map<int, int> mp; set<int> has; set<int> wait; for (int z : code) { mp[z]++; has.insert(z); } for (int i = 0; i < code.size() + 2; i++) if (!has.count(i)) wait.insert(i); for (int i = 0; i < code.size(); i++) { int now = *wait.begin(); edges.push_back(make_pair(now, code[i])); mp[now]++; mp[code[i]]--; if (mp[code[i]] == 0) { has.erase(code[i]); wait.insert(code[i]); } wait.erase(now); } assert(wait.size() == 2); edges.push_back(make_pair(*wait.begin(), *wait.rbegin())); } public: vector<pair<int, int> > getEdges() { return edges; } }; class Segment { pair<long long, long long> x, y; public: Segment(pair<long long, long long> a, pair<long long, long long> b) { x = a; y = b; } private: long double dotProduct(Vector a, Vector b) { return a.x.first * b.x.first + a.x.second * b.x.second; } private: long double crossProduct(Vector a, Vector b) { return a.x.first * b.x.second - a.x.second * b.x.first; } private: long double magnitude(Vector a) { return a.getMagnitude(); } public: long double distanceToA(pair<long long, long long> c) { return dotProduct(Vector(x, y), Vector(x, c)) / magnitude(Vector(x, y)); } public: long double distanceToSegment(pair<long long, long long> c) { if (distanceToA(c) >= 0 && distanceToA(c) <= magnitude(Vector(x, y))) return crossProduct(Vector(x, y), Vector(x, c)) / magnitude(Vector(x, y)); else return min(magnitude(Vector(x, c)), magnitude(Vector(y, c))); } }; class HopcroftKarp { vector<int> matched; vector<vector<pair<int, int> > > adj; int left; int right; public: HopcroftKarp(vector<vector<pair<int, int> > > inp, int l, int r) { adj = inp; left = l; matched.resize(l); for (int i = 0; i < l; i++) matched[i] = -1; right = r; } public: vector<int> match() { bool cont = true; set<int> lfree, rfree; for (int i = 0; i < left; i++) lfree.insert(i); for (int i = left; i < left + right; i++) rfree.insert(i); vector<bool> yet(left, 0); for (int i = 0; i < left; i++) for (int j = 0; j < adj[i].size(); j++) if (adj[i][j].second == 1 && rfree.count(adj[i][j].first) && !yet[i]) { yet[i] = true; matched[i] = adj[i][j].first; adj[i][j].second = 2; for (int x = 0; x < adj[adj[i][j].first].size(); x++) if (adj[adj[i][j].first][x].first == i) adj[adj[i][j].first][x].second = 2; rfree.erase(adj[i][j].first); lfree.erase(i); } while (cont) { vector<int> par(left + right, -1); queue<pair<int, int> > kyou; for (int z : lfree) kyou.push(make_pair(z, 0)); int update = -1; vector<int> vis(left + right, 0); while (kyou.size()) { pair<int, int> frt = kyou.front(); kyou.pop(); if (rfree.count(frt.first)) { update = frt.first; break; } if (frt.second == 0) { for (pair<int, int> z : adj[frt.first]) { if (z.second == 1 && !vis[z.first]) { par[z.first] = frt.first; vis[z.first] = 1; kyou.push(make_pair(z.first, 1)); } } } else { for (pair<int, int> z : adj[frt.first]) { if (z.second == 2 && !vis[z.first]) { par[z.first] = frt.first; vis[z.first] = 1; kyou.push(make_pair(z.first, 0)); } } } } int x = update; int cnt = 0; while (x != -1 && par[x] != -1) { for (int i = 0; i < adj[x].size(); i++) if (adj[x][i].first == par[x]) { adj[x][i].second = (cnt == 0 ? 2 : 1); if (cnt == 0) { matched[par[x]] = x; rfree.erase(x); lfree.erase(par[x]); } } for (int i = 0; i < adj[par[x]].size(); i++) if (adj[par[x]][i].first == x) adj[par[x]][i].second = (cnt == 0 ? 2 : 1); cnt++; cnt %= 2; x = par[x]; } if (update == -1) cont = false; } return matched; } }; class Triangle { pair<long long, long long> x, y, z; public: Triangle(pair<long long, long long> a, pair<long long, long long> b, pair<long long, long long> c) { x = a; y = b; z = c; } private: long double crossProduct(Vector a, Vector b) { return a.x.first * b.x.second - a.x.second * b.x.first; } public: long double perimeter() { long double s1, s2, s3; s1 = Vector(x, y).getMagnitude(); s2 = Vector(y, z).getMagnitude(); s3 = Vector(x, z).getMagnitude(); return s1 + s2 + s3; } public: long double area() { return abs(crossProduct(Vector(x, y), Vector(x, z))); } }; class SuffixArray { vector<int> order; vector<int> lcp; string str; public: SuffixArray(string in) { str = in; str += $ ; order.resize(str.length()); lcp.resize(str.length()); compute(); } void compute() { vector<pair<char, int> > a; vector<int> equi(order.size()); vector<int> bij(order.size()); for (int i = 0; i < str.length(); i++) a.push_back(make_pair(str[i], i)); sort(a.begin(), a.end()); for (int i = 0; i < str.length(); i++) order[i] = a[i].second; equi[order[0]] = 0; int r = 0; for (int i = 1; i < str.length(); i++) { if (a[i].first == a[i - 1].first) equi[order[i]] = r; else equi[order[i]] = ++r; } int k = 0; while ((1 << k) < str.length()) { vector<pair<pair<int, int>, int> > a(str.length()); for (int i = 0; i < str.length(); i++) a[i] = make_pair( make_pair(equi[i], equi[(i + (1 << k)) % (str.length())]), i); sort(a.begin(), a.end()); for (int i = 0; i < str.length(); i++) { order[i] = a[i].second; bij[order[i]] = i; } int r = 0; equi[order[0]] = 0; for (int i = 1; i < str.length(); i++) { if (a[i].first == a[i - 1].first) equi[order[i]] = r; else equi[order[i]] = ++r; } k++; } k = 0; for (int i = 0; i < str.length() - 1; i++) { int p = bij[i]; int j = order[p - 1]; while (i + k < str.length() && j + k < str.length() && str[i + k] == str[j + k]) k++; lcp[p] = k; k = max(k - 1, 0); } } public: int count(string ptr) { int low = 0; int hi = str.length() - 1; int res1, res2; res1 = 0; res2 = 1e9; while (low <= hi) { int mid = (low + hi) / 2; bool gr = false; int i = 0; for (i; i < min(ptr.length(), str.length() - order[mid]); i++) { if (ptr[i] != str[order[mid] + i]) { if (ptr[i] > str[order[mid] + i]) gr = true; break; } } if (i == ptr.length()) { res2 = min(res2, mid); hi = mid - 1; } else if (!gr) hi = mid - 1; else low = mid + 1; } low = 0; hi = str.length() - 1; while (low <= hi) { int mid = (low + hi) / 2; bool gr = false; int i = 0; for (i; i < min(ptr.length(), str.length() - order[mid] + 1); i++) { if (ptr[i] != str[order[mid] + i]) { if (ptr[i] > str[order[mid] + i]) gr = true; break; } } if (i == ptr.length()) { res1 = max(res1, mid); low = mid + 1; } else if (!gr) hi = mid - 1; else low = mid + 1; } if (res2 == 1e9) return 0; return (res1 - res2 + 1); } public: vector<int> get() { return order; } public: vector<int> getLcp() { return lcp; } public: long long diffSubstrings() { long long out = 0; for (int i = 1; i < str.length(); i++) out += str.length() - order[i] - lcp[i] - 1; return out; } }; string longestCommonSubstring(string a, string b) { int len = 0; string res = a + % + b; SuffixArray sf = SuffixArray(res); vector<int> order = sf.get(); vector<int> lcp = sf.getLcp(); vector<int> col(order.size()); for (int i = 0; i < order.size(); i++) { if (order[i] < a.length()) col[order[i]] = 1; else if (order[i] > a.length()) col[order[i]] = 2; } int pos = -1; for (int i = 1; i < order.size(); i++) if (col[order[i]] + col[order[i - 1]] == 3) { if (lcp[i] > len) { len = max(len, lcp[i]); pos = (col[order[i]] == 1 ? order[i] : order[i - 1]); } } return a.substr(pos, len); } void solve() { int n, k; cin >> n >> k; vector<int> all(n); vector<int> bij(n + 1); set<int> st; for (int i = 0; i < n; i++) { cin >> all[i]; bij[all[i]] = i; st.insert(i); } set<int> b; vector<int> bb(k); for (int i = 0; i < k; i++) { int x; cin >> x; bb[i] = x; b.insert(x); } long long ans = 1; for (int i = 0; i < k; i++) { int pos = bij[bb[i]]; auto t = st.find(pos); auto m = t; m++; if (t == st.begin()) { auto r = t; r++; if (b.count(all[*r])) { cout << 0 << n ; return; } else { st.erase(*r); } } else if (m == st.end()) { auto r = t; r--; if (b.count(all[*r])) { cout << 0 << n ; return; } else st.erase(*r); } else { auto r = t; auto q = t; r++; q--; if (!b.count(all[*r]) && !b.count(all[*q])) { ans *= 2; ans %= mod; st.erase(*r); } else if (!b.count(all[*r])) st.erase(*r); else if (!b.count(all[*q])) st.erase(*q); else { cout << 0 << n ; return; } } b.erase(bb[i]); } cout << ans << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; long long cap[200005]; int n, m; inline long long tri(int n) { return n * (n + 1LL) / 2; } inline long long arithsum(int a, int d, int n) { long long ret = a * (long long)n; ret += tri(n - 1) * d; return ret; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %lld , &cap[i]); } long long ret = 0; for (int rep = 1; (rep)*n <= m; rep++) { long long total = 0; bool bad = false; long long currVal = min(arithsum(m, -n, rep), cap[n - 1]); for (int i = 0; i < n; i++) { currVal = min(currVal, cap[i] + m - rep * (i + 1)); } for (int i = n - 1; !bad && i >= 0; i--) { total += currVal; if (i > 0) { long long drop = currVal - cap[i - 1]; if (drop > m - rep) bad = true; currVal = min(currVal - rep, cap[i - 1]); } } long long lowFirst = arithsum(1, n, rep); if (!bad && currVal >= lowFirst) { ret = max(ret, total); } } printf( %lld n , ret); } |
#include <bits/stdc++.h> using namespace std; int main() { int t, s, x; cin >> t >> s >> x; int tmp = x - t; if ((tmp % s == 0 || tmp % s == 1) && tmp >= 0 && tmp != 1) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int mod = 1e9 + 7; struct edge { int v, next; }; int ans, ans2, f[1005][1 << 12]; int Pow(int a, int b) { int rec = 1; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) rec = 1ll * rec * a % mod; return rec; } struct nade { int head[1005], edgenum, d[1005][1005], num[1005], sta[1005], n; edge e[1005 << 1]; void add(int u, int v) { e[++edgenum] = edge{v, head[u]}; head[u] = edgenum; } void dfs(int u, int fa) { num[u] = sta[u] = 0; for (int i = head[u], v; i; i = e[i].next) if ((v = e[i].v) ^ fa) { dfs(d[u][num[u]++] = v, u); sta[u] |= 1 << v - 1; } } } s, t; int dfs(int u, int i, int sta) { if (!i) return !sta; int &rec = f[s.d[u][i - 1]][sta]; if (rec != -1) return rec; rec = dfs(u, i - 1, sta); for (int v = s.d[u][i - 1], k = 0; k < t.n; k++) if (sta >> k & 1) rec = (rec + 1ll * dfs(u, i - 1, sta ^ (1 << k)) * dfs(v, s.num[v], t.sta[k + 1])) % mod; return rec; } int main() { scanf( %d , &s.n); for (int i = 1, u, v; i < s.n; i++) { scanf( %d%d , &u, &v); s.add(u, v); s.add(v, u); } scanf( %d , &t.n); for (int i = 1, u, v; i < t.n; i++) { scanf( %d%d , &u, &v); t.add(u, v); t.add(v, u); } s.dfs(1, 0); memset(f, -1, sizeof f); for (int r = 1; r <= t.n; r++) { t.dfs(r, 0); for (int i = 1; i <= s.n; i++) ans = (ans + dfs(i, s.num[i], t.sta[r])) % mod; memset(f, -1, sizeof f); } s = t; s.dfs(1, 0); for (int r = 1; r <= t.n; r++) { t.dfs(r, 0); ans2 = (ans2 + dfs(1, s.num[1], t.sta[r])) % mod; memset(f, -1, sizeof f); } ans = 1ll * ans * Pow(ans2, mod - 2) % mod; printf( %d , ans); } |
#include <bits/stdc++.h> using namespace std; using LL = long long; using pii = pair<int, int>; const int mod = 998244353; const int inf = 0x3f3f3f3f; const int N = 2e5 + 10; int n, m, a[N]; LL sum[N], fac[N], rev[N]; LL pow_mod(LL x, int p) { LL s = 1; while (p) { if (p & 1) s = s * x % mod; x = x * x % mod; p >>= 1; } return s; } LL C(int n, int m) { return fac[n] * rev[m] % mod * rev[n - m] % mod; } LL solve(int A, int d) { int p = lower_bound(a, a + n, d) - a; int q = n - p; if (q < A) return 0; LL ret1, ret2; if (q > A) { ret1 = C(n, q) * C(q - 1, A) % mod * (q - A) % mod * ((sum[n] - sum[p] + mod) % mod) % mod * fac[p] % mod * fac[A] % mod * fac[q - 1 - A] % mod; } else { ret1 = 0; } if (p) { ret2 = C(n, q + 1) * C(q, A) % mod * (q + 1 - A) % mod * sum[p] % mod * fac[p - 1] % mod * fac[A] % mod * fac[q - A] % mod; } else { ret2 = 0; } LL ret = (ret1 + ret2) % mod; return ret * rev[n] % mod; } int main() { int x, y; scanf( %d %d , &n, &m); for (int i = (0); i < (n); ++i) scanf( %d , a + i); sort(a, a + n); fac[0] = 1; for (int i = (1); i < (n + 1); ++i) { fac[i] = fac[i - 1] * i % mod; } rev[n] = pow_mod(fac[n], mod - 2); for (int i = (n); i > (0); --i) rev[i - 1] = rev[i] * i % mod; sum[0] = 0; for (int i = (0); i < (n); ++i) { sum[i + 1] = (sum[i] + a[i]) % mod; } while (m--) { scanf( %d %d , &x, &y); printf( %lld n , solve(x, y)); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int input; vector<int> ret; cin >> input; for (int i = 1; i < input; i += 2) { ret.push_back(i + 1); ret.push_back(i); } if (ret.empty() || ret.size() != input) ret = {-1}; for (auto &d : ret) { cout << d << ; } cout << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n; double ans[1024 * 1024], l, r, x[20], y[20], a[20], cosA[20], sinA[20], maxi; int main() { scanf( %d %lf %lf , &n, &l, &r); maxi = l; for (int i = 0; i < n; i++) { scanf( %lf %lf %lf , &x[i], &y[i], &a[i]); cosA[i] = cos(a[i] * 3.14159265359 / 180); sinA[i] = sin(a[i] * 3.14159265359 / 180); } int maxiMask = 1 << n; for (int i = 0; i < maxiMask; i++) ans[i] = l; for (int i = 0; i < maxiMask; i++) { double curAns = ans[i]; for (int j = 0; j < n; j++) { int newPotPos = 1 << j; if (!(newPotPos & i)) { double vx = curAns - x[j]; double vy = -y[j]; double nvx = vx * cosA[j] - vy * sinA[j]; double nvy = vx * sinA[j] + vy * cosA[j]; double pAns = x[j] - y[j] * nvx / nvy; int newPos = newPotPos ^ i; if (nvy >= 0.0) { ans[newPos] = r; maxi = r; } else { ans[newPos] = max(ans[newPos], pAns); maxi = max(maxi, ans[newPos]); } } } } maxi = min(maxi, r); printf( %.11lf , maxi - l); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, count = 0, count1 = 0, ans = 0, i, ma; cin >> n; long long int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } ma = a[0]; for (i = 0; i < n; i++) { if (a[i] > ma) { ma = a[i]; } } for (i = 0; i < n; i++) { count = ma - a[i]; ans = ans + count; } cout << ans << n ; } |
#include <bits/stdc++.h> using namespace std; bool ok(int a, int b) { int c = 0; for (int i = 0; i < 4; i++) { if ((a % 10) != (b % 10)) c++; if (c > 1) return false; a /= 10; b /= 10; } return true; } int getlow(int a, int m) { for (int i = m; i <= 2011; i++) if (ok(a, i)) return i; return -1; } int main() { int n; scanf( %d , &n); int p = 1000; vector<int> v; for (int i = 0; i < n; i++) { int t; scanf( %d , &t); t = getlow(t, p); p = t; if (t == -1) { printf( No solution n ); return 0; } v.push_back(t); } for (int i = 0; i < n; i++) printf( %d n , v[i]); } |
#include <bits/stdc++.h> using namespace std; inline void read(register int *n) { register char c; *n = 0; do { c = getchar(); } while (c < 0 || c > 9 ); do { *n = c - 0 + *n * 10; c = getchar(); } while (c >= 0 && c <= 9 ); } long long C[2048][2048], fac[1000001], dfac[1000001], D[2048][2048]; long long pmod(long long x, long long y) { if (y == 0) return 1; if (y % 2) return pmod(x, y - 1) * x % 1000000007; long long r = pmod(x, y / 2); return r * r % 1000000007; } long long calc(long long n, long long k, long long c = 0) { long long res = 0; for (register int i = (0); i < (int)(k + 1); ++i) { long long tmp = C[k][i] * pmod(i + c, n); tmp %= 1000000007; if (i % 2) res -= tmp; else res += tmp; res %= 1000000007; } return res; } inline long long binom(long long n, long long r) { if (r < 0 || r > n) return 0; long long res = 1; res = res * fac[n] % 1000000007; res = res * dfac[r] % 1000000007; res = res * dfac[n - r] % 1000000007; return res; } int main() { for (register int i = (0); i < (int)(1000001); ++i) fac[i] = (i ? fac[i - 1] * i : 1) % 1000000007, dfac[i] = pmod(fac[i], 1000000007 - 2); for (register int i = (0); i < (int)(2048); ++i) for (register int j = (0); j < (int)(i + 1); ++j) C[i][j] = (j == 0 || j == i) ? 1 : (C[i - 1][j - 1] + C[i - 1][j]); for (register int i = (0); i < (int)(2048); ++i) for (register int j = (0); j < (int)(2048); ++j) if (i == 0) D[i][j] = j == 0; else if (j <= 1) D[i][j] = j; else D[i][j] = (j * D[i - 1][j] + D[i - 1][j - 1]) % 1000000007; int n, m, k; cin >> n >> m >> k; if (m == 1) { cout << pmod(k, n) << endl; return 0; } long long res = 0; for (register int x = (1); x < (int)(min(k, n) + 1); ++x) for (int y = 0; y <= x; y++) if (x * 2 - y <= k) { long long tmp = binom(k, x * 2 - y); tmp = tmp * binom(x * 2 - y, x - y) % 1000000007; tmp = tmp * binom(x, x - y) % 1000000007; tmp = tmp * D[n][x] % 1000000007; tmp = tmp * D[n][x] % 1000000007; tmp = tmp * fac[x] % 1000000007; tmp = tmp * fac[x] % 1000000007; tmp = tmp * pmod(y, n * (m - 2)); res = (res + tmp) % 1000000007; } cout << res << endl; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.