func_code_string
stringlengths 59
71.4k
|
|---|
#include <bits/stdc++.h> using namespace std; long long mod = 1000000007; template <typename T> void debug(vector<T> x) { for (auto e : x) { cout << e << ; } cout << n ; } void solve() { long long n, m, x, y; cin >> n >> m >> x >> y; vector<pair<long long, long long>> ans; stack<pair<long long, long long>> st; long long mat[n + 1][m + 1]; for (long long i = 1; i <= n; i++) for (long long j = 1; j <= m; j++) mat[i][j] = 0; st.push({x, y}); while (!st.empty()) { pair<long long, long long> cur = st.top(); if (mat[cur.first][cur.second] == 0) { mat[cur.first][cur.second] = 1; ans.push_back({cur.first, cur.second}); } st.pop(); for (long long i = 1; i <= n; i++) { if (mat[i][cur.second] == 0) { st.push({i, cur.second}); } } for (long long j = 1; j <= m; j++) { if (mat[cur.first][j] == 0) { st.push({cur.first, j}); } } } for (auto x : ans) { cout << x.first << << x.second << n ; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; while (t--) { solve(); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int N, cn = 0, Z = 0, max = 0; cin >> N; int arr[N]; for (int i = 0; i < N; i++) { cin >> arr[i]; } for (int i = 0; i < N; i++) { cn = 0; for (int j = i + 1; j < N; j++) { if (arr[i] == arr[j] && arr[j] != 0) { cn++; arr[j] = 0; } } if (max <= cn) { max = cn; } if (cn >= 1) { Z += cn; } } cout << max + 1 << << N - Z; return 0; } |
#include <bits/stdc++.h> using namespace std; using ui32 = unsigned; using ui64 = unsigned long long; using i64 = long long; using i32 = int; static constexpr bool debug = false; struct node { node *c[2] = {0, 0}; int cnt = 0; }; node *root = new node; void insert_rec(node *nd, ui32 number, int i) { ++nd->cnt; if (i != -1) { int bit = (number >> i) & 1; if (nd->c[bit] == nullptr) nd->c[bit] = new node; insert_rec(nd->c[bit], number, i - 1); } } void insert(ui32 number) { insert_rec(root, number, 31); } bool remove_rec(node *nd, ui32 number, int i) { if (i != -1) { int bit = (number >> i) & 1; if (remove_rec(nd->c[bit], number, i - 1)) nd->c[bit] = nullptr; } if (--nd->cnt == 0) { delete nd; return true; } else { return false; } } void remove(ui32 number) { remove_rec(root, number, 31); } void print_numbers_rec(node *nd, ui32 number, int i) { if (nd == nullptr) return; if (i == -1) { for (int j = 0; j < nd->cnt; ++j) { cerr << number << ; } } print_numbers_rec(nd->c[0], number << 1, i - 1); print_numbers_rec(nd->c[1], (number << 1) | 1, i - 1); } void print_numbers() { print_numbers_rec(root, 0, 31); cerr << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<ui32> a(n); for (int i = 0; i < n; ++i) cin >> a[i]; for (int i = 0; i < n; ++i) { ui32 t; cin >> t; insert(t); } vector<int> o(n); for (int i = 0; i < n; ++i) { node *cur = root; ui32 xored = 0; for (int j = 31; j >= 0; --j) { int bit = (a[i] >> j) & 1; if (cur->c[bit] != nullptr) { cur = cur->c[bit]; xored = (xored << 1) | bit; } else { cur = cur->c[bit ^ 1]; xored = (xored << 1) | (bit ^ 1); } } o[i] = a[i] ^ xored; remove(xored); } for (int i = 0; i < n; ++i) { cout << o[i] << n [i + 1 == n]; } } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1e5 + 55; const int inf = 1e9 + 77; const int MOD = 1e9 + 7; const double eps = 1e-7; map<int, int> mp; pair<int, int> pi; vector<long long> v; map<char, int> mp1; deque<int> d; int x[MAX], y[MAX]; char c[MAX]; int cnt[MAX]; int main() { int n; cin >> n; long long even = 0; long long odd = 0; for (int i = 0; i < n; i++) { long long a; cin >> a; if (a % 2 != 0) odd++; else even++; } if (odd == 0) cout << Second ; else cout << First ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; if (k == 0 || k == n) { cout << 0 0 ; return 0; } cout << min(1LL, n - k) << << min(n - k, k * 2LL); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, tx, ty, ans = 0; vector<int> x, y; cin >> n; for (int i = 0; i <= n; i++) { cin >> tx >> ty; x.push_back(tx), y.push_back(ty); } for (int i = 1; i < n; i++) { int fx = x[i + 1], fy = y[i + 1]; int cx = x[i], cy = y[i]; int px = x[i - 1], py = y[i - 1]; if ((fy > cy && cx > px) || (cx > fx && cy > py) || (fy < cy && cx < px) || (fx > cx && cy < py)) ans++; } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int INF = 9223372036854775807; const long long int mod = 1000000007; long long int MOD(long long int a, long long int b) { if (a > b) return a - b; else return b - a; } long long int max3(long long int a, long long int b, long long int c) { return max(c, max(a, b)); } long long int min3(long long int a, long long int b, long long int c) { return min(a, min(b, c)); } long long int power(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = (res * x); y = y >> 1; x = (x * x); } return res; } long long int power1(long long int x, long long int y) { long long int res = 1; while (y > 0) { if (y & 1) res = (res * x) % mod; y = y >> 1; x = (x * x) % mod; } return res % mod; } long long int logg(long long int a) { long long int x = 0; while (a > 1) { x++; a /= 2; } return x; } long long int gcd(long long int a, long long int b) { if (a == 0) return b; return gcd(b % a, a); } long long int abso(long long int x) { if (x < 0) { return -x; } return x; } long long int ceiling(long long int a, long long int b) { if (a % b == 0) { return a / b; } else { return a / b + 1; } } long long int modinv(long long int x) { return power1(x, mod - 2); } vector<vector<int>> mat; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int n, p; cin >> n >> p; mat.resize(p); string str; cin >> str; for (int i = 0; i < p; i++) { mat[i].resize(p); for (int j = 0; j < p; j++) { cin >> mat[i][j]; } } vector<vector<vector<int>>> pair_masks(p); vector<int> cnt(p); for (int i = 0; i < n; i++) { cnt[str[i] - a ]++; } for (int i = 0; i < p; i++) { pair_masks[i].resize(p); for (int j = 0; j < p; j++) { pair_masks[i][j].resize(1 << p); } } for (int i = 0; i < p; i++) { for (int j = 0; j < p; j++) { int prev = -1; int mask = 0; for (int k = 0; k < n; k++) { if (str[k] == a + i || str[k] == a + j) { if (prev == -1) { prev = str[k] - a ; mask = 0; } else { if (i != j) { if (prev == str[k] - a ) { mask = 0; } else { pair_masks[i][j][mask] = 1; prev = str[k] - a ; mask = 0; } } else { pair_masks[i][j][mask] = 1; prev = str[k] - a ; mask = 0; } } } else { mask = mask | 1 << (str[k] - a ); } } } } for (int i = 0; i < p; i++) { for (int j = 0; j < p; j++) { for (int m = 0; m < p; m++) { for (int k = 0; k < (1 << p); k++) { if (m != i && m != j) { pair_masks[i][j][k | 1 << m] += pair_masks[i][j][k]; } } } } } for (int i = 0; i < p; i++) { for (int j = 0; j < p; j++) { for (int k = 0; k < (1 << p); k++) { pair_masks[i][j][k] = min(1, pair_masks[i][j][k]); } } } vector<int> dp(1 << p, 0); dp[0] = 1; for (int mask = 1; mask < (1 << p); mask++) { bool c = false; for (int i = 0; i < p; i++) { for (int j = 0; j < p; j++) { if (pair_masks[i][j][mask] && !mat[i][j]) { c = true; break; } } if (c) { break; } } if (c) { dp[mask] = 0; continue; } for (int i = 0; i < p; i++) { if (mask & (1 << i)) { if (dp[mask ^ (1 << i)]) { dp[mask] = 1; } } } } int ans = n; for (int mask = 0; mask < (1 << p); mask++) { if (dp[mask]) { int len = n; for (int k = 0; k < p; k++) { if (mask & 1 << k) { len -= cnt[k]; } } ans = min(ans, len); } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; long long INF = 1e18; int INFi = 2e9; double eps = 1e-6; long long mod = 1e9 + 7; vector<char> used; vector<vector<int>> edge; vector<int> p; vector<int> cnt; int sz = 0; void add(int beg, int end) { while (beg != end) { cnt[beg]++; beg = p[beg]; } } void sub(int beg) { while (used[beg] == 2) { cnt[beg]--; beg = p[beg]; } } void dfs(int v) { used[v] = 1; for (int u : edge[v]) { if (used[u] == -1) { continue; } if (used[u] == 2) { sub(u); continue; } if (used[u] == 1) { add(v, u); sz++; continue; } p[u] = v; dfs(u); } used[v] = 2; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; edge.resize(n); used.resize(n); p.resize(n); cnt.resize(n); int t1, t2; for (int i = 0; i < m; i++) { cin >> t1 >> t2; t1--; t2--; edge[t1].push_back(t2); } for (int i = 0; i < n; i++) { if (!used[i]) dfs(i); for (int j = 0; j < n; j++) { if (used[j] == 2) used[j] = -1; } } for (int i = 0; i < n; i++) { if (cnt[i] == sz) { cout << YES n ; return 0; } } if (sz == 1) { cout << YES n ; } else { cout << NO n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y) { if (y == 0) return 1; else if (y % 2 == 0) return power(x, y / 2) * power(x, y / 2); else return x * power(x, y / 2) * power(x, y / 2); } double slope(long long int x1, long long int y1, long long int x2, long long int y2) { return (double)((double)(y2 - y1) / (x2 - x1)); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int ax, ay, bx, by, cx, cy; cin >> ax >> ay >> bx >> by >> cx >> cy; long long int dab = power((bx - ax), 2) + power((by - ay), 2); long long int dbc = power((cx - bx), 2) + power((cy - by), 2); if (dab != dbc) { cout << No n ; } else if (slope(ax, ay, bx, by) == slope(bx, by, cx, cy)) { cout << No n ; } else { cout << Yes n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int n, m, ROOT, head; bool vis[MAXN]; int depth[MAXN], deg[MAXN]; vector<int> adj[MAXN]; vector<int> c; stack<int> stk; pair<bool, vector<int> > independentSet() { set<pair<int, int> > s; vector<int> v; for (auto i = 0; i < (n); i++) s.insert(make_pair(deg[i], i)); while (!s.empty()) { int node = s.begin()->second; s.erase(s.begin()); if (vis[node]) continue; v.push_back(node); vis[node] = true; for (auto u : adj[node]) { if (vis[u]) continue; vis[u] = true; for (auto v : adj[u]) { if (v == u) continue; --deg[v]; s.insert(make_pair(deg[v], v)); } } } if (v.size() >= ROOT) return make_pair(true, v); else return make_pair(false, vector<int>{}); } void simpleCycle() { while (!stk.empty() && stk.top() != head) { c.push_back(stk.top()); stk.pop(); } c.push_back(head); reverse(c.begin(), c.end()); cout << 2 n << c.size() << n ; for (auto u : c) cout << u + 1 << ; exit(0); } void dfs(int node, int d) { if (depth[node] > 0) { if (d - depth[node] == ROOT) { head = node; simpleCycle(); } return; } depth[node] = d; stk.push(node); for (auto u : adj[node]) { dfs(u, d + 1); } stk.pop(); } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m; for (auto i = 0; i < (m); i++) { int u, v; cin >> u >> v; --u; --v; adj[u].push_back(v); adj[v].push_back(u); ++deg[u]; ++deg[v]; } ROOT = (int)sqrt(n); if (ROOT * ROOT < n) ++ROOT; auto is = independentSet(); if (is.first) { cout << 1 n ; for (auto i = 0; i < (ROOT); i++) cout << is.second[i] + 1 << ; exit(0); } else { dfs(0, 1); } } |
#include <bits/stdc++.h> using namespace std; namespace whatever { int readu() { char ch = getchar(); while (!isdigit(ch)) ch = getchar(); int value = ch - 0 ; ch = getchar(); while (isdigit(ch)) { value = value * 10 + ch - 0 ; ch = getchar(); } return value; } long long readull() { char ch = getchar(); while (!isdigit(ch)) ch = getchar(); long long value = ch - 0 ; ch = getchar(); while (isdigit(ch)) { value = value * 10 + ch - 0 ; ch = getchar(); } return value; } void writeull(long long n) { if (n < 10) putchar(n + 0 ); else { writeull(n / 10); putchar(n % 10 + 0 ); } } void run() { int n = readu(); long long t = readull(); static int a[200000]; for (int i = 0; i < n; ++i) a[i] = readu(); long long result = 0; while (n != 0) { long long sum = accumulate(a, a + n, 0ll); result += t / sum * n; t %= sum; for (int i = 0; i < n; ++i) if (t >= a[i]) { t -= a[i]; ++result; } n = remove_if(a, a + n, [t](int a) { return a > t; }) - a; } writeull(result); putchar( n ); } } // namespace whatever int main() { whatever::run(); } |
#include <bits/stdc++.h> using namespace std; const int buffer_size = 1 << 20; int rd_char() { static char buf[buffer_size]; static int l = buffer_size, r = buffer_size; if (l == r && r == buffer_size) { r = fread(buf, sizeof(char), 1 << 20, stdin); l = 0; } if (l == r) return EOF; return buf[l++]; } unsigned int rd_uint() { int c; unsigned int x = 0; while ( 0 <= (c = rd_char())) x = x * 10 + c - 0 ; return x; } int rd_int() { bool neg = false; int c = rd_char(); long long x = 0; if (c == - ) neg = true; else x = c - 0 ; while ( 0 <= (c = rd_char())) x = x * 10 + c - 0 ; return neg ? -x : x; } unsigned long long rd_ull() { int c; unsigned long long x = 0; while ( 0 <= (c = rd_char())) x = x * 10 + c - 0 ; return x; } long long rd_ll() { bool neg = false; int c = rd_char(); long long x = 0; if (c == - ) neg = true; else x = c - 0 ; while ( 0 <= (c = rd_char())) x = x * 10 + c - 0 ; return neg ? -x : x; } string rd_str() { string ret; int c; while ((c = rd_char()) != n && c != && c != EOF) ret += c; return ret; } struct writer_struct { char buf[buffer_size]; int l = 0; ~writer_struct() { fwrite(buf, sizeof(char), l, stdout); } } writer; void flush() { fwrite(writer.buf, sizeof(char), writer.l, stdout); fflush(stdout); writer.l = 0; } void wt(char c) { if (writer.l == buffer_size) { fwrite(writer.buf, sizeof(char), buffer_size, stdout); writer.l = 0; } writer.buf[writer.l++] = c; } void wt(unsigned int x) { if (x == 0) wt( 0 ); else { char f[10]; int sz = 0; while (x) { f[sz++] = x % 10 + 0 ; x /= 10; } while (sz) wt(f[--sz]); } } void wt(int x) { if (x < 0) wt( - ), x = -x; wt((unsigned int)x); } void wt(unsigned long long x) { if (x == 0) wt( 0 ); else { char f[20]; int sz = 0; while (x) { f[sz++] = x % 10 + 0 ; x /= 10; } while (sz) wt(f[--sz]); } } void wt(long long x) { if (x < 0) wt( - ), x = -x; wt((unsigned long long)x); } void wt(const char* s) { while (*s != 0 ) wt(*s++); } void wt(const string& s) { for (char c : s) wt(c); } const int LIM = 3e6; int N, C[LIM + 1]; long long cnt[LIM + 1]; int main() { N = rd_uint(); for (int i = 0; i < N; i++) C[rd_uint()]++; for (int i = 1; i <= LIM; i++) { if ((long long)i * i <= LIM) cnt[i * i] += (long long)C[i] * (C[i] - 1); else cnt[LIM] += (long long)C[i] * (C[i] - 1); int rest = N - C[i]; for (int j = 1; (long long)i * j <= LIM; j++) { if (i != j) cnt[i * j] += (long long)C[i] * C[j], rest -= C[j]; } cnt[LIM] += (long long)C[i] * rest; } for (int i = LIM; i >= 1; i--) cnt[i - 1] += cnt[i]; int M = rd_uint(); for (; M--;) { int p = rd_uint(); wt(cnt[p]); wt( n ); } } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, i; vector<int> arr, sol, orig; cin >> n; arr.resize(n); for (i = 0; i < n; ++i) { cin >> arr[i]; } orig = arr; sort(orig.begin(), orig.end()); for (i = 0; i < n; ++i) { for (int k = 0; k + 1 < arr.size(); ++k) { while (arr[i] - arr[i + 1] >= 2) ++arr[i + 1], --arr[i]; while (arr[i] - arr[i + 1] <= -2) --arr[i + 1], ++arr[i]; } int j = -1, x = -1; for (int k = 0; k < arr.size(); ++k) { if (arr[k] > x) { x = arr[k]; j = k; } } sol.push_back(arr[j]); arr.erase(arr.begin() + j); } reverse(sol.begin(), sol.end()); cout << (sol == orig ? YES : NO ) << n ; } |
#include<bits/stdc++.h> using namespace std; int main() { int t,p,k,q,b; cin>>t; string s; while(t--) { cin>>s; k=0; q=0; b=0; p=0; for(int i=0;i<s.size();i++) { if(s[0]== ) || s[s.size()-1]== ( ) { p=0; break;} else if( s[i]== ( ) { k++; } else if(s[i]== ? ) q++; else if(s[i]== ) ) b++; } if(k==b && q%2!=0 && k>0) p=0; else if(k==b&& q%2==0&& k>0) p=1; else if(q== abs(k-b) && k>0) p=1; if(p==1) cout<< yes <<endl; else cout<< NO <<endl; } } |
#include<bits/stdc++.h> using namespace std; #define il inline #define rg register #define int long long #define M 998244353 const int P=3,Pn=332748118; il int read() { int re=0,k=1;char ch=getchar(); while(ch> 9 ||ch< 0 ){if(ch== - )k=-1;ch=getchar();} while(ch<= 9 &&ch>= 0 ){re=re*10+ch-48;ch=getchar();} return re*k; } il void write(long long x) { if(x<0)return putchar( - ),write(-x),void(); if(x<10)return putchar(x+ 0 ),void(); return write(x/10),putchar(x%10+ 0 ),void(); } signed main() { int T,a,b,c,d; T=read(); while(T--) { d=read();a=read();b=read();c=read(); int ans=min((a-d%a)%a,min((b-d%b)%b,(c-d%c)%c)); write(ans);puts( ); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; const double eps = 1e-8; const double pi = acos(-1); int main() { int T; cin >> T; while (T--) { string s; cin >> s; int cnt = 0; bool flag0 = false, flag1 = false, flag2 = false; for (int i = 0; i < s.size() - 1; i++) { if (s[i] == 0 ) flag0 = true; if (s[i] == 1 ) flag1 = true; if (s[i] == 2 ) flag2 = true; if (s[i] == 0 && s[i + 1] != 0 ) cnt++; } if (s[s.size() - 1] == 0 ) cnt++; if (s[s.size() - 1] == 0 ) flag0 = true; if (s[s.size() - 1] == 1 ) flag1 = true; if (s[s.size() - 1] == 2 ) flag2 = true; if (!flag0) cnt = min(cnt, 0); else if (!flag1) cnt = min(cnt, 1); else if (!flag2) cnt = min(cnt, 2); cout << cnt << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e3 + 5; int readint() { int x = 0, f = 1; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -1; (s = getchar()); } while (s >= 0 && s <= 9 ) { x = (x << 3) + (x << 1) + (s ^ 48); (s = getchar()); } return x * f; } long long dp[maxn][maxn]; int a[maxn]; int q[maxn]; int main() { int n = readint(), k = readint(), x = readint(); for (int i = 1; i <= n; i++) { a[i] = readint(); } memset(dp, -0x3f, sizeof(dp)); dp[0][0] = 0; for (int j = 1; j <= x; j++) { int head = 1, tail = 0; q[++tail] = 0; for (int i = 1; i <= n; i++) { while (head <= tail && i - q[head] > k) head++; dp[i][j] = dp[q[head]][j - 1] + a[i] + 0ll; while (head <= tail && dp[q[tail]][j - 1] <= dp[i][j - 1]) tail--; q[++tail] = i; } } long long ans = -1; for (int i = n; i >= n - k + 1; i--) { ans = max(ans, dp[i][x]); } cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const double PI = 3.1415926535897932384626433; const long long mod = 1000000007; const int INF = 0x3f3f3f3f; const double eps = 1e-8; template <class T> T gcd(T a, T b) { if (!b) return a; return gcd(b, a % b); } const int maxn = 1e5 + 10; vector<int> edg[maxn], vi, ans; int now[maxn], nxt[maxn], len1, len2, n, m, vis[maxn], st[maxn], flg; void dfs(int u) { if (st[u] < 0) flg = 0; if (flg == 0) return; vis[u] = 1; ans.push_back(u); for (int i = 0; i < edg[u].size(); i++) { int nxt = edg[u][i]; if (st[nxt] < 0) flg = 0; if (!vis[nxt]) dfs(nxt); } } int deal(int *a1, int *a2) { int len = min(len1, len2); for (int i = 0; i < len; i++) { if (a1[i] < a2[i]) { edg[a2[i]].push_back(a1[i]); return 1; } else if (a1[i] > a2[i]) { vi.push_back(a1[i]); if (st[a1[i]] == -1 || st[a2[i]] == 1) return 0; st[a1[i]] = 1; st[a2[i]] = -1; return 1; } } return len1 <= len2; } int solve() { memset(st, 0, sizeof(st)); int *a1 = now, *a2 = nxt; scanf( %d , &len1); for (int i = 0; i < len1; i++) scanf( %d , &a1[i]); flg = 1; for (int t = 1; t < n; t++) { scanf( %d , &len2); for (int i = 0; i < len2; i++) scanf( %d , &a2[i]); if (deal(a1, a2) == 0) flg = 0; swap(a1, a2); len1 = len2; } memset(vis, 0, sizeof(vis)); for (int i = 0; i < vi.size(); i++) if (!vis[vi[i]]) dfs(vi[i]); return flg; } int main() { scanf( %d , &n); scanf( %d , &m); if (solve()) { printf( Yes n%d n , ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d , ans[i]); puts( ); } else { printf( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, a[5000] = {0}; cin >> n >> k; for (int i = 1; i <= k; i++) { int la = 0; cin >> la; if (la == 1) { int p, q; cin >> p >> q; a[p] = 1; a[q] = 1; } else if (la == 2) { int p; cin >> p; a[p] = 1; } } int w = 0; for (int i = 1; i < n; i++) { if (a[i] == 0) { w++; } } int max = w, min = w + 1; for (int i = 1; i <= n; i++) { if (a[i] == 0 && a[i + 1] == 0) { min--; i++; } } cout << min << << max << endl; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2001; const int inf = 1000000000; int d[maxn], a[maxn], n, k; bool check(int x) { int ans = inf; for (int i = 1; i <= n; i++) { d[i] = i - 1; for (int j = 1; j < i; j++) if (abs(a[i] - a[j]) <= (i - j) * 1ll * x) d[i] = min(d[i], d[j] + i - j - 1); ans = min(ans, d[i] + n - i); } if (ans <= k) return true; return false; } int main() { cin >> n >> k; int l = -1, r = 0, mid; for (int i = 1; i <= n; i++) { cin >> a[i]; r = max(r, (i == 1 ? r : abs(a[i] - a[i - 1]))); } while (r - l > 1) { mid = (l + 0ll + r) / 2; if (check(mid)) r = mid; else l = mid; } cout << r; return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 998244353; const int INF = 1e9; const int maxn = 1e6 + 10; const double eps = 1e-8; int add(int x, int y) { x += y; return x >= mod ? x - mod : x; } int sub(int x, int y) { x -= y; return x < 0 ? x + mod : x; } int mul(int x, int y) { return 1LL * x * y % mod; } int dep[maxn], tot, ans; vector<pair<int, int> > g[maxn]; queue<pair<int, int> > q; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; bool ok = false; for (int i = 1; i <= n; i++) { vector<int> fac; int x; cin >> x; for (int d = 2; d * d <= x; d++) if (x % d == 0) { int cnt = 0; while (x % d == 0) cnt++, x /= d; if (cnt & 1) fac.push_back(d); } if (x > 1) fac.push_back(x); if (fac.size() == 2) { int p = fac[0], q = fac[1]; g[p].push_back(pair<int, int>{q, ++tot}), g[q].push_back(pair<int, int>{p, tot}); } else if (fac.size() == 1) { int p = fac[0]; g[p].push_back(pair<int, int>{1, ++tot}), g[1].push_back(pair<int, int>{p, tot}); } else ok = true; } if (ok) { cout << 1 << endl; return 0; } ans = INF; fill(dep + 1, dep + 1000000 + 1, INF); for (int i = 1; i <= 1000; i++) { vector<int> save; dep[i] = 0, q.push(pair<int, int>{i, 0}); while (!q.empty()) { pair<int, int> x = q.front(); q.pop(); int u = x.first, pre = x.second; save.push_back(u); for (auto e : g[u]) { int v = e.first, id = e.second; if (id == pre) continue; if (dep[v] == INF) { dep[v] = dep[u] + 1; q.push(pair<int, int>{v, id}); } else ans = min(ans, dep[u] + dep[v] + 1); } } for (auto x : save) dep[x] = INF; } if (ans == INF) cout << -1 << endl; else cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2010; int n; int t[maxn], c[maxn]; long long d[maxn][maxn]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> t[i] >> c[i]; for (int i = 0; i < n + 1; i++) d[0][i] = 1ll << 62; d[0][0] = 0; for (int i = 1; i < n + 1; i++) { d[i][0] = 0; for (int j = 1; j < n + 1; j++) { d[i][j] = d[i - 1][j]; int tmp = max(0, j - t[i - 1] - 1); if (d[i - 1][tmp] + c[i - 1] < d[i][j]) d[i][j] = d[i - 1][tmp] + c[i - 1]; } } cout << d[n][n] << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int l[500000], r[500000]; long long a[500000]; int L, R; int n, q; int main() { scanf( %d%d , &n, &q); a[0] = 0; for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); for (int i = n; i >= 1; i--) a[i] = abs(a[i] - a[i - 1]); stack<int> S; for (int i = 2; i <= n; i++) { while (!S.empty() && a[i] >= a[S.top()]) { r[S.top()] = i - 1; S.pop(); } if (!S.empty()) l[i] = S.top() + 1; else l[i] = 2; S.push(i); } while (!S.empty()) { r[S.top()] = n; S.pop(); } while (q--) { scanf( %d%d , &L, &R); L++; long long ans = 0; for (int i = L; i <= R; i++) { ans += (long long)(i - max(L, l[i]) + 1) * (long long)(min(R, r[i]) - i + 1) * a[i]; } cout << ans << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; multiset<int> val[33]; long long sum[33]; int n = 0; int calc() { long long allsum = 0; int res = 0; for (int i = 0; i < 30; i++) { if (val[i].empty()) continue; if (allsum * 2 < *(val[i].begin())) res++; allsum += sum[i]; } return res; } int main() { int q; scanf( %d , &q); while (q--) { char s[2]; int x; scanf( %s%d , s, &x); int mn = 0; for (int i = 0; i < 30; i++) if (x >> i & 1) mn = i; if (s[0] == - ) { n--; sum[mn] -= x; val[mn].erase(val[mn].find(x)); } else { sum[mn] += x; val[mn].insert(x); n++; } printf( %d n , n - calc()); } return 0; } |
#include <bits/stdc++.h> using namespace std; namespace IO { const int sz = 1 << 20; char a[sz + 5], b[sz + 5], *p1 = a, *p2 = a, *t = b, p[105]; inline char gc() { return getchar(); if (p1 == p2) p2 = (p1 = a) + fread(a, 1, sz, stdin); return *p1++; } template <class T> inline T read() { T ret = 0; char c = gc(); int f = 1; for (; c < 0 || c > 9 ; c = gc()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; c = gc()) ret = ret * 10 + (c - 0 ); return ret * f; } template <class T> inline void read(T& ret) { ret = read<T>(); } inline void flush() { fwrite(b, 1, t - b, stdout), t = b; } inline void pc(char x) { *t++ = x; if (t - b == sz) flush(); } template <class T> inline void print(T x, char c = n ) { if (x < 0) x = -x, pc( - ); if (x == 0) pc( 0 ); int t = 0; for (; x; x /= 10) p[++t] = x % 10 + 0 ; for (; t; --t) pc(p[t]); pc(c); } struct F { ~F() { flush(); } } f; } // namespace IO using IO::print; using IO::read; const int mo = 1e9 + 7; inline int add(int a, int b) { return a + b < mo ? a + b : a + b - mo; } inline int dec(int a, int b) { return a < b ? a + mo - b : a - b; } inline int mul(int a, int b) { return 1LL * a * b % mo; } const int N = 1e3 + 10; int k; int c[N], s[N]; int C[N][N]; int f[N]; int main() { for (int i = 0; i <= 1000; i++) C[i][0] = C[0][i] = 1; C[0][0] = 0; for (int i = 1; i <= 1000; i++) for (int j = 1; j <= 1000; j++) C[i][j] = add(C[i - 1][j], C[i][j - 1]); read(k); for (int i = 1; i <= k; read(c[i]), s[i] = add(s[i - 1], c[i]), i++) ; f[1] = 1; for (int i = 2; i <= k; i++) f[i] = mul(f[i - 1], C[s[i - 1]][c[i] - 1]); print(f[k]); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, a[2000005], num[2000005], ans; long long ksm(long long x, long long y) { long long ans = 1, t = x; while (y) { if (y & 1) ans = ans * t % 1000000007; t = t * t % 1000000007; y >>= 1; } return ans; } int main() { scanf( %lld , &n); for (long long i = 1; i <= n; i++) { scanf( %lld , &a[i]); if (a[i] != -1) num[a[i]]++; } for (long long i = 1; i <= n; i++) { if (a[i] == -1) ans = (ans + ksm(2, num[i]) - 1 + 1000000007) % 1000000007; } printf( %lld , (ksm(2, n - 1) - 1 - ans + 1000000007) % 1000000007); } |
#include <bits/stdc++.h> using namespace std; const int N = 100010, M = N * 2, mod = 1e9 + 7; const double PI = acos(-1.0), eps = 1e-6; int T, n, m, k, c1, c2; int a[N * 10], b[N], tot, cnt[N], s[N * 10], ans; map<int, int> mp; vector<int> v; string g[N * 10]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) cin >> g[i]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (i - 1 >= 0 && g[i - 1][j] == X && j - 1 >= 0 && g[i][j - 1] == X ) a[j + 1] = 1; for (int i = 1; i <= m; i++) s[i] = s[i - 1] + a[i]; int q; cin >> q; while (q--) { int l, r; cin >> l >> r; if (s[r] - s[l] > 0) cout << NO << n ; else cout << YES << n ; } return 0; } |
#include <bits/stdc++.h> inline void cmin(int &a, int b) { if (b < a) a = b; } int a[1000005], f[1 << 21]; int main() { int n, i, now, ans, l, j, k; char s[22]; for (scanf( %d , &n), i = 0; i < n; i++) { scanf( %s , s); for (a[i] = j = 0; s[j]; j++) a[i] = (a[i] << 1) + s[j] - 0 ; } memset(f, 1, sizeof f); for (f[0] = 0, ans = l = strlen(s), i = 1; i < n; i++) { for (k = 0; (a[i - 1] & (1 << l - k) - 1) != (a[i] >> k); k++) ; ans += k; for (now = 1 << 25, j = 0; j <= l; j++) cmin(now, f[(1 << l - j) - 1 + (a[i] >> j)] + j); for (now -= k, j = 0; j <= l; j++) cmin(f[(1 << j) - 1 + (a[i - 1] & (1 << j) - 1)], now); } for (now = i = 0; i < 1 << 21; i++) cmin(now, f[i]); printf( %d n , ans + now); return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, bool> mapa; long long _abs(long long a) { if (a >= 0) return a; else return -a; } int main() { long long b1, q, l, m; cin >> b1 >> q >> l >> m; for (int i = 0; i < m; i++) { long long a; cin >> a; mapa[a] = 1; } if (b1 == 0LL) { if (!mapa.count(0)) cout << inf n ; else cout << 0 n ; return 0; } if (q == 0LL) { if (_abs(b1) > l) cout << 0 n ; else if (!mapa.count(0)) cout << inf n ; else if (!mapa.count(b1)) cout << 1 n ; else cout << 0 n ; return 0; } else if (q == 1LL) { if (_abs(b1) <= l && !mapa.count(b1)) cout << inf n ; else cout << 0 n ; return 0; } else if (q == -1LL) { if (_abs(b1) > l) cout << 0 n ; else if (!mapa.count(b1) || !mapa.count(-b1)) cout << inf n ; else cout << 0 n ; return 0; } long long val = b1; int cont = 0; while (_abs(val) <= l) { if (!mapa.count(val)) cont++; val *= q; } cout << cont << n ; } |
#include <bits/stdc++.h> using namespace std; int n, k, p; int tot, head[100010], next1[100010 << 1], to[100010 << 1]; int deep[100010], cnt[100010]; void add(int x, int y) { to[++tot] = y; next1[tot] = head[x]; head[x] = tot; } void dfs(int x, int f) { deep[x] = deep[f] + 1; cnt[deep[x]]++; for (int i = head[x]; i; i = next1[i]) { int y = to[i]; if (y == f) continue; dfs(y, x); } } int main() { scanf( %d%d%d , &n, &k, &p); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y); add(y, x); } dfs(1, 0); sort(deep + 1, deep + n + 1); int l = 2, r = 2, ans = 1, tmp = 0; while (1) { if (l >= n || r >= n) break; r++; if (deep[r] != deep[r - 1]) tmp += (r - l); while (tmp > p || r - l + 1 > k) { tmp -= (deep[r] - deep[l]); l++; } ans = max(ans, (r - l + 1)); } printf( %d , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int k, b, n; cin >> k >> b >> n; map<int, int> freq; freq[0]++; int cont_zeros = 0; int cur_mod = 0; long long total_zeros = 0; long long total_mod = 0; for (int i = 0; i < n; ++i) { int u; cin >> u; if (u == 0) { cont_zeros++; total_zeros += cont_zeros; } else { cont_zeros = 0; } cur_mod = (cur_mod + u) % (k - 1); int tt = (k - 1 + cur_mod - b) % (k - 1); total_mod += freq[tt]; freq[cur_mod]++; } if (b == 0) { cout << total_zeros << n ; } else if (b == k - 1) { cout << total_mod - total_zeros << n ; } else { cout << total_mod << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } const int N = 1E5 + 5; long long n, l, r, ql, qr; long long arr[N], pre[N]; int main() { fast(); cin >> n >> l >> r >> ql >> qr; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int i = 1; i <= n; ++i) { pre[i] = arr[i] + pre[i - 1]; } long long mini = min(pre[n] * l + (ql * (n - 1)), pre[n] * r + (qr * (n - 1))); for (int i = 1; i <= n; ++i) { long long x = (pre[i] * l) + ((pre[n] - pre[i]) * r); int takenL = i, takenR = n - i; if (takenL < takenR) { x += (takenR - takenL - 1) * qr; } else if (takenR < takenL) x += (takenL - takenR - 1) * ql; mini = min(mini, x); } cout << mini << n ; } |
#include <bits/stdc++.h> using namespace std; struct node { bool w, l; int a[26]; node() { w = false; l = false; memset(a, -1, sizeof a); } }; node a[100030]; long long cnt; char second[100010]; void insert(long long n) { int curr = 0; int i = 0; while (curr < n) { if (a[i].a[second[curr] - a ] == -1) { a[i].a[second[curr] - a ] = ++cnt; } i = a[i].a[second[curr] - a ]; curr++; } } void dfs(long long curr) { if (curr == -1) { return; } int cnt = 0; for (int i = 0; i < 26; i++) { if (a[curr].a[i] != -1) { cnt++; dfs(a[curr].a[i]); if (a[a[curr].a[i]].w == false) { a[curr].w = true; } if (a[a[curr].a[i]].l == false) { a[curr].l = true; } } } if (cnt == 0) { a[curr].w = false; a[curr].l = true; } } int main() { long long n, k; cnt = 0; cin >> n >> k; for (int i = 0; i < n; i++) { scanf( %s , second); insert(strlen(second)); } dfs(0); if (a[0].w == true && a[0].l == true) { cout << First << endl; } else if (a[0].w == false) { cout << Second << endl; } else if (a[0].w == true && a[0].l == false) { if (k % 2 == 1) { cout << First << endl; } else { cout << Second << endl; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; struct point { int x, y; } s[N], t[N]; vector<int> q[2]; int cntx, cnty, vis[N], n, now, dis[N], S, ax[N], ay[N]; set<pair<int, int> > a[N]; set<pair<int, int> >::iterator it; int lowbit(int x) { return x & (-x); } void upd(int x, pair<int, int> y) { while (x <= cntx) { a[x].insert(y); x += lowbit(x); } } void get(int x, int y, int id) { while (x) { it = a[x].begin(); for (pair<int, int> i : a[x]) { if (i.first > y) break; it++; if (vis[i.second]) continue; q[now].push_back(i.second); vis[i.second] = id; } a[x].erase(a[x].begin(), it); x -= lowbit(x); } } void bfs(int d) { if (!q[now].size()) return; if (vis[n]) return; now ^= 1; q[now].clear(); for (int x : q[now ^ 1]) get(t[x].x, t[x].y, x); for (int x : q[now]) dis[x] = d; bfs(d + 1); } int main() { scanf( %d , &n); memset(dis, 0x3f, sizeof(dis)); for (int i = 1; i <= n; i++) { scanf( %d%d%d%d , &s[i].x, &s[i].y, &t[i].x, &t[i].y); if (s[i].x == 0 && s[i].y == 0) { q[0].push_back(i); dis[i] = 1, vis[i] = -1; } ax[++cntx] = s[i].x, ax[++cntx] = t[i].x; ay[++cnty] = s[i].y, ay[++cnty] = t[i].y; } sort(ax + 1, ax + cntx + 1); sort(ay + 1, ay + cnty + 1); cntx = unique(ax + 1, ax + cntx + 1) - ax - 1; cnty = unique(ay + 1, ay + cnty + 1) - ay - 1; for (int i = 1; i <= n; i++) { s[i].x = lower_bound(ax + 1, ax + cntx + 1, s[i].x) - ax; s[i].y = lower_bound(ay + 1, ay + cnty + 1, s[i].y) - ay; upd(s[i].x, make_pair(s[i].y, i)); t[i].x = lower_bound(ax + 1, ax + cntx + 1, t[i].x) - ax; t[i].y = lower_bound(ay + 1, ay + cnty + 1, t[i].y) - ay; } now = 0; bfs(2); if (!vis[n]) puts( -1 ); else { printf( %d n , dis[n]); int x = n, cnt = 0, ans[N]; while (x != -1) { ans[++cnt] = x; x = vis[x]; } for (int i = cnt; i >= 1; i--) printf( %d , ans[i]); } } |
#include <bits/stdc++.h> using namespace std; const int N = 100005; const long long M = 1000000007; const long double PI = acos((long double)-1.0); template <typename T> struct SegmentTree { T data[N << 2]; T calc(const T &x, const T &y) const { return max(x, y); } void push_up(int rt) { data[rt] = calc(data[rt << 1], data[rt << 1 | 1]); } void build(int l, int r, int rt) { data[rt] = 0; if (l == r) { return; } int m = (l + r) >> 1; build(l, m, rt << 1); build(m + 1, r, rt << 1 | 1); } void update(int p, T val, int l, int r, int rt) { if (l == r) { data[rt] = val; return; } int m = (l + r) >> 1; if (p <= m) { update(p, val, l, m, rt << 1); } else { update(p, val, m + 1, r, rt << 1 | 1); } push_up(rt); } T query(int L, int R, int l, int r, int rt) { if (L > R) { return 0; } if (L <= l && r <= R) { return data[rt]; } int m = (l + r) >> 1; T ret = 0; if (L <= m) { ret = calc(ret, query(L, R, l, m, rt << 1)); } if (m < R) { ret = calc(ret, query(L, R, m + 1, r, rt << 1 | 1)); } return ret; } }; SegmentTree<long long> st; int n; struct Node { long long v; int id; } a[N]; bool cmp(const Node &a, const Node &b) { return a.v < b.v || (a.v == b.v && a.id > b.id); } int main() { while (~scanf( %d , &n)) { for (int i = 1; i <= n; i++) { long long r, h; scanf( %I64d%I64d , &r, &h); a[i].v = r * r * h; a[i].id = i; } sort(a + 1, a + n + 1, cmp); st.build(1, n, 1); long long ans = a[0].v; for (int i = 1; i <= n; i++) { long long val = st.query(1, a[i].id - 1, 1, n, 1); st.update(a[i].id, val + a[i].v, 1, n, 1); ans = max(ans, val + a[i].v); } printf( %.10f n , double(PI * ans)); } } |
#include <bits/stdc++.h> using namespace std; const long long N = 1e6 + 1ll; long long lim = 0, Ans = 0; struct Plan { long long pos; long long c, p; } a[N]; struct Tree { long long c, p; Tree() { c = p = 0; }; } t[N << 2ll]; struct Acht { long long a, b; Acht() { a = b = 0; }; }; bool ctrl(Plan u, Plan v) { return u.pos < v.pos; } inline void pushup(long long u) { t[u].c = t[u << 1ll].c + t[u << 1ll | 1ll].c; t[u].p = t[u << 1ll].p + t[u << 1ll | 1ll].p; } void update(long long u, long long l, long long r, long long pos) { if (l == r && l == a[pos].p) { t[u].c += a[pos].c; t[u].p += a[pos].c * a[pos].p; return; } long long mid = (l + r) >> 1ll; if (a[pos].p <= mid) update(u << 1ll, l, mid, pos); else update(u << 1ll | 1ll, mid + 1ll, r, pos); pushup(u); } Acht query(long long u, long long l, long long r, long long rnk) { if (l == r) { Acht res; if (rnk == t[u].c) res.a = l; else res.a = l - 1ll, res.b = l * rnk; return res; } if (t[u].c == rnk) { Acht res; res.a = r; return res; } long long mid = (l + r) >> 1ll; if (t[u << 1ll].c >= rnk) return query(u << 1ll, l, mid, rnk); return query(u << 1ll | 1ll, mid + 1ll, r, rnk - t[u << 1ll].c); } long long query(long long u, long long l, long long r, long long a, long long b) { if (a <= l && r <= b) return t[u].p; long long mid = (l + r) >> 1ll; long long res = 0; if (a <= mid) res += query(u << 1ll, l, mid, a, b); if (b > mid) res += query(u << 1ll | 1ll, mid + 1ll, r, a, b); return res; } signed main() { long long n, k, m; scanf( %lld%lld%lld , &n, &k, &m); for (long long i = 1ll; i <= m; ++i) { long long y = i << 1ll, x = y - 1ll; scanf( %lld%lld%lld%lld , &a[x].pos, &a[y].pos, &a[x].c, &a[x].p); a[y].pos++, a[y].c = -a[x].c, a[y].p = a[x].p; lim = max(lim, a[x].p); } sort(a + 1ll, a + (m << 1ll | 1ll), ctrl); update(1ll, 1ll, lim, 1ll); for (long long i = 2; i <= (m << 1ll); ++i) { long long itv = a[i].pos - a[i - 1ll].pos; if (t[1ll].c <= k) Ans += t[1ll].p * itv; else { Acht tmp = query(1ll, 1ll, lim, k); long long res = tmp.b; if (tmp.a) res += query(1ll, 1ll, lim, 1ll, tmp.a); Ans += res * itv; } update(1ll, 1ll, lim, i); } printf( %lld , Ans); return 0; } |
#include <bits/stdc++.h> using namespace std; struct s { int x; int y; int str; s(int a, int b, int st) { x = a; y = b; str = st; } }; bool func(s x, s y) { return x.str > y.str; } int main() { int n; cin >> n; vector<s> v; for (int i = 2; i <= 2 * n; i++) { for (int j = 1; j < i; j++) { int d; cin >> d; v.push_back(s(i, j, d)); } } sort(v.begin(), v.end(), func); map<int, int> m; for (int i = 0; i < v.size(); i++) { if (m.find(v[i].x) != m.end() || m.find(v[i].y) != m.end()) { continue; } m[v[i].x] = v[i].y; m[v[i].y] = v[i].x; } for (int i = 1; i <= 2 * n; i++) { cout << m[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T read1() { T t = 0; bool vis = 0; char k; do (k = getchar()) == - && (vis = 1); while ( 0 > k || k > 9 ); while ( 0 <= k && k <= 9 ) t = (t << 3) + (t << 1) + (k ^ 0 ), k = getchar(); return vis ? -t : t; } vector<long long> x[500005]; vector<pair<int, int> > G[500005]; int s, k; long long dfs(int n, int f) { long long t = 0; for (int i = 0; i < G[n].size(); ++i) if (G[n][i].first ^ f) { long long o = dfs(G[n][i].first, n); t += o; x[n].back() += G[n][i].second - o; } sort(x[n].begin(), x[n].end()); reverse(x[n].begin(), x[n].end()); int j = 0; while (j + 1 < k && j < x[n].size() && x[n][j] > 0) t += x[n][j++]; x[f].push_back(t); if (j < x[n].size() && x[n][j] > 0) t += x[n][j]; return t; } int main() { for (int T = read1<int>(); T--;) { s = read1<int>(), k = read1<int>(); for (int i = 0; i <= s; ++i) G[i].clear(), x[i].clear(); for (int i = 1; i < s; ++i) { int u = read1<int>(), v = read1<int>(), t = read1<int>(); G[u].push_back(make_pair(v, t)); G[v].push_back(make_pair(u, t)); } printf( %lld n , dfs(1, 0)); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b, ans; while (cin >> a >> b) { if (a == 0 && b == 0) cout << NO << endl; else { ans = abs(a - b); if (ans <= 1) cout << YES << endl; else cout << NO << endl; } } } |
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } inline int readChar(); template <class T = int> inline T readInt(); template <class T> inline void writeInt(T x, char end = 0); inline void writeChar(int x); inline void writeWord(const char *s); static const int buf_size = 4096; inline int getChar() { static char buf[buf_size]; static int len = 0, pos = 0; if (pos == len) { pos = 0, len = fread(buf, 1, buf_size, stdin); } if (pos == len) { return -1; } return buf[pos++]; } inline int readChar() { int c = getChar(); while (c <= 32) { c = getChar(); } return c; } template <class T> inline T readInt() { int s = 1, c = readChar(); T x = 0; if (c == - ) s = -1, c = getChar(); while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); return s == 1 ? x : -x; } static int write_pos = 0; static char write_buf[buf_size]; inline void writeChar(int x) { if (write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0; write_buf[write_pos++] = x; } template <class T> inline void writeInt(T x, char end) { if (x < 0) writeChar( - ), x = -x; char s[24]; int n = 0; while (x || !n) s[n++] = 0 + x % 10, x /= 10; while (n--) writeChar(s[n]); if (end) writeChar(end); } inline void writeWord(const char *s) { while (*s) writeChar(*s++); } struct Flusher { ~Flusher() { if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0; } } flusher; const int MAXN = 100228; const int MAXK = 10; const double eps = 1e-7; struct point { int x, y; }; point v[MAXK]; struct query { double a; int x, y, z; }; query w[MAXN * 2]; bool compv(const point &a, const point &b) { return atan2(a.y, a.x) < atan2(b.y, b.x); } bool compw(const query &a, const query &b) { return (fabs(a.a - b.a) < eps ? a.z < b.z : a.a < b.a); } int a[MAXN], c[MAXN]; int cn, sx, sy; int px[MAXN], py[MAXN], t[MAXN]; long long ans[MAXN], s[MAXN]; inline void add(int k, int x) { for (; k <= MAXN; k += k & -k) { s[k] += x; } } int x[MAXN], y[MAXN]; long long sum(int k) { long long res = 0; for (; k; k -= k & -k) { res += s[k]; } return res; } int main() { int k = readInt(), n = readInt(), q = readInt(); for (int i = 1; i <= k; i++) { v[i].x = readInt(); v[i].y = readInt(); if (v[i].x < 0) { v[i].x = -v[i].x; v[i].y = -v[i].y; } if (!v[i].x && v[i].y < 0) { v[i].y = -v[i].y; } sx += v[i].x, sy += v[i].y; } sort(v + 1, v + k + 1, compv); for (int i = 1; i <= n; i++) { c[i] = x[i] = readInt(), y[i] = readInt(), a[i] = readInt(); } sort(c + 1, c + n + 1); cn = unique(c + 1, c + n + 1) - c - 1; for (int i = 1; i <= q; i++) { px[i] = readInt(), py[i] = readInt(), t[i] = readInt(); px[i] -= sx * t[i]; py[i] -= sy * t[i]; t[i] <<= 1; } for (int i = 1; i <= k; i++) { if (!v[i].x) { for (int j = 1; j <= q; j++) { py[j] += v[i].y * t[j]; } continue; } for (int j = 1; j <= n; j++) { w[j] = (query){y[j] - (double)x[j] * v[i].y / v[i].x, x[j], a[j], 0}; } for (int j = 1; j <= q; j++) { w[n + j] = (query){py[j] - (double)px[j] * v[i].y / v[i].x, px[j], px[j] + v[i].x * t[j], -j}, px[j] += v[i].x * t[j]; py[j] += v[i].y * t[j]; } sort(w + 1, w + n + q + 1, compw); memset(s, 0, sizeof(s)); for (int j = 1; j <= n + q; j++) { if (w[j].z) { ans[-w[j].z] -= sum((upper_bound(c + 1, c + cn + 1, w[j].y) - c - 1)) - sum((upper_bound(c + 1, c + cn + 1, w[j].x - (i < 2)) - c - 1)); } else { add((upper_bound(c + 1, c + cn + 1, w[j].x) - c - 1), w[j].y); } } } for (int i = 1; i <= k; i++) { if (!v[i].x) { break; } for (int j = 1; j <= n; j++) { w[j] = (query){y[j] - (double)x[j] * v[i].y / v[i].x, x[j], a[j], 0}; } for (int j = 1; j <= q; j++) { w[n + j] = (query){py[j] - (double)px[j] * v[i].y / v[i].x, px[j] - v[i].x * t[j], px[j], j}, px[j] -= v[i].x * t[j], py[j] -= v[i].y * t[j]; } sort(w + 1, w + n + q + 1, compw); memset(s, 0, sizeof(s)); for (int j = 1; j <= n + q; j++) { if (w[j].z) { ans[w[j].z] += sum((upper_bound(c + 1, c + cn + 1, w[j].y - (i > 1)) - c - 1)) - sum((upper_bound(c + 1, c + cn + 1, w[j].x - 1) - c - 1)); } else { add((upper_bound(c + 1, c + cn + 1, w[j].x) - c - 1), w[j].y); } } } for (int i = 1; i <= q; i++) { writeInt(ans[i], n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; int number_of_ones = 0; string binary_string; cin >> n >> binary_string; for (int i = 0; i < n; i++) { if (binary_string[i] == 1 ) number_of_ones++; if (binary_string[i] == 0 ) { cout << number_of_ones; number_of_ones = 0; } } cout << number_of_ones << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18 + 1e17; const long long mod = 1e9 + 7; long long modInverse(long long a, long long m) { long long m0 = m; long long y = 0, x = 1; if (m == 1) return 0; while (a > 1) { long long q = a / m; long long t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } long long powm(long long a, long long b) { a = a % mod; long long res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return (res % mod); } const long long N = 3e5 + 6; struct st { long long a, b, c, d; }; bool comp(st x, st y) { return x.a < y.a; } long long arr[N][2]; long long n, m; vector<pair<long long, long long> > graph[N]; bool vis[N]; long long ans = 0; void dijk(long long pos, long long par, long long f) { for (pair<long long, long long> i : graph[pos]) if (i.first != par) { arr[i.first][f] = arr[pos][f] + i.second; dijk(i.first, pos, f); } } void sol() { vector<st> v; multiset<long long> s; for (long long i = 0; i < n; i++) { v.push_back({arr[i][0] - arr[i][1], arr[i][0], arr[i][1], i}); s.insert(arr[i][1]); } sort(v.begin(), v.end(), comp); for (long long i = 0; i < n - 1; i++) { s.erase(s.find(v[i].c)); vector<long long> va; for (pair<long long, long long> j : graph[v[i].d]) { if (s.find(arr[j.first][1]) != s.end()) { s.erase(s.find(arr[j.first][1])); va.push_back(arr[j.first][1]); } } if (s.size() != 0) ans = max(v[i].b + (*s.rbegin()), ans); for (long long j : va) s.insert(j); } } void solve() { cin >> n >> m; for (long long i = 0; i < n; i++) { arr[i][0] = inf; arr[i][1] = inf; } for (long long i = 0; i < n - 1; i++) { long long aa, bb, cc; cin >> aa >> bb >> cc; aa--; bb--; graph[aa].push_back(make_pair(bb, cc)); graph[bb].push_back(make_pair(aa, cc)); } memset(vis, 0, sizeof(vis)); arr[0][0] = 0; arr[n - 1][1] = 0; dijk(0, -1, 0); dijk(n - 1, -1, 1); sol(); for (long long i = 0; i < m; i++) { long long x; cin >> x; cout << (min(arr[0][1], ans + x)) << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long t = 1; for (long long i = 1; i <= t; i++) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 1000000; double ans, T, sumb, sumc; int n, nb, nc; struct node { double x, y; bool operator<(const node &a) const { return y < a.y; } } a[N], b[N], c[N]; int main() { scanf( %d%lf , &n, &T); for (int i = 1; i <= n; i++) scanf( %lf , &a[i].x); for (int i = 1; i <= n; i++) scanf( %lf , &a[i].y); sort(a + 1, a + 1 + n); for (int i = 1; i <= n; i++) if (a[i].y < T) b[++nb] = (node){a[i].x, T - a[i].y}, sumb = sumb + b[nb].x * b[nb].y; else if (a[i].y == T) ans = ans + a[i].x; else if (a[i].y > T) c[++nc] = (node){a[i].x, a[i].y - T}, sumc = sumc + c[nc].x * c[nc].y; for (int i = 1; i < nb / 2; i++) swap(b[i], b[nb - i + 1]); double x = min(sumb, sumc); for (int i = 1; i <= nb; i++) if (x > 1e-12) { double y = min(b[i].x, x / b[i].y); ans += y; x -= y * b[i].y; } x = min(sumb, sumc); for (int i = 1; i <= nc; i++) if (x > 1e-12) { double y = min(c[i].x, x / c[i].y); ans += y; x -= y * c[i].y; } printf( %.12lf n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, d, e, k[30]; string s; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> a >> s; for (b = 1; b < a; b++) { if (s[b] < s[b - 1]) { cout << YES << endl; cout << b << << b + 1; return 0; } } cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 3, M = 3e4 + 4, inf = 2e9 + 1; int m, n, s, t, cur, tim, mn; int low[N], dfn[N], vis[N], cst[M]; vector<pair<int, int> > vt[N]; vector<int> pat, rut, ans; bool dfs(int u) { vis[u] = 1; if (u == t) return 1; for (int i = 0; i < vt[u].size(); i++) { int v = vt[u][i].first; int id = vt[u][i].second; if (!vis[v] && dfs(v)) { pat.push_back(id); return 1; } } return 0; } bool tarjan(int u, int p = -1) { vis[u] = 1; bool cap = u == t; low[u] = dfn[u] = ++tim; for (int i = 0; i < vt[u].size(); i++) { int v = vt[u][i].first; int id = vt[u][i].second; if (id == cur || id == p) continue; if (vis[v]) low[u] = min(low[u], dfn[v]); else { bool flag = tarjan(v, id); cap = flag || cap; low[u] = min(low[u], low[v]); if (flag && low[v] == dfn[v]) rut.push_back(id); } } return cap; } int main() { scanf( %d%d%d%d , &n, &m, &s, &t); for (int i = 1; i < m + 1; i++) { int u, v, w; scanf( %d%d%d , &u, &v, &w); vt[u].push_back(make_pair(v, i)); vt[v].push_back(make_pair(u, i)); cst[i] = w; } if (!dfs(s)) { puts( 0 n0 n ); return 0; } mn = inf; for (int i = 0; i < pat.size(); i++) { cur = pat[i]; tim = 0; memset(vis, 0, sizeof(vis)); rut.clear(); if (!tarjan(s)) if (mn > cst[cur]) { mn = cst[cur]; ans.clear(); ans.push_back(cur); } for (int j = 0; j < rut.size(); j++) { int sec = rut[j]; if (mn > cst[sec] + cst[cur]) { mn = cst[sec] + cst[cur]; ans.clear(); ans.push_back(cur); ans.push_back(sec); } } } if (mn == inf) { puts( -1 ); return 0; } int len = ans.size(); printf( %d n%d n%d , mn, len, ans[0]); if (len > 1) printf( %d n , ans[1]); else puts( ); } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k, l, c, d, p, nl, nd, np, min = 0, totl, totp, res; cin >> n >> k >> l >> c >> d >> p >> nl >> np; nd = d * c; totl = (k * l) / nl; totp = p / np; if (totl <= nd && totl <= totp) min = totl; else if (nd <= totl && nd <= totp) min = nd; else if (totp <= totl && totp <= nd) min = totp; res = min / n; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; void __print(int x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << x; } void __print(const char *x) { cerr << x; } void __print(const string &x) { cerr << x; } void __print(bool x) { cerr << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cerr << { ; __print(x.first); cerr << , ; __print(x.second); cerr << } ; } template <typename T> void __print(const T &x) { int f = 0; cerr << { ; for (auto &i : x) { cerr << (f++ ? , : ); __print(i); } cerr << } ; } void _print() { cerr << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) { cerr << , ; } _print(v...); } string go(long long i, long long n, long long dist, string nw, long long k, string ori) { ; if (dist > k) { return ; } if (nw.substr(0, i) < ori.substr(0, i)) { return ; } if (i >= n) { return nw; } for (char val = 0 ; val <= 9 ; ++val) { nw[i] = val; bool found = false; for (long long j = 0; j < i; ++j) { if (nw[j] == val) { found = true; break; } } string chk = go(i + 1, n, dist + (found == false), nw, k, ori); if ((long long)chk.size()) { return chk; } } return ; } void solve() { long long n, k; cin >> n >> k; string s = to_string(n); long long dist = 0; map<char, long long> g; for (auto ch : s) { g[ch]++; } string ans = go(0, (long long)s.size(), 0, string((long long)s.size(), 0 ), k, s); cout << ans << n ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t = 1; cin >> t; while (t--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> a; int64_t func(int64_t c) { int64_t cost = 0, pc = 1; for (int ai : a) { long long diff = ai - pc; cost += abs(diff); if (pc > LLONG_MAX / c) return LLONG_MAX; pc *= c; } return cost; } int main(void) { int n; cin >> n; int64_t ans = 0; a.resize(n); for (int& ai : a) { cin >> ai; ans += abs(ai - 1); } sort(a.begin(), a.end()); int64_t l = 2, r = 1e5; while (r - l > 3) { int64_t m1 = l + (r - l) / 3; int64_t m2 = r - (r - l) / 3; int64_t c1 = func(m1); int64_t c2 = func(m2); ans = min(ans, c1); ans = min(ans, c2); if (c1 > c2) l = m1; else r = m2; } for (int64_t i = l; i <= r; i++) ans = min(ans, func(i)); cout << ans << n ; } |
#include <iostream> using namespace std; const int N = 210; int a[N]; int main() { int t,i,j,k,n,s1=0,s0=0; cin >> t; while(t--) { cin>>n; s1=0;s0=0; for(i=0;i<2*n;i++) cin>>a[i]; for(i=0;i<2*n;i++) { if(a[i]%2==1)s1++; else s0++; } if(s1==s0)puts( Yes n ); else puts( No n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mxn = 1e5 + 7; int main() { int n, a[mxn], q, l[mxn], r[mxn], x; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { if (i == 1) { l[i] = 1; r[i] = a[i]; } else { l[i] = r[i - 1] + 1; r[i] = a[i] + r[i - 1]; } } cin >> q; for (int i = 1; i <= q; i++) { int l1 = 0, r1 = n, x; cin >> x; while (r1 - l1 > 1) { int m = (l1 + r1) >> 1; if (r[m] >= x) r1 = m; else l1 = m; } cout << r1 << endl; } } |
#include <bits/stdc++.h> using namespace std; int xs[2123], ys[2123], bs[2123]; long long fat[2123], prefix[2123][2123]; long long fatinv[2123]; long long sum(int row1, int row2, int col1, int col2) { if (row1 > row2 || col1 > col2) return 0ll; row2 = min(row2, 2000); col2 = min(col2, 2000); --row1, --col1; if (row1 < 0) row1 = 0; if (col1 < 0) col1 = 0; if (row2 <= row1 or col2 <= col1) return 0ll; return prefix[row2][col2] - prefix[row2][col1] - prefix[row1][col2] + prefix[row1][col1]; } long long sumR(int i, int r) { return sum(xs[i] - r, xs[i] + r, ys[i] - r, ys[i] + r); } long long fastexp(long long a, long long b, long long m) { long long r = 1; for (a %= m; b; b >>= 1, a = (a * a) % m) if (b & 1) r = (r * a) % m; return r; } long long comb(int n, int k) { if (n < k) return 0ll; return (((fat[n] * fatinv[k]) % 1000000007) * fatinv[n - k]) % 1000000007; } int main() { fat[0] = 1; for (int i = 1; i < 2123; ++i) fat[i] = (fat[i - 1] * i) % 1000000007; int n, m, r; cin >> n >> m >> r; for (int i = 0; i < 2123; ++i) fatinv[i] = fastexp(fat[i], 1000000007 - 2, 1000000007); for (int i = 0; i < n; ++i) { cin >> xs[i] >> ys[i] >> bs[i]; prefix[xs[i]][ys[i]] = 1; } for (int i = 1; i < 2123; ++i) { for (int j = 1; j < 2123; ++j) { prefix[i][j] += prefix[i - 1][j] + prefix[i][j - 1] - prefix[i - 1][j - 1]; } } long long resp = 0ll; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { int row1 = xs[i] - r; int row2 = xs[i] + r; int col1 = ys[i] - r; int col2 = ys[i] + r; row1 = max(row1, xs[j] - r); row2 = min(row2, xs[j] + r); col1 = max(col1, ys[j] - r); col2 = min(col2, ys[j] + r); long long s = sum(row1, row2, col1, col2); long long si = sumR(i, r); long long sj = sumR(j, r); long long diff = si + sj - s; long long count = (((comb(n, m) - comb(n - si, m) - comb(n - sj, m) + comb(n - diff, m)) % 1000000007) * bs[i]) % 1000000007; resp = (resp + (count * bs[j]) % 1000000007) % 1000000007; } } if (resp < 0) resp += 1000000007; cout << resp << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int a[10], flag[200]; int main() { int sum = 0; for (int i = 1; i <= 5; i++) { cin >> a[i]; sum += a[i]; flag[a[i]]++; } int ans = sum; for (int i = 1; i <= 5; i++) { if (flag[a[i]] > 1 && flag[a[i]] < 4) ans = min(ans, sum - flag[a[i]] * a[i]); else if (flag[a[i]] > 3) { ans = min(ans, sum - 3 * a[i]); } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; namespace p316GGoodSubstrings { template <size_t MAXLEN, size_t ALPHABET> struct SuffixAutomaton { struct Node { Node *child[ALPHABET], *suff, *next; int len, cnt; }; Node pool[2 * MAXLEN], *root, *nextnode, *last, *first[MAXLEN + 1]; Node* makenode(int length) { memset(nextnode, 0, sizeof(Node)); nextnode->len = length; return nextnode++; } void init() { nextnode = pool; last = root = makenode(0); memset(first, 0, sizeof(first)); } void extend(int ch) { Node *p = last, *cur = makenode(p->len + 1); cur->cnt = 1; for (; p != NULL && p->child[ch] == NULL; p = p->suff) p->child[ch] = cur; if (p == NULL) cur->suff = root; else { Node* q = p->child[ch]; if (p->len + 1 == q->len) cur->suff = q; else { Node* copy = makenode(p->len + 1); memcpy(copy->child, q->child, sizeof(q->child)); copy->suff = q->suff; q->suff = cur->suff = copy; for (; p != NULL && p->child[ch] == q; p = p->suff) p->child[ch] = copy; } } last = cur; } void go() { for (Node* i = pool; i < nextnode; i++) { i->next = first[i->len]; first[i->len] = i; } for (int len = MAXLEN; len > 0; len--) for (Node* i = first[len]; i != NULL; i = i->next) i->suff->cnt += i->cnt; } }; struct TNode { TNode* ch[26]; bool bad; TNode() : bad(false) { memset(ch, 0, sizeof(ch)); } }; SuffixAutomaton<55555, 26> sam; TNode* root; char str[55555]; int l, r, res = 0; void go(TNode* at, SuffixAutomaton<55555, 26>::Node* cur) { int cnt = cur ? cur->cnt : 0; if (cnt < l || cnt > r) at->bad = true; for (int c = 0; c < 26; c++) if (at->ch[c] != NULL) go(at->ch[c], cur && cur->child[c] ? cur->child[c] : NULL); } void dfs(TNode* at) { if (!at->bad) res++; for (int c = 0; c < 26; c++) if (at->ch[c]) dfs(at->ch[c]); } void solve(int test_num) { root = new TNode(); scanf( %s , str); int len = strlen(str); for (int i = 0; i < len; i++) { TNode* at = root; for (int j = i, c; j < len; j++) { c = str[j] - a ; if (at->ch[c] == NULL) at->ch[c] = new TNode(); at = at->ch[c]; } } int cnt; scanf( %d , &cnt); for (int q = 0; q < cnt; q++) { scanf( %s %d %d , str, &l, &r); sam.init(); for (int i = 0; str[i] > ; i++) sam.extend(str[i] - a ); sam.go(); go(root, sam.root); } dfs(root); if (!root->bad) res--; cout << res << endl; } void solve() { solve(1); } } // namespace p316GGoodSubstrings int main() { p316GGoodSubstrings::solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3f; const int mod = 1e9 + 7; const double PI = acos(-1.0); const double eps = 1e-10; const int N = 3e5 + 5; int n, m, d[N]; vector<pair<int, int> > g[N]; vector<int> vec; bool vis[N]; void dfs(int u) { vis[u] = true; for (auto &e : g[u]) { int &v = e.first; if (vis[v]) continue; dfs(v); if (d[v] == 1) { if (~d[u]) d[u] ^= 1; d[v] = 0, vec.push_back(e.second); } } } int main() { scanf( %d %d , &n, &m); int s = 1; for (int i = 1; i <= n; i++) { scanf( %d , d + i); if (d[i] == -1) s = i; } for (int i = 1, u, v; i <= m; i++) { scanf( %d %d , &u, &v); g[u].push_back(pair<int, int>(v, i)); g[v].push_back(pair<int, int>(u, i)); } dfs(s); if (~d[s] && d[s]) { puts( -1 ); return 0; } printf( %d n , vec.size()); for (int id : vec) printf( %d n , id); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &x) { x = 0; char ch = getchar(); int fh = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) fh = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } x *= fh; } struct Onfo { int nu, ne; } a[200010 * 2]; struct Info { int x, t, we, an; } v[200010]; struct seg { int l, r, ma, ta, de; } t[200010 * 4]; int b[200010], num, m, n, x, so[200010], si[200010], d[200010], f[200010], tp[200010], bi[200010], fb[200010]; vector<int> no; bool co(const Info &a, const Info &b) { if (a.t + d[a.x] != b.t + d[b.x]) return a.t + d[a.x] < b.t + d[b.x]; return a.x < b.x; } bool c1(const Info &a, const Info &b) { return a.we < b.we; } void jb(int x, int y) { a[++num].nu = y; a[num].ne = b[x]; b[x] = num; } void dfs(int x, int fa, int dep) { si[x] = 1; so[x] = 0; f[x] = fa; d[x] = dep; for (int y = b[x]; y; y = a[y].ne) { if (a[y].nu != fa) { dfs(a[y].nu, x, dep + 1); si[x] += si[a[y].nu]; if (si[a[y].nu] > si[so[x]]) so[x] = a[y].nu; } } } void dfs1(int x) { bi[x] = ++num; fb[num] = x; if (so[x] != 0) { tp[so[x]] = tp[x]; dfs1(so[x]); } for (int y = b[x]; y; y = a[y].ne) { if (a[y].nu != f[x] && a[y].nu != so[x]) { tp[a[y].nu] = a[y].nu; dfs1(a[y].nu); } } } void build(int nu, int l, int r) { t[nu].ma = -2e9; t[nu].l = l; t[nu].r = r; t[nu].ta = -2e9; if (l != r) { build(nu * 2, l, (l + r) / 2); build(nu * 2 + 1, (l + r) / 2 + 1, r); t[nu].de = t[nu * 2 + 1].de; } else { t[nu].de = d[fb[l]]; } } void ya(int nu) { if (t[nu].ta != -2e9) { if (t[nu].l != t[nu].r) { t[nu * 2].ta = t[nu].ta; t[nu * 2 + 1].ta = t[nu].ta; } t[nu].ma = t[nu].ta + t[nu].de * 2; t[nu].ta = -2e9; } } int que(int nu, int l, int r) { ya(nu); if (t[nu].l == l && t[nu].r == r) return t[nu].ma; int mid = (t[nu].l + t[nu].r) / 2; if (l > mid) return que(nu * 2 + 1, l, r); if (r <= mid) return que(nu * 2, l, r); return max(que(nu * 2, l, mid), que(nu * 2 + 1, mid + 1, r)); } void get(int nu, int l, int r) { ya(nu); if (t[nu].l == l && t[nu].r == r) { no.push_back(nu); return; } int mid = (t[nu].l + t[nu].r) / 2; if (l <= mid) get(nu * 2, l, min(mid, r)); if (r > mid) get(nu * 2 + 1, max(mid + 1, l), r); } int getans(int nu, int y) { if (t[nu].l == t[nu].r) return fb[t[nu].l]; ya(nu * 2 + 1); if (t[nu * 2 + 1].ma <= y) return getans(nu * 2, y); return getans(nu * 2 + 1, y); } int get(int x, int y) { while (x != 0) { if (que(1, bi[tp[x]], bi[x]) > y) { no.clear(); get(1, bi[tp[x]], bi[x]); for (int i = no.size() - 1; i >= 0; i--) { if (t[no[i]].ma > y) return getans(no[i], y); } } x = f[tp[x]]; } return x; } void add(int nu, int l, int r, int x) { ya(nu); if (t[nu].l == l && t[nu].r == r) { t[nu].ta = x; return; } int mid = (t[nu].l + t[nu].r) / 2; if (l <= mid) add(nu * 2, l, min(mid, r), x); if (r > mid) add(nu * 2 + 1, max(mid + 1, l), r, x); ya(nu * 2); ya(nu * 2 + 1); t[nu].ma = max(t[nu * 2].ma, t[nu * 2 + 1].ma); } void fu(int x, int y, int z) { while (tp[x] != tp[y]) { add(1, bi[tp[x]], bi[x], z); x = f[tp[x]]; } if (x != y) add(1, bi[y] + 1, bi[x], z); } int main() { read(n); read(m); for (int i = 1; i <= n; i++) { read(x); jb(x + 1, i + 1); jb(i + 1, x + 1); } n++; dfs(1, 0, 1); num = 0; tp[1] = 1; dfs1(1); build(1, 1, n); add(1, 1, 1, 2e9); for (int i = 1; i <= m; i++) { read(v[i].x); read(v[i].t); v[i].x++; v[i].we = i; } sort(v + 1, v + m + 1, co); for (int i = 1; i <= m; i++) { v[i].an = get(v[i].x, v[i].t + d[v[i].x]); fu(v[i].x, v[i].an, v[i].t + d[v[i].x] - d[v[i].an] * 2); } sort(v + 1, v + m + 1, c1); for (int i = 1; i <= m; i++) printf( %d , v[i].t + d[v[i].x] * 2 - d[v[i].an] * 2); puts( ); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> T sqr(T x) { return x * x; } long double pi = 3.1415926535897932384626433832795; const int N = 5e5 + 10, lg = 20; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { long long a, b, c; cin >> a >> b >> c; if (c == 0) { if (a != b) cout << NO ; else cout << YES ; return 0; } if (a == b || ((a > b && c < 0) && (a - b) % (-c) == 0) || ((a < b && c > 0) && (b - a) % c == 0)) cout << YES ; else cout << NO ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m; int check(vector<long long> &a, long long q) { multiset<long long> s; for (int j = 0; j < n; ++j) { if (q + a[j] >= 0) { q += a[j]; s.insert(a[j]); } else if (a[j] > (*s.begin())) { q += (a[j] - (*s.begin())); s.erase(s.begin()); s.insert(a[j]); } } return s.size(); } int main() { ios::sync_with_stdio(false); cin >> n >> m; vector<pair<long long, int> > b(m); vector<int> out(m); vector<long long> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < m; ++i) { cin >> b[i].first; b[i].second = i; } sort(b.begin(), b.end()); int pre = -1, li = 0; for (int i = 0; i <= n && pre != m - 1; ++i) { int l = pre + 1, h = m - 1; while (l < h) { int md = (h + l) >> 1; if (check(a, b[md].first) >= i) { h = md; } else { l = md + 1; } } if (check(a, b[l].first) != i) { continue; } for (int j = pre + 1; j < l; ++j) { out[b[j].second] = n - li; } li = i; out[b[l].second] = n - i; pre = l; } while (pre != m) { out[b[pre++].second] = n - li; } for (int i = 0; i < m; ++i) { cout << out[i] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool life[1000005]; int main() { long long a, b; int l, r, mid; int ans, cnt = 0; scanf( %lld%lld , &a, &b); l = 0; r = 1000000007; while (l != r) { mid = (r + l + 1) / 2; if (((mid + 1LL) * mid) / 2 > a + b) r = mid - 1; else l = mid; } ans = l; for (int i = l; i > 0; i--) { if (a >= i) { a -= i; life[i] = 1; cnt++; } } printf( %d n , cnt); if (cnt) { for (int i = 1; i <= l; i++) { if (life[i]) printf( %d , i); } printf( n ); } printf( %d n , ans - cnt); if (ans - cnt) { for (int i = 1; i <= l; i++) { if (!life[i]) printf( %d , i); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long int addingval[100]; long long int lastOcc[100]; long long int wt[100]; long long int cum[100005]; map<long long int, long long int> mp[100]; int main() { for (int i = 0; i < 26; ++i) cin >> wt[i]; string s; cin >> s; int sz = s.size(); s = $ + s; long long int cnt = 0; for (int i = 1; i <= sz; ++i) { char c = s[i] - a ; cum[i] = cum[i - 1] + wt[c]; cnt += mp[c][cum[i - 1]]; mp[c][cum[i]]++; } cout << cnt; } |
#include <bits/stdc++.h> using namespace std; int a[26][26]; int main() { int n; cin >> n; memset(a, 0, sizeof(a)); char ch[20]; int len; for (int i = 1; i <= n; i++) { scanf( %s , ch); for (len = 0; ch[len]; len++) ; for (int j = 0; j < 26; j++) if (a[j][ch[0] - a ]) { a[j][ch[len - 1] - a ] = max(a[j][ch[len - 1] - a ], a[j][ch[0] - a ] + len); } a[ch[0] - a ][ch[len - 1] - a ] = max(a[ch[0] - a ][ch[len - 1] - a ], len); } int ans = 0; for (int i = 0; i < 26; i++) ans = max(ans, a[i][i]); cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAX = 1 << 20; int bio[MAX]; vector<int> V[MAX]; int a[MAX], b[MAX]; int deg[MAX]; void dfs(int x) { if (bio[x]++) return; for (auto it : V[x]) dfs(it); } int main() { int n, m; scanf( %d%d , &n, &m); int usebe = 0; for (int i = 0; i < m; i++) { scanf( %d%d , &a[i], &b[i]); a[i]--; b[i]--; V[a[i]].push_back(b[i]); V[b[i]].push_back(a[i]); if (a[i] == b[i]) usebe++; else { deg[a[i]]++; deg[b[i]]++; } } for (int i = 0; i < n; i++) { if (V[i].size()) { dfs(i); break; } } for (int i = 0; i < n; i++) if (!bio[i] && V[i].size()) { printf( 0 n ); return 0; } long long rje = 0; rje += (long long)usebe * (usebe - 1) / 2; rje += (long long)usebe * (m - usebe); for (int i = 0; i < n; i++) rje += (long long)deg[i] * (deg[i] - 1) / 2; printf( %lld n , rje); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5; int n, m; int fir[N + 10][2], nex[N + 10][2], tot[2], en[N + 10][2]; int tag[N + 10][2], vis[N + 10]; void addEdge(int x, int y, int p) { tot[p]++; nex[tot[p]][p] = fir[x][p]; fir[x][p] = tot[p]; en[tot[p]][p] = y; } void dfs1(int x) { vis[x] = 1; for (int tmp = fir[x][0]; tmp > 0; tmp = nex[tmp][0]) { int y = en[tmp][0]; if (vis[y] == 0) { dfs1(y); } else if (vis[y] == 1) { puts( -1 ); exit(0); } } vis[x] = 2; } void dfs2(int x, int p) { if (tag[x][p] == 1) { return; } tag[x][p] = 1; for (int tmp = fir[x][p]; tmp > 0; tmp = nex[tmp][p]) { int y = en[tmp][p]; if (tag[y][p] == 0) { dfs2(y, p); } } } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) { int x, y; scanf( %d%d , &x, &y); addEdge(x, y, 0); addEdge(y, x, 1); } for (int i = 1; i <= n; i++) if (vis[i] == 0) { dfs1(i); } string ans = ; int cnta = 0; for (int i = 1; i <= n; i++) { if (tag[i][0] == 0 && tag[i][1] == 0) { ans += A ; cnta++; } else { ans += E ; } dfs2(i, 0); dfs2(i, 1); } printf( %d n , cnta); printf( %s n , ans.c_str()); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, arr[100001]; string s; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } cin >> s; bool gotwater = false; long long curt = 0, energy = 0, totwalk = 0; for (int i = 0; i < n; i++) { if (s[i] == L ) { curt += arr[i]; if (energy < arr[i]) { long long diff = arr[i] - energy; if (gotwater) curt += diff * 3; else curt += diff * 5; energy += diff; } energy -= arr[i]; } else { energy += arr[i]; if (s[i] == W ) { gotwater = true; curt += arr[i] * 3; } else { curt += arr[i] * 5; totwalk += arr[i] * 2; } } totwalk = min(totwalk, energy); } if (energy > 0) { curt -= totwalk * 2; curt -= (energy - totwalk); } cout << curt; } |
#include <bits/stdc++.h> using namespace std; long long mod = 1000000000 + 7; int main() { long long a, b; cin >> a >> b; long long ans = 0; for (long long r = 1; r < b; ++r) { long long tmp = (a * (a + 1) / 2) % mod; tmp = (tmp * r) % mod; tmp = (tmp * b) % mod; tmp = (tmp + (a * r) % mod) % mod; ans = (ans + tmp) % mod; } if (ans < 0) ans += mod; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long a[101010]; long long l, r, pref[101010]; long long ans, cnt, sum, max1, min1, ali; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; long long n; string s; cin >> n; while (n--) { cin >> l >> r; if (l >= r) cout << r << endl; else { min1 = r / l; max1 = r % l; ans = ((min1 + 1) * (min1 + 1)) * max1; ans += (min1 * min1) * (l - max1); cout << ans << endl; } } } |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; const int mod = 998244353; const int maxn = 2e5 + 10; struct edge { int st, ed; int w; bool operator<(const edge &b) const { return w < b.w; } edge() {} edge(int st, int ed, int w) : st(st), ed(ed), w(w) {} }; edge e[maxn]; int vet[805]; ll dis[805][805]; int temp[805], cnt; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); for (int i = 0; i < m; ++i) { int x, y, w; scanf( %d %d %d , &x, &y, &w); e[i] = edge(x, y, w); } sort(e, e + m); for (int i = 0; i < min(m, k); ++i) { temp[cnt++] = e[i].st; temp[cnt++] = e[i].ed; } sort(temp, temp + cnt); cnt = unique(temp, temp + cnt) - temp; memset(dis, 0x3f, sizeof(dis)); for (int i = 0; i < min(m, k); ++i) { int x, y; x = lower_bound(temp, temp + cnt, e[i].st) - temp; y = lower_bound(temp, temp + cnt, e[i].ed) - temp; dis[x][y] = min(dis[x][y], (ll)e[i].w); dis[y][x] = dis[x][y]; } for (int a = 0; a < cnt; ++a) { for (int i = 0; i < cnt; ++i) { for (int j = i + 1; j < cnt; ++j) { dis[i][j] = min(dis[i][j], dis[i][a] + dis[a][j]); dis[j][i] = dis[i][j]; } } } vector<ll> ans; for (int i = 0; i < cnt; ++i) { for (int j = i + 1; j < cnt; ++j) ans.push_back(dis[i][j]); } sort(ans.begin(), ans.end()); printf( %lld n , ans[k - 1]); } |
#include <bits/stdc++.h> using namespace std; long long int check(long long int a) { if (a >= 1000000000 + 7) a %= 1000000000 + 7; return a; } long long int check2(long long int a) { if (a > 0) return a; long long int b = a / 1000000000 + 7; a -= b * 1000000000 + 7; if (a < 0) a += 1000000000 + 7; return a; } long long int exp(long long int a, long long int n) { if (n == 0) return 1; if (n == 1) return check(a); long long int b = exp(a, n / 2); if (n % 2 == 0) return check(b * b); return check(b * check(b * a)); } int arr[4][4]; int main() { ios::sync_with_stdio(false); cin.tie(0); for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) cin >> arr[i][j]; for (int i = 0; i < 4; i++) { if (arr[i][3] == 1) for (int j = 0; j < 3; j++) if (arr[i][j] == 1) { cout << YES ; return 0; } } for (int i = 0; i < 4; i++) { for (int j = 0; j < 3; j++) { int k = (i + 1 + j) % 4; if (arr[i][3] == 1 && arr[i][3] == arr[k][j]) { cout << YES ; return 0; } } } cout << NO ; return 0; } |
#include <bits/stdc++.h> #pragma comment(linker, /STACK:33554432 ) using namespace std; const double PI = 2 * acos(0.0); const double EPS = 1e-8; const int INF = (1 << 30) - 1; int n; string s; vector<int> p; set<int> ans; void add01(char c1, char c2, int a, int b) { for (int i = 0; i < a; ++i) s[p[i]] = c1; for (int i = 0; i < b; ++i) s[p[a + i]] = c2; } int getans() { int i = n - 1; while (s[i] != 0 ) --i; int j = n - 1; while (s[j] != 1 ) --j; if (i < j) return 1; else return 2; } void printbin(int n) { cout << n / 2 << n % 2 << endl; } int main() { cin >> s; if ((int)((s).size()) % 2 == 1) s = 0 + s; n = (int)((s).size()); int cnt = 0, cnt1 = 0, cnt0 = 0; for (int i = 0; i < n; ++i) if (s[i] == ? ) { ++cnt; p.push_back(i); } else if (s[i] == 1 ) ++cnt1; else if (s[i] == 0 ) ++cnt0; if (cnt0 >= cnt1 + cnt + 2) { cout << 00 ; return 0; } if (cnt1 >= cnt0 + cnt + 2) { cout << 11 ; return 0; } if (cnt0 + cnt >= cnt1 + 2) ans.insert(0); if (cnt1 + cnt >= cnt0 + 2) ans.insert(3); add01( 0 , 1 , n / 2 - cnt0, n / 2 - cnt1); ans.insert(getans()); add01( 1 , 0 , n / 2 - cnt1, n / 2 - cnt0); ans.insert(getans()); for (set<int>::iterator i = ans.begin(); i != ans.end(); ++i) printbin(*i); return 0; }; |
#include <bits/stdc++.h> using namespace std; const int maxn = 2 * 100000 + 10; int _min(int a, int b) { if (a < b) return a; else return b; } int _max(int a, int b) { if (a > b) return a; else return b; } char s[1005]; int col[4] = {0}; int row[4] = {0}; int main() { scanf( %s , s); int len = strlen(s); for (int i = 0; i < len; i++) { if (s[i] == 0 ) { for (int j = 0; j < 4; j++) { if (col[j] == 0) { col[j] = 1; printf( %d %d n , 1, j + 1); break; } } } else { for (int j = 0; j < 4; j++) { if (row[j] == 0) { row[j] = 1; if (j == 0) printf( 3 1 n ); if (j == 1) printf( 3 3 n ); if (j == 2) printf( 4 1 n ); if (j == 3) printf( 4 3 n ); break; } } } int flag = 0; for (int j = 0; j < 4; j++) { if (col[j] == 0) { flag = 1; break; } } if (flag == 0) { for (int j = 0; j < 4; j++) col[j] = 0; } if (row[0] == 1 && row[1] == 1) { row[0] = 0; row[1] = 0; } if (row[2] == 1 && row[3] == 1) { row[2] = 0; row[3] = 0; } } return 0; } |
#include <bits/stdc++.h> using namespace std; int n, v, t, p, cnt1, cnt2, x; vector<pair<int, int>> k, c; vector<int> ans; void add(bool sm) { v--; if (sm) { x += k[cnt1].first; ans.push_back(k[cnt1++].second); } else { x += c[cnt2].first; ans.push_back(c[cnt2++].second); v--; } } void solve() { cin >> n >> v; for (int i = 0; i < n; ++i) { cin >> t >> p; t--; if (t) { c.push_back({p, i + 1}); } else { k.push_back({p, i + 1}); } } sort(k.begin(), k.end()); sort(c.begin(), c.end()); reverse(k.begin(), k.end()); reverse(c.begin(), c.end()); while ((v >= 1 && cnt1 < k.size()) || (v >= 2 && cnt2 < c.size())) { add((cnt2 == c.size() || v == 1) || (k[cnt1].first > c[cnt2].first) || (cnt1 < k.size() - 1 && k[cnt1].first + k[cnt1 + 1].first > c[cnt2].first)); } cout << x << endl; for (int i = 0; i < ans.size(); ++i) { cout << ans[i] << ; } cout << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); map<long long int, long long int> mpp; long long int n; cin >> n; for (long long int i = 0; i < n; i++) { long long int x; cin >> x; mpp[__builtin_popcount(x)]++; } long long int ans = 0; for (auto p : mpp) { ans += (p.second) * (p.second - 1) / 2; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int N, T, K; int a[200333]; int lo[200333], hi[200333]; int mid[200333]; int main() { scanf( %d%d%d , &N, &T, &K); for (int i = 1; i <= T; i++) scanf( %d , &a[i]); K = N - K - 1; for (int t = 1; t < T; t++) hi[t] = min(a[t], a[t + 1]); for (int t = 1; t < T; t++) lo[t] = 1; int hiSum = 0; for (int t = 1; t < T; t++) hiSum += hi[t]; int loSum = 0; for (int t = 1; t < T; t++) loSum += lo[t]; bool possible = loSum <= K && K <= hiSum; if (!possible) { puts( -1 ); exit(0); } for (int t = 1; t <= T; t++) { mid[t] = lo[t]; K -= lo[t]; } for (int t = 1; K; t++) { int val = min(K, hi[t] - mid[t]); K -= val; mid[t] += val; } printf( %d n , N); for (int v = 2; v <= 1 + a[1]; v++) printf( %d %d n , 1, v); int uStart = 2; for (int t = 1; t < T; t++) { int u = uStart; int upCnt = mid[t] - 1; for (int v = uStart + a[t]; v < uStart + a[t] + a[t + 1]; v++) { printf( %d %d n , u, v); if (upCnt) { upCnt--; u++; } } uStart = uStart + a[t]; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int M = 1005; int parent[2 * M]; vector<pair<pair<int, int>, pair<int, int> > > edges; void init() { for (int i = 0; i < 2 * M; i++) parent[i] = i; } int find(int u) { if (u == parent[u]) return u; return parent[u] = find(parent[u]); } void un(int u, int v) { u = find(u); v = find(v); parent[u] = v; } int main() { int n, m, q; scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= m; i++) { int a, b, c; scanf( %d %d %d , &a, &b, &c); edges.push_back(make_pair(make_pair(c, i), make_pair(a, b))); } sort(edges.begin(), edges.end(), greater<pair<pair<int, int>, pair<int, int> > >()); while (q--) { int l, r; scanf( %d %d , &l, &r); int ans = -1; init(); for (int i = 0; i < edges.size(); i++) { int c = edges[i].first.first; int id = edges[i].first.second; int u = edges[i].second.first; int v = edges[i].second.second; if (id < l || id > r) continue; if (find(u) == find(v)) { ans = c; break; } un(u, v + n); un(u + n, v); } printf( %d n , ans); } return 0; } |
#include <bits/stdc++.h> using namespace std; int n; long long qp(long long x, long long y) { long long r = 1; for (; y; y >>= 1, x = x * x % 1000000007ll) if (y & 1) r = r * x % 1000000007ll; return r; } long long c[1000010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int x; scanf( %d , &x); if (~x) c[x]++; } long long r = 0; for (int i = 1; i < 10010; i++) r = (r + qp(2, c[i]) - 1 + 1000000007ll) % 1000000007ll; cout << (qp(2, n - 1) - 1 - r + 1000000007ll) % 1000000007ll; } |
#include <bits/stdc++.h> using namespace std; const double inf = 1e13; const double eps = 1e-9; int Sgn(double k) { return fabs(k) < eps ? 0 : (k < 0 ? -1 : 1); } int Cmp(double k1, double k2) { return Sgn(k1 - k2); } struct Point { double x, y; }; Point operator-(Point k1, Point k2) { return (Point){k1.x - k2.x, k1.y - k2.y}; } Point operator+(Point k1, Point k2) { return (Point){k1.x + k2.x, k1.y + k2.y}; } double operator*(Point k1, Point k2) { return k1.x * k2.x + k1.y * k2.y; } double operator^(Point k1, Point k2) { return k1.x * k2.y - k1.y * k2.x; } Point operator*(Point k1, double k2) { return (Point){k1.x * k2, k1.y * k2}; } Point operator/(Point k1, double k2) { return (Point){k1.x / k2, k1.y / k2}; } double GetLen(Point k) { return sqrt(k * k); } double GetDisPointToPoint(Point k1, Point k2) { return sqrt((k2 - k1) * (k2 - k1)); } Point Rotate(Point k, double ang) { return (Point){k.x * cos(ang) - k.y * sin(ang), k.x * sin(ang) + k.y * cos(ang)}; } Point Rotate90(Point k) { return (Point){-k.y, k.x}; } struct Circle { Point o; double r; }; bool IsInside(Circle k1, Circle k2) { double dis = GetDisPointToPoint(k1.o, k2.o); if (Cmp(k1.r - k2.r, dis) >= 0 || Cmp(k2.r - k1.r, dis) >= 0) return true; return false; } bool IsOutside(Circle k1, Circle k2) { double dis = GetDisPointToPoint(k1.o, k2.o); if (Cmp(dis, k1.r + k2.r) > 0) return true; return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << fixed << setprecision(10); Point s, t; cin >> s.x >> s.y >> t.x >> t.y; int n; cin >> n; vector<Circle> c(n); for (auto &it : c) cin >> it.o.x >> it.o.y >> it.r; Point mid_point = (s + t) / 2.0; Point dir = Rotate90(t - s) / GetLen(t - s); double dis_div2 = GetDisPointToPoint(s, mid_point); bool ans_flag = true; for (auto &it : c) { Circle cur = (Circle){mid_point, dis_div2}; if (!IsInside(cur, it) && !IsOutside(cur, it)) { ans_flag = false; break; } } if (ans_flag) { cout << dis_div2 << endl; return 0; } vector<pair<double, double>> record; for (auto &it : c) { bool dir_flag; if (Sgn((it.o - mid_point) * dir) > 0) dir_flag = true; else dir_flag = false; double inside_record, outside_record; Circle binary_search_cur; int binary_search_cnt = 0; double binary_search_left = -inf, binary_search_right = inf; while (Cmp(binary_search_left, binary_search_right) && binary_search_cnt++ < 100) { double binary_search_mid = (binary_search_left + binary_search_right) / 2.0; binary_search_cur.o = dir * binary_search_mid + mid_point; binary_search_cur.r = sqrt(binary_search_mid * binary_search_mid + dis_div2 * dis_div2); if (IsInside(binary_search_cur, it)) { inside_record = binary_search_mid; if (dir_flag) binary_search_right = binary_search_mid; else binary_search_left = binary_search_mid; } else { if (dir_flag) binary_search_left = binary_search_mid; else binary_search_right = binary_search_mid; } } binary_search_cnt = 0; binary_search_left = -inf, binary_search_right = inf; while (Cmp(binary_search_left, binary_search_right) && binary_search_cnt++ < 100) { double binary_search_mid = (binary_search_left + binary_search_right) / 2.0; binary_search_cur.o = dir * binary_search_mid + mid_point; binary_search_cur.r = sqrt(binary_search_mid * binary_search_mid + dis_div2 * dis_div2); if (IsOutside(binary_search_cur, it)) { outside_record = binary_search_mid; if (dir_flag) binary_search_left = binary_search_mid; else binary_search_right = binary_search_mid; } else { if (dir_flag) binary_search_right = binary_search_mid; else binary_search_left = binary_search_mid; } } if (Cmp(inside_record, outside_record) > 0) swap(inside_record, outside_record); record.push_back(make_pair(inside_record, outside_record)); } sort(record.begin(), record.end(), [&](pair<double, double> k1, pair<double, double> k2) { return Cmp(k1.first, k2.first) < 0; }); double ans = Cmp(-record[0].first, 0.0) > 0 ? -record[0].first : 0.0; double fi = record[0].first, se = record[0].second; for (int i = 1; i < record.size(); ++i) { if (Cmp(se, record[i].first) < 0) { if (Cmp(ans, fabs(se)) > 0) ans = fabs(se); if (Cmp(ans, fabs(record[i].first)) > 0) ans = fabs(record[i].first); fi = record[i].first; } if (Cmp(record[i].second, se) > 0) se = record[i].second; } if (Cmp(ans, fabs(se)) > 0) ans = fabs(se); cout << sqrt(ans * ans + dis_div2 * dis_div2) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; long long Pot(long long a, long long b) { if (b == 0) return 1; if (b % 2 == 0) { long long x = Pot(a, b / 2); return x * x % MOD; } else return Pot(a, b - 1) * a % MOD; } long long Inv(long long x) { return Pot(x, MOD - 2); } int main() { ios_base::sync_with_stdio(0); string s; long long n, k; cin >> s >> k; n = s.size(); long long odp = 0; for (long long i = 0; i < n; ++i) { if (s[i] == 0 || s[i] == 5 ) { long long pot1 = Pot(2, n * k) - 1; if (pot1 < 0) pot1 += MOD; long long pot2 = Pot(2, n) - 1; if (pot2 < 0) pot2 += MOD; long long il = Pot(2, i) * pot1 % MOD; il = (il * Inv(pot2)) % MOD; odp = (odp + il) % MOD; } } cout << odp; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, j; int main() { ios::sync_with_stdio(false); cin >> n; cout << 3 * n / 2 << n ; for (i = 2; i <= n; i += 2) cout << i << ; for (i = 1; i <= n; i += 2) cout << i << ; for (i = 2; i <= n; i += 2) cout << i << ; return 0; } |
#include <bits/stdc++.h> using namespace std; int gi() { char cc = getchar(); int cn = 0, flus = 1; while (cc < 0 || cc > 9 ) { if (cc == - ) flus = -flus; cc = getchar(); } while (cc >= 0 && cc <= 9 ) cn = cn * 10 + cc - 0 , cc = getchar(); return cn * flus; } const int N = 2e5 + 5; struct E { int to, next; } e[N << 1]; int n, cnt, A, B, head[N]; void add(int x, int y) { e[++cnt] = (E){y, head[x]}, head[x] = cnt, e[++cnt] = (E){x, head[y]}, head[y] = cnt; } void Dfs(int x, int fa, int dep) { (dep ^ 1) ? ++A : ++B; for (register int i = head[x]; i; i = e[i].next) if (e[i].to ^ fa) Dfs(e[i].to, x, dep ^ 1); } signed main() { n = gi(); int x, y; for (register int i = (2); i <= (n); ++i) x = gi(), y = gi(), add(x, y); Dfs(1, 1, 0); cout << min(A, B) - 1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; static char a[55][55]; bool vis[55][55]; bool dfs(int i, int j, int px, int py, int n, int m) { bool flag = false; if (i > n || j > m) return false; if (i == 0 || j == 0) return false; vis[i][j] = 1; int xi[] = {1, 0, -1, 0}; int yi[] = {0, -1, 0, 1}; for (int k = 0; k < 4; k++) { int x = xi[k] + i; int y = yi[k] + j; if (x == px && y == py) continue; if (a[x][y] == a[i][j]) { if (vis[x][y]) { return true; } else flag = dfs(x, y, i, j, n, m); if (flag) { return true; } } } return false; } int main() { int n, m; char ch; scanf( %d%d , &n, &m); memset(a, . , sizeof(a)); for (int i = 1; i <= n; i++) { scanf( %c , &ch); for (int j = 1; j <= m; j++) { scanf( %c , &a[i][j]); } } memset(vis, 0, sizeof(vis)); bool flag = false; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (vis[i][j] == true) continue; else flag = dfs(i, j, 0, 0, n, m); if (flag) break; } if (flag) break; } if (flag) printf( Yes ); else printf( No ); } |
#include <bits/stdc++.h> using namespace std; template <typename T> string tos(T a) { stringstream ss; string ret; ss << a; ss >> ret; return ret; } int n, a; vector<int> arr; int main() { while (cin >> n) { arr.clear(); for (int(i) = (0); (i) < (n); (i)++) { cin >> a; arr.push_back(a); } int boro = *max_element((arr).begin(), (arr).end()); if (boro == 1) { sort(arr.begin(), arr.end()); arr[arr.size() - 1] = 2; } else { for (int(i) = (0); (i) < (n); (i)++) { if (arr[i] == boro) { arr[i] = 1; break; } } sort(arr.begin(), arr.end()); } for (int(i) = (0); (i) < (n); (i)++) { if (i) cout << ; cout << arr[i]; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 105000; int n, m; int tin[MAXN], tout[MAXN]; vector<int> g[MAXN]; vector<int> gr[MAXN]; vector<int> gg[MAXN]; vector<int> vv; bool used[MAXN]; int sz[MAXN]; int cursize; int p[MAXN]; bool has[MAXN]; int ans; void dfs(int v) { used[v] = true; for (int i = 0; i < (int)g[v].size(); i++) { int to = g[v][i]; if (!used[to]) dfs(to); } vv.push_back(v); } void dfs2(int v, int par) { used[v] = true; p[v] = par; sz[par]++; for (int i = 0; i < (int)gr[v].size(); i++) { int to = gr[v][i]; if (!used[to]) dfs2(to, par); } } void dfs3(int v) { used[v] = true; has[v] = true; for (int i = 0; i < (int)gg[v].size(); i++) { int to = gg[v][i]; if (!used[to]) dfs3(to); } } void dfs4(int v) { used[v] = true; cursize++; for (int i = 0; i < (int)gg[v].size(); i++) { int to = gg[v][i]; if (!used[to]) dfs4(to); } } int main() { scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { int from, to; scanf( %d %d , &from, &to); g[from].push_back(to); gr[to].push_back(from); gg[from].push_back(to); gg[to].push_back(from); } for (int i = 1; i <= n; i++) { if (!used[i]) { dfs(i); } } memset(used, 0, sizeof(used)); for (int i = 1; i <= n; i++) { int cur = vv[n - i]; if (!used[cur]) { dfs2(cur, cur); if (sz[cur] > 1) { has[cur] = true; } } } memset(used, 0, sizeof(used)); for (int i = 1; i <= n; i++) if (!used[i] && has[i]) { dfs3(i); } memset(used, 0, sizeof(used)); for (int i = 1; i <= n; i++) { if (!used[i]) { cursize = 0; dfs4(i); if (has[i]) ans += cursize; else ans += cursize - 1; } } cout << ans << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; long long n = s.size() / 2 + s.size() % 2; long long x = n; cout << s[x - 1]; for (long long t = 1; t <= 100; t++) { if (x + t - 1 < s.size()) cout << s[x + t - 1]; if (x - t - 1 >= 0) cout << s[x - t - 1]; } return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( unroll-loops ) using namespace std; template <typename T> ostream& operator<<(ostream& out, vector<T>& a) { for (auto& p : a) out << p << ; return out; } template <typename T> istream& operator>>(istream& inp, vector<T>& a) { for (auto& p : a) inp >> p; return inp; } signed main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cout.precision(20); srand((signed)time(NULL)); long long n = 0, ans = 0; cin >> n; vector<pair<long long, long long>> arr(n); for (auto& p : arr) cin >> p.first >> p.second; map<long long, long long> gx, gy; for (long long i = 0; i < n; i++) { ans += gx[arr[i].first] + gy[arr[i].second]; gx[arr[i].first]++, gy[arr[i].second]++; } map<pair<long long, long long>, long long> gg; for (long long i = 0; i < n; i++) gg[arr[i]]++; for (auto& p : gg) ans -= p.second * (p.second - 1) / 2; cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; namespace math { template <typename T> T gcd(T a, T b) { if (a < 0) a = -a; if (b < 0) b = -b; while (b > 0) { T r = a % b; a = b; b = r; } return a; } } // namespace math template <typename C> int SZ(const C& c) { return (int)c.size(); } template <size_t n, class... Types> struct TupleHashHelper { static std::size_t calc(const std::tuple<Types...>& t) { using std::size_t; std::hash<typename std::tuple_element<n - 1, std::tuple<Types...>>::type> elemHash; return elemHash(std::get<n - 1>(t)) + 31013 * TupleHashHelper<n - 1, Types...>::calc(t); } }; template <class... Types> struct TupleHashHelper<0, Types...> { static std::size_t calc(const std::tuple<Types...>&) { return 0; } }; template <class... Types> struct TupleHash { std::size_t operator()(const std::tuple<Types...>& t) const { static const size_t n = std::tuple_size<std::tuple<Types...>>::value; return TupleHashHelper<n, Types...>::calc(t); } }; class Solution { public: void solve(std::istream& in, std::ostream& out) { int n; in >> n; vector<int> x(n), y(n); for (int i = 0; i < n; ++i) in >> x[i] >> y[i]; unordered_map<tuple<int, int, int>, set<int>, TupleHash<int, int, int>> lines; for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) { using math::gcd; int a = y[j] - y[i], b = x[i] - x[j]; int c = -a * x[i] - b * y[i]; int d = gcd(gcd(a, b), c); if (a < 0) { a = -a; b = -b; c = -c; } else if (a == 0 && b < 0) { b = -b; c = -c; } auto t = make_tuple(a / d, b / d, c / d); lines[t].insert(i); lines[t].insert(j); } long long res = (long long)n * (n - 1) * (n - 2) / 6; for (const auto& p : lines) { long long s = SZ(p.second); res -= s * (s - 1) * (s - 2) / 6; } out << res << endl; } }; void solve(std::istream& in, std::ostream& out) { out << std::setprecision(12); Solution solution; solution.solve(in, out); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); istream& in = cin; ostream& out = cout; solve(in, out); return 0; } |
#include <bits/stdc++.h> using namespace std; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template <class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template <class T> inline T sqr(T x) { return x * x; } const double EPS = 1e-10; const double PI = acos(-1.0); const int dx[] = {-1, 1, 0, 0}; const int dy[] = {0, 0, 1, -1}; int n, k, ret; bool us[11]; int main() { cin >> n >> k; for (int i = (0); i < (n); ++i) { string s; bool f = true; cin >> s; for (int j = (0); j < (10); ++j) us[j] = false; for (int j = (0); j < (s.size()); ++j) us[s[j] - 0 ] = true; for (int j = (0); j < (k + 1); ++j) if (!us[j]) f = false; ret += f; } cout << ret << endl; return 0; } |
#include <bits/stdc++.h> int main() { long long l3, l4, l5; std::cin >> l3 >> l4 >> l5; long double pi = 3.141592653589793238462643383279; long double v3 = 1.0 / 3.0 * l3 * l3 * sqrtl(3.0) / 4.0 * l3 * sqrtl(2.0 / 3); long double v4 = 1.0 / 3.0 * l4 * l4 * l4 * sqrtl(2) / 2; long double v5 = 1.0 / 3.0 * l5 * l5 * sqrtl(25 + 10 * sqrtl(5)) / 4 * l5 * sqrtl(4 * sinl(pi / 5) * sinl(pi / 5) - 1) / (2 * sinl(pi / 5)); std::cout.precision(10); return std::cout << std::fixed << v3 + v4 + v5, 0; } |
#include <bits/stdc++.h> using namespace std; long long p2(long long x) { return x * x; } int main() { long long n; cin >> n; if (n <= 2) cout << -1 << endl; else if (!(n % 2)) cout << (n * n) / 4 - 1 << << (n * n) / 4ll + 1ll << endl; else cout << (n * n - 1) / 2ll << << (n * n + 1) / 2ll << endl; return 0; } |
///Bismillahir Rahmanir Rahim #include<bits/stdc++.h> #define u64 uint64_t #define ll long long #define endl n #define PI acos(-1) #define fi first #define si second #define mkp make_pair #define pb push_back #define set0(arr) memset(arr, 0, sizeof(arr)) #define setinf(arr) memset(arr, 126, sizeof(arr)) #define all(x) (x).begin(),(x).end() #define sz(v) ((ll)(v).size()) #define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) using namespace std; using pll = pair<ll, ll> ; using vl = vector<ll> ; using vpll = vector<pll> ; using mll = map<ll, ll> ; using mcl = map<char, ll> ; using msl = map<string,ll> ; using sl = set<ll> ; using sc = set<char> ; using dl = deque<ll> ; const int N = 1e6+5 ; ll mod = 1e9+7 ; vl adj[N] ; vpll adjc[N] ; ll vis[N] ; ll arr[N] ; ll sumd(ll a,ll b){return (((a%mod)+(b%mod))%mod);} ll muld(ll a,ll b){return (((a%mod)*(b%mod))%mod);} ll subd(ll a,ll b){return (((a%mod)-(b%mod)+mod)%mod);} int main() { IOS; ll a, b, c, d, n, m, p, x, y, z, i, j, k, f = 0, tc, cnt = 0, sum = 0, mul = 1, mi = 1e18, ma = -1e18, cs; string str ; char ch ; double db ; ll l, r ; //code cin>>tc; for(cs=1;cs<=tc;cs++) { ll c1,c2,c3,a1,a2,a3,a4,a5; cin>>c1>>c2>>c3; cin>>a1>>a2>>a3>>a4>>a5; c1-=a1; c2-=a2; c3-=a3; if(c1<0||c2<0||c3<0) { cout<< NO n ;continue; } if(c1>=a4) { if(c2>=a5){} else { a5-=c2; c3-=a5; if(c3<0) { cout<< NO n ;continue; } } } else { a4-=c1; c3-=a4; if(c3<0) { cout<< NO n ;continue; } else { if(c2>=a5); else { a5-=c2; c3-=a5; if(c3<0) { cout<< NO n ;continue; } } } } cout<< YES n ; } //code return 0; } |
#include <bits/stdc++.h> using namespace std; long long pwr(long long a, long long b, long long mod) { a %= mod; if (a < 0) a += mod; long long ans = 1; while (b) { if (b & 1) ans = (ans * a) % mod; a = (a * a) % mod; b /= 2; } return ans; } long long pwr(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans *= a; a *= a; b /= 2; } return ans; } long long gcd(long long a, long long b) { while (b) { long long temp = a; a = b; b = temp % b; } return a; } long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } long long modularInverse(long long a, long long m) { assert(false); return pwr(a, m - 2, m); } const int mod = 1000000007; int DP[5001][5001]; int PDP[5001][5001]; int n, k, a, b; void generatePDP(int u) { PDP[u][0] = DP[u][0]; for (int i = 1; i <= n; ++i) { PDP[u][i] = (PDP[u][i - 1] + DP[u][i]) % mod; } } int main() { std::ios::sync_with_stdio(false); cin >> n >> a >> b >> k; for (int i = 1; i <= n; ++i) DP[0][i] = 1; DP[0][b] = 0; for (int i = 1; i <= k; ++i) { generatePDP(i - 1); for (int j = 1; j <= n; ++j) { if (j == b) { DP[i][b] = 0; } else if (j < b) { int dist = b - j; int start = max(1, j - dist + 1); int end = b - 1; if (start - 1 >= 1) DP[i][j] = PDP[i - 1][end] - PDP[i - 1][start - 1] - DP[i - 1][j]; else DP[i][j] = PDP[i - 1][end] - DP[i - 1][j]; } else if (j > b) { int dist = j - b; int start = b + 1; int end = min(j + dist - 1, n); if (start - 1 >= 1) DP[i][j] = PDP[i - 1][end] - PDP[i - 1][start - 1] - DP[i - 1][j]; else DP[i][j] = PDP[i - 1][end] - DP[i - 1][j]; } DP[i][j] %= mod; if (DP[i][j] < 0) DP[i][j] += mod; } } cout << DP[k][a] << endl; } |
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll P = 998244353; constexpr ll modPow(ll a, ll b, ll c) { if ((b & 1) == 1) return a * modPow(a, b - 1, c) % c; if (b == 0) return 1 % c; return modPow(a * a % c, b / 2, c); } void bitReverse(vector<int>& vec) { int n = vec.size(); int lg = 0; while ((1 << lg) < n) ++lg; for (int i = 0; i < n; ++i) { int t = 0; for (int j = 0; j < lg; ++j) { if (i & (1 << j)) t |= 1 << (lg - 1 - j); } if (i < t) swap(vec[i], vec[t]); } } void ntt(vector<int>& pol, bool inv) { bitReverse(pol); int n = pol.size(); int lg = 0; while ((1 << lg) < n) ++lg; ll nth_root = modPow(3, (P - 1) / n, P); if (inv) nth_root = modPow(nth_root, n - 1, P); vector<ll> pows(lg, nth_root); for (int i = lg - 2; i >= 0; --i) pows[i] = (pows[i + 1] * pows[i + 1]) % P; ll tmp = 1; for (int i = 0; i < n; ++i) tmp = (tmp * nth_root) % P; for (lg = 0; (1 << lg) < n; ++lg) { int h = 1 << lg; int len = h << 1; ll root = pows[lg]; for (int j = 0; j < n; j += len) { ll curr = 1; for (int i = j; i < j + h; ++i) { int tmp = (curr * pol[i + h]) % P; curr = (curr * root) % P; pol[i + h] = P - tmp + pol[i]; if (pol[i + h] >= P) pol[i + h] -= P; pol[i] += tmp; if (pol[i] >= P) pol[i] -= P; } } } } vector<int> polyMult(vector<int> a, vector<int> b) { int as = a.size(); int bs = b.size(); int n = 1; while (n < (as + bs)) n <<= 1; a.resize(n, 0); b.resize(n, 0); ntt(a, false); ntt(b, false); vector<int> c(n); int n_inv = modPow(n, P - 2, P); for (int i = 0; i < n; ++i) { ll prod = (ll)a[i] * b[i] % P; c[i] = prod * n_inv % P; } ntt(c, true); c.resize(as + bs - 1); return c; } const int N = 10 + 4 * (int)1e5; ll fact[N]; ll inv_fact[N]; ll twop[N]; ll choose(int a, int b) { if (b > a) return 0; ll div = inv_fact[b] * inv_fact[a - b] % P; return fact[a] * div % P; } vector<int> build(const vector<ll>& as, ll h) { int n = as.size(); int x = 0, y = 0; for (int i = 0; i < n && as[i] < h;) { int j = i; while (j < n && as[j] == as[i]) ++j; if (j - i == 1) ++x; else ++y; i = j; } n = x + 2 * y + 1; vector<int> vec1(n, 0), vec2(n, 0); for (int i = 0; i < n; ++i) { vec1[i] = choose(2 * y, i); vec2[i] = choose(x, i) * twop[i] % P; } vector<int> res = polyMult(vec1, vec2); while (res.back() == 0) res.pop_back(); return res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); fact[0] = 1; twop[0] = 1; inv_fact[0] = 1; for (int i = 1; i < N; ++i) { fact[i] = (i * fact[i - 1]) % P; twop[i] = (2 * twop[i - 1]) % P; inv_fact[i] = modPow(fact[i], P - 2, P); } int n, k; cin >> n >> k; vector<ll> as(n), bs(k); for (int i = 0; i < n; ++i) cin >> as[i]; for (int i = 0; i < k; ++i) cin >> bs[i]; sort(as.begin(), as.end()); vector<vector<int>> dp(k); for (int j = 0; j < k; ++j) dp[j] = build(as, bs[j]); int q; cin >> q; for (int qi = 0; qi < q; ++qi) { int t; cin >> t; ll res = 0; for (int j = 0; j < k; ++j) { int c = (t / 2) - bs[j] - 1; if (c >= 0 && c < dp[j].size()) { res += dp[j][c]; } } cout << (res % P) << n ; } } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; long long qpow(long long x, long long k) { return k == 0 ? 1 : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod; } const int md = 1e9 + 7; const int Maxn = 5005; int n, k; long long dp[Maxn][Maxn]; int main() { scanf( %d%d , &n, &k); dp[0][0] = 1; for (int i = 1; i <= k; i++) { for (int j = 1; j <= i; j++) { dp[i][j] = (dp[i - 1][j] * j + dp[i - 1][j - 1] * (n - j + 1)) % md; } } long long ans = 0; for (int i = 1; i <= min(n, k); i++) { ans = (ans + dp[k][i] * qpow(2, n - i)) % md; } printf( %lld n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; int mat[101][101]; int min(int a, int b) { return a < b ? a : b; } int max(int a, int b) { return a > b ? a : b; } int main() { int n, m; int i, j; string s; cin >> n >> m; for (i = 0; i < n; ++i) { cin >> s; for (j = 0; j < m; ++j) { if (s[j] == W ) mat[i][j] = 0; else mat[i][j] = 1; } } int left = -1, right = 101, top = -1, bot = 101; int bcount = 0; for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) { if (mat[i][j] == 1) { ++bcount; if (left == -1) left = j; else left = min(left, j); if (right == 101) right = j; else right = max(right, j); if (top == -1) top = i; else top = min(top, i); if (bot == 101) bot = i; else bot = max(bot, i); } } } int c = 0; if (bot == 101 && right == 101 && left == -1 && top == -1) c = 1; else if (bot == top && right == left) c = 0; else { int hor = bot - top + 1; int ver = right - left + 1; int side = max(hor, ver); if (side > n || side > m) c = -1; else { c = side * side - bcount; } } cout << c << endl; ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 200005; const int MOD = 998244353; int fact[N], factinv[N]; int lgcput(int b, int p) { int a = 1; while (p) { if (p & 1) { a = (1LL * a * b) % MOD; } b = (1LL * b * b) % MOD; p /= 2; } return a; } int inv(int x) { return lgcput(x, MOD - 2); } int main() { int n, k; cin >> n >> k; fact[0] = factinv[0] = 1; for (int i = 1; i <= n; i++) { fact[i] = (1LL * i * fact[i - 1]) % MOD; factinv[i] = (1LL * inv(i) * factinv[i - 1]) % MOD; } int c = n - k; if (k >= n) { cout << 0 ; return 0; } int ans = 0; for (int i = 0; i <= c; i++) { int dead = (1LL * ((1LL * ((1LL * fact[c] * factinv[i]) % MOD) * factinv[c - i]) % MOD) * lgcput(c - i, n)) % MOD; if (i & 1) ans -= dead; else ans += dead; if (ans < 0) ans += MOD; if (ans >= MOD) ans -= MOD; } ans = (1LL * (1LL * (1LL * ans * fact[n] % MOD) * factinv[c] % MOD) * factinv[n - c]) % MOD; if (k == 0) { cout << ans; return 0; } ans *= 2; ans %= MOD; cout << ans; return 0; } |
#include <bits/stdc++.h> using namespace std; const int nMax = 200003; int smen[nMax]; int main() { cin.sync_with_stdio(false); cin.tie(NULL); int n, k, q, st, dr; cin >> n >> k >> q; int m = nMax - 3; for (int i = 1; i <= n; i++) { cin >> st >> dr; smen[st]++; smen[dr + 1]--; } for (int i = 1; i <= m; i++) { smen[i] = smen[i - 1] + smen[i]; } for (int i = 1; i <= m; i++) { if (smen[i] >= k) { smen[i] = 1; } else { smen[i] = 0; } } for (int i = 1; i <= m; i++) { smen[i] = smen[i - 1] + smen[i]; } int x, y; for (int i = 1; i <= q; i++) { cin >> x >> y; cout << smen[y] - smen[x - 1] << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; map<long long, long long> dp; long long fastPow(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = (ret * a) % 1000000007; a = (a * a) % 1000000007; b >>= 1; } return ret; } long long cc(long long y) { if (dp.find(y) != dp.end()) return dp[y]; dp[y] = fastPow(2, y - 1); for (int i = 2; i * i <= y; i++) { if (!(y % i)) { dp[y] = (dp[y] - cc(i) + 1000000007) % 1000000007; if (i != y / i) { dp[y] = (dp[y] - cc(y / i) + 1000000007) % 1000000007; } } } dp[y]--; return dp[y]; } int main() { long long x, y; cin >> x >> y; if (!(y % x)) { y /= x; if (y == 1) { cout << 1 << endl; return 0; } cout << cc(y) << endl; return 0; } cout << 0 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { int cases; scanf( %d , &cases); while (cases--) { int n, p; scanf( %d%d , &n, &p); for (int i = 2; i <= n; i++) { printf( %d %d n , 1, i); } for (int i = 2; i < n; i++) { printf( %d %d n , i, i + 1); } printf( %d %d n , n, 2); int count = 0, extra = 2 * n + p - 2 * (n - 1); for (int i = 2; i <= n; i++) { for (int j = i + 2; j <= n; j++) { if (i == 2 && j == n) break; printf( %d %d n , i, j); count++; if (count == extra) goto here; } } here: continue; } return 0; } |
#include <bits/stdc++.h> using namespace std; int p[31111], dp[31111][800]; int main() { int i, j, n, d, u; scanf( %d%d , &n, &d); for (i = 0; i < n; i++) { scanf( %d , &u); p[u]++; } for (i = 0; i <= 30000; i++) { for (j = 0; j <= 650; j++) { dp[i][j] = -10000000; } } int ans = dp[d][300] = p[d]; for (i = d + 1; i <= 30000; i++) { for (j = 1; j <= 600; j++) { int pre = i - j - d + 300; if (pre < 0) break; if (pre >= i) continue; dp[i][j] = max(dp[pre][j], max(dp[pre][j + 1], dp[pre][j - 1])) + p[i]; ans = max(ans, dp[i][j]); } } printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int dx[]{-1, 0, 0, 1}; int dy[]{-1, -1, 1, 1}; void solve() { string str; cin >> str; cout << str; reverse(str.begin(), str.end()); cout << str << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); solve(); cerr << Time elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; return 0; } |
#include <bits/stdc++.h> using namespace std; namespace FastIO { const int L = (1 << 20); char buf[L], *S, *T; inline char getchar() { if (S == T) { T = (S = buf) + fread(buf, 1, L, stdin); if (S == T) return EOF; } return *S++; } inline int read() { int s = 0, f = 1; char t = getchar(); while ( 0 > t || t > 9 ) { if (t == - ) f = -1; t = getchar(); } while ( 0 <= t && t <= 9 ) { s = (s << 1) + (s << 3) + t - 0 ; t = getchar(); } return s * f; } } // namespace FastIO using FastIO::read; const int N = 55; const int Mod = 998244353; int dp[N][N][N * 2], sum, Sadd, Ssub; int w[N], a[N], n, m; int Inc(int x, int y) { return x + y >= Mod ? x + y - Mod : x + y; } int Dec(int x, int y) { return x - y < 0 ? x - y + Mod : x - y; } int Mul(int x, int y) { return (long long)x * y % Mod; } int Fpow(int a, int b) { int ans = 1; while (b) { if (b & 1) ans = Mul(ans, a); b >>= 1; a = Mul(a, a); } return ans; } int Inv(int x) { return Fpow(x, Mod - 2); } void Dp(int c) { memset(dp, 0, sizeof(dp)); dp[0][0][0] = 1; for (int i = 0; i < m; i++) { for (int k = 0; k <= i; k++) { int now = (a[c] ? w[c] + k : w[c] - k); if (now < 0) continue; for (int d = 0; d <= i; d++) { if (!dp[i][k][d]) continue; int Dw = sum + d - (i - d); Dw = Inv(Dw); int Up_add = Sadd + d; int Up_sub = Ssub - (i - d); if (a[c]) { dp[i + 1][k + 1][d + 1] = Inc(dp[i + 1][k + 1][d + 1], Mul(dp[i][k][d], Mul(now, Dw))); dp[i + 1][k][d + 1] = Inc(dp[i + 1][k][d + 1], Mul(dp[i][k][d], Mul(Up_add - now, Dw))); dp[i + 1][k][d] = Inc(dp[i + 1][k][d], Mul(dp[i][k][d], Mul(Up_sub, Dw))); } else { dp[i + 1][k + 1][d] = Inc(dp[i + 1][k + 1][d], Mul(dp[i][k][d], Mul(now, Dw))); dp[i + 1][k][d + 1] = Inc(dp[i + 1][k][d + 1], Mul(dp[i][k][d], Mul(Up_add, Dw))); dp[i + 1][k][d] = Inc(dp[i + 1][k][d], Mul(dp[i][k][d], Mul(Up_sub - now, Dw))); } } } } int Ans = 0; for (int k = 0; k <= m; k++) { int now = (a[c] ? w[c] + k : w[c] - k); if (now < 0) continue; for (int d = 0; d <= m; d++) { Ans = Inc(Ans, Mul(now, dp[m][k][d])); } } cout << Ans << n ; } int main() { n = read(); m = read(); for (int i = 1; i <= n; i++) a[i] = read(); for (int i = 1; i <= n; i++) { w[i] = read(); if (a[i]) Sadd += w[i]; else Ssub += w[i]; sum += w[i]; } for (int i = 1; i <= n; i++) Dp(i); return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T, typename U> inline void smin(T &a, U b) { if (a > b) a = b; } template <typename T, typename U> inline void smax(T &a, U b) { if (a < b) a = b; } template <class T> inline void gn(T &first) { char c, sg = 0; while (c = getchar(), (c > 9 || c < 0 ) && c != - ) ; for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; c = getchar()) first = (first << 1) + (first << 3) + c - 0 ; if (sg) first = -first; } template <class T, class T1> inline void gn(T &first, T1 &second) { gn(first); gn(second); } template <class T, class T1, class T2> inline void gn(T &first, T1 &second, T2 &z) { gn(first); gn(second); gn(z); } template <class T> inline void print(T first) { if (first < 0) { putchar( - ); return print(-first); } if (first < 10) { putchar( 0 + first); return; } print(first / 10); putchar(first % 10 + 0 ); } template <class T> inline void printsp(T first) { print(first); putchar( ); } template <class T> inline void println(T first) { print(first); putchar( n ); } template <class T, class U> inline void print(T first, U second) { printsp(first); println(second); } template <class T, class U, class V> inline void print(T first, U second, V z) { printsp(first); printsp(second); println(z); } int power(int a, int b, int m, int ans = 1) { for (; b; b >>= 1, a = 1LL * a * a % m) if (b & 1) ans = 1LL * ans * a % m; return ans; } int tp[250] = { 0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341, 390, 439, 488, 537, 586, 635, 684, 733, 782, 831, 880, 929, 978, 1027, 1076, 1125, 1174, 1223, 1272, 1321, 1370, 1419, 1468, 1517, 1566, 1615, 1664, 1713, 1762, 1811, 1860, 1909, 1958, 2007, 2056, 2105, 2154, 2203, 2252, 2301, 2350, 2399, 2448, 2497, 2546, 2595, 2644, 2693, 2742, 2791, 2840, 2889, 2938, 2987, 3036, 3085, 3134, 3183, 3232, 3281, 3330, 3379, 3428, 3477, 3526, 3575, 3624, 3673, 3722, 3771, 3820, 3869, 3918, 3967, 4016, 4065, 4114, 4163, 4212, 4261, 4310, 4359, 4408, 4457, 4506, 4555, 4604, 4653, 4702, 4751, 4800, 4849, 4898, 4947, 4996, 5045, 5094, 5143, 5192, 5241, 5290, 5339, 5388, 5437, 5486, 5535, 5584, 5633, 5682, 5731, 5780, 5829, 5878, 5927, 5976, 6025, 6074, 6123, 6172, 6221, 6270, 6319, 6368, 6417, 6466, 6515, 6564, 6613, 6662, 6711, 6760, 6809, 6858, 6907, 6956, 7005, 7054, 7103, 7152, 7201, 7250, 7299, 7348, 7397, 7446, 7495, 7544, 7593, 7642, 7691, 7740, 7789, 7838, 7887, 7936, 7985, 8034, 8083, 8132, 8181, 8230, 8279, 8328, 8377, 8426, 8475, 8524, 8573, 8622, 8671, 8720, 8769, 8818, 8867, 8916, 8965, 9014, 9063, 9112, 9161, 9210, 9259, 9308, 9357, 9406, 9455, 9504, 9553, 9602, 9651, 9700, 9749, 9798, 9847, 9896, 9945, 9994, 10043, 10092, 10141, 10190, 10239, 10288, 10337, 10386, 10435}; int main() { int n; gn(n); if (n < 201) println(tp[n]); else println(tp[200] + (long long)(n - 200) * 49); return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.