func_code_string stringlengths 59 71.4k |
|---|
#include <bits/stdc++.h> using namespace std; int main() { long long i, j, k, t, l, r, n, m, p, a, b, c, d, flag; cin >> t; while (t--) { cin >> n; for (i = 0; i < n; i++) { cout << (i + 1) << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return f ? -x : x; } int main() { int n = read(), ans = 0; for (int i = 1; i <= n; ++i) ans += read() * i; printf( %d n , ans); return 0; } |
#include <bits/stdc++.h> using namespace std; long long n, t, i, k, tam; int main() { while (scanf( %I64d , &n) > 0) { t = 0; tam = 0; for (i = 0; i < n; i++) { scanf( %I64d , &k); if (k % 2 != 0) { tam = k; } t += k; } if (t % 2 != 0) { printf( First n ); } else { if ((t - tam) % 2 != 0) printf( First n ); else printf( Second n ); } } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int n, k, sum; while (cin >> n >> k) { for (int i = k; i >= 1; i--) { sum = ((n * k) / (i)) + i; if ((sum / k) * (sum % k) == n) { break; } } cout << sum << endl; } return 0; } |
#include <bits/stdc++.h> #pragma warning(disable : 4996) #pragma comment(linker, /STACK:336777216 ) using namespace std; int IT_MAX = 1 << 17; int MOD = 1000000007; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-10; long long dp[1050][10050]; long long C[10050]; long long cost[10050]; int main() { int N, W, B, X, i, j, k; scanf( %d %d %d %d , &N, &W, &B, &X); for (i = 1; i <= N; i++) scanf( %lld , &C[i]); for (i = 1; i <= N; i++) scanf( %lld , &cost[i]); for (i = 0; i <= N; i++) for (j = 0; j <= 10000; j++) dp[i][j] = -LL_INF; dp[0][0] = W; for (i = 1; i <= N; i++) { for (j = 0; j <= 10000; j++) { long long v = dp[i - 1][j]; if (v < 0) continue; long long mx = C[i]; if (cost[i]) mx = min(mx, v / cost[i]); for (k = 0; k <= mx; k++) dp[i][j + k] = max(dp[i][j + k], dp[i - 1][j] - cost[i] * k); } for (j = 0; j <= 10000; j++) if (dp[i][j] >= 0) dp[i][j] = min(dp[i][j] + X, (long long)B * j + W); } int ans = 0; for (i = 1; i <= 10000; i++) if (dp[N][i] >= 0) ans = max(ans, i); return !printf( %d n , ans); } |
#include <bits/stdc++.h> using namespace std; template <typename flow_t, typename cost_t> struct min_cost_flow { const cost_t COST_INF = numeric_limits<cost_t>::max() / 2; struct edge { int node, rev; flow_t capacity; cost_t cost; edge() {} edge(int _node, int _rev, flow_t _capacity, cost_t _cost) : node(_node), rev(_rev), capacity(_capacity), cost(_cost) {} }; int V = -1, E = 0; vector<vector<edge>> adj; vector<cost_t> dist; vector<int> prev; vector<edge *> prev_edge; bool too_many_bellman_ford_iterations = false; min_cost_flow(int vertices = -1) { if (vertices >= 0) init(vertices); } void init(int vertices) { V = vertices; E = 0; adj.assign(V, {}); dist.resize(V); prev.resize(V); prev_edge.resize(V); too_many_bellman_ford_iterations = false; } void add_directional_edge(int u, int v, flow_t capacity, cost_t cost) { assert(0 <= u && u < V && 0 <= v && v < V); edge uv_edge(v, adj[v].size() + (u == v ? 1 : 0), capacity, cost); edge vu_edge(u, adj[u].size(), 0, -cost); adj[u].push_back(uv_edge); adj[v].push_back(vu_edge); E++; } edge &reverse_edge(const edge &e) { return adj[e.node][e.rev]; } bool bellman_ford(int source, int sink) { for (int i = 0; i < V; i++) { dist[i] = COST_INF; prev[i] = -1; prev_edge[i] = nullptr; } long long work = 0; vector<int> last_seen(V, -1); vector<int> nodes = {source}, next_nodes; dist[source] = 0; for (int iteration = 0; iteration < V; iteration++) { next_nodes.clear(); for (int node : nodes) { for (edge &e : adj[node]) if (e.capacity > 0 && dist[node] + e.cost < dist[e.node]) { dist[e.node] = dist[node] + e.cost; prev[e.node] = node; prev_edge[e.node] = &e; if (last_seen[e.node] != iteration) { last_seen[e.node] = iteration; next_nodes.push_back(e.node); } } work += adj[node].size(); } swap(nodes, next_nodes); } if (work > 1.75 * E * (32 - __builtin_clz(V)) + 100) too_many_bellman_ford_iterations = true; return prev[sink] != -1; } struct dijkstra_state { cost_t dist; int node; dijkstra_state() {} dijkstra_state(cost_t _dist, int _node) : dist(_dist), node(_node) {} bool operator<(const dijkstra_state &other) const { return dist > other.dist; } }; void dijkstra_check(int node, cost_t potential_dist, int previous, edge *previous_edge, priority_queue<dijkstra_state> &pq) { if (potential_dist < dist[node]) { dist[node] = potential_dist; prev[node] = previous; prev_edge[node] = previous_edge; pq.emplace(dist[node], node); } } bool dijkstra(int source, int sink) { dist.assign(V, COST_INF); prev.assign(V, -1); prev_edge.assign(V, nullptr); priority_queue<dijkstra_state> pq; dijkstra_check(source, 0, -1, nullptr, pq); while (!pq.empty()) { dijkstra_state top = pq.top(); pq.pop(); if (top.dist > dist[top.node]) continue; for (edge &e : adj[top.node]) if (e.capacity > 0) dijkstra_check(e.node, top.dist + e.cost, top.node, &e, pq); } return prev[sink] != -1; } void reduce_cost() { for (int i = 0; i < V; i++) for (edge &e : adj[i]) if (dist[i] < COST_INF && dist[e.node] < COST_INF) e.cost += dist[i] - dist[e.node]; } vector<pair<flow_t, cost_t>> options; pair<flow_t, cost_t> solve_min_cost_flow( int source, int sink, flow_t flow_goal = numeric_limits<flow_t>::max()) { assert(V >= 0); flow_t total_flow = 0; cost_t total_cost = 0; while (total_flow < flow_goal && bellman_ford(source, sink)) { if (too_many_bellman_ford_iterations) break; flow_t path_cap = flow_goal - total_flow; cost_t cost_sum = 0; for (int node = sink; prev[node] != -1; node = prev[node]) path_cap = min(path_cap, prev_edge[node]->capacity); for (int node = sink; prev[node] != -1; node = prev[node]) { edge *e = prev_edge[node]; e->capacity -= path_cap; reverse_edge(*e).capacity += path_cap; cost_sum += e->cost; } total_flow += path_cap; total_cost += cost_sum * path_cap; options.emplace_back(total_flow, total_cost); } if (too_many_bellman_ford_iterations) { cost_t reduce_sum = 0; do { reduce_cost(); reduce_sum += dist[sink]; flow_t path_cap = flow_goal - total_flow; for (int node = sink; prev[node] != -1; node = prev[node]) path_cap = min(path_cap, prev_edge[node]->capacity); for (int node = sink; prev[node] != -1; node = prev[node]) { edge *e = prev_edge[node]; assert(e->cost == 0); e->capacity -= path_cap; reverse_edge(*e).capacity += path_cap; } total_flow += path_cap; total_cost += reduce_sum * path_cap; options.emplace_back(total_flow, total_cost); } while (total_flow < flow_goal && dijkstra(source, sink)); } return make_pair(total_flow, total_cost); } }; int main() { int N, M; scanf( %d %d , &N, &M); min_cost_flow<int, long long> graph(N); for (int i = 0; i < M; i++) { int u, v, weight; scanf( %d %d %d , &u, &v, &weight); u--; v--; graph.add_directional_edge(u, v, 1, weight); } graph.solve_min_cost_flow(0, N - 1); int Q; scanf( %d , &Q); for (int q = 0; q < Q; q++) { int x; scanf( %d , &x); double answer = 1e100; for (auto &option : graph.options) answer = min(answer, (double)(option.second + x) / option.first); printf( %.7lg n , answer); } } |
#include <bits/stdc++.h> using namespace std; int row[1010]; int main() { int n, m, k; scanf( %d %d %d , &n, &m, &k); memset(row, 0x3f3f3f3f, sizeof row); long long ans = 0; for (int i = (0); i < (n); ++i) { int r, c; scanf( %d %d , &r, &c); row[r] = min(c, row[r]); } for (int i = 1; i <= m; ++i) ans += ((row[i] == 0x3f3f3f3f) ? 0 : row[i]); cout << min(ans, (long long)k) << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, sol[1000005]; struct ell { int dr, cnt, poz; bool operator<(const ell &A) const { return dr < A.dr; } }; multiset<ell> Q; struct el { int x, y, flag, cnt, poz; bool operator<(const el &A) const { if (x == A.x) { if (y == A.y) return flag > A.flag; return y > A.y; } return x < A.x; } }; el a[1000005], b[1000005]; int main() { int i, j, cn; ell w; cin.sync_with_stdio(0); cin >> n; cn = n; for (i = 1; i <= n; ++i) { cin >> a[i].x >> a[i].y; a[i].poz = i; b[i] = a[i]; } cin >> m; for (i = 1; i <= m; ++i) { cin >> a[n + i].x >> a[n + i].y >> a[n + i].cnt; a[n + i].flag = 1; a[n + i].poz = i; b[n + i] = a[n + i]; } n += m; sort(a + 1, a + n + 1); for (i = 1; i <= n; ++i) { if (a[i].flag) { w.dr = a[i].y; w.cnt = a[i].cnt; w.poz = a[i].poz; Q.insert(w); } else { ell w; w.dr = a[i].y; multiset<ell>::iterator it = Q.lower_bound(w); if (it == Q.end()) { printf( NO n ); return 0; } sol[a[i].poz] = it->poz; --b[it->poz + cn].cnt; if (!b[it->poz + cn].cnt) Q.erase(it); } } cout << YES n ; for (i = 1; i <= n - m; ++i) cout << sol[i] << ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e9 + 1; int a[201][201]; int cnt[10][10]; int calc(int x, int y) { if (x * 2 > y) return 500; else if (x * 4 > y) return 1000; else if (x * 8 > y) return 1500; else if (x * 16 > y) return 2000; else if (x * 32 > y) return 2500; else return 3000; } int use[10]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { for (int j = 0; j < 5; j++) { cin >> a[i][j]; } } for (int k = 0; k < 5; k++) { if (a[0][k] == -1) use[k] = 0; else if (a[1][k] == -1 || (a[1][k] != -1 && a[1][k] > a[0][k])) use[k] = -1; else use[k] = 1; } for (int t = 0; t < 50000; t++) { int sc1 = 0, sc0 = 0; for (int i = 0; i < 5; i++) { long long x = 0, y = 0; for (int j = 0; j < n; j++) { if (a[j][i] != -1) x++; } if (use[i] == 1) x += t; y = n + t; if (a[0][i] != -1) { sc0 += calc(x, y) * (250 - a[0][i]); } if (a[1][i] != -1) { sc1 += calc(x, y) * (250 - a[1][i]); } } if (sc0 > sc1) { cout << t << endl; return 0; } } cout << -1 << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; long long int gcd(long long int a, long long int b) { if (b > a) swap(a, b); if (a % b == 0) return b; else return gcd(b, a % b); } long long int a, b, k, k1, k2; int main() { cin >> a >> b; k = (a * b) / gcd(a, b); k1 = k / a; k2 = k / b; if (abs(k1 - k2) == 1) cout << Equal ; else if (k1 > k2) cout << Dasha ; else cout << Masha ; return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } const int MAXH = 1000000; const int MAXW = 1000000; const int MAXN = 100000; const int MOD = 1000000007; typedef struct R { int x1, y1, x2, y2; } R; int h, w, n; int shead[MAXH], snxt[MAXN]; int thead[MAXH], tnxt[MAXN]; R r[MAXN]; int cur[MAXN], ncur; int sval[4 * MAXW]; int slazy[4 * MAXW]; inline void inc(int &a, int b) { if ((a += b) >= MOD) a -= MOD; } void spush(int x) { if (sval[x] != -1) { sval[2 * x + 1] = sval[2 * x + 2] = sval[x]; slazy[2 * x + 1] = slazy[2 * x + 2] = 0; sval[x] = -1; } if (slazy[x] != 0) { inc(slazy[2 * x + 1], slazy[x]), inc(slazy[2 * x + 2], slazy[x]); slazy[x] = 0; } } void sset(int x, int l, int h, int L, int H, int VAL) { if (h < L || l > H) return; if (L <= l && h <= H) { sval[x] = VAL, slazy[x] = 0; return; } spush(x); int m = l + (h - l) / 2; sset(2 * x + 1, l, m, L, H, VAL); sset(2 * x + 2, m + 1, h, L, H, VAL); } void sinc(int x, int l, int h, int L, int H, int BY) { if (h < L || l > H) return; if (L <= l && h <= H) { inc(slazy[x], BY); return; } spush(x); int m = l + (h - l) / 2; sinc(2 * x + 1, l, m, L, H, BY); sinc(2 * x + 2, m + 1, h, L, H, BY); } int sget(int x, int l, int h, int IDX) { if (sval[x] != -1) return sval[x] + slazy[x]; spush(x); int m = l + (h - l) / 2; return IDX <= m ? sget(2 * x + 1, l, m, IDX) : sget(2 * x + 2, m + 1, h, IDX); } void run() { scanf( %d%d%d , &h, &w, &n); for (int x = (0); x < (h); ++x) shead[x] = thead[x] = -1; for (int i = (0); i < (n); ++i) { scanf( %d%d%d%d , &r[i].x1, &r[i].y1, &r[i].x2, &r[i].y2); --r[i].x1, --r[i].y1, --r[i].x2, --r[i].y2; snxt[i] = shead[r[i].x1], shead[r[i].x1] = i; tnxt[i] = thead[r[i].x2], thead[r[i].x2] = i; } multiset<int> have; have.insert(w); sval[0] = slazy[0] = 0; sset(0, 0, w - 1, 0, 0, 1); for (int x = (0); x < (h); ++x) { for (int z = shead[x]; z != -1; z = snxt[z]) sset(0, 0, w - 1, r[z].y1, r[z].y2, 0), have.insert(r[z].y1); ncur = 0; if (x == 0) cur[ncur++] = 0; else for (int z = thead[x - 1]; z != -1; z = tnxt[z]) { if (r[z].y1 != 0) cur[ncur++] = r[z].y1 - 1; multiset<int>::iterator it = have.lower_bound(r[z].y1); have.erase(it); } sort(cur, cur + ncur); ncur = unique(cur, cur + ncur) - cur; for (int i = ncur - 1; i >= 0; --i) { int y = cur[i]; int val = sget(0, 0, w - 1, y); if (val == 0) continue; multiset<int>::iterator it = have.lower_bound(y); int ny = *it - 1; if (y + 1 <= ny) sinc(0, 0, w - 1, y + 1, ny, val); } } int ret = sget(0, 0, w - 1, w - 1); printf( %d n , ret); } int main() { run(); return 0; } |
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <typename T, typename TT> inline ostream &operator<<(ostream &os, const pair<T, TT> &t) { return os << t.first << << t.second; } template <typename T> inline ostream &operator<<(ostream &os, const vector<T> &t) { for (auto i : t) os << i << ; return os; } template <typename T> inline istream &operator>>(istream &is, vector<T> &v) { for (T &t : v) is >> t; return is; } template <typename T1, typename T2> inline istream &operator>>(istream &is, pair<T1, T2> &t) { is >> t.first >> t.second; return is; } const long long mod = 1e9 + 7; void solve() { int n; cin >> n; vector<int> val(3 * n), vis(3 * n + 1); cin >> val; vector<int> loc(3 * n + 1); vector<vector<long long> > v(n, vector<long long>(3)); for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) { cin >> v[i][j]; loc[v[i][j]] = i; } } int k, j = 0; cin >> k; vector<int> ans, up; for (int i = 0; i < loc[k]; i++) { for (auto x : v[i]) vis[x] = 1, up.push_back(x); } while (vis[val[j]]) j++; ; if (k != val[j]) { for (int i = 1; i <= 3 * n; i++) if (i != k) cout << i << ; return; } for (auto x : v[loc[k]]) if (x != k) ans.push_back(x); for (int i = loc[k] + 1; i < n; i++) { for (auto x : v[i]) ans.push_back(x); } sort(ans.begin(), ans.begin() + 2); sort(ans.begin() + 2, ans.end()); sort(up.begin(), up.end()); ; j = 0; for (auto x : ans) { while (j < up.size() and up[j] < x) cout << up[j++] << ; cout << x << ; } cout << vector<long long>(up.begin() + j, up.end()) << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); ; int T = 1; while (T--) { solve(); } return 0; } |
/* Author: ChinmayKarnik Time: 21:14:26 Date: 16-04-2021 */ #include<bits/stdc++.h> using namespace std; //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); typedef enum {BLACK,WHITE,GRAY} color; #define int long long #define TESTCASES true #define FASTIO true const int maxN = 200009; const int inf = (int)1e18 + 1; int N,K; int a[maxN]; int p[64]; void solve() { int i,j,k; vector<int> ans; cin >> N >> K; int one = 1; if(N<64) { if((one<<(N-1))<K) { cout << -1 n ; return; } } while(N>=64) { ans.push_back(1); N--; } while(N) { int curr = 1; int sub = 0; while((curr<=N) && p[N-curr]<K) { K-=p[N-curr]; curr++; } // curr--; N-=curr; ans.push_back(curr); //K-=(curr-1)*(p[]) } int p = 1; vector<int> fin; for(int x:ans) { for(i=p+x-1;i>=p;i--) { fin.push_back(i); } p=p+x; } for(int x:fin) { cout << x << ; } cout << n ; } signed main() { if(FASTIO) { ios_base::sync_with_stdio(false); cin.tie(NULL); } int T = 1; if(TESTCASES) { cin >> T; } int i,j,k; p[0]=1; p[1]=1; for(i=2;i<64;i++) { p[i]=0; for(j=0;j<i;j++) { p[i]+=p[j]; } // cout << p[i] << ; } while(T--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; int main() { vector<int> v; int k, n, fl = 0; cin >> n >> k; v.resize(n); for (int i = 0; i < n; ++i) { cin >> v[i]; if (v[i] == k) fl = 1; } int ct = 0; if (!fl) { v.push_back(k); ct++; ++n; } sort(v.begin(), v.end()); int p, d = 1e9; for (int i = 0; i < v.size(); ++i) { if (k == v[i] && abs((n + 1) / 2 - (i + 1)) < d) { p = i + 1; d = abs((n + 1) / 2 - (i + 1)); } } while (p < (n + 1) / 2) { ++ct; ++p; ++n; } while (p > (n + 1) / 2) { ++ct; ++n; } cout << ct; return 0; } |
#include <bits/stdc++.h> using namespace std; long long bananaz(long long x, long long y) { return (x + 1) * (y + 1) * (x + y) / 2; } int main() { ios_base::sync_with_stdio(false); long long m, b, x = 0, y, max = -1; cin >> m >> b; y = b; while (y >= 0) { if (bananaz(x, y) > max) max = bananaz(x, y); x++; while (y > -1.0 * x / m + b) y--; } cout << max << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { int goal, n, stations; scanf( %i%i%i , &goal, &n, &stations); vector<pair<int, int> > points; points.push_back(make_pair(n, -1)); points.push_back(make_pair(goal, 2000000000)); for (auto e = 0; e < stations; e++) { int a, b; scanf( %i%i , &a, &b); points.push_back(make_pair(a, b)); points.push_back(make_pair(a + n, -b - 1)); } stable_sort(points.begin(), points.end()); multiset<int> sw; auto prev = make_pair(0, 0); sw.insert(0); auto acc = 0LL; for (auto e : points) { if (sw.empty()) { if (e.first != prev.first) { acc = -1; break; } } else { acc += ((long long)e.first - prev.first) * (*sw.begin()); } if (e.first == goal) { break; } if (e.second < 0) { sw.erase(sw.find(-e.second - 1)); } else { sw.insert(e.second); } prev = e; } printf( %I64d n , acc); return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = (int)555; const int mod = (int)1e9 + 7; const int P = (int)1e6 + 7; const double pi = acos(-1.0); int a[maxn][maxn], b[maxn][maxn], n; vector<vector<int> > base{{1, 2, 4}, {5, 3, 8}, {9, 6, 7}}; void rec(int n) { if (n == 3) { for (int i = (0); i <= (n - 1); ++i) for (int j = (0); j <= (n - 1); ++j) a[i][j] = base[i][j]; return; } rec(n - 1); if (!(n & 1)) { int cur = 1; for (int i = (n - 1); i >= (1); --i) b[i][n - 1] = cur++; for (int i = (n - 1); i >= (0); --i) b[0][i] = cur++; for (int i = (1); i <= (n - 1); ++i) for (int j = (0); j <= (n - 2); ++j) b[i][j] = cur + a[i - 1][j] - 1; } else { int cur = 1; for (int i = (0); i <= (n - 1); ++i) b[0][i] = cur++; for (int i = (1); i <= (n - 1); ++i) b[i][n - 1] = cur++; for (int i = (1); i <= (n - 1); ++i) for (int j = (0); j <= (n - 2); ++j) b[i][j] = cur + a[i - 1][j] - 1; } for (int i = (0); i <= (n - 1); ++i) for (int j = (0); j <= (n - 1); ++j) a[i][j] = b[i][j]; } void solve() { scanf( %d , &n); if (n <= 2) { puts( -1 ); return; } rec(n); for (int i = (0); i <= (n - 1); ++i) { for (int j = (0); j <= (n - 1); ++j) printf( %d , a[i][j]); puts( ); } } int main() { int t = 1; while (t--) solve(); } |
#include <bits/stdc++.h> int gcd(int a, int b) { if (a == 0) return b; else return (b % a, a); } using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; int a[n]; long long sum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } sort(a, a + n); long long tot = 0; for (int i = n - 1; i >= 0; i--) { tot += a[i]; if (tot > sum - tot) { cout << n - i << endl; return 0; } } return 0; } |
//#pragma GCC optimize( Ofast ) #include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef unsigned long long ull; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ll myRand(ll B) { return (ull)rng() % B; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int n,k; cin >> n >> k; vector<int> l(n); for(int i=0;i<n;i++){ cin >> l[i]; } sort(l.rbegin(), l.rend()); const int N=5e5; vector<int> a(N); a[0]=1,a[1]=-1; int ans=1e9; int sum=0; for(int i=0,j=0;i<N-1;i++){ sum+=a[i]; a[i+1]+=a[i]; if(sum+a[i+1]>=k){ ans=i+1; break; } while(a[i]>0 and j<n){ int u=(l[j]-1)/2; int v=l[j]-1-u; a[i+2]++; a[i+2+u]--; a[i+2]++; a[i+2+v]--; a[i]--; sum--; j++; } } if(ans==1e9){ ans=-1; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 1e5 + 10; const int INF = 2147483647; const int MOD = 1e9 + 7; int T, n, m; int sum; int a[N]; pair<int, int> b[N]; long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); } long long qpow(long long base, long long x) { long long res = 1; while (x) { if (x & 1) res *= base; base *= base; base %= MOD; res %= MOD; x >>= 1; } return res; } long long qmul(long long a, long long b, long long mod) { long long res = 0; while (b) { if (b & 1) res = (res + a) % mod; a = (a + a) % mod; b >>= 1; } return res; } void exgcd(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return; } exgcd(b, a % b, y, x); y -= (a / b) * x; } long long getinv(long long x, long long mod) { long long x_0, y_0; exgcd(x, mod, x_0, y_0); return x_0; } bool check(int x) { if (sum > x) return false; vector<int> day(n + 1, 0); for (int i = 1; i <= m; i++) { int d = b[i].first, item = b[i].second; if (d <= x) { day[item] = max(day[item], d); } } vector<vector<int>> tmp(200005); for (int i = 1; i <= n; i++) { if (day[i]) { tmp[day[i]].emplace_back(i); } } vector<int> use(n + 1, 0); for (int i = 1; i <= n; i++) use[i] = a[i]; int cur = 0; for (int i = 1; i <= x; i++) { ++cur; if (i > 200000) continue; for (auto &t : tmp[i]) { if (cur >= a[t]) { cur -= a[t]; use[t] = 0; } else { use[t] -= cur; cur = 0; break; } } } int ss = 0; for (int i = 1; i <= n; i++) ss += use[i]; return cur >= ss * 2; } void solve() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i]; for (int i = 1; i <= m; i++) cin >> b[i].first >> b[i].second; int l = 1, r = 1e9; while (l < r) { int mid = (l + r) >> 1; if (check(mid)) r = mid; else l = mid + 1; } cout << l << endl; } int main() { ios::sync_with_stdio(0); cin.tie(nullptr); T = 1; while (T--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10, P = 998244353; const double Pi = acos(-1); inline int read() { int x = 0, f = 1, ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 48, ch = getchar(); return x * f; } inline int Add(int a, int b) { return a + b >= P ? a + b - P : a + b; } inline int Sub(int a, int b) { return a - b < 0 ? a - b + P : a - b; } inline int Mul(int a, int b) { long long res = 1ll * a * b; return res >= P ? res % P : res; } inline int qpow(int a, int b) { int res = 1; while (b) { if (b & 1) res = Mul(res, a); a = Mul(a, a); b >>= 1; } return res; } int n; int dp[3][N]; int cnt, head[N]; struct Edge { int to, nxt; } edge[N << 1]; inline void AddEdge(int u, int v) { edge[++cnt] = (Edge){v, head[u]}; head[u] = cnt; return; } void solve(int u, int fa) { dp[0][u] = dp[2][u] = 1; for (int i = head[u], v; i; i = edge[i].nxt) { v = edge[i].to; if (v == fa) continue; solve(v, u); dp[0][u] = Mul(dp[0][u], Add(dp[0][v], dp[1][v])); dp[1][u] = Add(dp[1][u], Mul(dp[2][v], qpow(Add(dp[0][v], Mul(2, dp[1][v])), P - 2))); dp[2][u] = Mul(dp[2][u], Add(dp[0][v], Mul(2, dp[1][v]))); } dp[1][u] = Mul(dp[1][u], dp[2][u]); } signed main() { n = read(); for (register int i = 2; i <= n; ++i) { int a = read(), b = read(); AddEdge(a, b), AddEdge(b, a); } solve(1, 0); printf( %d n , Add(dp[0][1], dp[1][1])); return 0; } |
#include <bits/stdc++.h> using namespace std; const int N = 1 << 22; bool visit[2][N]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < N; i++) { visit[0][i] = 1; } for (int i = 0; i < m; i++) { int x; cin >> x; visit[0][x] = 0; } int ans = 0; for (int i = 0; i < (1 << n); i++) { if (visit[0][i]) continue; visit[0][i] = 1; ans++; if (!visit[1][i]) { visit[1][i] = 1; queue<int> q; q.push(i); while (q.size()) { int v = q.front(); q.pop(); if (visit[0][(1 << n) - v - 1] == 0) { visit[0][(1 << n) - v - 1] = 1; visit[1][(1 << n) - v - 1] = 1; q.push((1 << n) - v - 1); } for (int j = 0; j < n; j++) { if ((v & (1 << j)) == 0 && !visit[1][v | (1 << j)]) { q.push(v | (1 << j)); visit[1][v | (1 << j)] = 1; } } } } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000LL; const long double EPS = 1e-9; vector<pair<int, int> > clear(vector<pair<int, int> > v) { vector<pair<int, int> > ret; int tox = v[1].first; int x = v[0].first, y = v[0].second; while (x <= tox) { ret.push_back({x, y}); ++x; } int tx = v[1].first, ty = v[1].second; while (ty != y) { ret.push_back({tx, ty}); (ty > y) ? --ty : ++ty; } tox = v[2].first; int toy = v[2].second; int p = v[0].second, q = v[1].second; if (p > q) swap(p, q); if (v[2].second >= p and v[2].second <= q) { while (x <= tox) { ret.push_back({x, toy}); ++x; } } else if (v[2].second < p) { while (x <= tox) { ret.push_back({x, p}); ++x; } while (toy != p) { ret.push_back({tox, toy}); (toy > p) ? --toy : ++toy; } } else { while (x <= tox) { ret.push_back({x, q}); ++x; } while (toy != q) { ret.push_back({tox, toy}); (toy > q) ? --toy : ++toy; } } return ret; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; vector<pair<int, int> > v(3); for (int i = 0; i < 3; ++i) cin >> v[i].first >> v[i].second; sort((v).begin(), (v).end()); auto res = clear(v); sort((res).begin(), (res).end()); res.erase(unique((res).begin(), (res).end()), res.end()); cout << res.size() << n ; for (auto x : res) cout << x.first << << x.second << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; vector<int> ans; char s1[maxn], s2[maxn]; int n; void op(int x) { for (int i = 1; i <= x; ++i) { s1[i] = s1[i] == 0 ? 1 : 0 ; } reverse(s1 + 1, s1 + 1 + x); ans.push_back(x); } int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) { cin >> n; cin >> s1 + 1 >> s2 + 1; ans.clear(); for (int i = n; i >= 1; --i) { if (s1[i] == s2[i]) continue; if (i == 1) op(1); else { if (s1[1] == s2[i]) op(1); op(i); } } cout << ((int)ans.size()); for (auto &v : ans) cout << << v; cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const long long inf = 1e17 + 10; const int N = 1e6 + 10; const long long mod = 998244353; map<string, int> ml; long long b[N], vis[N], po[N], num[N], t, n, m, x, y, k, a[N]; long long ex, ey, cnt, ans, sum, flag; long long dist[N]; long long dp[N]; vector<int> v[N]; map<int, int> mp; priority_queue<pair<int, int> > q; priority_queue<pair<int, int> > tq; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; string s; cin >> s; for (int i = 0; s[i]; i++) { a[i] = cnt; if (s[i] == ( ) cnt++; else cnt--; if (a[i - 1] < 0) a[i] = -1; } cnt = 0; for (int i = n - 1; i >= 0; i--) { b[i] = cnt; if (s[i] == ) ) cnt++; else cnt--; if (b[i + 1] < 0) b[i] = -1; } for (int i = 0; s[i]; i++) { if (a[i] < 0 && b[i] < 0) return cout << 0 << endl, 0; num[i] = a[i] - b[i]; if (s[i] == ( && num[i] == 1 && a[i] >= 0 && b[i] >= 0) ans++; if (s[i] == ) && num[i] == -1 && a[i] >= 0 && b[i] >= 0) ans++; } cout << ans << endl; } |
#include <bits/stdc++.h> using namespace std; const long long MAXN = 2e5 + 7; long long n, k, a, b, q; long long arr[MAXN]; void read() { cin >> n >> k >> a >> b >> q; } long long acnt[MAXN << 2], asum[MAXN << 2], bcnt[MAXN << 2], bsum[MAXN << 2]; long long getacnt(long long v, long long tl, long long tr, long long l, long long r) { if (tr < l || r < tl) return 0; if (l <= tl && tr <= r) return acnt[v]; long long tm = (tl + tr) >> 1; return getacnt(v * 2 + 1, tl, tm, l, r) + getacnt(v * 2 + 2, tm + 1, tr, l, r); } long long getbcnt(long long v, long long tl, long long tr, long long l, long long r) { if (tr < l || r < tl) return 0; if (l <= tl && tr <= r) return bcnt[v]; long long tm = (tl + tr) >> 1; return getbcnt(v * 2 + 1, tl, tm, l, r) + getbcnt(v * 2 + 2, tm + 1, tr, l, r); } long long getasum(long long v, long long tl, long long tr, long long l, long long r) { if (tr < l || r < tl) return 0; if (l <= tl && tr <= r) return asum[v]; long long tm = (tl + tr) >> 1; return getasum(v * 2 + 1, tl, tm, l, r) + getasum(v * 2 + 2, tm + 1, tr, l, r); } long long getbsum(long long v, long long tl, long long tr, long long l, long long r) { if (tr < l || r < tl) return 0; if (l <= tl && tr <= r) return bsum[v]; long long tm = (tl + tr) >> 1; return getbsum(v * 2 + 1, tl, tm, l, r) + getbsum(v * 2 + 2, tm + 1, tr, l, r); } void updacnt(long long v, long long tl, long long tr, long long p, long long x) { if (tl == tr) { acnt[v] = (arr[p] + x >= a); return; } long long tm = (tl + tr) >> 1; if (p <= tm) updacnt(v * 2 + 1, tl, tm, p, x); else updacnt(v * 2 + 2, tm + 1, tr, p, x); acnt[v] = acnt[v * 2 + 1] + acnt[v * 2 + 2]; } void updbcnt(long long v, long long tl, long long tr, long long p, long long x) { if (tl == tr) { bcnt[v] = (arr[p] + x >= b); return; } long long tm = (tl + tr) >> 1; if (p <= tm) updbcnt(v * 2 + 1, tl, tm, p, x); else updbcnt(v * 2 + 2, tm + 1, tr, p, x); bcnt[v] = bcnt[v * 2 + 1] + bcnt[v * 2 + 2]; } void updasum(long long v, long long tl, long long tr, long long p, long long x) { if (tl == tr) { asum[v] = (arr[p] + x) * (arr[p] + x < a); return; } long long tm = (tl + tr) >> 1; if (p <= tm) updasum(v * 2 + 1, tl, tm, p, x); else updasum(v * 2 + 2, tm + 1, tr, p, x); asum[v] = asum[v * 2 + 1] + asum[v * 2 + 2]; } void updbsum(long long v, long long tl, long long tr, long long p, long long x) { if (tl == tr) { bsum[v] = (arr[p] + x) * (arr[p] + x < b); return; } long long tm = (tl + tr) >> 1; if (p <= tm) updbsum(v * 2 + 1, tl, tm, p, x); else updbsum(v * 2 + 2, tm + 1, tr, p, x); bsum[v] = bsum[v * 2 + 1] + bsum[v * 2 + 2]; } void print() { for (long long i = 0; i < q; ++i) { long long t; cin >> t; if (t == 1) { long long p, x; cin >> p >> x; --p; updacnt(0, 0, MAXN, p, x); updbcnt(0, 0, MAXN, p, x); updasum(0, 0, MAXN, p, x); updbsum(0, 0, MAXN, p, x); arr[p] += x; } else { long long p; cin >> p; --p; long long sum1 = getbcnt(0, 0, MAXN, 0, p - 1) * b + getbsum(0, 0, MAXN, 0, p - 1); long long sum2 = getacnt(0, 0, MAXN, p + k, MAXN) * a + getasum(0, 0, MAXN, p + k, MAXN); cout << sum1 + sum2 << n ; } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); read(); print(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n, a[1111], b[1111]; const int inf = 1e9; map<int, int> mp, mp1; int nsd(int x, int y) { while (x > 0 && y > 0) if (x > y) x %= y; else y %= x; return x + y; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; mp[a[1]] = b[1]; for (int i = 2; i <= n; i++) { for (map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) { int heh = it->first; int kok = it->second; if (!mp1[heh] || mp1[heh] > kok) mp1[heh] = kok; int kek = nsd(a[i], heh); if (!mp1[kek] || mp1[kek] > kok + b[i]) mp1[kek] = kok + b[i]; } mp = mp1; mp1.clear(); if (!mp[a[i]] || mp[a[i]] > b[i]) mp[a[i]] = b[i]; } if (mp[1] == 0) cout << -1; else cout << mp[1]; } |
#include <bits/stdc++.h> using namespace std; char s[10], a1[] = { vaporeon }, a2[] = { jolteon }, a3[] = { flareon }, a4[] = { espeon }, a5[] = { umbreon }, a6[] = { leafeon }, a7[] = { glaceon }, a8[] = { sylveon }; int n, i; int main() { cin >> n; cin >> s; if (n == 6) { cout << a4; return 0; } if (n == 8) { cout << a1; return 0; } for (i = 0; i < n; i++) { if (s[i] != . ) if (s[i] != a2[i]) break; } if (i == n) { cout << a2; return 0; } for (i = 0; i < n; i++) { if (s[i] != . ) if (s[i] != a3[i]) break; } if (i == n) { cout << a3; return 0; } for (i = 0; i < n; i++) { if (s[i] != . ) if (s[i] != a5[i]) break; } if (i == n) { cout << a5; return 0; } for (i = 0; i < n; i++) { if (s[i] != . ) if (s[i] != a6[i]) break; } if (i == n) { cout << a6; return 0; } for (i = 0; i < n; i++) { if (s[i] != . ) if (s[i] != a7[i]) break; } if (i == n) { cout << a7; return 0; } for (i = 0; i < n; i++) { if (s[i] != . ) if (s[i] != a8[i]) break; } if (i == n) { cout << a8; return 0; } return 0; } |
#include <bits/stdc++.h> using namespace std; int a[600000]; int main() { int n = 6 * 1e5; a[0] = 0; for (int i = 1; i < n; ++i) { int cur = i; int t = 0; while (cur % 5 == 0) { cur /= 5; t++; } a[i] = a[i - 1] + t; } int m; cin >> m; vector<int> res; for (int i = 1; i < n; ++i) { if (a[i] == m) { res.push_back(i); } } cout << res.size() << endl; for (int i = 0; i < res.size(); ++i) { cout << res[i] << ; } return 0; } |
#include <bits/stdc++.h> using namespace std; int break_point() { char c; while ((c = getchar()) != n ) ; return 0; } template <typename T> void read_integer(T &r) { bool sign = 0; r = 0; char c; while (1) { c = getchar(); if (c == - ) { sign = 1; break; } if (c != && c != n ) { r = c - 0 ; break; } } while (1) { c = getchar(); if (c == || c == n ) break; r = r * 10 + (c - 0 ); } if (sign) r = -r; } long long binpow(long long a, long long b) { long long ret = 1; while (b) { if (b & 1) ret = ret * a; a *= a; b >>= 1; } return ret; } long long binpow(long long a, long long b, int mod) { long long ret = 1; while (b) { if (b & 1) ret = (ret * a) % mod; a = (a * a) % mod; b >>= 1; } return ret; } inline int getbit(int x, int b) { return (x >> b) & 1; } inline int setbit(int x, int b) { return x | (1 << b); } inline void _setbit(int &x, int b) { x = setbit(x, b); } inline long long setbit(long long x, int b) { return x | (1ll << b); } inline void _setbit(long long &x, int b) { x = setbit(x, b); } inline int unsetbit(int x, int b) { return x & (INT_MAX - (1 << b)); } inline void _unsetbit(int &x, int b) { x = unsetbit(x, b); } inline int countbit(int x) { x = x - ((x >> 1) & 0x55555555); x = (x & 0x33333333) + ((x >> 2) & 0x33333333); return ((x + (x >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; } inline long long countbit(long long x) { return countbit(int(x & INT_MAX)) + countbit(int(x >> 31) & INT_MAX); } inline void printbit(int x, int len) { for (int i = len - 1; i >= 0; i--) printf( %d , getbit(x, i)); } int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } template <typename A, typename B> ostream &operator<<(ostream &stream, const pair<A, B> &p) { stream << { << p.first << , << p.second << } ; return stream; } template <typename A> ostream &operator<<(ostream &stream, const vector<A> &v) { stream << [ ; for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << ; stream << ] ; return stream; } template <typename A, typename B> ostream &operator<<(ostream &stream, const map<A, B> &v) { stream << [ ; for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << ; stream << ] ; return stream; } template <typename A> ostream &operator<<(ostream &stream, const set<A> &v) { stream << [ ; for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << ; stream << ] ; return stream; } template <typename A> ostream &operator<<(ostream &stream, const stack<A> &v) { stack<A> st = v; stream << [ ; while (!st.empty()) { stream << st.top() << ; st.pop(); } stream << ] ; return stream; } template <typename A> ostream &operator<<(ostream &stream, const priority_queue<A> &v) { priority_queue<A> q = v; stream << [ ; while (!q.empty()) { stream << q.top() << ; q.pop(); } stream << ] ; return stream; } template <typename A> ostream &operator<<(ostream &stream, const queue<A> &v) { queue<A> q = v; stream << [ ; while (!q.empty()) { stream << q.front() << ; q.pop(); } stream << ] ; return stream; } template <typename A> ostream &operator<<(ostream &stream, const deque<A> &v) { deque<A> q = v; stream << [ ; while (!q.empty()) { stream << q.front() << ; q.pop_front(); } stream << ] ; return stream; } void run(); int main() { srand(time(NULL)); run(); return 0; } const int mod = 1e9 + 7; const int N = 1e5 + 7; struct SegmentTree { vector<long long> tr; int n; SegmentTree(int _n) : n(_n) { tr.resize(n * 4); } long long get(int v, int l, int r, int L, int R) { if (R < L) return 0; if (l == L && r == R) return tr[v]; int mid = (l + r) >> 1; return max(get(v + v, l, mid, L, min(mid, R)), get(v + v + 1, mid + 1, r, max(mid + 1, L), R)); } long long get(int l, int r) { return get(1, 0, n - 1, l, r); } void set(int v, int l, int r, int pos, long long val) { if (l == r) tr[v] = max((tr[v]), (val)); else { int mid = (l + r) >> 1; if (pos <= mid) set(v + v, l, mid, pos, val); else set(v + v + 1, mid + 1, r, pos, val); tr[v] = max(tr[v + v], tr[v + v + 1]); } } void set(int pos, long long val) { set(1, 0, n - 1, pos, val); } }; struct tower { int a, b, h; bool operator<(const tower &other) const { if (b == other.b) return a > other.a; return b > other.b; } }; tower tw[N]; void run() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) scanf( %d%d%d , &tw[i].a, &tw[i].b, &tw[i].h); vector<int> p; for (int i = 0; i < n; ++i) { p.push_back(tw[i].a); p.push_back(tw[i].b); } sort(p.begin(), p.end()); int cnt = unique(p.begin(), p.end()) - p.begin(); for (int i = 0; i < n; ++i) { tw[i].a = upper_bound(p.begin(), p.begin() + cnt, tw[i].a) - p.begin(); tw[i].b = upper_bound(p.begin(), p.begin() + cnt, tw[i].b) - p.begin(); } sort(tw, tw + n); SegmentTree tree(cnt + 5); for (int i = 0; i < n; ++i) { long long H = tree.get(0, tw[i].b - 1) + tw[i].h; tree.set(tw[i].a, H); } printf( %lld , tree.get(0, cnt + 2)); putchar( n ); } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, m, k, t; cin >> n >> m >> k; if (k > n + m - 2) cout << -1 n ; else { if (k < max(n, m)) cout << max(n * (m / (k + 1)), m * (n / (k + 1))) << endl; else cout << max(m / (k - n + 2), n / (k - m + 2)) << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; char cc[10] = RGBYW ; int d[5][5]; int cnt(int x) { int res = 0; while (x) { res += x & 1; x >>= 1; } return res; } int main() { int(n); scanf( %d , &n); for (int i = 0; i < (n); ++i) { char s[10]; scanf( %s , (s)); int x, y; for (int j = 0; j < (5); ++j) { if (s[0] == cc[j]) { x = j; break; } } y = s[1] - 1 ; d[x][y]++; } int an = 10; for (int i = 0; i < (32); ++i) for (int j = 0; j < (32); ++j) { int ha[6][6] = {}; for (int k1 = 0; k1 < (5); ++k1) for (int k2 = 0; k2 < (5); ++k2) { if (d[k1][k2]) { if (((i >> k1) & 1) && ((j >> k2) & 1)) { ha[k1 + 1][k2 + 1]++; } else if (((i >> k1) & 1) && ((j >> k2) & 1) == 0) { ha[k1 + 1][0]++; } else if (((i >> k1) & 1) == 0 && ((j >> k2) & 1)) { ha[0][k2 + 1]++; } else ha[0][0]++; } } bool err = false; for (int k1 = 0; k1 < (6); ++k1) for (int k2 = 0; k2 < (6); ++k2) { if (ha[k1][k2] > 1) err = true; } if (!err) an = min(an, cnt(i) + cnt(j)); } printf( %d n , an); return 0; } |
#include <bits/stdc++.h> using namespace std; static inline void canhazfast() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } template <typename T> T extgcd(T a, T b, T &x, T &y) { T x0 = 1, y0 = 0, x1 = 0, y1 = 1; while (b) { T q = a / b; a %= b; swap(a, b); x0 -= q * x1; swap(x0, x1); y0 -= q * y1; swap(y0, y1); } x = x0; y = y0; return a; } static inline int ctz(unsigned x) { return __builtin_ctz(x); } static inline int ctzll(unsigned long long x) { return __builtin_ctzll(x); } static inline int clz(unsigned x) { return __builtin_clz(x); } static inline int clzll(unsigned long long x) { return __builtin_clzll(x); } static inline int popcnt(unsigned x) { return __builtin_popcount(x); } static inline int popcntll(unsigned long long x) { return __builtin_popcountll(x); } static inline int bsr(unsigned x) { return 31 ^ clz(x); } static inline int bsrll(unsigned long long x) { return 63 ^ clzll(x); } int main() { canhazfast(); int n, m, k; int x2, y2, x3, y3; long long p, r; cin >> n >> m >> k; p = 2LL * n * m; r = p % k; if (r) return cout << NO , 0; p /= k; x2 = n; y3 = (p - 1) / n + 1; x3 = (long long)x2 * y3 - p; y2 = 1; cout << YES n0 0 n << x2 << << y2 << n << x3 << << y3; return 0; } |
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> using namespace std; //using namespace __gnu_pbds; #define rep(i,a,b) for(i=(a);i<=(b);i++) #define ll long long #define pll pair<ll, ll> #define pii pair<int,int> #define pb push_back #define F first #define S second #define mod 1000000007 #define maxn 100005 #define inf 1e18 #define boost ios::sync_with_stdio(false);cin.tie(0) #define fr freopen( source.txt , r ,stdin),freopen( output.txt , w ,stdout) #define SET(a,b) memset(a,b,sizeof(a)) #define deb(x) cout << #x << = << x << endl #define deb2(x, y) cout << #x << = << x << , << #y << = << y << endl #define all(x) x.begin(), x.end() #define ps(x,y) fixed<<setprecision(y)<<x //template<typename T> //using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; template<class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) { return out << ( << a.F << , << a.S << ) ; } template<class A> ostream& operator << (ostream& out, const vector<A> &a) { out << [ ; for (auto it = a.begin(); it != a.end(); ++it) { if (it != a.begin()) out << , ; out << *it; } return out << ] ; } void solve(){ ll n,i,j,x,t,y; cin>>n; string s[n]; for(i=0;i<n;i++) cin>>s[i]; map<ll,ll>mp; for(i=0;i<n;i++){ for(j=0;j<n;j++){ if(s[i][j]!= . ) mp[(i+j)%3]++; } } y=min({mp[0],mp[1],mp[2]}); if(mp[0]==y) x=0; else if(mp[1]==y) x=1; else x=2; for(i=0;i<n;i++){ for(j=0;j<n;j++){ if(s[i][j]!= . &&(i+j)%3==x) s[i][j]= O ; } } for(i=0;i<n;i++) cout<<s[i]<< n ; } int main() { boost; ll n,i,j,x,t,y; cin>>t; while(t--) solve(); } |
#include <bits/stdc++.h> using namespace std; int v[5][5], sum; int main() { for (int i = 1; i <= 3; i++) for (int h = 1; h <= 3; h++) cin >> v[i][h]; if (v[1][1] == 0) { for (int i = 1; i <= 100000; i++) { int a = v[2][1] + v[2][3] - i; if (a + v[1][2] + v[1][3] == v[3][1] + v[3][2] + i) { v[1][1] = a, v[3][3] = i, v[2][2] = v[3][1] + v[3][2] + i - v[2][1] - v[2][3]; break; } } for (int i = 1; i <= 3; i++) { for (int h = 1; h <= 3; h++) cout << v[i][h] << ; cout << n ; } return 0; } for (int i = 1; i <= 100000; i++) { int a = v[2][1] + v[2][3] - i; if (a + v[1][2] + v[1][1] == v[3][2] + v[3][3] + i) { v[1][3] = a, v[3][1] = i, v[2][2] = v[3][2] + v[3][3] + i - v[2][1] - v[2][3]; break; } } for (int i = 1; i <= 3; i++) { for (int h = 1; h <= 3; h++) cout << v[i][h] << ; cout << n ; } } |
#include <bits/stdc++.h> using namespace std; const long long INF = 1e18; int vis[10005]; int main() { int n; scanf( %d , &n); int maxn = -1; for (int i = 1; i <= n; i++) { int tmp; scanf( %d , &tmp); vis[tmp]++; maxn = max(maxn, tmp); } long long ans1 = -1, ans2 = -1; for (int i = 1; i <= maxn; i++) { if (vis[i] != 0) { if (i > ans1) { ans1 = i; } } } for (int i = 1; i <= maxn; i++) { if (vis[i] == 2 || (ans1 % i != 0 && vis[i] == 1)) { if (i > ans2) { ans2 = i; } } } printf( %lld %lld n , ans1, ans2); } |
#include <bits/stdc++.h> using namespace std; int ord[100100]; int inv_ord[100100]; int dep[100100]; int fa[100100][17]; vector<int> g[100100]; set<int> ss; int ts; void dfs(int p, int f) { ord[p] = ++ts; inv_ord[ord[p]] = p; dep[p] = dep[f] + 1; fa[p][0] = f; for (int i = 0; i < 16; i++) fa[p][i + 1] = fa[fa[p][i]][i]; for (int i = 0; i < g[p].size(); i++) if (g[p][i] != f) dfs(g[p][i], p); } inline int bit(int x, int i) { return (x >> i) & 1; } int lca(int a, int b) { if (dep[a] > dep[b]) swap(a, b); for (int i = 0; i < 17; i++) if (bit(dep[a] - dep[b], i)) b = fa[b][i]; if (a == b) return a; for (int i = 16; i >= 0; i--) if (fa[a][i] != fa[b][i]) a = fa[a][i], b = fa[b][i]; return fa[a][0]; } int calc(int p) { if (ss.empty()) return 1; set<int>::iterator it = ss.lower_bound(ord[p]); int a = inv_ord[it == ss.end() ? *ss.begin() : *it]; int b = inv_ord[it == ss.begin() ? *ss.rbegin() : *--it]; return dep[p] - dep[lca(a, p)] - dep[lca(b, p)] + dep[lca(a, b)]; } int main() { int n, k, a, b; while (cin >> n >> k) { for (int i = 1; i < n; i++) { cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } ts = 0; dfs(1, 0); int v = 0; int sol = 1; for (int i = 1, j = 0; i <= n; i++) { while (v <= k) { sol = max(sol, j - i + 1); if (j == n) break; j++; v += calc(j); ss.insert(ord[j]); } ss.erase(ord[i]); v -= calc(i); } cout << sol << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; bool inrange(int y) { return ((y >= 1) && (y <= 9)); } int main() { int r1, r2, c1, c2, d1, d2; bool taken[9] = {false}; cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2; int x = (r1 + r2); int y = (c1 + c2); int z = (d1 + d2); int w; if (x == y && y == z) { if ((r1 + c2 - d1) % 2) { cout << -1 n ; return 0; } y = (r1 + c2 - d1) / 2; if (!inrange(y)) { cout << -1 n ; return 0; } if (taken[y - 1]) { cout << -1 n ; return 0; } else taken[y - 1] = true; x = r1 - y; if (!inrange(x)) { cout << -1 n ; return 0; } if (taken[x - 1]) { cout << -1 n ; return 0; } else { taken[x - 1] = true; } w = d2 - y; if (!inrange(w)) { cout << -1 n ; return 0; } if (taken[w - 1]) { cout << -1 n ; return 0; } else { taken[w - 1] = true; } z = c2 - y; if (!inrange(z)) { cout << -1 n ; return 0; } if (taken[z - 1]) { cout << -1 n ; return 0; } else { taken[z - 1] = true; } cout << x << << y << n ; cout << w << << z << n ; } else cout << -1 n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 7; int n; int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int _; cin >> _; while (_--) { cin >> n; for (int i = 1; i <= n; i++) { cout << i + 1 << ; } cout << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n, m; cin >> n; vector<string> a(n); for (int i = 0; i < n; i++) cin >> a[i]; cin >> m; vector<vector<string>> b(m); bool new_problem = 1; for (int i = 0; i < m; i++) { int k; cin >> k; b[i].resize(k); for (int j = 0; j < k; j++) cin >> b[i][j]; int cnt = 0; for (int j = 0; j < n; j++) { for (int p = 0; p < k; p++) { if (a[j] == b[i][p]) { cnt++; break; } } } new_problem &= cnt != n; } if (new_problem) { cout << Brand new problem! n ; return 0; } vector<int> p(n); iota(p.begin(), p.end(), 0); const int INF = 1e9; pair<int, int> best = {INF, INF}; do { int cost = 0; for (int i = 1; i < n; i++) { for (int j = i - 1; j >= 0; j--) cost += p[i] < p[j]; } int take = -1; for (int i = 0; i < m; i++) { int ptr = 0; for (int j = 0; j < (int)b[i].size(); j++) { if (a[p[ptr]] == b[i][j]) ptr++; if (ptr == n) { break; } } if (ptr == n) { take = i; break; } } if (take != -1) { if (cost < best.first || (cost == best.first && take < best.second)) best = {cost, take}; } } while (next_permutation(p.begin(), p.end())); int x = (n * (n - 1) / 2 - best.first + 1); cout << best.second + 1 << n ; cout << [: ; while (x) { cout << | ; x--; } cout << :] n ; } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e3 + 3; long long n, mod = 1e9 + 7, dp[N][N][2]; long long f(long long idx, long long diff, long long stat) { long long &ret = dp[idx][diff][stat]; if (ret != -1) return ret; if (idx == n) { ret = 0; return ret; } ret = 0; if (stat == 0) { if (n - idx - 1 >= diff + 1) { ret = (f(idx + 1, diff + 1, 0) + (diff > 0 ? f(idx + 1, diff - 1, 0) : 0)) % mod; ret = max(ret, (f(idx + 1, diff + 1, 1) + 1 + (diff > 0 ? f(idx + 1, diff - 1, 0) : 0)) % mod); ret = max(ret, (f(idx + 1, diff + 1, 0) + (diff > 0 ? 1 + f(idx + 1, diff - 1, 1) : 0)) % mod); } else { if (diff > 0) ret = max(f(idx + 1, diff - 1, 0), 1 + f(idx + 1, diff - 1, 1)); else ret = 0; } } else { if (n - idx - 1 >= diff + 1) { ret = (f(idx + 1, diff + 1, 0) + (diff > 0 ? f(idx + 1, diff - 1, 0) : 0)) % mod; } else { if (diff > 0) ret = f(idx + 1, diff - 1, 0); else ret = 0; } } return ret; } int main() { cin >> n; n *= 2; for (long long i = 0; i <= n; i++) for (long long ii = 0; ii <= n; ii++) for (long long iii = 0; iii < 2; iii++) dp[i][ii][iii] = -1; cout << f(0, 0, 0) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const long long inf64 = 1e18; void solve() { int n, m; cin >> n >> m; vector<vector<int>> a(n, vector<int>(m)), b; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[i][j]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int c = 0; if (i > 0) c++; if (j > 0) c++; if (i + 1 < n) c++; if (j + 1 < m) c++; if (a[i][j] > c) { cout << NO n ; return; } a[i][j] = c; } } cout << YES n ; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << a[i][j] << ; } cout << n ; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int tt; cin >> tt; while (tt--) solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int n; int main() { ios_base::sync_with_stdio(false); int n, x[10], y[10], nx[10], ny[10]; cin >> n; for (int i = 0; i < n; i++) cin >> x[i] >> y[i] >> nx[i] >> ny[i]; int mnx = 1000000, mny = 1000000, mxx = 0, mxy = 0; for (int i = 0; i < n; i++) { mnx = min(mnx, x[i]); mny = min(mny, y[i]); mxx = max(mxx, nx[i]); mxy = max(mxy, ny[i]); } long long area = (mxx - mnx) * (mxy - mny); long long realarea = 0; for (int i = 0; i < n; i++) { realarea += (nx[i] - x[i]) * (ny[i] - y[i]); } if (mxx - mnx == mxy - mny && area == realarea) printf( YES ); else printf( NO ); } |
#include <bits/stdc++.h> using namespace std; int A[1000005], B[1000005], cnt[1000005], num[1000005]; long long dp[2][1000005]; int main() { int n, k; long long l, ans = 0; cin >> n >> l >> k; if (l <= n) { cout << l << endl; return 0; } for (int i = 0; i < n; i++) scanf( %d , &A[i]); for (int i = 0; i < n; i++) B[i] = A[i]; sort(B, B + n); int m = 0, a = 0; long long S = l / n; for (int i = 0; i < n; i++) { a++; if (B[i] != B[i + 1] || i == n - 1) { B[m] = B[i]; cnt[m++] = a; a = 0; } } sort(A, A + l % n); for (int i = 0; i < m; i++) { int t = lower_bound(A, A + l % n, B[i]) - A; num[i] = l % n - t; } dp[0][0] = 1; for (int i = 1; i <= min(S, 1LL * k); i++) { int cur = i & 1; long long sum = 0; for (int j = 0; j < n; j++) { sum = (sum + dp[!cur][j]) % 1000000007; dp[cur][j] = (sum * cnt[j]) % 1000000007; ans = (ans + dp[cur][j] * (S % 1000000007 + 1000000007 - i + 1)) % 1000000007; if (i < k) ans = (ans + dp[cur][j] * num[j]) % 1000000007; } } ans = (ans + l % n) % 1000000007; cout << ans << endl; return 0; } |
#include <bits/stdc++.h> int n, q[20]; long long A, B, C, a, b, c, m, m1, ans, v, p[20]; void dfs1(register int s, long long now) { if (now > m) return; if (s > n) { if (now < a) return; b = now; c = v / a / b; if (a * b + a * c + b * c < ans) ans = a * b + a * c + b * c, A = a, B = b, C = c; return; } if (q[s]) q[s]--, dfs1(s, now * p[s]), q[s]++; dfs1(s + 1, now); } void dfs2(register int s, long long now) { if (now > m1) return; if (s > n) { if (a = now, v / a + 2 * a * sqrt(v / a) < ans) m = sqrt(v / a) + 1e-8, dfs1(1, 1); return; } if (q[s]) q[s]--, dfs2(s, now * p[s]), q[s]++; dfs2(s + 1, now); } int main() { for (register int T, x = scanf( %d , &T); T--;) { scanf( %d , &n); for (register int i = v = 1; i <= n; i++) { scanf( %lld%d , &p[i], &q[i]); for (register int j = 1; j <= q[i]; j++) v *= p[i]; } ans = 5e18; A = 0; m1 = pow(v, 1. / 3) + 1e-8; dfs2(1, 1); printf( %lld %lld %lld %lld n , ans * 2, A, B, C); } return 0; } |
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } long long power(long long x, long long p) { if (p == 0) return 1; if (p == 1) return x; if (p % 2) return x * power(x, p - 1); long long y = power(x, p / 2); return y * y; } void solve() { long long n; cin >> n; long long arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } pair<long long, long long> modd, meven; long long odd = 0, even = 0, l = -1, r = -1, res = 0; for (int i = 0; i < n; i++) { if (i % 2) odd += arr[i]; else even += arr[i]; long long cur = odd - even; pair<long long, long long> p; if (i % 2) p = meven; else p = modd; long long val = cur - p.first; if (val > res) { l = p.second; r = i; res = val; } long long x = odd - even + arr[i] * (i % 2 ? -1 : 1); if (i % 2 == 0) { if (x < meven.first) meven = make_pair(x, i); } else { if (x < modd.first) modd = make_pair(x, i); } } if (l != -1) { for (int i = 0; i < (r - l + 1) / 2; i++) { swap(arr[l + i], arr[r - i]); } } odd = 0; even = 0; for (int i = 0; i < n; i++) { if (i % 2) odd += arr[i]; else even += arr[i]; } cout << max(odd, even) << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) solve(); } |
#include <bits/stdc++.h> using namespace std; const int maxn = 5001, M = 1e9 + 7; int n, F, vis[maxn], T = 1, mid, a[maxn], b[maxn], w[maxn][maxn], ans = 1; vector<int> g[maxn]; bool C[maxn]; bool dfs(int v) { vis[v] = T; for (int i = 0; i < g[v].size(); i++) if (vis[g[v][i]] != T) { C[g[v][i]] = !C[v]; if (!dfs(g[v][i])) return false; } else if (C[g[v][i]] == C[v]) return false; return true; } inline bool check(int x) { for (int i = 1; i <= n; i++) g[i].resize(0); for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (w[i][j] > x) g[i].push_back(j), g[j].push_back(i); T++; for (int i = 1; i <= n; i++) if (vis[i] != T) if (!dfs(i)) return false; return true; } inline void bs(int f, int l) { while (f != l) { mid = (f + l) / 2; if (check(mid)) l = mid; else f = mid + 1; } check(f); F = f; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d%d , a + i, b + i); for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) w[i][j] = abs(a[i] - a[j]) + abs(b[i] - b[j]); bs(0, 7500); T++; ans = 1; for (int i = 1; i <= n; i++) if (vis[i] != T) dfs(i), ans = (ans << 1) % M; printf( %d n%d n , F, ans); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> adj[200005]; long long eff[200005]; long long dp[200005][2]; long long dfs(int src, int polarity) { long long &ret = dp[src][polarity]; if (ret != -1) return ret; if (adj[src].size() == 0) return ret = eff[src] * polarity; long long sumE = 0; vector<long long> even(adj[src].size()), diff(adj[src].size()); for (int i = 0; i < adj[src].size(); i++) { even[i] = dfs(adj[src][i], 0); sumE += even[i]; diff[i] = dfs(adj[src][i], 1) - even[i]; } sort(diff.begin(), diff.end()); vector<long long> temp = diff; long long bestEvenFromChildren = sumE, bestOddFromChildren = sumE; while (temp.size() >= 2 && temp.back() + temp[temp.size() - 2] > 0) { bestEvenFromChildren += temp.back(); temp.pop_back(); bestEvenFromChildren += temp.back(); temp.pop_back(); } temp = diff; bestOddFromChildren += temp.back(); temp.pop_back(); while (temp.size() >= 2 && temp.back() + temp[temp.size() - 2] > 0) { bestOddFromChildren += temp.back(); temp.pop_back(); bestOddFromChildren += temp.back(); temp.pop_back(); } if (polarity == 0) return ret = bestEvenFromChildren; else return ret = max(bestEvenFromChildren + eff[src], bestOddFromChildren); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); memset(dp, -1, sizeof dp); int n; cin >> n; for (int i = 1; i <= n; i++) { int p, e; cin >> p >> eff[i]; if (p != -1) adj[p].push_back(i); } cout << max(dfs(1, 0), dfs(1, 1)) << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, i, d[100005], x, y, a, b, c, r; int main() { cin >> n >> m; for (i = 1; i <= m; i++) { cin >> x >> y; d[x]++; d[y]++; } for (i = 1; i <= n; i++) { if (d[i] == 1) a++; if (d[i] == 2) b++; if (d[i] == n - 1) c++; else r++; } if (a == 2 && b == n - 2) { cout << bus topology ; return 0; } if (a == n - 1 && c == 1) { cout << star topology ; return 0; } if (b == n) { cout << ring topology ; return 0; } cout << unknown topology ; return 0; } |
#include <bits/stdc++.h> using namespace std; int mult(int a, int b) { return ((long long)a * b) % 1000000007; } int binaryPow(int n, int p) { int acc = 1; while (p) { if (p & 1) acc = mult(acc, n); n = mult(n, n); p >>= 1; } return acc; } int modularInv(int n) { return binaryPow(n, 1000000007 - 2); } int main() { int k, a, b; cin >> k >> a >> b; int pa = mult(a, modularInv(a + b)); int pb = mult(b, modularInv(a + b)); int modPB = modularInv(pb); int dp[k + 1][k + 1]; for (int i = k; i >= 1; i--) { for (int j = k; j >= 0; j--) { if (i + j < k) { dp[i][j] = (mult(pa, dp[i + 1][j]) + mult(pb, dp[i][i + j])) % 1000000007; } else { dp[i][j] = (i + j + mult(pa, modPB)) % 1000000007; } } } cout << dp[1][0] << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int MOD; struct Modint { int val; Modint(int nval = 0) { val = nval % MOD; } Modint& operator+=(Modint r) { val = (val + r.val) % MOD; return *this; } Modint operator+(Modint r) { return Modint(*this) += r; } Modint& operator-=(Modint r) { val = (val + MOD - r.val) % MOD; return *this; } Modint operator-(Modint r) { return Modint(*this) -= r; } Modint& operator*=(Modint r) { val = 1LL * val * r.val % MOD; return *this; } Modint operator*(Modint r) { return Modint(*this) *= r; } }; int main() { int n, k; cin >> n >> k >> MOD; static Modint dp[1001][100]; static Modint from_end[1001]; from_end[0] = 1; from_end[1] = 9; for (int i = 2; i <= n; i++) { from_end[i] = from_end[i - 1] * 10; } Modint result = 0; for (int i = 1; i < 10; i++) { dp[1][i % k] += 1; } int tpow = 10 % k; for (int i = 1; i < n; i++) { for (int s = 1; s < k; s++) { for (int m = 0; m < 10; m++) { dp[i + 1][(s + tpow * m) % k] += dp[i][s]; } } for (int m = 1; m < 10; m++) { dp[i + 1][tpow * m % k] += 1; } tpow = (tpow * 10) % k; } for (int i = 1; i <= n; i++) { result += dp[i][0] * from_end[n - i]; } cout << result.val << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long powmod(long long a, long long b, long long p) { long long res = 1; a %= p; while (b) { if (b & 1) res = res * a % p; a = a * a % p; b >>= 1; } return res; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } void solve() { int n, m; cin >> n >> m; vector<string> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } string ans = v[0]; for (int j = 0; j < m; j++) { char save = ans[j]; for (char d = a ; d <= z ; d++) { ans[j] = d; bool flag = true; for (int z = 0; z < n; z++) { int cntErrors = 0; for (int c = 0; c < m; c++) { if (v[z][c] != ans[c]) { cntErrors++; } } if (cntErrors > 1) { flag = false; break; } } if (flag) { cout << ans << endl; return; } } ans[j] = save; } cout << -1 << endl; } int main() { int t; cin >> t; while (t--) { solve(); } } |
#include <bits/stdc++.h> using namespace std; const int N = 200020, P = 1000000000; int add(int a, int b) { return a + b >= P ? a + b - P : a + b; } struct mat { int r, c, a[2][2]; void construct(int r_, int c_) { r = r_, c = c_; for (int i = 0; i < r; ++i) for (int j = 0; j < c; ++j) a[i][j] = 0; } mat operator*(const mat& rhs) const { mat res; res.construct(r, rhs.c); for (int i = 0; i < res.r; ++i) for (int j = 0; j < res.c; ++j) for (int k = 0; k < c; ++k) res.a[i][j] = add(res.a[i][j], (long long)a[i][k] * rhs.a[k][j] % P); return res; } } trans_sum[N]; mat qpow(mat t, int k) { mat res = t; --k; for (; k; k >>= 1) { if (k & 1) res = res * t; t = t * t; } return res; } mat trans; struct node { mat v; int sz; int tag; } t[N << 2]; int n, m, a[N], fibo[N], sfibo[N]; node merge(node x, node y) { node res; res.sz = x.sz + y.sz; mat nxt = y.v * trans_sum[x.sz]; res.v.construct(1, 2); res.v.a[0][0] = add(x.v.a[0][0], nxt.a[0][0]); res.v.a[0][1] = add(x.v.a[0][1], nxt.a[0][1]); res.tag = 0; return res; } void build(int p, int l, int r) { t[p].tag = 0; if (l == r) { t[p].v.construct(1, 2); t[p].v.a[0][0] = t[p].v.a[0][1] = a[l]; t[p].sz = 1; return; } int mid = (l + r) >> 1; build(p << 1, l, mid); build(p << 1 | 1, mid + 1, r); t[p] = merge(t[p << 1], t[p << 1 | 1]); } void ontag(int p, int l, int r, int v) { t[p].tag = add(t[p].tag, v); t[p].v.a[0][0] = add(t[p].v.a[0][0], (long long)v * sfibo[r - l] % P); t[p].v.a[0][1] = add(t[p].v.a[0][1], (long long)v * (sfibo[r - l + 1] - 1 + P) % P); } void pushdown(int p, int l, int r) { if (t[p].tag) { int mid = (l + r) >> 1; ontag(p << 1, l, mid, t[p].tag); ontag(p << 1 | 1, mid + 1, r, t[p].tag); t[p].tag = 0; } } void add(int p, int l, int r, int L, int R, int v) { if (L <= l && r <= R) { ontag(p, l, r, v); return; } pushdown(p, l, r); int mid = (l + r) >> 1; if (L <= mid) add(p << 1, l, mid, L, R, v); if (R > mid) add(p << 1 | 1, mid + 1, r, L, R, v); t[p] = merge(t[p << 1], t[p << 1 | 1]); } void change(int p, int l, int r, int v, int x) { if (l == r) { a[l] = x; t[p].v.construct(1, 2); t[p].v.a[0][0] = t[p].v.a[0][1] = a[l]; t[p].sz = 1; return; } pushdown(p, l, r); int mid = (l + r) >> 1; if (v <= mid) change(p << 1, l, mid, v, x); else change(p << 1 | 1, mid + 1, r, v, x); t[p] = merge(t[p << 1], t[p << 1 | 1]); } node qry(int p, int l, int r, int L, int R) { if (L <= l && r <= R) return t[p]; pushdown(p, l, r); int mid = (l + r) >> 1; if (R <= mid) return qry(p << 1, l, mid, L, R); else if (L > mid) return qry(p << 1 | 1, mid + 1, r, L, R); else return merge(qry(p << 1, l, mid, L, R), qry(p << 1 | 1, mid + 1, r, L, R)); } int main() { cout << fixed; trans.construct(2, 2); trans.a[0][1] = trans.a[1][0] = trans.a[1][1] = 1; scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); fibo[0] = fibo[1] = sfibo[0] = 1; sfibo[1] = 2; for (int i = 2; i <= n; ++i) { fibo[i] = add(fibo[i - 1], fibo[i - 2]); sfibo[i] = add(sfibo[i - 1], fibo[i]); } trans_sum[1] = trans; for (int i = 2; i <= n; ++i) trans_sum[i] = trans_sum[i - 1] * trans; build(1, 1, n); while (m--) { int op, x, v, l, r, d; scanf( %d , &op); if (op == 1) { scanf( %d%d , &x, &v); change(1, 1, n, x, v); } else if (op == 2) { scanf( %d%d , &l, &r); node ans = qry(1, 1, n, l, r); printf( %d n , ans.v.a[0][0]); } else if (op == 3) { scanf( %d%d%d , &l, &r, &d); add(1, 1, n, l, r, d); } } return 0; } |
#include <bits/stdc++.h> using std::cin; using std::cout; using std::vector; int main() { long long n; cin >> n; int t = 0; while (n > 0) { if (n % 2 != 0) t++; n = n / 2; } cout << t; int h; cin >> h; return 0; } |
#include <bits/stdc++.h> using namespace std; int dist[65][65][65]; int dp[65][65][65][2]; int n, m, r, td[65][65]; vector<long long> li[1024]; int ans[222222]; void prep() { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) for (int k = 0; k < m; k++) dp[i][j][k][0] = dist[k][i][j]; for (int i = 0; i < int(li[0].size()); i++) { int u = li[0][i], v = li[0][i + 1], ii = li[0][i + 2]; i++; i++; ans[ii] = 2000000000; for (int car = 0; car < m; car++) ans[ii] = min(ans[ii], dp[u][v][car][0]); } int flag = 1; for (int k = 1; k <= n; k++) { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { td[i][j] = dp[i][j][0][1 - flag]; for (int cc = 0; cc < m; cc++) { td[i][j] = min(dp[i][j][cc][1 - flag], td[i][j]); } } for (int car = 0; car < m; car++) { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) { dp[i][j][car][flag] = td[i][j]; for (int p = 0; p < n; p++) dp[i][j][car][flag] = min(dp[i][j][car][flag], td[i][p] + dist[car][p][j]); } } for (int i = 0; i < int(li[k].size()); i++) { int u = li[k][i], v = li[k][i + 1], ii = li[k][i + 2]; i++; i++; ans[ii] = 2000000000; for (int car = 0; car < m; car++) ans[ii] = min(ans[ii], dp[u][v][car][flag]); } flag = 1 - flag; } } int main() { scanf( %d , &n); scanf( %d , &m); scanf( %d , &r); for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) for (int k = 0; k < n; k++) scanf( %d , &dist[i][j][k]); for (int k = 0; k < n; k++) for (int ii = 0; ii < n; ii++) for (int j = 0; j < n; j++) dist[i][ii][j] = min(dist[i][ii][j], dist[i][ii][k] + dist[i][k][j]); } for (int i = 0; i < r; i++) { int u, v, k; scanf( %d , &u); scanf( %d , &v); scanf( %d , &k); u--; v--; k = min(k, n); li[k].push_back(u); li[k].push_back(v); li[k].push_back(i); } prep(); for (int i = 0; i < r; i++) { printf( %d , ans[i]); ; printf( n ); } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; const int maxm = 1e4; struct tree { int x, h, Lp, Rp; } T[maxn + 5]; struct Mushroom { int x, power; } M[maxm + 5]; int n, m, cnt, L, R, posx[5 * maxn + 5]; double arr[20 * maxn + 5], lazy[20 * maxn + 5]; inline void Push_Up(int index) { arr[index] = arr[2 * index] + arr[2 * index + 1]; } inline void Push_Down(int index) { double k = lazy[index]; arr[2 * index] *= k; arr[2 * index + 1] *= k; lazy[2 * index] *= k; lazy[2 * index + 1] *= k; lazy[index] = 1.0; } void Build(int index, int L, int R) { lazy[index] = 1.0; if (L == R) return; int mid = L + R >> 1; Build(2 * index, L, mid); Build(2 * index + 1, mid + 1, R); } void Update_Point(int index, int L, int R, int pos, int value) { if (L == R) { arr[index] += value; return; } int mid = L + R >> 1; if (mid >= pos) Update_Point(2 * index, L, mid, pos, value); else Update_Point(2 * index + 1, mid + 1, R, pos, value); Push_Up(index); } void Update(int index, int L, int R, int UL, int UR, int p) { if (L >= UL && R <= UR) { double k = double(p) / 100; arr[index] *= k; lazy[index] *= k; return; } if (lazy[index] != 1.0) Push_Down(index); int mid = L + R >> 1; if (mid >= UL) Update(2 * index, L, mid, UL, UR, p); if (UR > mid) Update(2 * index + 1, mid + 1, R, UL, UR, p); Push_Up(index); } int main(void) { scanf( %d %d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %d %d %d %d , &T[i].x, &T[i].h, &T[i].Lp, &T[i].Rp); posx[++cnt] = T[i].x - 1; posx[++cnt] = T[i].x + 1; posx[++cnt] = T[i].x - T[i].h; posx[++cnt] = T[i].x + T[i].h; } for (int i = 1; i <= m; ++i) { scanf( %d %d , &M[i].x, &M[i].power); posx[++cnt] = M[i].x; } sort(posx + 1, posx + 1 + cnt); cnt = unique(posx + 1, posx + 1 + cnt) - posx - 1; Build(1, 1, cnt); for (int i = 1; i <= m; ++i) { L = lower_bound(posx + 1, posx + 1 + cnt, M[i].x) - posx; Update_Point(1, 1, cnt, L, M[i].power); } for (int i = 1; i <= n; ++i) { L = lower_bound(posx + 1, posx + 1 + cnt, T[i].x - T[i].h) - posx; R = lower_bound(posx + 1, posx + 1 + cnt, T[i].x - 1) - posx; Update(1, 1, cnt, L, R, 100 - T[i].Lp); L = lower_bound(posx + 1, posx + 1 + cnt, T[i].x + 1) - posx; R = lower_bound(posx + 1, posx + 1 + cnt, T[i].x + T[i].h) - posx; Update(1, 1, cnt, L, R, 100 - T[i].Rp); } printf( %.10lf n , arr[1]); return 0; } |
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; const long long infLL = 0x3f3f3f3f3f3f3f3fLL; const int maxn = 200 + 5; const int maxl = 1000000 + 5; int n, m, q; int g[maxn][maxn]; int a[10], b[10]; bool mrk[maxn][maxn], vis[maxn][maxn]; int cx[maxn][maxn], cy[maxn][maxn], S[maxn][maxn]; char s[maxl]; int suf[maxl]; inline void go(int &x, int &y) { int nx = x + a[g[x][y]], ny = y + b[g[x][y]]; if (1 <= nx && nx <= n && 1 <= ny && ny <= m) x = nx, y = ny; } void init() { memset(S, -1, sizeof(S)); for (int i = (1); i <= (n); ++i) for (int j = (1); j <= (m); ++j) { int x = i, y = j; go(x, y), mrk[x][y] = true; } for (int i = (1); i <= (n); ++i) for (int j = (1); j <= (m); ++j) if (!mrk[i][j]) { int x = i, y = j; do vis[x][y] = true, go(x, y); while (!vis[x][y]); if (S[x][y] == -1) { int u = x, v = y, w = 0; do w |= 1 << g[u][v], go(u, v); while (u != x || v != y); do cx[u][v] = u, cy[u][v] = v, S[u][v] = w, go(u, v); while (u != x || v != y); } int u = i, v = j; do cx[u][v] = cx[x][y], cy[u][v] = cy[x][y], S[u][v] = S[x][y], go(u, v); while (u != x || v != y); } for (int i = (1); i <= (n); ++i) for (int j = (1); j <= (m); ++j) if (!vis[i][j]) { mrk[i][j] = false; int x = i, y = j, z = 0; do z |= 1 << g[x][y], go(x, y); while (x != i || y != j); do cx[x][y] = x, cy[x][y] = y, S[x][y] = z, go(x, y); while (x != i || y != j); } } bool find() { int l = strlen(s); suf[l] = 0; for (int i = l - 1; i >= 0; --i) suf[i] = suf[i + 1] | (1 << (s[i] - 0 )); for (int i = (1); i <= (n); ++i) for (int j = (1); j <= (m); ++j) if (!mrk[i][j]) { int x = i, y = j, p = 0; for (; x != cx[i][j] || y != cy[i][j]; go(x, y)) if (g[x][y] == s[p] - 0 && !s[++p]) return true; if ((suf[p] & S[i][j]) == suf[p]) return true; } return false; } int main() { scanf( %d%d%d , &n, &m, &q); for (int i = (1); i <= (n); ++i) for (int j = (1); j <= (m); ++j) scanf( %1d , &g[i][j]); for (int i = 0; i < (10); ++i) scanf( %d%d , &a[i], &b[i]); init(); while (q--) { scanf( %s , s); puts(find() ? YES : NO ); } return 0; } |
#include<map> #include<set> #include <vector> #include<stack> #include<queue> #include<cmath> #include<string> #include<cstdio> #include<cstring> #include<cstdlib> #include<iostream> #include <numeric> // #include <boost/multiprecision/cpp_dec_float_50.hpp> // using namespace boost::multiprecision; // #include <boost/multiprecision/cpp_dec_float.hpp> // #include <boost/math/constants/constants.hpp> // using boost::multiprecision::cpp_dec_float_50; using namespace std; #define ll long long #define llf long long float #define pl pair<ll,ll> #define test() ll t;cin>>t;while(t--) #define FOR(i,a,b) for(ll i=a;i<b;i++) #define ROF(i,a,b) for(ll i=a;i>=b;i--) #define endl n #define modulus 1000000007 //fast the code #define fast ios_base::sync_with_stdio(false);cin.tie(NULL); // void fastscan(int &number){ bool negative = false;register int c;number = 0; c = getchar();if (c== - ){negative = true;c = getchar();}for (; (c>47 && c<58); c=getchar())number = number *10 + c - 48;if (negative)number *= -1;} typedef vector<ll> vi ; typedef vector<bool> vb ; #define PB push_back ll Gcd(ll a, ll b) { if (b == 0) return a; return Gcd(b, a % b); } bool isPrime(int n){ // Corner cases if(n==1) return true; if (n < 1) return false; if (n <= 3) return true; // This is checked so that we can skip // middle five numbers in below loop if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i = i + 6) if (n % i == 0 || n % (i + 2) == 0) return false; return true; } // ll power(ll a,ll b){ // if(b==0) return 1; // ll res=1; // while(b>0){ // if(b&1) res*=a; // a*=a; // b>>=1; // } // return res; // } // ll gcd(ll a,ll b,ll &x,ll &y){ // if(b==0){ // x=1;y=0; // return a; // } // ll x1,y1; // ll d=gcd(b,a%b,x1,y1); // x=y1; // y=x1-y1*(a/b); // return d; // } // ll get(ll a,ll b, ll c,ll d){ // ll x,y; // gcd(a,c) // } int main(){ fast test(){ ll n;cin>>n; ll a[n]; map<ll,ll>m; FOR(i,0,n) {cin>>a[i];m[a[i]]++;} map<ll,ll>::iterator itr=m.begin(); itr++; ll res=0; for(itr;itr!=m.end();itr++) res+=itr->second; cout<<res<<endl; } } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1001; const int maxm = 1001; char c[maxn][maxm]; int n, m; int pair_num[maxn][maxm]; int pair_cnt; int temp_color[maxn][maxm]; map<int, int> Color; int main() { scanf( %d%d n , &n, &m); for (int i = 0, _n = (n); i < _n; i++) { for (int j = 0, _n = (m); j < _n; j++) { scanf( %c , &c[i][j]); } scanf( n ); } for (int i = 0, _n = (n); i < _n; i++) { for (int j = 0, _n = (m); j < _n; j++) { if (j < m - 1 && c[i][j] == . && c[i][j + 1] == . && !pair_num[i][j] && !pair_num[i][j + 1]) { pair_num[i][j] = pair_num[i][j + 1] = ++pair_cnt; } if (i < n - 1 && c[i][j] == . && c[i + 1][j] == . && !pair_num[i][j] && !pair_num[i + 1][j]) { pair_num[i][j] = pair_num[i + 1][j] = ++pair_cnt; } } } for (int i = 0, _n = (n); i < _n; i++) { for (int j = 0, _n = (m); j < _n; j++) { if (c[i][j] == . && !pair_num[i][j]) { if (j && pair_num[i][j - 1]) { pair_num[i][j] = pair_num[i][j - 1]; } else if (i && pair_num[i - 1][j]) { pair_num[i][j] = pair_num[i - 1][j]; } else if (i != n - 1 && pair_num[i + 1][j]) { pair_num[i][j] = pair_num[i + 1][j]; } else if (j != m - 1 && pair_num[i][j + 1]) { pair_num[i][j] = pair_num[i][j + 1]; } else { printf( -1 n ); return 0; } } } } for (int i = 0, _n = (n); i < _n; i++) for (int j = 0, _n = (m); j < _n; j++) temp_color[i][j] = (i % 3) * 3 + j % 3; for (int i = 0, _n = (n); i < _n; i++) { for (int j = 0, _n = (m); j < _n; j++) { if (c[i][j] == . && (i + j) % 2 == 0) { if (Color.count(pair_num[i][j]) == 0) Color[pair_num[i][j]] = temp_color[i][j]; } } } for (int i = 0, _n = (n); i < _n; i++) { for (int j = 0, _n = (m); j < _n; j++) { if (c[i][j] == . ) printf( %d , Color[pair_num[i][j]]); else printf( # ); } printf( n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { int n, m, x, y; cin >> n >> m >> x >> y; int arr[n][m]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { char c; cin >> c; if (c == * ) arr[i][j] = 0; else arr[i][j] = 1; } long int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (arr[i][j] == 1) { if (j + 1 < m && arr[i][j + 1] == 1) { ans += min(2 * x, y); j++; } else ans += x; } } } cout << ans << endl; } } |
#include <bits/stdc++.h> using namespace std; vector<int> a, k; int fun(int x) { int c = 0; for (auto y : a) if (y <= x) c++; for (auto y : k) { if (y > 0 && y <= x) c++; if (y < 0 && -y <= c) c--; } return c; } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); srand(time(NULL)); ; int T = 1; cin >> T; while (T--) { int n; cin >> n; cout << setprecision(10) << 1 / (2 * sin(3.141592653589793238 / (4 * n))); cout << n ; } return 0; } |
#include <bits/stdc++.h> using namespace std; const double eps = 1E-9; const double Exp = 2.718281828459045; const double pi = 3.14159; const double E = 2.7182818284590452354; int isRight(int x1, int x2) { if (x1 < x2) return 1; else return -1; } int main() { int arr[3][2]; for (int i = 0; i < 3; ++i) { cin >> arr[i][0] >> arr[i][1]; } int resultArr[3][2]; double xn = (arr[0][0] + arr[1][0]) / 2.0; double yn = (arr[0][1] + arr[1][1]) / 2.0; resultArr[0][0] = 2 * xn - arr[2][0]; resultArr[0][1] = 2 * yn - arr[2][1]; xn = (arr[1][0] + arr[2][0]) / 2.0; yn = (arr[1][1] + arr[2][1]) / 2.0; resultArr[1][0] = 2 * xn - arr[0][0]; resultArr[1][1] = 2 * yn - arr[0][1]; xn = (arr[0][0] + arr[2][0]) / 2.0; yn = (arr[0][1] + arr[2][1]) / 2.0; resultArr[2][0] = 2 * xn - arr[1][0]; resultArr[2][1] = 2 * yn - arr[1][1]; int number = 3; if (resultArr[0][0] == resultArr[1][0] && resultArr[0][1] == resultArr[1][1]) { number--; } if (resultArr[1][0] == resultArr[2][0] && resultArr[1][1] == resultArr[2][1]) { number--; } if (resultArr[2][0] == resultArr[0][0] && resultArr[2][1] == resultArr[0][1]) { number--; } cout << number << endl; for (int i = 0; i < 3; ++i) { cout << resultArr[i][0] << << resultArr[i][1] << endl; } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long int t, n, ar[100010]; long long int xr[50010], yr[50010], mr[50010]; while (cin >> t) { for (int i = 0; i < t; i++) { cin >> n; xr[i] = 0; yr[i] = 0; mr[i] = 0; for (int j = 0; j < n; j++) { cin >> ar[j]; if (ar[j] % 3 == 1) xr[i]++; if (ar[j] % 3 == 2) yr[i]++; if (ar[j] % 3 == 0 && ar[j] != 0) mr[i]++; } } for (int i = 0; i < t; i++) { if (xr[i] >= yr[i]) cout << yr[i] + mr[i] + (xr[i] - yr[i] - (xr[i] - yr[i]) % 3) / 3 << endl; else cout << mr[i] + xr[i] + (yr[i] - xr[i] - (yr[i] - xr[i]) % 3) / 3 << endl; } } } |
#include <bits/stdc++.h> using namespace std; int main() { int first, second; scanf( %d%d , &first, &second); if (first > second) swap(first, second); int sum = 0; if (first <= 2) { if (first == 1) sum = second; else { if (second < 5) sum = 4; else { if (second % 2 == 0) { if ((second - 6) % 4 == 0) sum = second + 2; else sum = second; } else sum = second + 1; } } } else { if (first % 2 == 0 || second % 2 == 0) sum = (first * second) / 2; else sum = (first * second) / 2 + 1; } printf( %d n , sum); return 0; } |
#include <bits/stdc++.h> using namespace std; struct Ratio { long long p; long long q; Ratio(long long p_, long long q_) : p(p_), q(q_) {} bool operator<(const Ratio& o) const { return p * o.q < q * o.p; } bool operator>(const Ratio& o) const { return p * o.q > q * o.p; } bool operator==(const Ratio& o) const { return p * o.q == q * o.p; } }; int main() { ios_base::sync_with_stdio(false); long long x1, x2, y1, y2, n; cin >> n >> x1 >> y1 >> x2 >> y2; vector<pair<long long, long long>> r(n), v(n); for (int i = 0; i < n; ++i) { cin >> r[i].first >> r[i].second >> v[i].first >> v[i].second; } bool has_upper = false; Ratio ans_upper{0, 1}, ans_lower{0, 1}; for (int i = 0; i < n; ++i) { if (v[i].first == 0) { if (r[i].first < x1 || r[i].first > x2) { cout << -1 << n ; return 0; } } else if (v[i].first > 0) { if (x1 > r[i].first) { ans_lower = max(ans_lower, Ratio(x1 - r[i].first, v[i].first)); } if (x2 < r[i].first) { cout << -1 << n ; return 0; } if (has_upper) ans_upper = min(ans_upper, Ratio(x2 - r[i].first, v[i].first)); else ans_upper = Ratio(x2 - r[i].first, v[i].first); has_upper = true; } else { if (r[i].first < x1) { cout << -1 << n ; return 0; } if (has_upper) ans_upper = min(ans_upper, Ratio(r[i].first - x1, -v[i].first)); else ans_upper = Ratio(r[i].first - x1, -v[i].first); has_upper = true; if (r[i].first > x2) { ans_lower = max(ans_lower, Ratio(r[i].first - x2, -v[i].first)); } } if (v[i].second == 0) { if (r[i].second < y1 || r[i].second > y2) { cout << -1 << n ; return 0; } } else if (v[i].second > 0) { if (y1 > r[i].second) { ans_lower = max(ans_lower, Ratio(y1 - r[i].second, v[i].second)); } if (y2 < r[i].second) { cout << -1 << n ; return 0; } if (has_upper) ans_upper = min(ans_upper, Ratio(y2 - r[i].second, v[i].second)); else ans_upper = Ratio(y2 - r[i].second, v[i].second); has_upper = true; } else { if (r[i].second < y1) { cout << -1 << n ; return 0; } if (has_upper) ans_upper = min(ans_upper, Ratio(r[i].second - y1, -v[i].second)); else ans_upper = Ratio(r[i].second - y1, -v[i].second); has_upper = true; if (r[i].second > y2) { ans_lower = max(ans_lower, Ratio(r[i].second - y2, -v[i].second)); } } if (has_upper && !(ans_lower < ans_upper)) { cout << -1 << n ; return 0; } } for (int i = 0; i < n; ++i) { if (v[i].first == 0 && (r[i].first == x1 || r[i].first == x2)) { cout << -1 << n ; return 0; } if (v[i].second == 0 && (r[i].second == y1 || r[i].second == y2)) { cout << -1 << n ; return 0; } } cout << fixed << setprecision(9) << (ans_lower.p + 0.0) / ans_lower.q << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s, soln; cin >> s; soln = s; for (int i = 0, idx = (n - 1) / 2; i < n; i++) { soln[idx] = s[i]; if ((n + i) % 2 == 0) idx += (i + 1); else if ((n + i) % 2 == 1) idx -= (i + 1); } cout << soln << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int main(void) { int n, k; string wall[2]; int water = 0; cin >> n >> k; cin >> wall[0] >> wall[1]; queue<pair<int, int> > q; q.push(make_pair(0, 0)); while (!q.empty()) { queue<pair<int, int> > next; do { pair<int, int> pos = q.front(); q.pop(); if (pos.second + k >= n) { cout << YES << endl; return 0; } if (pos.second - 1 > water && wall[pos.first][pos.second - 1] != X ) { wall[pos.first][pos.second - 1] = X ; next.push(make_pair(pos.first, pos.second - 1)); } if (wall[pos.first][pos.second + 1] != X ) { wall[pos.first][pos.second + 1] = X ; next.push(make_pair(pos.first, pos.second + 1)); } if (wall[1 - pos.first][pos.second + k] != X ) { wall[1 - pos.first][pos.second + k] = X ; next.push(make_pair(1 - pos.first, pos.second + k)); } } while (!q.empty()); ++water; q = next; } cout << NO << endl; } |
#include <bits/stdc++.h> using namespace std; int main() { long long k, d; double t; cin >> k >> d >> t; long long time1 = k; long long time2 = 0; if (k % d > 0) { time2 = (k / d + 1) * d - k; } double each_sum = k + (double)time2 / 2; double res = 0; res += (long long)(t / each_sum) * (time1 + time2); t = t - (long long)(t / each_sum) * each_sum; if (t == 0) { printf( %.1f n , res); } else { res += min(t, (double)k); t -= min(t, (double)k); res += t * 2; printf( %.1f n , res); } } |
#include <bits/stdc++.h> #pragma GCC optimize( -O2 ) using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << = << a << endl; err(++it, args...); } const int LIM = 1e5 + 5, MOD = 1e9 + 7; int t, n, m, k, x, y; int is_com[LIM]; vector<int> pr; void sieve() { is_com[1] = 1; for (int i = 2; i < LIM; i++) { if (!is_com[i]) { pr.push_back(i); for (int j = i + i; j < LIM; j += i) { is_com[j] = 1; } } } } struct edge { int from, to, cap, flow, index; edge(int from, int to, int cap, int flow, int index) : from(from), to(to), cap(cap), flow(flow), index(index) {} }; struct PushRelabel { int n; vector<vector<edge> > g; vector<long long> excess; vector<int> height, active, count; queue<int> Q; PushRelabel(int n) : n(n), g(n), excess(n), height(n), active(n), count(2 * n) {} void addEdge(int from, int to, int cap) { g[from].push_back(edge(from, to, cap, 0, g[to].size())); if (from == to) g[from].back().index++; g[to].push_back(edge(to, from, 0, 0, g[from].size() - 1)); } void enqueue(int v) { if (!active[v] && excess[v] > 0) { active[v] = true; Q.push(v); } } void push(edge &e) { int amt = (int)min(excess[e.from], (long long)e.cap - e.flow); if (height[e.from] <= height[e.to] || amt == 0) return; e.flow += amt; g[e.to][e.index].flow -= amt; excess[e.to] += amt; excess[e.from] -= amt; enqueue(e.to); } void relabel(int v) { count[height[v]]--; int d = 2 * n; for (auto &it : g[v]) { if (it.cap - it.flow > 0) d = min(d, height[it.to] + 1); } height[v] = d; count[height[v]]++; enqueue(v); } void gap(int k) { for (int v = 0; v < n; v++) { if (height[v] < k) continue; count[height[v]]--; height[v] = max(height[v], n + 1); count[height[v]]++; enqueue(v); } } void discharge(int v) { for (int i = 0; excess[v] > 0 && i < g[v].size(); i++) push(g[v][i]); if (excess[v] > 0) { if (count[height[v]] == 1) gap(height[v]); else relabel(v); } } long long max_flow(int source, int dest) { count[0] = n - 1; count[n] = 1; height[source] = n; active[source] = active[dest] = 1; for (auto &it : g[source]) { excess[source] += it.cap; push(it); } while (!Q.empty()) { int v = Q.front(); Q.pop(); active[v] = false; discharge(v); } long long max_flow = 0; for (auto &e : g[source]) max_flow += e.flow; return max_flow; } }; vector<vector<int> > v, ans; vector<int> vs; void dfs(int i, int c) { vs[i] = 1; ans[c].push_back(i + 1); for (auto &it : v[i]) { if (!vs[it]) dfs(it, c); } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); sieve(); cin >> n; vector<int> odd, even; vector<int> indodd, indeven; for (int i = 0; i < n; i++) { cin >> x; if (x & 1) odd.push_back(x), indodd.push_back(i); else even.push_back(x), indeven.push_back(i); } if (odd.size() != even.size()) { cout << Impossible n ; return 0; } PushRelabel p(n + 2); for (int i = 0; i < even.size(); i++) { p.addEdge(odd.size() + 1 + i, n + 1, 2); } for (int i = 0; i < odd.size(); i++) { p.addEdge(0, i + 1, 2); for (int j = 0; j < even.size(); j++) { if (!is_com[odd[i] + even[j]]) { p.addEdge(i + 1, j + 1 + odd.size(), 1); } } } int ans1 = p.max_flow(0, n + 1); if (ans1 == n) { v.assign(n, vector<int>(0)); for (int i = 0; i < odd.size(); i++) { for (auto &it : p.g[i + 1]) { if (it.flow == 1) { x = indodd[i]; y = indeven[it.to - 1 - odd.size()]; v[x].push_back(y); v[y].push_back(x); } } } vs.assign(n, 0); int c = 0; for (int i = 0; i < n; i++) { if (!vs[i]) ans.push_back(vector<int>(0)), dfs(i, c), c++; } cout << c << n ; for (auto &it : ans) { cout << it.size() << ; for (auto &it1 : it) { cout << it1 << ; } cout << n ; } } else cout << Impossible n ; return 0; } |
#include <bits/stdc++.h> using namespace std; vector<pair<int, pair<int, int> > > data; int ii, jj, kk, l; pair<int, int> bc(int x) { int q[4]; for (int i = 0; i < 4; i++) { q[i] = x % 10; x /= 10; } int vis[10]; memset(vis, 0, sizeof vis); vis[ii] = vis[jj] = vis[kk] = vis[l] = 1; int b = 0; int c = 0; if (q[0] == ii) b++; else if (vis[q[0]] == 1) c++; if (q[1] == jj) b++; else if (vis[q[1]] == 1) c++; if (q[2] == kk) b++; else if (vis[q[2]] == 1) c++; if (q[3] == l) b++; else if (vis[q[3]] == 1) c++; return make_pair(b, c); } int con() { int ret = l; ret = ret * 10 + kk; ret = ret * 10 + jj; ret = ret * 10 + ii; return ret; } int main() { int n; scanf( %d , &n); int x, y, z; for (int i = 0; i < n; i++) { scanf( %d , &x); scanf( %d , &y); scanf( %d , &z); data.push_back(make_pair(x, make_pair(y, z))); } int flag = 0; int val; int vis[10]; for (ii = 0; ii < 10; ii++) { for (jj = 0; jj < 10; jj++) { for (kk = 0; kk < 10; kk++) { for (l = 0; l < 10; l++) { memset(vis, 0, sizeof vis); vis[ii]++; vis[jj]++; vis[kk]++; vis[l]++; int shit = 0; for (int i = 0; i < 10; i++) { if (vis[i] > 1) { shit = 1; break; } } if (shit) continue; int i; for (i = 0; i < n; i++) { pair<int, int> ret = bc(data[i].first); if (ret != data[i].second) break; } if (i == n) { flag++; val = con(); } } } } } if (flag == 1) { vector<int> stud; for (int i = 0; i < 4; i++) { stud.push_back(val % 10); val /= 10; } for (int i = 3; i >= 0; i--) cout << stud[i]; } else if (flag == 0) { cout << Incorrect data n ; } else cout << Need more data n ; } |
#include <bits/stdc++.h> using namespace std; int x[100] = {4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165}; int main() { int a; cin >> a; cout << x[a - 1]; } |
#include <bits/stdc++.h> using namespace std; const int maxn = 1e2 + 5; pair<int, int> seg[maxn]; int f[maxn][maxn][2]; int ans; int main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> seg[i].first >> seg[i].second; sort(seg + 1, seg + n + 1); seg[0].first = -(1 << 30); for (int i = 0; i <= n; ++i) { for (int j = 0; j <= i; ++j) { for (int k = 0; k < 2; ++k) { ans = max(ans, f[i][j][k]); int nr = seg[j].first + seg[j].second * k, mx = -(1 << 30), x = 0, y = 0; for (int l = i + 1; l <= n; ++l) { for (int m = 0; m < 2; ++m) { int tr = seg[l].first + seg[l].second * m; if (tr > mx) mx = tr, x = l, y = m; f[l][x][y] = max( f[l][x][y], f[i][j][k] + mx - tr + min(seg[l].second, tr - nr)); } } } } } cout << ans << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; int n, m, zero, one, tot; long long mod; long long dp[505][505]; string str[505]; long long dfs(int z, int o) { long long& ret = dp[z][o]; if (ret != -1) return ret; ret = 0; if (z == 0 && o == 0) return ret = 1; if (z > 0 && o > 0) { long long nxt = dfs(z - 1, o); nxt = nxt * (long long)z % mod; nxt = nxt * (long long)o % mod; ret = (ret + nxt) % mod; } if (z > 1) { long long nxt = dfs(z - 2, o + 2); nxt = nxt * (long long)z * (z - 1) / 2 % mod; ret = (ret + nxt) % mod; } if (o > 1) { long long nxt = dfs(z, o - 2); nxt = nxt * (long long)o * (o - 1) / 2 % mod; ret = (ret + nxt) % mod; } return ret; } int main() { scanf( %d %d %I64d , &n, &m, &mod); int flag = 0; for (int i = 0; i < m; i++) { cin >> str[i]; int cnt = 0; for (int j = 0; j < n; j++) { if (str[i][j] == 1 ) ++cnt; } if (cnt != 2) { flag = 1; } } if (flag) { puts( 0 ); return 0; } for (int j = 0; j < n; j++) { int cc = 0; for (int i = 0; i < m; i++) { if (str[i][j] == 1 ) ++cc; } if (cc >= 3) { puts( 0 ); return 0; } if (cc == 0) zero++; else if (cc == 1) one++; } if (zero + zero + one != 2 * (n - m)) { puts( 0 ); return 0; } memset(dp, -1, sizeof(dp)); long long ans = dfs(zero, one); cout << ans; } |
#include <bits/stdc++.h> using namespace std; const int maxn = (1e6) + 7; const int inf = (1e9) + 7; const long long LLinf = (1e18) + 7; const long double eps = 1e-9; const long long mod = 1e9 + 7; const int maxlog = 31; stack<pair<int, int> > stos; int tab[maxn]; int lewo[maxn]; int prawo[maxn]; int le[maxn][maxlog]; int pr[maxn][maxlog]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 1; i < n + 1; i++) { cin >> tab[i]; while (((int)(stos).size()) && stos.top().first < tab[i]) stos.pop(); if (((int)(stos).size())) lewo[i] = stos.top().second; stos.push({tab[i], i}); } while (((int)(stos).size())) stos.pop(); for (int i = n; i > 0; i--) { while (((int)(stos).size()) && stos.top().first <= tab[i]) stos.pop(); if (((int)(stos).size())) prawo[i] = stos.top().second; else prawo[i] = n + 1; stos.push({tab[i], i}); } for (int bit = 0; bit < maxlog; bit++) { int curr = 0; for (int i = 1; i < n + 1; i++) { if (tab[i] & (1 << bit)) curr = i; le[i][bit] = curr; } curr = n + 1; for (int i = n; i > 0; i--) { if (tab[i] & (1 << bit)) curr = i; pr[i][bit] = curr; } } long long res = 0LL; for (int i = 1; i < n + 1; i++) { int l = 0; int p = n + 1; for (int bit = 0; bit < maxlog; bit++) { if (tab[i] & (1 << bit)) continue; l = max(l, le[i][bit]); p = min(p, pr[i][bit]); } if (l - lewo[i] > 0) res += (l - lewo[i]) * (long long)(prawo[i] - i); if (prawo[i] - p > 0) res += (prawo[i] - p) * (long long)(i - lewo[i]); if (prawo[i] - p > 0 && l - lewo[i] > 0) res -= (prawo[i] - p) * (long long)(l - lewo[i]); } cout << res; return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int t, n, a, b; cin >> t; for (int i = 0; i < t; ++i) { bool res = true; cin >> n; cin >> a; for (int i = 1; i < n; ++i) { cin >> b; if (a < b && b - a > 1) res = false; a = b; } cout << (res ? Yes n : No n ); } return 0; } |
#include <bits/stdc++.h> long long quickpow(long long a, long long b) { long long ans = 1; while (b) { if (b & 1) ans = ans * a % 1000000007; b >>= 1, a = a * a % 1000000007; } return ans; } using namespace std; const long long N = 1e3 + 7; const long long maxn = 2e3 + 9; long long n, m; char s[maxn]; long long cnt[27]; bool check(long long x, long long y) { for (long long i = 0; i <= 25; i++) { y -= cnt[i] / x; } return y <= 0; } void solve() { long long n, k; cin >> n >> k; scanf( %s , s + 1); memset(cnt, 0, sizeof(cnt)); for (long long i = 1; i <= n; i++) { cnt[s[i] - a ]++; } long long ans = 1; for (long long i = 1; i <= k; i++) { if (k % i == 0) { long long l = 1, r = n; while (r >= l) { long long mid = (l + r) >> 1; if (check(mid, i)) { l = mid + 1; } else { r = mid - 1; } } ans = max(ans, r * i); } } cout << ans << endl; } signed main() { long long _; cin >> _; while (_--) solve(); } |
#include <bits/stdc++.h> const double eps = 1e-10; using namespace std; int n, m, q, a, b, k; int so; int allin, games; const int N = (1111111); int in[N]; int answ; void cut(int m, int k) { for (int i = 0; i < n; i++) { if (k <= 0) break; if (in[i] != -1 && in[i] % 3 == m) { in[i] = -1; k--; } } } int main() { scanf( %d , &n); bool can = 0; long long answr = 1; long long ss = 0; int one = 0, two = 0; for (int i = 0; i < n; i++) { scanf( %d , &in[i]); if (in[i] == 0) { can = 1; } if (in[i] % 3 == 1) one++; if (in[i] % 3 == 2) two++; ss += in[i]; } if (!can) { printf( -1 n ); return 0; } sort(in, in + n); if (ss % 3 == 1) { if (one > 0) { cut(1, 1); } else if (two >= 2) { cut(2, 2); } } else if (ss % 3 == 2) { if (two > 0) { cut(2, 1); } else if (one > 1) { cut(1, 2); } } bool fl = 0; for (int i = n - 1; i >= 0; i--) { if (in[i] != -1) { printf( %d , in[i]); if (fl == 0 && in[i] == 0) { fl = 1; break; } fl = 1; } } return 0; } |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1.0); void umax(int &a, int b) { a = max(a, b); } void umin(int &a, int b) { a = min(a, b); } void file() { freopen( a.in , r , stdin); } namespace Solver { const int maxn = 220000; int n, k; long long v[maxn]; long long dp[maxn], suf[maxn], id[maxn]; void solve() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &v[i]); long long sum = 0; for (int i = n; i > n - k; i--) sum += v[i]; dp[n - k + 1] = sum; for (int i = n - k; i >= 1; i--) { sum += v[i]; sum -= v[i + k]; dp[i] = sum; } for (int i = n; i >= 1; i--) { if (dp[i] >= suf[i + 1]) suf[i] = dp[i], id[i] = i; else suf[i] = suf[i + 1], id[i] = id[i + 1]; } long long ans = 0; int ans1, ans2; for (int i = 1; i <= n - 2 * k + 1; i++) { if (ans < dp[i] + suf[i + k]) { ans = dp[i] + suf[i + k]; ans1 = i; ans2 = id[i + k]; } } cout << ans1 << << ans2 << endl; } }; // namespace Solver int main() { Solver::solve(); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { long long n, sum = 0, a, maxx = 0; scanf( %I64d , &n); for (long long i = 0; i < n; ++i) { scanf( %I64d , &a); sum += a; maxx = max(maxx, a); } if (sum - maxx >= maxx) { if (sum % 2) printf( NO n ); else printf( YES n ); } else printf( NO n ); } |
#include <bits/stdc++.h> using namespace std; string vow = aeiou ; const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2}; const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1}; const int dx[] = {-1, 0, 0, 1}; const int dy[] = {0, -1, 1, 0}; const long double pie = 3.14159265358979; const long long mod = 1e9 + 7; long long ans = LLONG_MAX; long long in; void f(long long n, int four, int sev) { if (n > 1e11) return; if (n >= in) { if (four == sev) ans = min(ans, n); } f(n * 10 + 4, four + 1, sev); f(n * 10 + 7, four, sev + 1); } void solve(int test_case) { cin >> in; f(0, 0, 0); cout << ans; } int main() { int t = 1; for (int i = 0; i < t; i++) solve(i); return 0; } |
#include <bits/stdc++.h> using namespace std; vector<int> sol; int n, m, T, h, mi, cnt, fndm, v[1000100], sec; char ch; int main() { cin >> n >> m >> T; for (int i = 1; i <= n; ++i) { cin >> h; cin >> ch; h *= 3600; cin >> mi; cin >> ch; mi *= 60; cin >> sec; v[i] = h + mi + sec; } int la = 0; int lt = 0; int user = 0; multiset<int> hm; for (int i = 1; i <= n; ++i) { while (!hm.empty() && *hm.begin() < v[i]) hm.erase(hm.begin()); if (hm.size() == m) { sol.push_back(user); if (hm.count(v[i - 1] + T - 1)) hm.erase(hm.find(v[i - 1] + T - 1)); } else sol.push_back(++user); hm.insert(v[i] + T - 1); if (hm.size() == m) fndm = 1; } if (!fndm) { cout << No solution ; return 0; } cout << user << n ; for (vector<int>::iterator it = sol.begin(); it != sol.end(); it++) cout << *it << n ; return 0; } |
#include <bits/stdc++.h> using namespace std; const long long N = 2e3 + 5, mod = 998244353, inf = 1e18 + 7; long long dp[N][N]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n, m, k; cin >> n >> m >> k; for (long long i = 0; i <= n; i++) { dp[i][0] = m; } for (long long i = 2; i <= n; i++) { for (long long j = 1; j <= k; j++) { dp[i][j] = (dp[i - 1][j - 1] * (m - 1)) % mod; dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod; } } cout << dp[n][k]; } |
#include <bits/stdc++.h> using namespace std; long n, m; long a[4], b[4], c[4]; int main() { cin >> n; for (int i = 1; i <= 3; i++) { cin >> a[i] >> b[i]; c[i] = a[i]; } m = a[1] + a[2] + a[3]; for (int i = 1; i <= 3; i++) { while (c[i] < b[i] && m < n) { c[i] += 1; m += 1; } } cout << c[1] << << c[2] << << c[3]; return 0; } |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; const int MAXM = 1000005; const int MOD = 1000000007; const int MAMOD = 998244353; const int INF = 0x3f3f3f3f; const long long LLINF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1.0); const double EPS = 1e-8; long long n, k, b, c; long long t[MAXN]; int main() { ios::sync_with_stdio(0); cin >> n >> k >> b >> c; for (int i = 1; i <= n; ++i) { cin >> t[i]; t[i] += 1000000000; } sort(t + 1, t + 1 + n); long long ret = LLINF; b = min(b, 5 * c); for (int i = 0; i < 5; ++i) { priority_queue<long long, vector<long long>, greater<long long>> pq; long long x, y, z, sum = 0; for (int j = 1; j <= n; ++j) { x = (i - t[j] % 5 + 5) % 5; y = (t[j] + x) / 5; z = y * b - x * c; sum += z; pq.push(z); if (j >= k) { ret = min(ret, y * k * b - sum); sum -= pq.top(); pq.pop(); } } } cout << ret << n ; return 0; } |
#include <bits/stdc++.h> int in() { int x = 0; char c = getchar(); bool f = false; while (c < 0 || c > 9 ) f |= c == - , c = getchar(); while (c >= 0 && c <= 9 ) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); return f ? -x : x; } long long lin() { long long x = 0; char c = getchar(); bool f = false; while (c < 0 || c > 9 ) f |= c == - , c = getchar(); while (c >= 0 && c <= 9 ) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); return f ? -x : x; } const int N = 1e5 + 5; struct node { long long a, b; inline bool operator<(const node &x) const { return (this->a - this->b) > (x.a - x.b); } } s[N]; long long res; int main() { int n = in(); for (int i = 1; i <= n; ++i) s[i] = (node){lin(), lin()}; std::sort(s + 1, s + 1 + n); for (int i = 1; i <= n; ++i) res += (long long)s[i].b * n + (s[i].a - s[i].b) * i - s[i].a; printf( %lld n , res); return 0; } |
#include <bits/stdc++.h> const long long MOD = 1e9 + 7, INF = 1e18 + 1; using namespace std; long long a[1000000], cnt, n, m; long long p[1000000], sz[1000000]; int d[10000001]; long long gcd(long long a, long long b) { if (!b) return (a > 1); else return gcd(b, a % b); } long long find(long long x) { if (p[x] == x) return x; else return p[x] = find(p[x]); } void unite(long long a, long long b) { a = find(a); b = find(b); if (a == b) return; if (sz[a] < sz[b]) swap(a, b); p[b] = a; sz[a] += sz[b]; cnt--; } int main() { cin >> n; for (long long i = 0; i < n; i++) { p[i] = i; sz[i] = 1; } memset(d, -1, sizeof(d)); cnt = n; for (long long i = 0; i < n; i++) { scanf( %lld , &a[i]); d[a[i]] = i; m = max(m, a[i]); } for (long long y = 0; y <= m; y++) for (long long x = y + 1; x * x - y * y <= m && 2 * x * y <= m; x++) { long long x1 = x * x + y * y; long long x2 = 2 * x * y; long long x3 = x * x - y * y; if (gcd(x1, x2) || gcd(x2, x3) || gcd(x1, x3)) continue; if (x1 <= m && d[x1] >= 0 && d[x2] >= 0) unite(d[x1], d[x2]); if (x1 <= m && d[x1] >= 0 && d[x3] >= 0) unite(d[x1], d[x3]); if (d[x2] >= 0 && d[x3] >= 0) unite(d[x2], d[x3]); } cout << cnt; } |
#include <bits/stdc++.h> using namespace std; bool cmp(long long a, long long b) { return (a > b); } long long ceil(const long long &a, const long long &b) { if (a % b == 0) return a / b; return a / b + 1; } long long mod = 1000000007; const long long N = 100005; using namespace std; long long a[1100][5]; long long n, m; int main() { cin >> n >> m; string s; for (long long i = 0; i < n; i++) { cin >> s; for (long long j = 0; j < m; j++) { a[j][s[j] - A ]++; } } long long ans = 0; for (long long i = 0; i < m; i++) { long long w, mx = 0; cin >> w; for (long long j = 0; j < 5; j++) { mx = max(mx, a[i][j]); } ans += mx * w; } cout << ans; } |
#include <bits/stdc++.h> using namespace std; int l[5010], r[5010]; vector<int> vc; long long f[2][10100]; int cost[10100]; int doit(int x, int y) { if (vc[x] <= l[y]) return l[y] - vc[x]; if (vc[x] >= r[y]) return vc[x] - r[y]; return 0; } int main() { int start = 0; int n; scanf( %d %d , &n, &start); vc.push_back(start); for (int i = 1; i <= n; ++i) { scanf( %d %d , &l[i], &r[i]); vc.push_back(l[i]); vc.push_back(r[i]); } sort(vc.begin(), vc.end()); vc.erase(unique(vc.begin(), vc.end()), vc.end()); int now = 0, nxt = 1; int cnt = vc.size(); for (int i = 0; i < cnt; ++i) { cost[i] = doit(i, 1); } for (int i = 0; i < cnt; ++i) { f[now][i] = abs(vc[i] - start) + cost[i]; } for (int i = 1; i < n; ++i) { memset(cost, 0, sizeof cost); for (int j = 0; j < cnt; ++j) { cost[j] = doit(j, i + 1); } int mn = f[now][cnt - 1], mx = cnt - 1; for (int j = cnt - 1; j >= 0; --j) { if (j < cnt - 1 && f[now][j] - (vc[cnt - 1] - vc[j]) < mn) { mn = f[now][j] - (vc[cnt - 1] - vc[j]); mx = j; } f[nxt][j] = f[now][mx] + vc[mx] - vc[j] + cost[j]; } mn = f[now][0], mx = 0; for (int j = 0; j < cnt; ++j) { if (j && f[now][j] - (vc[j] - vc[0]) < mn) { mn = f[now][j] - (vc[j] - vc[0]); mx = j; } f[nxt][j] = min(f[nxt][j], f[now][mx] + vc[j] - vc[mx] + cost[j]); } swap(now, nxt); } long long ans = 1e18; for (int i = 0; i < cnt; ++i) ans = min(ans, f[now][i]); printf( %I64d n , ans); } |
#include <bits/stdc++.h> using namespace std; string itos(int x) { stringstream ss; ss << x; return ss.str(); } int n, m, res, bestlone; map<string, vector<int> > m1; string str; int main() { ios_base::sync_with_stdio(false); cin >> n >> m; for (int i = 0, x; i < n; i++) { cin >> str >> x; string t = str; if (not m1.count(str)) m1[str] = vector<int>(); m1[str].push_back(x); } for (auto &x : m1) sort(x.second.begin(), x.second.end(), greater<int>()); for (auto x : m1) { string str = x.first; string t = str; reverse(t.begin(), t.end()); vector<int> &v = x.second; if (str > t) continue; else if (str == t) { for (int i = 0; i < v.size(); i += 2) { if (i + 1 < v.size()) { int x = v[i], y = v[i + 1]; if (x < 0) break; else if (y < 0) { if (x + y > 0) { bestlone = max(bestlone, -y); res += x + y; } else bestlone = max(bestlone, x); } else res += x + y; } else { int x = v[i]; if (x < 0) break; bestlone = max(bestlone, x); } } } else { vector<int> &v2 = m1[t]; for (int i = 0; i < v.size() && i < v2.size(); i++) { if (v[i] + v2[i] < 0) break; else res += v[i] + v2[i]; } } } res += bestlone; cout << res << endl; return 0; } |
#include <bits/stdc++.h> using namespace std; int a, b, c, d; int main() { cin >> a >> b >> c >> d; if (c - d < -1 || c - d > 1 || a < max(c, d) || b < max(c, d)) { cout << -1; return 0; } if (c - d == -1) { for (int i = 0; i < d; i++) { if (i == d - 1) for (int j = b; j > d; j--) cout << 7; cout << 74; if (!i) for (int j = a; j > d; j--) cout << 4; } } if (c - d == 1) { for (int i = a; i > c; i--) cout << 4; for (int i = 0; i < c; i++) cout << 47; for (int i = b; i > c; i--) cout << 7; } if (c == d) { if (a == c && b == d) { cout << -1; return 0; } if (a > c) { for (int i = a; i > c + 1; i--) cout << 4; for (int i = 0; i < c; i++) { cout << 47; } for (int i = b; i > d; i--) cout << 7; cout << 4; } else { cout << 7; for (int i = 0; i < c; i++) cout << 47; for (int i = b; i > d + 1; i--) cout << 7; } } } |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int test; cin >> test; while (test--) { int a, b, x, y; cin >> a >> b; if (a < b) swap(a, b); bool ok = 1; x = 2 * a - b; if (x % 3 != 0) ok = 0; y = x / 3; if ((a + b) % 3 != 0) ok = 0; x = (a + b) / 3 - y; if (x < 0 || y < 0) ok = 0; cout << (ok ? YES n : NO n ); } return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int a, b; cin >> a >> b; int dif, same; if (a > b) { dif = b; same = (a - b) / 2; } else { dif = a; same = (b - a) / 2; } cout << dif << << same; return 0; } |
#include <bits/stdc++.h> using namespace std; template <typename T> inline string toString(T a) { ostringstream os( ); os << a; return os.str(); } template <typename T> inline long long toLong(T a) { long long res; istringstream os(a); os >> res; return res; } template <typename T> inline T S(T a) { return a * a; } template <typename T> inline T gcd(T a, T b) { if (b == 0) return a; else return gcd(b, a % b); } template <typename T> inline unsigned long long bigmod(T a, T b, T m) { if (b == 0) return 1; else if (b % 2 == 0) return S(bigmod(a, b / 2, m)) % m; else return (a % m * bigmod(a, b - 1, m)) % m; } vector<string> v; vector<int> vv; int main() { int i, j, k; string str; int n; cin >> n; for (i = 0; i < n; i++) { cin >> str; v.push_back(str); vv.push_back(str.length()); } cin >> str; int len = str.length(); int st = 0; k = 0; int res = 0; i = 0; j = 0; for (k = 0; k < len; k++) { if (st == 0) { if (str[k] == < ) st = 1; } else if (st == 1) { if (str[k] == 3 ) st = 2; } else if (st == 2) { if (str[k] == v[i][j]) { j++; } if (j == vv[i]) { i++; j = 0; st = 0; } } if (i == n && st == 2) { res = 1; break; } } if (res) puts( yes ); else puts( no ); return 0; } |
#include <bits/stdc++.h> using namespace std; const long long mm = 2; long long n, nn = 0, a1[mm + 1], m0[mm + 1][mm + 1], m1[mm + 1][mm + 1], tmp[mm + 1][mm + 1], mz[mm + 1][mm + 1], az[mm + 1], dv; queue<long long> q; void mul(long long x[mm + 1][mm + 1], long long y[mm + 1][mm + 1], long long z[mm + 1][mm + 1]) { long long i, j, r; for (i = 1; i <= mm; i++) { for (j = 1; j <= mm; j++) { tmp[i][j] = 0; for (r = 1; r <= mm; r++) { tmp[i][j] = (tmp[i][j] + x[i][r] * y[r][j]) % dv; } } } for (i = 1; i <= mm; i++) { for (j = 1; j <= mm; j++) { z[i][j] = tmp[i][j]; } } } void mpw(long long x) { if (!x) { mul(m0, m0, mz); return; } mpw(x / 2); mul(mz, mz, mz); if (x % 2) { mul(mz, m1, mz); } } int main() { long long i, j, lb, rb, ln, k, z; for (i = 1; i <= mm; i++) { m0[i][i] = 1; } scanf( %lld%lld%lld%lld , &dv, &lb, &rb, &n); ln = rb - lb + 1; if (ln / n <= 1000000) { for (i = (ln - 1) / (n - 1); i >= ln / n; i--) { if (rb / i - (lb - 1) / i >= n) { z = i; break; } } } else { for (i = 1; 1; i++) { for (; nn && q.front() > rb / i; q.pop(), nn--) ; q.push((lb - 1) / i + 1); nn++; if (nn >= n) { z = rb / i; break; } } } a1[1] = 1; m1[1][1] = 1; m1[1][2] = 1; m1[2][1] = 1; mpw(z - 1); for (i = 1; i <= mm; i++) { for (j = 1; j <= mm; j++) { az[i] = (az[i] + a1[j] * mz[i][j]) % dv; } } printf( %lld n , az[1]); } |
#include <bits/stdc++.h> using namespace std; inline long long read() { char ch = getchar(); register long long x = 0; int f = 1; 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 maxn = 1e6 + 10; int n, k, ring[maxn >> 1], e[maxn], cnt, r[maxn >> 1], cu, amt[maxn >> 1], sum[maxn >> 1], odd, minans, maxans; bool f[maxn], vis[maxn]; inline int dfs(int start, int cur, int l) { vis[cur] = true; if (cur == start) return l; return dfs(start, e[cur], l + 1); } int main() { n = read(), k = read(); for (int i = 1; i <= n; i++) e[i] = read(); for (int i = 1; i <= n; i++) if (!vis[i]) ring[++cnt] = dfs(i, e[i], 1); sort(ring + 1, ring + cnt + 1); for (int i = 1; i <= cnt; i++) { if (ring[i] == r[cu]) amt[cu]++; else { r[++cu] = ring[i]; amt[cu] = 1; } } f[0] = true; for (int i = 1; i <= cu; i++) { memset(sum, 0, sizeof(sum)); if (r[i] & 1) odd += amt[i]; for (int j = r[i]; j <= min(k, n - k); j++) { if (!f[j] && f[j - r[i]] && sum[j - r[i]] < amt[i]) { f[j] = true; sum[j] = sum[j - r[i]] + 1; } } } minans = f[min(k, n - k)] ? k : k + 1; cnt = (n - odd) >> 1; if (k <= cnt) maxans = k << 1; else maxans = min(k + cnt, n); printf( %d %d , minans, maxans); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; string s; cin >> s; int i = 0, j = 0; int freq[2] = {0, 0}; int ans = 0; bool over = 0; while (j < n) { while (min(freq[0], freq[1]) <= k && j < n) { freq[s[j] - a ]++; if (min(freq[0], freq[1]) > k) { over = true; break; } j++; } ans = max(ans, j - i); if (over) { while (min(freq[0], freq[1]) > k) { freq[s[i] - a ]--; i++; } over = 0; j++; } } cout << ans; } |
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << : << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, , ); cerr.write(names, comma - names) << : << arg1 << | ; __f(comma + 1, args...); } const int L = 1e7 + 7; map<long long, long long> counter; int lps[L]; void pre() { lps[1] = 1; for (int i = 2; i < 10000001; ++i) { if (lps[i]) continue; for (int j = i; j <= 10000000; j += i) { lps[j] = i; } } return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long n, ans = 0; cin >> n; int tmp = sqrt(n); if (n % 2 == 0) { cout << n / 2; return 0; } for (long long i = 3; i <= tmp + 1; i += 2) { if (n % i == 0) { cout << (n - i) / 2 + 1; return 0; } } cout << 1 ; return 0; } |
#include <bits/stdc++.h> using namespace std; string s; int mark[1000006]; bitset<1000006> prime; void isprime() { prime.set(); for (int i = 2; i < 1000006; i++) { if (prime[i]) { for (int j = i + i; j < 1000006; j += i) prime[j] = false; } } } int main(void) { int n, m = 0; scanf( %d , &n); if (n == 4) { printf( YES n ); return 0 * printf( 1 n3 n2 n4 n ); } isprime(); if (!prime[n]) { return 0 * puts( NO ); } mark[1] = 1; for (int i = 2; i <= n; i++) { mark[i] = (long long)(n - n / i) * mark[n % i] % n; } mark[n] = n; puts( YES ); printf( 1 n ); for (int i = 2; i < n; i++) { printf( %d n , (int)((long long)i * mark[i - 1] % n)); } if (n != 1) printf( %d n , n); return 0; } |
#include <bits/stdc++.h> using namespace std; template <class T> bool umin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template <class T> bool umax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } int F[100009], arr[100009], ans[100009], imp[100009], pos[100009]; void upd(int x, int val) { for (; x; x -= x & (-x)) F[x] += val; } int tap(int x) { int res = 0; for (; x < 100009; x += x & (-x)) res += F[x]; return res; } set<int> s; int main() { int n; scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %d , arr + i), pos[arr[i]] = i; int all = 0; for (int i = 1; i <= n; i++) { int res = tap(arr[i]); if (!res) imp[i] = 1; else if (res == 1) { int val = *s.rbegin(); ans[pos[val]]++; } s.insert(arr[i]); upd(arr[i], +1); all += imp[i]; } int mx = -1, who; for (int i = 1; i <= n; i++) { int val = all - imp[i] + ans[i]; if (mx < val) mx = val, who = arr[i]; else if (mx == val) umin(who, arr[i]); } printf( %d n , who); return 0; } |
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); string s, str; int i, k, l, h, n; cin >> n; vector<string> v(n + 1); for (i = 1; i <= n; i++) cin >> v[i]; cin >> s; if (s.size() < 5) { cout << no ; return 0; } k = 0, h = 0; while (true) { if (!h) if (s[k] == < ) h = 1; if (h) if (s[k] == 3 ) break; k++; if (k == s.size()) { cout << no ; return 0; } } for (i = 1; i <= n; i++) { str = v[i]; int h = 0; while (true) { if (s[k] == str[h]) h++; if (h == str.size()) break; k++; if (k == s.size()) { cout << no ; return 0; } } h = 0; while (true) { if (!h) if (s[k] == < ) h = 1; if (h) if (s[k] == 3 ) break; k++; if (k == s.size()) { cout << no ; return 0; } } } cout << yes ; return 0; } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.