func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> const int N = 1050000; const double pi = acos(-1.0); int a[N], ans[N], rev[N << 1]; std::complex<double> b[N << 1]; void FFT(std::complex<double> *a, int n, int f) { for (int i = 0; i < n; i++) if (i < rev[i]) std::swap(a[i], a[rev[i]]); for (int i = 1; i < n; i <<= 1) { std::complex<double> wn(cos(pi / i), f * sin(pi / i)); for (int j = 0; j < n; j += i << 1) { std::complex<double> w(1, 0); for (int k = j; k < j + i; k++, w *= wn) { std::complex<double> x = a[k], y = w * a[k + i]; a[k] = x + y; a[k + i] = x - y; } } } if (f == -1) for (int i = 0; i < n; i++) a[i] /= n; } int main() { int n, m; scanf( %d%d n , &n, &m); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); b[x] = a[x] = 1; } int len = 0, L = 1; for (; L <= m * 2; len++) L <<= 1; for (int i = 0; i < L; i++) rev[i] = rev[i >> 1] >> 1 ^ ((i & 1) << (len - 1)); FFT(b, L, 1); for (int i = 0; i < L; i++) b[i] *= b[i]; FFT(b, L, -1); int k = 0; for (int i = 1; i <= m; i++) if (!a[i] && b[i].real() >= 0.5) { printf( NO n ); return 0; } else if (a[i] && b[i].real() < 0.5) ans[++k] = i; printf( YES n%d n , k); for (int i = 1; i <= k; i++) printf( %d , ans[i]); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> a(n); vector<long long> pf(n); for (int i = 0; i < n; i++) { cin >> a[i]; pf[i] = a[i]; if (i) pf[i] += pf[i - 1]; } long long ans = 0; long long pw = 1; while (llabs(pw) <= 1LL * n * 1000000000) { map<long long, int> cnt; cnt[0] = 1; for (int i = 0; i < n; i++) { cnt[pf[i]]++; ans += cnt[pf[i] - pw]; } if (k == 1 || (k == -1 && pw == -1)) break; pw *= k; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int P = 1e9 + 7; int add(int a, int b) { if ((a += b) >= P) a -= P; return a < 0 ? a + P : a; } int mul(int a, int b) { return 1ll * a * b % P; } int kpow(int a, int b) { int r = 1; for (; b; b >>= 1, a = mul(a, a)) { if (b & 1) r = mul(r, a); } return r; } const int N = 1e6 + 7; int a[N], b[N], tr[N * 4], tip[N * 4], lft[N], rht[N], tim, n, k; vector<int> g[N]; void dfs(int u) { lft[u] = ++tim; for (auto v : g[u]) dfs(v); rht[u] = tim; } void change(int l, int r, int now, int L, int R, int w) { if (L <= l && R >= r) { tip[now] += w; return; } int mid = (l + r) >> 1; if (L <= mid) change(l, mid, (now << 1), L, R, w); if (R > mid) change(mid + 1, r, ((now << 1) | 1), L, R, w); tr[now] = max(tr[(now << 1)] + tip[(now << 1)], tr[((now << 1) | 1)] + tip[((now << 1) | 1)]); } int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); cin >> n >> k; for (int i = (1); i < (n + 1); i++) cin >> a[i]; for (int i = (n + 1) - 1; i >= (1); i--) { for (b[i] = i + 1; b[i] <= n && a[b[i]] <= a[i]; b[i] = b[b[i]]) ; g[b[i]].push_back(i); } dfs(n + 1); for (int i = (1); i < (k + 1); i++) change(1, tim, 1, lft[i], rht[i], 1); cout << tip[1] + tr[1] << ; for (int i = (k + 1); i < (n + 1); i++) { change(1, tim, 1, lft[i], rht[i], 1); change(1, tim, 1, lft[i - k], lft[i - k], -(1ll << (30))); cout << tr[1] + tip[1] << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; #define endl n typedef long long int lli; #define __ ios_base::sync_with_stdio(false);cin.tie(NULL); int main(){__ int t= 1,n; cin>>t; while(t--){ string s; cin>>s; n = s.size(); bool flag = true; int idx1,idx2,cont =0; for(int i = 0;i<n;i++){ if(s[i]== ) ) idx1 = i; if(s[i]== ( ) idx2 = i; if(s[i]== ? )cont++; } if(idx1>idx2&& cont%2 ==0){ cout<< YES <<endl; } else if(idx1>idx2 && cont&1){ cout<< NO <<endl; } else{ int cont1 = 0,cont2 =0; for(int i = 0;i<idx1;i++){ cont1++; } for(int i= n-1;i>idx2;i--){ cont2++; } if(cont1>0 && cont2>0 && (cont-(2))%2 ==0) cout<< YES <<endl; else cout<< NO <<endl; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { string s, t; long long n; cin >> n; cin >> s; cin >> t; sort(s.begin(), s.end()); sort(t.begin(), t.end()); long long cnt = 0; long long i = 0; long long j = 0; while (i < n && j < n) { if (s[i] <= t[j]) { cnt++; i++; j++; } else j++; } cout << s.length() - cnt << endl; cnt = 0; i = 0; j = 0; while (i < n && j < n) { if (s[i] < t[j]) { cnt++; i++; j++; } else j++; } cout << cnt << endl; }
|
#include <bits/stdc++.h> using namespace std; string months[] = { January , February , March , April , May , June , July , August , September , October , November , December }; int main() { string x; int k; cin >> x >> k; int curr = 0; for (curr = 0; months[curr] != x; curr++) ; curr = (curr + k) % 12; cout << months[curr]; }
|
#include <bits/stdc++.h> using namespace std; int n, k, i, j, x, lg[1 << 20], f1[1 << 20], f2[1 << 20], ans, n1, n2, a; long long e[42]; bool g[1 << 20]; int main() { scanf( %d%d , &n, &k); for (i = 0; i < n; i++) for (j = 0; j < n; j++) { scanf( %d , &x); if (x) e[i] |= 1ll << j; } n1 = n / 2, n2 = n - n1; for (i = 0; i < n2; i++) lg[1 << i] = i; for (i = 1; i < 1 << n1; i++) { a = lg[i & -i]; f1[i] = max(f1[i ^ (1 << a)], f1[i & e[a]] + 1); } ans = f1[(1 << n1) - 1]; g[0] = 1, f2[0] = (1 << n1) - 1; for (i = 1; i < 1 << n2; i++) { a = lg[i & -i]; f2[i] = f2[i ^ (1 << a)] & e[a + n1]; if (g[i ^ (1 << a)] && (e[a + n1] >> n1 & i) == (i ^ (1 << a))) g[i] = 1, ans = max(ans, f1[f2[i]] + __builtin_popcount(i)); } printf( %.8lf , 0.5 * k * k * (ans - 1) / ans); }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; bool f = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = 1; for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48); if (f) x = -x; } template <typename F> inline void write(F x, char ed = n ) { static short st[30]; short tp = 0; if (x < 0) putchar( - ), x = -x; do st[++tp] = x % 10, x /= 10; while (x); while (tp) putchar( 0 | st[tp--]); putchar(ed); } template <typename T> inline void Mx(T &x, T y) { x < y && (x = y); } template <typename T> inline void Mn(T &x, T y) { x > y && (x = y); } const int P = 1e9 + 9; const int N = 200, M = N * N; long long inv[N]; int f[N], siz[N], deg[N]; int h[N], ne[M << 1], to[M << 1], tot, m, n; int vis[N], val[N], g[N][N]; inline void adde(int x, int y) { ne[++tot] = h[x], to[h[x] = tot] = y; } inline void add(int &x, int y) { x += y, x >= P && (x -= P); } vector<int> v; long long Inv[N], fac[N]; long long C(long long n, long long m) { return fac[n] * Inv[m] % P * Inv[n - m] % P; } void perwork(void) { Inv[0] = fac[0] = 1; for (int i = 1; i <= n; i++) Inv[i] = Inv[i - 1] * inv[i] % P, fac[i] = fac[i - 1] * i % P; } void dfs(int x, int fa) { memset(g[x], 0, sizeof(g[x])); siz[x] = g[x][0] = 1; for (int i = h[x]; i; i = ne[i]) { int y = to[i]; if (!vis[y] || y == fa) continue; dfs(y, x); for (int j = siz[x] + siz[y]; j >= 0; j--) for (int k = min(siz[y], j); k >= 1 && j - k <= siz[x]; k--) add(g[x][j], 1ll * g[x][j - k] * g[y][k] % P * C(j, k) % P); siz[x] += siz[y]; } g[x][siz[x]] = g[x][siz[x] - 1]; } void efs(int x) { vis[x] = 0; for (int i = h[x]; i; i = ne[i]) if (vis[to[i]]) efs(to[i]); } void getans(int x, int fa) { v.push_back(x); for (int i = h[x]; i; i = ne[i]) if (vis[to[i]] && to[i] != fa) getans(to[i], x); } int main() { read(n), read(m); for (int i = 1, x, y; i <= m; i++) { read(x), read(y), deg[x]++, deg[y]++; adde(x, y), adde(y, x); } queue<int> q; for (int i = 1; i <= n; i++) if (deg[i] <= 1) q.push(i), vis[i] = 1; while (q.size()) { int x = q.front(); q.pop(); for (int i = h[x]; i; i = ne[i]) { int y = to[i]; deg[y]--; if (!vis[y] && deg[y] <= 1) vis[y] = 1, q.push(y); } } inv[0] = inv[1] = 1; for (int i = 2; i <= n; i++) inv[i] = (P - P / i) * inv[P % i] % P; f[0] = 1; perwork(); for (int i = 1; i <= n; i++) { if (!vis[i] || deg[i] != 1) continue; dfs(i, 0); for (int j = n; j >= 0; j--) for (int k = siz[i]; k >= 1; k--) add(f[j], 1ll * f[j - k] * g[i][k] % P * C(j, k) % P); efs(i); } for (int i = 1; i <= n; i++) { if (!vis[i]) continue; v.clear(), getans(i, 0); for (int j = 0; j <= n; j++) val[j] = 0; int rt = i; for (auto t : v) { dfs(t, 0); rt = t; for (int j = 0; j <= siz[t]; j++) add(val[j], g[t][j]); } for (int j = 0; j <= siz[rt]; j++) val[j] = val[j] * inv[siz[rt] - j] % P; for (int j = n; j >= 0; j--) for (int k = siz[rt]; k >= 1; k--) add(f[j], 1ll * f[j - k] * val[k] % P * C(j, k) % P); efs(i); } for (int i = 0; i <= n; i++) write(f[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; using LL = long long; const int MOD = 998244353; int f[1002][1000]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> x(n); for (int i = 0; i < n; ++i) cin >> x[i]; sort(x.begin(), x.end()); int ans = 0; for (int t = 1; t <= (x[n - 1] - x[0]) / (k - 1); ++t) { for (int i = 0; i < n; ++i) { for (int j = 0; j < k; ++j) f[i][j] = 0; } f[0][0] = 1; int pre = -1; for (int i = 1; i < n; ++i) { while (x[pre + 1] <= x[i] - t) ++pre; f[i][0] = i + 1; if (pre == -1) continue; for (int j = 1; j < k; ++j) { f[i][j] = f[i - 1][j] + f[pre][j - 1]; if (f[i][j] >= MOD) f[i][j] -= MOD; } } ans += f[n - 1][k - 1]; if (ans >= MOD) ans -= MOD; } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, m; vector<pair<int, int> > v, r; cin >> n >> m; for (int a = 0, b; a < n; a++) { cin >> b; v.push_back(make_pair(b, a)); } sort(v.begin(), v.end()); for (int a = 0; a < n; a++) r.push_back(make_pair(v[a].second, a % 2)); sort(r.begin(), r.end()); for (int a = 0; a < n - 1; a++) cout << r[a].second << ; cout << r[n - 1].second << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int t; cin >> t; while (t) { t--; long long int n, k; cin >> n >> k; long long int a[k]; map<long long int, long long int> m; for (int i = 0; i < k; ++i) { cin >> a[i]; m[a[i]]++; } long long int pow = 1, f = 0, ans = 0; while (n) { if (n % 2 == 1) { if (m[pow] == 0) { long long int x = 0; for (long long int i = pow; i < 1000000000; i *= 2) { if (m[i] != 0) { x = i; break; } } m[x]--; while (x != pow && x != 0) { x /= 2; m[x] += 1; ans += 1; } if (x == 0) { f = 1; break; } } else { m[pow]--; } } m[2 * pow] += m[pow] / (2); m[pow] = 0; n /= 2; pow *= 2; } if (f) { cout << -1 << n ; } else { cout << ans << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int main() { while (~scanf( %d , &n)) { printf( %d n , (n - 1) / 2); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int test = 0; const int MAXN = 300009; const long long MOD = 119 << 23 | 1; class { public: vector<int> V[MAXN]; int fa[MAXN * 2], cnt[MAXN * 2]; int n, m; int curset[MAXN * 2], ans; int findfa(int x) { if (fa[x] == x) return x; return fa[x] = findfa(fa[x]); } void merge(int x, int y) { x = findfa(x); y = findfa(y); if (x == y) return; if (x > y) swap(x, y); fa[y] = x; cnt[x] += cnt[y]; } void solve() { cin >> n >> m; string s; cin >> s; for (int i = 1; i <= m; ++i) { int c; cin >> c; for (int j = 0; j < c; ++j) { int v; cin >> v; V[v].push_back(i); } fa[i] = i; fa[i + m] = i + m; cnt[i + m] = 1; } ans = 0; for (int i = 1; i <= n; ++i) { bool on = s[i - 1] == 1 ; if (V[i].size() == 1) { int p = V[i][0]; if (on) { del(p); del(p + m); merge(p + m, 0); add(p); } else { del(p); del(p + m); merge(p, 0); add(p); } } else if (V[i].size() == 2) { int p0 = V[i][0], p1 = V[i][1]; if (on) { del(p0); del(p1); del(p1 + m); del(p0 + m); merge(p0, p1); merge(p0 + m, p1 + m); add(p0); } else { del(p0); del(p1); del(p1 + m); del(p0 + m); merge(p0, p1 + m); merge(p0 + m, p1); add(p0); } } cout << ans << n ; } } void add(int x) { int y = x + m; x = findfa(x); y = findfa(y); if (x == 0) curset[y] = 1, ans += cnt[y]; else if (y == 0) curset[x] = 1, ans += cnt[x]; else if (cnt[x] > cnt[y]) curset[y] = 1, ans += cnt[y]; else curset[x] = 1, ans += cnt[x]; } void del(int x) { x = findfa(x); if (curset[x]) { ans -= cnt[x]; curset[x] = 0; } } } NSPACE; int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); NSPACE.solve(); }
|
#include <bits/stdc++.h> using namespace std; int main() { unsigned long long a, b, x, y; cin >> a >> b; x = (a - b) / 2; y = x + b; if ((x > y) || (x + y != a) || (x ^ y) != b) cout << -1 << endl; else cout << x << << y << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<char, string>>> vec; int main() { unsigned long long int n, i, j, n1, cnt = 0; cin >> n; string s; char r; for (i = 1; i <= n; i++) { cin >> s; n1 = s.size(); cnt = 0; for (j = 0; j < n1; j++) { if (s[j] == a || s[j] == e || s[j] == i || s[j] == o || s[j] == u ) { cnt++; r = s[j]; } } vec.push_back(make_pair(cnt, make_pair(r, s))); } sort(vec.begin(), vec.end()); vector<pair<string, string>> v1; vector<pair<string, string>> v2, v4, v5; vector<pair<int, pair<char, string>>> v3; for (i = 0; i < vec.size(); i++) { if (i == vec.size() - 1) { v3.push_back(vec[i]); break; } if (vec[i].first == vec[i + 1].first) { if (vec[i].second.first == vec[i + 1].second.first) { v1.push_back(make_pair(vec[i].second.second, vec[i + 1].second.second)); i++; continue; } else { v3.push_back(vec[i]); continue; } } else { v3.push_back(vec[i]); continue; } } sort(v3.begin(), v3.end()); for (i = 0; i < v3.size(); i++) { if (i == v3.size() - 1) break; if (v3[i].first == v3[i + 1].first) { v2.push_back(make_pair(v3[i].second.second, v3[i + 1].second.second)); i++; } } n1 = min(v1.size(), v2.size()); cnt = 0; cnt = cnt + n1; if (v1.size() > n1) { cnt += (v1.size() - n1) / 2; } cout << cnt << endl; for (i = 0; i < n1; i++) { cout << v2[i].first << << v1[i].first << endl; cout << v2[i].second << << v1[i].second << endl; } if (cnt > n1) { for (i = n1; i < v1.size(); i++) { if (v1.size() - 1 > i) { cout << v1[i].first << << v1[i + 1].first << endl; cout << v1[i].second << << v1[i + 1].second << endl; i++; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 153, M = 1e5 + 7; int n, m, K, ed; char s[M]; bitset<N * N> wall, now, can; int main() { scanf( %d%d%d , &n, &m, &K); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) { if (s[j] == # ) wall[i * m + j] = 1; else can[i * m + j] = now[i * m + j] = 1; if (s[j] == E ) ed = i * m + j; } } scanf( %s , s + 1); if (now.count() == 1 && now[ed]) { printf( 0 n ); return 0; } for (int i = 1; i <= K; i++) { if (s[i] == U ) now = (now >> m & can) | (now & (wall << m)); else if (s[i] == D ) now = (now << m & can) | (now & (wall >> m)); else if (s[i] == L ) now = (now >> 1 & can) | (now & (wall << 1)); else now = (now << 1 & can) | (now & (wall >> 1)); if (now.count() == 1 && now[ed]) { printf( %d n , i); return 0; } } printf( -1 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using vi = vector<int>; const int Z = int(1e5 + 1); const int inf = int(2e9 + 1); const ll llinf = ll(2e18 + 1); const ll mod = ll(1e9 + 7); int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, x; cin >> n >> x; int sum = 0; for (int i = 0; i < n; i++) { int a; cin >> a; sum += a; } sum = abs(sum); cout << sum / x + int(sum % x != 0) << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int oo = 0x3f3f3f3f; const double EPS = 1e-9; const int MAXN = (int)1e5 + 10; const long long MOD = (long long)1e9 + 7; long long TEN_POW[MAXN]; long long MOD_INV[MAXN]; long long FACT[MAXN]; long long INV_FACT[MAXN]; long long ACC[MAXN]; long long comb(int n, int p) { if (p > n) return 0; return (((FACT[n] * INV_FACT[p]) % MOD) * INV_FACT[n - p]) % MOD; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); MOD_INV[1] = 1; for (int i = 2; i < MAXN; i++) MOD_INV[i] = (MOD - (MOD / i) * MOD_INV[MOD % i] % MOD) % MOD; TEN_POW[0] = FACT[0] = INV_FACT[0] = 1; for (int i = 1; i < MAXN; ++i) { FACT[i] = (FACT[i - 1] * i) % MOD; INV_FACT[i] = (INV_FACT[i - 1] * MOD_INV[i]) % MOD; TEN_POW[i] = (TEN_POW[i - 1] * 10) % MOD; } int n, t; string s; cin >> n >> t; cin >> s; ACC[0] = comb(n - 2, t - 1); for (int i = 1; t - 1 <= n - i - 2; ++i) { ACC[i] = (ACC[i - 1] + (TEN_POW[i] * comb(n - i - 2, t - 1)) % MOD) % MOD; } long long ans = 0; for (int k = 0; k < n; ++k) { long long cur = 0; cur = ((s[k] - 0 ) * ((ACC[min(n - k - 2, n - t - 1)] + (comb(k, t) * TEN_POW[n - k - 1]) % MOD)) % MOD) % MOD; ans = (ans + cur) % MOD; } cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; const long long INF = 0x7fffffffffffffff; const double eps = 1e-10; unsigned int seed = 19260817; const unsigned int _RAND_MAX_ = 4294967295u; __inline__ __attribute__((always_inline)) unsigned int Rand() { return seed = seed * 998244353u + 1000000007u; } template <typename _Tp> _Tp gcd(const _Tp &a, const _Tp &b) { return (!b) ? a : gcd(b, a % b); } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { return a > 0 ? a : -a; } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b) { return a < b ? b : a; } template <typename _Tp> __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b) { return a < b ? a : b; } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) { (a < b) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) { (a > b) && (a = b); } template <typename _Tp> __inline__ __attribute__((always_inline)) bool _cmp(const _Tp &a, const _Tp &b) { return abs(a - b) <= eps; } template <typename _Tp> __inline__ __attribute__((always_inline)) void read(_Tp &x) { register char ch(getchar()); bool f(false); while (ch < 48 || ch > 57) f |= ch == 45, ch = getchar(); x = ch & 15, ch = getchar(); while (ch >= 48 && ch <= 57) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar(); if (f) x = -x; } template <typename _Tp, typename... Args> __inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) { read(t); read(args...); } __inline__ __attribute__((always_inline)) int read_str(char *s) { register char ch(getchar()); while (ch == || ch == r || ch == n ) ch = getchar(); register char *tar = s; *tar = ch, ch = getchar(); while (ch != && ch != r && ch != n && ch != EOF) *(++tar) = ch, ch = getchar(); return tar - s + 1; } const int N = 100005; int main() { long long n, p; read(n, p); if (p >= n) { printf( -1 n ); return 0; } long long cnt = 0; while (true) { long long now = n - cnt * p; if (now <= 0) break; long long num = 0, maxx = 0; for (long long i = 0; i <= 32; ++i) { if (now & (1ll << i)) { ++num; maxx += i + 1; } } if (num <= cnt && maxx >= cnt) { printf( %lld n , cnt); return 0; } ++cnt; } printf( -1 n ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 2050; const int inf = 0x3f3f3f3f; const int mod = 998244353; long long fpow(long long x, long long y) { long long ans = 1; while (y) { if (y & 1) ans = ans * x % mod; x = x * x % mod; y >>= 1; } return ans; } long long dp[maxn][maxn], a[maxn]; char s[maxn]; int main() { int i, j, k, m, n; scanf( %s , s + 1); n = strlen(s + 1); for (i = 1; i <= n; i++) a[i] = a[i - 1] + (s[i] == ? ); for (k = 2; k <= n; k++) for (i = 1; i + k - 1 <= n; i++) { j = i + k - 1; dp[i][j] = (dp[i][j] + (s[i] != ( ? dp[i + 1][j] : 0)) % mod; dp[i][j] = (dp[i][j] + (s[j] != ) ? dp[i][j - 1] : 0)) % mod; dp[i][j] = (dp[i][j] + mod - (s[i] != ( && s[j] != ) ? dp[i + 1][j - 1] : 0)) % mod; dp[i][j] = (dp[i][j] + (s[i] != ) && s[j] != ( ? (dp[i + 1][j - 1] + fpow(2, a[j - 1] - a[i])) % mod : 0)) % mod; } cout << dp[1][n] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; long long a[N], b[1050], c[N]; int cnt = 0; void init() { cnt = 0; for (int i = 1; i < N - 50; i++) a[cnt++] = i * i; cnt = 0; for (int i = 1; i < 1010; i++) b[cnt++] = i * i * i; int u = 0, t = 0; cnt = 0; while (a[u] && b[t]) { if (a[u] < b[t]) { c[cnt++] = a[u++]; } else if (a[u] == b[t]) { c[cnt++] = a[u++]; t++; } else c[cnt++] = b[t++]; } } int main() { init(); int T; cin >> T; while (T--) { int n; scanf( %d , &n); int i = 0; while (c[i] <= n) { i++; } printf( %d n , i); } return 0; }
|
#include <bits/stdc++.h> using namespace std; void print(vector<long long> &a) { for (int i = 0; i < a.size(); i++) cout << a[i] << n [i == a.size() - 1]; } void print(vector<int> &a) { for (int i = 0; i < a.size(); i++) cout << a[i] << n [i == a.size() - 1]; } void print(int a[], int l, int r) { for (int i = l; i <= r; i++) cout << a[i] << n [i == r]; } void print(long long a[], int l, int r) { for (int i = l; i <= r; i++) cout << a[i] << n [i == r]; } long long qpow(long long x, long long y) { long long temp = x; long long ans = 1; while (y) { if (y & 1) ans = (ans * temp); temp = (temp * temp); y >>= 1; } return ans; } long long qpow(long long x, long long y, long long MOD) { long long temp = x; long long ans = 1; while (y) { if (y & 1) ans = (ans * temp) % MOD; temp = (temp * temp) % MOD; y >>= 1; } return ans; } int dp[200050]; void INIT() { dp[3] = 1; dp[7] = 1; for (int i = 1; i <= 100; i++) if (dp[i]) { dp[i + 3] = 1; dp[i + 7] = 1; } } void solve() { int n; cin >> n; if (dp[n]) { cout << YES << n ; } else { cout << NO << n ; } } int main() { INIT(); int TT; cin >> TT; while (TT--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = (int)1e9 + 7; const int INF = (int)1e9; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; b = r; } return a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long fpow(long long n, long long k, int p = MOD) { long long r = 1; for (; k; k >>= 1) { if (k & 1) r = r * n % p; n = n * n % p; } return r; } template <class T> void setmin(T& a, T val) { if (a > val) a = val; } template <class T> void setmax(T& a, T val) { if (a < val) a = val; } void addmod(long long& a, long long val, int p = MOD) { if ((a = (a + val)) >= p) a -= p; } void submod(long long& a, long long val, int p = MOD) { if ((a = (a - val)) < 0) a += p; } int mult(int a, int b, int p = MOD) { return (long long)a * b % p; } int inv(int a, int p = MOD) { return fpow(a, p - 2, p); } const int N = 100005; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { long long n, m; cin >> n >> m; long long wtotal = n * m / 2, btotal = n * m / 2; if ((n * m) % 2) wtotal++; long long x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2; long long x3, y3, x4, y4; cin >> x3 >> y3 >> x4 >> y4; long long k1 = abs(x2 - x1 + 1) * abs(y2 - y1 + 1), k2 = abs(x4 - x3 + 1) * abs(y4 - y3 + 1); long long black = k1 / 2; if ((x1 + y1) % 2 && k1 % 2) black++; wtotal += black; btotal -= black; long long white = k2 / 2; if ((x3 + y3) % 2 == 0 && k2 % 2) white++; btotal += white; wtotal -= white; long long x5 = max(x1, x3); long long y5 = max(y1, y3); long long x6 = min(x2, x4); long long y6 = min(y2, y4); if (y5 > y6 || x5 > x6) cout << wtotal << << btotal << n ; else { long long bext = abs(x6 - x5 + 1) * abs(y6 - y5 + 1); long long b = bext / 2; if ((x5 + y5) % 2 && bext % 2) b++; cout << wtotal - b << << btotal + b << n ; } } return 0; }
|
#include<bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--) { long long n, m; cin>>n>>m; long k[n], c[m]; for(long i=0;i<n;i++) cin>>k[i]; sort(k,k+n,[](long& a,long& b){ return a>b; }); for(long i=0;i<m;i++) cin>>c[i]; long long p = 0; long long r = 0; for(long long i=0;i<n;i++) { assert(k[i]-1>=0 && k[i]-1 < m); if(p >= m) r += c[k[i]-1]; else if(c[p] < c[k[i]-1]) r += c[p++]; else r += c[k[i]-1]; } cout<<r<< n ; } }
|
#include <bits/stdc++.h> using namespace std; long long int a[100005], sg[100005 * 4], lz[100005 * 4], res, x, y, z, n; void lazy(long long int low, long long int high, long long int pos) { sg[pos] += lz[pos]; if (low != high) lz[pos * 2 + 1] += lz[pos], lz[pos * 2 + 2] += lz[pos]; lz[pos] = 0; } void update(long long int low, long long int high, long long int pos, long long int qlow, long long int qhigh, long long int va) { lazy(low, high, pos); if (qlow > high || qhigh < low) return; if (qlow <= low && high <= qhigh) { sg[pos] += va; if (low != high) lz[pos * 2 + 1] += va, lz[pos * 2 + 2] += va; return; } long long int mid = (high + low) / 2; update(low, mid, pos * 2 + 1, qlow, qhigh, va); update(mid + 1, high, pos * 2 + 2, qlow, qhigh, va); sg[pos] = max(sg[pos * 2 + 1], sg[pos * 2 + 2]); } long long int ans(long long int low, long long int high, long long int pos) { lazy(low, high, pos); if (sg[pos] <= 0) return -1; if (low == high) return a[low]; long long int mid = (high + low) / 2; lazy(low, mid, pos * 2 + 1), lazy(mid + 1, high, pos * 2 + 2); if (sg[pos * 2 + 2] > 0) return ans(mid + 1, high, pos * 2 + 2); else return ans(low, mid, pos * 2 + 1); } int main() { scanf( %lld , &n); for (int i = 0; i < n; i++) { scanf( %lld%lld , &x, &y); x--; if (y == 0) y = -1; else scanf( %lld , &z), a[x] = z; update(0, n, 0, 0, x, y); res = ans(0, n, 0); printf( %lld n , res); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long inf = 12345678987654321ll; long long dp[3000]; int n; int main() { cin >> n; int t, c; for (int i = 1; i <= n; i++) dp[i] = inf; for (int i = 1; i <= n; i++) { cin >> t >> c; ++t; for (int i = n + t; i > n; i--) { dp[n] = min(dp[n], dp[i - t] + c); } for (int i = n; i - t >= 0; i--) { dp[i] = min(dp[i], dp[i - t] + c); } } cout << dp[n] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:102400000,102400000 ) const int maxn = 1e5 + 300; const int INF = 0x3f3f3f3f; int main() { int k; scanf( %d , &k); if (k == 1) { puts( YES n2 1 n1 2 ); } else if (k % 2 == 0) { puts( NO ); } else { puts( YES ); printf( %d %d n , 2 * k + 4, k * (k + 2)); for (int i = 2; i <= k; i++) { printf( 1 %d n , i); } int nn = k + 2; for (int i = 2; i <= k; i++) { printf( %d %d n , i, k + 1); printf( %d %d n , i, k + 2); for (int j = i + 1; j <= k; j++) { if (i % 2 == 0 && j == i + 1) continue; printf( %d %d n , i, j); } } printf( %d %d n , k + 1, k + 2); for (int i = 2; i <= k; i++) { printf( %d %d n , 1 + nn, i + nn); } for (int i = 2; i <= k; i++) { printf( %d %d n , i + nn, nn + k + 1); printf( %d %d n , i + nn, nn + k + 2); for (int j = i + 1; j <= k; j++) { if (i % 2 == 0 && j == i + 1) continue; printf( %d %d n , i + nn, j + nn); } } printf( %d %d n , k + 1 + nn, k + 2 + nn); printf( %d %d n , 1, nn + 1); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, res = 0, i, t; vector<string> v; cin >> n; for (i = 0; i < n; i++) { string s; cin >> s; v.push_back(s); } for (int j = 0; j < 7; j++) { t = 0; for (i = 0; i < n; i++) { if (v[i][j] == 1 ) t++; } res = max(t, res); } cout << res << endl; }
|
#include <bits/stdc++.h> using namespace std; const long double EPS = 1E-9; const int INF = (int)1E9; const long long INF64 = (long long)1E18; const long double PI = 2 * acos(.0); long long dp[10][10][2]; vector<int> number; int pivot = 1; long long solve(int pos, bool is_bounded, int lucky_digits) { long long &memo = dp[pos][lucky_digits][is_bounded]; if (lucky_digits > pivot) return 0; if (pos == (int)(number).size()) return 1; if (memo != -1) return memo; memo = 0; int upto = 9; if (is_bounded) upto = number[pos]; for (int i = 0; i <= upto; i++) { bool next_bound = is_bounded && (upto == i); int next_lucky = lucky_digits + ((i == 4 || i == 7) ? 1 : 0); int next_pos = pos + 1; memo += solve(next_pos, next_bound, next_lucky); } return memo; } const long long MOD = 1000000007ll; long long bigPow(long long a, long long b) { long long resp = 1; while (b) { if (b & 1) resp = (resp * a) % MOD; a = (a * a) % MOD; b >>= 1; } return resp % MOD; } long long inv(long long x) { return bigPow(x, MOD - 2); } long long binCoefRec(int nn, int kk) { if (nn == kk) return 1ll; if (kk == 0) return 1ll; long long bin = (binCoefRec(nn - 1, kk - 1) * nn) % MOD; long long resp = (bin * inv(kk)) % MOD; return resp; } set<string> occur_set[10]; bool cent[10]; void find_occur(string seed, int times, int last) { if (times > 9) return; occur_set[times].insert(seed); for (int i = last; i < (int)(10); i++) { seed[i]++; seed[0]--; find_occur(seed, times + i, i); seed[i]--; seed[0]++; } } int main() { ios_base::sync_with_stdio(0); int m; cin >> m; while (m) { number.push_back(m % 10); m /= 10; } reverse(number.begin(), number.end()); long long lucky_id[10]; long long calc = 0, calc_bef = 0; long long ans = 0; find_occur( 6000000000 , 0, 1); for (pivot = 0; pivot < 10; pivot++) { for (int i = 0; i < (int)(10); i++) for (int j = 0; j < (int)(10); j++) for (int k = 0; k < (int)(2); k++) dp[i][j][k] = -1; calc = solve(0, true, 0) - 1; lucky_id[pivot] = calc - calc_bef; calc_bef = calc; if (pivot == 0 || lucky_id[pivot] == 0) continue; for (int x = 0; x < pivot; x++) { set<string>::iterator p = occur_set[x].begin(); while (p != occur_set[x].end()) { long long temp = 1; bool cant = 1; for (int i = 0; i < (int)((*p).size()); i++) { if (i > pivot) continue; if ((*p)[i] < 0 || lucky_id[i] < ((*p)[i] - 0 )) { cant = 0; break; } temp = (((temp) % MOD) * binCoefRec(lucky_id[i], (*p)[i] - 0 )) % MOD; } if (cant == 0) temp = 0; else temp = (temp * lucky_id[pivot]) % MOD; ans = (ans + temp * 720) % MOD; p++; } } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void run_case() { long long n; cin >> n; vector<long long> a(n, 0); for (long long i = 0; i < n; i++) cin >> a[i]; long long mini[n]; mini[n - 1] = a[n - 1]; for (long long i = n - 2; i >= 0; i--) { mini[i] = min(mini[i + 1], a[i]); } for (long long i = 0; i < n; i++) { long long idx = lower_bound(mini + i + 1, mini + n, a[i]) - mini; cout << idx - i - 2 << ; } } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(20); long long tests = 1; for (long long tt = 1; tt <= tests; tt++) { run_case(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long i, j, k, n, m, x, y, T, ans, mx, mi, cas, num, len; bool flag; long long a[105]; const int mod = 1000000007; typedef struct matrixnod { long long m[105][105]; } matrix; matrix mat(matrix a, matrix b) { matrix c; for (long long i = 0; i < x; i++) { for (long long j = 0; j < x; j++) { c.m[i][j] = 0; for (long long k = 0; k < x; k++) { c.m[i][j] += a.m[i][k] * b.m[k][j]; c.m[i][j] %= mod; } } } return c; } matrix p, f; matrix doexpmat(matrix f, long long num) { matrix b; long long i, j; for (i = 0; i < x; i++) { for (j = 0; j < x; j++) { if (i == j) b.m[i][j] = 1; else b.m[i][j] = 0; } } while (num) { if (num & 1) b = mat(b, f); num = num >> 1; f = mat(f, f); } return b; } long long b, t; int main() { scanf( %I64d%I64d%I64d%I64d , &n, &b, &k, &x); for (i = 1; i <= n; i++) { scanf( %I64d , &t); a[t]++; } for (i = 0; i < x; i++) { for (j = 0; j < 10; j++) { f.m[i][(i * 10 + j) % x] += a[j]; f.m[i][(i * 10 + j) % x] %= mod; } } matrix pp = doexpmat(f, b); printf( %I64d n , pp.m[0][k]); return 0; }
|
#include <bits/stdc++.h> using namespace std; bool v[5050]; int main() { ios::sync_with_stdio(0); int n; cin >> n; int x[n]; set<int> st; int r = 0; for (int i = 0; i < n; i++) { cin >> x[i]; if (x[i] > n) r++; else { st.insert(x[i]); } } cout << n - (st.size()); return 0; }
|
#include <bits/stdc++.h> using namespace std; struct __s { __s() { if (1) { ios_base::Init i; cin.sync_with_stdio(0); cin.tie(0); } } ~__s() { if (!1) fprintf(stderr, Execution time: %.3lf s. n , (double)clock() / CLOCKS_PER_SEC); long long n; cin >> n; } } __S; int main(void) { long long n; cin >> n; long long k = 32; while (n) { while (n < (1LL << k)) k--; cout << k + 1 << ; n -= (1LL << k); } cout << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[200010], c[200010]; int main() { int n, t, k; scanf( %d%d%d , &n, &t, &k); for (int i = 1; i <= t; i++) scanf( %d , &a[i]); a[0] = (k > n - t ? 2 : 1); for (int i = 0; i <= t; i++) { c[i] = min(a[i], a[i + 1]); k -= a[i] - c[i]; } if (k < 0 || a[0] > 1) { puts( -1 ); return 0; } for (int i = t - 1; i > 0; i--) { int q = min(c[i] - 1, k); k -= q; c[i] -= q; } int id = 1; printf( %d n , n); for (int i = 0; i < t; i++) { for (int j = 0; j < a[i + 1]; j++) printf( %d %d n , id + j % c[i], id + a[i] + j); id += a[i]; } }
|
#include <bits/stdc++.h> int colour[100001]; int main() { int n, m; scanf( %d %d , &n, &m); int vect1[n], vect2[n], vect3[n]; for (int i = 0; i < m; i++) { scanf( %d %d %d , &vect1[i], &vect2[i], &vect3[i]); } int white = 1, red = 1, blue = 1; for (int i = 0; i < m; i++) { white = 1, red = 1, blue = 1; if (colour[vect1[i]] == 0 && colour[vect2[i]] == 0 && colour[vect3[i]] == 0) { colour[vect1[i]] = 1; colour[vect2[i]] = 2; colour[vect3[i]] = 3; continue; } if (colour[vect1[i]] == 1 || colour[vect2[i]] == 1 || colour[vect3[i]] == 1) white = -1; if (colour[vect1[i]] == 2 || colour[vect2[i]] == 2 || colour[vect3[i]] == 2) red = -1; if (colour[vect1[i]] == 3 || colour[vect2[i]] == 3 || colour[vect3[i]] == 3) blue = -1; if (white == -1) { if (colour[vect1[i]] == 1) { colour[vect2[i]] = 2; colour[vect3[i]] = 3; } else if (colour[vect2[i]] == 1) { colour[vect1[i]] = 2; colour[vect3[i]] = 3; } else { colour[vect1[i]] = 2; colour[vect2[i]] = 3; } } else if (red == -1) { if (colour[vect1[i]] == 2) { colour[vect2[i]] = 1; colour[vect3[i]] = 3; } else if (colour[vect2[i]] == 2) { colour[vect1[i]] = 1; colour[vect3[i]] = 3; } else { colour[vect1[i]] = 1; colour[vect2[i]] = 3; } } else { if (colour[vect1[i]] == 3) { colour[vect2[i]] = 1; colour[vect3[i]] = 2; } else if (colour[vect2[i]] == 3) { colour[vect1[i]] = 1; colour[vect3[i]] = 2; } else { colour[vect1[i]] = 1; colour[vect2[i]] = 2; } } } for (int i = 1; i <= n; i++) printf( %d , colour[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, k, w; char ax[500005]; char bx[500005]; int Next[500005], next2[500005]; int sig[500005][2]; int hh[500005][2]; bool tepan() { int i, j, a, b; for (i = 1; i <= n; i++) { if (sig[i][0] == m) { w = max(1, i - k + 1); w = min(w, n - 2 * k + 1); return 1; } } return 0; } void kmp() { int i, j = 0, a, b; for (i = 2; i <= m; i++) { while (j && bx[i] != bx[j + 1]) j = Next[j]; if (bx[i] == bx[j + 1]) j++; Next[i] = j; } j = 0; for (i = 1; i <= n; i++) { while (j && ax[i] != bx[j + 1]) j = Next[j]; if (bx[j + 1] == ax[i]) j++; sig[i][0] = j; } next2[m + 1] = m + 1; next2[m] = m + 1; j = m + 1; for (i = m - 1; i; i--) { while (j != m + 1 && bx[i] != bx[j - 1]) j = next2[j]; if (bx[i] == bx[j - 1]) j--; next2[i] = j; } j = m + 1; for (i = n; i; i--) { while (j != m + 1 && ax[i] != bx[j - 1]) j = next2[j]; if (bx[j - 1] == ax[i]) j--; sig[i][1] = j; } } int main() { scanf( %d%d%d , &n, &m, &k); int i, j, a, b; scanf( %s%s , ax + 1, bx + 1); kmp(); if (k >= m && tepan()) { printf( Yes n%d %d , w, n - k + 1); return 0; } for (i = 1; i <= n - k + 1; i++) hh[sig[i][1]][1] = i; for (i = n; i >= k; i--) hh[sig[i][0]][0] = i; for (i = n; i; i--) { if (hh[i][0]) hh[Next[i]][0] = min(hh[Next[i]][0], hh[i][0]); } for (i = 1; i <= n; i++) if (hh[i][1]) hh[next2[i]][1] = max(hh[next2[i]][1], hh[i][1]); int x; if (k >= m) x = m; else x = k + 1; for (i = 1; i < x; i++) { if (m - i > k) continue; j = 1 + i; if (hh[i][0] && hh[j][1] && hh[i][0] < hh[j][1]) { printf( Yes n%d %d , hh[i][0] - k + 1, hh[j][1]); return 0; } } printf( No ); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 2; int ar[N], ar1[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); int n, i, j, k, l, r; long long sum; cin >> n >> sum; if (sum < 1ll * n * (n + 1) / 2) { cout << -1; return 0; } for (i = 1; i <= n; i++) { ar[i] = i; ar1[i] = i; } l = 1; r = n; sum -= 1ll * n * (n + 1) / 2; while (sum && l < r) { if (sum > r - l) { sum -= (r - l); swap(ar1[l], ar1[r]); l++; r--; } else { swap(ar1[r], ar1[r - sum]); break; } } sum = 0; for (i = 1; i <= n; i++) { sum += max(ar[i], ar1[i]); } cout << sum << n ; for (i = 1; i <= n; i++) { cout << ar[i] << ; } cout << n ; for (i = 1; i <= n; i++) { cout << ar1[i] << ; } }
|
#include <bits/stdc++.h> using namespace std; bool mark[10][10][10][10]; int n, ans; int main() { memset(mark, false, sizeof(mark)); scanf( %d , &n); while (n--) { string x, y, z; if (n == 0) { cin >> x; cin >> y; } else { cin >> x; cin >> y; cin >> z; } if (!mark[x[0] - 0 ][x[1] - 0 ][y[0] - 0 ][y[1] - 0 ]) { ans++; mark[x[0] - 0 ][x[1] - 0 ][y[0] - 0 ][y[1] - 0 ] = true; mark[x[1] - 0 ][y[1] - 0 ][x[0] - 0 ][y[0] - 0 ] = true; mark[y[1] - 0 ][y[0] - 0 ][x[1] - 0 ][x[0] - 0 ] = true; mark[y[0] - 0 ][x[0] - 0 ][y[1] - 0 ][x[1] - 0 ] = true; } } printf( %d , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; int N; vector<int> adj[200001]; vector<int> L[200001]; vector<int> R[200001]; int dp[200001]; int ans[200001]; inline void addmod(int& x, int v) { x += v; if (x >= MOD) x -= MOD; } void dfs(int u, int p) { for (auto& v : adj[u]) if (v != p) dfs(v, u); dp[u] = 1; L[u].resize(adj[u].size()); R[u].resize(adj[u].size()); int tmp = 1; for (size_t i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (v == p) { if (i == 0) L[u][i] = 1; else L[u][i] = L[u][i - 1]; continue; } tmp = 1LL * tmp * (dp[v] + 1) % MOD; L[u][i] = tmp; } tmp = 1; for (int i = adj[u].size() - 1; i >= 0; i--) { int v = adj[u][i]; if (v == p) { if (i == (int)adj[u].size() - 1) R[u][i] = 1; else R[u][i] = R[u][i + 1]; continue; } tmp = 1LL * tmp * (dp[v] + 1) % MOD; R[u][i] = tmp; } dp[u] = R[u][0]; } void dfs2(int u, int p, int x) { ans[u] = dp[u]; for (size_t i = 0; i < adj[u].size(); i++) { int v = adj[u][i]; if (v == p) continue; int tmpu = dp[u]; int tmpv = dp[v]; dp[u] = 1LL * (i ? L[u][i - 1] : 1) * (i + 1 < adj[u].size() ? R[u][i + 1] : 1) % MOD * x % MOD; dp[v] = 1LL * dp[v] * (dp[u] + 1) % MOD; dfs2(v, u, dp[u] + 1); dp[u] = tmpu; dp[v] = tmpv; } } int main() { scanf( %d , &N); int a; for (int i = 2; i <= N; i++) { scanf( %d , &a); adj[a].push_back(i); adj[i].push_back(a); } dfs(1, -1); dfs2(1, -1, 1); for (int i = 1; i <= N; i++) printf( %d%c , ans[i], n [i == N]); return 0; }
|
#include <bits/stdc++.h> using namespace std; string str; int cnt1, cnt2; int main() { cin >> str; for (int i = 0; i < str.size(); i++) str[i] == o ? cnt1++ : cnt2++; puts(cnt1 == 0 || cnt2 % cnt1 == 0 ? YES : NO ); return 0; }
|
#include <bits/stdc++.h> int main() { int a, b, h = 0, r = 0; scanf( %d %d , &a, &b); while (a > 0) { h += a; r += a % b; a = a / b; while (r >= b) { a++; r -= b; } } printf( %d n , h); }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void out(T x) { cout << x << endl; exit(0); } const long long mod = 1e9 + 7; const int maxn = 1e6 + 5; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n, start, x; int ans = 1e9 + 10; int beforeVal = -1; int beforeIdx; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> start >> x; beforeIdx = start; vector<int> v; for (int i = 1; i <= n; i++) { v.push_back(i); } shuffle(v.begin(), v.end(), rng); v.resize(min(n, 999)); for (int q : v) { cout << ? << q << endl; cout.flush(); int val; int nxt; cin >> val >> nxt; if (val >= x) { ans = min(ans, val); } else { if (val > beforeVal) { beforeVal = val; beforeIdx = nxt; } } } for (int i = 0; i < 1000; i++) { if (beforeIdx == -1) break; cout << ? << beforeIdx << endl; cout.flush(); int val; int nxt; cin >> val >> nxt; if (val >= x) { ans = min(ans, val); } beforeIdx = nxt; } if (ans == 1e9 + 10) ans = -1; cout << ! << ans << endl; cout.flush(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long M = 1000000007; signed main() { long long t; cin >> t; for (long long u = 0; u < t; u++) { long long k = 0; vector<long long> v; string s; cin >> s; for (long long i = 0; i < s.size(); i++) { if (i + 4 < s.size() && (s[i] == t && s[i + 1] == w && s[i + 2] == o && s[i + 3] == n && s[i + 4] == e )) { v.push_back(i + 3); i += 4; } else if (i + 2 < s.size()) { if ((s[i] == o && s[i + 1] == n && s[i + 2] == e ) || (s[i] == t && s[i + 1] == w && s[i + 2] == o )) { v.push_back(i + 2); i += 2; } } } cout << v.size() << endl; for (long long i = 0; i < v.size(); i++) cout << v[i] << ; cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { long int quant, mul; scanf( %ld %ld , &quant, &mul); long int *nums = (long int *)calloc(quant, sizeof(long int)); set<long int> s; for (long int i = 0; i < quant; i++) { scanf( %ld , &nums[i]); } sort(nums, nums + quant); for (long int i = 0; i < quant; i++) { if (nums[i] % mul != 0 || s.count(nums[i] / mul) == 0) { s.insert(nums[i]); } } printf( %ld n , s.size()); free(nums); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 1; int main() { { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int t; cin >> t; while (t--) { int n, m, k; cin >> n >> m >> k; priority_queue<pair<int, int>> pq; for (int i = 0; i < n; ++i) { pq.push({0, i + 1}); } for (int i = 0; i < k; ++i) { set<int> all; for (int j = 0; j < n; ++j) { all.insert(j + 1); } priority_queue<pair<int, int>> next; for (int j = 0; j < n % m; ++j) { cout << (n + m - 1) / m; for (int l = 0; l < (n + m - 1) / m; ++l) { cout << << pq.top().second; all.erase(pq.top().second); next.push({pq.top().first - 1, pq.top().second}); pq.pop(); } cout << n ; } for (int j = 0; j < m - (n % m); ++j) { cout << (n / m); for (int l = 0; l < n / m; ++l) { cout << << *all.begin(); all.erase(all.begin()); } cout << n ; } while (!next.empty()) { pq.push(next.top()); next.pop(); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; pair<int, int> a[107][107]; int b[107][107]; int main() { int m, p; scanf( %d %d , &m, &p); int i, j; for (i = 1; i <= m; i++) for (j = 1; j <= p; j++) a[i][j].first = i, a[i][j].second = j; int q; scanf( %d , &q); while (q--) { int type; scanf( %d , &type); if (type == 1) { int tem; scanf( %d , &tem); pair<int, int> temp = a[tem][1]; for (i = 1; i < p; i++) a[tem][i] = a[tem][i + 1]; a[tem][p] = temp; } else if (type == 2) { int tem; scanf( %d , &tem); pair<int, int> temp = a[1][tem]; for (i = 1; i < m; i++) a[i][tem] = a[i + 1][tem]; a[m][tem] = temp; } else { int aa, bb; int tem; scanf( %d %d %d , &aa, &bb, &tem); b[a[aa][bb].first][a[aa][bb].second] = tem; } } for (i = 1; i <= m; i++) { for (j = 1; j <= p; j++) printf( %d , b[i][j]); printf( n ); } return 0; }
|
#include <bits/stdc++.h> inline int sbt(int x) { return __builtin_popcount(x); } using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } vector<int> adj[100013]; int par[100013][33]; vector<int> dfslevel[100013]; int start[100013]; int endt[100013]; int lev[100013]; int n, k; int timer = 0; void dfs(int node, int p, int level) { start[node] = timer; timer++; lev[node] = level; dfslevel[level].push_back(start[node]); par[node][0] = p; for (auto nei : adj[node]) { if (nei != p) { dfs(nei, node, level + 1); } } endt[node] = timer; timer++; } int f(int node) { int curr = node; for (int i = 33 - 1; i >= 0; i--) { if (k & (1ll << i)) { curr = par[curr][i]; } } return curr; } int main() { cin.sync_with_stdio(false); cout.sync_with_stdio(false); cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; adj[x].push_back(i); adj[i].push_back(x); } dfs(0, -1, 0); for (int i = 1; i < 33; i++) { for (int node = 1; node <= n; node++) { par[node][i] = par[par[node][i - 1]][i - 1]; } } int q; cin >> q; while (q--) { int u; cin >> u >> k; int node_level = lev[u]; int target = f(u); if (target <= 0) { cout << 0 << ; continue; } int shuru = start[target]; int khatam = endt[target]; int same_lev = (lower_bound(dfslevel[node_level].begin(), dfslevel[node_level].end(), khatam) - lower_bound(dfslevel[node_level].begin(), dfslevel[node_level].end(), shuru)) - 1; cout << same_lev << ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct S { long long t, w; } s[300009]; bool comp(S a, S b) { return a.t > b.t; } int main() { int n; scanf( %d , &n); n--; long long c, tmp; scanf( %lld %lld , &c, &tmp); for (int i = 0; i < n; i++) { scanf( %lld %lld , &s[i].t, &s[i].w); } sort(s, s + n, comp); int ans = n + 1; int j = 0; multiset<long long> S; while (true) { while (j < n && s[j].t > c) { S.insert(s[j].w - s[j].t + 1); j++; } ans = min(ans, (int)S.size() + 1); if (S.empty() || *S.begin() > c) { break; } c -= *S.begin(); S.erase(S.begin()); } printf( %d , ans); }
|
#include <bits/stdc++.h> using namespace std; int vis[200003], nd, lm, fl, bad[200003]; vector<int> g[200003]; int expo(int y) { long long x = 2ll, res = 1ll; while (y) { if (y & 1) { res = (res * x); if (res >= 1000000007) res %= 1000000007; } y >>= 1; x *= x; if (x >= 1000000007) x %= (long long)1000000007; } return (int)res; } void dfs(int s, int l) { vis[s] = 1; lm = max(l, lm); bad[s] = 1; if (!vis[g[s][0]]) { dfs(g[s][0], l + 1); } else if (vis[g[s][0]] && bad[g[s][0]]) { nd = g[s][0]; fl = 1; } bad[s] = 0; } int main() { int n; scanf( %d , &(n)); for (int(i) = (0); (i) < (n); (i)++) { int x; scanf( %d , &(x)); g[i + 1].push_back(x); } memset(vis, 0, sizeof(vis)); int cnt = 0; long long ans = 1ll; for (int i = 1; i <= n; ++i) { if (vis[i]) continue; fl = 0; dfs(i, 1); if (!fl) continue; lm = 1; int node = g[nd][0]; while (node != nd) { node = g[node][0]; ++lm; } ans *= (long long)expo(lm) - 2ll; if (ans >= 1000000007) ans %= (long long)1000000007; cnt += lm; } ans *= (long long)expo(n - cnt); ans %= (long long)1000000007; printf( %d n , (int)ans); return 0; }
|
#include <bits/stdc++.h> int deg[25]; double g[25][25]; double p[510][510]; int main() { int n, m, a, b; scanf( %d%d%d%d , &n, &m, &a, &b); a--; b--; int s = n * n; int x, y; for (int i = 0; i < m; i++) { scanf( %d%d , &x, &y); x--; y--; deg[x]++; deg[y]++; g[x][y] = g[y][x] = 1; } for (int i = 0; i < n; i++) { scanf( %lf , &g[i][i]); for (int j = 0; j < n; j++) { if (i != j) { g[i][j] *= (1 - g[i][i]) / (double)deg[i]; } } } for (int i = 0; i < s; i++) { x = i / n; y = i % n; p[i][i] = -1; if (x != y) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { p[j * n + k][i] += g[x][j] * g[y][k]; } } } } p[n * a + b][s] = -1; double tmp; for (int i = 0; i < s; i++) { if (fabs(p[i][i]) < 1e-10) for (int j = i + 1; j < s; j++) if (fabs(p[j][i]) > 1e-10) for (int k = i; k < s + 1; k++) std::swap(p[i][k], p[j][k]); tmp = p[i][i]; for (int k = i; k < s + 1; k++) p[i][k] /= tmp; for (int j = 0; j < s; j++) if (i != j && fabs(tmp = p[j][i]) > 1e-10) for (int k = i; k < s + 1; k++) p[j][k] -= tmp * p[i][k]; } for (int i = 0; i < n; i++) { printf( %.9lf , p[n * i + i][s]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int A[2005][2005]; int N, P[2005]; const int MOD = 998244353; int DP[2005][2005]; bool FreeIn[2005], FreeOut[2005]; int Arb[2][2005], Fact[2005]; int Power[2005]; inline long long norm(long long x) { return x >= MOD ? x - MOD : x; } void precalcPower() { Power[0] = 1; for (int i = 1; i <= N; i++) { Power[i] = (1LL * Power[i - 1] * DP[0][N]) % MOD; } } void update(int ind, int pos, int val) { while (pos <= N) { Arb[ind][pos] += val; pos += (pos & (-pos)); } } int sum(int ind, int pos) { int ans = 0; while (pos >= 1) { ans += Arb[ind][pos]; pos -= (pos & (-pos)); } return ans; } bool check(int N) { P[1] = 0; P[0] = 1; for (int i = 2; i <= N; i++) { int aux = norm(P[i - 1] + P[i - 2]); P[i] = (1LL * (i - 1) * aux) % MOD; } for (int i = 1; i <= N; i++) if (DP[0][i] != P[i]) return false; return true; } void precalcDP(int N) { DP[0][0] = 1; for (int j = 0; j <= N; j++) { for (int i = 0; i <= N; i++) { if (i == 0 && j == 0) continue; if (i > 0) { DP[i][j] = (1LL * DP[i - 1][j] * i) % MOD; if (j > 0) DP[i][j] = norm(DP[i][j] + (1LL * DP[i][j - 1] * j) % MOD); } else { if (j >= 2) DP[i][j] = (1LL * DP[i + 1][j - 2] * (j - 1)) % MOD; } } } } void Read() { scanf( %d , &N); for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) scanf( %d , &A[i][j]); } void precalcFact() { Fact[0] = 1; for (int i = 1; i <= N; i++) Fact[i] = (1LL * Fact[i - 1] * i) % MOD; } void clear() { for (int i = 1; i <= N; i++) { FreeIn[i] = FreeOut[i] = true; Arb[0][i] = Arb[1][i] = 0; } for (int i = 1; i <= N; i++) update(1, i, 1); } void Solve() { int ans = 0; clear(); for (int i = 1; i <= N; i++) { for (int j = 1; j < A[1][i]; j++) { if (FreeIn[j]) ans = norm(ans + (1LL * Fact[N - i] * Power[N - 1]) % MOD); } FreeIn[A[1][i]] = false; } for (int i = 2; i <= N; i++) { clear(); int x = 0, y = N; int aux = Power[N - i]; for (int j = 1; j <= N; j++) { int val = A[i][j]; if (FreeIn[A[i - 1][j]]) { int freeOut = sum(1, val - 1) - (A[i - 1][j] < A[i][j]); int busyOut = sum(0, val - 1); if (y >= 2) ans = norm(ans + (((1LL * DP[x + 1][y - 2] * freeOut) % MOD) * aux) % MOD); if (y >= 1) ans = norm(ans + (((1LL * DP[x][y - 1] * busyOut) % MOD) * aux) % MOD); } else { int freeOut = sum(1, val - 1); int busyOut = sum(0, val - 1); if (y > 0) ans = norm(ans + (((1LL * DP[x][y - 1] * freeOut) % MOD) * aux) % MOD); if (x > 0) ans = norm(ans + (((1LL * DP[x - 1][y] * busyOut) % MOD) * aux) % MOD); } if (FreeOut[A[i][j]]) { if (FreeIn[A[i - 1][j]]) x += 1, y -= 2; else y--; } else { if (FreeIn[A[i - 1][j]]) y--; else x--; } if (FreeOut[A[i][j]]) { update(1, A[i][j], -1); } else update(0, A[i][j], -1); FreeIn[A[i][j]] = false; if (FreeIn[A[i - 1][j]]) { update(1, A[i - 1][j], -1); update(0, A[i - 1][j], 1); } FreeOut[A[i - 1][j]] = false; } } printf( %d n , ans); } int main() { Read(); precalcFact(); precalcDP(N); precalcPower(); Solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int INF = std::numeric_limits<int>::max(); struct Cmp { Cmp(const vector<deque<int>>& cont) : cont_(&cont) {} bool operator()(int i, int j) const { do { if (!(!cont_->at(i).empty())) { std::cerr << empty deque << std::endl; assert(false); } } while (false); do { if (!(!cont_->at(j).empty())) { std::cerr << empty deque << std::endl; assert(false); } } while (false); return cont_->at(i).front() < cont_->at(j).front() || (cont_->at(i).front() == cont_->at(j).front() && i > j); } const vector<deque<int>>* cont_; }; void solve() { int n; cin >> n; vector<deque<int>> a(n); int numTasks = 0; for (int i = 0; i < int(n); ++i) { int k; cin >> k; numTasks += k; { int x; cin >> x; a[i].push_back(x); } long long x, y, m; cin >> x >> y >> m; for (int j = 0; j < int(k - 1); ++j) { a[i].push_back((a[i].back() * x + y) % m); } } a.push_back(deque<int>()); a.back().push_back(-1); Cmp cmp(a); std::set<int, Cmp> q(cmp); for (int i = 0; i < int(n); ++i) q.insert(i); int numDecs = 0; bool print = numTasks <= 200 * 1000; vector<pair<int, int>> output; while (!q.empty()) { auto it = q.lower_bound(n); if (it == q.end()) { it = q.begin(); } q.erase(it); int i = *it; do { if (!(!a[i].empty())) { std::cerr << empty deque << std::endl; assert(false); } } while (false); if (a[i].front() < a.back().back()) { ++numDecs; } a.back().back() = a[i].front(); if (print) { output.push_back(make_pair(a[i].front(), i + 1)); } a[i].pop_front(); if (!a[i].empty()) { q.insert(i); } } cout << numDecs << endl; for (int i = 0; i < int(output.size()); ++i) { cout << output[i].first << << output[i].second << endl; } } int main() { ios_base::sync_with_stdio(false); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int a[100005]; int tmp[100005]; int sl = 0; int dp[100005]; int zs = 0; int sz[1200005]; int dd[100005]; int cl[100005]; vector<int> g[100005]; int sol() { zs = 0; for (int i = 1; i <= sl; ++i) { int u = tmp[i]; for (auto &v : g[u]) { cl[v]++; if (cl[v] == 1) sz[++zs] = v; } } sort(sz + 1, sz + zs + 1); int cnt = 0; for (int i = zs; i >= 1; --i) { dd[sz[i]] = (dd[sz[i]] + (1ll * cl[sz[i]] * cl[sz[i]]) % 1000000007) % 1000000007; cnt = 0; for (auto &v : g[sz[i]]) if (v != sz[i]) dd[v] = (dd[v] - dd[sz[i]] + 1000000007) % 1000000007; } int res = 0; for (int i = 1; i <= zs; ++i) { res = (res + (1ll * dd[sz[i]] * sz[i]) % 1000000007) % 1000000007; dd[sz[i]] = 0; cl[sz[i]] = 0; } return res; } int main() { ios ::sync_with_stdio(false); cin >> n; int ans = 0; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= 100000; ++i) for (int j = 1; j * j <= i; ++j) if (i % j == 0) { g[i].push_back(j); if (j * j != i) g[i].push_back(i / j); } for (int i = 1; i <= n; ++i) { sl = 0; for (int j = 1; i * j <= n; ++j) tmp[++sl] = a[i * j]; dp[i] = sol(); } for (int i = n; i >= 1; --i) for (int j = 2; i * j <= n; ++j) dp[i] = (dp[i] - dp[i * j] + 1000000007) % 1000000007; for (int i = 1; i <= n; ++i) ans = (ans + (1ll * i * dp[i]) % 1000000007) % 1000000007; cout << ans; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; long long cnt[N]; int main() { long long n, k; cin >> n >> k; long long sum = 0, right = 0, left = 0; for (int i = 0; i < n; i++) { cin >> cnt[i]; sum += cnt[i]; right = max(right, cnt[i]); } if (sum == k) { return 0; } else if (sum < k) { puts( -1 ); return 0; } while (left < right) { sum = 0; long long mid = (left + right) / 2; for (int i = 0; i < n; i++) { sum += min(cnt[i], mid); } if (sum < k) left = mid + 1; else if (sum > k) right = mid - 1; else { left = right = mid; break; } } sum = 0; for (int i = 0; i < n; i++) sum += min(cnt[i], left); if (sum > k) left--; sum = 0; for (int i = 0; i < n; i++) { sum += min(left, cnt[i]); cnt[i] -= min(left, cnt[i]); } sum = k - sum; int ind = 0; vector<int> tmp, res; for (ind = 0; ind < n && sum > 0; ind++) { if (cnt[ind] > 0) { cnt[ind]--; sum--; if (cnt[ind] > 0) tmp.push_back(ind + 1); } } for (; ind < n; ind++) if (cnt[ind] > 0) res.push_back(ind + 1); for (int i = 0; i < (int)tmp.size(); i++) res.push_back(tmp[i]); int len = (int)res.size(); for (int i = 0; i < len; i++) { printf( %d%c , res[i], i == len - 1 ? n : ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; long long a, b, w, x; int main() { while (scanf( %d , &n) != EOF) { cin >> a >> b; for (int i = 1; i <= n; i++) { scanf( %I64d , &w); x = w * a / b; x = x * b; printf( %I64d%c , (w * a - x) / a, n [i == n]); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main(int argc, char const* argv[]) { string a, inp, min; int n, i, l; cin >> a >> n; l = a.size(); min = ; while (n--) { cin >> inp; for (i = 0; i < l; i++) if (inp[i] != a[i]) break; if (i == l && (inp < min || min == )) min = inp; } if (min == ) cout << a << endl; else cout << min << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; char rd; int sig; template <class T> inline void read(T &a) { for (a = 0, rd = getchar(); ( 0 > rd || rd > 9 ) && rd != - ; rd = getchar()) ; for (rd == - ? sig = -1, rd = getchar() : sig = 1; 0 <= rd && rd <= 9 ;) a *= 10, a += rd - 0 , rd = getchar(); a *= sig; } int n, k, l[100005], r[100005]; int main() { read(n); read(k); int tot = 0; for (int i = (1); i <= (n); ++i) read(l[i]), read(r[i]), tot += r[i] - l[i] + 1; int ans = (k - tot % k) % k; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { map<string, int> mp; vector<string> vec; string s; int n, m, v; double k; cin >> n >> m >> k; for (int i = 0; i < n; i++) { cin >> s >> v; if (v >= 100) { mp[s] = k * v + 1e-9; if (mp[s] >= 100) vec.push_back(s); else mp[s] = 0; } } for (int i = 0; i < m; i++) { cin >> s; if (!mp[s]) vec.push_back(s); } sort(vec.begin(), vec.end()); cout << vec.size() << n ; for (int i = 0; i < vec.size(); i++) { cout << vec[i] << << mp[vec[i]] << n ; } }
|
#include <bits/stdc++.h> int main() { int n; long long x; scanf( %d , &n); x = (n - 2); x = x * x; printf( %I64d , x); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char c = getchar(); bool p = 0; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) p = 1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); if (p) x = -x; } const int N = 1005, M = 10005; const long long INF = 1000000000000000000; struct node { int id; long long val; node() {} node(int _id, long long _val) { id = _id; val = _val; } bool operator<(node x) const { return val > x.val; } }; int n, m, s, t; long long L; int head[N], pnt[M << 1], nxt[M << 1], E = 0; int mark[M << 1], fm[M << 1], to[M << 1]; long long weight[M << 1]; void add_edge(int a, int b, long long c) { pnt[E] = b; nxt[E] = head[a]; weight[E] = c; head[a] = E++; } priority_queue<node> q; long long dist[N][2]; long long diff = 0; void dijkstra(int s, int opt) { for (int i = 1; i <= n; ++i) dist[i][opt] = INF; dist[s][opt] = 0; while (!q.empty()) q.pop(); q.push(node(s, 0)); while (!q.empty()) { node now = q.top(); q.pop(); int u = now.id; if (dist[u][opt] != now.val) continue; for (int i = head[u], v; i != -1; i = nxt[i]) { v = pnt[i]; if (opt) { if (mark[i] && dist[u][1] + weight[i] < dist[v][0] + diff) { weight[i] = weight[i ^ 1] = dist[v][0] + diff - dist[u][1]; } } if (dist[v][opt] > dist[u][opt] + weight[i]) { dist[v][opt] = dist[u][opt] + weight[i]; q.push(node(v, dist[v][opt])); } } } } int main() { memset(head, -1, sizeof(head)); read(n); read(m); read(L); read(s); read(t); ++s; ++t; for (int i = 1; i <= m; ++i) { int u, v; long long w; read(u); read(v); read(w); fm[E] = u; fm[E + 1] = v; to[E] = v; to[E + 1] = u; ++u; ++v; if (!w) { mark[E] = mark[E + 1] = 1; w = 1; } add_edge(u, v, w); add_edge(v, u, w); } dijkstra(s, 0); if (dist[t][0] > L) { printf( NO n ); return 0; } diff = L - dist[t][0]; dijkstra(s, 1); if (dist[t][1] != L) { printf( NO n ); return 0; } printf( YES n ); for (int i = 0; i < E; i += 2) { printf( %d %d %lld n , fm[i], to[i], weight[i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m; char s[1100][1100]; bool a[1100][1010]; bool canDraw(int x, int y, int level) { int i = level; { if (x + i < 0 || x + i >= n) return false; if (y + i < 0 || y + i >= m) return false; if (s[x + i][y] == . ) return false; if (s[x][y + i] == . ) return false; } i = -level; { if (x + i < 0 || x + i >= n) return false; if (y + i < 0 || y + i >= m) return false; if (s[x + i][y] == . ) return false; if (s[x][y + i] == . ) return false; } return true; } void Draw(int x, int y, int level) { for (int i = -level; i <= level; i++) { a[x][y + i] = true; a[x + i][y] = true; } } int ans; int xx[11000000]; int yy[11000000]; int ll[10100000]; int main(int argc, char const *argv[]) { while (cin >> n >> m) { ans = 0; for (int i = 0; i < n; i++) { scanf( %s , s[i]); } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { int level = 0; for (level = 0; level <= max(n, m); level++) { if (!canDraw(i, j, level)) break; } if (level > 1) { Draw(i, j, level - 1); xx[ans] = i; yy[ans] = j; ll[ans] = level - 1; ans++; } } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { if (s[i][j] == * && a[i][j] == false) { ans = -1; } } if (ans == -1) { printf( -1 n ); } else { printf( %d n , ans); for (int i = 0; i < ans; i++) printf( %d %d %d n , xx[i] + 1, yy[i] + 1, ll[i]); } } }
|
#include <bits/stdc++.h> using namespace std; using int64 = long long int; const int kModulo = 1000000007; struct Edge { int from, to; }; vector<int> Inverse(const vector<int>& a) { const int n = a.size(); vector<int> result(n); for (int i = 0; i < n; ++i) { result[a[i] - 1] = i; } return result; } vector<int> ComputePhi(const int n) { vector<int> phi(n + 1); for (int i = 0; i <= n; ++i) { phi[i] = i; } for (int i = 2; i <= n; ++i) { if (phi[i] != i) { continue; } for (int j = i; j <= n; j += i) { phi[j] = (phi[j] / i) * (i - 1); } } return phi; } vector<vector<int>> ComputeDivisors(const int n) { vector<vector<int>> divisors(n + 1); for (int i = 1; i <= n; ++i) { for (int j = i; j <= n; j += i) { divisors[j].push_back(i); } } return divisors; } int64 ModInverse(const int64 x) { int64 u = x; int64 v = kModulo; int64 p1 = 1, q1 = 0; int64 p2 = 0, q2 = 1; while (v != 0) { const int64 q = u / v; const int64 p3 = p1 - q * p2; const int64 q3 = q1 - q * q2; const int64 r = u - q * v; u = v; v = r; p1 = p2; p2 = p3; q1 = q2; q2 = q3; } if (p1 < 0) { p1 += kModulo; } if (p1 >= kModulo) { p1 -= kModulo; } return p1; } vector<int64> ComputeCoefs(const vector<int>& phi) { const int n = phi.size(); vector<int> mu(n + 1, 1); for (int i = 2; i <= n; ++i) { if (phi[i] != i - 1) { continue; } for (int j = i; j <= n; j += i) { mu[j] = -mu[j]; } const int64 ii = static_cast<int64>(i) * i; for (int64 j = ii; j <= n; j += ii) { mu[j] = 0; } } vector<int64> c(n + 1); for (int g = 1; g <= n; ++g) { const int64 cur = (g * ModInverse(phi[g])) % kModulo; for (int d = g; d <= n; d += g) { c[d] += mu[d / g] * cur; if (c[d] < 0) { c[d] += kModulo; } if (c[d] >= kModulo) { c[d] -= kModulo; } } } return c; } class Tree { public: explicit Tree(const vector<int>& a) : a_(a), a_inv_(Inverse(a)), phi_(ComputePhi(a.size())), divisors_(ComputeDivisors(a.size())), coef_(ComputeCoefs(phi_)), edges_(a.size()) {} void AddEdge(const int from, const int to) { edges_[from].push_back({from, to}); edges_[to].push_back({to, from}); } int Build() { const int n = edges_.size(); layer_.assign(n, n); centroid_parent_.assign(n, -1); subtree_size_.assign(n, -1); Build(0, -1, 0); int max_layer = 0; for (int node = 0; node < n; ++node) { max_layer = max(max_layer, layer_[node]); } for (int layer = 0; layer <= max_layer; ++layer) { root_.assign(n, -1); root_child_.assign(n, -1); root_depth_.assign(n, -1); subtree_.assign(n, 0); for (int node = 0; node < n; ++node) { if (layer_[node] == layer) { ComputeRootAndRootChild(node, -1, layer, node, -1, 0); } } for (int g = 1; g <= n; ++g) { for (int i = g; i <= n; i += g) { const int node = a_inv_[i - 1]; const int64 value = (coef_[g] * phi_[i]) % kModulo; if (root_[node] != -1) { subtree_[root_[node]] += value; } if (root_child_[node] != -1) { subtree_[root_child_[node]] += value; } } for (int i = g; i <= n; i += g) { const int u = a_inv_[i - 1]; const int root = root_[u]; if (root == -1) { continue; } const int root_child = root_child_[u]; int64 cur_answer = subtree_[root]; if (root_child != -1) { cur_answer -= subtree_[root_child]; } cur_answer %= kModulo; cur_answer = (cur_answer * 2 * phi_[a_[u]]) % kModulo; cur_answer = (cur_answer * root_depth_[u]) % kModulo; answer_ = answer_ + cur_answer; if (answer_ < 0) { answer_ = answer_ + kModulo; } if (answer_ >= kModulo) { answer_ = answer_ - kModulo; } } for (int i = g; i <= n; i += g) { const int node = a_inv_[i - 1]; if (root_[node] != -1) { subtree_[root_[node]] = 0; } if (root_child_[node] != -1) { subtree_[root_child_[node]] = 0; } } } } answer_ = (answer_ * ModInverse(n)) % kModulo; answer_ = (answer_ * ModInverse(n - 1)) % kModulo; return answer_; } private: void Build(const int node, const int parent, const int layer) { const int centroid = FindCentroid(node, layer); layer_[centroid] = layer; centroid_parent_[centroid] = parent; for (const Edge& edge : edges_[centroid]) { const int child = edge.to; if (layer_[child] >= layer) { Build(child, centroid, layer + 1); } } } int FindCentroid(const int node, const int layer) { const int max_size = ComputeSubtreeSize(node, -1, layer) / 2; int parent = -1; int centroid = node; while (true) { bool found = false; for (const Edge& edge : edges_[centroid]) { const int child = edge.to; if (layer_[child] < layer || child == parent) { continue; } if (subtree_size_[child] > max_size) { parent = centroid; centroid = child; found = true; break; } } if (!found) { return centroid; } } } int ComputeSubtreeSize(const int node, const int parent, const int layer) { int size = 1; for (const Edge& edge : edges_[node]) { const int child = edge.to; if (layer_[child] < layer || child == parent) { continue; } size += ComputeSubtreeSize(child, node, layer); } subtree_size_[node] = size; return size; } void ComputeRootAndRootChild(const int node, const int parent, const int layer, const int root, const int root_child, const int depth) { root_[node] = root; root_child_[node] = root_child; root_depth_[node] = depth; for (const Edge& edge : edges_[node]) { const int child = edge.to; if (layer_[child] < layer || child == parent) { continue; } ComputeRootAndRootChild(child, node, layer, root, root_child != -1 ? root_child : child, depth + 1); } } const vector<int> a_; const vector<int> a_inv_; const vector<int> phi_; const vector<vector<int>> divisors_; const vector<int64> coef_; vector<vector<Edge>> edges_; vector<int> layer_; vector<int> centroid_parent_; vector<int> subtree_size_; vector<int> root_; vector<int> root_child_; vector<int> root_depth_; vector<int64> subtree_; int answer_ = 0; }; namespace io { char* position_; char* buffer_limit_; bool FetchChunk() { static char buffer_[1024]; const auto count = fread(buffer_, sizeof(char), 1024, stdin); if (count > 0) { buffer_limit_ = buffer_ + count; } else { buffer_[0] = 0 ; buffer_limit_ = buffer_ + 1; } position_ = buffer_; return count > 0; } const bool unused_ = FetchChunk(); template <typename T> T Read() { while ( 0 <= *position_ && *position_ <= ) { if (++position_ == buffer_limit_) { FetchChunk(); }; } const bool negate = (*position_ == - ); if (negate) { if (++position_ == buffer_limit_) { FetchChunk(); }; } T result = 0; while ( 0 <= *position_ && *position_ <= 9 ) { result = 10 * result + (*position_ - 0 ); if (++position_ == buffer_limit_) { FetchChunk(); }; } return negate ? -result : result; } } // namespace io int main() { const int n = io::Read<int>(); vector<int> a(n); for (int i = 0; i < n; ++i) { a[i] = io::Read<int>(); } Tree t(a); for (int i = 0; i < n - 1; ++i) { const int u = io::Read<int>() - 1; const int v = io::Read<int>() - 1; t.AddEdge(u, v); } cout << t.Build() << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 60 + 7; const int INF = (int)1e9; int n; int m; int q; int dp[N][N][N]; int one[N][N][N]; int main() { ios::sync_with_stdio(0); cin.tie(0); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) dp[i][j][k] = one[i][j][k] = INF; cin >> n >> m >> q; for (int it = 1; it <= m; it++) { for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> one[it][i][j]; for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) one[it][i][j] = min(one[it][i][j], one[it][i][k] + one[it][k][j]); } for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int it = 1; it <= m; it++) dp[i][j][0] = min(dp[i][j][0], one[it][i][j]); for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int x = 1; x <= n; x++) dp[i][j][k] = min(dp[i][j][k], dp[i][x][k - 1] + dp[x][j][0]); while (q--) { int a, b, k; cin >> a >> b >> k; k = min(k, n); cout << dp[a][b][k] << n ; } }
|
#include <bits/stdc++.h> using namespace std; int a[110]; int dp[110][110]; map<int, int> mp; bool cmp(int p, int q) { return p > q; } int main() { int n, m; while (scanf( %d%d , &n, &m) == 2) { memset(a, 0, sizeof(a)); memset(dp, 0, sizeof(dp)); int u; int b = -1; for (int i = 1; i <= m; i++) { cin >> u; a[u]++; b = max(b, u); } sort(a + 1, a + 110, cmp); int ans = 0, l = 0; for (int i = 0; i <= b; i++) { if (a[i]) l++; } for (int i = 1; i <= n; i++) { dp[1][i] = a[1] / i; } for (int i = 1; i <= l; i++) { dp[i][1] = a[1]; } for (int i = 2; i <= l; i++) { for (int j = 1; j <= n; j++) { for (int k = 0; k < j; k++) { dp[i][j] = max(dp[i][j], min(dp[i - 1][k], a[i] / (j - k))); } } } int Max = 0; for (int i = 1; i <= l; i++) { Max = max(dp[i][n], Max); } cout << Max << endl; } return 0; }
|
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); int x, i = 1; while (i <= n) { scanf( %d , &x); printf( n%d %d , 1, x - 1); i++; } }
|
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int maxn = 1010; int n, K, mxa; int a[maxn]; inline int MOD(int x) { return x < mod ? x : x - mod; } inline int Mod(int x) { return x < 0 ? x + mod : x; } void input() { int i; scanf( %d%d , &n, &K); for (i = 1; i <= n; i++) scanf( %d , a + i); sort(a + 1, a + n + 1); mxa = a[n] - a[1]; } int f[maxn][maxn], g[maxn][maxn]; int calc(int Lim) { int i, j, k; for (i = 1; i <= K; i++) g[0][i] = 0; for (i = 1; i <= n; i++) f[i][1] = 1, g[i][1] = g[i - 1][1] + 1; for (k = 2; k <= K; k++) { j = 0; for (i = 1; i <= n; i++) { for (; a[i] - a[j + 1] >= Lim; j++) ; f[i][k] = g[j][k - 1]; g[i][k] = MOD(g[i - 1][k] + f[i][k]); } } return g[n][K]; } void solve() { int i, t, fans = 0; for (i = 1;; i++) { t = calc(i); if (!t) break; fans = MOD(fans + t); } printf( %d n , fans); } int main() { input(); solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 105; const int mod = 1e9 + 7; vector<int> e[MAXN]; int n, sz[MAXN], f[MAXN][MAXN][2], tmp[MAXN][2], c[MAXN][MAXN]; inline int add(int x, int y) { return x + y >= mod ? x + y - mod : x + y; } inline void inc(int &x, int y) { x = x + y >= mod ? x + y - mod : x + y; } void dfs(int u, int ff) { sz[u] = 1; f[u][0][1] = f[u][0][0] = 1; for (int v, i = (int)e[u].size() - 1; ~i; --i) if ((v = e[u][i]) != ff) { dfs(v, u); for (int j = 0; j < sz[u] + sz[v]; ++j) tmp[j][0] = tmp[j][1] = 0; for (int j = 0; j < sz[u]; ++j) for (int k = 0; k < sz[v]; ++k) { inc(tmp[j + k + 1][0], 1ll * f[u][j][0] * f[v][k][0] % mod); inc(tmp[j + k + 1][1], (1ll * f[u][j][0] * f[v][k][1] + 1ll * f[u][j][1] * f[v][k][0]) % mod); inc(tmp[j + k][0], 1ll * f[u][j][0] * f[v][k][1] % mod); inc(tmp[j + k][1], 1ll * f[u][j][1] * f[v][k][1] % mod); } sz[u] += sz[v]; for (int j = 0; j < sz[u]; ++j) f[u][j][0] = tmp[j][0], f[u][j][1] = tmp[j][1]; } } inline int qpow(int a, int b) { int re = 1; b < 0 ? b += mod - 1 : 0; for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) re = 1ll * re * a % mod; return re; } int main() { scanf( %d , &n); for (int i = 1, u, v; i < n; ++i) scanf( %d%d , &u, &v), e[u].push_back(v), e[v].push_back(u); dfs(1, 0); c[0][0] = 1; for (int i = 1; i < n; ++i) { c[i][0] = 1; for (int j = 1; j <= i; ++j) c[i][j] = add(c[i - 1][j - 1], c[i - 1][j]); } for (int i = 0; i < n; ++i) f[1][i][1] = 1ll * f[1][i][1] * qpow(n, n - i - 2) % mod; for (int i = 0; i < n; ++i) { int ans = 0, cf = 1; for (int j = i; j < n; ++j) inc(ans, 1ll * f[1][j][1] * cf % mod * c[j][i] % mod), cf = mod - cf; printf( %d , ans); } }
|
#include <bits/stdc++.h> #pragma comment(linker, /STACK:64000000 ) using namespace std; const long double PI = 3.14159265358979323846; const long double gammama = 0.57721566490153286060; const long double eps = 1e-8; const long long INF = 777777777777 + 1; vector<int> a(10, 0); int pow(int x, int st) { int res = 1; for (int i = 0; i < st; ++i) res *= x; return res; } long long c(int n, int k) { long long res = 1; for (int i = 0; i < k; ++i) { res *= n - i; res /= i + 1; } return res; } void add(long long m, int shift) { if (m < 1) return; if (m == 1) { ++a[shift]; return; } if (m <= 10) { for (int i = 0; i < m; ++i) { if ((i == 4) || (i == 7)) ++a[shift + 1]; else ++a[shift]; } return; } long long d = 1; int s = 0; while (d * 10 <= m) { d *= 10; ++s; } if (m == d) { a[shift] += pow(8, s); for (int i = 1; i <= s; ++i) { a[shift + i] += c(s, i) * pow(2, i) * pow(8, s - i); } return; } int x = m / d; for (int i = 0; i < x; ++i) { if ((i == 4) || (i == 7)) add(d, shift + 1); else add(d, shift); } if ((x == 4) || (x == 7)) ++shift; add(m - d * x, shift); } const long long inv[] = {0, 1, 500000004, 166666668, 41666667, 808333339, 301388891}; long long mod = 1000 * 1000 * 1000 + 7; long long cm(long long n, int k) { long long res = 1; for (int i = 0; i < k; ++i) { res = (res * (n - i)) % mod; } res = (res * inv[k]) % mod; return res; } long long get(int s, int k) { if (k == 0) return 1; long long res = 0; for (int i = 0; i < s; ++i) { --a[i]; if (a[i] >= 0) res = (res + (long long)(a[i] + 1) * get(s - i, k - 1)) % mod; ++a[i]; } return res; } int main() { long long m; cin >> m; add(m + 1, 0); --a[0]; long long res = 0; for (int s = 1; s <= 9; ++s) { long long cur = ((long long)(a[s]) * get(s, 6)) % mod; res = (res + cur) % mod; } cout << res << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { int n, l; cin >> n >> l; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int il = 0, ir = n - 1, sl = 1, sr = 1; double time = 0, pl = 0, pr = l; while (il <= ir) { double tl = (a[il] - pl) / sl, tr = (pr - a[ir]) / sr; if (tl < tr) { pl = a[il]; pr -= sr * tl; il++; sl++; time += tl; } else { pr = a[ir]; pl += sl * tr; ir--; sr++; time += tr; } } cout << fixed << setprecision(15) << time + (pr - pl) / (sr + sl) << n ; } return 0; }
|
#include <bits/stdc++.h> #include<string> #include<vector> using namespace std; //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; //typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> o_set; typedef long double ld; typedef long long int ll; #define int long long typedef vector<int> vi; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<vi> vvi; typedef vector<vii> vvii; #define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define INF 1e18 #define MOD 1000000007 #define pb push_back #define mp make_pair #define fi first #define se second #define loop(i,n) for(ll i=0;i<n;i++) #define leep(i,n) for(ll i=1;i<=n;i++) #define all(v) v.begin(), v.end() #define remove_dulpicate(d) d.resize(unique(all(d))-d.begin()) ll power(ll a,ll b){ if(b==0) return 1LL; ll p=power(a,b/2); p=p*p%MOD; return (b&1)?p*a%MOD:p; } int32_t main() { FAST int tt; cin>>tt; while(tt--) { int n,m,cnt=0; cin>>n>>m; char mat[n][m]; for(int i=0;i<n;i++){ string s; cin>>s; cnt+=count(all(s), # ); } int ans=power(2,cnt); if(cnt==n*m){ ans=(ans-1+MOD)%MOD; } cout<<ans<< n ; } //check constraints return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; inline long long mul(long long a, long long b) { return (mod + (a * b) % mod) % mod; } inline long long add(long long a, long long b) { return (mod + (a + b) % mod) % mod; } long long pwr(long long a, long long b) { if (!b) return 1; long long h = pwr(a, (b >> 1)); h = mul(h, h); if (b & 1) h = mul(h, a); return h; } const long long maxc = 5; long long p[maxc][maxc]; long long mysqrt(long long a) { long long b = sqrt(a); while (b * b > a) b--; while ((b + 1) * (b + 1) <= a) b++; return b; } int main() { ios::sync_with_stdio(false); cin.tie(0); for (int i = 0; i < maxc; i++) { p[i][0] = p[i][i] = 1; for (int j = 1; j < i; j++) p[i][j] = add(p[i - 1][j - 1], p[i - 1][j]); } long long m; cin >> m; const long long c[4] = {mul(add(m, 2), mul(add(m, 1), add(m, 0))), add(3 * m, 4), add(-6, -3 * m), 2}; long long ans = 0, maxi = mysqrt(m) + 1; vector<vector<long long> > s(maxi, vector<long long>(maxc * 2)); s[0][0] = 1; for (long long y = 1; y < maxi; y++) { long long pw = 1; for (long long p = 0; p < s[y].size(); pw = mul(pw, y), p++) s[y][p] = add(s[y - 1][p], mul(2, pw)); } for (int deg = 0; deg < 4; deg++) { for (long long x = 0; x * x <= m; x++) { long long pwx = (x == 0 ? 1 : 2); for (int xp = 0; xp <= deg; xp++, pwx = mul(pwx, mul(x, x))) { int yp = deg - xp; long long maxy = mysqrt(m - x * x); ans = add(ans, mul(mul(p[deg][xp], c[deg]), mul(pwx, s[maxy][yp * 2]))); } } } ans = mul(ans, pwr(6, mod - 2)); cout << ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; vector<int> V[20005]; int a[1000005], b[1000005]; bool cmp1(int x, int y) { return b[x] < b[y]; } bool cmp2(int x, int y) { return b[x] > b[y]; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]), scanf( %d , &b[i]); V[a[i] / 1000].push_back(i); } for (int i = 0; i <= 1000; i++) { if (i % 2) sort(V[i].begin(), V[i].end(), cmp1); else sort(V[i].begin(), V[i].end(), cmp2); for (int j = 0; j < V[i].size(); j++) printf( %d , V[i][j]); } cout << endl; }
|
#include <bits/stdc++.h> using namespace std; int l, r; string s; bool b_occured[10]; bool judge() { memset(b_occured, 0, sizeof(b_occured)); bool ret = false; for (int i = 0; i < s.length(); i++) { if (b_occured[s[i] - 0 ] == false) b_occured[s[i] - 0 ] = true; else { ret = true; } } return ret; } int main() { cin >> l >> r; s = to_string(l); while (judge()) { l++; s = to_string(l); } if (l <= r) cout << l << n ; else cout << -1 n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100000]; void solve() { int i, j, n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; bool ok = 0; for (int i = 2; i <= n; i++) if (a[i] != a[i - 1]) ok = 1; if (!ok) { cout << NO << n ; return; } map<int, int> M; int minc = 100000; for (int i = 1; i <= n; i++) { M[a[i]]++; } for (int i = 1; i <= n; i++) { if (M[a[i]] < minc) { minc = M[a[i]]; } } int root = -1; int val = -1; for (int i = 1; i <= n; i++) { if (M[a[i]] == minc) { root = i; val = a[i]; break; } } vector<pair<int, int>> edge; int last; vector<int> free; for (int i = 1; i <= n; i++) { if (a[i] != val) { edge.push_back({root, i}); free.push_back(i); } } vector<int> same; for (int i = 1; i <= n; i++) { if (i != root && a[i] == val) { same.push_back(i); } } for (int i = 0; i < same.size(); i++) { edge.push_back({free[i], same[i]}); } cout << YES << n ; for (int i = 0; i < edge.size(); i++) cout << edge[i].first << << edge[i].second << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; template <typename T> inline void Read(T &n) { char ch; bool flag = false; while (!isdigit(ch = getchar())) if (ch == - ) flag = true; for (n = ch ^ 48; isdigit(ch = getchar()); n = (n << 1) + (n << 3) + (ch ^ 48)) ; if (flag) n = -n; } const int MAXN = 100005; struct node { int son[26], fa, len, sz; } t[MAXN << 1]; int node_cnt = 1; int prv = 1; inline void insert(int v) { int x = ++node_cnt; t[x].len = t[prv].len + 1; t[x].sz = 1; while (prv and !t[prv].son[v]) t[prv].son[v] = x, prv = t[prv].fa; if (!prv) t[x].fa = 1; else { int p = t[prv].son[v]; if (t[p].len == t[prv].len + 1) t[x].fa = p; else { int new_p = ++node_cnt; t[new_p].len = t[prv].len + 1; t[new_p].fa = t[p].fa; t[p].fa = t[x].fa = new_p; copy(t[p].son, t[p].son + 26, t[new_p].son); while (prv and t[prv].son[v] == p) t[prv].son[v] = new_p, prv = t[prv].fa; } } prv = x; } char s[MAXN]; int S[MAXN], id[MAXN << 1]; int main() { int T; Read(T); while (T--) { scanf( %s , s + 1); int n = strlen(s + 1); prv = node_cnt = 1; memset(t, 0, sizeof t); memset(S, 0, sizeof S); for (register int i = 1; i <= n; i++) insert(s[i] - a ); for (register int i = 1; i <= node_cnt; i++) S[t[i].len]++; for (register int i = 1; i <= n; i++) S[i] += S[i - 1]; for (register int i = 1; i <= node_cnt; i++) id[S[t[i].len]--] = i; for (register int i = node_cnt; i; i--) t[t[id[i]].fa].sz += t[id[i]].sz; long long ans = 0; for (register int i = 2; i <= node_cnt; i++) ans += 1ll * t[i].sz * t[i].sz * (t[i].len - t[t[i].fa].len); printf( %lld n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long int n; cin >> n; vector<pair<long int, long int> > vec; for (long int i = 1; i <= n; i++) { long int a, b; cin >> a >> b; vec.push_back({a, b}); } long int count = 1; long int limit = vec[0].first; for (long int i = 1; i <= n - 2; i++) { if (vec[i].first - vec[i].second > limit) { count++; limit = vec[i].first; } else if (vec[i].first + vec[i].second < vec[i + 1].first) { count++; limit = vec[i].first + vec[i].second; } else { limit = vec[i].first; } } if (n >= 2) count++; cout << count << endl; }
|
#include <bits/stdc++.h> template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } using namespace std; const double eps = 1e-10; int sgn(double x) { return (x > eps) - (x < -eps); } int cmp(double x, double y) { return sgn(x - y); } struct P { double x, y, k; P() : x(0), y(0) {} P(double a, double b) : x(a), y(b) {} void in() { scanf( %lf%lf , &x, &y); } P operator+(const P &a) const { return P(x + a.x, y + a.y); } P operator-(const P &a) const { return P(x - a.x, y - a.y); } P operator*(const double &a) const { return P(x * a, y * a); } P operator/(const double &a) const { return P(x / a, y / a); } double norm2() { return x * x + y * y; } } p[1000 + 5]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) { int a, b, c, d; scanf( %d%d%d%d , &a, &b, &c, &d); p[i] = P((double)a / b, (double)c / d); p[i] = p[i] / p[i].norm2(); } vector<P> pt; for (int i = 1; i <= n; i++) for (int j = 1; j <= i - 1; j++) { P mid = (p[i] + p[j]) / 2, tmp = p[i] - p[j]; mid.k = sgn(tmp.x) == 0 ? 1e100 : tmp.y / tmp.x; pt.push_back(mid); } sort(pt.begin(), pt.end(), [](P a, P b) { if (cmp(a.x, b.x)) return cmp(a.x, b.x) < 0; if (cmp(a.y, b.y)) return cmp(a.y, b.y) < 0; return a.k < b.k; }); int N = pt.size(); long long ans = 0; for (int l = 0, r; l < N; l = r) { for (r = l; r < N && cmp(pt[r].x, pt[l].x) == 0 && cmp(pt[r].y, pt[l].y) == 0; r++) ; int c = 2, ways = 1; for (int i = l + 1; i <= r; i++) { if (i < r && cmp(pt[i].k, pt[i - 1].k) == 0) c++; else ways = 1ll * ways * c % 1000000007, c = 2; } ans = (ans + ways - 1 - (r - l) + 1000000007) % 1000000007; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; void add(int& x, int y) { ((x += y) >= MOD) && (x -= MOD); } void sub(int& x, int y) { add(x, -y + MOD); } int mul(int x, int y) { return x * 1ll * y % MOD; } int mpow(int a, int p) { int res = 1; for (; p > 0; p >>= 1, a = mul(a, a)) { if (p & 1) { res = mul(res, a); } } return res; } const int MAXN = 50 + 10; int mem_inv[MAXN]; int inv(int x) { int& y = mem_inv[x]; if (y) { return y; } y = mpow(x, MOD - 2); assert(mul(x, y) == 1); return y; } int n, m; bool read() { if (scanf( %d%d , &n, &m) < 2) { return 0; } n += 2; return 1; } int dp2[MAXN][MAXN]; int dp[MAXN][MAXN]; int dp_big[MAXN][MAXN][MAXN][MAXN]; int binom(int n, int k) { assert(k); add(n, k - 1); int ans = 1; for (int i = 0; i < int(k); ++i) { int cur_n = n; sub(cur_n, i); ans = mul(ans, cur_n); ans = mul(ans, inv(i + 1)); } return ans; } int calc_dp(int, int); int calc_dp2(int, int); int calc_dp_big(int, int, int, int); int calc_dp2(int n, int m) { if (n < 3) { return 0; } int& mem = dp2[n][m]; if (mem != -1) { return mem; } int ans = 0; for (int n_left = 2; n_left < n; ++n_left) { const int n_right = n - n_left + 1; for (int m_right = m; m_right < MAXN; ++m_right) { add(ans, mul(calc_dp(n_left, m), calc_dp(n_right, m_right))); } for (int m_left = m + 1; m_left < MAXN; ++m_left) { add(ans, mul(calc_dp(n_left, m_left), calc_dp(n_right, m))); } } return (mem = ans); } int calc_dp_big(int n, int m, int n1, int m1) { if (n < 2) { return 0; } if (n == 2) { return (m == 0); } if (m <= 0 || n1 < 3) { return 0; } assert(m1 >= 0); int& mem = dp_big[n][m][n1][m1]; if (mem != -1) { return mem; } int new_n1 = n1; int new_m1 = m1 - 1; if (new_m1 == -1) { new_n1--; new_m1 = MAXN - 1; } int ans = 0; for (int cnt = 0; (n1 - 2) * cnt + 2 <= n && m1 * cnt <= m; ++cnt) { int cur = cnt ? binom(calc_dp2(n1, m1), cnt) : 1; int will = calc_dp_big(n - (n1 - 2) * cnt, m - m1 * cnt, new_n1, new_m1); add(ans, mul(cur, will)); } return (mem = ans); } int calc_dp(int n, int m) { int& mem = dp[n][m]; if (mem != -1) { return mem; } int ans = calc_dp_big(n, m - 1, MAXN - 1, MAXN - 1); return (mem = ans); } int solve() { memset(dp2, -1, sizeof dp2); memset(dp, -1, sizeof dp); memset(dp_big, -1, sizeof dp_big); return calc_dp(n, m); } int main() { while (read()) { printf( %d n , solve()); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int parent[26]; long long int find(long long int x) { if (x == parent[x]) return x; return parent[x] = find(parent[x]); } void merge(long long int x, long long int y) { parent[y] = x; } signed main() { long long int n; cin >> n; for (long long int i = 0; i < 26; i++) parent[i] = i; string a, b; cin >> a >> b; vector<pair<char, char>> diff; for (long long int i = 0; i < n; i++) { long long int x = a[i] - a , y = b[i] - a ; long long int u = find(x), v = find(y); if (u != v) { merge(u, v); diff.push_back(make_pair(a[i], b[i])); } } cout << diff.size() << endl; for (auto x : diff) cout << x.first << << x.second << endl; }
|
#include <bits/stdc++.h> using namespace std; vector<int> adj[200010], adjr[200010]; int dist[200010], n, m, nop[200010], minp, maxp; void BFS(int scr) { queue<int> q; q.push(scr); dist[scr] = 1; nop[scr] = 0; while (!q.empty()) { int u = q.front(); q.pop(); for (long long i = 0; i < adj[u].size(); i++) { if (dist[adj[u][i]] == dist[u] + 1) nop[adj[u][i]]++; if (!dist[adj[u][i]]) { dist[adj[u][i]] = dist[u] + 1; q.push(adj[u][i]); nop[adj[u][i]] = 1; } } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t = 1; while (t--) { cin >> n >> m; for (long long i = 0; i < m; i++) { int a, b; cin >> a >> b; adj[b].push_back(a); adjr[a].push_back(b); } int k; cin >> k; int path[k + 1]; for (long long i = 1; i <= k; i++) cin >> path[i]; BFS(path[k]); for (long long i = 1; i <= k - 1; i++) { minp += dist[path[i]] < dist[path[i + 1]] + 1; for (int j = 0; j < adjr[path[i]].size(); j++) { if (adjr[path[i]][j] != path[i + 1] && dist[path[i]] == dist[adjr[path[i]][j]] + 1) { maxp += 1; break; } } } cout << minp << << maxp; } }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; const long long mod = 1e9 + 7; int n, c[505], d[505][505], fa[505], a[505]; long long dp[505][505], comb[505][505]; int Find(int x) { return x == fa[x] ? x : fa[x] = Find(fa[x]); } void Union(int u, int v) { int x = Find(u); int y = Find(v); if (x != y) fa[x] = y; } int is(int i, int j) { long long x = 1LL * a[i] * a[j]; long long y = sqrt(1.0 * x); if (y * y == x) return 1; return 0; } int main() { for (int j = 0; j < 505; j++) comb[0][j] = 0; for (int i = 0; i < 505; i++) comb[i][0] = 1; for (int i = 1; i < 505; i++) for (int j = 1; j < 505; j++) comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % mod; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); memset(d, 0, sizeof(d)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; if (is(i, j)) d[i][j] = 1; } } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) if (d[i][k]) for (int j = 1; j <= n; j++) d[i][j] = d[i][j] || d[k][j]; for (int i = 1; i <= n; i++) fa[i] = i; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; if (d[i][j]) Union(i, j); } } vector<int> g[505]; for (int i = 1; i <= n; i++) g[Find(i)].push_back(i); int cnt = 0; for (int i = 1; i <= n; i++) if (g[i].size() != 0) c[++cnt] = g[i].size(); int N = cnt; dp[0][0] = 1; int all = 1; for (int x = 1; x <= N; x++) { for (int ij = 1; ij <= c[x]; ij++) { for (int y = 0; y <= all; y++) { if (dp[x - 1][y] > 0) { for (int j = 0; j <= min(ij, y); j++) { int i = ij - j; int z = all - y; long long add = dp[x - 1][y] * comb[y][j] % mod; add = add * comb[z][i] % mod; add = add * comb[c[x] - 1][ij - 1] % mod; dp[x][(y - j) + (c[x] - ij)] = (dp[x][(y - j) + (c[x] - ij)] + add) % mod; } } } } all += c[x]; } long long ans = dp[N][0]; for (int i = 1; i <= N; i++) { long long tmp = 1LL; for (int j = 1; j <= c[i]; j++) tmp = tmp * j % mod; ans = ans * tmp % mod; } printf( %I64d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXK = 30000; const int LGN = 16; const int N = 1 << LGN; const int MOD = 1000000007; const double MYPI = acos(-1); typedef struct Pol { int x[MAXK + 1]; } Pol; int bitrev[N]; complex<double> w[N]; void prefft() { for (int i = (0); i < (N); ++i) bitrev[i] = bitrev[i >> 1] >> 1 | ((i & 1) << (LGN - 1)); for (int i = (0); i < (N); ++i) w[i] = complex<double>(cos(2 * MYPI * i / N), sin(2 * MYPI * i / N)); } void fft(complex<double> a[N]) { for (int i = (0); i < (N); ++i) if (i < bitrev[i]) swap(a[i], a[bitrev[i]]); for (int len = 2, step = N >> 1; len <= N; len <<= 1, step >>= 1) { for (int i = 0; i < N; i += len) { complex<double> *l = a + i, *r = l + (len >> 1), *p = w; for (int off = (0); off < (len >> 1); ++off) { complex<double> v = *r * *p; *r = *l - v; *l = *l + v; ++l, ++r, p += step; } } } } int inv[MAXK + 1]; int fact[MAXK + 1]; int ifact[MAXK + 1]; int ipow(int x, int n) { int ret = 1; while (true) { if (n & 1) ret = (long long)ret * x % MOD; if ((n >>= 1) == 0) return ret; x = (long long)x * x % MOD; } } int K; void pmult(Pol &c, Pol &a, Pol &b) { static complex<double> A[N], B[N], C[N], D[N]; for (int i = (0); i <= (K); ++i) A[i] = complex<double>(a.x[i] & ((1 << 15) - 1), a.x[i] >> 15); for (int i = (0); i <= (K); ++i) B[i] = complex<double>(b.x[i] & ((1 << 15) - 1), b.x[i] >> 15); for (int i = (K + 1); i < (N); ++i) A[i] = B[i] = complex<double>(0, 0); fft(A); fft(B); for (int i = (0); i < (N); ++i) { int j = (N - i) & (N - 1); complex<double> w = (A[i] + conj(A[j])) * complex<double>(.5, 0); complex<double> x = (A[i] - conj(A[j])) * complex<double>(0, -.5); complex<double> y = (B[i] + conj(B[j])) * complex<double>(.5, 0); complex<double> z = (B[i] - conj(B[j])) * complex<double>(0, -.5); C[j] = w * y + w * z * complex<double>(0, 1); D[j] = x * y + x * z * complex<double>(0, 1); } fft(C); fft(D); for (int i = (0); i <= (K); ++i) { int w = (long long)(real(C[i]) / N + .5) % MOD; int x = (long long)(imag(C[i]) / N + .5) % MOD; int y = (long long)(real(D[i]) / N + .5) % MOD; int z = (long long)(imag(D[i]) / N + .5) % MOD; c.x[i] = (w + ((long long)(x + y) << 15) + ((long long)z << 30)) % MOD; } } void pmult(Pol &a, int n2, Pol &b) { static Pol c; int step = ipow(2, n2), mlt = 1; for (int i = (0); i <= (K); ++i) c.x[i] = (long long)a.x[i] * mlt % MOD, mlt = (long long)mlt * step % MOD; pmult(a, c, b); } void ppow(Pol &a, Pol &b, int n) { for (int i = (0); i <= (K); ++i) a.x[i] = i == 0 ? 1 : 0; static Pol c; for (int i = (0); i <= (K); ++i) c.x[i] = b.x[i]; int cn = 1; while (true) { if (n & 1) pmult(a, cn, c); if ((n >>= 1) == 0) break; pmult(c, cn, c), cn += cn; } } long long n; Pol h1; Pol hn; void run() { fact[0] = 1; for (int i = (1); i <= (MAXK); ++i) fact[i] = (long long)fact[i - 1] * i % MOD; inv[1] = 1; for (int i = (2); i <= (MAXK); ++i) inv[i] = (MOD - (long long)(MOD / i) * inv[MOD % i] % MOD) % MOD; ifact[0] = 1; for (int i = (1); i <= (MAXK); ++i) ifact[i] = (long long)ifact[i - 1] * inv[i] % MOD; scanf( %I64d%d , &n, &K); if (n > K) { printf( 0 n ); return; } h1.x[0] = 0; for (int i = (1); i <= (K); ++i) h1.x[i] = ifact[i]; prefft(); ppow(hn, h1, n); int ret = 0; for (int i = (0); i <= (K); ++i) { int cur = (long long)hn.x[i] * fact[K] % MOD * ifact[K - i] % MOD; if ((ret += cur) >= MOD) ret -= MOD; } printf( %d n , ret); } int main() { run(); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 50 + 5; int n, a[N][N], tot; int main() { cin >> n; int i = 0, j = n / 2, x, y; for (int k = 1; k <= n * n; k++) { if (a[i][j]) { i = (x + 1) % n; j = y; } a[i][j] = k; x = i; y = j; i = (i - 1 + n) % n; j = (j + 1) % n; } for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) printf( %d%c , a[i][j], n [j + 1 == n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int x, y, a, b; cin >> x >> y >> a >> b; if ((y - x) % (a + b) != 0) { cout << -1 << endl; } else { cout << (y - x) / (a + b) << endl; } } }
|
#include <bits/stdc++.h> using namespace std; int mod = 1000000007; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } inline long long toll(string s) { long long v; istringstream sin(s); sin >> v; return v; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } long long memo[5010]; int isStart[5010]; int isEnd[5010]; int vis[5010]; int visss[5010][5010]; vector<int> v; int n; long long solve(int i) { if (i == n) { return 0; } if (memo[i] != -1) { return memo[i]; } int viss[5010]; for (int j = 0; j < 5010; j++) { viss[j] = 0; } long long take = 0; int curEnd = 0; long long res = solve(i + 1); if (isStart[i]) { return memo[i] = res; } else { for (int j = i; j < n; j++) { curEnd = max(isEnd[j], curEnd); if (!viss[v[j]]) { take = take ^ v[j]; } if (visss[i][v[j]] == 1) { res = max(res, solve(j + 1)); break; } viss[v[j]] = 1; if (j >= curEnd) { res = max(res, take + solve(j + 1)); } } return memo[i] = res; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { int t; cin >> t; v.push_back(t); } for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { visss[i][v[j]] = 1; } } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (v[j] == v[i]) { isEnd[i] = j; } } } for (int i = 0; i < n; i++) { if (vis[v[i]]) { isStart[i] = 1; } vis[v[i]] = 1; } memset(memo, -1, sizeof(memo)); for (int i = 0; i < 5010; i++) { memo[i] = -1; vis[i] = 0; } cout << solve(0) << endl; ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long double pi = 3.14159265359; const int N = 1e5 + 5; const int MOD = 1e9 + 7; int c[N]; vector<int> ans; vector<int> g[N]; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); ; int n; cin >> n; int r, p; for (int i = 0; i < n; ++i) { cin >> p >> c[i]; --p; if (p == -2) { r = i; continue; } c[i] = !c[i]; g[p].push_back(i); } for (int i = 0; i < n; ++i) { if (c[i] || i == r) continue; bool gd = false; for (auto &it : g[i]) { if (c[it]) { gd = true; break; } } if (!gd) ans.push_back(i); } if (ans.empty()) cout << -1; else { for (auto &it : ans) { cout << it + 1 << ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; #define erorp(x) cout<<#x<< ={ <<(x.F)<< , <<x.S<< } <<endl; #define print(v,r) f(i,0,r) cout<<v[i]<< ; cout<<endl; #define Get(x,y) scanf( %I64d%I64d ,&x,&y); #define is_bit(x,y) (x%(1<<(y+1))>=(1<<y)) #define eror(x) cout<<#x<< = <<(x)<<endl; #define f_(i,a,b) for(int i=a;i>=b;i--) #define Gett(x,y) scanf( %d%d ,&x,&y); #define f(i,a,b) for(int i=a;i<b;i++) #define get(x) scanf( %I64d ,&x); #define gett(x) scanf( %d ,&x); #define maxm(a,b) a=max(a,b); #define minm(a,b) a=min(a,b); #define Add(x,y) x=(x+y)%mod #define lst(x) x[x.size()-1] #define sz(x) int(x.size()) #define mp make_pair #define ll long long #define pb push_back #define S second #define F first const int N=600,inf=2e9; int n,m,d[N][N],g[N][N],dist[N][N],mark[N]; void do_it(int x){ f(i,0,n) f(j,0,n) minm(d[x][i],g[x][j]+(i-j+n)%n); } void bfs(int x){ dist[x][x]=0; fill(mark,mark+N,0); f(i,0,n){ int u,e=inf; f(j,0,n) if(!mark[j] && dist[x][j]<e) u=j,e=dist[x][j]; mark[u]=1; e=dist[x][u]%n; f(j,0,n) minm(dist[x][(j+e)%n],dist[x][u]+d[u][j]); } } int main(){ f(i,0,N) f(j,0,N) g[i][j]=inf,d[i][j]=inf,dist[i][j]=inf; cin>>n>>m; f(i,0,m){ int u,v,c; cin>>u>>v>>c; g[u][v]=c; } f(i,0,n) do_it(i); f(i,0,n) bfs(i); f(i,0,n){ f(j,0,n) cout<<dist[i][j]<< ; cout<<endl; } }
|
#include <bits/stdc++.h> using namespace std; const int size = 1e5 + 7; long long a[size], ans = 2e9, res, val, n, k, i; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; for (i = 0; i < n; i++) { cin >> a[i]; if (!i) val = a[i] % k; else if (val != a[i] % k) { cout << -1; return 0; } ans = min(a[i], ans); } for (i = 0; i < n; i++) { val = a[i] - ans; res += val / k; } cout << res; return 0; }
|
#include <bits/stdc++.h> using namespace std; int gcd(int a, int(b)) { if (b == 0) return a; return gcd(b, a % b); } int main() { long long int n; cin >> n; for (long long int i = 2; i < sqrt(n) + 1; i++) { long long int sq = (i * i); while (n % sq == 0) n /= i; } cout << n << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int a[100010]; int b[15]; bool cmp(int x, int y) { if (x == 100 || y == 100) return x < y; else return x % 10 > y % 10; } int main() { int n, k; b[0] = 0; for (int i = 1; i <= 10; i++) b[i] = b[i - 1] + 10; while (scanf( %d%d , &n, &k) != EOF) { for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1, cmp); for (int i = 1; i <= n; i++) { if (k <= 0) break; if (a[i] % 10 == 0 || a[i] == 100) continue; int pos = upper_bound(b + 1, b + 11, a[i]) - b; int num = b[pos] - a[i]; if (num > k) break; a[i] = b[pos]; k -= num; } int ans = 0, sum = 0; for (int i = 1; i <= n; i++) { ans += a[i] / 10; sum += 100 - a[i]; } printf( %d n , ans + min(sum, k) / 10); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a1, a2, a3, a4; cin >> a1 >> a2 >> a3 >> a4; if (a1 + a2 == a4 + a3) { cout << YES << endl; } else if (a1 + a3 == a2 + a4) { cout << YES << endl; } else if (a4 + a1 == a3 + a2) { cout << YES << endl; } else if (a1 + a2 + a3 == a4) { cout << YES << endl; } else if (a1 + a2 + a4 == a3) { cout << YES << endl; } else if (a1 + a3 + a4 == a2) { cout << YES << endl; } else if (a2 + a3 + a4 == a1) { cout << YES << endl; } else { cout << NO << endl; } }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > snakeG(int x1, int y1, int x2, int y2) { vector<pair<int, int> > res; int n = y2 - y1 + 1, m = x2 - x1 + 1; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { if (i % 2 == 0) { res.push_back(make_pair(x1 + i, y1 + j)); } else { res.push_back(make_pair(x1 + i, y2 - j)); } } } return res; } vector<pair<int, int> > snakeV(int x1, int y1, int x2, int y2) { vector<pair<int, int> > res; int n = y2 - y1 + 1, m = x2 - x1 + 1; for (int j = 0; j < n; ++j) { for (int i = 0; i < m; ++i) { if (j % 2 == 0) { res.push_back(make_pair(x1 + i, y1 + j)); } else { res.push_back(make_pair(x2 - i, y1 + j)); } } } return res; } int main() { int n, m; cin >> n >> m; if (m == 1) { if (n == 2) { cout << 0 << endl; cout << 1 << << 1 << endl; cout << 2 << << 1 << endl; cout << 1 << << 1 << endl; return 0; } else { cout << 1 << endl; cout << n << << m << << 1 << << 1 << endl; for (int i = 1; i < n + 1; ++i) cout << i << << 1 << endl; cout << 1 << << 1 << endl; return 0; } } if (n == 1) { if (m == 2) { cout << 0 << endl; cout << 1 << << 1 << endl; cout << 1 << << 2 << endl; cout << 1 << << 1 << endl; return 0; } else { cout << 1 << endl; cout << n << << m << << 1 << << 1 << endl; for (int i = 1; i < m + 1; ++i) cout << 1 << << i << endl; cout << 1 << << 1 << endl; return 0; } } if (n == m) { if (n % 2 == 0) { cout << 0 << endl; vector<pair<int, int> > res = snakeG(1, 2, n, m); cout << 1 << << 1 << endl; for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; for (int i = n; i >= 1; --i) cout << i << << 1 << endl; } else { cout << 1 << endl; cout << n << << m << << 1 << << 1 << endl; vector<pair<int, int> > res = snakeG(1, 1, n, m); for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; cout << 1 << << 1 << endl; } } else { if (n > m) { if (m % 2 == 0) { if (n % 2 == 0) { cout << 0 << endl; vector<pair<int, int> > res = snakeG(1, 2, n, m); cout << 1 << << 1 << endl; for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; for (int i = n; i >= 1; --i) cout << i << << 1 << endl; } else { cout << 0 << endl; vector<pair<int, int> > res = snakeG(1, 2, n - 2, m); vector<pair<int, int> > res1 = snakeV(n - 1, 1, n, m); reverse(res1.begin(), res1.end()); cout << 1 << << 1 << endl; for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; for (int i = 0; i < res1.size(); ++i) cout << res1[i].first << << res1[i].second << endl; for (int i = n - 2; i >= 1; --i) cout << i << << 1 << endl; } } else { if (n % 2 == 0) { cout << 0 << endl; vector<pair<int, int> > res = snakeG(1, 2, n, m); cout << 1 << << 1 << endl; for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; for (int i = n; i >= 1; --i) cout << i << << 1 << endl; } else { cout << 1 << endl; cout << n << << m << << 1 << << 1 << endl; vector<pair<int, int> > res = snakeG(1, 1, n, m); for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; cout << 1 << << 1 << endl; } } } else { if (n % 2 == 0) { cout << 0 << endl; vector<pair<int, int> > res = snakeG(1, 2, n, m); cout << 1 << << 1 << endl; for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; for (int i = n; i >= 1; --i) cout << i << << 1 << endl; } else { if (m % 2 == 0) { cout << 0 << endl; vector<pair<int, int> > res = snakeG(1, 2, n - 2, m); vector<pair<int, int> > res1 = snakeV(n - 1, 1, n, m); reverse(res1.begin(), res1.end()); cout << 1 << << 1 << endl; for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; for (int i = 0; i < res1.size(); ++i) cout << res1[i].first << << res1[i].second << endl; for (int i = n - 2; i >= 1; --i) cout << i << << 1 << endl; } else { cout << 1 << endl; cout << n << << m << << 1 << << 1 << endl; vector<pair<int, int> > res = snakeG(1, 1, n, m); for (int i = 0; i < res.size(); ++i) cout << res[i].first << << res[i].second << endl; cout << 1 << << 1 << endl; } } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; bool fl, vis[200005]; int en, d[200005], head[200005]; struct edge { int u, v, w, nxt; } e[200005 * 4], e0[200005]; void dfs(int); void adde(int, int, int); int calc(int x) { int ans = 0; while (x) { ans ^= x & 1; x >>= 1; } return ans; } int main() { int i, k, t, n, m, u, v, w; scanf( %d , &t); while (t--) { scanf( %d %d , &n, &m); fl = 0; en = 0; memset(vis, 0, n + 1); memset(head, 0, 4 * (n + 1)); for (i = 1; i < n; ++i) { scanf( %d %d %d , &u, &v, &w); e0[i].u = u; e0[i].v = v; e0[i].w = w; if (w != -1) { k = calc(w); adde(u, v, k); adde(v, u, k); } } for (i = 1; i <= m; ++i) { scanf( %d %d %d , &u, &v, &w); adde(u, v, w); adde(v, u, w); } for (i = 1; i <= n; ++i) if (!vis[i]) { d[i] = 0; dfs(i); } if (fl) { puts( NO ); continue; } for (i = 1; i < n; ++i) if (e0[i].w == -1) { u = e0[i].u; v = e0[i].v; if (d[u] == d[v]) e0[i].w = 0; else e0[i].w = 1; } puts( YES ); for (i = 1; i < n; ++i) printf( %d %d %d n , e0[i].u, e0[i].v, e0[i].w); } return 0; } void dfs(int u) { int i, v; vis[u] = 1; for (i = head[u]; i; i = e[i].nxt) if (!vis[v = e[i].v]) { d[v] = (d[u] ^ e[i].w); dfs(v); } else fl |= d[v] != (d[u] ^ e[i].w); } void adde(int u, int v, int w) { e[++en].v = v; e[en].w = w; e[en].nxt = head[u]; head[u] = en; }
|
#include <bits/stdc++.h> using namespace std; struct edge { int v, u; long long w; edge() {} edge(int a, int b, long long c) : v(a), u(b), w(c) {} bool operator<(edge e) const { return w < e.w; } }; const int N = 100 * 1000 + 10; vector<int> graph[N]; vector<long long> wei[N]; edge e[N * 2]; int n, m, par[N], cnt, upd[N]; bool is[N]; long long d[N]; int root(int v) { if (v == par[v]) return v; return par[v] = root(par[v]); } bool merge(int v, int u) { v = root(v); u = root(u); if (v == u) return false; par[v] = u; return true; } long long mst() { sort(e, e + cnt); long long ans = 0; for (int i = 0; i <= n - 1; i++) par[i] = i; for (int i = 0; i <= cnt - 1; i++) if (merge(e[i].v, e[i].u)) ans += e[i].w; return ans; } void dijk() { set<pair<long long, int> > st; for (int i = 0; i <= n - 1; i++) { d[i] = (1000LL * 1000 * 1000 * 1000 * 1000 * 1000); if (is[i]) { d[i] = 0; upd[i] = i; } st.insert(pair<long long, int>(0, i)); } while (!st.empty()) { int ind = st.begin()->second; st.erase(st.begin()); for (int i = 0; i <= ((int)(graph[ind]).size()) - 1; i++) { int u = graph[ind][i]; long long w = wei[ind][i] + d[ind]; if (d[u] > w) { st.erase(pair<long long, int>(d[u], u)); d[u] = w; upd[u] = upd[ind]; st.insert(pair<long long, int>(d[u], u)); } } } for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= ((int)(graph[i]).size()) - 1; j++) { int u = graph[i][j]; e[cnt++] = edge(upd[i], upd[u], wei[i][j] + d[i] + d[u]); } } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 0; i <= m - 1; i++) { int a, b; long long c; cin >> a >> b >> c; a--; b--; graph[a].push_back(b); graph[b].push_back(a); wei[a].push_back(c); wei[b].push_back(c); } int k; cin >> k; for (int i = 0; i <= k - 1; i++) { int x; cin >> x; x--; is[x] = true; } dijk(); cout << mst() + d[0] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long t; cin >> t; while (t--) { long long n, k; cin >> n >> k; vector<long long> p; vector<long long> pre; for (long long i = 0; i < n; i++) { p.push_back(i + 1); } long long sum = 0; for (long long i = 0; i < n; i++) { sum += p[i]; pre.push_back(sum); } long long ind = lower_bound(pre.begin(), pre.end(), k) - pre.begin(); long long x = p[ind]; long long y = n - x - 1; long long bb; bb = y + (pre[ind] - k) + 1; vector<char> ans; for (long long i = 0; i < n; i++) { if (i == y || i == bb) ans.push_back( b ); else ans.push_back( a ); } for (int i = 0; i < n; i++) { cout << ans[i]; } cout << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MAXN = 100005; const int D = 1005; struct data { int ind; long long Sum; data(int _ind, long long _Sum) { ind = _ind; Sum = _Sum; } }; bool compare(data A, data B) { if (A.Sum < B.Sum) return true; if (A.Sum == B.Sum && A.ind < B.ind) return true; return false; } long long f(long long a, long long b, long long c) { return (((a - b) * (a - b)) + (c * c)); } long long a[MAXN], S[MAXN]; vector<data> Q; int main() { int N; cin >> N; S[0] = 0; for (int i = 1; i <= N; i++) { cin >> a[i]; S[i] = S[i - 1] + a[i]; data r(i, S[i]); Q.push_back(r); } long long ans = MAXN * MAXN; for (long long i = 2; i <= N; i++) { for (long long j = i; j <= i + D && j <= N; j++) { long long res = f(S[i - 1], S[j], j - i + 1); ans = min(ans, res); } } sort(Q.begin(), Q.end(), compare); for (int i = 0; i < Q.size(); i++) { for (int j = i + 1; j < Q.size() && j < i + D; j++) { ans = min(ans, f(Q[i].Sum, Q[j].Sum, abs(Q[i].ind - Q[j].ind))); } } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> const int inf = INT_MAX; const int MAX = 1e3 + 8; const long long MOD = 1e9 + 7; const int TOT_PRIMES = 1e6 + 9; const int MAX_A = 71; const int LN = 20; using namespace std; int main() { int n, k; cin >> n >> k; int a[32]; memset(a, 0, sizeof(a)); for (int i = 0; i < n; i++) { int res = 0; for (int j = 0; j < k; j++) { int x; cin >> x; res = x + res * 2; } a[res] = 1; } int f = 0; for (int i = 0; i < (1 << k); i++) { for (int j = 0; j < (1 << k); j++) { if ((!(i & j)) && a[i] && a[j]) f = 1; } } if (f) cout << YES ; else cout << NO ; }
|
#include <bits/stdc++.h> using namespace std; int main(void) { string s; cin >> s; vector<set<int>> v(26); for (int i = 0, l = s.size(); i < l; i++) { v[s[i] - a ].insert(i); } int q; cin >> q; int t; while (q--) { cin >> t; if (t == 1) { int pos; char c; cin >> pos >> c; pos--; v[s[pos] - a ].erase(pos); s[pos] = c; v[c - a ].insert(pos); } else if (t == 2) { int l, r, cnt = 0; cin >> l >> r; l--; for (int i = 0; i < 26; i++) { auto itr = v[i].lower_bound(l); if (itr != v[i].end() && *itr < r) { cnt++; } } cout << cnt << endl; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for (int i = 0; i < t; i++) { long long n, k; cin >> n >> k; long long ans = 0; while (n != 0) { if (n % k == 0) { n /= k; ans++; } else { ans += n % k; n -= n % k; } } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; int N, K; long long L[MAXN], R[MAXN]; double dp[MAXN][MAXN]; double calc(long long l, long long r) { long long ret = 0, cur = 1; for (; cur <= r; cur *= 10) { if (cur == 1e18) { ret++; break; } if (cur * 10 <= l) continue; if (cur <= l && cur * 10 > l) { int a = l / cur; if (a == 1) { if (cur * 10 <= r) ret += cur * 2 - l; else { int b = r / cur; if (b == 1) ret += r - l + 1; else ret += cur * 2 - l; } } } else if (cur * 10 > r) { int b = r / cur; if (b == 1) ret += r - cur + 1; else ret += cur; } else ret += cur; } return double(ret) / (r - l + 1); } int main() { if (fopen( input.txt , r )) freopen( input.txt , r , stdin); cin >> N; for (int i = 0; i < N; i++) cin >> L[i] >> R[i]; cin >> K; K = ceil(K / 100. * N); dp[0][0] = 1; for (int i = 0; i < N; i++) { double p = calc(L[i], R[i]); for (int j = 0; j < N; j++) { dp[i + 1][j + 1] += dp[i][j] * p; dp[i + 1][j] += dp[i][j] * (1 - p); } } double ans = 0; for (int k = K; k <= N; k++) ans += dp[N][k]; cout << fixed << setprecision(10) << ans << n ; return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.