func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int main() { int n, a; scanf( %d %d %*d , &n, &a); map<long long, int> cnt1; map<pair<int, int>, int> cnt2; long long ans = 0; for (int i = 0; i < n; ++i) { int vx, vy; scanf( %*d %d %d , &vx, &vy); long long v = 1LL * a * vx - vy; ans += cnt1[v]; ans -= cnt2[{vx, vy}]; ++cnt1[v]; ++cnt2[{vx, vy}]; } printf( %lld n , ans * 2); }
#include <bits/stdc++.h> using namespace std; long long L[200005], R[200005], U[200005], D[200005]; long long n; string S; long long x, y, sx = 0, sy = 0; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> S >> x >> y; S = _ + S; L[0] = R[0] = U[0] = D[0] = 0; for (long long i = 1; i <= n; i++) { L[i] = L[i - 1]; R[i] = R[i - 1]; D[i] = D[i - 1]; U[i] = U[i - 1]; if (S[i] == L ) L[i]++, sx--; else if (S[i] == R ) R[i]++, sx++; else if (S[i] == U ) U[i]++, sy++; else if (S[i] == D ) D[i]++, sy--; } if (sx == x && sy == y) { cout << 0; return 0; } if ((sx + sy + x + y) % 2 != 0) { cout << -1; return 0; } long long s_ind = 1, g_ind = n + 1; while (g_ind > s_ind) { long long len = (g_ind + s_ind) / 2; bool b = 0; for (long long j = len; j <= n; j++) { long long l = L[n] - L[j] + L[j - len], r = R[n] - R[j] + R[j - len], u = U[n] - U[j] + U[j - len], d = D[n] - D[j] + D[j - len]; long long curx = r - l, cury = u - d; if (abs(curx - x) + abs(cury - y) <= len) { b = 1; break; } } if (b) g_ind = len; else s_ind = len + 1; } if (s_ind <= n) cout << s_ind; else cout << -1; }
#include <bits/stdc++.h> using namespace std; const int N = 500023; bool vis[N]; vector<int> adj[N]; void solve() { long long int n; cin >> n; vector<long long int> v; for (long long int i = 0; i < n; i++) { long long int c; cin >> c; v.push_back(c); } sort((v).begin(), (v).end()); long long int ans = 0; if (v[2] != v[1]) { for (int i = 2; i < n; i++) { if (v[i] == v[2]) ans++; else break; } } else if ((v[2] == v[1]) && (v[1] != v[0])) { long long int count = 0; for (int i = 1; i < n; i++) { if (v[i] == v[1]) count++; else break; } ans = (count * (count - 1)) / 2; } else { long long int count = 0; for (int i = 0; i < n; i++) { if (v[i] == v[0]) count++; else break; } ans = (count * (count - 1) * (count - 2)) / 6; } cout << ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int T = 1; int t = 0; while (t++ < T) { solve(); } }
#include <bits/stdc++.h> using namespace std; long long fact(int x) { long long ans = 0; while (x > 0) { ans += x; x--; } return ans; } int main() { int n; cin >> n; vector<vector<char> > a(n, vector<char>(n)); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> a[i][j]; vector<int> ansi(n); vector<int> ansj(n); for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (a[i][j] == C ) { ansi[i]++; ansj[j]++; } long long count = 0; long long ans = 0; for (int i = 0; i < n; i++) count += fact(ansi[i] - 1); ans += count; count = 0; for (int i = 0; i < n; i++) count += fact(ansj[i] - 1); ans += count; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, ans, a[300010]; bool check(int mid) { int pre = mid + a[1] >= m ? 0 : a[1]; for (int i = 2; i <= n; i++) { if (a[i] + mid < pre) return false; if (a[i] <= pre) continue; else if (a[i] + mid >= m && (a[i] + mid) % m >= pre) continue; pre = a[i]; } return true; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); int l = 0, r = m - 1; while (l <= r) { int mid = (l + r) >> 1; if (check(mid)) ans = mid, r = mid - 1; else l = mid + 1; } printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; #define int unsigned long long const int N = 100010; int n, a[N]; signed main(void) { ios::sync_with_stdio(false); map <int, int> mp; int T; cin >> T; while(T--) { mp.clear(); int res = 0; int n; cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; res += mp[a[i]] * (n - i + 1); mp[a[i]] += i; } cout << res << endl; } return 0; } /* ———————————————— 版权声明:本文为CSDN博主「zhbbbb!」的原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接及本声明。 原文链接:https://blog.csdn.net/zhbbbbbb/article/details/117330722*/
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,fast-math,unroll-loops ) using namespace std; const int maxn = 2e5 + 50; inline char nc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline int read() { char ch = nc(); int sum = 0; while (!(ch >= 0 && ch <= 9 )) ch = nc(); while (ch >= 0 && ch <= 9 ) sum = sum * 10 + ch - 48, ch = nc(); return sum; } int t, n; string str; int sum1[maxn], sum2[maxn]; map<pair<int, int>, int> mp; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; while (t--) { cin >> n >> str; str = + str; n++; for (int i = 1; i <= n; i++) sum1[i] = sum1[i - 1] + (str[i] == L ) - (str[i] == R ), sum2[i] = sum2[i - 1] + (str[i] == U ) - (str[i] == D ); int ans = 0x3f3f3f3f, l = 0, r = 0; mp.clear(); for (int i = 1; i <= n; i++) { if (mp[make_pair(sum1[i], sum2[i])] != 0) { int tmp = mp[make_pair(sum1[i], sum2[i])]; if (i - tmp < ans) ans = i - tmp, l = tmp + 1, r = i; } mp[make_pair(sum1[i], sum2[i])] = i; } if (ans == 0x3f3f3f3f) printf( -1 n ); else printf( %d %d n , l - 1, r - 1); } return 0; }
#include <bits/stdc++.h> using namespace std; int m; long long n; long long deg[1001001], result; vector<vector<int> > e; int main() { scanf( %d%d , &n, &m); for (int i = 0; i < m; i++) { int a, b; scanf( %d%d , &a, &b); deg[a]++; deg[b]++; } result = 0; for (int i = 1; i <= n; i++) result += (n - 1 - deg[i]) * deg[i]; result /= 2; result = n * (n - 1) * (n - 2) / 6 - result; cout << result; }
#include <bits/stdc++.h> const int MAXN = 1e5 + 19; int qpow(int a, int b, int p) { int res = 1; while (b) { if (b & 1) res = (long long)res * a % p; a = (long long)a * a % p, b >>= 1; } return res; } int n, m, k, p; int fa[MAXN], size[MAXN]; int getf(int node) { return fa[node] == node ? node : fa[node] = getf(fa[node]); } int main() { std::scanf( %d%d%d , &n, &m, &p); for (int i = 1; i <= n; ++i) fa[i] = i, size[i] = 1; for (int i = 1; i <= m; ++i) { int u, v; std::scanf( %d%d , &u, &v); if (getf(u) != getf(v)) { size[getf(v)] += size[getf(u)]; fa[getf(u)] = getf(v); } } int ans = 1; for (int i = 1; i <= n; ++i) if (fa[i] == i) ++k, ans = (long long)ans * size[i] % p; if (k >= 2) ans = (long long)ans * qpow(n, k - 2, p) % p; else ans = 1; std::printf( %d n , ans % p); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { vector<long long int> vec1, vec2; vector<long long int>::iterator it; long long int n, a, sz, s1 = 0, s2 = 0, s3 = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a; s1 += a; } n--; for (int i = 0; i < n; i++) { cin >> a; s2 += a; } n--; for (int i = 0; i < n; i++) { cin >> a; s3 += a; } cout << s1 - s2 << endl << s2 - s3; return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 2000000000; const int maxn = 1000005; int n; int a[maxn]; bool vis[maxn]; int main() { long long ans = 0LL; scanf( %d , &n); for (int i = n; i >= 0; i--) { if (vis[i]) continue; int t = 0, s = 0; for (int j = 0; j < 20; j++) if (i & (1 << j)) s = j; for (int j = s - 1; j >= 0; j--) if (!(i & (1 << j))) t |= (1 << j); a[i] = t, a[t] = i; vis[i] = vis[t] = 1; ans += 2 * (i ^ t); } printf( %I64d n , ans); for (int i = 0; i < n; i++) printf( %d , a[i]); printf( %d n , a[n]); return 0; }
#include <bits/stdc++.h> using namespace std; int fail[1000006]; int main() { int n, k; cin >> n >> k; string s; cin >> s; fail[-1] = fail[0] = -1; for (int i = 1; i < n; ++i) { int ptr = i - 1; while (s[i] != s[fail[ptr] + 1] && ptr > 0) ptr = fail[ptr]; fail[i] = fail[ptr] + (s[i] == s[fail[ptr] + 1]); } for (int i = 0; i < n; ++i) { int le = i - fail[i]; int cc = (i + 1) / le; if ((i + 1) % le == 0) { if (cc / k - cc % k >= 0) cout << 1; else cout << 0; } else { if (cc / k - cc % k > 0) cout << 1; else cout << 0; } } cout << endl; }
#include <bits/stdc++.h> using namespace std; long long min(long long x, long long y) { return (x < y) ? x : y; } long long max(long long x, long long y) { return (x > y) ? x : y; } const int N = 100009; int x, y, n, m, i, u, w, z, sum, best, j, k, t, mx; int a[N]; string s, ans; int main() { ios_base::sync_with_stdio(false); cin >> s; n = s.size(); while (i < n) { if (s[i] == d && s[i + 1] == o && s[i + 2] == t && i != 0 && i != n - 3) { ans.push_back( . ); i += 2; } else if (s[i] == a && s[i + 1] == t && !x && i != 0 && i != n - 2) { x = 1; i++; ans.push_back( @ ); } else ans.push_back(s[i]); i++; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; vector<int> V[1005]; int dis[1005], rdis[1005], G[1005][1005]; void spfa(int s, int e) { queue<int> Q; memset(dis, 0x3f, sizeof(dis)); memset(rdis, 0x3f, sizeof(rdis)); Q.push(s); dis[s] = 0; while (!Q.empty()) { int f = Q.front(); for (int i = (0); i < ((int)(V[f]).size()); i++) { int nex = V[f][i]; if (dis[nex] > dis[f] + 1) { dis[nex] = dis[f] + 1; Q.push(nex); } } Q.pop(); } Q.push(e); rdis[e] = 0; while (!Q.empty()) { int f = Q.front(); for (int i = (0); i < ((int)(V[f]).size()); i++) { int nex = V[f][i]; if (rdis[nex] > rdis[f] + 1) { rdis[nex] = rdis[f] + 1; Q.push(nex); } } Q.pop(); } } int main() { int n, m, s, e; scanf( %d%d%d%d , &n, &m, &s, &e); while (m--) { int a, b; scanf( %d%d , &a, &b); V[a].push_back(b); V[b].push_back(a); G[a][b] = G[b][a] = 1; } int ans = 0; spfa(s, e); for (int i = (1); i < (n + 1); i++) for (int j = (i + 1); j < (n + 1); j++) if (dis[i] + 1 + rdis[j] >= dis[e] && dis[j] + 1 + rdis[i] >= dis[e] && !G[i][j]) ans++; printf( %d n , ans); return 0; }
#include <bits/stdc++.h> typedef long long ll; using namespace std; int k; int addk(int a,int b) { int base,aw,bw,ret=0; for(base=1;base<=max(a,b);base*=k) { aw=a/base%k; bw=b/base%k; ret+=(aw+bw)%k*base; } return ret; } int subk(int a,int b) { int base,aw,bw,ret=0; for(base=1;base<=max(a,b);base*=k) { aw=a/base%k; bw=b/base%k; ret+=(aw-bw+k)%k*base; } return ret; } int main() { int T,n,y,i,r; scanf( %d ,&T); while(T--) { scanf( %d%d ,&n,&k); for(i=0;i<n;i++) { if(i==0) y=0; else if(i&1) y=subk(i-1,i); else y=subk(i,i-1); printf( %d n ,y); fflush(stdout); scanf( %d ,&r); if(r==1) break; } } }
#include <bits/stdc++.h> using namespace std; int n, k; const int maxn = 1e5 + 10; stack<int> max_seen; int ans[maxn]; vector<int> to[maxn]; void calc(int a) { int s = max(a - k, 0), t = min(n, a + k + 1); if (max_seen.empty()) ans[a] += t - s; else ans[a] += t - max(max_seen.top(), s); max_seen.push(t); for (int i = 0; i < to[a].size(); i++) { ans[to[a][i]] = ans[a]; calc(to[a][i]); } max_seen.pop(); } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k; for (int i = 0; i < n; i++) { int x; cin >> x; if (x > 0) to[x - 1].push_back(i); } for (int i = 0; i < n; i++) if (ans[i] == 0) calc(i); for (int i = 0; i < n; i++) cout << ans[i] << ; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; cin >> s; long ans = 0; for (int i = 0; i < n; i++) { if ((s[i] - 0 ) % 2 == 0) ans += (i + 1); } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 35; int n, m; int a[MAXN][MAXN]; int part[MAXN][MAXN], partn = 0; long long ans = 0; int x[MAXN][2]; int res[MAXN][MAXN]; int c[MAXN]; int u[MAXN]; void read() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { char tmp[35]; scanf( %s , tmp + 1); for (int j = 1; j <= m; j++) { if (tmp[j] == . ) a[i][j] = 0; else if (tmp[j] >= a ) a[i][j] = tmp[j] - a + 1; else a[i][j] = tmp[j] - A + 26 + 1; } } } void prepare() { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (a[i][j] != 0 && !part[i][j]) { partn++; part[i][j] = part[i][j + 1] = part[i + 1][j] = part[i + 1][j + 1] = partn; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (a[i][j] != 0) { int k = a[i][j]; if (x[k][0] == 0) x[k][0] = part[i][j]; else x[k][1] = part[i][j]; } for (int i = 1; i <= 28; i++) { if (x[i][0] > x[i][1]) x[i][0] ^= x[i][1] ^= x[i][0] ^= x[i][1]; } } bool chk(int p) { bool e[10][10]; memset(e, 0, sizeof(e)); for (int i = 1; i <= 28; i++) if (x[i][1] <= p) { int f = c[x[i][0]], g = c[x[i][1]]; if (f > g) f ^= g ^= f ^= g; if (e[f][g]) return false; e[f][g] = true; } return true; } void dfs(int p) { if (p > partn) { if (ans == 0) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (a[i][j] != 0) res[i][j] = c[part[i][j]]; } ans += 5040; return; } for (int i = 0; i <= 6; i++) if (u[i] <= 1) { c[p] = i; if (!chk(p)) continue; u[i]++; dfs(p + 1); u[i]--; if (u[i] == 0) return; } } void work() { dfs(1); } void print() { printf( %I64d n , ans); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (a[i][j] == 0) printf( . ); else printf( %d , res[i][j]); } printf( n ); } } int main() { read(); prepare(); work(); print(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; long long c = n, maxi = INT_MIN, mini = INT_MIN, t = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (maxi != a[i]) { maxi = a[i]; mini = a[i]; t = 1; } else { t++; c += t - 1; } } cout << c << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int ar[305][305]; vector<pair<int, int> > poss[90005]; int dp[305][305]; vector<int> col[305]; int vis[305]; int n, m, p; void pr() {} void solve() { memset(dp, 127, sizeof(dp)); ; scanf( %d %d %d , &n, &m, &p); for (int i = 0; i < (int)(n); i++) { for (int j = 0; j < (int)(m); j++) { scanf( %d , &ar[i][j]); poss[ar[i][j]].push_back(make_pair(i, j)); if (ar[i][j] == 1) { dp[i][j] = i + j; } } } for (int val = 2; val <= p; val++) { memset(vis, 0, sizeof(vis)); ; for (int i = 0; i < (int)(m); i++) { col[i].clear(); } for (int i = 0; i < poss[val].size(); i++) { pair<int, int> a = poss[val][i]; col[a.second].push_back(a.first); } for (int i = 0; i < poss[val - 1].size(); i++) { pair<int, int> a = poss[val - 1][i]; vis[a.first] = 1; } for (int i = 0; i < n; i++) { if (!vis[i]) continue; int best = 1e9; for (int j = 0; j < m; j++) { best++; if (ar[i][j] == val - 1) best = min(best, dp[i][j]); for (int k = 0; k < col[j].size(); k++) { dp[col[j][k]][j] = min(dp[col[j][k]][j], best + abs(col[j][k] - i)); } } best = 1e9; for (int j = m; j >= 0; j--) { best++; if (ar[i][j] == val - 1) best = min(best, dp[i][j]); for (int k = 0; k < col[j].size(); k++) { dp[col[j][k]][j] = min(dp[col[j][k]][j], best + abs(col[j][k] - i)); } } } } printf( %d , dp[poss[p][0].first][poss[p][0].second]); } int main() { int TC = 1; for (int ZZ = 1; ZZ <= TC; ZZ++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = (int)2E9; const long long LINF = (long long)9E18; const long double PI = acos(-1.0); const long double EPS = 1E-11; template <typename T> inline T sqr(const T x) { return x * x; } template <typename T> T gcd(T a, T b) { return (b == 0) ? a : gcd(b, a % b); } template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } template <typename T> T mod(T a, T b) { a %= b; if (a < 0) a += b; return a; } template <typename T> inline T rad(const T x) { return x * PI / 180; } template <typename T> inline string toString(T x) { ostringstream oss; oss << x; return oss.str(); } inline long long toInt(const string& st) { istringstream istringstream(st); long long x; istringstream >> x; return x; } inline long double toDouble(const string& st) { istringstream istringstream(st); long double x; istringstream >> x; return x; } inline string toLower(string st) { for (int i = 0; i < (((int)(st).size())); ++i) st[i] = tolower(st[i]); return st; } inline string toUpper(string st) { for (int i = 0; i < (((int)(st).size())); ++i) st[i] = toupper(st[i]); return st; } const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, 1, 0, -1}; int DEBUG = false; const char DEBUG_PARAM[] = __LOCAL_TESTING ; const int MAXCLOCK = 100; int aClock[MAXCLOCK], mClock[MAXCLOCK], nClock = 0, iClock = 0; inline void tick(int maxTime = 10000) { if (DEBUG) { mClock[nClock] = maxTime; aClock[nClock++] = clock(); } } inline void untick(string name = Execution Time ) { if (DEBUG) { int numClock = clock() - aClock[--nClock]; cout << @ << name << : [ << (int)((double)(numClock) / CLOCKS_PER_SEC * 1000) << ms] ; if (numClock > (int)(mClock[nClock])) cout << [TLE] ; else if (numClock > (int)(mClock[nClock] * 0.9)) cout << [almost TLE] ; cout << endl; } } const char IN[] = _.in ; const char OUT[] = _.out ; int ntest = 1, test = 1; int n; map<string, string> type; pair<int, int> findDefRef(string w) { int d = 0, r = 0; while (d < ((int)(w).size()) && w[d] == & ) d++; while (r < ((int)(w).size()) && w[((int)(w).size()) - r - 1] == * ) r++; return make_pair(d, r); } string removeDefRef(string w) { pair<int, int> tmp = findDefRef(w); return w.substr(tmp.first, ((int)(w).size()) - tmp.first - tmp.second); } string findType(string original, int def, int ref) { if (type.count(original) == 0) { return errtype ; } string nowType = type[original]; if (nowType == errtype ) { return nowType; } pair<int, int> tmp = findDefRef(nowType); nowType = removeDefRef(nowType); def += tmp.first, ref += tmp.second; if (def > ref) { return errtype ; } else { ref -= def; def = 0; } for (int i = 0; i < (ref); ++i) nowType = nowType + * ; return nowType; } inline void run() { type[ void ] = void ; type[ errtype ] = errtype ; for (test = 1; test <= ntest; ++test) { tick((int)2E3); cin >> n; string command, a, b; pair<int, int> tmp; int def, ref; for (int i = (1); i <= (n); ++i) { cin >> command; if (command == typedef ) { cin >> a >> b; tmp = findDefRef(a); def = tmp.first, ref = tmp.second; a = removeDefRef(a); type[b] = findType(a, def, ref); } else { cin >> a; tmp = findDefRef(a); def = tmp.first, ref = tmp.second; a = removeDefRef(a); cout << findType(a, def, ref) << endl; } } untick( # + toString(test)); } } int main(int argc, char* argv[]) { if (argc > 1 && strcmp(argv[1], DEBUG_PARAM) == 0) { DEBUG = true; } if (DEBUG) { tick((int)1E4); freopen(IN, r , stdin); } run(); if (DEBUG) { untick( TOTAL ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int cnt[1001] = {0}, a[n]; for (int i = 0; i < n; ++i) { cin >> a[i]; cnt[a[i]] = i; } int vis[1001] = {0}; vector<int> res; for (int i = 0; i < n; i++) { if (cnt[a[i]] == i) res.push_back(a[i]); } cout << res.size() << endl; for (int i = 0; i < res.size(); ++i) cout << res[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( avx,avx2,fma ) #pragma GCC optimization( unroll-loops ) using namespace std; using namespace chrono; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << : << arg1 << n ; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cout.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } long long int advceil(long long int num, long long int den) { return (num % den == 0 ? num / den : num / den + 1); } long long int lstbt(long long int val) { long long int msk = val & (val - 1); return log2(val ^ msk); } long long int modmul(long long int a, long long int b) { a %= 1000000007; b %= 1000000007; long long int res = 0; while (b > 0) { if (b & 1) res = (res + a) % 1000000007; a = (a * 2) % 1000000007; b /= 2; } return res; } long long int modexpo(long long int a, long long int b) { long long int res = 1; while (b > 0) { if (b & 1) res = modmul(res, a); a = modmul(a, a); b /= 2; } return res; } long long int gcd(long long int a, long long int b) { return a == 0 ? b : gcd(b % a, a); } vector<long long int> CALCfactor(long long int n) { vector<long long int> factor(n + 2, 0); for (long long int i = 4; i <= n; i += 2) factor[i] = 2; for (long long int j = 3; j <= n; j += 2) { if (factor[j]) continue; for (long long int i = 2 * j; i <= n; i += j) factor[i] = j; } return factor; } vector<long long int> CALCprimeNUM(long long int n) { vector<long long int> factor = CALCfactor(n); vector<long long int> primeNUM; primeNUM.reserve(n + 2); for (long long int i = 2; i <= n; i++) if (!factor[i]) primeNUM.push_back(i); return primeNUM; } vector<long long int> CALCprimeFACTOR(long long int n) { vector<long long int> factor = CALCfactor(n); vector<long long int> ans; while (factor[n] != 0) { ans.push_back(factor[n]); n /= factor[n]; } ans.push_back(n); return ans; } vector<long long int> unique(vector<long long int> x) { sort(x.begin(), x.end()); set<long long int> s; vector<long long int> ans; ans.reserve(x.size()); for (auto elem : x) s.insert(elem); for (auto elem : s) ans.push_back(elem); return ans; } vector<long long int> ZALGO(string s, string pat) { long long int lens = pat.length(); pat += char(36); pat += s; s = pat; vector<long long int> pref(s.length() + 1, 0); pref[0] = s.length(); long long int spt = -1; long long int ept = -1; long long int processCnt = 0; for (long long int i = 1; i < s.length(); i++) { bool isdone = false; if (i <= ept and i >= spt) { if (pref[i - spt] + i <= ept) pref[i] = pref[i - spt], isdone = true; processCnt++; } if (!isdone) { long long int ptr = i; long long int lo = 0; while (s[lo] == s[ptr]) ptr++, lo++, processCnt++; if (ept < ptr - 1) { spt = i; ept = ptr - 1; } pref[i] = lo; } } vector<long long int> ans; ans.reserve(s.length() - lens); for (long long int i = lens + 1; i < s.length(); i++) ans.push_back(pref[i]); return ans; } void spclSort( vector<pair<pair<long long int, long long int>, long long int>>& v) { long long int n = v.size(); { vector<long long int> cnt(n); for (auto elem : v) { cnt[elem.first.second]++; } vector<pair<pair<long long int, long long int>, long long int>> a_new(n); vector<long long int> pos(cnt.size()); pos[0] = 0; for (long long int i = 1; i < cnt.size(); i++) { pos[i] = cnt[i - 1] + pos[i - 1]; } for (auto elem : v) { a_new[pos[elem.first.second]] = elem; pos[elem.first.second]++; } v = a_new; } { vector<long long int> cnt(n, 0); for (auto elem : v) { cnt[elem.first.first]++; } vector<pair<pair<long long int, long long int>, long long int>> a_new(n); vector<long long int> pos(cnt.size()); pos[0] = 0; for (long long int i = 1; i < cnt.size(); i++) { pos[i] = cnt[i - 1] + pos[i - 1]; } for (auto elem : v) { a_new[pos[elem.first.first]] = elem; pos[elem.first.first]++; } v = a_new; } } pair<vector<vector<long long int>>, vector<vector<long long int>>> getOrdering( string s) { s += char(36); vector<vector<long long int>> dp; dp.reserve(log2(s.length()) + 3); vector<vector<long long int>> dp2; dp2.reserve(log2(s.length()) + 3); vector<long long int> ordering(s.length()), eqClass(s.length()); { vector<pair<char, long long int>> temp(s.length()); for (long long int i = 0; i < s.length(); i++) temp[i] = {s[i], i}; sort(temp.begin(), temp.end()); for (long long int i = 0; i < temp.size(); i++) ordering[temp[i].second] = i; eqClass[temp[0].second] = 0; for (long long int i = 1; i < temp.size(); i++) { if (temp[i].first != temp[i - 1].first) eqClass[temp[i].second] = eqClass[temp[i - 1].second] + 1; else eqClass[temp[i].second] = eqClass[temp[i - 1].second]; } dp.push_back(ordering); dp2.push_back(eqClass); } long long int k = 1; while ((1 << (k - 1)) < s.length()) { vector<pair<pair<long long int, long long int>, long long int>> arr( s.length()); for (long long int i = 0; i < s.length(); i++) { arr[i] = {{eqClass[i], eqClass[(i + (1 << (k - 1))) % s.length()]}, i}; } spclSort(arr); for (long long int i = 0; i < s.length(); i++) ordering[arr[i].second] = i; eqClass[arr[0].second] = 0; for (long long int i = 1; i < s.size(); i++) { if (arr[i].first != arr[i - 1].first) eqClass[arr[i].second] = eqClass[arr[i - 1].second] + 1; else eqClass[arr[i].second] = eqClass[arr[i - 1].second]; } dp.push_back(ordering); dp2.push_back(eqClass); k++; } return {dp, dp2}; } vector<long long int> sortOrdering(vector<vector<long long int>> dp) { vector<long long int> arr = dp[dp.size() - 1]; vector<long long int> ans(arr.size()); long long int cnt = 0; for (auto elem : arr) { ans[elem] = cnt; cnt++; } return ans; } vector<long long int> getLps(string pat) { long long int i = 1; long long int j = 0; vector<long long int> lps(pat.length(), 0); lps[0] = 0; while (i < pat.length()) { if (pat[i] == pat[j]) lps[i] = j + 1, i++, j++; else if (j == 0) lps[i] = 0, i++; else j = lps[j - 1]; } return lps; } pair<vector<long long int>, vector<long long int>> getFact(long long int n) { vector<long long int> fact(n + 1, 1), invfact(n + 1, 1); for (long long int i = 1; i <= n; i++) fact[i] = (i * (fact[i - 1])) % 1000000007; for (long long int i = 1; i <= n; i++) invfact[i] = (modexpo(i, 1000000007 - 2) * invfact[i - 1]) % 1000000007; return {fact, invfact}; } void solve() { long long int n; cin >> n; cout << 2 << n ; for (long long int i = 3; i <= n + 1; i++) { cout << (i * (i) * (i - 1) - (i - 2)) << n ; } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); auto start1 = high_resolution_clock::now(); solve(); auto stop1 = high_resolution_clock::now(); auto duration = duration_cast<microseconds>(stop1 - start1); }
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); char ar[n + 2]; char br[n + 2]; scanf( %s%s , ar + 1, br + 1); vector<int> v[2]; for (int i = 1; i <= n; i++) { if (ar[i] != br[i]) { if (ar[i] == a ) v[0].push_back(i); else v[1].push_back(i); } } if ((v[0].size() + v[1].size()) % 2 == 1) cout << -1 << endl; else { int res = v[0].size() + v[1].size(); res /= 2; if (v[0].size() % 2) res += 1; cout << res << endl; for (int i = 1; i < v[0].size(); i += 2) { cout << v[0][i - 1] << << v[0][i] << endl; } for (int i = 1; i < v[1].size(); i += 2) { cout << v[1][i - 1] << << v[1][i] << endl; } if (v[0].size() % 2) { cout << v[0][v[0].size() - 1] << << v[0][v[0].size() - 1] << endl; cout << v[0][v[0].size() - 1] << << v[1][v[1].size() - 1] << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; int k; int n; int planks[1005]; int g = 0; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> k; for (int t = 0; t < k; t++) { cin >> n; for (int i = 0; i < n; i++) cin >> planks[i]; sort(planks, planks + n, [](int a, int b) { return a > b; }); g = 0; for (int i = 0; i < n; i++) if (planks[i] >= i + 1) g = max(g, i + 1); cout << g << n ; } }
#include <bits/stdc++.h> using namespace std; long long A[200005]; long long fast_pow(long long a, long long b) { long long res = 1; while (b > 0) { if (b & 1) res = (res * a) % 1000000007; a = (a * a) % 1000000007; b >>= 1; } return res; } int main() { long long div = 1, num = 1; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> A[i]; num = (num * A[i]) % 1000000007; } sort(A, A + n); int idx = 0; bool chk = true; while (idx < n) { long long p = A[idx]; long long cnt = 0; while (idx < n && p == A[idx]) { idx++; cnt++; } div = (div * (cnt + 1LL)) % (2LL * (1000000007 - 1)); chk = (chk && (cnt % 2 == 0)); } div = (div % ((1000000007 - 1) * 2LL)) / 2; long long ans = fast_pow(num, div); if (chk) { idx = 0; while (idx < n) { long long p = A[idx]; long long cnt = 0; while (idx < n && p == A[idx]) { idx++; cnt++; } ans = (ans * fast_pow(p, cnt / 2)) % 1000000007; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; if ((n == 1 && k > 0) || (k == 0 && n > 1) || k < n / 2) cout << -1; else if (k == 0) cout << 1; else { int x = k - (n - 2) / 2; cout << x << << x * 2 << ; for (int i = 1; i <= n - 2; ++i) cout << x * 2 + i << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2001000, mod = 998244353; int n, a[N], b[N], f[N], ans, sum, inv[N]; void Init() { f[0] = inv[1] = 1; f[1] = n; for (int i = 2; i < N; ++i) { inv[i] = mod - mod / i * (long long)inv[mod % i] % mod; f[i] = (long long)f[i - 1] * (n - 1 + i) % mod * inv[i] % mod; } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; Init(); for (int i = 1; i <= n; ++i) { cin >> a[i]; ++b[a[i]]; } for (int i = 0, j = 0; i < n; ++i) { j += b[i]; if (j >= i + 2) { cout << (ans + 1) % mod << n ; return 0; } ans = (ans + f[i - j + 1]) % mod; } memset(b, 0, sizeof b); ans = 0; for (int i = 1; i <= n; ++i) sum += a[i] / n, b[a[i] % n]++; for (int i = 0; i < n; ++i) { ans = (ans + f[sum]) % mod; sum -= b[i] - 1; } cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; struct mat { long double x[51][51]; } mi, ma; int n, p; long double pa, push_back, aa[51][51], bb[51][51], dp[51][51], ta, tb, ans; mat tim(mat a, mat b) { mat re; for (int c = 0; c < 51; c++) for (int d = 0; d < 51; d++) { re.x[c][d] = 0; for (int e = 0; e < 51; e++) re.x[c][d] += a.x[c][e] * b.x[e][d]; } return re; } mat po(int p) { if (p == 0) return mi; if (p & 1) return tim(ma, po(p - 1)); mat tt = po(p / 2); return tim(tt, tt); } int main() { scanf( %d%d , &n, &p); pa = p; pa /= 1000000007 - 7; push_back = 1 - pa; for (int a = 0; a <= 50; a++) aa[a][0] = bb[a][0] = 1; aa[1][1] = pa; aa[1][2] = push_back; bb[1][2] = 1; for (int a = 2; a <= 50; a++) { aa[a][1] = pa; aa[a][2] = pa * pa + push_back; bb[a][2] = 1; for (int b = 3; b <= 50; b++) { aa[a][b] = aa[a][b - 1] * aa[a - 1][b - 1]; bb[a][b] = bb[a][b - 1] * aa[a - 1][b - 1]; } } for (int a = 1; a <= 50; a++) dp[1][a] = a; for (int a = 2; a <= 50; a++) for (int b = 1; b <= 50; b++) { ta = tb = 0; if (b == 1) { for (int c = 2; c <= 50; c++) { ta += dp[a - 1][c] * bb[a - 1][c] * (1 - aa[a - 2][c]); tb += bb[a - 1][c] * (1 - aa[a - 2][c]); } } else { for (int c = 1; c < b; c++) { ta += dp[a - 1][c] * aa[a - 1][c] * (1 - aa[a - 2][c]); tb += aa[a - 1][c] * (1 - aa[a - 2][c]); } } dp[a][b] = b + ta / tb; } if (n <= 50) { for (int a = 1; a <= 50; a++) ans += aa[n][a] * (1 - aa[n - 1][a]) * dp[n][a]; } else { for (int a = 0; a < 51; a++) mi.x[a][a] = 1; ma.x[0][0] = 1; for (int a = 1; a <= 50; a++) { ma.x[a][0] = a; if (a == 1) { ta = 0; for (int b = 2; b <= 50; b++) { ma.x[a][b] += bb[50][b] * (1 - aa[50][b]); ta += bb[50][b] * (1 - aa[50][b]); } for (int b = 2; b <= 50; b++) ma.x[a][b] /= ta; } else { ta = 0; for (int b = 1; b < a; b++) { ma.x[a][b] += aa[50][b] * (1 - aa[50][b]); ta += aa[50][b] * (1 - aa[50][b]); } for (int b = 1; b < a; b++) ma.x[a][b] /= ta; } } ma = po(n - 50); for (int a = 1; a <= 50; a++) { ta = ma.x[a][0]; for (int b = 1; b <= 50; b++) ta += ma.x[a][b] * dp[50][b]; ans += aa[50][a] * (1 - aa[50][a]) * ta; } } printf( %.20lf n , (double)ans); return 0; }
#include <bits/stdc++.h> using namespace std; int sum[51], ind[51]; int main() { for (int i = 1; i <= 50; ++i) sum[i] = i * (i + 1) / 2; for (int i = 1; i <= 50; ++i) ind[i] = i; int n, temp, reqind; cin >> n; for (int i = 1; i <= 50; ++i) { if (n <= sum[i]) { temp = sum[i]; reqind = i; break; } } int diff = temp - n; if (diff == 0) { cout << reqind << endl; for (int k = 1; k <= reqind; ++k) cout << ind[k] << ; cout << endl; return 0; } cout << reqind - 1 << endl; for (int i = 1; i <= reqind; ++i) { if (i != diff) cout << i << ; } cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, m; cin >> n >> m; for (long long i = 1; i <= n; i++) { long long s, f, t; cin >> s >> f >> t; if (s == f) { cout << t << endl; } else if (s < f) { long long t1 = s - 1; while (t1 < t) { t1 += (m - s) + (m - 1) + (s - 1); } t1 += (f - s); cout << t1 << endl; } else if (s > f) { long long t1 = (m - 1) + (m - s); while (t1 < t) { t1 += (m - 1) + (m - s) + (s - 1); } t1 += (s - f); cout << t1 << endl; } } }
#include <bits/stdc++.h> using namespace std; const int maxn = 405; const int inf = 0x3f3f3f3f; int n, m; int a[maxn]; int f[maxn][maxn][maxn]; template <typename T> inline void minimize(T &target, const T &value) { if (target > value) { target = value; } } void divide(int a[], int f[], int g[], int l, int r, int pl, int pr) { if (l > r) { return; } int m = (l + r) / 2; int ptr = l; for (int i = pl; i < min(m, pr + 1); ++i) { int tmp = max(f[i], a[m] - a[i]); if (tmp < g[m]) { g[m] = tmp; ptr = i; } } divide(a, f, g, l, m - 1, pl, ptr); divide(a, f, g, m + 1, r, ptr, pr); } void compute(int a[], int n, int f[maxn][maxn]) { f[0][0] = 0; for (int i = 1; i < n; ++i) { divide(a, f[i - 1], f[i], 0, n - 1, 0, n - 1); } } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) { scanf( %d , a + i); } memset(f, inf, sizeof(f)); compute(a, n, f[0]); for (int i = 0; i < n; ++i) { compute(a + i, n - i, f[i]); } long long ans = 0; while (m--) { int s, f, c, r; scanf( %d%d%d%d , &s, &f, &c, &r), s--, f--; r++; r = min(r, f - s); r = max(r, 1); ans = max(ans, (long long)c * ::f[s][r][f - s]); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; pair<int, int> pairs[2 * 100000 + 10]; vector<int> adj[100000 + 10]; bool done[100000 + 10]; int result[100000 + 10]; void check(int N) { bool adj[N + 2][N + 2]; memset(adj, false, sizeof(adj)); for (int i = 1; i <= 2 * N; i++) { scanf( %d %d , &pairs[i].first, &pairs[i].second); adj[pairs[i].first][pairs[i].second] = true; adj[pairs[i].second][pairs[i].first] = true; } int A[N]; for (int i = 0; i < N; i++) A[i] = i + 1; do { bool found = true; for (int i = 0; i < N; i++) if (!(adj[A[i]][A[(i + 1) % N]] && adj[A[i]][A[(i + 2) % N]])) found = false; if (found) { for (int i = 0; i < N; i++) printf( %d , A[i]); printf( n ); return; } } while (next_permutation(A, A + N)); printf( -1 n ); } bool contains(int a, int b) { for (int i = 0; i < adj[a].size(); i++) if (adj[a][i] == b) return true; return false; } int main() { int N; scanf( %d , &N); if (N == 5 || N == 6) { check(N); return 0; } for (int i = 1; i <= 2 * N; i++) { scanf( %d %d , &pairs[i].first, &pairs[i].second); adj[pairs[i].first].push_back(pairs[i].second); adj[pairs[i].second].push_back(pairs[i].first); } int prev = 1; done[1] = true; result[0] = 1; int candidate[4 + 1], counts[4 + 1], num; for (int i = 1; i <= N; i++) if (adj[i].size() != 4) { printf( -1 n ); return 0; } for (int i = 1; i < N; i++) { int num = 0; for (int j = 0; j < adj[prev].size(); j++) candidate[num++] = adj[prev][j]; memset(counts, 0, sizeof(counts)); for (int j = 0; j < num; j++) for (int k = 0; k < adj[candidate[j]].size(); k++) for (int l = 0; l < num; l++) if (adj[candidate[j]][k] == candidate[l]) counts[l]++; for (int j = 0; j < num; j++) if (!done[candidate[j]] && counts[j] >= 2) { prev = candidate[j]; done[prev] = true; result[i] = prev; break; } } for (int i = 1; i <= N; i++) if (!done[i]) { printf( -1 n ); return 0; } bool found = true; for (int i = 0; i < N; i++) if (!(contains(result[i], result[(i + 1) % N]) && contains(result[i], result[(i + 2) % N]))) found = false; if (!found) { printf( -1 n ); return 0; } for (int i = 0; i < N; i++) printf( %d , result[i]); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); struct Comp { double re, im; Comp(double x = 0.0, double y = 0.0) : re(x), im(y) {} Comp operator+(const Comp& rhs) const { return Comp(re + rhs.re, im + rhs.im); } Comp operator-(const Comp& rhs) const { return Comp(re - rhs.re, im - rhs.im); } Comp operator*(const Comp& rhs) const { return Comp(re * rhs.re - im * rhs.im, re * rhs.im + im * rhs.re); } Comp operator/(double x) const { return Comp(re / x, im / x); } }; int fft_len, fft_lg; vector<int> r; void ensure_base(int deg) { fft_len = 2, fft_lg = 1; while (fft_len <= deg) fft_len <<= 1, fft_lg++; r = vector<int>(fft_len, 0); for (int i = 0; i < fft_len; ++i) r[i] = (r[i >> 1] >> 1) | ((i & 1) << (fft_lg - 1)); } void fft(vector<Comp>& A, int dft) { for (int i = 0; i < fft_len; ++i) if (i < r[i]) swap(A[i], A[r[i]]); for (int mid = 1; mid < fft_len; mid <<= 1) { Comp wn = Comp(cos(PI / mid), sin(PI / mid) * dft); for (int len = mid << 1, s = 0; s < fft_len; s += len) { Comp w(1, 0); for (int k = 0; k < mid; ++k, w = w * wn) { Comp x = A[s + k], y = w * A[s + k + mid]; A[s + k] = x + y; A[s + k + mid] = x - y; } } } if (dft == -1) for (int i = 0; i < fft_len; ++i) A[i] = A[i] / fft_len; } void fft_pmul(vector<Comp>& A, int degA, vector<Comp>& B, int degB) { ensure_base(degA + degB); A.resize(fft_len, 0), B.resize(fft_len, 0); fft(A, 1); fft(B, 1); for (int i = 0; i < fft_len; ++i) A[i] = A[i] * B[i]; fft(A, -1); } int p[26], q[26]; string s, t; int main() { ios::sync_with_stdio(false); for (int i = 0; i < 26; ++i) cin >> q[i], p[q[i] - 1] = i; cin >> t >> s; int n = s.length(), m = t.length(); reverse(t.begin(), t.end()); vector<Comp> ps1(n), ps2(n), ps3(n), pt1(m), pt2(m), pt3(m); vector<double> p0(n); for (int i = 0; i < n; ++i) { int v = s[i] - a ; ps3[i].re = -(2 * v + 2 * p[v]); ps2[i].re = v * v + 4 * v * p[v] + p[v] * p[v]; ps1[i].re = -2 * v * p[v] * (v + p[v]); p0[i] = v * v * p[v] * p[v]; if (i) p0[i] += p0[i - 1]; } double t4 = 0; for (int i = 0; i < m; ++i) { int v = t[i] - a ; pt3[i].re = v * v * v; pt2[i].re = v * v; pt1[i].re = v; t4 += v * v * v * v; } fft_pmul(ps3, n, pt3, m); fft_pmul(ps2, n, pt2, m); fft_pmul(ps1, n, pt1, m); for (int i = m - 1; i < n; ++i) { double res = t4 + ps3[i].re + ps2[i].re + ps1[i].re + p0[i] - (i - m < 0 ? 0 : p0[i - m]); putchar( 0 + (fabs(res) < 0.8)); } return 0; }
#include <bits/stdc++.h> using namespace std; int a[110], b[110]; int main() { int n, m, i, j; cin >> n >> m; for (i = 1; i <= m; i++) cin >> a[i]; for (i = 1; i <= m; i++) for (j = a[i]; b[j] == 0; j++) b[j] = a[i]; for (i = 1; i <= n; i++) cout << b[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; long long a[100100], b[100100]; int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); long long n, m, cl, ce, v, x1, y1, x2, y2, q, mi; cin >> n >> m >> cl >> ce >> v; for (long long i = 0; i < cl; i++) cin >> a[i]; for (long long i = 0; i < ce; i++) cin >> b[i]; cin >> q; while (q--) { mi = 1e18; cin >> x1 >> y1 >> x2 >> y2; swap(x1, y1); swap(x2, y2); if (x1 > x2) swap(x1, x2), swap(y1, y2); long long t = abs(y1 - y2); if (t == 0) { cout << abs(x1 - x2) << endl; continue; } long long p = lower_bound(a, a + cl, x1) - a; if (p != cl) { if (a[p] <= x2) mi = min(mi, x2 - x1 + t); else mi = min(mi, a[p] - x1 + a[p] - x2 + t); } p = upper_bound(a, a + cl, x1) - a; if (p != 0) mi = min(mi, x2 - a[p - 1] + x1 - a[p - 1] + t); p = lower_bound(b, b + ce, x1) - b; if (p != ce) { if (b[p] <= x2) mi = min(mi, x2 - x1 + (t % v == 0 ? (t / v) : (t / v + 1))); else mi = min(mi, b[p] - x2 + b[p] - x1 + (t % v == 0 ? (t / v) : (t / v + 1))); } p = upper_bound(b, b + ce, x1) - b; if (p != 0) mi = min(mi, x2 - b[p - 1] + x1 - b[p - 1] + (t % v == 0 ? (t / v) : (t / v + 1))); cout << mi << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); string com; cin >> com; string s[5]; for (int i = 0; i < 5; i++) { cin >> s[i]; if (s[i][0] == com[0] || s[i][1] == com[1]) { cout << YES ; return 0; } } cout << NO ; }
#include <bits/stdc++.h> using namespace std; vector<int> adj[200001]; bool vis[200001]; int en = -1; int a[200005], b[200005]; void dfs(int x) { vis[x] = 1; for (auto it = adj[x].begin(); it != adj[x].end(); ++it) { if (!vis[*it]) { dfs(*it); } } if (en == -1) en = x; } int main() { int n, m, i, k, l = 0, ans = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; adj[i].push_back(a[i]); } int flag = 0; for (i = 1; i <= n; i++) { cin >> b[i]; if (b[i]) flag++; } if (!flag) ans++; else if (flag % 2 == 0) ans++; int temp = -1; for (i = 1; i <= n; i++) { if (!vis[i]) { temp = en; en = -1; dfs(i); adj[en].clear(); if (temp > 0) { ans++; adj[temp].push_back(i); } } } if (temp != -1) { adj[en].push_back(1); ans++; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int n, p; long long fac[250005], ans; int main() { scanf( %d%d , &n, &p); fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p; for (int i = 1; i <= n; i++) ans = (ans + fac[n - i + 1] * (n - i + 1) % p * fac[i] % p) % p; printf( %lld , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long s[n]; for (long long c = 0; c < n; c++) cin >> s[c]; long long sum = 0; long long nextAllowedNum = 10000000000000 + 33; for (long long c = n - 1; c >= 0; c--) { if (nextAllowedNum <= 0) break; long long takeval = 0; takeval = s[c] <= nextAllowedNum ? s[c] : nextAllowedNum; nextAllowedNum = takeval - 1; sum += takeval; } cout << sum << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void vin(vector<long long int> &v, long long int t) { for (long long int i = 0; i < t; i++) cin >> v[i]; } void vout(vector<long long int> &v, long long int t) { for (long long int i = 0; i < t; i++) cout << v[i] << ; cout << endl; } void ingraph(vector<vector<long long int>> &graph, long long int m) { long long int x, y; for (long long int i = 0; i < m; i++) { cin >> x >> y; x--, y--; graph[x].push_back(y); graph[y].push_back(x); } } bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) { return (a.second < b.second); } long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } long long int lcm(long long int a, long long int b) { return a * b / gcd(a, b); } void solve() { long long int n, m, x, y; cin >> n >> m >> x >> y; long long int cost = 0; y = min(y, 2 * x); for (long long int i = 0; i < n; i++) { string s; cin >> s; for (long long int j = 0; j < m; j++) { if (s[j] == . ) { if (j != m - 1 && s[j + 1] == . ) cost += y, j++; else cost += x; } } } cout << cost << n ; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; inline int gi() { char c = getchar(); int x = 0, f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 1) + (x << 3) + c - 0 ; return x * f; } const int N = 5e5 + 5, Mod = 1e9 + 7; int x[N], y[N], n; long long ara, sx[N], sy[N], ssum[N], ans; long long sum[N]; long long cross(int i, int j) { return 1ll * x[i] * y[j] - 1ll * x[j] * y[i]; } long long cross(long long x1, long long y1, long long x2, long long y2, bool b = true) { if (!b) return x1 * y2 - x2 * y1; x1 %= Mod, y1 %= Mod; return (x1 * y2 - x2 * y1) % Mod; } int main() { n = gi(); for (int i = 1; i <= n; ++i) x[i] = gi(), y[i] = gi(); for (int i = 3; i <= n; ++i) ara += cross(x[i] - x[1], y[i] - y[1], x[i - 1] - x[1], y[i - 1] - y[1], 0); for (int i = 2; i <= n; ++i) sum[i] = sum[i - 1] + cross(i, i - 1), ssum[i] = (ssum[i - 1] + sum[i]) % Mod; for (int i = 1; i <= n; ++i) sx[i] = sx[i - 1] + x[i], sy[i] = sy[i - 1] + y[i]; for (int i = 1, j = 0; i <= n; ++i) { for (j = max(j, i + 2); j <= n - (i == 1); ++j) if (2ull * (sum[j] - sum[i] - cross(j, i)) > ara) break; const int m = n - (i == 1); int tmp = 0; tmp = (ssum[j - 1] - ssum[i + 1] - sum[i] % Mod * (j - i - 2)) % Mod; tmp = (tmp - cross(sx[j - 1] - sx[i + 1], sy[j - 1] - sy[i + 1], x[i], y[i])) % Mod; ans = (ans + ara % Mod * (j - i - 2) % Mod - 2 * tmp % Mod + Mod) % Mod; if (j > m) continue; tmp = (ssum[m] - ssum[j - 1] - sum[i] % Mod * (m - j + 1)) % Mod; tmp = (tmp - cross(sx[m] - sx[j - 1], sy[m] - sy[j - 1], x[i], y[i])) % Mod; ans = ((ans + tmp * 2 - ara % Mod * (m - j + 1) % Mod) % Mod + Mod) % Mod; } printf( %lld n , ans); }
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 7, inf = 1e9; long long n, m, cnt, ans; long long a[N], b[N], c[N], tr[N]; long long lowbit(long long x) { return x & -x; } long long query(long long x) { long long sum = 0; for (; x; x -= lowbit(x)) sum += tr[x]; return sum; } void add(long long x) { for (; x <= cnt; x += lowbit(x)) tr[x]++; } long long check(long long x) { long long sum = 0; add(lower_bound(b + 1, b + cnt + 1, 0) - b); for (long long i = 1; i <= n; i++) { if (a[i] - x < b[1]) sum += i; else if (a[i] - x > b[cnt]) ; else { long long pos = lower_bound(b + 1, b + cnt + 1, a[i] - x) - b; if (b[pos] > a[i] - x) pos--; sum += i - query(pos); } add(c[i]); } return sum; } signed main() { scanf( %lld%lld , &n, &m); for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); for (long long i = 1; i <= n; i++) a[i] = a[i - 1] + a[i], b[i] = a[i]; b[n + 1] = 0; sort(b + 1, b + n + 2); cnt = unique(b + 1, b + n + 2) - b - 1; for (long long i = 1; i <= n; i++) c[i] = lower_bound(b + 1, b + cnt + 1, a[i]) - b; printf( %lld n , check(m)); }
#include <bits/stdc++.h> using namespace std; const long long maxn = 1e6 + 10; long long n, k, A[maxn]; int32_t main() { ios_base::sync_with_stdio(false); cin >> n; for (long long i = 0; i < n; i++) { long long a, b, c, d; cin >> a >> b >> c >> d; if (a > b * c) { cout << -1 << endl; continue; } long long e = (a + d * b - 1) / (d * b); cout << e * a - (e * (e - 1ll) / 2ll * d * b) << endl; } }
#include <bits/stdc++.h> using namespace std; struct Boot { int _pos; char _char; }; struct PairBoots { Boot _left; Boot _right; }; int main() { int n; string leftBoots; string rightBoots; vector<vector<Boot>> leftBootsBucket(27); vector<vector<Boot>> rightBootsBucket(27); vector<PairBoots> ans; cin >> n; cin.ignore(); getline(cin, leftBoots); getline(cin, rightBoots); for (int i = 0; i < n; i++) { Boot leftBoot; leftBoot._pos = i; leftBoot._char = leftBoots[i]; if (leftBoot._char == ? ) leftBootsBucket[26].push_back(leftBoot); else leftBootsBucket[leftBoots[i] - a ].push_back(leftBoot); Boot rightBoot; rightBoot._pos = i; rightBoot._char = rightBoots[i]; if (rightBoot._char == ? ) rightBootsBucket[26].push_back(rightBoot); else rightBootsBucket[rightBoots[i] - a ].push_back(rightBoot); } for (int i = 0; i < 27; i++) { for (int j = 0; j < leftBootsBucket[i].size() || j < rightBootsBucket[i].size(); j++) { PairBoots temp; if (j < leftBootsBucket[i].size() && j < rightBootsBucket[i].size()) { temp._left = leftBootsBucket[i][j]; temp._right = rightBootsBucket[i][j]; } else { if (j < leftBootsBucket[i].size()) { if (rightBootsBucket[26].size() != 0) { temp._left = leftBootsBucket[i][j]; temp._right = rightBootsBucket[26][rightBootsBucket[26].size() - 1]; rightBootsBucket[26].pop_back(); goto here; } } if (j < rightBootsBucket[i].size()) { if (leftBootsBucket[26].size() != 0) { temp._left = leftBootsBucket[26][leftBootsBucket[26].size() - 1]; temp._right = rightBootsBucket[i][j]; leftBootsBucket[26].pop_back(); goto here; } } break; } here: ans.push_back(temp); } } cout << ans.size() << n ; for (auto i : ans) { cout << i._left._pos + 1 << << i._right._pos + 1 << n ; } return 0; }
#include <bits/stdc++.h> bool choice_first(std::vector<size_t> a, std::vector<size_t> b) { uint64_t sum_a, sum_b; sum_a = sum_b = 0; for (auto elem : a) { sum_a += elem; } for (auto elem : b) { sum_b += elem; } return sum_a > sum_b || (sum_a == sum_b && a < b); } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0); size_t n, m; std::cin >> n; std::vector<std::vector<std::vector<size_t>>> dp( n + 1, std::vector<std::vector<size_t>>(n + 1)); std::vector<size_t> a(n); for (size_t i = 0; i < n; i++) { std::cin >> a[i]; } std::cin >> m; for (size_t i = 0; i < n; i++) { if (i == 0) { dp[1][i] = {a[0]}; continue; } dp[1][i] = std::max(std::vector<size_t>{a[i]}, dp[1][i - 1]); } for (size_t i = 2; i <= n; i++) { for (size_t j = i - 1; j < n; j++) { if (j == i - 1) { std::vector<size_t> cur = dp[i - 1][j - 1]; cur.push_back(a[j]); dp[i][j] = cur; continue; } std::vector<size_t> first, second; first = dp[i - 1][j - 1]; first.push_back(a[j]); second = dp[i][j - 1]; if (choice_first(first, second)) { dp[i][j] = first; } else { dp[i][j] = second; } } } for (size_t i = 0; i < m; i++) { size_t k, pos; std::cin >> k >> pos; std::cout << dp[k][n - 1][pos - 1] << n ; } }
#include <bits/stdc++.h> using namespace std; template <typename T> inline T abs(T zz) { return zz < 0 ? -zz : zz; } template <typename T> inline T sqr(T zz) { return zz * zz; } const int MAGIC = 1000500; vector<int> used; vector<int> primes; bool is_prime(int n) { for (int p : primes) { if (p * p > n) break; if (n % p == 0) return false; } return true; } int main() { used = vector<int>(MAGIC, 0); for (int i = 2; i < MAGIC; ++i) { if (!used[i]) { primes.push_back(i); for (int j = i; j < MAGIC; j += i) { used[j] = true; } } } int n; cin >> n; if (is_prime(n) == 1) { cout << 1 << endl; return 0; } if (n % 2 == 0) { cout << 2 << endl; return 0; } if (is_prime(n - 2)) { cout << 2 << endl; return 0; } cout << 3 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int ans = 0, n; string s; cin >> n; for (int i = 1; i <= n; i++) { cin >> s; int flag = 0; for (int i = 0; i < s.length(); i++) if (s[i] == + ) flag = 1; if (flag) ans += 1; else ans -= 1; } cout << ans; }
#include <bits/stdc++.h> using namespace std; double R, r; struct Punct { double x, y; }; Punct A, B; inline double Dist(Punct A, Punct B) { return sqrt((A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y)); } int main() { double d; cin >> A.x >> A.y >> R; cin >> B.x >> B.y >> r; d = Dist(A, B); if (R >= r) { if (d + r <= R) { d = R - d - r; d /= 2.0; } else { if (d <= R + r) d = 0.0; else { d = d - R - r; d /= 2.0; } } } else { if (d + R <= r) { d = r - d - R; d /= 2.0; } else { if (d <= R + r) d = 0.0; else { d = d - R - r; d /= 2.0; } } } printf( %.6lf n , d); return 0; }
#include <bits/stdc++.h> using namespace std; void smain(); int main() { ios_base::sync_with_stdio(0); cout.precision(12); cout << fixed; smain(); return 0; } int n; int ans[1000001]; int f[1000001]; inline int sum(int r) { int result = 0; for (; r >= 0; r = (r & (r + 1)) - 1) result += f[r]; return result; } inline void inc(int i, int delta) { for (; i < n; i = (i | (i + 1))) f[i] += delta; } void solve(vector<pair<int, pair<int, int> > > &q) { vector<int> ts; ts.reserve(q.size()); for (auto it : q) ts.push_back(it.first); sort(ts.begin(), ts.end()); ts.resize(unique(ts.begin(), ts.end()) - ts.begin()); int m = ts.size(); memset(f, 0, sizeof(int) * m); for (auto it : q) { int tp = it.second.first; int t = lower_bound(ts.begin(), ts.end(), it.first) - ts.begin(); if (tp == 1) { inc(t, 1); } else if (tp == 2) { inc(t, -1); } else { ans[it.second.second] = sum(t); } } } void smain() { for (; scanf( %d , &n) != EOF;) { map<int, vector<pair<int, pair<int, int> > > > q; for (int i = 0; i < n; i++) { int a, t, x; scanf( %d %d %d , &a, &t, &x); q[x].emplace_back(t, make_pair(a, i)); } memset(ans, 255, sizeof(int) * n); for (auto it : q) solve(it.second); for (int i = 0; i < n; i++) if (ans[i] != -1) printf( %d n , ans[i]); } }
#include <bits/stdc++.h> using namespace std; int dx[] = {0, 0, -1, 1}; int dy[] = {-1, 1, 0, 0}; const int N = 1e6 + 5; long long ans, sum, d[N]; int n, m; int main() { int a, b; while (~scanf( %d%d , &n, &m)) { memset(d, 0, sizeof(d)); for (int i = 0; i < (m); ++i) { scanf( %d%d , &a, &b); d[a]++, d[b]++; } if (n < 3) { puts( 0 ); continue; } ans = (long long)n * (n - 1) * (n - 2) / 6; sum = 0; for (int i = (1); i <= (n); ++i) sum += d[i] * (n - 1 - d[i]); sum /= 2; printf( %lld n , ans - sum); } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, a[200009], ans = 1, b[200009], sum = 1; bool vis[200009]; void dfs(long long x) { if (vis[x]) return; vis[x] = 1; dfs(a[x]); } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; dfs(1); for (int i = 1; i <= n; i++) { if (vis[i]) continue; sum++; dfs(i); } bool f = 0, g = 0; for (int i = 1; i <= n; i++) { ans += b[i]; } ans %= 2; if (sum != 1) ans += sum; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int dp[2][105]; int main() { int c, w, h, c2; cin >> c >> w >> h; c2 = (c + 1) >> 1; int *src = dp[0], *dst = dp[1]; src[0] = 1; for (int i = 1; i <= w; i++) src[i] = 0; while (c2--) { dst[0] = src[0]; for (int i = 1; i <= w; i++) { dst[i] = src[i - 1] * h % 1000003; dst[0] += src[i]; } dst[0] %= 1000003; swap(src, dst); } int ans = 0, sum = 0; if ((c & 1) == 0) { for (int i = 0; i <= w; i++) { sum += src[i]; ans = (ans + (long long)sum * src[w - i]) % 1000003; } } else { for (int i = 0; i <= w; i++) { sum += dst[i]; ans = (ans + (long long)sum * src[w - i]) % 1000003; } } cout << ans % 1000003 << endl; return 0; }
#include <bits/stdc++.h> const int N = 1e6 + 10; const int mod = 1e9 + 7; const int INF = 0x3f3f3f3f; using namespace std; long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } int n, m; long long f[N]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); f[1] = 2, f[2] = 4; cin >> n >> m; for (int i = 3; i <= max(n, m); ++i) f[i] = f[i - 1] % mod + f[i - 2] % mod; cout << (f[n] + f[m] - 2) % mod << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 200010; const int px[] = {0, 0, 1, -1}, py[] = {1, -1, 0, 0}; int n, m, a[1010][1010], tx[N], ty[N], f[N], ch[N][2], rev[N], tr[N * 4], cnt[N * 4], tag[N * 4]; long long ans; bool isroot(int x) { return !x || !f[x] || (ch[f[x]][0] != x && ch[f[x]][1] != x); } int which(int x) { return ch[f[x]][1] == x; } void rotate(int x) { int fx = f[x], ffx = f[fx], d = which(x); if (!isroot(fx)) ch[ffx][which(fx)] = x; f[x] = f[fx]; ch[fx][d] = ch[x][d ^ 1]; f[ch[x][d ^ 1]] = fx; ch[x][d ^ 1] = fx; f[fx] = x; return; } void rever(int x) { rev[x] ^= 1; swap(ch[x][0], ch[x][1]); return; } void pushdown(int x) { if (rev[x]) { if (ch[x][0]) rever(ch[x][0]); if (ch[x][1]) rever(ch[x][1]); rev[x] = 0; } return; } void push(int x) { if (!isroot(x)) push(f[x]); pushdown(x); return; } void splay(int x) { push(x); while (!isroot(x)) { int fx = f[x]; if (!isroot(fx)) { if (which(x) == which(fx)) rotate(fx); else rotate(x); } rotate(x); } return; } void access(int x) { for (int y = 0; x; y = x, x = f[x]) { splay(x); ch[x][1] = y; } return; } void makeroot(int x) { access(x); splay(x); rever(x); return; } void link(int x, int y) { makeroot(x); f[x] = y; return; } int getroot(int x) { access(x); splay(x); while (ch[x][0]) x = ch[x][0]; return x; } void cut(int x, int y) { makeroot(x); access(y); splay(y); if (!ch[x][1] && ch[y][0] == x) f[x] = ch[y][0] = 0; return; } bool check(int x, int y) { makeroot(x); access(y); splay(y); while (f[x]) x = f[x]; return x == y; } void sgtpushdown(int o) { if (tag[o]) { tr[o << 1] += tag[o]; tr[o << 1 | 1] += tag[o]; tag[o << 1] += tag[o]; tag[o << 1 | 1] += tag[o]; tag[o] = 0; } return; } void pushup(int o) { if (tr[o << 1] == tr[o << 1 | 1]) { tr[o] = tr[o << 1]; cnt[o] = cnt[o << 1] + cnt[o << 1 | 1]; } else if (tr[o << 1] < tr[o << 1 | 1]) { tr[o] = tr[o << 1]; cnt[o] = cnt[o << 1]; } else { tr[o] = tr[o << 1 | 1]; cnt[o] = cnt[o << 1 | 1]; } return; } void build(int o, int l, int r) { tr[o] = 0; cnt[o] = r - l + 1; if (l == r) return; int mid = (l + r) >> 1; build(o << 1, l, mid); build(o << 1 | 1, mid + 1, r); return; } void update(int o, int l, int r, int L, int R, int v) { if (L <= l && r <= R) { tag[o] += v; tr[o] += v; return; } sgtpushdown(o); int mid = (l + r) >> 1; if (L <= mid) update(o << 1, l, mid, L, R, v); if (R > mid) update(o << 1 | 1, mid + 1, r, L, R, v); pushup(o); return; } int query(int o, int l, int r, int L, int R) { if (tr[o] > 1) return 0; if (L <= l && r <= R) return tr[o] * cnt[o]; sgtpushdown(o); int mid = (l + r) >> 1, ret = 0; if (L <= mid) ret += query(o << 1, l, mid, L, R); if (R > mid) ret += query(o << 1 | 1, mid + 1, r, L, R); return ret; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { scanf( %d , a[i] + j); tx[a[i][j]] = i; ty[a[i][j]] = j; } int M = n * m; build(1, 1, M); for (int l = n * m, r = l; l >= 1; l--) { int x = tx[l], y = ty[l]; for (int i = 0; i <= 3; i++) { int nx = x + px[i], ny = y + py[i]; if (nx <= n && nx >= 1 && ny <= m && ny >= 1) { while (a[nx][ny] >= l && a[nx][ny] <= r && check(a[x][y], a[nx][ny])) { for (int j = 0; j <= 3; j++) { int mx = tx[r] + px[j], my = ty[r] + py[j]; if (mx <= n && mx >= 1 && my <= m && my >= 1) cut(a[tx[r]][ty[r]], a[mx][my]); } r--; } if (a[nx][ny] >= l && a[nx][ny] <= r) { link(a[x][y], a[nx][ny]); update(1, 1, M, a[nx][ny], r, -1); } } } update(1, 1, M, l, r, 1); ans += query(1, 1, M, l, r); } printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; struct lhy { int x, y, l, r, id; } b[400040]; int n, m, mN, ans; int cnt[400040], a[400040], Ans[400040], c[2 * 400040], C[2 * 400040], L[400040], R[400040], x[2 * 400040]; inline void add(int x, int o) { for (; x <= mN; x += x & -x) c[x] = max(c[x], o); } inline int ask(int x) { int nowans = 0; for (; x; x -= x & -x) nowans = max(nowans, c[x]); return nowans; } inline void Add(int x, int o) { for (; x; x -= x & -x) C[x] = max(C[x], o); } inline int Ask(int x) { int nowans = 0; for (; x <= mN; x += x & -x) nowans = max(nowans, C[x]); return nowans; } inline int cmp(const lhy &a, const lhy &b) { return a.x < b.x; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %d , &a[i]), x[++x[0]] = a[i]; for (int i = 1; i <= m; i++) scanf( %d%d , &b[i].x, &b[i].y), b[i].id = i, x[++x[0]] = b[i].y; sort(x + 1, x + 1 + x[0]); mN = unique(x + 1, x + 1 + x[0]) - x - 1; for (int i = 1; i <= n; i++) a[i] = lower_bound(x + 1, x + 1 + mN, a[i]) - x; for (int i = 1; i <= m; i++) b[i].y = lower_bound(x + 1, x + 1 + mN, b[i].y) - x; sort(b + 1, b + 1 + m, cmp); int now = 1; for (int i = 1; i <= n; i++) { L[i] = ask(a[i] - 1); while (b[now].x == i) { b[now].l = ask(b[now].y - 1); now++; } add(a[i], L[i] + 1); } now = m; for (int i = n; i; i--) { R[i] = Ask(a[i] + 1); while (b[now].x == i) { b[now].r = Ask(b[now].y + 1); now--; } Add(a[i], R[i] + 1); } for (int i = 1; i <= n; i++) ans = max(ans, L[i] + R[i] + 1); for (int i = 1; i <= n; i++) if (L[i] + R[i] + 1 == ans) cnt[L[i]]++; for (int i = 1; i <= m; i++) if (L[b[i].x] + R[b[i].x] + 1 < ans || cnt[L[b[i].x]] > 1) Ans[b[i].id] = max(ans, b[i].l + b[i].r + 1); else Ans[b[i].id] = max(ans - 1, b[i].l + b[i].r + 1); for (int i = 1; i <= m; i++) printf( %d n , Ans[i]); }
#include <bits/stdc++.h> using namespace std; long long n, a[100069], dv; int main() { long long i, j, z = 1; scanf( %lld%lld , &n, &dv); if (n > dv) { printf( 0 n ); return 0; } for (i = 1; i <= n; i++) { scanf( %lld , a + i); for (j = 1; j < i; j++) { z = z * abs(a[i] - a[j]) % dv; } } printf( %lld n , z); }
#include <bits/stdc++.h> using namespace std; int f(string s, int i) { if (s[i] == ( ) return 0; if (s[i] == [ ) return 1; if (s[i] == 8 ) return 2; } int main() { int a, b; string s1, s2; cin >> s1 >> s2; a = b = 0; for (int i = 0; i < s1.size(); i += 2) { if ((f(s1, i) == 0 && f(s2, i) == 2) || (f(s1, i) == 1 && f(s2, i) == 0) || (f(s1, i) == 2 && f(s2, i) == 1)) a++; else if (f(s1, i) != f(s2, i)) b++; } if (a == b) cout << TIE ; if (a > b) cout << TEAM 1 WINS ; if (b > a) cout << TEAM 2 WINS ; return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1e9 + 7; const int max_n = 200005; vector<pair<int, int>> g[max_n]; int sz[max_n]; long long dis[max_n]; void dfs(int x) { sz[x] = 1; for (auto p : g[x]) { int u = p.first; if (sz[u]) continue; dis[u] = p.second; dfs(u); sz[x] += sz[u]; } } void solve() { int n; cin >> n; n *= 2; for (int i = 0; i <= n; i++) g[i].clear(); for (int i = 0; i <= n; i++) sz[i] = dis[i] = 0; for (int i = 1; i < n; i++) { int u, v, w; cin >> u >> v >> w; g[u].push_back({v, w}); g[v].push_back({u, w}); } dfs(1); long long ans1 = 0, ans2 = 0; for (int i = 2; i <= n; i++) { if (sz[i] & 1) ans1 += dis[i]; ans2 += min(sz[i], n - sz[i]) * dis[i]; } cout << ans1 << << ans2 << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n, i, tmp_ara1, tmp_ara2; vector<long long> ara1(2000007, -1), ara2(2000007, -1), ans(200007, -1), in_front; cin >> n; for (i = 1; i <= n; i++) { cin >> tmp_ara1 >> tmp_ara2; ara1[tmp_ara1] = tmp_ara2; ara2[tmp_ara2] = tmp_ara1; in_front.push_back(tmp_ara1); } long long key = 0; for (i = 2; i <= n; i += 2) { ans[i] = ara1[key]; key = ara1[key]; } long long first; for (i = 0; i < n; i++) { if (ara2[in_front[i]] == -1) { first = in_front[i]; break; } } key = first; ans[1] = first; for (i = 3; i <= n; i += 2) { ans[i] = ara1[key]; key = ara1[key]; } for (i = 1; i <= n; i++) { cout << ans[i] << ; } return 0; }
#include <bits/stdc++.h> using namespace std; int n, m; char gird[64][64]; set<long long int> set_of_cols; int main(void) { int i, j; scanf( %d%d , &n, &m); for (i = 0; i < n; ++i) scanf( %s , gird[i]); for (i = 0; i < n; ++i) { long long int id = 0; for (j = 0; j < m; ++j) { id <<= 1; id |= ( # == gird[i][j]) ? 1 : 0; } for (auto have : set_of_cols) { if (have != id && ((have & id) != 0)) { puts( No ); return 0; } } set_of_cols.insert(id); } puts( Yes ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string str; cin >> str; int t; cin >> t; int type, pos, l, r; char c; set<int> s[26]; for (int i = 0; i < str.length(); i++) s[str[i] - a ].insert(i + 1); while (t--) { cin >> type; if (type == 1) { cin >> pos >> c; s[str[pos - 1] - a ].erase(pos); s[c - a ].insert(pos); str[pos - 1] = c; } else { cin >> l >> r; int count = 0; for (int i = 0; i < 26; i++) if (s[i].lower_bound(l) != s[i].upper_bound(r)) count++; cout << count << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; bool check(char a) { if (a == a || a == e || a == i || a == o || a == u ) return true; if (a == 1 || a == 3 || a == 5 || a == 7 || a == 9 ) return true; return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; cin >> s; int ans = 0; for (int i = 0; i < s.length(); i++) if (check(s[i])) ans++; cout << ans; }
#include <bits/stdc++.h> using namespace std; int main() { int t; string s; getline(cin, s); long long n = s.size(), i; for (i = n - 1; i >= 0; i--) { if (isupper(s[i])) { s[i] = tolower(s[i]); } if (s[i] == ? || s[i] == ) { continue; } else if (s[i] == a || s[i] == e || s[i] == i || s[i] == o || s[i] == u || s[i] == y ) { cout << YES << endl; break; } else { cout << NO << endl; break; } } }
#include <bits/stdc++.h> long long inp() { char c = getchar(); int neg = 1; while (c < 0 || c > 9 ) { if (c == - ) neg = -1; c = getchar(); } long long sum = 0; while (c >= 0 && c <= 9 ) { sum = sum * 10 + c - 0 ; c = getchar(); } return sum * neg; } long long v[300010], mask[300010]; int main() { int n = inp(); long long sum = 0; for (int i = 1; i <= n; i++) { v[i] = inp(); sum += v[i]; mask[i] = inp(); } if (sum < 0) for (int i = 1; i <= n; i++) v[i] *= -1; long long s = 0; for (int i = 0; i <= 61; i++) { long long sum = 0; for (int j = 1; j <= n; j++) { if (mask[j] & (1ll << i)) { if (mask[j] <= (1ll << (i + 1))) { if (__builtin_popcountll(s & mask[j]) & 1) sum += v[j]; else sum -= v[j]; } } } if (sum < 0) s |= (1ll << i); } std::cout << s << std::endl; }
#include <bits/stdc++.h> using namespace std; pair<int, int> s[100010]; int a[100010], b[100010]; int main() { int N, P, i, x; scanf( %d n , &N); for (i = 0; i < N; i++) { scanf( %d , &x); s[i] = make_pair(x, i); } sort(s, s + N); P = N / 3; for (i = 0; i < P; i++) { a[s[i].second] = s[i].first; b[s[i].second] = 0; } P = (2 * N) / 3; for (; i < P; i++) { a[s[i].second] = 0; b[s[i].second] = s[i].first; } for (; i < N; i++) { a[s[i].second] = s[i].first - (N - i - 1); b[s[i].second] = N - i - 1; } printf( YES n ); for (i = 0; i < N; i++) printf( %d , a[i]); printf( n ); for (i = 0; i < N; i++) printf( %d , b[i]); printf( n ); return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, t[100010], nowt, pos, ans[100010]; pair<int, int> a[100010]; int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %d%d , &t[i], &a[i].first); a[i].second = i; } for (int i = 1, j; i <= n; i = j + 1) { j = min(n, i + m - 1); sort(a + i, a + j + 1); nowt = max(nowt, t[j]); pos = 0; for (int k = i, l; k <= j; k = l) { l = k; while (l <= j && a[l].first == a[k].first) ++l; nowt += a[k].first - pos; for (int h = k; h < l; ++h) ans[a[h].second] = nowt; nowt += 1 + (l - k) / 2; pos = a[k].first; } nowt += pos; } for (int i = 1; i <= n; ++i) printf( %d , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; long long fastPow(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret *= a; a *= a; b >>= 1; } return ret; } int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); long long n, e, o, ce, co, ret = INT_MIN, c; cin >> n; vector<long long> nums(n + 1); for (int i = int(1); i < int(n + 1); i++) cin >> nums[i]; e = 0, o = 0, ce = 0, co = 0, c = 0; for (int l = int(1); l < int(n); l++) { if (!(l % 2)) { e = abs(nums[l] - nums[l + 1]); ce = max(ce + e, c); o = e * -1; co = max(co + o, c); } else { e = abs(nums[l] - nums[l + 1]) * -1; ce = max(ce + e, c); o = e * -1; co = max(co + o, c); } ret = max(ret, max(ce, co)); } cout << ret << endl; return 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; } void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)) .count(); std::cerr << res / (1.0e9) << s n ; } template <class T> using V = std::vector<T>; template <class T> using VV = V<V<T>>; 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<ll, ll>; using PAIRLL = std::pair<ll, ll>; constexpr ll INFINT = (1 << 30) - 1; constexpr ll 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 ll 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); } class ModInt { static constexpr std::int_fast64_t M = MOD; using value_type = std::int_fast64_t; public: value_type x; ModInt() : x(0) {} ModInt(value_type n) : x(n % M) { if (x < 0) x += M; } const std::int_fast64_t& operator()() const { return x; } ModInt operator+() const { return *this; } ModInt operator-() const { return ModInt(-x); } ModInt& operator++() { return *this += 1; } ModInt& operator++(signed tmp) { return *this += 1; } ModInt& operator--() { return *this -= 1; } ModInt& operator--(signed tmp) { return *this -= 1; } ModInt& operator=(const ModInt& r) { x = r.x; return *this; } ModInt& operator=(const value_type& r) { return *this = ModInt(r); } ModInt& operator+=(const ModInt& r) { x += r.x; if (x >= M) x -= M; return *this; } ModInt& operator-=(const ModInt& r) { x -= r.x; if (x < +0) x += M; return *this; } ModInt& operator*=(const ModInt& r) { x = x * r.x % M; return *this; } ModInt& operator/=(ModInt r) { return *this *= r ^= M - 2; } ModInt& operator^=(value_type p) { p %= M - 1; if (p < 0) p += M - 1; ModInt res(1); while (p) { if (p & 1) res *= *this; *this *= *this; p >>= 1; } return *this = res; } ModInt& operator+=(const value_type& r) { return *this += ModInt(r); } ModInt& operator-=(const value_type& r) { return *this -= ModInt(r); } ModInt& operator*=(const value_type& r) { return *this *= ModInt(r); } ModInt& operator/=(const value_type& r) { return *this /= ModInt(r); } ModInt operator+(const ModInt& r) const { return ModInt(*this) += r; } ModInt operator-(const ModInt& r) const { return ModInt(*this) -= r; } ModInt operator*(const ModInt& r) const { return ModInt(*this) *= r; } ModInt operator/(const ModInt& r) const { return ModInt(*this) /= r; } ModInt operator+(const value_type& r) const { return ModInt(*this) += r; } ModInt operator-(const value_type& r) const { return ModInt(*this) -= r; } ModInt operator*(const value_type& r) const { return ModInt(*this) *= r; } ModInt operator/(const value_type& r) const { return ModInt(*this) /= r; } ModInt operator^(const value_type& r) const { return ModInt(*this) ^= r; } }; std::ostream& operator<<(std::ostream& os, const ModInt& obj) { return os << obj.x; } std::istream& operator>>(std::istream& is, ModInt& obj) { std::int_fast64_t x; is >> x; obj = ModInt(x); return is; } struct S { ModInt w, s0, s1; bool operator<(const S& r) const { return std::tie(w(), s0(), s1()) < std::tie(r.w(), r.s0(), r.s1()); } }; std::map<S, ModInt> dp[2]; signed main() { std::ios::sync_with_stdio(false); std::cin.tie(0); ; ll n, m; MACRO_VAR_Scan(n, m); ; std::vector<ll> a(n); for (auto& i : a) std::cin >> i; ; std::vector<ModInt> w(n); for (auto& i : w) std::cin >> i; ; ModInt bsum0 = 0, bsum1 = 0; for (ll i = 0; i < ll(n); ++i) { if (a[i]) bsum1 += w[i]; else bsum0 += w[i]; } for (ll i = 0; i < ll(n); ++i) { dp[0].clear(); dp[1].clear(); dp[1][S{w[i], bsum0, bsum1}] = 1; for (ll _ = 0; _ < ll(m); ++_) { std::swap(dp[0], dp[1]); for (const auto& p : dp[0]) { const auto& s = p.first; const auto& v = p.second; auto sum = s.s0 + s.s1; if (a[i]) { dp[1][S{s.w + 1, s.s0 - 0, s.s1 + 1}] += v * s.w / sum; dp[1][S{s.w + 0, s.s0 - 0, s.s1 + 1}] += v * (s.s1 - s.w) / sum; dp[1][S{s.w + 0, s.s0 - 1, s.s1 + 0}] += v * s.s0 / sum; } else { dp[1][S{s.w - 1, s.s0 - 1, s.s1 + 0}] += v * s.w / sum; dp[1][S{s.w + 0, s.s0 - 1, s.s1 + 0}] += v * (s.s0 - s.w) / sum; dp[1][S{s.w + 0, s.s0 - 0, s.s1 + 1}] += v * s.s1 / sum; } } dp[0].clear(); } ModInt ans = 0; for (const auto& p : dp[1]) ans += p.second * p.first.w; std::cout << (ans); std::cout << n ; ; } return 0; }
#include <bits/stdc++.h> int cut; int q[100005] = {0}; int totalnode, totaledge, i, j, k, l, a, b, t1, t2; int c(int q) { if (q == 2) { return cut; } else if (q == cut) { return 2; } else return q; } int main() { for (i = 0; i < 100005; i++) q[i] = i; scanf( %d %d %d , &totalnode, &totaledge, &cut); q[cut] = 2; q[2] = cut; if (totaledge >= totalnode - 1 && (totalnode - 1) * (totalnode - 2) / 2 + 1 >= totaledge) { for (i = 1; i <= totalnode - 1; i++) { printf( %d %d n , q[i], q[i + 1]); totaledge--; } for (i = 2; i <= totalnode && totaledge > 0; i++) { for (j = i + 2; j <= totalnode && totaledge > 0; j++) { printf( %d %d n , q[i], q[j]); totaledge--; } } } else { printf( -1 ); } return 0; }
#include <bits/stdc++.h> using namespace std; struct Date { int y, m, d; }; const int monthDays[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int countLeapYears(Date d) { int years = d.y; if (d.m <= 2) years--; return years / 4 - years / 100 + years / 400; } int getDifference(Date dt1, Date dt2) { long int n1 = dt1.y * 365 + dt1.d; for (int i = 0; i < dt1.m - 1; i++) n1 += monthDays[i]; n1 += countLeapYears(dt1); long int n2 = dt2.y * 365 + dt2.d; for (int i = 0; i < dt2.m - 1; i++) n2 += monthDays[i]; n2 += countLeapYears(dt2); return (n2 - n1); } int main() { int y1, y2, m1, m2, d1, d2; char ch1, ch2, ch3, ch4; int tmp; cin >> y1 >> ch1 >> m1 >> ch2 >> d1; cin >> y2 >> ch3 >> m2 >> ch4 >> d2; if ((y1 > y2) || (y1 == y2 && m1 > m2) || (y1 == y2 && m1 == m2 && d1 > d2)) { tmp = y1; y1 = y2; y2 = tmp; tmp = m1; m1 = m2; m2 = tmp; tmp = d1; d1 = d2; d2 = tmp; } Date dt1 = {y1, m1, d1}; Date dt2 = {y2, m2, d2}; cout << getDifference(dt1, dt2) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 1e16; long long n, a[200005], p[200005], MA = 0, z = 0; int main() { scanf( %lld , &n); memset(p, 0, sizeof(p)); for (int i = 0; i < n; i++) { scanf( %lld , &a[i]); p[a[i]]++; if (p[a[i]] > MA) { MA = p[a[i]]; z = a[i]; } } printf( %lld n , n - MA); for (int i = 0; i < n - 1; i++) { if (a[i] == z) { if (a[i + 1] < a[i]) { printf( 1 %d %d n , i + 2, i + 1); a[i + 1] = z; } else if (a[i + 1] > a[i]) { printf( 2 %d %d n , i + 2, i + 1); a[i + 1] = z; } } } for (int i = n - 1; i >= 1; i--) { if (a[i] == z) { if (a[i - 1] < a[i]) { printf( 1 %d %d n , i, i + 1); a[i - 1] = z; } else if (a[i - 1] > a[i]) { printf( 2 %d %d n , i, i + 1); a[i - 1] = z; } } } return 0; }
#include <bits/stdc++.h> using namespace std; set<pair<pair<long long int, long long int>, long long int> > ev; vector<long long int> cnt, len; multiset<pair<long long int, long long int> > flug; void expand( set<pair<pair<long long int, long long int>, long long int> >::iterator it, long long int a) { pair<pair<long long int, long long int>, long long int> p = *it; p.first.first += a; cnt[p.second]++, len[p.second] += a; auto nt = ev.insert(p).first; ev.erase(it, nt); auto ft = flug.upper_bound(make_pair(p.first.first, 1e18)); if (ft == flug.begin()) return; ft--; if (ft->first >= -p.first.second) { long long int add = ft->second; flug.erase(ft); expand(nt, add); } } int main() { int n, m; scanf( %d%d , &n, &m); vector<pair<pair<long long int, long long int>, long long int> > g(n), f(m); cnt = len = vector<long long int>(n, 0); for (int((i)) = (0); ((i)) < ((n)); ((i))++) { int x, sz; scanf( %d%d , &x, &sz); g[i] = make_pair(make_pair((x), (sz)), (i)); len[i] = sz; } for (int((i)) = (0); ((i)) < ((m)); ((i))++) { int x, sz; scanf( %d%d , &x, &sz); f[i] = make_pair(make_pair((x), (sz)), (i)); } sort((g).begin(), (g).end()); reverse((g).begin(), (g).end()); for (int((i)) = (0); ((i)) < ((n)); ((i))++) { auto it = ev.insert(make_pair(make_pair((g[i].first.first + g[i].first.second), (-g[i].first.first)), (g[i].second))) .first; ev.erase(ev.begin(), it); } for (int((i)) = (0); ((i)) < ((m)); ((i))++) { pair<pair<long long int, long long int>, long long int> fp = make_pair(make_pair((f[i].first.first), (-1e18)), (0)); auto it = ev.lower_bound(fp); if (it != ev.end() && -it->first.second <= f[i].first.first) expand(it, f[i].first.second); else flug.insert({f[i].first.first, f[i].first.second}); } for (int((i)) = (0); ((i)) < ((n)); ((i))++) printf( %I64d %I64d n , cnt[i], len[i]); }
#include <bits/stdc++.h> using namespace std; const long double eps = 1e-9; const long long MOD = 1e9 + 7; const int N = 2e6 + 10; const long double pi = 3.1415926535897932384650288; int n, m; string s, t; bool ok(int i, int j, int d) { if (j == m) return 1; if (i == n) return 0; if (i < 0) return 0; if (s[i] != t[j]) return 0; if (d) { return ok(i - 1, j + 1, d); } return ok(i + 1, j + 1, d) || ok(i - 1, j + 1, 1); } void solve() { cin >> s >> t; n = s.size(); m = t.size(); for (int i = 0; i < n; i++) { if (ok(i, 0, 0)) { puts( Yes ); return; } } puts( No ); } int main() { int t = 1; scanf( %d , &t); while (t--) { solve(); } }
#include <bits/stdc++.h> using namespace std; int readint() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * f; } long long n; long long a[100005], d[100005][10]; char s[100005]; int main() { n = readint(); scanf( %s , s + 1); for (int i = 1; i <= n; i++) a[i] = readint(); memset(d, 0x3f, sizeof(d)); d[0][0] = 0; for (int i = 1; i <= n; i++) { if (s[i] == h ) { for (int j = 0; j <= 4; j++) if (j != 0 && j != 1) d[i][j] = d[i - 1][j]; d[i][1] = min(d[i][1], min(d[i - 1][1], d[i - 1][0])); d[i][0] = min(d[i][0], d[i - 1][0] + a[i]); } else if (s[i] == a ) { for (int j = 0; j <= 4; j++) if (j != 1 && j != 2) d[i][j] = d[i - 1][j]; d[i][2] = min(d[i][2], min(d[i - 1][2], d[i - 1][1])); d[i][1] = min(d[i][1], d[i - 1][1] + a[i]); } else if (s[i] == r ) { for (int j = 0; j <= 4; j++) if (j != 2 && j != 3) d[i][j] = d[i - 1][j]; d[i][3] = min(d[i][3], min(d[i - 1][3], d[i - 1][2])); d[i][2] = min(d[i][2], d[i - 1][2] + a[i]); } else if (s[i] == d ) { for (int j = 0; j <= 4; j++) if (j != 3 && j != 4) d[i][j] = d[i - 1][j]; d[i][4] = min(d[i][4], min(d[i - 1][4], d[i - 1][3])); d[i][3] = min(d[i][3], d[i - 1][3] + a[i]); } else { for (int j = 0; j <= 4; j++) d[i][j] = d[i - 1][j]; } } long long ans = 1ll << 60; for (int i = 0; i < 4; i++) ans = min(ans, d[n][i]); cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T> inline T read() { T x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); } return x * f; } const int N = 100010, INF = 0x3f3f3f3f; int n, q, k, key[N]; struct Edge { int to, nxt; }; struct Graph { int head[N], tot; Edge e[N << 1]; void addedge(int x, int y) { e[++tot] = (Edge){y, head[x]}; head[x] = tot; } }; struct Tree : public Graph { int dfn[N], ti, f[N][19], dep[N]; void dfs(int x, int fa) { dfn[x] = ++ti; f[x][0] = fa; dep[x] = dep[fa] + 1; for (int i = 1; i <= 18; i++) f[x][i] = f[f[x][i - 1]][i - 1]; for (int i = head[x]; i; i = e[i].nxt) { int y = e[i].to; if (y == fa) continue; dfs(y, x); } } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); for (int i = 18; i >= 0; i--) { if (dep[f[x][i]] >= dep[y]) x = f[x][i]; } if (x == y) return x; for (int i = 18; i >= 0; i--) { if (f[x][i] != f[y][i]) x = f[x][i], y = f[y][i]; } return f[x][0]; } } t; struct Virtual_Tree : public Graph { int dp[N][2], d[N], st[N], tp; void build_vtree(Tree& t, int* key, int cnt) { memcpy(d, key, sizeof(int) * (cnt + 1)); sort(d + 1, d + cnt + 1, [&](int x, int y) { return t.dfn[x] < t.dfn[y]; }); head[1] = 0, tot = 0; st[tp = 1] = 1; for (int i = 1; i <= cnt; i++) { if (d[i] == 1) continue; int lc = t.lca(d[i], st[tp]); if (lc != st[tp]) { while (t.dfn[lc] < t.dfn[st[tp - 1]]) { addedge(st[tp - 1], st[tp]); tp--; } if (t.dfn[lc] != t.dfn[st[tp - 1]]) { head[lc] = 0, addedge(lc, st[tp]); st[tp] = lc; } else addedge(lc, st[tp]), tp--; } head[d[i]] = 0, st[++tp] = d[i]; } for (int i = 1; i < tp; i++) addedge(st[i], st[i + 1]); } void dfs_dp(int, int); } vt; int iskey[N]; void Virtual_Tree::dfs_dp(int x, int fa) { dp[x][0] = (!iskey[x]) * n, dp[x][1] = iskey[x] * n; int minx = INF, sum = 1, cnt = 0; for (int i = head[x]; i; i = e[i].nxt) { int y = e[i].to; if (y == fa) continue; cnt += iskey[y]; dfs_dp(y, x); if (iskey[x]) dp[x][0] += min(dp[y][1], dp[y][0] + 1); else { minx = min(minx, dp[y][0] - dp[y][1]); sum += min(dp[y][0], dp[y][1]); dp[x][1] += dp[y][1]; } } if (!iskey[x] && cnt <= 1) dp[x][0] = dp[x][1] + minx; if (!iskey[x]) dp[x][1] = min(dp[x][1], sum); } void solve() { k = read<int>(); for (int i = 1; i <= k; i++) iskey[key[i] = read<int>()] = 1; for (int i = 1; i <= k; i++) { int x = key[i]; if (iskey[t.f[x][0]]) { for (int j = 1; j <= k; j++) iskey[key[j]] = 0; puts( -1 ); return; } } vt.build_vtree(t, key, k); vt.dfs_dp(1, 0); printf( %d n , min(vt.dp[1][0], vt.dp[1][1])); for (int j = 1; j <= k; j++) iskey[key[j]] = 0; } int main() { n = read<int>(); for (int i = 1; i < n; i++) { int x = read<int>(), y = read<int>(); t.addedge(x, y); t.addedge(y, x); } t.dfs(1, 0); q = read<int>(); while (q--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int arr[102]; int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; int myseq[102]; for (int i = 1; i <= n; i++) { if (i & 1) myseq[i] = arr[i + 1]; else myseq[i] = -arr[i - 1]; } for (int i = 1; i <= n; i++) cout << myseq[i] << ; cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 2005; const long long mod = 998244353; string s, t; long long p[maxn], n; long long dp[maxn][maxn]; long long ksm(long long a, long long b) { long long r = 1; while (b) { if (b & 1) r = (r * a) % mod; a = a * a % mod; b >>= 1; } return r; } long long dfs(int l, int r) { if (dp[l][r] != -1) return dp[l][r]; if (l >= r || l > n || r <= 0) return dp[l][r] = 0; long long ans = 0; if (s[l] != ( ) ans = (ans + dfs(l + 1, r)) % mod; if (s[r] != ) ) ans = (ans + dfs(l, r - 1)) % mod; if (s[l] != ( && s[r] != ) ) ans = (ans - dfs(l + 1, r - 1) + mod) % mod; if (s[l] != ) && s[r] != ( ) ans = (ans + dfs(l + 1, r - 1) + ksm(2, p[r - 1] - p[l])) % mod; return dp[l][r] = ans; } int main() { s += # ; cin >> t; s += t; n = t.size(); memset(dp, -1, sizeof(dp)); for (int i = 1; i <= n; i++) p[i] = p[i - 1] + (s[i] == ? ); dfs(1, n); cout << dp[1][n] << endl; }
#include <bits/stdc++.h> const char en = n ; using namespace std; int main() { ios::sync_with_stdio(false); int n; cin >> n; vector<long long> V(n + 47, 0); long long ma2 = 0; long long ma3 = 0; vector<long long> X; for (int i = 0; i < n; i++) { cin >> V[i]; long long p2 = 0, p3 = 0; long long k = V[i]; while (k % 2 == 0) { p2++; k /= 2; } while (k % 3 == 0) { p3++; k /= 3; } X.push_back(k); } sort(X.begin(), X.end()); if (X[0] == X[n - 1]) cout << Yes << en; else cout << No << en; }
#include <bits/stdc++.h> using namespace std; const int oo = 1000000000; const double H = sqrt(3.0) * 0.5; const double eps = 1e-6; int main() { double r; scanf( %lf , &r); int i; long long ans = 0; for (i = 0; i <= r; i++) { double x = 1.5 * i + 1.0; if (x > r) break; double y = sqrt(r * r - x * x); int k; if (i % 2) k = (floor(y / H + eps) + 1) / 2; else k = floor(y / H + eps) / 2 + 1; x = 1.5 * i + 0.5; y = sqrt(r * r - x * x); if (i % 2) k = 2 * min(k, (int)floor(y / H + eps) / 2); else k = 2 * min(k, ((int)floor(y / H + eps) + 1) / 2) - 1; ans += i ? 2 * k : k; } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; void solve() { string s; cin >> s; unordered_map<char, vector<long long int> > um; long long int i; for (i = 0; i < s.length(); i++) { um[s[i]].push_back(i); } long long int last = -1; bool flag; string ans = ; for (i = 25; i >= 0; i--) { char ch = a + i; auto f = um.find(ch); if (f != um.end()) { for (auto it : um[ch]) { if (it > last) { ans += string(1, s[it]); flag = true; } } if (flag == true) last = um[ch][um[ch].size() - 1]; } flag = false; } cout << ans << endl; } int main() { solve(); return 0; }
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; using ll = long long; const int N = 3e3 + 3; int a[N][N]; pii sum[N]; int main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) cin >> a[i][j]; } vector<int> res; int mn = 1e9; for (int i = 0; i < n - 1; i++) { vector<pii> ve; int sum = 0; for (int j = 0; j < m; j++) { sum += a[j][i] - a[j][n - 1]; ve.push_back({a[j][i] - a[j][n - 1], j}); } sort(ve.begin(), ve.end()); vector<int> cur; for (int i = 0; i < m; i++) { if (sum >= 0) break; sum -= ve[i].first; cur.push_back(ve[i].second); } if (cur.size() < mn) { mn = cur.size(); res = cur; } } cout << res.size() << n ; for (auto x : res) cout << ++x << ; cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1000005; long long A[N], B[N], n, xx, mx; bool check(int n, int m) { int x = n - xx, y = mx - x; if (x < 0 || x >= n || y < 0 || y >= m) return 0; memset(B, 0, sizeof(B)); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) ++B[abs(y - j) + abs(i - x)]; if (!memcmp(A, B, sizeof(A))) { printf( %d %d n%d %d n , n, m, x + 1, y + 1); return 1; } return 0; } int main() { cin >> n; for (int i = 1; i <= n; ++i) { scanf( %lld , &xx); A[xx]++; if (xx > mx) mx = xx; } if (A[0] != 1) { printf( -1 ); return 0; } for (xx = 1; xx <= mx; ++xx) if (A[xx] != xx * 4) { if (A[xx] > xx * 4) { printf( -1 ); return 0; } else break; } for (int i = 1; i * i <= n; ++i) { if (n % i) continue; if (check(i, n / i)) return 0; if (check(n / i, i)) return 0; } printf( -1 n ); return 0; }
#include <bits/stdc++.h> using namespace std; char A[1005][1005]; int P[1000005], MinX[1000005], MinY[1000005], MaxX[1000005], MaxY[1000005], M[1005][1005]; int xr[] = {-1, 1, 0, 0}; int xc[] = {0, 0, -1, 1}; int n, m; void dfs(int x, int y, int i) { if ((x < 0) || (x >= n) || (y < 0) || (y >= m) || (A[x][y] == . ) || (M[x][y])) return; M[x][y] = 1; MinX[i] = min(MinX[i], x); MinY[i] = min(MinY[i], y); MaxX[i] = max(MaxX[i], x); MaxY[i] = max(MaxY[i], y); for (int j = 0; j < 4; ++j) { dfs(x + xr[j], y + xc[j], i); } } bool check_convex_island(int len) { set<int> X, Y; for (int i = 0; i < n; ++i) X.insert(i); for (int i = 0; i < m; ++i) Y.insert(i); int x, i, j, ans = 1; for (x = 0; x < len; ++x) { int minx = MinX[x]; int miny = MinY[x]; int maxx = MaxX[x]; int maxy = MaxY[x]; for (i = minx; i <= maxx; ++i) { if (!X.count(i)) return false; X.erase(i); for (j = miny; A[i][j] == . ; ++j) ; for (; (j <= maxy) && (A[i][j] == # ); ++j) ; for (; (j <= maxy) && (A[i][j] == . ); ++j) ; ans &= (j > maxy); } for (j = miny; j <= maxy; ++j) { if (!Y.count(j)) return false; Y.erase(j); for (i = minx; A[i][j] == . ; ++i) ; for (; (i <= maxx) && (A[i][j] == # ); ++i) ; for (; (i <= maxx) && (A[i][j] == . ); ++i) ; ans &= (i > maxx); } } return ans; } int main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); int i, j, k, x, y, z, a, b; for (i = 0; i <= 1000000; ++i) MinX[i] = MinY[i] = 1000000007; cin >> n >> m; for (i = 0; i < n; ++i) cin >> A[i]; int ans = 1, len = 0; set<int> X, Y; for (i = 0; i < n; ++i) X.insert(i); for (i = 0; i < m; ++i) Y.insert(i); for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) { if (A[i][j] == . ) continue; if (X.find(i) != X.end()) X.erase(i); if (Y.find(j) != Y.end()) Y.erase(j); if (!M[i][j]) dfs(i, j, len++); } } ans &= ((X.size() == 0 && Y.size() == 0) || (X.size() && Y.size())); ans &= check_convex_island(len); if (ans) cout << len << endl; else cout << -1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int _5 = 100005, _6 = 1000006; int n, a[1001], b[1001]; vector<int> v; int main() { scanf( %d , &n); for (int i = 0, b; i < n; ++i) cin >> a[i]; for (int i = n - 1; i >= 0; --i) { if (!b[a[i]]) { b[a[i]] = 1; v.push_back(a[i]); } } cout << v.size() << endl; for (int i = v.size() - 1; i >= 0; --i) { cout << v[i] << ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int oo = numeric_limits<int>::max(); const int n_oo = numeric_limits<int>::min(); const int ALF = 26; struct SuffixAutomaton { int toInt(char c) { return c - a ; } char toChar(int j) { return char(j + a ); } struct Nodo { vector<int> hijos; int r; int l; int sl; Nodo(int L = 0) : hijos(ALF, -1), l(L), sl(0), r(1) {} int& operator[](int idx) { return hijos[idx]; } }; vector<int> orden; vector<long long int> seen; int n, ult; vector<Nodo> t; void extender(char c) { int act = n++; t.push_back(Nodo(t[ult].l + 1)); int p = ult; while (~p && t[p][toInt(c)] == -1) { t[p][toInt(c)] = act; p = t[p].sl; } if (~p) { int q = t[p][toInt(c)]; if (t[q].l == t[p].l + 1) { t[act].sl = q; } else { int clon = n++; t.push_back(t[q]); t[clon].l = t[p].l + 1; t[clon].r = 0; t[q].sl = t[act].sl = clon; while (~p && t[p][toInt(c)] == q) { t[p][toInt(c)] = clon; p = t[p].sl; } } } ult = act; } SuffixAutomaton(string s = ) : n(1), ult(0), t(1) { t[0].sl = -1; for (int i = 0; i < s.size(); i++) extender(s[i]); } void rTopoSort() { int m = t[ult].l; vector<vector<int> > bks(m + 1); for (int i = 0; i < n; i++) bks[t[i].l].push_back(i); for (int i = m; i >= 0; i--) for (int j = 0; j < bks[i].size(); j++) orden.push_back(bks[i][j]); } void cuentaRepeticiones() { rTopoSort(); for (int i = 0; i < n - 1; i++) { int u = orden[i]; int v = t[u].sl; t[v].r += t[u].r; } t[0].r = 1; } long long int dfs(int u) { if (seen[u]) return seen[u]; long long int& ret = seen[u]; ret = t[u].r; for (int i = 0; i < ALF; i++) { if (t[u][i] == -1) continue; ret += dfs(t[u][i]); } return ret; } void cuentaCaminos() { seen = vector<long long int>(n); dfs(0); } string kth(long long int k) { int u = 0; k++; string ans; if (k > seen[0]) return No such line. ; while (true) { k -= t[u].r; if (k <= 0) return ans; for (int i = 0; i < ALF; i++) { if (t[u][i] == -1) continue; if (k > seen[t[u][i]]) k -= seen[t[u][i]]; else { ans.push_back(toChar(i)), u = t[u][i]; break; } } } return ans; } void imprime() { for (int i = 0; i < n; i++) { cout << i << n ; cout << suffix link: << t[i].sl << n ; cout << length: << t[i].l << n ; cout << reps: << t[i].r << n ; for (int j = 0; j < ALF; j++) { if (t[i][j] == -1) continue; cout << toChar(j) << : << t[i][j] << ; } cout << n ; cout << n ; } } }; int main() { ios_base::sync_with_stdio(0); cin.tie(0); string s; cin >> s; SuffixAutomaton SA(s); SA.cuentaRepeticiones(); SA.cuentaCaminos(); int k; cin >> k; cout << SA.kth(k) << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int n; vector<int> x; int ax[3]; int main() { ax[0] = ax[1] = ax[2] = 0; cin >> n; for (int i = 0; i < n; ++i) { string s; cin >> s; int cc = 0; for (int i = 0; i < s.size(); ++i) cc += s[i] - 0 ; x.push_back(cc % 3); ax[cc % 3]++; } int res = ax[0] / 2 + min(ax[1], ax[2]); cout << res; return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; const long long N = 1e5 + 5; vector<long long> vp; long long n; long long a[N]; long long binsearch(long long lo, long long hi, long long check) { long long ans = -1; while (hi >= lo) { long long mid = (lo + hi) / 2; if (a[mid] * check == n) { return mid; } else if (a[mid] * check < n) { lo = mid + 1; } else { hi = mid - 1; } } return ans; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (long long i = 1; i * i <= n; i++) { if (n % i == 0) { vp.push_back(n / i); if (n / i != i) vp.push_back(i); } } sort(vp.begin(), vp.end()); for (long long i = 1; i <= vp.size(); i++) { a[i] = vp[i - 1]; } long long mx = 0; long long mn = 1e18; for (long long i = 0; i < vp.size(); i++) { for (long long j = 0; j < vp.size(); j++) { long long k = binsearch(1, vp.size(), vp[i] * vp[j]); if (k != -1) { k--; if (vp[i] * vp[j] * vp[k] == n) { mn = min(mn, (vp[i] + 1) * (vp[j] + 2) * (vp[k] + 2) - n); mn = min(mn, (vp[i] + 2) * (vp[j] + 2) * (vp[k] + 1) - n); mn = min(mn, (vp[i] + 2) * (vp[j] + 1) * (vp[k] + 2) - n); mx = max(mx, (vp[i] + 1) * (vp[j] + 2) * (vp[k] + 2) - n); mx = max(mx, (vp[i] + 2) * (vp[j] + 2) * (vp[k] + 1) - n); mx = max(mx, (vp[i] + 2) * (vp[j] + 1) * (vp[k] + 2) - n); } } } } cout << mn << << mx << n ; }
#include <bits/stdc++.h> using namespace std; const long long int N = 100005; bool powertwo(long long int n) { return (n and !(n & (n - 1))); } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long int t; cin >> t; while (t--) { long long int n; cin >> n; long long int arr[n]; map<long long int, long long int> mp; for (long long int i = 0; i < n; i++) { cin >> arr[i]; mp[arr[i]]++; } long long int g = 0, s = 0, b = 0; vector<long long int> v; for (auto it = mp.rbegin(); it != mp.rend(); it++) v.push_back(it->second); g = v[0]; long long int i = 1; while (s <= g and i < v.size()) { s += v[i]; i++; } while (b <= g and i < v.size()) { b += v[i]; i++; } while ((g + s + b + v[i]) <= n / 2 and i < v.size()) { b += v[i]; i++; } if ((g + s + b) > n / 2 or s < g or b < g) cout << 0 0 0 n ; else if (g == 0 or s == 0 or b == 0) cout << 0 0 0 n ; else cout << g << << s << << b << n ; } return 0; }
#include <bits/stdc++.h> using namespace std; struct Point { double x, y; int num; Point() {} Point(double _x, double _y, int _num) : x(_x), y(_y), num(_num) {} void read() { scanf( %lf%lf , &x, &y); } double operator*(const Point &a) const { return x * a.y - a.x * y; } Point operator-(const Point &a) const { return Point(x - a.x, y - a.y, num); } bool operator<(const Point &a) const { return y < a.y || y == a.y && x < a.x; } bool operator==(const Point &a) const { return x == a.x && y == a.y; } } a[2000], s; int sum = 0, cnt = 0, n, ans[2000], sz[2000]; int des[4000], nxt[4000], fst[2000]; int c[2000], nxtc[2000], fstc[2000]; bool vis[2000]; void add(int x, int y) { des[++sum] = y, nxt[sum] = fst[x], fst[x] = sum; } void add2(int x, int y) { c[++cnt] = y, nxtc[cnt] = fstc[x], fstc[x] = cnt; } void tree(int x) { vis[x] = 1; sz[x] = 1; for (int i = fst[x]; i; i = nxt[i]) if (!vis[des[i]]) tree(des[i]), add2(x, des[i]), sz[x] += sz[des[i]]; } double cross(Point a, Point b, Point c) { return (a - c) * (b - c); } bool cmp(Point i, Point j) { if (i == s) return 1; if (j == s) return 0; double y = cross(i, j, s); if (y < 0) return 0; return 1; } void solve(vector<Point> b, int fa) { s = b[0]; for (int i = 1; i < b.size(); ++i) if (b[i] < s) s = b[i]; sort(b.begin(), b.end(), cmp); int l = 1; ans[s.num] = fa; for (int i = fstc[fa]; i; i = nxtc[i]) { int k = c[i]; vector<Point> m; for (int j = 1; j <= sz[k]; ++j) m.push_back(b[l]), l++; solve(m, k); } } 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); } memset(vis, 0, sizeof vis); tree(1); vector<Point> b; for (int i = 1; i <= n; ++i) a[i].read(), a[i].num = i, b.push_back(a[i]); solve(b, 1); for (int i = 1; i <= n; ++i) printf( %d , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { double a, b, c, d, e, f; cin >> a >> b; for (int i = 0; i < a; i++) { cin >> c >> d; e = c / d; if (i > 0) f = min(e, f); else if (i == 0) f = e; } printf( %.08f n , f * b); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, p[105][105], ans = 0; cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < 2; j++) { cin >> p[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < 2; j++) { if (p[i][j + 1] - p[i][j] >= 2) ans++; } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const long long LINF = INF * (long long)INF; const int L = 22; int G[L]; int dp[1 << L]; int P[1 << L]; int M[1 << L]; int n; void print(int mask) { for (int i = (0); i < (n); i++) { if (mask & (1 << i)) { cout << 1 ; continue; } cout << 0 ; } cout << endl; } bool isClik(int mask) { for (int i = (0); i < (n); i++) { if ((1 << i) & mask) { mask ^= 1 << i; if ((mask & G[i]) != mask) return false; mask ^= 1 << i; } } return true; } int main() { ios::sync_with_stdio(false); cin.tie(0); int m; cin >> n >> m; for (int i = (0); i < (m); i++) { int a, b; cin >> a >> b; a--; b--; G[a] |= 1 << b; G[b] |= 1 << a; } for (int mask = (0); mask < (1 << n); mask++) { dp[mask] = INF; } for (int mask = (0); mask < (1 << n); mask++) { if (isClik(mask)) { dp[mask] = 0; } } for (int mask = (0); mask < (1 << n); mask++) { for (int k = (0); k < (n); k++) { if (!(mask & (1 << k))) continue; if (dp[mask | G[k]] > dp[mask] + 1) { dp[mask | G[k]] = dp[mask] + 1; P[mask | G[k]] = k; M[mask | G[k]] = mask; } dp[mask | G[k]] = min(dp[mask | G[k]], dp[mask] + 1); } } int ans = dp[(1 << n) - 1]; cout << ans << endl; vector<int> res; int mask = (1 << n) - 1; for (int i = (0); i < (ans); i++) { res.push_back(P[mask]); mask = M[mask]; } reverse(res.begin(), res.end()); for (int i = (0); i < ((int)res.size()); i++) { cout << res[i] + 1 << ; } cout << endl; }
#include <bits/stdc++.h> using namespace std; inline long long rd() { long long x = 0; int ch = getchar(), f = 1; while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); if (ch == - ) { f = -1; ch = getchar(); } while (isdigit(ch)) { x = (x << 1) + (x << 3) + ch - 0 ; ch = getchar(); } return x * f; } inline void rt(long long x) { if (x < 0) putchar( - ), x = -x; if (x >= 10) rt(x / 10), putchar(x % 10 + 0 ); else putchar(x + 0 ); } const int maxn = 5005, S = 100005; int n, m, a[maxn], id[S], dsc[maxn]; short int f[maxn][maxn], g[maxn][maxn], h[maxn][7], ans; void upd(short int &x, short int y) { if (y > x) x = y; } int main() { n = rd(); for (int i = int(1); i <= (int)(n); i++) a[i] = dsc[i] = rd(); sort(dsc + 1, dsc + n + 1); m = unique(dsc + 1, dsc + n + 1) - dsc - 1; for (int i = int(1); i <= (int)(m); i++) id[dsc[i]] = i; for (int i = int(1); i <= (int)(n); i++) { int x = id[a[i]]; for (int j = int(0); j <= (int)(i - 1); j++) { if (x && dsc[x - 1] + 1 == a[i]) upd(f[j][i], g[j][x - 1] + 1); if (x < m && dsc[x + 1] - 1 == a[i]) upd(f[j][i], g[j][x + 1] + 1); upd(f[j][i], h[j][a[i] % 7] + 1); if (j) upd(h[i][a[j] % 7], f[j][i]), upd(g[i][id[a[j]]], f[j][i]); else { for (int k = int(0); k <= (int)(6); k++) upd(h[i][k], f[j][i]); for (int k = int(1); k <= (int)(m); k++) upd(g[i][k], f[j][i]); } upd(g[j][id[a[i]]], f[j][i]), upd(h[j][a[i] % 7], f[j][i]); upd(ans, f[j][i]); } } rt(ans), putchar( n ); }
#include <bits/stdc++.h> using namespace std; char s[300005]; int ans[300005]; int main() { int n, m; while (cin >> n >> m) { int cnt = 0; for (int i = 1; i <= n; i++) cin >> s[i]; for (int i = 1; i < n; i++) if (s[i] == s[i + 1] && s[i] == . ) cnt++; for (int i = 0; i < m; i++) { int x; char y; cin >> x >> y; if (s[x] == . && s[x - 1] == . ) cnt--; if (s[x] == . && s[x + 1] == . ) cnt--; s[x] = y; if (s[x] == . && s[x - 1] == . ) cnt++; if (s[x] == . && s[x + 1] == . ) cnt++; ans[i] = cnt; } for (int i = 0; i < m; i++) cout << ans[i] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int a[1005], b[1005]; int main() { int n; string s, ss; cin >> n >> s >> ss; for (int i = 0; i < n; i++) { a[i] = s[i] - 0 ; b[i] = ss[i] - 0 ; } sort(a, a + n); sort(b, b + n); int sum1 = 0, sum2 = 0; for (int i = 0, j = 0; i < n && j < n;) { while (j < n) { if (a[i] <= b[j]) { i++; j++; sum1++; break; } else { j++; } } } int sum = n - sum1; cout << sum << endl; for (int i = 0, j = 0; i < n && j < n;) { while (j < n) { if (a[i] < b[j]) { i++; j++; sum2++; break; } else { j++; } } } cout << sum2; }
#include<bits/stdc++.h> #define endl n #define bug puts( aaa ); #define Case int t;scanf( %d ,&t);while(t--) #define ios ios::sync_with_stdio(0),cin.tie(0); using namespace std; typedef long long ll; typedef unsigned long long ull; const double eps = 1e-5; const int inf = 0x3f3f3f3f; const int mod = 1e9+7; const int N = 1e6+10; int n,x,mi[N<<2],a[N]; unordered_map<int,int>mp; struct node { int x,y; }e[N]; void pushup(int rt) { mi[rt] = mp[e[mi[rt<<1]].y] > mp[e[mi[rt<<1|1]].y] ? mi[rt<<1|1] : mi[rt<<1]; } void build(int l,int r,int rt) { if(l==r) { mi[rt] = 0; return; } int mid = l+r>>1; build(l,mid,rt<<1); build(mid+1,r,rt<<1|1); pushup(rt); } void update(int pos, int val, int l, int r, int rt) { if(l==r) { mi[rt] = mp[e[val].y] < mp[e[mi[rt]].y] ? val : mi[rt]; return; } int mid = l+r>>1; if(pos <= mid) update(pos,val,l,mid,rt<<1); else update(pos,val,mid+1,r,rt<<1|1); pushup(rt); } int query(int L,int R,int l,int r,int rt) { if(L<=l && r<=R) { return mi[rt]; } int mid = l+r>>1; int lson = 0,rson = 0; if(L <= mid) lson = query(L,R,l,mid,rt<<1); if(R > mid) rson = query(L,R,mid+1,r,rt<<1|1); return mp[e[lson].y] > mp[e[rson].y] ?rson:lson; } void run() { mp.clear(); scanf( %d ,&n); int x,y,range = 0,idx=0; e[0].x = e[0].y = inf; mp[inf] = inf; for (int i=1;i<=n;i++) { scanf( %d %d ,&e[i].x,&e[i].y); a[++idx] = e[i].x; a[++idx] = e[i].y; /** * 如果不交换,只符合hj<hi && wj<wi的情况 * 首先按把w和h大的那个,放在x位置 * 那么我们去找[1,x-1]区间,里面的x肯定满足条件 * 接着在这个区间中去找符合条件的y, */ if(e[i].x > e[i].y) swap(e[i].x,e[i].y); } /** * 离散化 */ sort(a+1,a+idx+1); for (int i=1;i<=idx;i++) { if(mp[a[i]])continue; mp[a[i]] = ++range; } build(1,range,1); for (int i=1;i<=n;i++) { update(mp[e[i].x],i,1,range,1); } for (int i=1;i<=n;i++) { if(mp[e[i].x] == 1) { printf( -1 ); continue; } int res = query(1,mp[e[i].x]-1,1,range,1); if (e[res].y >= e[i].y) { printf( -1 ); } else { printf( %d ,res); } } printf( n ); } int main() { // freopen( input.txt , r ,stdin); // freopen( output.txt , w ,stdout); Case run(); return 0; }
#include <bits/stdc++.h> using namespace std; const int64_t N = 1e5 + 1; int64_t crt_node = 0, maxi = 0; vector<int64_t> previous; vector<vector<int64_t>> adj; void dfs(int64_t node, int64_t pere, int64_t len) { previous[node] = pere; if (len > maxi) { crt_node = node; maxi = len; } for (int64_t i : adj[node]) { if (i != pere) dfs(i, node, len + 1); } } bool ok = true; vector<int64_t> level, path; void hedgehog(int64_t node, int64_t pere) { int64_t k = 0; for (int64_t i : adj[node]) { if (i != pere) { hedgehog(i, node); if (k == 0) k = level[i]; else if (k != level[i]) ok = false; } } if (adj[node].size() == 1) level[node] = 1; else if (adj[node].size() < 3 or (adj[node].size() == 3 and path[path.size() / 2] != node)) ok = false; else level[node] = k + 1; } int32_t main() { ios::sync_with_stdio(false); cin.tie(nullptr); int64_t n, k; cin >> n >> k; if (n == 1) { cout << No ; return 0; } adj.resize(n + 1); for (int64_t i = 1; i < n; ++i) { int64_t u, v; cin >> u >> v; adj[u].emplace_back(v); adj[v].emplace_back(u); } previous.resize(n + 1); dfs(1, 0, 0); int64_t a = crt_node; maxi = 0; fill(previous.begin(), previous.end(), 0ll); dfs(crt_node, 0, 0); int64_t b = crt_node; while (b) { path.emplace_back(b); b = previous[b]; } level.resize(n + 1); hedgehog(path[path.size() / 2], 0); if (level[path[path.size() / 2]] != k + 1) ok = false; cout << (ok ? Yes : No ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MN = 111; int a[MN], n, g[MN][MN], c[MN]; struct Block { int f[MN][MN]; void cal1() { memset(f, 0, sizeof f); for (int from = (1), _b = (100); from <= _b; from++) { for (int to = (from), _b = (100); to <= _b; to++) f[from][to] = 0; memset(g, 0, sizeof g); for (int i = (1), _b = (n); i <= _b; i++) { for (int to = (from), _b = (100); to <= _b; to++) g[i][to] = g[i - 1][to]; if (a[i] >= from) { g[i][a[i]] = max(g[i][a[i]], 1); for (int prev = (from), _b = (a[i]); prev <= _b; prev++) g[i][a[i]] = max(g[i][a[i]], g[i - 1][prev] + 1); } } for (int to = (from), _b = (100); to <= _b; to++) f[from][to] = g[n][to]; } } void print() { for (int from = (1), _b = (4); from <= _b; from++) { for (int to = (1), _b = (4); to <= _b; to++) cout << f[from][to] << ; cout << endl; } cout << ---- << endl; } } f[30], trans; Block operator+(const Block& a, const Block& b) { Block res; memset(res.f, 0, sizeof res.f); for (int from = (1), _b = (100); from <= _b; from++) { for (int to = (1), _b = (100); to <= _b; to++) { res.f[from][to] = a.f[from][to]; for (int mid = (from), _b = (to); mid <= _b; mid++) res.f[from][to] = max(res.f[from][to], a.f[from][mid] + b.f[mid][to]); } } return res; } void RR() { for (int i = (1), _b = (n); i <= _b; i++) c[i] = a[i]; sort(c + 1, c + n + 1); int sc = unique(c + 1, c + n + 1) - c - 1; for (int i = (1), _b = (n); i <= _b; i++) a[i] = lower_bound(c + 1, c + n + 1, a[i]) - c; } int main() { ios ::sync_with_stdio(false); int T; while (cin >> n >> T) { for (int i = (1), _b = (n); i <= _b; i++) cin >> a[i]; RR(); f[0].cal1(); for (int i = (1), _b = (23); i <= _b; i++) f[i] = f[i - 1] + f[i - 1]; bool first = true; for (int bit = 0, _a = (24); bit < _a; bit++) if ((T >> bit) & 1) { if (first) { first = false; trans = f[bit]; } else trans = trans + f[bit]; } int res = 0; for (int from = (1), _b = (100); from <= _b; from++) for (int to = (from), _b = (100); to <= _b; to++) { res = max(res, trans.f[from][to]); if (res == 8) { cout << from << << to << endl; assert(0); } } cout << res << endl; } }
#include <bits/stdc++.h> using namespace std; const int maxn = 300 + 10; const int maxm = maxn * maxn; const int INF = 0x3f3f3f3f; int connect[maxn][maxn], edgecnt[maxn]; int price[maxn], vis[maxn * 2], match[maxn * 2]; int n; bool extend(int u) { vis[u] = true; for (int i = 1; i <= edgecnt[u]; i++) { int v = connect[u][i] + n; if (vis[v] || v == match[u]) continue; vis[v] = true; if (match[v] == 0 || extend(match[v])) { match[u] = v; match[v] = u; return true; } } return false; } void Match() { memset(match, 0, sizeof(match)); for (int i = 1; i <= n; i++) { if (match[i]) continue; memset(vis, 0, sizeof(vis)); extend(i); } for (int i = 1; i <= 2 * n; i++) { } } int S, T; struct Edge { Edge *n, *o; int v, c, w; void init(int _v, int _c, int _w) { v = _v; c = _c; w = _w; } }; Edge *E[maxn * 2], Er[maxn * maxn * 2]; int Es = 0; void addedge(int u, int v, int c, int w) { static Edge *P1, *P2; P1 = &Er[++Es]; P2 = &Er[++Es]; P1->init(v, c, w); P1->n = E[u]; P1->o = P2; E[u] = P1; P2->init(u, 0, -w); P2->n = E[v]; P2->o = P1; E[v] = P2; } int H[maxn * 2]; bool V[maxn * 2]; bool BFS() { static int Q[maxn * 20], bot, u, v; memset(H, INF, sizeof(H)); memset(V, true, sizeof(V)); H[Q[bot = 1] = S] = 0; V[S] = false; for (int top = 1; top <= bot; top++) { u = Q[top]; for (Edge *P = E[u]; P; P = P->n) if (P->c && H[P->v] > H[u] + 1) { H[P->v] = H[u] + 1; if (V[P->v]) { Q[++bot] = P->v; V[P->v] = false; } } V[u] = true; } return H[T] < INF; } int extend(int u, int lefts) { if (u == T) { return lefts; } V[u] = false; int ret = 0, t; for (Edge *P = E[u]; P && ret < lefts; P = P->n) { if (P->c && V[P->v] && H[u] + 1 == H[P->v]) { t = extend(P->v, min(lefts - ret, P->c)); ret += t; P->c -= t; P->o->c += t; } } V[u] = true; if (ret < lefts) H[u] = INF; return ret; } int maxflow() { int ret = 0, cnt = 0; while (BFS()) { ret += extend(S, INF); } return ret; } void build() { memset(E, 0, sizeof(E)); for (int i = 1; i <= n; i++) { if (price[i] >= 0) { addedge(S, i, price[i], 1); } else { addedge(i, T, -price[i], 1); } for (int j = 1; j <= edgecnt[i]; j++) { int t = match[connect[i][j] + n]; addedge(i, t, INF, 1); } } } int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &edgecnt[i]); for (int j = 1; j <= edgecnt[i]; j++) { scanf( %d , &connect[i][j]); } } S = 0; T = 2 * n + 1; int ans = 0; for (int i = 1; i <= n; i++) { scanf( %d , price + i); price[i] *= -1; if (price[i] >= 0) ans += price[i]; } Match(); build(); ans = maxflow() - ans; cout << ans << endl; return 0; }