func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 100; int n, sl, res; int c[maxn][27]; int d[maxn][2], trace[maxn]; vector<int> a[maxn]; vector<string> q; void init() { q.clear(); for (int i = 1; i <= sl; i++) { for (int j = 0; j < 26; j++) { c[i][j] = 0; } } } void nhap() { string s; cin >> n; getline(cin, s); init(); res = 0; sl = 1; for (int i = 1; i <= n; i++) { getline(cin, s); q.push_back(s); int root = 1; for (int j = 0; j < s.size(); j++) { int x = s[j] - a ; if (c[root][x] == 0) { sl++; c[root][x] = sl; } root = c[root][x]; } } } void taodothi(string s) { int root = 1; int root1 = c[1][s[0] - a ]; if (root1 == 0) return; for (int i = 1; i < s.size(); i++) { int x = s[i] - a ; root = c[root][x]; root1 = c[root1][x]; if (root1 == 0 || root == 0) { return; } trace[root] = 1; trace[root1] = 1; a[root].push_back(root1); a[root1].push_back(root); } } void dfs(int u) { trace[u] = 0; d[u][0] = 0; d[u][1] = 1; for (int i = 0; i < a[u].size(); i++) { int v = a[u][i]; if (trace[v] == 1) { dfs(v); d[u][0] += d[v][1]; d[u][1] += min(d[v][0], d[v][1]); } } } void xuli() { for (int i = 1; i <= sl; i++) { a[i].clear(); } for (int i = 0; i < q.size(); i++) { taodothi(q[i]); } res = sl - 1; for (int i = 1; i <= sl; i++) { if (trace[i] == 1) { dfs(i); res -= min(d[i][0], d[i][1]); } } cout << res << endl; } int main() { int test; cin >> test; while (test--) { nhap(); xuli(); } } |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y, z, xsum(0), ysum(0), zsum(0); cin >> n; while (n--) { cin >> x >> y >> z; xsum += x; ysum += y; zsum += z; } if (xsum == 0 && ysum == 0 && zsum == 0) { cout << YES << endl; } else { cout << NO << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; string to_string(string s) { return + s + ; } string to_string(char s) { return string(1, s); } string to_string(const char *s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } template <typename A> string to_string(A); template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A> string to_string(A v) { bool f = 1; string r = { ; for (const auto &x : v) { if (!f) r += , ; f = 0; r += to_string(x); } return r + } ; } void debug_out() { cout << endl; } void show() { cout << endl; } void pret() { cout << endl; exit(0); } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cout << << to_string(H); debug_out(T...); } template <typename Head, typename... Tail> void show(Head H, Tail... T) { cout << H << ; show(T...); } template <typename Head, typename... Tail> void pret(Head H, Tail... T) { cout << H << ; pret(T...); } const long long MOD = 1e9 + 7; const long long maxn = 300000 + 10; string s[11]; long long n, m; bool check(string &t) { for (long long i = 0; i < n; ++i) { long long curr = 0; for (long long j = 0; j < m; ++j) { curr += (s[i][j] != t[j]); } if (curr > 1) return 0; } return 1; } string f() { cin >> n >> m; for (long long i = 0; i < n; ++i) { cin >> s[i]; } for (long long i = 0; i < n; ++i) { string temp = s[i]; for (long long j = 0; j < m; ++j) { for (long long k = 0; k < 26; ++k) { char curr = char( a + k); temp[j] = curr; if (check(temp)) { return temp; } } temp[j] = s[i][j]; } } return -1 ; } int32_t main() { cin.tie(0); ios_base::sync_with_stdio(0); ; long long t; cin >> t; while (t--) { string ans = f(); cout << ans << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k, d; cin >> n >> k >> d; long long int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } map<int, int> p; long long int l = 0, size = 0, m = 99999999; for (int i = 0; i < n; i++) { if (i < d) { if (p[a[i]] == 0) { size++; } p[a[i]]++; if (i == d - 1) { m = min(m, size); } } else { if (p[a[l]] == 1) { size--; } p[a[l]]--; l++; if (p[a[i]] == 0) { size++; } p[a[i]]++; m = min(m, size); } } cout << m << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int flash_drives[100001]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { scanf( %d , &flash_drives[i]); } sort(flash_drives, flash_drives + n, greater<int>()); int l = 0; int sum = 0; for (int i = 0; i < n; i++) { if (sum < m) { sum += flash_drives[i]; l++; } else break; } printf( %d n , l); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; long long minNumNod = k * (1 + k) / 2; if (minNumNod > n || k > 1e6) { cout << -1 << endl; return 0; } long long nod = 1; for (long long i = 2; i * i <= n; i++) { if (minNumNod * i > n) break; if (n % i == 0) { if (n / i * minNumNod <= n) { nod = n / i; break; } else nod = i; } } long long numNod = n / nod; long long ost = numNod - minNumNod; for (long long i = 1; i < k; i++) { cout << i * nod << ; } cout << k * nod + ost * nod << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[1000000]; int main() { long long n, s; cin >> n >> s; for (long long i = 0; i < n; i++) { long long k, m; cin >> k >> m; a[k] = max(a[k], m); } long long ans = 0, last = s; for (long long i = s; i > 0; i--) { if (a[i]) { ans = max(ans + last - i, a[i]); last = i; } } cout << ans + last; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; const int inf = 1 << 30; int n, t; int main() { cin >> n; int v; set<int> s; for (int i = 0; i < n; i++) { cin >> v; if (v != 0) s.insert(v); } int a = s.size(); if (a != 0) cout << a << endl; else cout << 1 << endl; return 0; } |
#include <bits/stdc++.h> inline int getint() { register char ch; register bool neg = false; while (!isdigit(ch = getchar())) if (ch == - ) neg = true; register int x = ch ^ 0 ; while (isdigit(ch = getchar())) x = (((x << 2) + x) << 1) + (ch ^ 0 ); return neg ? -x : x; } const int _inf = -0x40000000; const int N = 30001, K = 201; int a[N]; int f[N][K][4]; int main() { int n = getint(), k = getint(); for (register int i = 1; i <= n; i++) { a[i] = getint(); } for (register int j = 1; j <= k; j++) { for (register int k = 0; k <= 3; k++) { f[0][j][k] = _inf; } } for (register int i = 1; i <= n; i++) { for (register int j = 1; j <= k; j++) { const int s = a[i] * ((j != 1 && j != k) ? 2 : 1); f[i][j][0] = std::max(f[i - 1][j][0], f[i - 1][j - 1][3]) - s; f[i][j][1] = std::max(f[i - 1][j][1], f[i][j][0]); f[i][j][2] = std::max(f[i - 1][j][2], f[i - 1][j - 1][1]) + s; f[i][j][3] = std::max(f[i - 1][j][3], f[i][j][2]); if (j != 1 && j != k) { f[i][j][1] = std::max(f[i][j][1], f[i - 1][j - 1][1]); f[i][j][3] = std::max(f[i][j][3], f[i - 1][j - 1][3]); } } } printf( %d n , std::max(f[n][k][1], f[n][k][3])); return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:102400000,102400000 ) const int inf = 0x3f3f3f3f; const long double PI = acos(-1); using namespace std; const int N = 1e5 + 10; int t, n, ans; char s[N]; int solve() { for (char c = a ; c <= z ; c++) { int temp = 0, i = 0, j = n - 1; while (i < j) { if (s[i] != s[j]) { if (s[i] == c) { i++, temp++; } else if (s[j] == c) { j--, temp++; } else { temp = n + 1; break; } } else { i++, j--; } } ans = min(ans, temp); } if (ans == n + 1) return -1; else return ans; } int main() { ios::sync_with_stdio(false), cin.tie(0); cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; i++) cin >> s[i]; ans = inf; cout << solve() << endl; } } |
#include <bits/stdc++.h> using namespace std; int N, M, C, a[100009]; int res(int p1, int p2, int p3) { int s = 0; if (p1 > p2) s += (p2 - p1); if (p2 > p3) s += (p3 - p2); return s; } void solve(int s) { int G; cin >> G; if (G <= C / 2) { for (int i = 1; i <= N; i++) { if (a[i] == 0 || a[i] > G) { cout << i << endl; a[i] = G; break; } } } else { for (int i = N; i >= 1; i--) { if (a[i] == 0 || a[i] < G) { cout << i << endl; a[i] = G; break; } } } } bool check() { for (int i = 1; i <= N - 1; i++) { if (a[i] > a[i + 1] || a[i] == 0 || a[i + 1] == 0) return false; } return true; } int main() { cin >> N >> M >> C; for (int i = 1; i <= M; i++) { solve(i); if (check() == true) break; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s; cin >> s; int n = s.length(); int m; cin >> m; int b[m + 2]; for (int i = 1; i <= m; i++) { cin >> b[i]; } char ans[m + 2]; sort(s.begin(), s.end()); map<int, int> mp; for (int i = 0; i < n; i++) mp[s[i] - a ]++; int j = n - 1; while (true) { vector<int> v; int count = 0; for (int i = 1; i <= m; i++) { if (b[i] == 0) { count++; v.push_back(i); } } if (count == 0) break; if (mp[s[j] - a ] < count) { j = j - mp[s[j] - a ]; continue; } int flag = j; j = j - mp[s[j] - a ]; for (int i = 1; i <= m; i++) { if (b[i] == 0) { ans[i] = s[flag--]; b[i] = -1; } else { for (int k = 0; k < v.size(); k++) { b[i] = b[i] - abs(i - v[k]); } } } } for (int i = 1; i <= m; i++) { cout << ans[i]; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; int heliqi; int main() { long long N, M, K; cin >> N >> M >> K; long long ans = -1; if (N + M < K + 2) { cout << -1 << endl; return 0; } long long t = 2; while (t--) { if (K < N) ans = max((N / (K + 1)) * M, ans); else ans = max(M / (K - N + 1 + 1), ans); swap(N, M); } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long n, k, p, i, j, max = 0; cin >> n >> k >> p; long long a[n + 1]; long long b[k + 1]; for (i = 1; i <= n; i++) cin >> a[i]; for (i = 1; i <= k; i++) cin >> b[i]; sort(a + 1, a + n + 1); sort(b + 1, b + k + 1); long long x; long long ans = INT_MAX; for (i = 1; i <= k - n + 1; i++) { max = 0; for (long long l = 1; l <= n; l++) { x = abs(b[i + l - 1] - p) + abs(a[l] - b[i + l - 1]); if (x > max) max = x; } if (max < ans) ans = max; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(NULL); cin.sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n; i++) { int a, b, x, y; cin >> a >> b >> x >> y; cout << max(max(((a - 1) - x) * b, ((b - 1) - y) * a), max((x)*b, (y)*a)) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; struct node { int x, in; } arr[210000], qu[210000]; int n, m, k, ans, len; int head, tail; int cmp(node a, node b) { if (a.x == b.x) return a.in < b.in; else return a.x < b.x; } int main() { int i, j, tp; while (scanf( %d%d%d , &n, &m, &k) != EOF) { for (i = 1; i <= n; ++i) scanf( %d , &arr[i].x), arr[i].in = i; sort(arr + 1, arr + 1 + n, cmp); ans = 1, len = 0; head = 0, tail = 1; qu[++head] = arr[1]; for (i = 2; i <= n; ++i) { if (arr[i].x != qu[head].x) { while (tail < head) tail++; len = head = 0; tail = 1; qu[++head] = arr[i]; } else { tp = arr[i].in - qu[head].in - 1; if (tp + len > k) { while (tp + len > k && tail < head) { len -= qu[tail + 1].in - qu[tail].in - 1; tail++; } if (tail == head) len = 0; } len += tp; qu[++head] = arr[i]; } if (head - tail + 1 > ans) ans = head - tail + 1; } printf( %d n , ans); } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ii = pair<int, int>; const int MAXN = 5 + 300000; const int MAXB = 21; int n, arr[MAXN], nxt[MAXN][MAXB], memo[MAXN][MAXB]; int dp(int i, int k) { if (i == n) return n; int& ans = memo[i][k]; if (ans == -1) { if (nxt[i][k] == i) { ans = i; } else { ans = n; assert((arr[i] & (1 << k)) == 0); for (int j = 0; j < MAXB; ++j) { if (arr[i] & (1 << j)) { ans = min(ans, dp(nxt[1 + i][j], k)); } } } } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int q; cin >> n >> q; memset(nxt, -1, sizeof nxt); for (int i = (int)0; i < (int)n; ++i) { int x; cin >> x; arr[i] = x; for (int k = 0; k < MAXB; ++k) { if (x & (1 << k)) { nxt[i][k] = i; } } } memset(memo, -1, sizeof memo); for (int j = 0; j < MAXB; ++j) { nxt[n][j] = n; } for (int i = n - 1; i >= 0; --i) { for (int j = 0; j < MAXB; ++j) { if (nxt[i][j] == -1) { nxt[i][j] = nxt[1 + i][j]; } } } while (q--) { int x, y; cin >> x >> y; --x; --y; bool ans = false; for (int j = 0; j < MAXB; ++j) { if ((arr[y] & (1 << j)) && dp(x, j) <= y) { ans = true; break; } } cout << (ans ? Shi : Fou ) << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> v(n); for (auto &x : v) { scanf( %d , &x); } sort(v.begin(), v.end()); int pos = 0, cnt = 0; for (int x : v) { while (pos < n) { if (v[pos] > x) { pos++; cnt++; break; } pos++; } } printf( %d n , cnt); return 1 == 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, v; scanf( %d%d , &n, &v); if (n - v <= 1) { printf( %d , n - 1); } else { printf( %d , (n - v + 1) * (n - v) / 2 + v - 1); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, j; char cad[1000][1000]; bool marcas[10]; int main() { bool ok = 1; scanf( %d%d , &n, &m); for (i = 0; i < n && ok; i++) { scanf( %s , cad[i]); for (j = 1; j < m && ok; j++) ok = cad[i][j] == cad[i][0]; } for (i = 1; i < n && ok; i++) for (j = 0; j < m && ok; j++) ok = cad[i][j] != cad[i - 1][j]; printf(ok ? YES n : NO n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int ara[n + 5], ar[n + 5]; ar[0] = INT_MAX; int j = 1, i, a = 0, b = 1; for (i = 1; i <= n; ++i) { cin >> ara[i]; if (ara[i] == 0) ar[j++] = i; } ar[j] = INT_MAX; for (i = 1; i <= n; ++i) { int temp = min(abs(ar[a] - i), abs(ar[b] - i)); cout << temp << ; if (ara[i] == 0) ++a, ++b; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long p = 1e9 + 7; long long dp[40][40][2], n, ans; int lim[45], len; int calc(int x, int sgn) { if (x == 0) return sgn ^ 1; return 1 << x >> 1; } int main() { cin >> n; if (n == 0) return puts( 1 ), 0; while (n) { lim[++len] = n & 1; n >>= 1; } reverse(lim + 1, lim + len + 1); dp[0][0][1] = 1; for (int i = 0; i < len; ++i) for (int j = 0; j <= i; ++j) for (int k = 0; k < 2; ++k) { (dp[i + 1][j][k & (lim[i + 1] ^ 1)] += 1ll * dp[i][j][k] * calc(j, 0) % p) %= p; if ((!k) || lim[i + 1]) { (dp[i + 1][j][k] += 1ll * dp[i][j][k] * calc(j, 1) % p) %= p; (dp[i + 1][j + 1][k] += dp[i][j][k]) %= p; } } for (int i = 0; i <= len; ++i) (ans += (dp[len][i][0] + dp[len][i][1]) % p) %= p; printf( %lld n , ans); return 0; } |
#include<iostream> #include<cstring> #include<cmath> #include<string> #include<algorithm> #include<cstdio> #include<set> #include<vector> #include<map> #include<stack> using namespace std; const int N = 110; const int inf = 0x3f3f3f3f; typedef long long ll; #define reg register const int mod = 1e9 + 7; inline ll gcd(reg ll a, reg ll b) { return b == 0 ? a : gcd(b, a % b); } inline ll lcm(reg ll a, reg ll b) { return a / gcd(a, b) * b; } signed main() { ios::sync_with_stdio(false); //freopen( 文本.txt , r , stdin); ll T, n; cin >> T; while (T--) { cin >> n; reg ll res = 0, k = 1; for (reg ll i = 1; k <= n; i++) { k = lcm(k, i); if (n < k) break; res += n / k; } cout << (res + n) % mod << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, k; cin >> n >> k; vector<long long int> a(n); for (long long int i = 0; i < a.size(); i++) cin >> a[i]; long long int ans(0); for (long long int i = 0; i < n; i++) { long long int t; cin >> t; if (t) ans += a[i], a[i] = 0; } long long int s(0); long long int tot(0); for (long long int i = 0; i < k; i++) { s = s + a[i]; } tot = s; for (long long int i = k; i < n; i++) { s += (a[i] - a[i - k]); tot = max(tot, s); } cout << ans + tot << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; set<char> st; for (int i = 0; i < s.size(); i++) { if (s[i] == s[i + 1]) { i++; } else { st.insert(s[i]); } } for (auto it : st) { cout << it; } cout << n ; } void withtest() { int t; cin >> t; while (t--) { solve(); } return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); withtest(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> auto dud(c *x) -> decltype(cerr << *x, 0); template <class c> char dud(...); struct debug { ~debug() { cerr << endl; } template <class c> typename enable_if<sizeof dud<c>(0) != 1, debug &>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if<sizeof dud<c>(0) == 1, debug &>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class c, class b> debug &operator<<(pair<b, c> d) { return *this << ( << d.first << , << d.second << ) ; } template <class c> debug &operator<<(rge<c> d) { *this << [ ; for (auto it = d.b; it != d.e; ++it) *this << , + 2 * (it == d.b) << *it; return *this << ] ; } }; long double eps = (long double)1 / 1e6; const long double pi = 3.14159265359; long long inf = 1e18, mod1 = 1e9 + 7; long long sqr(long long a) { return a * a; } long long qb(long long a) { return a * a * a; } void umin(int &a, int b) { a = min(a, b); } void umax(int &a, int b) { a = max(a, b); } bool is_prime(long long val) { for (long long i = 2; i <= sqrt(val); i++) if (val % i == 0) return 0; return 1; } long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); } long long binpow(long long a, long long b, long long mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; } long long binmult(long long a, long long b, long long mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; } const long long tx[4] = {0, 1, -1, 1}; const long long ty[4] = {-1, 0, 1, 1}; const char rev_to[4] = { E , W , N , S }; const int M = 1e9; const int N = 2e5 + 2; const int ppp = 73; const int lg = 19; const int OPEN = 1; const int CLOSE = 0; auto rnd = bind(uniform_int_distribution<long long>(1, N), mt19937(time(0))); void bad() { cout << NE ; exit(0); } vector<pair<int, int>> g[N]; int n, m; vector<pair<int, pair<int, int>>> edges; int v, u, x; int p[N], second[N]; void init() { iota(p, p + N, 0); fill(second, second + N, 1); } int dad(int v) { if (v == p[v]) return v; return p[v] = dad(p[v]); } bool mg(int a, int b) { int ra = dad(a), rb = dad(b); if (ra == rb) return 0; if (second[ra] < second[rb]) swap(ra, rb); p[rb] = ra; second[ra] += second[rb]; return 1; } const int K = 32; int basis[K]; vector<int> lol[N]; int wh[N], inv[N]; int sz; void add(int msk, int nmb) { for (int i = K - 1; ~i; i--) { if (!((1ll << i) & msk)) continue; if (!basis[i]) { basis[i] = msk; wh[sz] = i; inv[i] = sz; sz++; return; } msk ^= basis[i]; } } void to_conclude(int &val, int nmb) { for (int i = K - 1; ~i; i--) { val = min(val, val ^ basis[i]); } } int xr[N]; int V[N], U[N], X[N]; void dfs(int v, int xx, int p) { xr[v] = xx; for (auto &z : g[v]) { if (z.first == p) continue; dfs(z.first, z.second ^ xx, v); } } signed main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); ; cin >> n >> m; init(); vector<int> nd; for (int i = 0; i < m; i++) { cin >> V[i] >> U[i] >> X[i]; V[i]--; U[i]--; int x1 = dad(V[i]), x2 = dad(U[i]); if (x1 == x2) { nd.push_back(i); } else { mg(x1, x2); g[V[i]].push_back({U[i], X[i]}); g[U[i]].push_back({V[i], X[i]}); } } dfs(0, 0, 0); int cnt = 0; for (auto &z : nd) { int lulw = xr[V[z]] ^ xr[U[z]] ^ X[z]; if (!lulw) continue; add(lulw, z); cnt++; } to_conclude(xr[n - 1], 1); cout << xr[n - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; long long dp[3][111111]; vector<int> graph[111111]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; for (int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; a--; b--; graph[a].push_back(b); graph[b].push_back(a); } for (int i = 0; i < n; i++) dp[0][i] = 1; for (int len = 1; len <= 2; len++) for (int v = 0; v < n; v++) { for (int u : graph[v]) dp[len][v] += dp[len - 1][u]; } int sum = 0; for (int i = 0; i < n; i++) sum += dp[2][i]; sum /= 2; sum -= n - 1; cout << sum << n ; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int MAXN = 1e3 + 10; inline long long in() { long long x = 0, flag = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) flag = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar(); return x * flag; } int T; int n, m; long long ans; long long fac[MAXN]; long long c[MAXN << 1][MAXN << 1]; long long dp[52][MAXN]; void prework() { fac[0] = 1; for (int i = 1; i <= 1000; i++) fac[i] = fac[i - 1] * 1LL * i % MOD; c[0][0] = 1; for (int i = 1; i <= 2000; i++) { c[i][0] = 1; for (int j = 1; j <= i; j++) (c[i][j] = c[i - 1][j - 1] + c[i - 1][j]) %= MOD; } dp[0][0] = 1; for (int i = 0; i <= 50; i++) { for (int j = i * (i + 1) / 2; j <= 1000; j++) { if (j + i <= 1000 && i != 0) (dp[i][j + i] += dp[i][j]) %= MOD; if (j + i + 1 <= 1000) (dp[i + 1][j + i + 1] += dp[i][j]) %= MOD; } } } int main() { T = in(); prework(); while (T--) { ans = 0; n = in(), m = in(); for (int i = m * (m + 1) / 2; i <= n; i++) { if (dp[m][i] == 0) continue; int res = n - i; (ans += c[res + m][m] * fac[m] % MOD * dp[m][i] % MOD) %= MOD; } printf( %lld n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false), cin.tie(NULL); int a[100][100]; int b[100][100]; int m, n; cin >> m >> n; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { b[i][j] = 1; } } for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; if (!a[i][j]) { for (int k = 0; k < m; k++) b[k][j] = 0; for (int k = 0; k < n; k++) b[i][k] = 0; } } } bool flag = true; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (a[i][j] == 1) { int g = 0; int r = i; int c = j; for (int h = 0; h < n; h++) if (b[r][h]) g = 1; for (int h = 0; h < m; h++) if (b[h][c]) g = 1; if (!g) flag = false; } } } if (!flag) cout << NO ; else { cout << YES n ; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cout << b[i][j] << ; } cout << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a = min(m, n); if (a % 2 == 0) { cout << Malvika ; } else { cout << Akshat ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { bool f1 = true, f2 = false; int arrS[26] = {0}; int arrT[26] = {0}; string s, t; getline(cin, s); getline(cin, t); for (int i = 0; i < s.size(); i++) arrS[s[i] - a ]++; for (int i = 0; i < t.size(); i++) arrT[t[i] - a ]++; for (int i = 0; i < 26; i++) if (arrS[i] < arrT[i]) { cout << need tree << endl; return 0; } if (s.size() == t.size()) { cout << array << endl; return 0; } int j = 0; for (int i = 0; i < s.size(); i++) if (s[i] == t[j]) j++; if (j == t.size()) cout << automaton << endl; else cout << both << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = (int)1e6; const int inf = (int)2e9; const double eps = 1e-9; const int mod = (int)1e9 + 7; int n, l, x, y, a[maxn], ok1, ok2; map<int, int> was; bool check(int v) { if (v >= 0 && v <= l && (was.count(v - x) || was.count(v + x) || ok1) && (ok2 || was.count(v - y) || was.count(v + y))) return true; return false; } int main() { scanf( %d%d%d%d , &n, &l, &x, &y); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); if (was.count(a[i] - x)) ok1 = true; if (was.count(a[i] - y)) ok2 = true; was[a[i]] = true; } if (ok1 && ok2) { puts( 0 ); return 0; } for (int i = 1; i <= n; ++i) { if (check(a[i] - x)) { puts( 1 ); cout << a[i] - x << n ; return 0; } if (check(a[i] - y)) { puts( 1 ); cout << a[i] - y << n ; return 0; } if (check(a[i] + x)) { puts( 1 ); cout << a[i] + x << n ; return 0; } if (check(a[i] + y)) { puts( 1 ); cout << a[i] + y << n ; return 0; } } puts( 2 ); cout << x << << y << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 7; int a[N], h[N], f[N << 2], lazy[N << 2]; vector<int> p[N], g[N]; struct node { int fi, id, se; } b[N]; void dfs(int x, int fa) { b[x] = b[fa]; if (h[x] <= b[x].fi) { b[x].se = b[x].fi; b[x].fi = h[x]; b[x].id = x; } else { if (h[x] < b[x].se) b[x].se = h[x]; } for (int v : p[x]) if (v != fa) { dfs(v, x); } } void built(int x, int l, int r, int n) { if (l == r) { f[x] = -(n - l + 1); return; } int mid = (l + r) / 2; built(x << 1, l, mid, n); built(x << 1 | 1, mid + 1, r, n); f[x] = min(f[x << 1], f[x << 1 | 1]); } void push_down(int x) { f[x << 1] += lazy[x]; lazy[x << 1] += lazy[x]; f[x << 1 | 1] += lazy[x]; lazy[x << 1 | 1] += lazy[x]; lazy[x] = 0; } void update(int x, int l, int r, int left, int right, int y) { if (left > r || right < l) return; if (left <= l && right >= r) { f[x] += y; lazy[x] += y; return; } push_down(x); int mid = (l + r) / 2; update(x << 1, l, mid, left, right, y); update(x << 1 | 1, mid + 1, r, left, right, y); f[x] = min(f[x << 1], f[x << 1 | 1]); } int R; void query(int x, int l, int r) { if (f[x] >= 0) return; if (l == r) { R = l; return; } push_down(x); int mid = (l + r) / 2; if (f[x << 1 | 1] < 0) query(x << 1 | 1, mid + 1, r); else query(x << 1, l, mid); } bool cmp(int x, int y) { return b[x].se < b[y].se; } int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &h[i]); for (int i = 1; i < n; i++) { int u, v; scanf( %d%d , &u, &v); p[u].push_back(v); p[v].push_back(u); } int k; scanf( %d , &k); for (int i = 1; i <= k; i++) scanf( %d , &a[i]); sort(a + 1, a + k + 1); b[0] = {(int)2e9, 0, (int)2e9}; dfs(1, 0); built(1, 1, k, k); for (int i = 1; i <= n; i++) { g[b[i].id].push_back(i); int t = upper_bound(a + 1, a + k + 1, b[i].fi) - a - 1; update(1, 1, k, 1, t, 1); } if (f[1] >= 0) { printf( 0 ); return 0; } int ans = 2e9; for (int i = 1; i <= n; i++) if (g[i].size()) { sort(g[i].begin(), g[i].end(), cmp); int len = g[i].size(), tmp = -1; for (int j = 0; j < len; j++) { int t = upper_bound(a + 1, a + k + 1, b[g[i][j]].fi) - a - 1; update(1, 1, k, 1, t, -1); } for (int j = 0; j < len; j++) { int t = upper_bound(a + 1, a + k + 1, b[g[i][j]].se) - a - 1; R = 0; query(1, 1, k); if (tmp == -1 && f[1] + len - j >= 0 && R <= t) { tmp = a[R]; } update(1, 1, k, 1, t, 1); } for (int j = 0; j < len; j++) { int t = upper_bound(a + 1, a + k + 1, b[g[i][j]].se) - a - 1; update(1, 1, k, 1, t, -1); } for (int j = 0; j < len; j++) { int t = upper_bound(a + 1, a + k + 1, b[g[i][j]].fi) - a - 1; update(1, 1, k, 1, t, 1); } if (tmp != -1) { ans = min(ans, tmp - h[i]); } } if (ans == 2e9) printf( -1 ); else printf( %d , ans); return 0; } |
#include <bits/stdc++.h> const long long SZ = 401010; const long long INF = 1e18; const long long MOD = 1000000007; const long long mod = 998244353; long long opnmbr = 1; using namespace std; void solve() {} long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } bool isPrime(long long n) { long long sq = sqrt(n); for (long long i = 2; i <= sq; i++) { if (n % i == 0) { return false; } } return true; } void krdiyasuru() { long long n, k; cin >> n >> k; string a; cin >> a; string chk; chk = a; for (long long i = k; i < (n); i++) { a[i] = a[i - k]; } if (a >= chk) { cout << n << n ; cout << a << n ; return; } for (long long i = k - 1; i >= (0); i--) { if (a[i] == 9 && i != 0) { a[i] = 0 ; } else if (a[i] != 9 ) { a[i]++; break; } } cout << n << n ; for (long long i = k; i < (n); i++) { a[i] = a[i - k]; } cout << a << n ; return; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); { krdiyasuru(); } return 0; } |
#include <bits/stdc++.h> using namespace std; struct mydata { int id; int x; int num; bool operator<(const mydata &r) const { if (x == r.x) return id < r.id; else return x < r.x; } } data[50]; int ret[2000]; int main() { int n, m; scanf( %d%d , &n, &m); int i; for (i = 0; i < m; i++) { data[i].id = i + 1; data[i].num = 0; scanf( %d , &data[i].x); } sort(data, data + m); int total = n; int maxnum = 0; for (i = 0; i < m; i++) { data[i].num = min(data[i].x, total / (m - i)); maxnum = max(maxnum, data[i].num); total -= data[i].num; } if (total > 0) printf( -1 n ); else if (maxnum * 2 > n) printf( -1 n ); else { int idx = 0; int j; for (i = 0; i < m; i++) { for (j = 0; j < data[i].num; j++) { ret[idx] = data[i].id; idx += 2; if (idx >= n) idx = 1; } } for (i = 0; i < n; i++) printf( %d , ret[i]); printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; void c_p_c() { ios_base::sync_with_stdio(0); cin.tie(0); cin.tie(0); } int main() { c_p_c(); int Q; cin >> Q; while (Q--) { int n, h = 0, j = 0, b[2]; cin >> n; for (int i = 1; i <= n; i++) { int a; cin >> a; if (a % 2 == 0) h = i; else { if (j == 2) continue; b[j++] = i; } } if (h > 0) cout << 1 n << h << n ; else if (j == 2) { cout << 2 n << b[0] << << b[1] << n ; } else cout << -1 n ; } } |
#include <bits/stdc++.h> using namespace std; long long int fact(long long int n) { long long int ans = 1; for (long long int i = 2; i <= n; i++) ans = (ans % 1000000007 * i % 1000000007) % 1000000007; return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int n; cin >> n; cout << (n % 1000000007 * fact(2 * n - 1) % 1000000007) % 1000000007 << endl; } } |
#include <bits/stdc++.h> using namespace std; int main() { int T, cas = 0; scanf( %d , &T); while (cas++ < T) { int sum = 0, s[251], maxi = 0; for (int i = 1; i <= 250; i++) { scanf( %d , s + i); sum += s[i]; maxi = max(s[i], maxi); } double aver = sum / 250.0, fang = 0; for (int i = 1; i <= 250; i++) { fang += (s[i] - aver) * (s[i] - aver); } fang /= 250; if (fang / aver > 2) { printf( %.0f n , maxi * 1.04 / 2); } else printf( %.0f n , aver); } return 0; } |
#include <bits/stdc++.h> using namespace std; string to_string(bool b) { return (b ? true : false ); } template <size_t N> string to_string(bitset<N> v) { string res = ; for (size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto &x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } const int mod = 1000000007; void solve() { int n; cin >> n; map<string, int> m; vector<string> v(n); for (int i = 0; i < (n); ++i) cin >> v[i]; for (int i = 0; i < (n); ++i) { for (int j = 1; j <= 8; j++) { for (int k = 0; k + j <= 9; k++) { m[v[i].substr(k, j)]++; } } } vector<string> ans(n); for (int i = 0; i < (n); ++i) { map<string, int> mm; for (int j = 1; j <= 8; j++) { for (int k = 0; k + j <= 9; k++) { mm[v[i].substr(k, j)]++; } } string anss = v[i]; int len = 9; for (auto it = mm.begin(); it != mm.end(); it++) { if (m[it->first] == it->second) { if ((int)(it->first).size() < len) { len = (int)(it->first).size(); anss = it->first; } } } ans[i] = anss; } for (int i = 0; i < (n); ++i) cout << ans[i] << n ; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tt = 1; while (tt--) solve(); } |
#include <bits/stdc++.h> const int MAXN = 2000 + 10; int n; char s[MAXN]; struct Bitset { static const int SIZE = 2048 / 64; unsigned long long a[SIZE]; int cnt; int high; Bitset() { memset(a, 0, sizeof a); cnt = 0; high = 0; } inline bool at(int x) { return (a[x >> 6] >> (x & 63)) & 1; } inline void setone(int x) { cnt += !at(x); high = std::max(high, x >> 6); a[x >> 6] |= (1ull << (x & 63)); } inline int count() const { return cnt; } void operator^=(const Bitset &rhs) { cnt = 0; high = std::max(high, rhs.high); for (int i = 0; i <= high; i++) { a[i] ^= rhs.a[i]; cnt += __builtin_popcountll(a[i]); } } }; Bitset a[MAXN], b[MAXN]; Bitset x; void insert(int cur) { Bitset ans; ans.setone(cur); for (register int j = 2000; j >= 0; j--) { if (!x.at(j)) continue; if (b[j].count() == 0) { puts( 0 ); std::swap(a[j], x); std::swap(b[j], ans); return; } ans ^= b[j]; x ^= a[j]; if (x.count() == 0) break; } printf( %d , ans.count() - 1); for (int i = 1; i < cur; i++) { if (ans.at(i)) { printf( %d , i - 1); } } printf( n ); } Bitset to_binary() { int n = strlen(s + 1); static int num[MAXN]; std::reverse(s + 1, s + n + 1); const int B = 8; int cnt = 1, p = 1; for (int i = 1; i <= n; i++) { num[cnt] += (s[i] - 0 ) * p; p *= 10; if (i % B == 0) { cnt++; p = 1; } } int cur = 0; Bitset ans; if (num[cnt] == 0) cnt--; n = cnt; while (n) { if (num[1] & 1) ans.setone(cur); cur++; int res = 0; for (int i = n; i >= 1; i--) { num[i] += res * 100000000; res = num[i] % 2; num[i] /= 2; } while (n > 0 && num[n] == 0) n--; } return ans; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); x = to_binary(); insert(i); } } |
#include <bits/stdc++.h> using namespace std; int N; string get_block(const string &str) { string res; if (str.length() < 4) res.append(4 - str.length(), 0 ); res.append(str); return res; } string process(const string &addr) { string res; int all = count(addr.begin(), addr.end(), : ); int i = 0, j = 0; int num = 0; while (j = addr.find( : , i + 1), j != (int)string::npos) { if (addr[i] == : && addr[j] == : ) { for (int k = 0; k < 8 - all + 1; k++) res.append( 0000: ); i++; } res.append(get_block(addr.substr(i, j - i)) + : ); num++; i = j + 1; } return string(res.begin(), res.end() - 1); } int main() { cin >> N; for (int t = 0; t < N; t++) { string addr; cin >> addr; if (addr == :: ) addr = 0000::0000 ; addr.push_back( : ); cout << process(addr) << endl; } return 0; } |
#include <bits/stdc++.h> int inp() { char c = getchar(); int neg = 1; while (c < 0 || c > 9 ) { if (c == - ) neg = -1; c = getchar(); } int sum = 0; while (c >= 0 && c <= 9 ) { sum = sum * 10 + c - 0 ; c = getchar(); } return sum * neg; } int idx = 0; struct SEG { int l; int r; int ls; int rs; int sum; int len; }; struct Node { int x; int y; int l; int id; } q[100010]; bool cmp(Node a, Node b) { return a.l < b.l; } int f[100010], w[100010], size[100010], top[100010], fa[100010], depth[100010], son[100010], dfn[100010], id[100010]; int head[100010], nxt[200010], end[200010], ans[100010], value[200010]; int cou = 0; void link(int a, int b, int v) { nxt[++cou] = head[a]; head[a] = cou; end[cou] = b; value[cou] = v; } bool cmp2(int a, int b) { return w[a] < w[b]; } SEG operator+(SEG a, SEG b) { if (a.l == -1) return b; if (b.l == -1) return a; SEG ret; ret.ls = a.ls; ret.l = a.l; ret.rs = b.rs; ret.r = b.r; ret.len = a.len + b.len; ret.sum = a.sum + b.sum; ret.sum -= f[a.rs]; ret.sum -= f[b.ls]; ret.sum += f[a.rs + b.ls]; if (ret.ls == a.len) ret.ls += b.ls; if (ret.rs == b.len) ret.rs += a.rs; return ret; } struct SEG_Tree { SEG t[400010]; void push_up(int cur) { t[cur] = t[((cur) << 1)] + t[((cur) << 1 | 1)]; } void build(int cur, int l, int r) { t[cur].l = l; t[cur].r = r; t[cur].len = r - l + 1; if (l == r) { t[cur].ls = t[cur].rs = 1; t[cur].sum = f[1]; return; } int mid = (l + r) >> 1; build(((cur) << 1), l, mid); build(((cur) << 1 | 1), mid + 1, r); push_up(cur); } void modify(int cur, int x) { if (t[cur].l == t[cur].r) { t[cur].sum = 0; t[cur].ls = t[cur].rs = 0; return; } if (x <= t[((cur) << 1)].r) modify(((cur) << 1), x); else modify(((cur) << 1 | 1), x); push_up(cur); } SEG query(int cur, int l, int r) { if (t[cur].l > r || t[cur].r < l) return (SEG){-1, -1, -1, -1, -1, -1}; if (t[cur].l >= l && t[cur].r <= r) { if (t[cur].l == 1) printf( Sukun AKIOI n ); return t[cur]; } return query(((cur) << 1), l, r) + query(((cur) << 1 | 1), l, r); } } t; void dfs1(int cur, int last) { fa[cur] = last; size[cur] = 1; depth[cur] = depth[last] + 1; for (int x = head[cur]; x != -1; x = nxt[x]) { if (end[x] != last) { w[end[x]] = value[x]; dfs1(end[x], cur); size[cur] += size[end[x]]; if (size[end[x]] > size[son[cur]]) son[cur] = end[x]; } } } void dfs2(int cur, int last, int t) { dfn[cur] = ++idx; top[cur] = t; if (son[cur]) dfs2(son[cur], cur, t); for (int x = head[cur]; x != -1; x = nxt[x]) if (end[x] != last && end[x] != son[cur]) dfs2(end[x], cur, end[x]); } int query(int cur, int x, int y) { bool t0 = false, t1 = true; std::vector<SEG> vec[2]; while (top[x] != top[y]) { if (depth[top[x]] < depth[top[y]]) { std::swap(x, y); std::swap(t0, t1); } vec[t0].push_back(t.query(1, dfn[top[x]], dfn[x])); x = fa[top[x]]; } if (depth[x] > depth[y]) { std::swap(x, y); std::swap(t0, t1); } SEG ans = (SEG){-1, -1, -1, -1, -1}; for (int i = 0; i < vec[0].size(); i++) { std::swap(vec[0][i].ls, vec[0][i].rs); ans = ans + vec[0][i]; } SEG mid = t.query(1, dfn[x] + 1, dfn[y]); if (t0) std::swap(mid.ls, mid.rs); ans = ans + mid; for (int i = vec[1].size() - 1; i >= 0; i--) { ans = ans + vec[1][i]; } return ans.sum; } int main() { memset(head, -1, sizeof(head)); int n = inp(); int m = inp(); for (int i = 1; i < n; i++) f[i] = inp(); for (int i = 1; i < n; i++) { int u = inp(); int v = inp(); int w = inp(); link(u, v, w); link(v, u, w); } dfs1(1, 0); dfs2(1, 0, 1); t.build(1, 1, n); for (int i = 1; i < n; i++) id[i] = i + 1; std::sort(id + 1, id + n, cmp2); for (int i = 1; i <= m; i++) { q[i].x = inp(); q[i].y = inp(); q[i].l = inp(); q[i].id = i; } std::sort(q + 1, q + m + 1, cmp); int cur = 1; for (int i = 1; i <= m; i++) { while (cur < n && w[id[cur]] < q[i].l) { t.modify(1, dfn[id[cur]]); cur++; } ans[q[i].id] = query(1, q[i].x, q[i].y); } for (int i = 1; i <= m; i++) printf( %d n , ans[i]); } |
#include <bits/stdc++.h> using namespace std; inline int read() { int ret = 0, f = 1; char ch = getchar(); while (ch > 9 || ch < 0 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { ret = (ret << 1) + (ret << 3) + ch - 0 ; ch = getchar(); } return ret * f; } int n, m, x, y, deg[25]; bool edge[25][25], vis[25]; int main() { n = read(); m = read(); for (register int i = 1; i <= m; i++) { x = read(); y = read(); if (x == y) continue; if (edge[x][y]) continue; deg[x]++; deg[y]++; edge[x][y] = 1; edge[y][x] = 1; } for (register int i = 1; i <= n; i++) { int st = i, j; memset(vis, 0, sizeof(vis)); vis[st] = 1; for (j = 1; j < n; j++) { int minn = 0, de = 0; for (register int k = 1; k <= n; k++) { if (edge[st][k] && !vis[k]) { if (de == 0 || minn > deg[k]) { de = k; minn = deg[k]; } } } if (de == 0) break; st = de; vis[st] = 1; } if (j == n) { printf( Yes n ); return 0; } } printf( No n ); return 0; } |
#include <bits/stdc++.h> using namespace std; long double jd[1100000], x[1100000], y[1100000]; long double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067982148086513282306647; int n, m; bool b; long double qq; void cty(int k, int l, int r, int o) { if (l > o || r < o) return; if (l == r) { if (b) jd[k] += qq; else x[k] += qq; return; } int m = (l + r) >> 1, e = k << 1; cty(e, l, m, o), cty(e ^ 1, m + 1, r, o); jd[k] = jd[e] + jd[e ^ 1]; x[k] = x[e] + x[e ^ 1] * cos(jd[e]) - y[e ^ 1] * sin(jd[e]); y[k] = y[e] + x[e ^ 1] * sin(jd[e]) + y[e ^ 1] * cos(jd[e]); } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) x[i + 524288] = 1.0; for (int i = 524287; i; i--) { int e = i << 1; jd[i] = jd[e] + jd[e ^ 1]; x[i] = x[e] + x[e ^ 1] * cos(jd[e]) - y[e ^ 1] * sin(jd[e]); y[i] = y[e] + x[e ^ 1] * sin(jd[e]) + y[e ^ 1] * cos(jd[e]); } while (m--) { int q, w, Z; long double z; scanf( %d%d%d , &q, &w, &Z); z = Z; qq = (q == 1) ? z : -z / 180.0 * pi; b = q - 1; if (b) w--; cty(1, 0, 524287, w); printf( %.20lf %.20lf n , (double)x[1], (double)y[1]); } return 0; } |
#include <bits/stdc++.h> using namespace std; unsigned long long a, b; int main() { cin >> a >> b; if ((a + b) % 2 == 0) cout << (a - b) / 2 << << (a + b) / 2 << endl; else cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100; int n, x[maxn], y[maxn], r; void write(int x) { if (x <= 50) printf( %d , x); else { printf( (50+ ); write(x - 50); printf( ) ); } } void work() { for (int i = 1; i < n; i++) printf( ( ); for (int i = 1; i <= n; i++) { if (i > 1) printf( + ); printf( ( ); write(x[i]); printf( *((1-abs((t- ); write(i - 1); printf( )))+abs((abs((t- ); write(i - 1); printf( ))-1)))) ); if (i > 1) printf( ) ); } printf( n ); } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d%d%d , x + i, y + i, &r); x[i] /= 2; y[i] /= 2; } work(); memcpy(x, y, sizeof(y)); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; long long C[2333][2333]; int d, MOD, p = 0; long long co[23333]; vector<int> operator-(vector<int> a, vector<int> b) { vector<int> s; int u = max(a.size(), b.size()); a.resize(u); b.resize(u); for (int i = 0; i < u; ++i) s.push_back((a[i] - b[i]) % MOD); return s; } long long qp(long long a, long long b) { long long x = 1; a %= MOD; while (b) { if (b & 1) x = x * a % MOD; a = a * a % MOD; b >>= 1; } return x; } int add(int a, int b) { ++p; cout << + << a << << b << << p << endl; co[p] = (co[a] + co[b]) % MOD; return p; } int po(int a) { ++p; cout << ^ << a << << p << endl; co[p] = qp(co[a], d); return p; } int mul(int a, int k) { k = (k % MOD + MOD) % MOD; if (!k) k += MOD; int s = a; --k; while (k) { if (k & 1) s = add(s, a); a = add(a, a); k >>= 1; } return s; } int neg(int a) { return mul(a, MOD - 1); } int minus_(int a, int b) { return add(a, neg(b)); } void op(int a) { cout << f << a << endl; cerr << co[a] << endl; } int l = 3, z; long long show(vector<int>& v, long long t) { long long x = 1, s = 0; for (int i = 0; i < v.size(); ++i) s += x * v[i] % MOD, s %= MOD, x = x * t % MOD; return (s % MOD + MOD) % MOD; } int p2(int a) { if (d == 2) return po(a); int n = d + 1; static vector<int> u[233], ss[233]; static int w[233], ww[233]; ww[0] = a; for (int i = 1; i <= n; ++i) { u[i].clear(); ss[i].clear(); for (int w = 0; w <= d; ++w) u[i].push_back(C[d][w] * qp(i, d - w) % MOD); ww[i] = add(ww[i - 1], l); w[i] = po(ww[i]); ss[i].resize(n + 1); ss[i][i] = 1; } for (int s = 0; s <= d; ++s) { long long x = u[s + 1][s] % MOD; if (!x) { for (int q = s + 2; q <= n; ++q) if (u[q][s] % MOD) { x = u[q][s] % MOD; for (int i = 1; i <= n; ++i) swap(ss[i][s + 1], ss[i][q]); swap(u[s + 1], u[q]); break; } } if (!x) throw GG ; long long rv = qp(x, MOD - 2); for (auto& w : u[s + 1]) w = w % MOD * rv % MOD; for (auto& w : ss[s + 1]) w = w % MOD * rv % MOD; for (int q = 1; q <= n; ++q) if (q != s + 1 && u[q][s] % MOD) { long long v = u[q][s] % MOD; for (int e = 1; e <= n; ++e) ss[q][e] = (ss[q][e] - ss[s + 1][e] * v) % MOD; for (int e = 0; e <= d; ++e) u[q][e] = (u[q][e] - u[s + 1][e] * v) % MOD; } } int aa = z; for (int i = 1; i <= n; ++i) if (ss[3][i]) aa = add(aa, mul(w[i], ss[3][i])); return aa; } int main() { cin >> d >> MOD; p = 4; for (int i = 0; i < 23333; ++i) co[i] = 1; for (int i = 0; i < 2333; ++i) { C[i][0] = 1; for (int j = 1; j <= i; ++j) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD; } co[1] = 5; co[2] = 3; z = minus_(l, l); op(mul(minus_(minus_(p2(add(1, 2)), p2(1)), p2(2)), (MOD + 1) / 2)); } |
#include <bits/stdc++.h> using namespace std; int n; double A[1010], B[1010]; double p[1010][1010]; double dis(int u) { return (B[u] + 1) / (1 - A[u]); } int mark[1010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { scanf( %lf , &p[i][j]); p[i][j] /= 100; } for (int i = 1; i <= n - 1; i++) A[i] = 1; A[n] = 0, B[n] = -1; for (int k = 1; k <= n; k++) { int u = -1; for (int i = 1; i <= n; i++) { if ((u == -1 || dis(i) < dis(u) && !mark[i])) u = i; } mark[u] = 1; for (int v = 1; v <= n; v++) { if (mark[v]) continue; B[v] += A[v] * p[v][u] * dis(u); A[v] *= (1 - p[v][u]); } } printf( %.10f n , dis(1)); return 0; } |
#include <bits/stdc++.h> using namespace std; void solve(const int &test_id) { int n, p, k; cin >> n >> p >> k; vector<pair<long long, int> > aud(n); for (int i = 0; i < n; i++) cin >> aud[i].first, aud[i].second = i; sort(aud.rbegin(), aud.rend()); vector<int> twos(p + 1); for (int i = 0; i < p + 1; i++) twos[i] = (1 << i); vector<vector<long long> > skill(n, vector<long long>(twos[p])); for (int i = 0; i < n; i++) for (int j = 0; j < p; j++) cin >> skill[i][j]; vector<vector<long long> > dp(n + 1, vector<long long>(twos[p])); for (int i = 1; i < n + 1; i++) { for (int j = 0; j < twos[p]; j++) { int curr_aud_count = i - 1 - __builtin_popcount(j); if (curr_aud_count < k && curr_aud_count > -1) dp[i][j] = max(dp[i][j], dp[i - 1][j] + aud[i - 1].first); else dp[i][j] = max(dp[i][j], dp[i - 1][j]); for (int k = 0; k < p; k++) if (j & twos[k]) dp[i][j] = max(dp[i][j], dp[i - 1][j ^ twos[k]] + skill[aud[i - 1].second][k]); } } cout << dp[n][twos[p] - 1] << endl; } void solve_cases() { int test_cases = 1; for (int i = 1; i <= test_cases; i++) solve(i); } void fast_io() { ios::sync_with_stdio(false); srand(time(NULL)); cin.tie(0); cout.tie(0); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } int main() { fast_io(); solve_cases(); return EXIT_SUCCESS; } |
#include <iostream> #include <cmath> #include <algorithm> #include <vector> #include <set> #include <unordered_set> #include <queue> #include <deque> #include <string> #include <sstream> #include <iomanip> #include <map> #include <unordered_map> #include <stack> #include <cstdio> #include <climits> #include <tuple> #include <ctime> #include <cstring> #include <numeric> #include <functional> #include <chrono> #include <cassert> #include <bitset> using namespace std; using ll = long long; const ll INF = 2e9; vector <vector<int>> gp; vector<int> vis; vector<int> dist; vector<int> v; string fibWord(int n) { string Sn_1 = 0 ; string Sn = 01 ; string tmp; for (int i = 2; i <= n; i++) { tmp = Sn; Sn += Sn_1; Sn_1 = tmp; } return Sn; } void solution() { int n; cin >> n; cout << 2 - n * n << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); //int T; cin >> T; //while (T--){ solution(); //} } |
#include <bits/stdc++.h> using namespace std; int maps[501][501]; char str[501]; int dx[11] = {-1, 0, 1, 0, -1, -1, 1, 1, -1, -1}; int dy[11] = {0, 1, 0, -1, 0, 1, 1, -1, -1, 1}; int dp[550][550][10]; int n, m; int pan(int x, int y) { if (x < 1 || x > n || y < 1 || y > m) return 1; if (maps[x][y]) return 1; return 0; } int main() { while (~scanf( %d%d , &n, &m)) { for (int i = 1; i <= n; i++) { scanf( %s , str); for (int j = 1; j <= m; j++) { if (str[j - 1] == 0 ) maps[i][j] = 0; else maps[i][j] = 1; } } int ans = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (maps[i][j]) continue; for (int q = 0; q < 9; q++) { dp[i][j][q] = 1; if (q == 4) continue; for (int k = 1;; k++) { int xx = i + dx[q] * k; int yy = j + dy[q] * k; if (pan(xx, yy)) break; dp[i][j][q]++; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (maps[i][j]) continue; for (int q = 0; q < 9; q++) { if (q == 4) continue; for (int k = 1;; k++) { int xx = i + dx[q] * k; int yy = j + dy[q] * k; if (pan(xx, yy) || pan(i + dx[q + 1] * k, j + dy[q + 1] * k)) { break; } if (q == 0 && dp[xx][yy][6] >= k + 1) ans++; if (q == 1 && dp[xx][yy][7] >= k + 1) ans++; if (q == 2 && dp[xx][yy][8] >= k + 1) ans++; if (q == 3 && dp[xx][yy][5] >= k + 1) ans++; if (q == 5 && dp[xx][yy][2] >= k * 2) ans++; if (q == 6 && dp[xx][yy][3] >= k * 2) ans++; if (q == 7 && dp[xx][yy][0] >= k * 2) ans++; if (q == 8 && dp[xx][yy][1] >= k * 2) ans++; } } } } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const char nl = n ; const int MAX_N = 100011; const long long INF = (1 << 29) + 123; const long long MOD = 998244353; const long double PI = 4 * atan((long double)1); template <typename T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template <typename T> bool ckmax(T& a, const T& b) { return b > a ? a = b, 1 : 0; } void dbg_out() { cerr << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ; dbg_out(T...); } template <typename T> class SafeVector : public vector<T> { public: using vector<T>::vector; typename vector<T>::reference operator[](size_t n) { return vector<T>::at(n); } typename vector<T>::const_reference operator[](size_t n) const { return vector<T>::at(n); } }; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MX = 2e5 + 5; long long a[MX][3]; vector<long long> x; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) for (int j = 0; j < 3; j++) cin >> a[i][j]; for (int i = 0; i < n; i++) x.push_back(a[i][0]); long long dp[n]; for (int i = 0; i < n; i++) dp[i] = 0; long long pref[n + 1]; for (int i = 0; i < n + 1; i++) pref[i] = 0; dp[0] = a[0][0] - a[0][1]; pref[1] = dp[0]; for (int i = 1; i <= n - 1; i++) { int idx = lower_bound(x.begin(), x.end(), a[i][1]) - x.begin(); dp[i] = ((pref[i] - pref[idx]) % MOD + MOD + a[i][0] - a[i][1]) % MOD; pref[i + 1] = (pref[i] + dp[i]) % MOD; } long long ans = 0; for (int i = 0; i < n; i++) ans = ((a[i][2] * dp[i]) % MOD + ans) % MOD; cout << (ans + x[n - 1] + 1) % MOD << nl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long n, k; cin >> n >> k; long long ar[n]; for (long long i = 0; i < n; i++) { cin >> ar[i]; } map<long long, long long> mp1, mp2; for (long long i = 0; i < n; i++) { mp2[ar[i]]++; } mp1[ar[0]]++; mp2[ar[0]]--; long long ans = 0; for (long long i = 1; i < n - 1; i++) { mp2[ar[i]]--; if (ar[i] % k == 0) ans += mp1[ar[i] / k] * mp2[ar[i] * k]; mp1[ar[i]]++; } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { char c = getchar(); int tot = 1; while ((c < 0 || c > 9 ) && c != - ) c = getchar(); if (c == - ) { tot = -1; c = getchar(); } int sum = 0; while (c >= 0 && c <= 9 ) { sum = sum * 10 + c - 0 ; c = getchar(); } return sum * tot; } inline void wr(int x) { if (x < 0) { putchar( - ); wr(-x); return; } if (x >= 10) wr(x / 10); putchar(x % 10 + 0 ); } inline void wrn(int x) { wr(x); putchar( n ); } inline void wri(int x) { wr(x); putchar( ); } int n, m, c; double ans; struct p { double x, y; double z; } z[200005]; inline double get_dis(p a, p b) { return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); } inline double check(p a) { return get_dis(a, z[0]) - get_dis(a, z[n + 1]); } bool cmp(p a, p b) { return a.z < b.z; } inline double get_ans(p x, p y) { double wx = z[0].x, wy = z[0].y; if (x.x == y.x) wx = 2 * x.x - wx; else { double k = 1.0 * (y.y - x.y) / (y.x - x.x), b = x.y - k * x.x, kk = -1.0 / k; double d = 2 * abs((z[0].x - x.x) * (z[0].y - y.y) - (z[0].y - x.y) * (z[0].x - y.x)) / sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y)); double tx = d / sqrt(kk * kk + 1), ty = tx * kk; if ((k * wx + b > wy) ^ (k * (wx + tx) + b > (wy + ty))) wx = wx + tx, wy = wy + ty; else wx = wx - tx, wy = wy - ty; } return sqrt((z[n + 1].x - wx) * (z[n + 1].x - wx) + (z[n + 1].y - wy) * (z[n + 1].y - wy)); } signed main() { n = read(); c = read(); z[0].x = c; z[0].y = 0; for (int i = 1; i <= n; i++) { z[i].x = read(); z[i].y = read(); z[i].z = fabs(sqrt(((z[i].x - c) * (z[i].x - c)) + ((z[i].y) * (z[i].y))) - sqrt(((z[i].x + c) * (z[i].x + c)) + ((z[i].y) * (z[i].y)))); } sort(z + 1, z + 1 + n, cmp); n = min(n, 850); z[n + 1].x = -c; z[n + 1].y = 0; ans = c * 2; for (int i = 1; i < n; i++) { if (fabs(check(z[i])) > ans) continue; for (int j = i + 1; j <= n; j++) { if (fabs(check(z[j])) > ans) continue; ans = min(ans, get_ans(z[i], z[j])); } } printf( %.10lf , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long N, f[3001][3001]; struct Node { long long x, val; } P[3001]; inline bool cmp(const Node &a, const Node &b) { return a.x < b.x; } int main() { scanf( %I64d , &N); for (long long i = 1; i <= N; i++) scanf( %I64d%I64d , &P[i].x, &P[i].val); sort(P + 1, P + N + 1, cmp); memset(f, 0x7f, sizeof(f)); f[1][1] = P[1].val; for (long long i = 2; i <= N; i++) for (long long j = 1; j <= i; j++) { f[i][j] = min(f[i][j], f[i - 1][j] + P[i].x - P[j].x); f[i][i] = min(f[i][i], f[i - 1][j] + P[i].val); } long long ans = (unsigned)(-1) >> 1; for (long long i = 1; i <= N; i++) ans = min(ans, f[N][i]); printf( %I64d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int ax[4], ay[4], bx[4], by[4]; int xmin = 1000, xmax = -1000, ymin = 1000, ymax = -1000; bool f() { for (int i = 0; i < 4; i++) { if (bx[i] >= xmin && bx[i] <= xmax && by[i] >= ymin && by[i] <= ymax) { return 1; } } double X = ((double)bx[0] + (double)bx[3]) / 2, Y = ((double)by[0] + (double)by[3]) / 2; if (X >= xmin && X <= xmax && Y >= ymin && Y <= ymax) { return 1; } return 0; } void rotat() { int X, Y; xmin = ymin = 1000; xmax = ymax = -1000; for (int i = 0; i < 4; i++) { X = ax[i] + ay[i]; Y = ax[i] - ay[i]; ax[i] = X; ay[i] = Y; X = bx[i] + by[i]; Y = bx[i] - by[i]; bx[i] = X; by[i] = Y; swap(ax[i], bx[i]); swap(by[i], ay[i]); xmin = min(xmin, ax[i]); xmax = max(xmax, ax[i]); ymin = min(ymin, ay[i]); ymax = max(ymax, ay[i]); } } int main() { for (int i = 0; i < 4; i++) { cin >> ax[i] >> ay[i]; xmin = min(xmin, ax[i]); xmax = max(xmax, ax[i]); ymin = min(ymin, ay[i]); ymax = max(ymax, ay[i]); } for (int i = 0; i < 4; i++) { cin >> bx[i] >> by[i]; } if (f()) { cout << Yes n ; return 0; } rotat(); if (f()) { cout << Yes n ; return 0; } cout << No n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int N, M; cin >> N >> M; vector<int> ceff(N * 2); for (int i = 0; i < N; ++i) { cin >> ceff[i * 2]; } cin >> ceff[N * 2 - 1]; for (int i = 1; i < N; ++i) { cin >> ceff[i * 2 - 1]; } double cur = M; for (int i = N * 2 - 1; i >= 0; --i) { if (ceff[i] == 1) { cout << -1 << endl; return 0; } cur = cur / (ceff[i] - 1) + cur; } cout << setprecision(10) << fixed; cout << cur - M << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf(1010101010); struct uf { int par[5005], rank[5005]; int ff(int x) { return par[x] == x ? x : par[x] = ff(par[x]); } void uu(int x, int y) { x = ff(x), y = ff(y); if (x == y) return; if (rank[x] > rank[y]) par[y] = x; else if (rank[x] < rank[y]) par[x] = y; else rank[x]++, par[y] = x; } uf(int n) { for (int i(0); i < (n); i++) par[i] = i, rank[i] = 0; } }; int n, m, k; int wt[100005]; pair<int, int> e[100005]; int perm[100005]; struct mycmp { bool operator()(int i, int j) const { return wt[i] < wt[j]; } }; void kruskal_met_0(vector<int>& ret) { uf G(n); for (int i(0); i < (m); i++) { int eid(perm[i]), x(e[eid].first), y(e[eid].second); if (x == 0 || y == 0) { ret.push_back(eid); G.uu(x, y); } } for (int i(0); i < (m); i++) { int eid(perm[i]), x(e[eid].first), y(e[eid].second), xr(G.ff(x)), yr(G.ff(y)); if (xr - yr) { ret.push_back(eid); G.uu(x, y); } } for (int i(0); i < (n); i++) if (G.ff(i) != G.ff(0)) { puts( -1 ); exit(0); } } void kruskal_wo_0(vector<int>& ret) { uf G(n); for (int i(0); i < (m); i++) { int eid(perm[i]), x(e[eid].first), y(e[eid].second), xr(G.ff(x)), yr(G.ff(y)); if (x == 0 || y == 0) continue; if (xr - yr) { ret.push_back(eid); G.uu(x, y); } } } int koppel[5005]; int main() { cin >> n >> m >> k; int deg0(0); for (int i(0); i < (m); i++) { int x, y, w; cin >> x >> y >> w; x--, y--; wt[i] = w; e[i].first = x, e[i].second = y; if (x == 0 || y == 0) deg0++; } if (deg0 < k) { puts( -1 ); exit(0); } for (int i(0); i < (m); i++) perm[i] = i; sort(perm, perm + m, mycmp()); vector<int> mst_met, mst_wo; kruskal_met_0(mst_met); kruskal_wo_0(mst_wo); uf G(n); for (int i(0); i < (n); i++) koppel[i] = inf; vector<int> doen; for (__typeof((mst_met).end()) it((mst_met).begin()); it != (mst_met).end(); ++it) { int eid(*it), x(e[eid].first), y(e[eid].second), xr(G.ff(x)), yr(G.ff(y)); if (x == 0) koppel[yr] = wt[eid]; else if (y == 0) koppel[xr] = wt[eid]; else { int mi(min(koppel[xr], koppel[yr])); koppel[xr] = koppel[yr] = mi; G.uu(x, y); doen.push_back(eid); } } for (int iteratie(0); iteratie < (deg0 - k); iteratie++) { pair<int, int> opt(inf, 0); for (__typeof((mst_wo).end()) it((mst_wo).begin()); it != (mst_wo).end(); ++it) { int eid(*it), x(e[eid].first), y(e[eid].second), xr(G.ff(x)), yr(G.ff(y)); if (xr == yr) continue; opt = min(opt, make_pair(wt[eid] - max(koppel[xr], koppel[yr]), eid)); } if (opt.first == inf) { puts( -1 ); return 0; } int eid(opt.second), x(e[eid].first), y(e[eid].second), xr(G.ff(x)), yr(G.ff(y)); int mik(min(koppel[xr], koppel[yr])); koppel[xr] = koppel[yr] = mik; G.uu(x, y); doen.push_back(eid); } uf T(n); for (__typeof((doen).end()) it((doen).begin()); it != (doen).end(); ++it) { int eid(*it), x(e[eid].first), y(e[eid].second); assert(T.ff(x) != T.ff(y)); T.uu(x, y); } if (((int)(doen).size()) != n - 1 - k) { puts( -1 ); return 0; } for (int i(0); i < (m); i++) { int eid(perm[i]), x(e[eid].first), y(e[eid].second), xr(T.ff(x)), yr(T.ff(y)); if (x == 0 || y == 0) { if (xr - yr) { doen.push_back(eid); T.uu(x, y); } } } cout << ((int)(doen).size()) << endl; int som(0); for (__typeof((doen).end()) it((doen).begin()); it != (doen).end(); ++it) { cout << (*it + 1) << ; som += wt[*it]; } cout << endl; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; const int ZERO = 2e5 + 5000; int n, w, h; struct node { int id, x, t; node() {} node(int _id, int _x, int _t) : id(_id), x(_x), t(_t) {} bool operator<(const node &a) const { return x < a.x; } } X[MAXN]; vector<node> Y[MAXN * 4]; int cnt[MAXN * 4]; pair<int, int> ans[MAXN]; int main() { scanf( %d%d%d , &n, &w, &h); int tot = 0; for (int i = 1; i <= n; i++) { int g, p, t; scanf( %d%d%d , &g, &p, &t); if (g == 1) { X[++tot] = node(i, p, t); } else { Y[p - t + ZERO].push_back(node(i, p, t)); } } sort(X + 1, X + 1 + tot); for (int i = 0; i < 4 * MAXN; i++) { sort(Y[i].begin(), Y[i].end()); } for (int i = 1; i <= tot; i++) { int pos = X[i].x - X[i].t + ZERO; int sz = Y[pos].size(); if (sz) { int en = ((sz - cnt[pos] - 1) % sz + sz) % sz; swap(Y[pos][en].id, X[i].id); cnt[pos]++; } ans[X[i].id] = make_pair(X[i].x, h); } for (int i = 0; i < 4 * MAXN; i++) { int sz = Y[i].size(); for (int j = 0; j < sz; j++) { int pos = (((sz - cnt[i] - 1) % sz + sz) % sz + j + 1) % sz; ans[Y[i][pos].id] = make_pair(w, Y[i][j].x); } } for (int i = 1; i <= n; i++) { printf( %d %d n , ans[i].first, ans[i].second); } return 0; } |
#include <bits/stdc++.h> using namespace std; char ans[1000005], tmp[1000005]; int wa; int n, x; void go(int x, int y) { int len = 0; while (x != y) { if (x < y) { y -= x; tmp[len++] = B ; } else { x -= y; tmp[len++] = T ; } if (len >= n) return; } tmp[len++] = T ; int w = 0; if (x > 1 || len != n) return; for (int i = 0; i + 1 < len; i++) if (tmp[i] == tmp[i + 1]) w++; if (wa > w) { wa = w; for (int i = 0; i < n; i++) ans[i] = tmp[i]; } } int main() { while (scanf( %d%d , &n, &x) == 2) { wa = 10000000; for (int i = 1; i <= x; i++) { go(i, x); go(x, i); } if (wa == 10000000) puts( IMPOSSIBLE ); else { reverse(ans, ans + n); printf( %d n , wa); for (int i = 0; i < n; i++) putchar(ans[i]); puts( ); } } return 0; } |
#include <bits/stdc++.h> const int N = 5e5 + 10, M = 1e7 + 10; const long long mod = 1e9 + 7; using namespace std; map<pair<int, int>, set<int>> mp; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int x[N], y[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) scanf( %d%d , &x[i], &y[i]); long long cnt = 0, res = 0; for (int i = 1; i < n; i++) { for (int j = i + 1; j <= n; j++) { int a = y[i] - y[j], b = x[i] - x[j]; int c = y[i] * x[j] - y[j] * x[i]; int g = gcd(a, b); a /= g; b /= g; c /= g; if (a < 0 || (a == 0 && b < 0)) a = -a, b = -b; pair<int, int> p = make_pair(a, b); if (mp[p].find(c) == mp[p].end()) { cnt++; mp[p].insert(c); res += cnt - mp[p].size(); } } } cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int aa[105][105]; pair<int, int> pos[105][105]; int main() { int n, m, q; scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { pos[i][j] = {i, j}; aa[i][j] = INT_MAX; } } for (int l = 1; l <= q; ++l) { int a; scanf( %d , &a); if (a == 3) { int r, c, x; scanf( %d %d %d , &r, &c, &x); aa[pos[r][c].first][pos[r][c].second] = x; } else { int x; scanf( %d , &x); if (a == 1) { pair<int, int> temp = pos[x][1]; for (int i = 1; i <= m; ++i) { pos[x][i] = pos[x][i + 1]; } pos[x][m] = temp; } else { pair<int, int> temp = pos[1][x]; for (int i = 1; i <= n; ++i) { pos[i][x] = pos[i + 1][x]; } pos[n][x] = temp; } } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (aa[i][j] == INT_MAX) { printf( 1 ); } else { printf( %d , aa[i][j]); } } printf( n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int n; cin >> n; int A[12]; int B[12]; for (int i = 0; i < 10; i++) A[i] = true; for (int i = 0; i < 10; i++) B[i] = false; for (int i = 0; i < n; i++) { char x; int c; cin >> x >> c; for (int j = 0; j < 10; j++) { if (x == & ) { A[j] &= (c % 2); B[j] &= (c % 2); } if (x == | ) { A[j] |= (c % 2); B[j] |= (c % 2); } if (x == ^ ) { A[j] ^= (c % 2); B[j] ^= (c % 2); } c /= 2; } } int AAA = 0; int BBB = 0; for (int i = 0; i < 10; i++) { int a_ = 0, b_ = 0; for (int a = 0; a < 2; a++) { for (int b = 0; b < 2; b++) { int AA = (((true | a) ^ b)); int BB = (((false | a) ^ b)); if (AA == A[i] && BB == B[i]) { a_ = a; b_ = b; } } } AAA += a_ * (1ll << i); BBB += b_ * (1ll << i); } cout << 2 << n ; cout << | << AAA << n ; cout << ^ << BBB << n ; } |
#include <bits/stdc++.h> using namespace std; const int mxN = 500, M = 1e9 + 7; int n, a[mxN]; long long dp[mxN][mxN]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; ++i) cin >> a[i], --a[i]; dp[0][0] = 1; for (int i = 1; i < n; ++i) dp[i][i] = dp[i - 1][i] = 1; for (int i = n - 1; ~i; --i) { for (int j = i + 2; j < n; ++j) { dp[i][j] = dp[i + 1][j]; for (int k = i + 1; k < j; ++k) if (a[k + 1] > a[i + 1]) dp[i][j] = (dp[i][j] + dp[i + 1][k] * dp[k][j]) % M; } } cout << dp[0][n - 1]; return 0; } |
#include <bits/stdc++.h> using namespace std; constexpr int inf = 1e9; int main() { int n, m; cin >> n >> m; vector<int> d(m), h(m); for (int i = 0; i < m; ++i) { cin >> d[i] >> h[i]; } int ans = max(h[0] + d[0] - 1, h.back() + (n - d.back())); for (int i = 0; i + 1 < m; ++i) { if (abs(h[i] - h[i + 1]) > d[i + 1] - d[i]) { ans = -1; break; } ans = max(ans, (d[i + 1] - d[i] - abs(h[i] - h[i + 1])) / 2 + max(h[i], h[i + 1])); } if (ans == -1) { cout << IMPOSSIBLE << endl; } else { cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int mod = 1e9 + 7; void show2d(const vector<vector<int>>& adj) { for (auto x : adj) { for (auto y : x) { cout << y << ; } cout << n ; } } long long int modexp(long long int a, long long int b, long long int mod) { long long int x = 1; while (b) { if (b & 1) x = ((x % mod) * (a % mod)) % mod; a = ((a % mod) * (a % mod)) % mod; b = b / 2; } return x; } void rf() {} int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k; cin >> n >> m >> k; int o = 0; int tt = 0; for (int i = 0; i < n; ++i) { int ch; cin >> ch; if (ch == 1) ++o; else ++tt; } tt = max(tt - k, 0); cout << max((o + tt) - m, 0) << n ; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void print(T a) { for (auto i = a.begin(); i != a.end(); i++) cout << *i << ; cout << endl; } bool isVowel(char c) { if (c == a || c == e || c == i || c == o || c == u ) return true; return false; } void sync() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } vector<long long int> G[1000000]; map<long long int, bool> ck; bool dfs(long long int a, long long int b) { if (a == b) return true; ck[a] = true; for (long long int j : G[a]) { if (ck[j] == true) continue; bool d = dfs(j, b); if (d == true) return true; } return false; } int main() { sync(); long long int t; cin >> t; long long int j = 0; vector<pair<long long int, long long int> > edges; for (long long int testcase = 1; testcase <= t; testcase++) { long long int a, b, c; cin >> a >> b >> c; if (a == 2) { b--, c--; ck.clear(); bool d = dfs(b, c); if (d == true) cout << YES << endl; else cout << NO << endl; } else { edges.push_back({b, c}); if (j == 0) { } else { for (long long int i = 0; i < j; i++) { long long int x1 = edges[i].first; long long int y1 = edges[i].second; if ((x1 > b && x1 < c) || (y1 > b && y1 < c)) { G[i].push_back(j); } if ((b > x1 && b < y1) || (c > x1 && c < y1)) { G[j].push_back(i); } } } j++; } } } |
#include <bits/stdc++.h> using namespace std; const int N = 10000; const int M = 1000000; const int inf = 1e9; struct Edge { int v, w, cost, next; } g[M]; int head[N], st, ed, flow, cost, cnt; void init() { memset(head, -1, sizeof(head)); flow = cost = cnt = 0; } void addEdge(int u, int v, int w, int cost) { g[cnt].v = v, g[cnt].w = w, g[cnt].cost = cost, g[cnt].next = head[u], head[u] = cnt++; g[cnt].v = u, g[cnt].w = 0, g[cnt].cost = -cost, g[cnt].next = head[v], head[v] = cnt++; } bool spfaFlow(int n) { vector<int> dis(n + 1, inf); vector<bool> vis(n + 1, false); vector<int> path(n + 1, -1); dis[st] = 0; vis[st] = true; queue<int> q; q.push(st); while (!q.empty()) { int u = q.front(); q.pop(); vis[u] = false; for (int i = head[u]; ~i; i = g[i].next) { int v = g[i].v; if (g[i].w && dis[v] > dis[u] + g[i].cost) { dis[v] = dis[u] + g[i].cost; path[v] = i; if (!vis[v]) { vis[v] = true; q.push(v); } } } } int mxflow = inf; if (path[ed] != -1) { for (int u = ed; u != st; u = g[path[u] ^ 1].v) { mxflow = min(mxflow, g[path[u]].w); } flow += mxflow; for (int u = ed; u != st; u = g[path[u] ^ 1].v) { g[path[u]].w -= mxflow; g[path[u] ^ 1].w += mxflow; cost += mxflow * g[path[u]].cost; } } return path[ed] != -1; } int minCost(int n) { while (spfaFlow(n)) ; return cost; } int main(int argc, char *argv[]) { int n; cin >> n; string s; cin >> s; vector<int> b(n + 1); for (int i = 1; i <= n; i++) { cin >> b[i]; } int N = 26 + n * 26 + (n / 2) * 26 + (n / 2); st = N + 1, ed = N + 2; init(); vector<int> cnt(255); for (auto c : s) { cnt[c]++; } int Z = n * 26 + (n / 2) * 27; for (int i = a ; i <= z ; i++) { addEdge(st, Z + i - a + 1, cnt[i], 0); for (int j = 1; j <= n; j++) { addEdge(Z + i - a + 1, (i - a ) * n + j, 1, i == s[j - 1] ? -b[j] : 0); } } for (int i = 0; i < 26; i++) { for (int j = 1; j <= n / 2; j++) { int ux = i * n + j, uy = i * n + n + 1 - j; addEdge(ux, n * 26 + (n / 2) * i + j, 1, 0); addEdge(uy, n * 26 + (n / 2) * i + j, 1, 0); addEdge(n * 26 + (n / 2) * i + j, n * 26 + (n / 2) * 26 + j, 1, 0); } } for (int j = 1; j <= n / 2; j++) { addEdge(n * 26 + (n / 2) * 26 + j, ed, 2, 0); } cout << -minCost(N + 2) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long double pi = 3.141592653589793238; set<long long>::iterator it; multiset<long long>::iterator itr; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long t; t = 1; while (t--) { long long n; cin >> n; long long m, a, b; cin >> m >> a >> b; long long r = n % m; cout << min(b * (r), a * (m - r)) << endl; } } |
#include <bits/stdc++.h> using ll = long long; using namespace std; const int MOD = 1e9 + 7; map<int, vector<int>> nodecolor; map<int, vector<int>> tree; void dfs(vector<int>& vis, int node, vector<int>& color) { int blue = 0, c = 0, red = 0; if (color[node - 1] == 0) { c += 1; } if (color[node - 1] == 1) { red += 1; } if (color[node - 1] == 2) { blue += 1; } for (auto x : tree[node]) { if (vis[x] == 0) { vis[x] = 1; dfs(vis, x, color); blue += nodecolor[x][0]; red += nodecolor[x][1]; c += nodecolor[x][2]; } } nodecolor[node] = {blue, red, c}; } int dfs2(vector<int>& vis, int node, int b, int r, int c, int ans) { int b1 = 0, r1 = 0, b2 = 0, r2 = 0; for (auto x : tree[node]) { if (vis[x] == 0) { vis[x] = 1; b1 = b - (nodecolor[x][0]); b2 = nodecolor[x][0]; r1 = r - (nodecolor[x][1]); r2 = nodecolor[x][1]; if ((b1 == 0 || r1 == 0) && (b2 == 0 || r2 == 0)) { ans += 1; } ans += dfs2(vis, x, b, r, c, 0); } } return ans; } int main(int argc, const char* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, u, v; cin >> n; vector<int> color(n); int b = 0, r = 0, c = 0; for (int i = 0; i < n; i++) { cin >> color[i]; b += (color[i] == 2); c += (color[i] == 0); r += (color[i] == 1); } for (int i = 0; i < n - 1; i++) { cin >> u >> v; tree[u].push_back(v); tree[v].push_back(u); } int ans = 0; vector<int> vis(n + 1, 0); vis[1] = 1; dfs(vis, 1, color); for (int i = 0; i < n + 1; i++) { vis[i] = 0; } vis[1] = 1; ans = dfs2(vis, 1, b, r, c, 0); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; inline long long in() { int32_t x; scanf( %d , &x); return x; } const long long maxn = 1e6 + 10; const long long mod = 1e9 + 7; const long long inf = 1e9 + 10; long long dp[maxn]; long long ans[maxn]; int32_t main() { dp[1] = 1; for (long long i = 2; i < maxn; i++) dp[i] = dp[i / 2] * 2; long long n = in(); if (n & 1) { cout << NO n ; } else { long long nn = n; while (n) { long long maxPower = dp[n]; for (long long x = 1; x <= n - maxPower + 1; x++) ans[maxPower - x] = maxPower + x - 1, ans[maxPower + x - 1] = maxPower - x; n = 2 * maxPower - n - 2; } cout << YES n ; for (long long i = 1; i <= nn; i++) cout << ans[i] << ; cout << n ; n = nn; } if (n <= 7) { bool ok = false; long long arr[7]; for (long long i = 0; i < n; i++) arr[i] = i + 1; do { bool fl = true; for (long long i = 0; i < n; i++) { if ((arr[i] & (i + 1)) && arr[i] != i + 1) continue; fl = false; } if (fl) { ok = true; break; } } while (next_permutation(arr, arr + n)); if (ok) { cout << YES n ; for (long long i = 0; i < n; i++) cout << arr[i] << ; } else cout << NO n ; } else { if (__builtin_popcountll(n) == 1) cout << NO n ; else { cout << YES n ; long long arr[7]; for (long long i = 0; i < 7; i++) arr[i] = i + 1; do { bool fl = true; for (long long i = 0; i < 7; i++) { if ((arr[i] & (i + 1)) && arr[i] != i + 1) continue; fl = false; } if (fl) break; } while (next_permutation(arr, arr + 7)); for (long long i = 0; i < 7; i++) cout << arr[i] << ; for (long long i = 8; i <= n; i *= 2) { long long lim = min(2 * i - 1, n); for (long long x = i; x <= lim; x++) { if (x == i) cout << lim << ; else cout << x - 1 << ; } } } } } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, t, ans = 0, i, a, b, m, x, y; cin >> t; while (t > 0) { cin >> n; vector<int> res; long long es = 0, os = 0; if ((n / 2) % 2 == 0) { cout << YES << endl; for (i = 0; i < n / 2; i++) { res.push_back(2 * (i + 1)); es += 2 * (i + 1); } for (i = 0; i < n / 2; i++) { res.push_back(2 * (i + 1) - 1); os += 2 * (i + 1) - 1; } res[n - 1] += es - os; for (i = 0; i < n; i++) cout << res[i] << ; cout << endl; } else cout << NO << endl; t--; } } |
#include <bits/stdc++.h> const int INF = 0x3f3f3f3f; const int kN = 100 + 5; const int MOD = (int)1e9 + 7; int n, limit; int graph[kN][kN]; std::vector<int> edges[kN]; int dp[kN][kN]; void dfs(int u, int fa) { for (int w = 0; w < n; ++w) if (graph[u][w] <= limit) dp[u][w] = 1; for (int v : edges[u]) { if (fa == v) continue; dfs(v, u); } for (int w = 0; w < n; ++w) { if (dp[u][w] == 0) continue; for (int v : edges[u]) { int slot = 0; if (v == fa) continue; for (int r = 0; r < n; ++r) { if (dp[v][r] == 0) continue; if (graph[u][r] < graph[u][w] || graph[u][r] == graph[u][w] && r < w) continue; if (graph[v][w] < graph[v][r] || graph[v][w] == graph[v][r] && w < r) continue; slot += dp[v][r]; if (slot >= MOD) slot -= MOD; } dp[u][w] = dp[u][w] * 1ll * slot % MOD; } } } int main() { scanf( %d%d , &n, &limit); for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) graph[i][j] = i == j ? 0 : INF; for (int i = 0; i < n - 1; ++i) { int a, b; scanf( %d%d , &a, &b); a--; b--; edges[a].emplace_back(b); edges[b].emplace_back(a); graph[a][b] = graph[b][a] = 1; } for (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) graph[i][j] = std::min(graph[i][j], graph[i][k] + graph[k][j]); dfs(0, -1); int result = 0; for (int v = 0; v < n; ++v) { result = (result + dp[0][v]) % MOD; } printf( %d n , result); } |
#include <bits/stdc++.h> using namespace std; const int N = 1001; int a[N][N], LR[N][N], RR[N][N], LC[N][N], RC[N][N]; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) { vector<int> v; for (int j = 1; j <= m; ++j) { cin >> a[i][j]; v.push_back(a[i][j]); } sort(v.begin(), v.end()); auto last = unique(v.begin(), v.end()); v.erase(last, v.end()); for (int j = 1; j <= m; ++j) { int l = 0, r = (int)v.size() - 1; while (l <= r) { int m = (l + r) / 2; if (v[m] >= a[i][j]) { if (v[m] == a[i][j]) { LR[i][j] = m; RR[i][j] = (int)v.size() - 1 - m; } r = m - 1; } else { l = m + 1; } } } } for (int i = 1; i <= m; ++i) { set<int> s; vector<int> v; for (int j = 1; j <= n; ++j) { v.push_back(a[j][i]); } sort(v.begin(), v.end()); auto last = unique(v.begin(), v.end()); v.erase(last, v.end()); for (int j = 1; j <= n; ++j) { int l = 0, r = (int)v.size() - 1; while (l <= r) { int m = (l + r) / 2; if (v[m] >= a[j][i]) { if (v[m] == a[j][i]) { LC[j][i] = m; RC[j][i] = (int)v.size() - 1 - m; } r = m - 1; } else { l = m + 1; } } } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cout << max(LC[i][j], LR[i][j]) + 1 + max(RC[i][j], RR[i][j]) << ; } cout << endl; } } |
#include <bits/stdc++.h> using namespace std; namespace fast_IO { inline int read_int() { register int ret = 0, f = 1; register char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { ret = (ret << 1) + (ret << 3) + int(c - 48); c = getchar(); } return ret * f; } } // namespace fast_IO using namespace fast_IO; int N, Q; int a[200005]; char s[200005]; struct BIT { int c[200005]; inline int lowbit(int x) { return x & (-x); } inline void add(int pos, int w) { while (pos <= N) c[pos] += w, pos += lowbit(pos); } inline int query(int pos) { int res = 0; while (pos) res += c[pos], pos -= lowbit(pos); return res; } } BIT[3]; set<int> S[3]; inline int decode(char c) { if (c == R ) return 0; if (c == P ) return 1; if (c == S ) return 2; } inline void init() { N = read_int(), Q = read_int(); scanf( %s , s + 1); for (register int i = 0; i < 3; i++) S[i].insert(-0x3f3f3f3f), S[i].insert(0x3f3f3f3f); for (register int i = 1; i <= N; i++) { a[i] = decode(s[i]); BIT[a[i]].add(i, 1); S[a[i]].insert(i); } } inline int calc() { if (S[0].size() == N + 2 || S[1].size() == N + 2 || S[2].size() == N + 2) return N; if (S[0].size() == 2) return S[2].size() - 2; if (S[1].size() == 2) return S[0].size() - 2; if (S[2].size() == 2) return S[1].size() - 2; set<int>::iterator it_min[3], it_max[3]; for (register int i = 0; i < 3; i++) it_min[i] = S[i].begin(), it_min[i]++; for (register int i = 0; i < 3; i++) it_max[i] = S[i].end(), it_max[i]--, it_max[i]--; int ans = N; for (register int i = 0; i < 3; i++) { int l1 = (i + 1) % 3, r1 = (i + 2) % 3; int L = *it_min[l1], R = *it_min[r1] - 1; ans -= max(0, BIT[i].query(R) - BIT[i].query(L - 1)); L = *it_max[r1], R = *it_max[l1]; ans -= max(0, BIT[i].query(R) - BIT[i].query(L - 1)); } return ans; } inline void ans() { printf( %d n , calc()); register int pos, nw; static char opt[20]; while (Q--) { pos = read_int(); scanf( %s , opt); nw = decode(opt[0]); S[a[pos]].erase(pos); BIT[a[pos]].add(pos, -1); a[pos] = nw, S[a[pos]].insert(pos), BIT[a[pos]].add(pos, 1); printf( %d n , calc()); } } int main() { init(); ans(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxx = 500 + 7; const int maxn = 100 + 7; const long long mod = 1E9 + 7; const int maxs = 2 * (1E7) + 5; const int maxm = 100 + 3; const long long maxk = 1e13; long double dp[maxn][maxn]; int last[1000]; char seq[maxn]; long long n, k; void init() { cin >> n >> k; cin >> seq; memset(last, -1, sizeof(last)); } void solve() { dp[0][0] = 1; for (int i = 1; i <= n; i++) { for (int j = 0; j <= i; j++) { if (!j) { dp[i][j] = 1; continue; } dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]; if (last[seq[i - 1]] != -1) dp[i][j] -= dp[last[seq[i - 1]]][j - 1]; } last[seq[i - 1]] = i - 1; } long long cost = 0; long double kk = k; for (long long i = n; i >= 0; i--) { long double tt = min(kk, dp[n][i]); cost += tt * (n - i); kk -= min(tt, kk); } if (kk > 0) cout << -1 << endl; else cout << (long long)cost << endl; } int main(void) { init(); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T& x) { static char c; static int f; for (c = getchar(), f = 1; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -f; for (x = 0; c >= 0 && c <= 9 ; c = getchar()) x = x * 10 + (c & 15); x *= f; } template <typename T> void write(T x) { static char q[65]; int cnt = 0; if (x < 0) putchar( - ), x = -x; q[++cnt] = x % 10, x /= 10; while (x) q[++cnt] = x % 10, x /= 10; while (cnt) putchar(q[cnt--] + 0 ); } const int mod = 1000000007, maxn = 1000005; int mo(const int x) { return x >= mod ? x - mod : x; } int iac[maxn], fac[maxn], _n[maxn], _m[maxn]; int main() { int n, m, a, b; read(n), read(m), read(a), read(b); int mx = max(n, m); iac[0] = iac[1] = fac[0] = fac[1] = _n[1] = _m[0] = 1; _m[1] = m; for (int i = 2; i <= mx; ++i) iac[i] = 1ll * (mod - mod / i) * iac[mod % i] % mod; _n[0] = iac[n]; for (int i = 2; i <= mx; ++i) iac[i] = 1ll * iac[i - 1] * iac[i] % mod, fac[i] = 1ll * fac[i - 1] * i % mod, _m[i] = 1ll * _m[i - 1] * m % mod, _n[i] = 1ll * _n[i - 1] * n % mod; int ans = 0; for (int i = 1; i <= n - 1 && i <= m; ++i) ans = mo(ans + 1ll * (i + 1) * _n[n - 1 - i] % mod * _m[n - 1 - i] % mod * iac[n - 1 - i] % mod * iac[m - i] % mod * iac[i - 1] % mod); ans = 1ll * ans * fac[n - 2] % mod * fac[m - 1] % mod; write(ans), putchar( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; int Set(int N, int pos) { return N = N | (1 << pos); } int reset(int N, int pos) { return N = N & ~(1 << pos); } bool check(int N, int pos) { return (bool)(N & (1 << pos)); } string st, st2, st3, st4, ans; int main() { ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); int i, j, a, b, n, m, x, y, ck, t, r, rem, cnt, lo, hi, sum, cs = 1; cin >> n >> m; cin >> st; a = b = m / 2; for (i = 0; i < n; i++) { if (st[i] == ( && a > 0) ans += ( , a--; if (st[i] == ) && b > 0) ans += ) , b--; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { string s; cin >> s; int ans = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == R ) { ans = i + 1; break; } } if (ans == -1) { cout << s.size() + 1 << endl; continue; } else { int last = ans - 1; for (int i = ans; i < s.size(); i++) { if (s[i] == R ) { ans = max(i - last, ans); last = i; } } ans = max(ans, int(s.size()) - last); } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxk = 15; const int maxn = 1e5 + 10; long long D[maxk][maxn]; long long queryBIT(int k, int x) { long long ret = 0; while (x > 0) { ret += D[k][x]; x -= x & -x; } return ret; } void addBIT(int k, int x, long long d) { while (x < maxn) { D[k][x] += d; x += x & -x; } } int main() { int n, k; cin >> n >> k; while (n--) { int a; cin >> a; for (int j = 11; j > 0; j--) { addBIT(j, a, queryBIT(j - 1, a)); } addBIT(0, a, 1); } cout << queryBIT(k, maxn - 1) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 100010; vector<int> g[maxn]; int src[maxn], dest[maxn]; bool vis[maxn]; int main() { int n, m; int a, b; scanf( %d %d , &n, &m); for (int i = 0; i < m; i++) { scanf( %d %d , &a, &b); a--, b--; g[a].push_back(b); g[b].push_back(a); } queue<int> Q; for (int i = 0; i < n; i++) { scanf( %d , &dest[i]); if (dest[i] == 0) { Q.push(i); } } int ans = 0; while (!Q.empty()) { int i = Q.front(); Q.pop(); if (dest[i] == src[i]) { vis[i] = true; ans++; src[i]++; int len = g[i].size(); for (int j = 0; j < len; j++) { src[g[i][j]]++; if (src[g[i][j]] == dest[g[i][j]]) { Q.push(g[i][j]); } } } } printf( %d n , ans); for (int i = 0; i < n; i++) { if (vis[i]) { ans--; printf( %d%c , i + 1, ans ? : n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int ls, cc; char s[1111111], a[1111111]; int main() { gets(s), ls = strlen(s), cc = 0, a[0] = # ; for (int i = 0; i < ls; ++i) { a[++cc] = s[i]; while (cc > 1 && a[cc - 1] != a[cc]) cc -= 2; } for (int i = 1; i <= cc; ++i) putchar(a[i]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int sz = 100005; int a[sz], b[sz], sum[sz]; int main() { int n, m, c; cin >> n >> m >> c; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= m; i++) { cin >> b[i]; sum[i] = (sum[i - 1] + b[i]) % c; } for (int i = 1; i <= n; i++) { int l, r; r = min(m, i); l = max(1, m - (n - i + 1) + 1); if (l <= r) a[i] += (sum[r] - sum[l - 1] + 3 * c); a[i] %= c; cout << a[i] << ; } } |
#include <bits/stdc++.h> using namespace std; const int N = 105; int n, res = 1e9, a[5][N][N]; void calc(int a[N][N], int b[N][N], int c[N][N], int d[N][N]) { int tmp = 0, tmp2 = 0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) { if (a[i][j] != (i + j) % 2) ++tmp; else ++tmp2; if (c[i][j] != (i + j) % 2) ++tmp; else ++tmp2; if (b[i][j] != (i + j) % 2) ++tmp2; else ++tmp; if (d[i][j] != (i + j) % 2) ++tmp2; else ++tmp; } res = min(res, min(tmp, tmp2)); } int main() { cin >> n; for (int i = 1; i <= 4; ++i) for (int j = 1; j <= n; ++j) for (int k = 1; k <= n; ++k) { char z; cin >> z; a[i][j][k] = (int)(z - 0 ); } vector<int> v; v.push_back(1); v.push_back(2); v.push_back(3); v.push_back(4); do { calc(a[v[0]], a[v[1]], a[v[2]], a[v[3]]); } while (next_permutation(v.begin(), v.end())); cout << res << n ; } |
#include <bits/stdc++.h> using namespace std; string name[101]; vector<string> seen; bool see = false; int m, n, i, j; int main() { cin >> n; m = n; i = 1; int k = 0; while (n > 0) { cin >> name[i]; i++; n--; } for (i = 1; i <= m; i++) { see = false; for (vector<string>::iterator it = seen.begin(); it != seen.end(); ++it) { if (name[i] == *it) { cout << YES << endl; see = true; break; } } if (see == false) { cout << NO << endl; see = false; seen.push_back(name[i]); } } return 0; } |
//Jai Shree Ram #include<bits/stdc++.h> using namespace std; #define f(a,b,n) for(ll a=b;a<n;a++) #define readarr(arr,n) f(i,0,n) cin>>arr[i]; #define ll long long #define pb push_back #define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL) #define all(x) x.begin(), x.end() #define mod 1000000007 #define w(t) int t; cin>>t; while(t--) #define fi first #define sd second #define sp(x,y) fixed<<setprecision(y)<<x #define trace(x) cout<<#x<< : <<x<<endl; #define trav(a, x) for(auto& a : x) #define setbits(x) __builtin_popcountll(x) #define zrobits(x) __builtin_ctzll(x) #define pqmax priority_queue<ll> #define pqmin priority_queue<ll,vi,greater<ll>> #define vi vector<ll> #define mpi map<ll,ll> #define pi pair<ll,ll> #define N 1e5 #define inf 1e18 #define nline n void c_a_c() { #ifndef ONLINE_JUDGE freopen( input.txt , r ,stdin); freopen( output.txt , w ,stdout); #endif } int main() { c_a_c(); ll t; cin>>t; while(t--) { ll n; cin>>n; vector<long long> v[n+1]; long long array[n]; for(long long i = 0; i < n; i++) { cin >> array[i]; } long long x; for(long long i = 0; i < n; i++) { cin >> x; v[array[i]].push_back(x); } for(long long i = 1; i <= n; i++) { sort(all(v[i])); reverse(all(v[i])); } long long ans[n+1]; for(long long i = 1; i <= n; i++) { ans[i] = 0; } for(long long i = 1; i <= n; i++) { for(long long j = 1; j < v[i].size(); j++) { v[i][j] += v[i][j-1]; } for(long long j = 1; j <= v[i].size(); j++) { long long temp = v[i].size() % j; ans[j] += v[i][v[i].size() - temp-1]; } } for(long long i = 1; i <= n; i++) { cout << ans[i] << ; } cout << n ; } } |
#include <bits/stdc++.h> using namespace std; bool flag = 0, flag1 = 0, flag2 = 0; string t = abacaba ; int check(string s) { long long int x = 0; for (long long int i = 0; i < s.size(); i++) { if (s.substr(i, 7) == t) { x++; } } return x; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int tt = 1; cin >> tt; while (tt--) { long long int n; cin >> n; string s; cin >> s; long long int ans = 0; ans = check(s); if (ans == 0) { for (long long int i = 0; i < n - 6; i++) { if (s[i] == t[0] || s[i] == ? ) { flag = 0; for (long long int j = 0; j < 7; j++) { if (s[j + i] != t[j] && s[i + j] != ? ) { flag = 1; break; } } if (flag == 0) { string temp = s; for (long long int j = 0; j < 7; j++) temp[i + j] = t[j]; if (check(temp) == 1) { ans++; s = temp; break; } } } } } if (ans == 1) { cout << Yes n ; for (long long int i = 0; i < s.size(); i++) { if (s[i] == ? ) cout << d ; else cout << s[i]; } cout << n ; } else cout << No n ; } } |
#include <bits/stdc++.h> using namespace std; struct rua { long double x, y; } m; set<pair<long double, long double> > p; vector<pair<long double, long double> > del; vector<long double> d; set<long double> mm; int n, ans; long double x, y; bool tt; bool check(rua T) { d.clear(); rua M = {(T.x + x) / 2, (T.y + y) / 2}; rua mM = {M.x - m.x, M.y - m.y}; rua r0 = {mM.y, -mM.x}; if (!r0.x) if (tt) return false; else tt = true; long double k = r0.y / r0.x; if (mm.count(k)) return false; else mm.insert(k); long double R = pow(r0.x * r0.x + r0.y * r0.y, 0.5); for (auto i = p.begin(); i != p.end(); i++) { rua mP = {(*i).first - m.x, (*i).second - m.y}; long double t = r0.x * mP.x + r0.y * mP.y; t /= r0.x * r0.x + r0.y * r0.y; if (t) d.push_back(t); } long double _ = (r0.x * mM.x + r0.y * mM.y) / R; int l = 0, r = d.size() - 1; sort(d.begin(), d.end()); while (l <= r && d[l] + d[r] == 0) l++, r--; return l > r; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { cin >> x >> y; p.insert(make_pair(x, y)); m.x += x, m.y += y; } m.x = m.x * 1.0 / n, m.y = m.y * 1.0 / n; for (auto i = p.begin(); i != p.end(); i++) { x = (*i).first, y = (*i).second; if (p.count(make_pair(2 * m.x - x, 2 * m.y - y))) del.push_back(make_pair(2 * m.x - x, 2 * m.y - y)), del.push_back(*i); } for (int i = 0; i < del.size(); i++) if (p.count(del[i])) p.erase(del[i]); if (!p.size()) return printf( -1 n ), 0; x = (*p.begin()).first, y = (*p.begin()).second; for (auto i = p.begin(); i != p.end(); i++) if (check({(*i).first, (*i).second})) ans++; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0); ios::sync_with_stdio(0); long long n; cin >> n; long long num = 1e5 + 3; long long pos[num]; for (int i = 0; i < n; ++i) { long long a; cin >> a; pos[a] = i + 1; } long long m; cin >> m; long long counta = 0, countb = 0; for (int j = 0; j < m; ++j) { long long b; cin >> b; counta += pos[b]; countb += n - pos[b] + 1; } cout << counta << << countb; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; const long long inf = 1e9 + 7; long long mod = 998244353; vector<int> a; int solve(vector<int> &b, int bit) { vector<int> l, r; if (b.size() == 0 || bit < 0) return 0; for (int i = 0; i < b.size(); i++) { if ((b[i] >> bit) & 1 == 1) l.push_back(b[i]); else r.push_back(b[i]); } if (l.size() == 0) return solve(r, bit - 1); if (r.size() == 0) return solve(l, bit - 1); return min(solve(l, bit - 1), solve(r, bit - 1)) + (1 << bit); } int main(void) { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { int x; scanf( %d , &x); a.push_back(x); } int ans = solve(a, 30); printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, m, u, v, w, answer, capital, intree, l, dis[N]; vector<pair<int, int> > nei[N]; vector<pair<int, pair<int, int> > > edge; bool done[N]; priority_queue<pair<int, int> > pq; int main() { cin >> n >> m >> capital; capital--; for (int i = 0; i < m; i++) { cin >> u >> v >> w; u--, v--; nei[v].push_back(make_pair(u, w)); nei[u].push_back(make_pair(v, w)); edge.push_back(make_pair(w, make_pair(u, v))); } cin >> l; done[capital] = true; for (int i = 0; i < nei[capital].size(); i++) { pq.push(make_pair(-nei[capital][i].second, nei[capital][i].first)); } while (intree < n - 1) { while (done[(pq.top()).second]) pq.pop(); pair<int, int> p = pq.top(); v = p.second; dis[v] = -p.first; done[v] = true; for (int i = 0; i < nei[v].size(); i++) { if (!done[nei[v][i].first]) pq.push(make_pair(-dis[v] - nei[v][i].second, nei[v][i].first)); } intree++; } for (int i = 0; i < n; i++) { answer += (dis[i] == l); } for (int i = 0; i < m; i++) { pair<int, pair<int, int> > pa = edge[i]; for (int j = 1; j < pa.first; j++) { if (min(dis[pa.second.first] + j, dis[pa.second.second] + pa.first - j) == l) { answer++; } } } cout << answer; return 0; } |
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; vector<long long> v(n + 1); long long xr = 0; for (long long i = 1; i <= n; i++) { cin >> v[i]; xr ^= v[i]; } if (xr == 0) { cout << DRAW << n ; return; } long long msb; for (long long i = 32; ~i; i--) { if (xr & (1ll << i)) { msb = i; break; } } long long count = 0; for (long long i = 1; i <= n; i++) { count += ((v[i] & (1ll << msb)) > 0); } bool win = (count % 4 == 1 or ((n - count) & 1)); cout << (win ? WIN : LOSE ) << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ul = unsigned long long; using ld = long double; const int N = 101; int a[N][N]; vector<vector<int>> ans; void q(int ax, int ay, int bx, int by, int cx, int cy) { a[ax][ay] ^= 1; a[bx][by] ^= 1; a[cx][cy] ^= 1; ans.push_back({ax, ay, bx, by, cx, cy}); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t, n, m; cin >> t; for (int z = 0; z < (t); z++) { cin >> n >> m; string s; for (int i = 0; i < (n); i++) { cin >> s; for (int j = 0; j < (m); j++) a[i][j] = s[j] - 0 ; } ans.clear(); for (int i = 0; i < (n - 2); i++) for (int j = 0; j < (m); j++) { if (a[i][j]) q(i, j, i + 1, j, i + 1, j + (j == 0 ? 1 : -1)); } for (int i = 0; i < (m - 2); i++) { if (a[n - 2][i] && a[n - 1][i]) q(n - 2, i, n - 1, i, n - 2, i + 1); else if (a[n - 2][i]) q(n - 2, i, n - 2, i + 1, n - 1, i + 1); else if (a[n - 1][i]) q(n - 1, i, n - 1, i + 1, n - 2, i + 1); } int ss = 0; for (int i = 0; i < (2); i++) for (int j = 0; j < (2); j++) ss ^= a[n - 2 + i][m - 2 + j]; for (int i = 0; i < (2); i++) { for (int j = 0; j < (2); j++) { if (a[n - 2 + i][m - 2 + j] == ss) continue; vector<int> cv; for (int i1 = 0; i1 < (2); i1++) for (int j1 = 0; j1 < (2); j1++) if (i1 != i || j1 != j) { cv.push_back(n - 2 + i1); cv.push_back(m - 2 + j1); } ans.push_back(cv); } } cout << ans.size() << n ; for (auto &pp : ans) { for (int i : pp) cout << i + 1 << ; cout << n ; } } } |
#include <bits/stdc++.h> using namespace std; template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return + s + ; } string to_string(char ch) { string s; s += ch; return s; } string to_string(const char* s) { return to_string((string)s); } string to_string(bool b) { return (b ? true : false ); } string to_string(vector<bool> v) { bool first = true; string res = { ; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += , ; } first = false; res += to_string(v[i]); } res += } ; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ; for (size_t i = 0; i < N; i++) { res += static_cast<char>( 0 + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = { ; for (const auto& x : v) { if (!first) { res += , ; } first = false; res += to_string(x); } res += } ; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return ( + to_string(p.first) + , + to_string(p.second) + ) ; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + ) ; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << to_string(H); debug_out(T...); } long long expmod(long long x, long long n, long long mod) { if (n == 0) return 1; else if (n % 2 == 0) { long long temp = expmod(x, n / 2, mod); return (temp * temp) % mod; } else { return (expmod(x, n - 1, mod) * x) % mod; } } long long modinv(long long x, long long mod) { return expmod(x, mod - 2, mod); } void solve() { int n; cin >> n; long long mod = 1e9 + 7; long long p = 0, q = 0; int even = 0; long long power = 2; for (int i = 0; i < n; i++) { long long x; cin >> x; even |= (x % 2 == 0); power = expmod(power, x, mod); } 42; power = power * modinv(2, mod) % mod; p = power + (even ? 1 : -1); p = (p + mod) % mod; p = p * modinv(3, mod) % mod; q = power; 42; cout << p << / << q << n ; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; for (int tc = 1; tc <= t; tc++) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int Read() { char c; while (c = getchar(), (c != - ) && (c < 0 || c > 9 )) ; bool neg = (c == - ); int ret = (neg ? 0 : c - 48); while (c = getchar(), c >= 0 && c <= 9 ) ret = ret * 10 + c - 48; return neg ? -ret : ret; } const int MAXN = 1005; int N, n, a[MAXN]; pair<int, int> ans[MAXN * MAXN]; void init() { scanf( %d , &N); for (int i = 1; i <= N; i++) a[i] = Read(), n += (a[i] > 0); } void work() { if (n < 2) { puts( -1 ); return; } else n = 0; int B = 1, C = 2; for (int i = 3; i <= N; i++) for (int A = i;;) { if (a[B] < a[A]) swap(A, B); if (a[C] < a[B]) swap(C, B); if (a[B] < a[A]) swap(A, B); if (!a[A]) break; for (int j = a[B] / a[A]; j; j >>= 1) if (j & 1) ans[++n] = make_pair(A, B), a[B] -= a[A], a[A] <<= 1; else ans[++n] = make_pair(A, C), a[C] -= a[A], a[A] <<= 1; } printf( %d n , n); for (int i = 1; i <= n; i++) printf( %d %d n , ans[i].first, ans[i].second); } int main() { init(); work(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long int cvp = 3; int main() { scanf( %d , &n); for (int i = 3; i <= n; i++) { cvp = cvp * 3; if (i % 2 == 1) cvp -= 3; else cvp += 3; cvp = cvp % (long long int)1000000007; } if (n == 1) { printf( 0 n ); return 0; } printf( %lld n , cvp); } |
#include <bits/stdc++.h> using namespace std; inline long long read() { long long ret = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) ret = ret * 10 + ch - 0 , ch = getchar(); return ret * f; } const long long maxn = 100005; long long n, A, cj, cm, m; pair<long long, long long> a[maxn]; long long sum[maxn]; long long ans = 0, ansx = -1, ansy = -1; inline bool cmp_value(pair<long long, long long> aa, pair<long long, long long> bb) { return aa.first < bb.first; } inline bool cmp_id(pair<long long, long long> aa, pair<long long, long long> bb) { return aa.second < bb.second; } inline long long get_all_sum(long long x, long long up) { long long L = 1, R = up; long long ret = 0; while (L <= R) { long long mid = ((R - L) >> 1) + L; if (a[mid].first > x) R = mid - 1; else ret = x * mid - sum[mid], L = mid + 1; } return ret; } signed main() { n = read(); A = read(); cj = read(); cm = read(); m = read(); for (long long i = 1; i <= n; i++) a[i].first = read(), a[i].second = i; sort(a + 1, a + 1 + n, cmp_value); for (long long i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i].first; long long need = 0; for (long long i = n + 1; i >= 1; i--) { if (i <= n) need += A - a[i].first; if (need > m) break; long long L = 0, R = A; while (L <= R) { long long mid = ((R - L) >> 1) + L; long long all_sum = get_all_sum(mid, i - 1); if (all_sum > m - need) R = mid - 1; else { if ((n - i + 1) * cj + mid * cm > ans) { ans = (n - i + 1) * cj + mid * cm; ansx = mid; ansy = i; } L = mid + 1; } } } printf( %lld n , ans); if (ansx != -1 && ansy != -1) { for (long long i = 1; i < ansy; i++) a[i].first = max(ansx, a[i].first); for (long long i = ansy; i <= n; i++) a[i].first = A; } sort(a + 1, a + 1 + n, cmp_id); for (long long i = 1; i <= n; i++) printf( %lld , a[i].first); printf( n ); return 0; } |
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { char c; int flag = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag *= -1; x = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) x = x * 10 + c - 0 ; x *= flag; return; } inline void read(long long &x) { char c; int flag = 1; while ((c = getchar()) < 0 || c > 9 ) if (c == - ) flag *= -1; x = c - 0 ; while ((c = getchar()) >= 0 && c <= 9 ) x = x * 10 + c - 0 ; x *= flag; return; } int dp[5005][5005]; int arr[5005]; int main() { int n; read(n); for (int i = 1; i <= n; ++i) { read(arr[i]); dp[i][1] = arr[i]; } for (int i = 2; i <= n; ++i) { for (int j = 1; j <= n; ++j) { dp[j][i] = dp[j + 1][i - 1] ^ dp[j][i - 1]; } } for (int i = 2; i <= n; ++i) { for (int j = 1; j <= n; ++j) { dp[j][i] = max(dp[j][i], max(dp[j + 1][i - 1], dp[j][i - 1])); } } int q; cin >> q; while (q--) { int l, r; read(l); read(r); printf( %d n , dp[l][r - l + 1]); } } |
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9 + 7; int add(int a, int b) { return (a + b) % MOD; } int sub(int a, int b) { return add(a, MOD - b); } int mul(int a, int b) { return ((long long)a * b) % MOD; } int inv(int a) { int b = 1; for (int i = 0; (1 << i) <= MOD - 2; i++) { if ((1 << i) & (MOD - 2)) b = mul(b, a); a = mul(a, a); } return b; } const int MAXN = 1e5 + 10; vector<int> e[MAXN]; int val[MAXN], sz[MAXN], parent[MAXN]; map<int, int> dist[MAXN]; int A[MAXN], B[MAXN], total; bool active[MAXN]; vector<int> in[MAXN], out[MAXN]; int calc_sz(int i, int p) { sz[i] = 1; for (int j : e[i]) { if (!active[j] || j == p) continue; sz[i] += calc_sz(j, i); } return sz[i]; } int find_centroid(int i, int p, int n) { for (int j : e[i]) { if (!active[j] || j == p) continue; if (sz[j] > n / 2) return find_centroid(j, i, n); } return i; } void calc_dist(int i, int p, int r, int d) { dist[i][r] = d; for (int j : e[i]) { if (!active[j] || j == p) continue; calc_dist(j, i, r, d + 1); } } int build_centroid(int i) { i = find_centroid(i, -1, calc_sz(i, -1)); calc_dist(i, -1, i, 0); active[i] = false; for (int j : e[i]) { if (!active[j]) continue; parent[build_centroid(j)] = i; } return i; } void update(int i, int k) { int v = mul(val[i], MOD + k); for (int p = i; p != -1; p = parent[p]) { total = sub(total, mul(A[p], B[p])); A[p] = add(A[p], mul(v, dist[i][p])); if (parent[p] != -1) A[p] = sub(A[p], mul(v, dist[i][parent[p]])); B[p] = add(B[p], v); total = add(total, mul(A[p], B[p])); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; int t = 1; for (int i = 0; i < n; i++) { int l, r; cin >> l >> r; in[l].push_back(i); out[r].push_back(i); val[i] = inv(r - l + 1); t = mul(t, r - l + 1); active[i] = true; } for (int i = 0; i < n - 1; i++) { int x, y; cin >> x >> y; x--; y--; e[x].push_back(y); e[y].push_back(x); } parent[build_centroid(0)] = -1; int sol = 0; for (int color = 0; color < MAXN; color++) { for (int i : in[color]) update(i, 1); sol = add(sol, total); for (int i : out[color]) update(i, -1); } cout << mul(sol, t); return 0; } |
#include <bits/stdc++.h> #pragma hdrstop using namespace std; void solve(); int main() { int t = 1; while (t--) solve(); return 0; } long long n, k; long long dp[5000][5000]; vector<pair<long long, long long> > a; long long b[5000]; void solve() { cin >> n >> k; a.push_back(make_pair(1, 0)); b[0] = 1; for (long long i = 0; i < n; i++) { long long q, w; cin >> q >> w; a.push_back(make_pair(q, w)); b[i + 1] = q; } a.push_back(make_pair(86401, 0)); b[n + 1] = 86401; long long border = 0; for (long long i = 0; i <= n + 5; i++) for (long long j = 0; j <= i; j++) dp[i][j] = (1LL << 50); dp[0][0] = 1; for (long long i = 0; i <= n; i++) for (long long j = 0; j <= i; j++) { pair<long long, long long> cur = a[i + 1]; dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]); long long now = max(b[i + 1], dp[i][j]) + cur.second; dp[i + 1][j] = min(dp[i + 1][j], now); } long long ans = 0; for (long long i = 1; i <= n + 1; i++) { for (long long j = 0; j <= k; j++) { long long cur = dp[i - 1][j]; long long now = b[i]; ans = max(ans, now - cur); } } cout << ans; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.