Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; const static int inf = 10000000; const static int mod = 1000000007; int check(const vector<string>& s, const vector<string>& t) { int n = s.size(); vector<int> idx(n); for (int i = 0; i < (int)(n); i++) { idx[i] = i; } int ret = 0; do { vector<string> ss(n); for (int i = 0; i < (int)(n); i++) { ss[i] = s[idx[i]]; } int pos = 0; for (int i = 0; i < t.size() && pos < s.size(); ++i) { if (ss[pos] == t[i]) { ++pos; } } if (pos != s.size()) { continue; } int inv = 0; for (int i = 0; i < (int)(n); i++) { for (int j = i + 1; j < n; ++j) { if (idx[i] > idx[j]) { ++inv; } } } int buf = n * (n - 1) / 2 - inv + 1; ret = max(ret, buf); } while (next_permutation((idx).begin(), (idx).end())); return ret; } int main() { int n; while (cin >> n) { vector<string> s(n); for (int i = 0; i < (int)(n); i++) { cin >> s[i]; } int mxp = 0; int idx = -1; int k; cin >> k; for (int i = 0; i < (int)(k); i++) { int m; cin >> m; vector<string> t(m); for (int j = 0; j < (int)(m); j++) { cin >> t[j]; } int p = check(s, t); if (p > mxp) { mxp = p; idx = i; } } if (idx == -1) { cout << Brand new problem! << endl; } else { cout << idx + 1 << endl; cout << [: ; for (int i = 0; i < (int)(mxp); i++) { cout << | ; } cout << :] << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int n, k; bool ask(int x, int y) { if (x < 0 || y > n) return 0; string s; cout << 1 << << x << << y << endl; cin >> s; return s == TAK ; } int solve(int l, int r) { if (l > r) return -1; int mid; while (l < r) { mid = (l + r) >> 1; if (ask(mid, mid + 1)) r = mid; else l = mid + 1; } return l; } int main() { int i, j; cin >> n >> k; int ans1 = solve(1, n); int ans2 = solve(1, ans1 - 1); if (!ask(ans2, ans1)) ans2 = solve(ans1 + 1, n); cout << 2 << << ans1 << << ans2 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 200200; const int INF = 1000000007; struct Ramp { int i, x, d, t, p; bool operator<(int o) const { return x < o; } bool operator<(const Ramp& o) const { return x < o.x; } } r[MAXN], rr; struct Edge { int a, b, c, t; Edge(int a, int b, int c, int t = -1) : a(a), b(b), c(c), t(t) {} }; vector<Edge> e[MAXN]; int d[MAXN]; const Edge* pre[MAXN]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { r[i].i = i + 1; scanf( %d%d%d%d , &r[i].x, &r[i].d, &r[i].t, &r[i].p); r[n + i].i = -1; r[n + i].x = r[i].x + r[i].d; } n += n; r[n].x = 0; r[n + 1].x = m; r[n].i = r[n + 1].i = -1; n += 2; sort(r, r + n); for (int i = 1; i < n; ++i) { e[i - 1].push_back(Edge(i - 1, i, r[i].x - r[i - 1].x)); e[i].push_back(Edge(i, i - 1, r[i].x - r[i - 1].x)); } for (int i = 0; i < n; ++i) { if (r[i].i == -1 || r[i].x < r[i].p) { continue; } rr.x = r[i].x - r[i].p; int a = lower_bound(r, r + n, rr) - r; rr.x = r[i].x + r[i].d; int b = lower_bound(r, r + n, rr) - r; for (int aa = a - 1; aa <= a; ++aa) { for (int bb = b; bb <= b; ++bb) { if (0 <= aa && aa < bb && bb < n) { int cc = r[i].p + r[i].t; cc += abs(r[i].x - r[i].p - r[aa].x); cc += abs(r[i].x + r[i].d - r[bb].x); e[aa].push_back(Edge(aa, bb, cc, r[i].i)); } } } } priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q; fill(d, d + n, INF); fill(pre, pre + n, (Edge*)NULL); d[0] = 0; q.push({d[0], 0}); while (!q.empty()) { int t = q.top().first; int v = q.top().second; q.pop(); if (d[v] != t) { continue; } for (const Edge& w : e[v]) { if (d[w.b] > t + w.c) { d[w.b] = t + w.c; q.push({d[w.b], w.b}); pre[w.b] = &w; } } } printf( %d n , d[n - 1]); vector<int> ans; for (int i = n - 1; i > 0; i = pre[i]->a) { if (pre[i]->t != -1) { ans.push_back(pre[i]->t); } } reverse(ans.begin(), ans.end()); printf( %d n , (int)ans.size()); for (int i : ans) { printf( %d , i); } return 0; }
#include <bits/stdc++.h> using namespace std; set<string> st; set<string>::iterator it; vector<long long> v, vv; int main() { int n, a[100000], cnt = 0, cnt2 = 0, k; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > 0) cnt++; else if (a[i] < 0) cnt2++; } if (n % 2 == 0) k = n / 2; else k = (n / 2) + 1; if (cnt > cnt2) { if (cnt >= k) cout << 2 << endl; else cout << 0 << endl; } else { if (cnt2 >= k) cout << -2 << endl; else cout << 0 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int a[12][12]; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf( %d , &a[i][j]); for (int k = 1; k <= n; k++) { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { a[i][j] = min(a[i][j], a[i][k] + a[k][j]); } } } int ans = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) ans = max(ans, a[i][j]); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int64_t ans; int n, m, ve, ts[1000001], nn[1000001], t, cut[1000001], p[1000001], vis[1000001], low[1000001]; vector<int> e[1000001]; void dfs(int i) { low[i] = ts[i] = ++t; vis[i] = 1; for (auto&& x : e[i]) if (!vis[x]) { p[x] = i; dfs(x); low[i] = min(low[i], low[x]); if (low[x] > ts[i]) cut[x] = 1; } else if (x != p[i]) low[i] = min(low[i], low[x]); } int main() { scanf( %d%d , &n, &m); if (m < 2) return puts( 0 ), 0; for (int _ = 0; _ < m; ++_) { int s, t; scanf( %d%d , &s, &t); if (s == t) ++nn[s]; else e[s].push_back(t), e[t].push_back(s); } for (int i = 1; i <= n; ++i) if (e[i].size()) { dfs(i); break; } for (int i = 1; i <= n; ++i) if ((nn[i] || e[i].size()) && !vis[i]) return puts( 0 ), 0; int64_t slc = accumulate(nn, nn + n + 1, 0); ans = slc * (slc - 1); for (int i = 1; i <= n; ++i) { int no = nn[i]; nn[i] = 0; nn[i] = e[i].size(); ans += nn[i] * int64_t(nn[i] - 1); ans += slc * nn[i]; } cout << ans / 2; }
#include <bits/stdc++.h> using namespace std; void solve() { int n, l; cin >> n >> l; vector<int> flags(n + 2); flags[0] = 0, flags[n + 1] = l; for (int i = 0; i < n; ++i) { cin >> flags[i + 1]; } vector<double> s(n + 2); vector<double> e(n + 2); s[0] = 0; e[n + 1] = 0; for (int i = 1; i < n + 2; ++i) { s[i] = s[i - 1] + (flags[i] - flags[i - 1]) * 1.0 / i; e[n - i + 1] = e[n - i + 2] + (flags[n - i + 2] - flags[n - i + 1]) * 1.0 / (i); } for (int i = 0; i < n + 2; ++i) { if (abs(s[i] - e[i]) < 1e-6) { cout << s[i] << n ; return; } else if (s[i] > e[i]) { double sspd = i; double espd = n - i + 2; double dist = flags[i] - flags[i - 1]; double result = espd * e[i] + sspd * s[i - 1] + dist; result = result / (sspd + espd); cout << result << n ; return; } } } int main() { cout << setprecision(9); cout << fixed; int tests; cin >> tests; while (tests) { solve(); tests--; } }
#include <bits/stdc++.h> using namespace std; const int MOD = 1000000007; struct Sync_stdio { Sync_stdio() { cin.tie(NULL); ios_base::sync_with_stdio(false); } } _sync_stdio; int main() { int n, m, k; cin >> n >> m >> k; vector<vector<vector<int>>> v(n + 2, vector<vector<int>>(m + 2, vector<int>(k + 2))); vector<vector<vector<int>>> ans( n + 2, vector<vector<int>>(m + 2, vector<int>(k + 2))); for (int i = (0); i < (n); ++i) { for (int j = (0); j < (m); ++j) { string s; cin >> s; for (int l = (0); l < (k); ++l) { v[i + 1][j + 1][l + 1] = s[l] - 0 ; } } } for (int i = (1); i < (n + 1); ++i) { for (int j = (1); j < (m + 1); ++j) { for (int l = (1); l < (k + 1); ++l) { if (v[i][j][l] == 1 && v[i - 1][j][l] == 1 && v[i + 1][j][l] == 1) { ans[i][j][l] = 1; } if (v[i][j][l] == 1 && v[i][j - 1][l] == 1 && v[i][j + 1][l] == 1) { ans[i][j][l] = 1; } if (v[i][j][l] == 1 && v[i][j][l - 1] == 1 && v[i][j][l + 1] == 1) { ans[i][j][l] = 1; } for (int x1 = (0); x1 < (3); ++x1) { for (int x2 = (0); x2 < (3); ++x2) { if (x1 == x2) { continue; } vector<int> dx1(3); vector<int> dx2(3); ++dx1[x1]; ++dx2[x2]; if (v[i][j][l] == 1 && v[i - dx1[0]][j - dx1[1]][l - dx1[2]] == 1 && v[i + dx2[0]][j + dx2[1]][l + dx2[2]] == 1 && v[i - dx1[0] + dx2[0]][j - dx1[1] + dx2[1]] [l - dx1[2] + dx2[2]] == 0) { ans[i][j][l] = 1; } } } } } } int res = 0; for (int i = (1); i < (n + 1); ++i) { for (int j = (1); j < (m + 1); ++j) { for (int l = (1); l < (k + 1); ++l) { res += ans[i][j][l]; } } } cout << res; }
#include <bits/stdc++.h> using namespace std; string str; int ss; int par[10001]; int ans[2][10001]; int root(int x) { if (par[x] != x) par[x] = root(par[x]); return par[x]; } map<string, int> m; int main() { while (getline(cin, str)) { char ty = str[0]; int k = 2; int z = 0; int p = 0; string tt = ; tt += ty; tt += ; while (k < str.size()) { tt += ; string t = ; k++; while (k < str.size() && str[k] != ) t += str[k], k++; tt += t; z++; if (k < str.size()) { if (!m.count(tt)) { m[tt] = ++ss; par[m[tt]] = m[tt]; } if (z > 1) { int xx = root(m[tt]); int yy = root(p); if (xx != yy) { par[xx] = yy; ans[0][yy]++; } } p = m[tt]; } else { ans[1][root(p)]++; } } } int mx1 = 0, mx2 = 0; for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) { mx1 = max(mx1, ans[0][it->second]); mx2 = max(mx2, ans[1][it->second]); } cout << mx1 << << mx2; return 0; }
#include <bits/stdc++.h> using namespace std; const unsigned long long maxn = 2e6 + 10; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string v; cin >> v; for (long i = 0; i < v.size(); i++) { if (v[i] != 1 && v[i] != 4 ) { cout << NO << endl; return 0; } } if (v[0] != 1 ) { cout << NO << endl; return 0; } unsigned long long p = 0; for (long i = 1; i < v.size(); i++) { if (v[i] == 4 && v[i - 1] == 4 ) { if (v[i + 1] == 4 ) { cout << NO << endl; p = 1; return 0; } } } if (p == 0) { cout << YES << endl; return 0; } }
#include <bits/stdc++.h> using namespace std; const int MAXN = 100100; int n, m; int was[MAXN]; vector<int> g[MAXN]; bool was2[3][MAXN]; bool dfs(int v, int col = 1) { was[v] = col; for (int i = 0; i < (int)g[v].size(); ++i) { if (!was[g[v][i]]) { if (dfs(g[v][i], 3 - col)) { return true; } } else if (was[v] == was[g[v][i]]) return true; } return false; } int dfs2(int v, int col) { was2[col][v] = true; int res = was[v] == col; for (int i = 0; i < (int)g[v].size(); ++i) { if (!was2[col][g[v][i]]) { res += dfs2(g[v][i], col); } } return res; } unsigned long long C(int n, int k) { if (k > n) return 0; unsigned long long res = 1; for (int i = 0; i < k; ++i) res *= n - i; for (int i = 2; i <= k; ++i) res /= i; return res; } int main() { scanf( %d%d , &n, &m); for (int i = 0, a, b; i < m; ++i) { scanf( %d%d , &a, &b); g[a].push_back(b); g[b].push_back(a); } for (int i = 1; i <= n; ++i) { if (!was[i] && dfs(i)) { puts( 0 1 ); return 0; } } unsigned long long one = 0; for (int i = 1; i <= n; ++i) { if (!was2[1][i]) { one += C(dfs2(i, 1), 2); one += C(dfs2(i, 2), 2); } } if (one) { cout << 1 << << one << endl; return 0; } if (m) { cout << 2 << << m * 1ll * (n - 2) << n ; return 0; } cout << 3 << << C(n, 3) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int longpre(string y) { string s = y + ? ; reverse(y.begin(), y.end()); s += y; int n = s.length(); int lps[n]; for (int i = 0; i < n; i++) lps[i] = 0; int i = 0; int j = 1; while (j < n) { if (s[i] == s[j]) { lps[j] = i + 1; i++; j++; } else { if (i == 0) { lps[j] = 0; j++; } else { i = lps[i - 1]; } } } return lps[n - 1]; } int main() { int t; cin >> t; while (t--) { string s; cin >> s; int k = 0; int i = 0; int n = s.length(); int j = n - 1; while (i < j) { if (s[i] == s[j]) k++; else break; i++; j--; } string t = ; if (k > 0) { t += s.substr(0, k); } string mid = s.substr(k, n - 2 * k); if (mid.length() > 0) { int prefix = longpre(mid); reverse(mid.begin(), mid.end()); int suffix = longpre(mid); if (prefix > suffix) { reverse(mid.begin(), mid.end()); t += mid.substr(0, prefix); } else { t += mid.substr(0, suffix); } } t += s.substr(n - k, k); cout << t << endl; } }
#include<bits/stdc++.h> #define fort(i,a,b) for(long long i=a;i<=b;i++) #define forn(i,a,b) for(long long i=a;i>=b;i--) #define rep(i,a,b) for(long long i=a;i<b;i++) #define x first #define y second #define pb push_back #define MP make_pair using namespace std; const long long N=2e5+5; long long s1,s2,d,c,test,n,l[N][20],f[N],kq[N],h[N],cnt[N],kt[N],timer,tin[N],tout[N]; vector<long long > a[N]; void dfs(long long u,long long pa) { tin[u]=++timer; h[u]=h[pa]+1; l[u][0]=pa; cnt[u]++; for(long long v:a[u]) if (v!=pa) { dfs(v,u); f[u]+=cnt[u]*cnt[v]; cnt[u]+=cnt[v]; } f[u]+=(n-cnt[u])*cnt[u]; tout[u]=++timer; } void build_lca() { fort(i,1,log2(n)) fort(j,1,n) l[j][i]=l[l[j][i-1]][i-1]; } long long lca(long long u,long long v) { if (h[u]<h[v]) swap(u,v); forn(i,log2(h[u]),0) if (h[l[u][i]]>=h[v]) u=l[u][i]; if (u==v) return u; forn(i,log2(h[u]),0) if (l[u][i]!=l[v][i]) { u=l[u][i]; v=l[v][i]; } return l[u][0]; } void chinh(long long x) { if (kt[x]) return; kt[x]=1; chinh(l[x][0]); } bool con(long v,long u) { return tin[u]<tin[v]&&tout[v]<tout[u]; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>test; while (test--) { cin>>n; fort(i,1,n-1) { long long u,v; cin>>u>>v; u++;v++; a[u].pb(v); a[v].pb(u); } dfs(1,0); build_lca(); kq[1]=n*(n-1)/2-f[1]; kq[n+1]=1; fort(i,1,n) if (a[i].size()>2) kq[n+1]=0; d=1;c=1;s1=0;s2=0; kt[1]=1; fort(i,2,n) if (!kt[i]) { if (d!=c) { if (c==1) { if (lca(i,d)!=1&&lca(i,d)!=d&&kt[lca(i,d)]) { kq[i]=s2*cnt[d]; break; } } else { if (lca(i,d)!=d&&lca(i,c)!=c) { kq[i]=cnt[d]*cnt[c]; break; } } if (con(i,d)) { chinh(i); s1=cnt[d]-cnt[i]; kq[i]=s1*s2; d=i; s1=cnt[d]; } else if (con(i,c)) { chinh(i); if (c==1) s2-=cnt[i];else s2=cnt[c]-cnt[i]; kq[i]=s1*s2; c=i; s2=cnt[c]; } } else { chinh(i); for(long long v:a[1]) if (!kt[v]) s2+=cnt[v]; s2++;s1=cnt[i]; kq[i]=f[1]-cnt[i]*s2; d=i; } } fort(i,1,n+1) cout<<kq[i]<< ;cout<< n ; fort(i,1,n) a[i].clear(); fort(i,1,n+1) kq[i]=0; fort(i,1,n) cnt[i]=0; fort(i,1,n) fort(j,0,log2(n)) l[i][j]=0; fort(i,1,n) kt[i]=0; fort(i,1,n) f[i]=0; timer=0; } }
#include <bits/stdc++.h> template <typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; } template <typename First, typename... Rest> void MACRO_VAR_Scan(First& first, Rest&... rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } template <typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } template <typename First, typename... Rest> void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template <typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } template <typename First, typename... Rest> void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } template <class T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template <class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } template <class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) { return std::vector<std::vector<T>>(n, std::vector<T>(m, init)); } template <typename S, typename T> std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) { os << ( << p.first << , << p.second << ) ; return os; } using ll = long long; using ull = unsigned long long; using ld = long double; using PAIR = std::pair<int, int>; using PAIRLL = std::pair<ll, ll>; constexpr int INFINT = 1 << 30; constexpr int INFINT_LIM = (1LL << 31) - 1; constexpr ll INFLL = 1LL << 60; constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); constexpr double EPS = 1e-10; constexpr int MOD = 998244353; constexpr double PI = 3.141592653589793238462643383279; template <class T, size_t N> void FILL(T (&a)[N], const T& val) { for (auto& x : a) x = val; } template <class ARY, size_t N, size_t M, class T> void FILL(ARY (&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); } template <class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; } template <class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); } bool g[20][20]; bool h[20][20]; bool dp[16][1 << 16][16]; signed main() { std::ios::sync_with_stdio(false); std::cin.tie(0); ; int n, m; MACRO_VAR_Scan(n, m); ; std::vector<std::vector<int>> a(n, std::vector<int>(m)); for (auto& R : a) for (auto& w : R) std::cin >> w; ; auto check = [&](int d) { FILL(g, true); FILL(h, true); FILL(dp, false); for (int i = 0; i < int(n); ++i) for (int j = 0; j < int(n); ++j) { for (int k = 0; k < int(m); ++k) { if (std::abs(a[i][k] - a[j][k]) < d) { g[i][j] = false; break; } } for (int k = 0; k < int(m - 1); ++k) { if (std::abs(a[i][k] - a[j][k + 1]) < d) { h[i][j] = false; break; } } } for (int root = 0; root < int(n); ++root) { dp[root][1 << root][root] = true; for (int mask = 0; mask < int(1 << n); ++mask) for (int i = 0; i < int(n); ++i) { if (!dp[root][mask][i]) continue; if (!(mask & 1 << i)) continue; for (int j = 0; j < int(n); ++j) { if (!g[i][j]) continue; if (mask & 1 << j) continue; dp[root][mask | 1 << j][j] = true; } } for (int i = 0; i < int(n); ++i) if (n == 1 || i != root) { if (dp[root][(1 << n) - 1][i] && h[i][root]) return true; } } return false; }; int ng = 1000000009, ok = 0; while (ng - ok > 1) { int me = (ok + ng) / 2; if (check(me)) ok = me; else ng = me; } std::cout << (ok); std::cout << n ; ; return 0; }
#include <bits/stdc++.h> using namespace std; long long int power(long long int a, long long int b) { if (b == 0) return 1; if (b == 1) return a; long long int r = power(a, b / 2) % 1000000007; if (b % 2 == 0) return (r * r) % 1000000007; else return (((r * r) % 1000000007) * a) % 1000000007; } int prime[1000009]; void sieve(int n) { prime[0] = prime[1] = 1; for (int i = 2; i <= sqrt(n); i++) { if (!prime[i]) { for (int j = 2 * i; j <= n; j++) { prime[j]++; } } } } bool comp(const pair<long long int, long long int> &a, const pair<long long int, long long int> &b) { return (a.second < b.second); } const int N = 5 * 1e5 + 9; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; long long int a[n]; vector<pair<long long int, int> > v; for (int i = 0; i < n; i++) { cin >> a[i]; v.push_back({a[i], i + 1}); } sort(v.begin(), v.end()); if (n == 2 || n == 3) { cout << 1 n ; return 0; } map<long long int, long long int> mp; for (int i = 0; i < n - 1; i++) { mp[v[i + 1].first - v[i].first]++; } if (mp.size() > 3) { cout << -1 n ; return 0; } if (mp.size() == 1) { cout << v[0].second << n ; return 0; } if (n == 4) { if (v[1].first + v[3].first == 2 * v[2].first) { cout << v[0].second << n ; return 0; } if (v[0].first + v[3].first == 2 * v[2].first) { cout << v[1].second << n ; return 0; } if (v[0].first + v[3].first == 2 * v[1].first) { cout << v[2].second << n ; return 0; } if (v[0].first + v[2].first == 2 * v[1].first) { cout << v[3].second << n ; return 0; } cout << -1 n ; return 0; } for (int i = 0; i < n; i++) { if (i == 0) { mp[v[i + 1].first - v[i].first]--; if (mp[v[i + 1].first - v[i].first] == 0) { mp.erase(v[i + 1].first - v[i].first); } if (mp.size() == 1) { cout << v[0].second << n ; return 0; } mp[v[i + 1].first - v[i].first]++; } else if (i == n - 1) { mp[v[i].first - v[i - 1].first]--; if (mp[v[i].first - v[i - 1].first] == 0) { mp.erase(v[i].first - v[i - 1].first); } if (mp.size() == 1) { cout << v[n - 1].second << n ; return 0; } mp[v[i].first - v[i - 1].first]++; } else { mp[v[i + 1].first - v[i].first]--; mp[v[i].first - v[i - 1].first]--; if (mp[v[i + 1].first - v[i].first] == 0) { mp.erase(v[i + 1].first - v[i].first); } if (mp[v[i].first - v[i - 1].first] == 0) { mp.erase(v[i].first - v[i - 1].first); } mp[v[i + 1].first - v[i - 1].first]++; if (mp.size() == 1) { cout << v[i].second << n ; return 0; } mp[v[i + 1].first - v[i - 1].first]--; if (mp[v[i + 1].first - v[i - 1].first] == 0) { mp.erase(v[i + 1].first - v[i - 1].first); } mp[v[i + 1].first - v[i].first]++; mp[v[i].first - v[i - 1].first]++; } } cout << -1 n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; int main() { ios::sync_with_stdio(false); cin.tie(NULL); int Q; cin >> Q; while (Q-- > 0) { int n; cin >> n; vector<int> dp(2001, inf); dp[0] = 0; for (int i = 0; i < n; ++i) { int a; cin >> a; vector<int> aux(dp); fill(dp.begin(), dp.end(), inf); for (int j = 0; j < 2001; ++j) { if (aux[j] != inf) { dp[max(0, j - a)] = min(dp[max(0, j - a)], aux[j] + a); if (j + a < 2001) { dp[j + a] = min(dp[j + a], max(0, aux[j] - a)); } } } } int res = inf; for (int i = 0; i <= 2000; ++i) { if (dp[i] != inf) { res = min(res, i + dp[i]); } } cout << res << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int n; long long x[100007], y[100007], xx, yy, m, p, q; long long ans; int get(int p, int q) { while ((x[q] - x[p]) * (yy - y[p]) - (y[q] - y[p]) * (xx - x[p]) <= 0) q = q % n + 1; q = (q + n - 2) % n + 1; return q; } int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %I64d%I64d , &x[i], &y[i]); for (cin >> m; m; m--) { cin >> xx >> yy; int now = 0; ans = 0; for (int i = 1; i <= n; i++) if ((xx - x[i]) * (y[i % n + 1] - y[i]) - (yy - y[i]) * (x[i % n + 1] - x[i]) < 0) now++; if (now != 0 && now != n) { cout << 0 << endl; continue; } for (p = 1, q = get(1, 1); p <= n; p++, q = get(p, q)) { int r = ((q - p) % n + n) % n; ans += ((long long)r) * (r - 1) / 2; } ans = ((long long)n * (n - 1) * (n - 2) / 6 - ans); cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MaxN = 100010, Block = 500, TB = 300; struct query { int l, r, id; bool operator<(const query &a) const { if (l / TB != a.l / TB) return l / TB < a.l / TB; return r < a.r; } } q[MaxN]; long long ans[MaxN]; int cnt[MaxN], num[MaxN], a[MaxN]; vector<int> large; bool vis[MaxN]; int n, m; int tmp[MaxN]; long long get_ans() { for (int i = 1; i <= Block * 2; ++i) tmp[i] = num[i]; long long ret = 0; int x = 1; for (int i = 1; i <= Block; ++i) { if (!tmp[i]) continue; if (tmp[i] >= 2) { ret += (tmp[i] / 2) * i * 2; tmp[i * 2] += tmp[i] / 2; tmp[i] &= 1; } if (tmp[i] & 1) { x = max(i + 1, x); while (tmp[x] == 0 && i + x <= Block * 2) ++x; if (i + x > Block * 2) break; ret += i + x; ++tmp[i + x]; --tmp[x]; } tmp[i] = 0; } priority_queue<int, vector<int>, greater<int> > Q; for (int i = 1; i <= Block * 2; ++i) for (int j = 1; j <= tmp[i]; ++j) Q.push(i); for (auto i : large) if (cnt[i] > Block * 2) Q.push(cnt[i]); while (Q.size() >= 2) { int x = Q.top(); Q.pop(); int y = Q.top(); Q.pop(); ret += x + y; Q.push(x + y); } return ret; } void reverse(int x) { int u = a[x]; if (vis[x]) { --num[cnt[u]]; --cnt[u]; ++num[cnt[u]]; } else { --num[cnt[u]]; ++cnt[u]; ++num[cnt[u]]; } vis[x] ^= 1; } void move(int &x, int p) { while (x > p) { reverse(x); --x; } while (x < p) { ++x; reverse(x); } } int main() { scanf( %d , &n); int mx = 0; for (int i = 1; i <= n; ++i) { scanf( %d , a + i); ++cnt[a[i]]; mx = max(mx, a[i]); } for (int i = 1; i <= mx; ++i) if (cnt[i] > Block * 2) large.push_back(i); memset(cnt, 0, sizeof(cnt)); scanf( %d , &m); for (int i = 1; i <= m; ++i) { scanf( %d%d , &q[i].l, &q[i].r); q[i].id = i; } sort(q + 1, q + m + 1); int l = 0, r = 0; for (int i = 1; i <= m; ++i) { move(l, q[i].l - 1); move(r, q[i].r); if (q[i].l == q[i - 1].l && q[i].r == q[i - 1].r) ans[q[i].id] = ans[q[i - 1].id]; else ans[q[i].id] = get_ans(); } for (int i = 1; i <= m; ++i) printf( %I64d n , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; int n, size[55]; double f[55][55], fac[55]; int cnt, head[55], to[110], nxt[110]; void add(int x, int y) { cnt++; to[cnt] = y; nxt[cnt] = head[x]; head[x] = cnt; } double c(int n, int m) { if (m < 0 || m > n) { return 0.0; } else { return fac[n] / fac[m] / fac[n - m]; } } void dfs(int x, int fa) { size[x] = 1; f[x][0] = 1.0; double tmp[55]; for (int i = head[x]; i; i = nxt[i]) { int y = to[i]; if (y == fa) { continue; } dfs(y, x); for (int j = 0; j < size[x] + size[y]; j++) { tmp[j] = 0.0; } for (int j = 0; j < size[y]; j++) { for (int k = 0; k < size[x]; k++) { for (int h = j + k + 1; h <= size[y] + k; h++) { tmp[h] += c(h, k) * c(size[x] + size[y] - 1 - h, size[x] - 1 - k) * f[x][k] * f[y][j] / 2.0; } tmp[j + k] += 1.0 * (size[y] - j) * c(j + k, j) * c(size[x] + size[y] - 1 - j - k, size[x] - 1 - k) * f[x][k] * f[y][j]; } } size[x] += size[y]; for (int j = 0; j < size[x]; j++) { f[x][j] = tmp[j]; } } } int main() { scanf( %d , &n); for (int i = 1; i < n; i++) { int x, y; scanf( %d%d , &x, &y); add(x, y); add(y, x); } fac[0] = 1.0; for (int i = 1; i <= n; i++) { fac[i] = fac[i - 1] * i; } for (int i = 1; i <= n; i++) { dfs(i, 0); printf( %.10lf n , f[i][n - 1] / fac[n - 1]); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const int SIZE = 1e6 + 5; const long long INF = 1LL << 58; const double eps = 1e-10; char d[2009][2009]; char a[2009][2009]; int dy[4] = {-1, 0, 1, 0}; int dx[4] = {0, 1, 0, -1}; int dy2[8] = {-2, -1, 0, 1, 2, 1, 0, -1}; int dx2[8] = {0, 1, 2, 1, 0, -1, -2, -1}; char v2[5] = ^>v< ; char v[5] = v<^> ; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < (n); ++i) { scanf( %s , (d[i])); for (int j = 0; j < (m); ++j) { if (d[i][j] == * ) a[i][j] = * ; else a[i][j] = . ; } } queue<pair<int, int> > q; for (int i = 0; i < (n); ++i) { for (int j = 0; j < (m); ++j) { if (d[i][j] == * ) continue; q.push(make_pair(i, j)); } } while (((int)(q).size())) { pair<int, int> cur = q.front(); q.pop(); int y = cur.first, x = cur.second; if (a[y][x] != . ) continue; int ck = -1; for (int k = 0; k < (4); ++k) { int ny = y + dy[k], nx = x + dx[k]; if (ny < 0 || ny >= n || nx < 0 || nx >= m) continue; if (a[ny][nx] == . ) { if (ck != -1) { ck = -1; break; } else ck = k; } } if (ck == -1) continue; int ny = y + dy[ck], nx = x + dx[ck]; a[y][x] = v[ck]; a[ny][nx] = v2[ck]; for (int k = 0; k < (8); ++k) { int ny = y + dy2[k], nx = x + dx2[k]; if (ny < 0 || ny >= n || nx < 0 || nx >= m) continue; q.push(make_pair(ny, nx)); } } for (int i = 0; i < (n); ++i) { for (int j = 0; j < (m); ++j) { if (a[i][j] == . ) { puts( Not unique ); return 0; } } } for (int i = 0; i < (n); ++i) { for (int j = 0; j < (m); ++j) { printf( %c , a[i][j]); } puts( ); } }
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > hop, top; int h, t, R; struct State { int h, t; int c; State() {} State(int h, int t, int c) : h(h), t(t), c(c) {} bool operator<(const State o) const { if (h != o.h) return h < o.h; return t < o.t; } }; vector<vector<int> > G; pair<int, int> BFS(State init) { queue<State> q; q.push(init); map<State, int> vis; int ii = 0; vis[init] = 0; G.resize(1); while (q.size()) { State& s = q.front(); State ns; for (int i = 0; i < min((int)hop.size(), s.h); i++) { ns = State(s.h - i - 1 + hop[i].first, s.t + hop[i].second, s.c + 1); if (ns.h == ns.t && ns.h == 0) { return make_pair(ns.c, 1); } if (ns.h + ns.t > R) { if (!vis.count(ns)) { vis[ns] = ++ii; G.resize(ii + 1); G[vis[s]].push_back(ii); } continue; } if (!vis.count(ns)) { q.push(ns); vis[ns] = ++ii; G.resize(ii + 1); G[vis[s]].push_back(ii); } else { G[vis[s]].push_back(vis[ns]); } } for (int i = 0; i < min((int)top.size(), s.t); i++) { ns = State(s.h + top[i].first, s.t + top[i].second - i - 1, s.c + 1); if (ns.h == ns.t && ns.h == 0) { return make_pair(ns.c, 1); } if (ns.h + ns.t > R) { if (!vis.count(ns)) { vis[ns] = ++ii; G.resize(ii + 1); G[vis[s]].push_back(ii); } continue; } if (!vis.count(ns)) { q.push(ns); vis[ns] = ++ii; G.resize(ii + 1); G[vis[s]].push_back(ii); } else { G[vis[s]].push_back(vis[ns]); } } q.pop(); } return make_pair(0, -1); } enum colors { WHITE, GREY, BLACK }; vector<int> color; bool hasLoop; void DFS(int node) { if (hasLoop) return; color[node] = GREY; for (int i = 0; i < G[node].size(); i++) { if (hasLoop) return; if (color[G[node][i]] == WHITE) { DFS(G[node][i]); } else if (color[G[node][i]] == GREY) { hasLoop = 1; return; } } color[node] = BLACK; } void Input() { cin >> h >> t >> R; int hs, ts; cin >> hs; hop.resize(hs); for (int i = 0; i < hs; i++) { cin >> hop[i].first >> hop[i].second; } cin >> ts; top.resize(ts); for (int i = 0; i < ts; i++) { cin >> top[i].first >> top[i].second; } } vector<int> dp; int recurse(int node) { if (dp[node] != -1) return dp[node]; int mx = 0; for (int i = 0; i < G[node].size(); i++) { mx = max(mx, recurse(G[node][i])); } return dp[node] = mx + 1; } void Solve() { Input(); State init(h, t, 0); auto ret = BFS(init); if (ret.second == 1) { cout << Ivan << endl; cout << ret.first; return; } color.resize(G.size()); DFS(0); if (hasLoop) { cout << Draw ; return; } dp.assign(G.size(), -1); cout << Zmey << endl << recurse(0) - 1; } int main() { Solve(); }
#include <bits/stdc++.h> using namespace std; int N; int K[1010]; pair<int, int> nex[1010][2520]; int P, Q; int num[1010][2520]; int vis[1010][2520]; class SCC { public: static const int MV = 1010 * 2520; vector<vector<int> > SC; int NV, GR[MV]; private: vector<int> E[MV], RE[MV], NUM; int vis[MV]; public: void init(int NV) { this->NV = NV; for (int i = 0; i < MV; i++) { E[i].clear(); RE[i].clear(); } } void add_edge(int x, int y) { E[x].push_back(y); RE[y].push_back(x); } void dfs(int cu) { vis[cu] = 1; for (int i = 0; i < E[cu].size(); i++) if (!vis[E[cu][i]]) dfs(E[cu][i]); NUM.push_back(cu); } void revdfs(int cu, int ind) { int i; vis[cu] = 1; GR[cu] = ind; SC[ind].push_back(cu); for (i = 0; i < (RE[cu].size()); i++) if (!vis[RE[cu][i]]) revdfs(RE[cu][i], ind); } void scc() { int c = 0; SC.clear(); SC.resize(MV); NUM.clear(); memset(vis, 0, sizeof(vis)); for (int i = 0; i < NV; i++) if (!vis[i]) dfs(i); memset(vis, 0, sizeof(vis)); for (int i = NUM.size() - 1; i >= 0; i--) if (!vis[NUM[i]]) { SC[c].clear(); revdfs(NUM[i], c); sort(SC[c].begin(), SC[c].end()); c++; } SC.resize(c); } }; int dfs(int v, int val, vector<int>& V) { if (vis[v][val] == 2) { set<int> S; int i; for (i = V.size() - 1; i >= 0; i--) { S.insert(V[i] / 2520); if (V[i] == v * 2520 + val) break; } num[v][val] = S.size(); } else if (vis[v][val] == 0) { vis[v][val] = 2; V.push_back(v * 2520 + val); num[v][val] = dfs(nex[v][val].first, nex[v][val].second, V); V.pop_back(); } vis[v][val] = 1; return num[v][val]; } void solve() { int i, j, k, l, r, x, y; string s; cin >> N; for (i = 0; i < (N); i++) { cin >> K[i]; K[i] = (K[i] % 2520 + 2520) % 2520; } for (i = 0; i < (N); i++) { vector<int> E; cin >> x; E.resize(x); for (j = 0; j < (x); j++) cin >> E[j]; for (j = 0; j < (2520); j++) { nex[i][j].first = E[(j + K[i]) % x] - 1; nex[i][j].second = (j + K[i]) % 2520; } } for (i = 0; i < (N); i++) for (j = 0; j < (2520); j++) if (vis[i][j] == 0) { vector<int> V; dfs(i, j, V); } cin >> Q; while (Q--) { cin >> x >> y; x--; y = (y % 2520 + 2520) % 2520; cout << num[x][y] << endl; } } int main(int argc, char** argv) { string s; int i; if (argc == 1) ios::sync_with_stdio(false), cin.tie(0); for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += n ; for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin); cout.tie(0); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; void ingraph(vector<long long> graph[], long long m) { long long x, y; for (long long i = 0; i < m; i++) { cin >> x >> y; x--, y--; graph[x].push_back(y); graph[y].push_back(x); } } long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } long long modmulti(long long a, long long b) { return ((a % mod) * 1ll * (b % mod)) % mod; } long long modadd(long long a, long long b) { long long asdfgh = ((a % mod) + (b % mod) + mod + mod) % mod; asdfgh = (asdfgh + mod) % mod; return asdfgh; } long long modpower(long long a, long long n) { if (n == 0) return 1; if (n == 1) return a % mod; long long b = modpower(a, n / 2); b = modmulti(b, b); if (n % 2 == 0) return b; return modmulti(a, b); } long long modinv(long long a) { return modpower(a, mod - 2); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); long long t; cin >> t; while (t--) { long long n; cin >> n; long long sum = 0; vector<long long> vec; for (long long i = 1; i <= n; i = i * 2) { vec.push_back(i); n = n - i; } if (n > 0) { vec.push_back(n); } sort(vec.begin(), vec.end()); cout << (long long)(vec).size() - 1 << n ; for (long long i = 1; i < (long long)(vec).size(); i++) cout << vec[i] - vec[i - 1] << ; cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { string s; cin >> s; int n = s.length(); if (n < 3) { cout << 0 << endl; continue; } if (n == 3) { if (s == 101 || s == 010 ) cout << 1 << endl; else cout << 0 << endl; continue; } long long int zero = 0, one = 0; for (long long int i = 0; i < n; i++) { if (s[i] == 1 ) one++; else zero++; } if (one == n || zero == n) { cout << 0 << endl; continue; } long long int done = 0, dzero = 0; long long int min1 = INT_MAX, min2 = INT_MAX; for (long long int i = 0; i < n; i++) { if (s[i] == 1 ) done++; else dzero++; min1 = min(min1, (dzero + one - done)); min2 = min(min2, (done + zero - dzero)); } cout << min(min1, min2) << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, neg = 0; char s[1009]; int main() { vector<int> ans; scanf( %[^=]=%d , s, &n); ans.push_back(n); for (int i = 1; s[i]; i++) { if (s[i] == ) continue; if (s[i] == - ) neg = 1; else if (s[i] == + ) neg = 0; else if (s[i] == ? && !neg) { ans[0] -= 1; ans.push_back(1); } else if (s[i] == ? ) { int c = 0; ans[0] += 1; ans.push_back(-1); } } int c = 1; while (ans[0] > n && c < ans.size()) { if (ans[c] > 0 && ans[c] < n) { ans[0]--; ans[c]++; } else c++; } c = 1; while (ans[0] <= 0 && c < ans.size()) { if (ans[c] < 0 && abs(ans[c]) < n) { ans[0]++; ans[c]--; } else c++; } if (ans[0] <= 0 || ans[0] > n) { printf( Impossible n ); return 0; } printf( Possible n ); printf( %d , ans[0]); for (int i = 1; i < ans.size(); i++) { if (ans[i] > 0) printf( + %d , ans[i]); else printf( - %d , abs(ans[i])); } printf( = %d n , n); return 0; }
#include <bits/stdc++.h> using namespace std; int gcd(int x, int y) { if (y == 0) return x; return gcd(y, x % y); } int main() { int n; cin >> n; int ansx = 0, ansy = 0; for (int i = 1; i < n; i++) { int j = n - i; if (j <= i) break; if (gcd(i, j) != 1) continue; ansx = i; ansy = j; } cout << ansx << << ansy << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f, N = 1005, MOD = 100000007; const double eps = 1e-6; int a[15], m, ans[N], ct; char b; int main() { ct = 0; for (int i = 1; i <= 10; i++) { scanf( %c , &b); if (b == 1 ) { a[ct++] = i; } } scanf( %d , &m); bool flag = 0; int s[2], tmp; int i, j, tail; for (int k = 0; k < ct; k++) { s[0] = s[1] = 0; s[0] = ans[0] = a[k]; tail = k; tmp = 1; for (i = 1; i < m; i++) { for (j = 0; j < ct; j++) { if (j == tail) continue; if (s[tmp] + a[j] > s[tmp ^ 1]) { s[tmp] += a[j]; ans[i] = a[j]; tail = j; tmp ^= 1; break; } } if (j == ct) { flag = 0; break; } } if (i == m) { flag = 1; break; } } if (flag) { printf( YES n ); for (int k = 0; k < m; k++) { printf( %d , ans[k]); } puts( ); } else printf( NO n ); return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 1e17; long long n, k, niv[200005]; vector<long long> muchii[200005]; bool isleaf[200005], used[200005]; long long red, blue, par[200005]; vector<long long> line; long long timp, in[200005], out[200005]; struct date { long long minim, best; } arb[1400005]; long long lazy[1400005]; void dfs(int nod) { if (nod == 1) niv[nod] = 1; else if (muchii[nod].size() == 1) isleaf[nod] = 1; timp++; line.push_back(nod); in[nod] = timp; for (auto i : muchii[nod]) if (i != par[nod]) { niv[i] = niv[nod] + 1; par[i] = nod; dfs(i); } out[nod] = timp; } void prop(int nod) { long long val = lazy[nod]; arb[nod * 2].minim += val; arb[nod * 2 + 1].minim += val; lazy[nod * 2] += val; lazy[nod * 2 + 1] += val; } void update(int nod, int st, int dr, int a, int b, long long val) { if (lazy[nod] != 0 && st != dr) prop(nod); lazy[nod] = 0; if (st >= a && dr <= b) { arb[nod].minim += val; if (st == dr && isleaf[line[st]]) arb[nod].best = line[st]; else lazy[nod] += val; return; } int mij = (st + dr) / 2; if (a <= mij) update(nod * 2, st, mij, a, b, val); if (b > mij) update(nod * 2 + 1, mij + 1, dr, a, b, val); arb[nod].minim = arb[nod].best = 0; if (arb[nod * 2].best > 0 && arb[nod * 2].minim > arb[nod].minim) arb[nod] = arb[nod * 2]; if (arb[nod * 2 + 1].best > 0 && arb[nod * 2 + 1].minim > arb[nod].minim) arb[nod] = arb[nod * 2 + 1]; } int main() { cin >> n >> k; for (int i = 1; i < n; i++) { int a, b; cin >> a >> b; muchii[a].push_back(b); muchii[b].push_back(a); } line.push_back(0); dfs(1); for (int i = 1; i <= n; i++) update(1, 1, n, in[i], in[i], niv[i]); long long ans = -INF; blue = n; red = 0; while (red <= k) { long long val = red * (n - red); long long x = min(n / 2, blue); val -= x * (n - x); ans = max(ans, val); long long nod = arb[1].best; red++; while (nod > 0 && !used[nod]) { used[nod] = 1; update(1, 1, n, in[nod], out[nod], -1); blue--; nod = par[nod]; } } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int g[65]{0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10}; const int MAXN = 1000007; int s[MAXN]; map<pair<int, long long>, int> dp; int grundy(pair<int, long long> s) { if (dp.find(s) != dp.end()) return dp[s]; long long mask = s.second; int &res = dp[s]; set<int> S; for (int i = 1; i <= 60; i++) { if (!(mask & (1ll << i)) && s.first >= i) { S.insert(grundy(make_pair(s.first - i, (mask | (1ll << i))))); } } while (S.count(res) > 0) res++; return res; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &s[i]); } if (n == 1) printf( NO n ); else { int XOR = 0; for (int i = 0; i < n; i++) { XOR ^= grundy(make_pair(s[i], 0)); } if (XOR == 0) printf( YES n ); else printf( NO n ); } return 0; }
#include <bits/stdc++.h> using namespace std; void cline() { cout << n ; } template <typename T, typename... V> void cline(T t, V... v) { cout << t; if (sizeof...(v)) cout << ; cline(v...); } void cspc() { cout << ; } template <typename T, typename... V> void cspc(T t, V... v) { cout << t; if (sizeof...(v)) cout << ; cspc(v...); } int n; int a[105]; int dp[104][52][52][2]; int calc(int indx, int even, int odd, int pre) { if (indx == n) return 0; if (dp[indx][even][odd][pre] != -1) return dp[indx][even][odd][pre]; if (indx == 0) { if (a[indx] == 0) { if (even == 0) { return dp[indx][even][odd][pre] = calc(indx + 1, even, odd - 1, 1); } else if (odd == 0) { return dp[indx][even][odd][pre] = calc(indx + 1, even - 1, odd, 0); } else { return dp[indx][even][odd][pre] = min(calc(indx + 1, even, odd - 1, 1), calc(indx + 1, even - 1, odd, 0)); } } else { return dp[indx][even][odd][pre] = calc(indx + 1, even, odd, a[indx] % 2); } } else { if (a[indx] == 0) { if (even == 0) { if (pre % 2 == 0) { return dp[indx][even][odd][pre] = calc(indx + 1, even, odd - 1, 1) + 1; } else { return dp[indx][even][odd][pre] = calc(indx + 1, even, odd - 1, 1); } } else if (odd == 0) { if (pre % 2 == 1) { return dp[indx][even][odd][pre] = calc(indx + 1, even - 1, odd, 0) + 1; } else { return dp[indx][even][odd][pre] = calc(indx + 1, even - 1, odd, 0); } } else { if (pre % 2 != 0) { return dp[indx][even][odd][pre] = min(calc(indx + 1, even, odd - 1, 1), calc(indx + 1, even - 1, odd, 0) + 1); } else { return dp[indx][even][odd][pre] = min(calc(indx + 1, even, odd - 1, 1) + 1, calc(indx + 1, even - 1, odd, 0)); } } } else { if (a[indx] % 2 != pre % 2) { return dp[indx][even][odd][pre] = calc(indx + 1, even, odd, a[indx] % 2) + 1; } else { return dp[indx][even][odd][pre] = calc(indx + 1, even, odd, a[indx] % 2); } } } } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; int even = n / 2, odd = (n + 1) / 2; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 0) even--; else odd--; if (a[i] == 0) even++; } for (int in1 = 0; in1 < 104; in1++) { for (int in2 = 0; in2 < 52; in2++) { for (int in3 = 0; in3 < 52; in3++) { dp[in1][in2][in3][0] = -1; dp[in1][in2][in3][1] = -1; } } } cspc(calc(0, even, odd, 0)); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 3; int n, m, dp[N], vis[2][N]; vector<int> adj[2][N]; vector<pair<int, int>> e; void dfs(int u, int dir) { vis[dir][u] = 1; for (int v : adj[dir][u]) if (!vis[dir][v]) dfs(v, dir); } int main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; for (int i = 0, u, v; i < m; i++) { cin >> u >> v; adj[0][u].push_back(v); adj[1][v].push_back(u); e.push_back({u, v}); } dfs(1, 0), dfs(n, 1); for (int i = 0; i < n - 1; i++) for (auto [u, v] : e) if (vis[0][u] & vis[1][v]) { dp[u] = min(dp[u], dp[v] + 2); dp[v] = min(dp[v], dp[u] - 1); } for (auto [u, v] : e) if (vis[0][u] & vis[1][v] & (dp[u] > dp[v] + 2 || dp[v] > dp[u] - 1)) return cout << No << endl, 0; cout << Yes << endl; for (auto [u, v] : e) cout << (vis[0][u] & vis[1][v] ? dp[u] - dp[v] : 1) << endl; }
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e6 + 10; long long a[maxn], b[maxn], ans[maxn]; int32_t main() { long long n; cin >> n; for (long long i = 0; i < n; i++) { cin >> a[i]; b[i] = a[i]; } sort(b, b + n); if (b[0] == b[n - 1]) { if (b[0] == 0) { cout << YES << n ; for (long long i = 0; i < n; i++) cout << 1 ; } else cout << NO ; exit(0); } long long pos = -1, mx = b[n - 1]; for (long long i = 0; i < n; i++) { if (a[i] == mx && a[(i - 1 + n) % n] != mx) pos = i; } ans[pos] = a[pos]; bool bad = 1; for (long long i = (pos - 1 + n) % n; i != pos; i = (i - 1 + n) % n) { if (a[i] == 0 && bad) ans[i] = ans[(i + 1) % n] * 2LL, bad = 0; else ans[i] = ans[(i + 1) % n] + a[i]; } cout << YES << n ; for (long long i = 0; i < n; i++) cout << ans[i] << ; }
#include <bits/stdc++.h> using namespace std; const int N = 105; long long l, r, dp[N]; long long gao(long long n) { long long m = n, ans = 0; int bit[N], len = 0; while (n) { bit[++len] = n % 2; n /= 2; } for (int i = 2; i < len; i++) { memset(dp, 0, sizeof(dp)); dp[1] = 1; for (int j = 2; j < i; j++) { if (i % j) continue; dp[j] += 1LL << (j - 1); } for (int j = 1; j <= i; j++) { for (int k = 2; k * j < i; k++) if (i % (k * j) == 0) dp[j * k] -= dp[j]; } for (int j = 1; j <= i; j++) ans += dp[j]; } for (int i = len; i <= len; i++) { memset(dp, 0, sizeof(dp)); for (int j = 1; j < i; j++) { if (i % j) continue; for (int k = len; k > len - j; k--) { if (k != len && bit[k] == 1) { dp[j] += 1LL << (k - (len - j) - 1); } } long long sum = 0; for (int k = len; k > len - j; k--) { if (bit[k] == 0) continue; for (int r = k; r > 0; r -= j) { sum += 1LL << (r - 1); } } if (sum <= m) dp[j]++; } for (int j = 1; j <= i; j++) { for (int k = 2; k * j < i; k++) if (i % (k * j) == 0) dp[j * k] -= dp[j]; } for (int j = 1; j <= i; j++) ans += dp[j]; } return ans; } int main() { while (cin >> l >> r) { cout << gao(r) - gao(l - 1) << endl; } return 0; }
#include <bits/stdc++.h> int setBit(int N, int pos) { return N = N | (1 << pos); } int resetBit(int N, int pos) { return N = N & ~(1 << pos); } bool checkBit(int N, int pos) { return (bool)(N & (1 << pos)); } using namespace std; const int maxn = 100000; int n, m, cost[maxn + 5], okayRoad[maxn + 5], par[maxn + 5]; vector<int> graph[maxn + 5], flag[maxn + 5]; map<pair<int, int>, int> mapp, out; map<pair<int, int>, int>::iterator it; void bfs() { queue<int> q; int i, u, v; memset(cost, 63, sizeof(cost)); ; cost[1] = 0; par[1] = 1; q.push(1); while (!q.empty()) { u = q.front(); q.pop(); int siz = (int)graph[u].size(); for (i = 0; i < siz; i++) { v = graph[u][i]; if (cost[u] + 1 < cost[v]) { cost[v] = cost[u] + 1; okayRoad[v] = okayRoad[u] + flag[u][i]; par[v] = u; q.push(v); } else if (cost[u] + 1 == cost[v] && okayRoad[u] + flag[u][i] > okayRoad[v]) { okayRoad[v] = okayRoad[u] + flag[u][i]; par[v] = u; q.push(v); } } } } void giveOutput() { int u, v = n; vector<int> path; path.push_back(n); while (v != par[v]) { v = par[v]; path.push_back(v); } int i, j, siz = (int)path.size(); for (i = 1; i < siz; i++) { u = path[i - 1]; v = path[i]; if (u > v) swap(u, v); if (mapp[pair<int, int>(u, v)] == 0) out[pair<int, int>(u, v)] = 1; mapp[pair<int, int>(u, v)] = -1; } for (__typeof((mapp).begin()) it = (mapp).begin(); it != (mapp).end(); it++) { if (it->second == 1) out[it->first] = 0; } printf( %d n , (int)out.size()); for (__typeof((out).begin()) it = (out).begin(); it != (out).end(); it++) { cout << it->first.first << << it->first.second << << it->second << n ; } } int main() { int i, u, v, w; scanf( %d %d , &n, &m); for (i = 0; i < m; i++) { scanf( %d %d %d , &u, &v, &w); if (u > v) swap(u, v); graph[u].push_back(v); graph[v].push_back(u); flag[u].push_back(w); flag[v].push_back(w); mapp[pair<int, int>(u, v)] = w; } bfs(); giveOutput(); return 0; }
#include <bits/stdc++.h> using namespace std; int a[301][301], h, w, dp[301][301]; int used[601][601]; int dx[] = {0, 1, -1, 0, 0, 1, -1, 1, -1}; int dy[] = {0, 0, 0, 1, -1, 1, 1, -1, -1}; int read() { int x; scanf( %d , &x); return x; } bool check(int x, int y) { if (x >= 1 && x <= h && y >= 1 && y <= w && !used[x][y]) return true; else return false; } void dfs(int x, int y, int component) { used[x][y] = component; for (int i = 1; i <= 8; i++) { int kx = dx[i] + x, ky = dy[i] + y; if (check(kx, ky) && a[x][y] == a[kx][ky]) { dfs(kx, ky, component); } } } void init() { for (int i = 0; i <= 600; i++) { for (int j = 0; j <= 600; j++) { used[i][j] = 0; } } } int main() { int q; q = read(); while (q--) { h = read(), w = read(); init(); for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { a[i][j] = read(); } } int cntfirst = 0, cntsecond = 0; for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { if (!used[i][j]) dfs(i, j, cntfirst + 1), cntfirst++; } } for (int i = h / 2 + 1; i <= h; i++) { for (int j = 1; j <= w; j++) { dp[i - h / 2][j] = a[i][j]; } } for (int i = 1; i <= h / 2; i++) { for (int j = 1; j <= w; j++) { dp[i + h / 2][j] = a[i][j]; } } for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { a[i][j] = dp[i][j]; } } init(); for (int i = 1; i <= h; i++) { for (int j = 1; j <= w; j++) { if (!used[i][j]) dfs(i, j, cntsecond + 1), cntsecond++; } } if (cntfirst <= cntsecond) { printf( NO n ); } else { printf( YES n ); } } }
#include <bits/stdc++.h> using namespace std; const int N = 22e4; char s[N * 2]; int l[N * 2], r[N * 2]; int main() { ios::sync_with_stdio(0); int n, k; cin >> n >> k >> s; for (int i = 0; i < n; i++) s[i + n] = s[i]; for (int i = 0, lx = -2e9; i < n * 2; i++) { if (s[i] == s[i + 1]) lx = i + 1; l[i + 1] = lx; } for (int i = n * 2 - 1, rx = 2e9; i > 0; i--) { if (s[i] == s[i - 1]) rx = i - 1; r[i - 1] = rx; } for (int i = 0; i < n; i++) { if (i + n - l[i + n] < r[i] - i) { if (i + n - l[i + n] <= k) cout << s[l[i + n]]; else if (k & 1) cout << (s[i] == W ? B : W ); else cout << s[i]; } else { if (r[i] - i <= k) cout << s[r[i]]; else if (k & 1) cout << (s[i] == W ? B : W ); else cout << s[i]; } } return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = 2.0 * acos(0.0); const double E = exp(1); template <class T1> void deb(T1 e) { cout << e << endl; } template <class T1, class T2> void deb(T1 e1, T2 e2) { cout << e1 << << e2 << endl; } template <class T1, class T2, class T3> void deb(T1 e1, T2 e2, T3 e3) { cout << e1 << << e2 << << e3 << endl; } template <class T1, class T2, class T3, class T4> void deb(T1 e1, T2 e2, T3 e3, T4 e4) { cout << e1 << << e2 << << e3 << << e4 << endl; } template <class T1, class T2, class T3, class T4, class T5> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; } template <class T1, class T2, class T3, class T4, class T5, class T6> void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 << endl; } template <typename T> inline T sqr(T n) { return n * n; } inline double hypot(double x, double y) { return sqrt(sqr(x) + sqr(y)); } template <typename T> inline T pmod(T n, T m) { return ((n % m) + m) % m; } template <typename T> T power(T n, int p) { return (p == 0) ? (T)(1) : (sqr(power(n, p >> 1)) * ((p & 1) * (n - 1) + 1)); } template <typename T> T bigmod(T n, int p, T m) { return (p == 0) ? (T)(1) : ((sqr(bigmod(n, p >> 1, m)) % m) * ((p & 1) * (n - 1) % m + 1)) % m; } bool dp[21][(1 << 6)][11][11][11][11][11]; int row[6], col[23]; int r, c; vector<int> save[10]; int calc(int mask) { int cnt = 0; int prv = 0; for (int i = 0; i < r; i++) { if (!prv && (mask & (1 << i))) { cnt++; } prv = mask & (1 << i); } return cnt; } char grid[6][21]; int tmp[10]; bool complet = 0; void rec(int now, int prv_maks, int r1, int r2, int r3, int r4, int r5) { if (r1 < 0 || r2 < 0 || r3 < 0 || r4 < 0 || r5 < 0) return; if (complet) return; if (dp[now][prv_maks][r1][r2][r3][r4][r5]) return; dp[now][prv_maks][r1][r2][r3][r4][r5] = 1; if (now == c) { if (r1 + r2 + r3 + r4 + r5 == 0) { for (int i = 0; i < r; ++i) { for (int j = 0; j < c; ++j) printf( %c , grid[i][j]); printf( n ); } complet = 1; } return; } int mask = 0; for (int i = 0; i < (int)save[col[now]].size(); i++) { mask = save[col[now]][i]; tmp[0] = r1; tmp[1] = r2; tmp[2] = r3; tmp[3] = r4; tmp[4] = r5; for (int j = 0; j < r; j++) { if (!(prv_maks & (1 << j)) && (mask & (1 << j))) { tmp[j]--; } } for (int j = 0; j < r; j++) { grid[j][now] = (mask & (1 << j)) ? * : . ; } rec(now + 1, mask, tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]); if (complet) return; } } int main() { scanf( %d %d , &r, &c); for (int i = 0; i < r; ++i) scanf( %d , &row[i]); for (int i = 0; i < c; ++i) { scanf( %d , &col[i]); }; int lim = 1 << r; for (int i = 0; i < (1 << r); i++) { save[calc(i)].push_back(i); } rec(0, 0, row[0], row[1], row[2], row[3], row[4]); }
#include <bits/stdc++.h> using namespace std; int main() { long long int p, d; cin >> p >> d; long long int temp = 1; long long int po[19]; for (int i = 0; i <= 18; ++i) { po[i] = temp; temp *= 10; } int i = 1; temp = p; while (1) { long long int t = temp % po[i]; t /= po[i - 1]; long long int x = temp; x -= (t * po[i - 1]); x += (9 * po[i - 1]); if (p - x >= 0 && p - x <= d) { i++; temp = x; continue; } if ((p - x + po[i]) <= d && x - po[i] >= 0) { x -= po[i]; temp = x; i++; } else break; } cout << temp; }
#include <bits/stdc++.h> using namespace std; int n, a[5005], dp[5005], b[5005]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); dp[0] = 0; for (int i = 1; i <= n; i++) { int p = i, s = a[i]; while (p > 0 && s < b[p - 1]) { s += a[p - 1]; p--; } dp[i] = dp[p - 1] + i - p; b[i] = s; } printf( %d n , dp[n]); return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 5; vector<int> a[maxn]; int res[maxn]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) { int q, w; scanf( %d%d , &q, &w); a[q].push_back(w); } int ms = 0; for (int i = 1; i <= m; i++) { int sump = a[i].size(); sort(a[i].begin(), a[i].end()); ms = max(sump, ms); int sum = 0; for (int j = sump - 1; j >= 0; j--) { sum += a[i][j]; if (sum >= 0) res[sump - j] += sum; else break; } } int max1 = 0; for (int i = 1; i <= ms; i++) max1 = max(res[i], max1); printf( %d n , max1); }
#include <bits/stdc++.h> using namespace std; long long s(long long x) { long long sum = 0; while (x) { sum += x % 10; x /= 10; } return sum; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long T; T = 1; while (T--) { long long n, i, x, ans = -1; cin >> n; x = sqrt(n); for (i = 1; i <= 90; i++) { long long l, r; l = 1; r = x; while (l <= r) { long long m = l + (r - l) / 2; long long z = m * m + m * i; if (z == n && s(m) == i) ans = m, r = m - 1; else if (z < n) l = m + 1; else r = m - 1; } } cout << ans << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int N = 4000; const int INF = 1e9; struct edge { int to, c, f, back; edge(int to, int c, int f, int back) : to(to), c(c), f(f), back(back) {} }; vector<edge> g[N]; vector<int> d(N), ptr(N); int n, h, m; int s, t; void add_edge(int v, int u, int c) { g[v].push_back({u, c, 0, (int)g[u].size()}); g[u].push_back({v, 0, 0, (int)g[v].size() - 1}); } bool bfs() { fill(d.begin(), d.end(), INF); d[s] = 0; queue<int> q; q.push(s); while ((int)q.size()) { int v = q.front(); q.pop(); for (auto i : g[v]) { if (i.c > i.f && d[i.to] == INF) { d[i.to] = d[v] + 1; q.push(i.to); } } } return d[t] != INF; } int dfs(int v, int cur_flow = INF) { if (v == t || cur_flow == 0) return cur_flow; for (int i = ptr[v]; i < (int)g[v].size(); i++) { int u = g[v][i].to; if (d[v] + 1 == d[u]) { int push = dfs(u, min(cur_flow, g[v][i].c - g[v][i].f)); if (push) { g[v][i].f += push; g[u][g[v][i].back].f -= push; return push; } } ptr[v]++; } return 0; } int maxFlow() { int ret = 0; while (bfs()) { int cur = dfs(s); fill(ptr.begin(), ptr.end(), 0); while (cur) { ret += cur; cur = dfs(s); } } return ret; } int get_hash(int x, int y) { return x * 52 + y; } signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> h >> m; s = 0, t = N - 1; for (int i = 0; i < n; i++) { add_edge(s, get_hash(i, 0), INF); for (int j = 0; j <= h; j++) { add_edge(get_hash(i, j), get_hash(i, j + 1), h * h - j * j); add_edge(get_hash(i, j + 1), get_hash(i, j), INF); } add_edge(get_hash(i, h), t, 0); } int st = 50 * 55 + 10; assert(st + m < N); for (int i = 0; i < m; i++) { int l, r, x, c; cin >> l >> r >> x >> c; if (x == h) continue; l--; r--; for (int j = l; j <= r; j++) { add_edge(get_hash(j, x + 1), st + i, INF); } add_edge(st + i, t, c); } cout << n * h * h - maxFlow() << n ; }
#include <bits/stdc++.h> using namespace std; string A[18][18], s; int n, m, U[101], us, J[3][3]; bool B[1001]; int r1, c1, r2, c2, size; int tonum(char ch) { if (ch == C ) return 1; if (ch == D ) return 2; if (ch == H ) return 3; if (ch == S ) return 4; if (ch == T ) return 8; if (ch == J ) return 9; if (ch == Q ) return 10; if (ch == K ) return 11; if (ch == A ) return 12; return (int)ch - 50; } inline bool inside(int a, int b, int c) { if (b > c) swap(b, c); return (b <= a && a <= c); } inline bool ff(int r, int c) { bool B[13]; for (int i = 0; i <= 12; i++) B[i] = false; for (int i = r; i <= r + 2; i++) for (int j = c; j <= c + 2; j++) { if (B[tonum(A[i][j][0])]) return false; B[tonum(A[i][j][0])] = true; } return true; } inline bool check() { for (int i = 1; i <= size; i++) for (int j = i + 1; j <= size; j++) { r1 = (i % m) ? i / m + 1 : i / m; c1 = (i % m) ? (i % m) : m; r2 = (j % m) ? j / m + 1 : j / m; c2 = (j % m) ? (j % m) : m; if (!(inside(r2, r1, r1 + 2) && inside(c2, c1, c1 + 2)) && !(inside(r2, r1, r1 + 2) && inside(c2 + 2, c1, c1 + 2)) && inside(r1 + 2, 1, n) && inside(r2 + 2, 1, n) && inside(c1 + 2, 1, m) && inside(c2 + 2, 1, m)) { if (ff(r1, c1) && ff(r2, c2)) return true; } } return false; } char torank(int k) { int r = (k % 4) ? k / 4 + 1 : k / 4; if (r <= 8) return (char)(r + 49); if (r == 9) return T ; if (r == 10) return J ; if (r == 11) return Q ; if (r == 12) return K ; if (r == 13) return A ; } char tosuit(int k) { int r = k % 4; if (r == 0) return S ; if (r == 1) return C ; if (r == 2) return D ; if (r == 3) return H ; } inline bool replacee(int j, int k) { if (J[j][1] == 0) return false; A[J[j][1]][J[j][2]][0] = torank(k); A[J[j][1]][J[j][2]][1] = tosuit(k); return true; } string print(int k) { char A[3]; A[0] = torank(k); A[1] = tosuit(k); A[2] = 0 ; string str(A); return str; } void printt() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) cout << A[i][j][0] << A[i][j][1] << ; cout << endl; } cout << endl; } int main() { bool rep1, rep2; cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { cin >> s; A[i][j].assign(s); if (s[0] == J ) { if (s[1] == 1 ) { J[1][1] = i; J[1][2] = j; } else if (s[1] == 2 ) { J[2][1] = i; J[2][2] = j; } } B[tonum(s[0]) * 4 + tonum(s[1])] = true; } size = n * m; for (int i = 1; i <= 52; i++) if (!B[i]) U[us++] = i; for (int i = 0; i < us; i++) for (int j = 0; j < us; j++) if (i != j) { rep1 = replacee(1, U[i]); rep2 = replacee(2, U[j]); if (check()) { cout << Solution exists. << endl; if (!rep1 && !rep2) cout << There are no jokers. << endl; else if (rep1 && rep2) cout << Replace J1 with << print(U[i]) << and J2 with << print(U[j]) << . << endl; else if (rep1) cout << Replace J1 with << print(U[i]) << . << endl; else if (rep2) cout << Replace J2 with << print(U[j]) << . << endl; cout << Put the first square to ( << r1 << , << c1 << ). << endl; cout << Put the second square to ( << r2 << , << c2 << ). << endl; return 0; } } cout << No solution. << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, n; int x; cin >> t; while (t--) { cin >> n; map<int, int> m; for (int i = 0; i < n; i++) { cin >> x; m[x] = 1; } cout << m.size() << endl; } }
#include <bits/stdc++.h> int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; } int min(int a, int b) { return a < b ? a : b; } int max(int a, int b) { return a > b ? a : b; } int rev(int n) { int r = 0; for (int i = 0; i < 8; i++) r = r | (((n >> i) & 1) << (7 - i)); return r; } char c; int n; int main() { int p = 0, t; while (1) { scanf( %c , &c); if (c < 32 || c > 126) break; t = (256 + rev(p) - rev(c)) % 256; p = c; printf( %d n , t); } return 0; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-9; const long long int mod = 1e9 + 7; long long int pow(long long int x, long long int y) { long long int sum = 1; for (long long int i = 0; i < y; ++i) { sum *= x; sum %= mod; } return sum; } int main(void) { long long int k, p; cin >> p >> k; if (k == 0) { cout << pow(p, p - 1) << endl; return 0; } if (k == 1) { cout << pow(p, p) << endl; return 0; } int o = 1; long long int prod = k; while (prod != 1) { prod *= k; prod %= p; o++; } assert((p - 1) % o == 0); cout << pow(p, (p - 1) / o) << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; long long sum1 = 0, sum2 = 0; vector<long long> one, two; int last = 0; for (int i = 0; i < n; i++) { int temp; scanf( %d , &temp); if (temp < 0) { two.push_back(abs(temp)); sum2 += abs(temp); last = 2; } else { one.push_back(temp); sum1 += temp; last = 1; } } if (sum1 != sum2) { if (sum1 > sum2) puts( first ); else puts( second ); return 0; } for (int i = 0; i < min(one.size(), two.size()); i++) { if (one[i] != two[i]) { if (one[i] < two[i]) puts( second ); else if (one[i] > two[i]) puts( first ); return 0; } } if (one.size() != two.size()) { if (one.size() > two.size()) puts( first ); else puts( second ); return 0; } if (last == 1) puts( first ); else puts( second ); }
#include <bits/stdc++.h> using namespace std; const int MXN = 300300; int n, a[MXN], match[MXN], cnt[MXN]; map<int, int> prevMatch[MXN]; int main() { int T; scanf( %d , &T); for (int t = 1; t <= T; ++t) { scanf( %d , &n); for (int i = 1; i <= n; ++i) { scanf( %d , &a[i]); match[i] = cnt[i] = 0; prevMatch[i].clear(); } for (int i = 2; i <= n; ++i) { if (a[i] == a[i - 1]) { match[i] = i - 1; } else { match[i] = max(0, prevMatch[i - 1][a[i]]); } if (match[i] > 1) { swap(prevMatch[i], prevMatch[match[i] - 1]); prevMatch[i][a[match[i] - 1]] = match[i] - 1; } } long long res = 0; for (int i = 2; i <= n; ++i) { if (match[i] == 0) continue; cnt[i] = cnt[match[i] - 1] + 1; res += cnt[i]; } cout << res << n ; } fclose(stdin); return 0; }
#include <bits/stdc++.h> using namespace std; long long mod = 998244353; long long power(long long x, long long y) { long long z = 1; while (y > 0) { if (y % 2) z = z * x; x = x * x; y /= 2; } return z; } long long gcd(long long a, long long b) { if (a < b) return gcd(b, a); if (b == 0) return a; return gcd(b, a % b); } long long min(long long a, long long b) { if (a < b) return a; return b; } long long max(long long a, long long b) { if (a > b) return a; return b; } void solve() { string s; cin >> s; vector<long long> v; long long n = s.size(), cnt = 0; for (long long i = 0; i < n; i++) { if (s[i] == 1 ) v.push_back(i); } if (v.empty()) { cout << 0 << endl; return; } for (long long i = v[0]; i < v[v.size() - 1]; i++) { if (s[i] == 0 ) cnt++; } cout << cnt << endl; } int main() { long long t; cin >> t; while (t--) { solve(); } }
#include <bits/stdc++.h> inline int lb(int a) { return a & (-a); } long long a[100100], bit[7][15][100100]; int n, m, t; inline void adj(int z, int zm, int pos, long long val) { for (int i = pos; i <= n; i += lb(i)) bit[z][zm][i] += val; } inline long long qry(int z, int zm, int pos) { if (pos <= 0) return 0; long long rt = 0; for (int i = pos; i > 0; i -= lb(i)) rt += bit[z][zm][i]; return rt; } inline long long sum(int z, int zm, int l, int r) { int z2 = z * 2 - 2; int lb = l + zm - 1, rb = r; if (lb > r) return 0; while (rb % z2 != lb % z2) rb--; lb -= z2; if (rb < l) return 0; return qry(z, rb % z2, rb) - qry(z, lb % z2, lb); } inline int s(int z, int i) { int mod = i % (2 * z - 2); if (mod == 0) return 2; else if (mod <= z) return mod; else return 2 * z - mod; } inline void update(int p, int v) { for (int z = 2; z <= 6; z++) { int z2 = z * 2 - 2; adj(z, p % z2, p, v - a[p]); } a[p] = v; } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int in; scanf( %d , &in); update(i, in); } scanf( %d , &m); while (m-- > 0) { scanf( %d , &t); if (t == 1) { int p, v; scanf( %d%d , &p, &v); update(p, v); } else { int l, r, z; scanf( %d%d%d , &l, &r, &z); long long ans = 0; int z2 = z * 2 - 2; for (int i = 1; i <= z2; i++) { ans += s(z, i) * sum(z, i, l, r); } printf( %I64d n , ans); } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const long long MAX = 1e6 + 5; bool cmp(const pair<long long, long long> &a, const pair<long long, long long> &b) { if (a.first < b.first) return true; else if (a.first == b.first) { if (b.second > a.second) return true; return false; } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long tc = 1, i, j; while (tc--) { long long n; cin >> n; long long a, b, c, d, e, f; cin >> a >> b >> c; cin >> d >> e >> f; long long mi, ma; mi = max(0LL, max(c - f - e, max(b - d - e, a - d - f))); ma = min(a, e) + min(b, f) + min(c, d); cout << mi << << ma << n ; } return 0; }
#include <bits/stdc++.h> int n, fa[200005][2], sz[200005][2]; long long ans; int find(int x, int c) { return fa[x][c] == x ? x : (fa[x][c] = find(fa[x][c], c)); } void merge(int x, int y, int c) { x = find(x, c), y = find(y, c); if (x == y) return; fa[y][c] = fa[x][c], sz[x][c] += sz[y][c]; } int main() { scanf( %d , &n); for (register int i = 1; i <= n; ++i) fa[i][0] = fa[i][1] = i, sz[i][0] = sz[i][1] = 1; for (register int i = 1, u, v, w; i < n; ++i) scanf( %d%d%d , &u, &v, &w), merge(u, v, w); for (register int i = 1; i <= n; ++i) ans += 1ll * sz[find(i, 0)][0] * sz[find(i, 1)][1] - 1; printf( %lld , ans); }
#include <bits/stdc++.h> using namespace std; double dot(complex<double> a, complex<double> b) { return (conj(a) * b).real(); } double cross(complex<double> a, complex<double> b) { return (conj(a) * b).imag(); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long double x, y, minangle = 600; int n, s, e; cin >> n; vector<pair<long double, int>> v; for (int i = 1; i <= n; i++) { cin >> x >> y; v.push_back({atan2(x, y) * 180.0 / 3.14159265359, i}); while (v.back().first < 0) v.back().first += 360.0; while (v.back().first > 360.0) v.back().first -= 360.0; } sort(v.begin(), v.end()); for (int i = 0; i < v.size(); i++) { if (min(abs(v[i].first - v[(i + 1) % n].first), 360.0 - abs(v[i].first - v[(i + 1) % n].first)) - minangle <= -1e-20) { minangle = min(abs(v[i].first - v[(i + 1) % n].first), 360.0 - abs(v[i].first - v[(i + 1) % n].first)); s = v[i].second; e = v[(i + 1) % n].second; } } cout << s << << e; return 0; }
#include <bits/stdc++.h> using namespace std; const signed long long Infinity = 1000000001; const long double Epsilon = 1e-9; template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& V) { os << [ ; for (__typeof(V.begin()) i = V.begin(); i != V.end(); ++i) os << *i << (i - V.begin() + 1 == ((int)V.size()) ? : , ); os << ] n ; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& S) { os << ( ; for (__typeof(S.begin()) i = S.begin(); i != S.end(); ++i) os << *i << (*i == *S.rbegin() ? : , ); os << ) n ; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& M) { os << { ; for (__typeof(M.begin()) i = M.begin(); i != M.end(); ++i) os << *i << (i->first == M.rbegin()->first ? : , ); os << } n ; return os; } int N, K; void read_data() { scanf( %d %d , &N, &K); } void solve() { if (N == K) { printf( -1 n ); } else { for (int(i) = (1); (i) <= (N - K - 1); (i)++) printf( %d , i + 1); printf( 1 ); for (int(i) = (N - K + 1); (i) <= (N); (i)++) printf( %d , i); } } int main() { read_data(); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int N; char S[500050]; int Aint[4 * 500050]; int pa, pb, pv; long long A[500050]; void update(int k, int st, int dr) { if (pa <= st && dr <= pb) { Aint[k] += pv; return; } int m = (st + dr) / 2; if (pa <= m) { update(2 * k, st, m); } if (pb > m) { update(2 * k + 1, m + 1, dr); } } void goUpdates(int p) { int a = p + 1; int b = N - p; if (a > b) { swap(a, b); } pa = 1; pb = a; pv = 1; update(1, 1, N); if (b + 1 <= N) { pa = b + 1; pb = N; pv = -1; update(1, 1, N); } } void go(int k, int st, int dr, long long sum) { sum += Aint[k]; if (st == dr) { A[st] = sum; return; } int m = (st + dr) / 2; go(2 * k, st, m, sum); go(2 * k + 1, m + 1, dr, sum); } int main() { cin.sync_with_stdio(false); fgets(S, sizeof(S), stdin); N = 0; for (int i = 0; S[i] != n && S[i] != 0 ; i++, N++) ; for (int i = 0; i < N; i++) { if (S[i] == I || S[i] == E || S[i] == A || S[i] == O || S[i] == U || S[i] == Y ) { goUpdates(i); } } go(1, 1, N, 0); double ans = 0.0; for (int i = 1; i <= N; i++) { A[i] += A[i - 1]; ans += (double)A[i] / i; } cout << fixed << setprecision(10) << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 300009; map<short, int> f[maxn]; int a[maxn], n, K, p, q, d; int sum[maxn], i, j, k; int main() { scanf( %d%d , &n, &K); d = n / K; for (i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); for (i = 2; i <= n; i++) sum[i] = sum[i - 1] + a[i] - a[i - 1]; f[0][0] = 0; for (i = 1; i <= n; i++) { for (k = 0; k <= 1; k++) { if (i >= d) for (map<short, int>::iterator j = f[i - d].begin(); j != f[i - d].end(); j++) if (j->first + k <= n % K) { if (!f[i].count(j->first + k)) f[i][j->first + k] = j->second + sum[i] - sum[i - d + 1]; else f[i][j->first + k] = min(f[i][j->first + k], j->second + sum[i] - sum[i - d + 1]); } d++; } if (i >= d) f[i - d].clear(); d -= 2; } printf( %d , f[n][n % K]); return 0; }
#include <bits/stdc++.h> using namespace std; long long abs(long long, long long); double dis(long long x1, long long y1, long long x2, long long y2) { double d = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2); d = sqrt(d * 1.0); return d; } void solve() { long long w, h; cin >> w >> h; long long u1, d1, u2, d2; cin >> u1 >> d1 >> u2 >> d2; long long a = w; for (long long i = h; i > 0; i--) { a += i; if (i == d1) { a -= u1; if (a < 0) a = 0; } if (i == d2) { a -= u2; if (a < 0) a = 0; } } cout << a; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long TESTS = 1; while (TESTS--) { solve(); } return 0; } long long abs(long long a, long long b) { if (a > b) return a - b; else return b - a; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, x, t, m, y, z, k; cin >> t; while (t--) { cin >> n >> m; vector<vector<long long> > a(n, vector<long long>(m)); string s; for (int i = 0; i < n; i++) { cin >> s; for (int j = 0; j < m; j++) { a[i][j] = s[j] - 0 ; } } vector<vector<long long> > ans; auto f = [&](int i, int j) { a[i][j] ^= 1; }; for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m - 1; j++) { if (a[i][j]) { ans.push_back({i, j, i + 1, j, i, j + 1}); f(i, j); f(i + 1, j); f(i, j + 1); } } if (a[i][m - 1]) { ans.push_back({i, m - 1, i + 1, m - 1, i + 1, m - 2}); f(i, m - 1); f(i + 1, m - 1); f(i + 1, m - 2); } } for (int j = 0; j < m - 2; j++) { if (a[n - 2][j] && a[n - 1][j]) { ans.push_back({n - 2, j, n - 1, j, n - 2, j + 1}); f(n - 2, j); f(n - 1, j); f(n - 2, j + 1); } else if (a[n - 2][j]) { ans.push_back({n - 2, j, n - 1, j + 1, n - 2, j + 1}); f(n - 2, j); f(n - 1, j + 1); f(n - 2, j + 1); } else if (a[n - 1][j]) { ans.push_back({n - 1, j, n - 1, j + 1, n - 2, j + 1}); f(n - 1, j); f(n - 1, j + 1); f(n - 2, j + 1); } } for (int k = 0; k < 4; k++) { vector<long long> move; auto choose = [&](pair<long long, long long> o) { move.push_back(o.first); move.push_back(o.second); a[o.first][o.second] ^= 1; }; vector<pair<long long, long long> > b, g; for (int i = n - 2; i < n; i++) { for (int j = m - 2; j < m; j++) { if (a[i][j]) b.push_back({i, j}); else g.push_back({i, j}); } } if (b.size() == 0) break; if (b.size() == 4) { choose(b[0]); choose(b[1]); choose(b[2]); } else if (b.size() == 1) { choose(b[0]); choose(g[0]); choose(g[1]); } else if (b.size() == 2) { choose(b[0]); choose(g[0]); choose(g[1]); } else if (b.size() == 3) { choose(b[0]); choose(b[1]); choose(b[2]); } ans.push_back(move); } cout << ans.size() << n ; for (auto &it : ans) { for (int j : it) { cout << j + 1 << ; } cout << n ; } } return 0; }
#include <bits/stdc++.h> int main() { long long n, d, m, l, i, le, ri, step; while (~scanf( %I64d%I64d%I64d%I64d , &n, &d, &m, &l)) { for (i = 0; i < n; i++) { le = i * m + l; ri = (i + 1) * m; step = (le + d) / d; if (step * d < ri) break; } printf( %I64d n , step * d); } }
#include <bits/stdc++.h> using namespace std; int n, x[1000009], y[1000009], id[1000009]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d %d , x + i, y + i), id[i] = i; sort(id + 1, id + 1 + n, [](int a, int b) { if (x[a] / 1000 != x[b] / 1000) return x[a] / 1000 < x[b] / 1000; if (x[a] / 1000 % 2) return y[a] > y[b]; return y[a] < y[b]; }); for (int i = 1; i <= n; i++) printf( %d , id[i]); }
#include <bits/stdc++.h> using namespace std; int q, n; long long k; long long len[100004]; string s1 = What are you doing while sending , s2 = ? Are you busy? Will you send , s3 = ? , f0 = What are you doing at the end of the world? Are you busy? Will you save us? ; int ge; void pre() { s1 += ; s2 = + s2 + ; s3 = + s3; len[0] = 75; for (int i = 1; i <= 100000; i++) { len[i] = len[i - 1] * 2 + 33 + 30 + 1 + 1 + 2 + 1; if (len[i] > 1000000000000000000LL) { ge = i; return; } } } int dfs(int x) { if (x <= ge && k > len[x]) return printf( . ); if (!x) return printf( %c , f0[k - 1]); if (k <= 34) return printf( %c , s1[k - 1]), 0; k -= 34; if (x > ge || k <= len[x - 1]) return dfs(x - 1); k -= len[x - 1]; if (k <= 32) return printf( %c , s2[k - 1]), 0; k -= 32; if (k <= len[x - 1]) return dfs(x - 1); k -= len[x - 1]; return printf( %c , s3[k - 1]); } int main() { scanf( %d , &q); pre(); while (q--) { scanf( %d%I64d , &n, &k); dfs(n); } return 0; }
#include <bits/stdc++.h> using uint64 = unsigned long long; const int N = 100, seed = 65537; char s[N]; std::unordered_map<uint64, int> words; std::unordered_set<uint64> mark; int dfs(int d, uint64 hs) { if (s[d] == 0) { if (mark.count(hs)) return 0; mark.insert(hs); auto it = words.find(hs); if (it == words.end()) return 0; else return it->second; } int ret = 0; if (s[d] == ? ) { ret += dfs(d + 1, hs); for (char c = a ; c <= e ; ++c) { ret += dfs(d + 1, hs * seed + c); } } else { ret += dfs(d + 1, hs * seed + s[d]); } return ret; } int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %s , s); uint64 hs = 0; for (int j = 0; s[j]; ++j) { hs = hs * seed + s[j]; } words[hs] += 1; } for (int i = 0; i < m; ++i) { scanf( %s , s); mark.clear(); printf( %d n , dfs(0, 0)); } return 0; }
#include <bits/stdc++.h> using namespace std; int dq[4040]; int st = 0; int dr = 0; int m[3030][3030]; int mn[3030][3030]; int N, M, K, L, X, Y, Z; long long ret = 0; void make() { for (int i = 1; i <= N; ++i) { int ind = 0; st = dr = 0; for (int j = 1; j <= M; ++j) { while (dr - st > 0 && m[i][dq[dr - 1]] > m[i][j]) { --dr; } dq[dr++] = j; while (dq[st] <= j - L) { ++st; } if (j - L >= 0) { mn[i][j - L + 1] = m[i][dq[st]]; } } } for (int j = 1; j <= M - L + 1; ++j) { st = dr = 0; for (int i = 1; i <= N; ++i) { while (dr - st > 0 && mn[dq[dr - 1]][j] > mn[i][j]) --dr; dq[dr++] = i; while (dq[st] <= i - K) ++st; if (i - K >= 0) { ret += mn[dq[st]][j]; } } } } int G[3030 * 3030]; int main() { cin.sync_with_stdio(false); cin >> N >> M >> K >> L; cin >> G[0] >> X >> Y >> Z; for (int i = 1; i <= N * M + 100; ++i) { G[i] = (1LL * G[i - 1] * X + Y) % Z; } for (int i = 1; i <= N; ++i) { for (int j = 1; j <= M; ++j) { m[i][j] = G[(i - 1) * M + j - 1]; } } make(); cout << ret << endl; }
#include <bits/stdc++.h> const double pi = acos(-1); const int MOD = 1e9 + 7; const int INF = 1e9 + 7; const int MAXN = 1e6 + 5; const double eps = 1e-9; using namespace std; int main() { for (int i = 0; i < 9; i++) printf( %d ? ?<>%d n , i, i + 1); printf( 9 ? ?>> ? ?0 n ? ?<>1 n ); for (int i = 0; i <= 9; i++) printf( ?%d>>%d ? n , i, i); printf( ?>> ? ? n>> ? n ); return 0; }
#include <bits/stdc++.h> using namespace std; long long w, m, k; long long comp; long long getpre(long long a) { long long tmp = 1, ct = 0; while (a >= tmp) tmp *= 10, ++ct; tmp /= 10; long long t = 1; long long ans = 0; for (long long i = 1; i < ct; ++i) ans += i * 9 * t, t *= 10; ans += (a - tmp + 1) * ct; return ans; } bool judge(long long len) { long long tl = m - 1; long long tr = m + len - 1; if (getpre(tr) - getpre(tl) <= comp) return true; return false; } int main() { cin >> w >> m >> k; long long l = 0, r = w / k + 1, ans = 0; comp = r - 1; while (l <= r) { long long mid = (l + r) >> 1; if (judge(mid)) l = mid + 1, ans = mid; else r = mid - 1; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; long long a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } if (k % 2 == 0) k = 2; else k = 1; while (k--) { long long m = -10000000000; for (int i = 0; i < n; i++) { m = max(m, a[i]); } for (int i = 0; i < n; i++) { a[i] = m - a[i]; } } for (int i = 0; i < n; i++) cout << a[i] << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long f[500005]; int main() { string s; cin >> s; for (int i = 1; i <= s.size(); i++) f[i] = (s[i - 1] == I || s[i - 1] == O || s[i - 1] == E || s[i - 1] == A || s[i - 1] == U || s[i - 1] == Y ); for (int i = 1; i <= s.size(); i++) f[i] = f[i - 1] + f[i]; long long cur = 0; long double ans = 0; for (int i = 1; i <= s.size(); i++) cur += (f[s.size() - i + 1] - f[i - 1]), ans += (long double)cur / (long double)i; printf( %.10Lf , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; long long t; cin >> n >> t; vector<long long> a, b; for (long long i = 0; i < n; i++) { long long x; cin >> x; x += t; a.push_back(x); } vector<int> breaks; bool poss = true; long long cur = 0; for (long long i = 1; i <= n; i++) { long long x; cin >> x; b.push_back(x); if (x < i) poss = false; if (x < cur) poss = false; if (x != cur && i != (cur + 1)) poss = false; if (x != cur) { breaks.push_back(1); } else { breaks.push_back(0); } cur = x; } for (int i = 1; i < n; i++) { if (breaks[i] && !breaks[i - 1] && a[i - 1] + 1 == a[i]) poss = false; } if (!poss) { cout << No << endl; return 0; } cout << Yes << endl; for (int i = 0; i < n; i++) { if (b[i] == n) { cout << a[n - 1] + i + 1 << ; } else { cout << a[b[i]] - (b[i] - i) << ; } } }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; long long int a[n + 1]; for (long long int i = 1; i <= n; i++) { cin >> a[i]; } long long int f = 0; for (long long int i = 1; i <= n; i++) { for (long long int j = 1; j <= n; j++) { if (j != i) { for (long long int k = 1; k <= n; k++) { if (k != j) { if (a[i] == a[j] + a[k]) { f = 1; cout << i << << j << << k << endl; break; } } } if (f) { break; } } } if (f) { break; } } if (f == 0) { cout << -1; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, j = 0; cin >> n; vector<int> ai(n); if (n == 4) { cout << 4 << n ; cout << 3 << << 1 << << 4 << << 2 << n ; return 0; } for (int i = 1; i <= n; i += 2) { ai[j] = i; j++; } for (int k = 2; k <= n; k += 2) { if (abs(ai[j - 1] - k) != 1) { ai[j] = k; j++; } } cout << j << n ; for (int i = 0; i < j; i++) cout << ai[i] << ; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; cin >> n >> m >> k; if (m >= n && k >= n) { cout << Yes << endl; } else cout << No << endl; }
#include <bits/stdc++.h> using namespace std; int n, k, v[105], frec[105]; vector<int> ans; int main() { cin >> n >> k; for (int i = 1; i <= n; i++) cin >> v[i]; for (int i = 1; i <= n; i++) if (!frec[v[i]]) { frec[v[i]] = 1; ans.push_back(i); if (ans.size() == k) break; } if (ans.size() == k) { cout << YES << n ; for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; cout << n ; } else cout << NO << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const long long int lg = 22; const long long int N = 2e5 + 5; const long long int INF = 1e18; const long long int mod = 1e9 + 7; const double PI = 3.14159265358979323846; template <typename T> T power(T x, T y, long long int m) { T ans = 1; while (y > 0) { if (y & 1LL) ans = (ans * x) % m; y >>= 1LL; x = (x * x) % m; } return ans % m; } inline long long int mul(long long int a, long long int b, long long int p) { return (a * 1ll * b) % p; } inline long long int sub(long long int a, long long int b, long long int p) { long long int c = a - b; if (c < 0) c += p; return c; } inline long long int add(long long int a, long long int b, long long int p) { long long int c = a + b; if (c > p) c -= p; return c; } long long int mark[N]; long long int n, q, a[N], minidx[N], maxidx[N]; int main() { long long int ans = 0; cin >> n >> q; for (long long int i = 1; i <= n; i++) { cin >> a[i]; if (minidx[a[i]] == 0) { minidx[a[i]] = i; } maxidx[a[i]] = i; } for (long long int i = 1; i <= n; i++) { long long int maxcnt = 0, cnt = 0; long long int maxi = maxidx[a[i]]; if (mark[i]) { continue; } map<long long int, long long int> xfreq; for (long long int j = i; j <= maxi; j++) { cnt++; mark[j] = 1; xfreq[a[j]]++; maxcnt = max(maxcnt, xfreq[a[j]]); maxi = max(maxi, maxidx[a[j]]); } ans += (cnt - maxcnt); } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; vector<set<int> > A; set<int>::iterator it; int main() { int n, m, a; cin >> n; A.resize(n); int D[101]; for (int i = 1; i <= 100; ++i) D[i] = 0; for (int i = 0; i < n; ++i) { cin >> m; for (int j = 0; j < m; ++j) { cin >> a; ++D[a]; A[i].insert(a); } } for (int i = 0; i < n; ++i) { bool yes = 1; for (int j = 0; j < n; ++j) { if (i != j) { bool y = 0; for (it = A[j].begin(); it != A[j].end(); ++it) if (A[i].count(*it) == 0) y = 1; if (y == 0) yes = 0; } } if (yes) cout << YES << endl; else cout << NO << endl; } }
#include <bits/stdc++.h> int main() { int n, a[1010], temp, lamak, maxin, max, i, j; long int count; while (scanf( %d , &n) != EOF) { count = 0; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } again: max = 0; for (i = 0; i < n; i++) { if (a[i] >= max) { max = a[i]; maxin = i; } } if (max > a[0]) { a[maxin] = a[maxin] - 1; a[0] = a[0] + 1; count = count + 1; goto again; } if (max == a[0] && maxin != 0) { a[maxin] = a[maxin] - 1; a[0] = a[0] + 1; count = count + 1; printf( %ld n , count); } else { printf( %ld n , count); } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char s[1007][1007]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> s[i][j]; } } if (n < 3) { cout << 0 ; } else { int res = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (s[i][j] == X && s[i - 1][j + 1] == X && s[i + 1][j - 1] == X && s[i - 1][j - 1] == X && s[i + 1][j + 1] == X ) { res++; } } } cout << res; } return 0; }
#include <bits/stdc++.h> #pragma warning(disable : 4996) #pragma comment(linker, /STACK:336777216 ) using namespace std; int IT_MAX = 1 << 17; const long long MOD = 1000000009; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-8; vector<pair<long long, long long> > Vu; int main() { int N, K, M, i, j; scanf( %d %d %d , &N, &K, &M); for (i = 1; i <= N; i++) { int t; scanf( %d , &t); if (!Vu.empty() && Vu.back().first == t) { Vu.back().second++; if (Vu.back().second == K) Vu.pop_back(); } else Vu.emplace_back(t, 1); } long long s = 0; for (auto it : Vu) s += it.second; if (M == 1 || s == 0) return !printf( %lld n , s); s *= M; int st = 0, en = (int)Vu.size() - 1; while (st < en) { if (Vu[st].first != Vu[en].first) return !printf( %lld n , s); if (Vu[st].second + Vu[en].second == K) { s -= (long long)(M - 1) * K; st++, en--; continue; } if (Vu[st].second + Vu[en].second > K) s -= (long long)(M - 1) * K; return !printf( %lld n , s); } long long x = Vu[st].second * M; if (x % K == 0) { return !printf( 0 n ); } else { return !printf( %lld n , s - (x / K) * K); } return 0; }
#include <bits/stdc++.h> using namespace std; const int MXN = 1e5 + 1; const int MAXN = 1e3 + 1; const long long INF = 1e16; const int MOD = 65000; const int MAX = 1e2; const double EPS = 1e-9; long long n; long long a, b, c, d, e, first, g, h; int main() { ios_base::sync_with_stdio(0); string second; cin >> second; for (int i = 0; i < second.size(); ++i) { if (second[i] == B ) ++a; if (second[i] == u ) ++b; if (second[i] == l ) ++c; if (second[i] == b ) ++d; if (second[i] == a ) ++e; if (second[i] == s ) ++first; if (second[i] == u ) ++g; if (second[i] == r ) ++h; } g = g / 2; e = e / 2; cout << min(a, min(b, min(c, min(d, min(e, min(first, min(g, h))))))); return 0; }
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int testCase; cin >> testCase; while (testCase--) { vector<int> balls; int ball; cin >> ball; while (ball--) { int num; cin >> num; balls.push_back(num); } int maxNum = 1; int lastNum = balls[0]; int count = 1; for (int i = 1;i < balls.size();i++) { if (balls[i] != lastNum) { lastNum = balls[i]; maxNum = max(count, maxNum); count = 1; } else { count++; } } maxNum = max(count, maxNum); cout << maxNum << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 2000000005; const long long INFLL = 1000000000000000009; const long long MOD = 1000000007; long long W[1005][1005], N, M, K; int main() { for (int i = (1); i <= (1000); i++) W[i][0] = 1; for (int j = (1); j <= (1000); j++) { long long s = 0; for (int i = (3); i <= (1000); i++) { s = (s + W[i - 2][j - 1]) % MOD; W[i][j] = (W[i - 1][j] + s) % MOD; } } cin >> N >> M >> K; cout << (W[N][K] * W[M][K]) % MOD; }
#include <bits/stdc++.h> #define int long long #pragma GCC target ( avx2 ) #pragma GCC optimization ( O3 ) #pragma GCC optimization ( unroll-loops ) /*#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>*/ using namespace std; signed main() { //ios_base::sync_with_stdio(0); //cin.tie(0); //cout.tie(0); int n; cin >> n; int a[n]; for (int i = 0; i < n; ++i) cin >> a[i]; vector <pair <int, pair <int, int> > > goga; for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { if (a[i] > a[j]) goga.push_back({a[i] - a[j], {i, j}}); else goga.push_back({a[j] - a[i], {j, i}}); } } sort(goga.begin(), goga.end()); reverse(goga.begin(), goga.end()); for (int i = 0; i < goga.size(); ++i) { if (goga[i].first >= 0 && i < goga.size()) { int first = goga[i].second.first, second = goga[i].second.second; cout << ? << first + 1 << << second + 1 << endl; string lol; cin >> lol; if (lol == Yes ) { cout << ! << first + 1 << << second + 1 << endl; return 0; } } } cout << ! << 0 << << 0 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1004; int a[N]; int main() { int n; scanf( %d , &n); vector<pair<int, int> > vec; int i; for (i = 1; i <= n; i++) { scanf( %d , &a[i]); vec.push_back(make_pair(a[i], i)); } sort(vec.begin(), vec.end()); reverse(vec.begin(), vec.end()); int ans = 0; for (i = 0; i < vec.size(); i++) { ans = ans + (i)*vec[i].first + 1; } printf( %d n , ans); for (i = 0; i < vec.size(); i++) printf( %d , vec[i].second); return 0; }
#include <bits/stdc++.h> using namespace std; int n, ms, type[5005], dp[5005]; int main() { scanf( %d %d , &n, &ms); for (int i = 1; i <= n; i++) { double x; scanf( %d %lf , type + i, &x); } for (int i = 1; i <= n; i++) { int j = type[i]; for (int k = j; k >= 1; k--) { dp[j] = max(dp[j], 1 + dp[k]); } } int ans = 0; for (int i = 1; i <= n; i++) { ans = max(ans, dp[i]); } printf( %d n , n - ans); }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; char s[105]; cin >> s; vector<int> a; string ans = ; int j, ct = 0; for (int i = 0; i <= n - 1;) { if (s[i] == o && s[i + 1] == g && s[i + 2] == o && i <= n - 3) { ct = 0; for (j = i + 3; j < n - 1;) { if (s[j] == g && s[j + 1] == o ) { ct = 1; j = j + 2; i = j; } else { i = j; break; } } i = j; if (ct == 1) { ans += *** ; } else { ans += *** ; } } else { ans += s[i]; i++; } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; int const N = 1e5 + 13; int n, m; set<int> e[N]; set<pair<int, int> > q; int p[N]; int tin[N], cnt, w[N], ans; int gcd(int a, int b) { return (!a ? b : gcd(b % a, a)); } void init() { for (int i = 0; i < N; ++i) p[i] = i; } int find(int u) { if (p[u] == u) return u; return p[u] = find(p[u]); } void uni(int a, int b) { a = find(a); b = find(b); if (a == b) return; if (e[a].size() < e[b].size()) swap(a, b); for (int to : e[b]) e[a].insert(find(to)); p[b] = a; e[b].clear(); } void print(int ans) { printf( %d n , ans); exit(0); } pair<int, int> getMax() { auto it = q.end(); --it; pair<int, int> res = (*it); return res; } void merge(int id) { if (id != find(id)) return; vector<int> ver; for (int v : e[id]) ver.push_back(find(v)); e[id].clear(); for (int i = 0; i < ver.size(); ++i) { int pi = find(ver[i]); q.erase(make_pair(e[pi].size(), pi)); } for (int i = 1; i < ver.size(); ++i) uni(ver[i], ver[i - 1]); int lv = find(ver[0]); id = find(id); e[id].insert(lv); q.insert(make_pair(e[lv].size(), lv)); q.insert(make_pair(e[id].size(), id)); if (e[id].find(id) != e[id].end()) print(1); } void compress() { for (int i = 0; i < n; ++i) { q.insert(make_pair(e[i].size(), find(i))); } while (true) { pair<int, int> cur = getMax(); if (cur.first < 2) return; q.erase(cur); merge(cur.second); } } void dfs(int u) { w[u] = 1; tin[u] = cnt; ++cnt; for (int to : e[u]) { int vt = find(to); if (!w[vt]) dfs(vt); else if (w[vt] == 1) { ans = gcd(ans, tin[u] - tin[vt] + 1); } } w[u] = 2; --cnt; } void solve() { init(); scanf( %d %d , &n, &m); for (int i = 0; i < m; ++i) { int u, v; scanf( %d %d , &u, &v); --u; --v; if (u == v) print(1); e[u].insert(find(v)); } compress(); for (int i = 0; i < n; ++i) if (!w[find(i)]) dfs(find(i)); if (ans == 0) ans = n; printf( %d n , ans); } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int sum(int a[], int size) { int sum = 0; for (int i = 0; i < size; i++) { sum = sum + a[i]; } return sum; } int main() { int n; cin >> n; int a1[n], a2[n - 1], a3[n - 3]; for (int i = 0; i < n; i++) { cin >> a1[i]; } for (int i = 0; i < n - 1; i++) { cin >> a2[i]; } for (int i = 0; i < n - 2; i++) { cin >> a3[i]; } cout << sum(a1, n) - sum(a2, n - 1) << endl << sum(a2, n - 1) - sum(a3, n - 2); return 0; }
#include <bits/stdc++.h> using namespace std; int dir[8][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; int main() { int n, k, p, x, y; int cntY = 0, a[1100] = {0}, sum = 0; scanf( %d %d %d %d %d , &n, &k, &p, &x, &y); for (int i = 1; i <= k; i++) { scanf( %d , &a[i]); sum += a[i]; if (a[i] >= y) cntY++; } int Mid = (n + 1) / 2; if (cntY >= Mid) { sum += (n - k); if (sum > x) printf( -1 n ); else { for (int i = 1; i <= (n - k); i++) printf( 1%c , i == n - k ? n : ); } } else { sum += y * (Mid - cntY) + n - k - Mid + cntY; if (sum > x || k - cntY >= Mid) printf( -1 n ); else { for (int i = 1; i <= (Mid - cntY); i++) printf( %d%c , y, i == n - k ? n : ); for (int i = 1; i <= n - k - Mid + cntY; i++) printf( 1%c , i == n - k - Mid + cntY ? n : ); } } return 0; }
#include <bits/stdc++.h> const double PI = acos(-1); const double EPS = 1e-6; const long long MOD = 998244353; const long long N = 30 + 10; template <typename T> inline T Abs(T x) { return x < 0 ? x * -1 : x; } template <typename T> inline T Max(T x, T y, T z) { return std::max(std::max(x, y), z); } template <typename T> inline T Min(T x, T y, T z) { return std::min(std::min(x, y), z); } template <typename T> inline void Ckmax(T &x, T y) { x = std::max(x, y); } template <typename T> inline void Ckmin(T &x, T y) { x = std::min(x, y); } template <typename T> inline T Sqr(T x) { return x * x; } template <typename T> inline T Pow(T x, T y) { T r = 1; while (y > 0) { if (y % 2 > 0) (r *= x) %= MOD; (x *= x) %= MOD; y /= 2; } return r % MOD; } template <typename T> T Pow(T x, T y, T z) { T r = 1; while (y > 0) { if (y % 2 > 0) (r *= x) %= z; (x *= x) %= z; y /= 2; } return r % z; } template <typename T> inline T gcd(T x, T y) { return y > 0 ? gcd(y, x % y) : x; } template <typename T> inline T lcm(T x, T y) { return x / gcd(x, y) * y; } inline void cinspu(void) { std::ios::sync_with_stdio(0); std::cin.tie(0); } inline long long fac(long long x) { long long r = 1; for (; x > 1; --x) (r *= x) %= MOD; return r; } int a[N], b[N], ans[N], tim; int print(char z, int x, int y) { ++tim; printf( %c %d %d n , z, x, y); fflush(stdout); if (z == ? ) { int r; scanf( %d , &r); return r; } return -2; } int main() { const char q = ? ; for (int i = 29, x = 0, y = 0; i >= 0; --i) { int n = (1 << i), r; if (ans[i]) r = ans[i] - 3; else r = print(q, x, y); if (r > 0) { int p = print(q, x + n, y + n); if (p > 0) { int t = print(q, x + n, y); if (t > 0) { a[i] = b[i] = 0; ans[i - 1] = 3 + r; } else { a[i] = b[i] = 1; ans[i - 1] = 3 + p; x += n; y += n; } } else { a[i] = 1; b[i] = 0; x += n; } } else if (r < 0) { int p = print(q, x + n, y + n); if (p < 0) { int t = print(q, x + n, y); if (t > 0) { a[i] = b[i] = 0; ans[i - 1] = 3 + r; } else { a[i] = b[i] = 1; ans[i - 1] = 3 + p; x += n; y += n; } } else { a[i] = 0; b[i] = 1; y += n; } } else { r = print(q, x + n, y); if (r > 0) { a[i] = b[i] = 0; } else { a[i] = b[i] = 1; x += n; y += n; } } } int x = 0; for (int i = 0; i < 30; ++i) x += a[i] * (1 << i); int y = 0; for (int i = 0; i < 30; ++i) y += b[i] * (1 << i); print( ! , x, y); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { double a, b, c; cin >> a >> b >> c; cout << (int)ceil(c * (a - b) / b); }
#include <bits/stdc++.h> inline int read() { int x = 0, w = 1; char ch = 0; while (ch < 0 || ch > 9 ) { ch = getchar(); if (ch == - ) w = -1; } while (ch <= 9 && ch >= 0 ) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * w; } using namespace std; const int N = 5005; const int M = 2e6 + 5; const int Mod = 1e9 + 7; char str[M]; int n, k1, k2, tot, tim, ans; int s[N], bg[N], vis[N]; int dfn[N], low[N], b[N]; int mn[N], mx[N], cnt[N]; int fac[M], inv[M]; inline void ad(int &x, int y) { x += y; if (x >= Mod) x -= Mod; if (x < 0) x += Mod; } inline int Pow(int x, int y) { int res = 1; while (y) { if (y & 1) res = 1ll * res * x % Mod; x = 1ll * x * x % Mod; y >>= 1; } return res; } inline void math_init(int nn) { fac[0] = 1; for (int i = 1; i <= nn; ++i) fac[i] = 1ll * fac[i - 1] * i % Mod; inv[nn] = Pow(fac[nn], Mod - 2); for (int i = nn; i; --i) inv[i - 1] = 1ll * inv[i] * i % Mod; } inline int C(int x, int y) { if (x < y || x < 0 || y < 0) return 0; return 1ll * (1ll * fac[x] * inv[y] % Mod) * inv[x - y] % Mod; } vector<int> G[N], g[N], f[N]; stack<int> sta; int gcd(int x, int y) { if (!y) return x; return gcd(y, x % y); } inline void input() { n = read(), k1 = read(), k2 = read(); for (int i = 1; i <= n; ++i) { scanf( %s , str + 1); for (int j = 1; j <= n; ++j) if (str[j] == 1 ) G[i].push_back(j); } for (int i = 1; i <= n; ++i) { s[i] = read(); scanf( %s , str + 1); for (int j = 1; j <= s[i]; ++j) { g[i].push_back(str[j] - 0 ); mn[i] += str[j] - 0 ; } } } void tarjan(int x) { dfn[x] = low[x] = ++tim; sta.push(x), vis[x] = 1; for (int i = 0, sz = G[x].size(); i < sz; ++i) { int y = G[x][i]; if (!dfn[y]) { tarjan(y); low[x] = min(low[x], low[y]); } else if (vis[y]) low[x] = min(low[x], dfn[y]); } if (low[x] == dfn[x]) { int now = 0; ++tot; do { now = sta.top(), sta.pop(), vis[now] = 0; b[now] = tot, bg[tot] = gcd(bg[tot], s[now]); } while (now != x); } } namespace sub1 { inline void build() { for (int i = 1; i <= n; ++i) if (!dfn[i]) tarjan(i); for (int i = 1; i <= tot; ++i) f[i].resize(bg[i] + 1); for (int i = 1; i <= n; ++i) for (int j = 0; j < s[i]; ++j) f[b[i]][j % bg[b[i]]] |= g[i][j]; } inline void solve() { build(); for (int i = tot; i > 1; --i) { int now = gcd(bg[i], bg[i - 1]); for (int j = 0; j < bg[i]; ++j) { f[i - 1][j % now] |= f[i][j]; cnt[i] += f[i][j]; } } for (int i = 0; i < bg[1]; ++i) cnt[1] += f[1][i]; for (int i = 1; i <= n; ++i) mx[i] = 1ll * cnt[b[i]] * s[i] / bg[b[i]]; } } // namespace sub1 namespace sub2 { inline void solve() { for (int i = 1; i <= n; ++i) { int cnt1 = 0, cnt2 = 0; for (int j = 1; j <= n; ++j) { if (i == j) continue; if (mn[j] > mx[i]) ++cnt1; else if (mx[j] > mx[i] || (mx[j] == mx[i] && j < i)) ++cnt2; } if (cnt1 > k1 - 1) continue; for (int j = min(k2, min(k1 - 1 - cnt1, cnt2)); j + cnt1 + 1 >= k2; --j) ad(ans, 1ll * C(cnt2, j) * C(cnt1, k2 - j - 1) % Mod); } printf( %d n , ans); } } // namespace sub2 int main() { math_init(M - 5), input(); sub1::solve(), sub2::solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; if (m == 3 && n > 4) { cout << -1 << endl; return 0; } int cnt = 0, ans = 0; for (int i = 0; i < m; i++) printf( %d %d n , i, ans += (cnt++)); if (m < n) cout << m + 100000 << << ans << endl; for (int i = m + 1; i < n; i++) printf( %d %d n , i + 100000, ans -= (--cnt)); return 0; }
#include <bits/stdc++.h> const long long INF = 1e18; void swap(long long &a, long long &b) { long long temp; temp = a; a = b; b = temp; } using namespace std; void solve() { long long n, k, ans; cin >> n >> k; ans = n; for (long long i = 1; i <= sqrt(n); i++) { if (n % i == 0) { if (n / i <= k) ans = min(ans, i); if (i <= k) ans = min(ans, n / i); } } cout << ans; } int main() { int t; cin >> t; while (t--) { solve(); cout << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, x; cin >> n >> x; int pos = 1; long long ans = 0; for (int i = 0; i < n; i++) { int l, r; cin >> l >> r; ans += 1LL * (l - pos) % x + (r - l + 1); pos = r + 1; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int strike[10010]; bool isIn(long long x, long long y, long long cx, long long cr) { return (x - cx) * (x - cx) + y * y <= cr * cr; } int main() { int n, m; cin >> n; vector<pair<pair<long long, long long>, int> > mish(n + 2); for (int i = 1; i <= n; i++) cin >> mish[i].first.first >> mish[i].first.second, mish[i].second = i; n += 1; mish[0].first.first = -100000; mish[0].first.second = 0; mish[n].first.first = 100000; mish[n].first.second = 0; sort(mish.begin(), mish.end()); for (int i = 1; i <= n; i++) strike[i] = -1; cin >> m; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; int l = 0, r = n; while (l < r) { int s = (l + r) / 2 + 1; if (x < mish[s].first.first) r = s - 1; else l = s; } if (strike[mish[l].second] == -1 && isIn(x, y, mish[l].first.first, mish[l].first.second)) strike[mish[l].second] = i; if (strike[mish[l + 1].second] == -1 && isIn(x, y, mish[l + 1].first.first, mish[l + 1].first.second)) strike[mish[l + 1].second] = i; } int c = 0; for (int i = 1; i < n; i++) if (strike[i] != -1) c++; cout << c << endl; for (int i = 1; i < n; i++) cout << strike[i] << ; exit: return (0); }
#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; const int N = 300005; int p[N], sum[N], dp[N]; vector<int> g[N]; bool cmp(int q, int w) { return (sum[q] > sum[w]); } void dfs(int v, int pr = 0) { p[v] = pr; sum[v] = 1; if (pr && g[v].size() == 1) { dp[v] = v; return; } vector<int> a; for (int i = 0; i < g[v].size(); i++) { int to = g[v][i]; if (to == pr) continue; dfs(to, v); a.push_back(to); sum[v] += sum[to]; } sort((a).begin(), (a).end(), cmp); int n = a.size(); int first = dp[a[0]]; while (sum[v] - sum[first] > sum[v] / 2) { first = p[first]; } dp[v] = first; } int main() { cin.tie(0); ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; for (int i = 2; i <= n; i++) { int first; cin >> first; g[i].push_back(first); g[first].push_back(i); } dfs(1); for (int i = 1; i <= m; i++) { int first; cin >> first; cout << dp[first] << n ; } }
#include <bits/stdc++.h> using namespace std; long long mn = (long long)(1e9); long long n, ans, k, a[311111], near[2111111], x; bool mark[2111111]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; mark[a[i]] = 1; mn = min(mn, a[i]); } for (int i = 1; i <= 2000000; i++) { near[i] = x; if (mark[i]) x = i; } for (int i = mn; i >= 1; i--) { long long mx = -(long long)(1e9); for (int j = 0; j <= 1000000; j += i) { if (near[j + i] >= j) mx = max(mx, near[j + i] - j); } if (mx != -(long long)(1e9) && mx <= k) { cout << i; return 0; } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long inf = 1e18; const long long mod = 1e9 + 7; unsigned long long power(long long x, unsigned long long y, long long p) { long long res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bool isPrime(long long n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } const long long maxn = 3000 * 3000; long long g[maxn]; deque<pair<long long, long long>> d; long long mat[3001][3001]; long long mn[3001][3001]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; long long n, m, a, b, x, y, z; cin >> n >> m >> a >> b; cin >> g[0] >> x >> y >> z; for (long long i = 1; i < n * m + 1; i++) { g[i] = (g[i - 1] * x + y) % z; } for (long long i = 1; i < n + 1; i++) { for (long long j = 1; j < m + 1; j++) { mat[i][j] = g[(i - 1) * m + j - 1]; } } for (long long i = 1; i < n + 1; i++) { d.clear(); for (long long j = 1; j < m + 1; j++) { while (d.size() && d.back().first > mat[i][j]) { d.pop_back(); } d.push_back({mat[i][j], j}); if (j >= b) { mn[i][j] = d.front().first; if (j - d.front().second >= b - 1) { d.pop_front(); } } } } d.clear(); for (long long j = b; j < m + 1; j++) { d.clear(); for (long long i = 1; i < n + 1; i++) { while (d.size() && d.back().first > mn[i][j]) { d.pop_back(); } d.push_back({mn[i][j], i}); if (i >= a) { mat[i][j] = d.front().first; if (i - d.front().second >= a - 1) { d.pop_front(); } } } } long long ans = 0; for (long long i = a; i < n + 1; i++) { for (long long j = b; j < m + 1; j++) { ans += mat[i][j]; } } cout << ans << n ; }
#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(0); std::cout.tie(0); std::cin.tie(0); int n; std::cin >> n; int a[n]; for (int i = 0; i < n; ++i) std::cin >> a[i]; std::sort(a, a + n); for (int i = n - 1; i >= 0; --i) { int t = sqrt(a[i]); if (t * t != a[i]) { std::cout << a[i] << n ; return 0; } } return 0; }
#include <bits/stdc++.h> typedef int arr[55][55]; char s0[55], s1[55], opr[9]; int x[55], y[55], z[55], f[55][55], n0, n1, m; bool b[55][55][55]; arr e0, e1; void work(int &n, char *s, arr &e) { n = strlen(s); memset(b, 0, sizeof(b)); for (int i = 0; i < n; i++) b[i][i + 1][s[i] - 97] = 1; for (int j = 2; j <= n; j++) for (int i = 0; i + j <= n; i++) for (int k = i + 1; k < i + j; k++) for (int c = 0; c < m; c++) b[i][i + j][z[c]] |= b[i][k][x[c]] && b[k][i + j][y[c]]; for (int i = 0; i < n; i++) for (int j = i + 1; j <= n; j++) for (int k = 0; k < 26; k++) if (b[i][j][k]) e[i][j] |= 1 << k; } int main() { scanf( %s%s%d , s0, s1, &m); for (int i = 0; i < m; i++) scanf( %s , opr), x[i] = opr[3] - 97, y[i] = opr[4] - 97, z[i] = opr[0] - 97; work(n0, s0, e0), work(n1, s1, e1); memset(f, 6, sizeof(f)); f[0][0] = 0; for (int i = 0; i <= n0; i++) for (int x = 0; x <= n1; x++) for (int j = i + 1; j <= n0; j++) for (int y = x + 1; y <= n1; y++) if (e0[i][j] & e1[x][y] && f[i][x] + 1 < f[j][y]) f[j][y] = f[i][x] + 1; printf( %d n , f[n0][n1] <= 100 ? f[n0][n1] : -1); return 0; }
#include <bits/stdc++.h> using namespace std; int x, y, z, inf = 1e9, f[210][210], n, m, Max[210]; pair<pair<int, int>, int> p[40010]; pair<int, int> q[210]; void read(int &x) { char ch = getchar(); int mark = 1; for (; ch != - && (ch < 0 || ch > 9 ); ch = getchar()) ; if (ch == - ) mark = -1, ch = getchar(); for (x = 0; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 48; x *= mark; } int main() { read(n); read(m); for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) f[i][j] = f[j][i] = inf; for (int i = 1; i <= m; i++) { read(x); read(y); read(z); f[x][y] = f[y][x] = z; p[i] = make_pair(make_pair(x, y), z); } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) if (i != k) for (int j = 1; j <= n; j++) if (j != i && j != k) f[i][j] = min(f[i][j], f[i][k] + f[k][j]); double Min = 1e9; for (int i = 1; i <= n; i++) { double Max = 0; for (int j = 1; j <= n; j++) Max = max(Max, (double)f[i][j]); Min = min(Min, Max); } for (int i = 1; i <= m; i++) { int x = p[i].first.first, y = p[i].first.second; for (int j = 1; j <= n; j++) q[j] = make_pair(f[x][j], f[y][j]); sort(q + 1, q + n + 1); Max[n + 1] = 0; for (int j = n; j; j--) Max[j] = max(Max[j + 1], q[j].second); for (int j = 1; j <= n; j++) { int l = q[j].first, r = Max[j + 1]; if (l > r) swap(l, r); if (l + p[i].second >= r) Min = min(Min, (l + p[i].second + r) / 2.0); } } printf( %.1lf n , Min); return 0; }