func_code_string
stringlengths 59
71.4k
|
---|
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 5; int vis[N], parent[N]; vector<int> v[N]; void dfs(int node) { vis[node] = 1; for (auto i : v[node]) { if (!vis[i]) { parent[i] = node; dfs(i); } } } int res[N]; int main() { int n, l, r, k = 0; scanf( %d , &n); parent[n] = n; for (int i = 1; i < n; ++i) { parent[i] = i; scanf( %d %d , &l, &r); v[l].push_back(r); v[r].push_back(l); k = max(k, max((int)v[l].size(), (int)v[r].size())); } k += 1; vector<int> col(k + 1); parent[1] = 1; dfs(1); memset(vis, 0, sizeof(vis)); queue<int> q; vis[1] = true; q.push(1); res[1] = 1; col[1] = true; while (!q.empty()) { int node = q.front(); q.pop(); col[res[parent[node]]] = true; col[res[node]] = true; int j = 1, x = (int)col.size(); for (auto i : v[node]) { if (!vis[i]) { q.push(i); while (j < x and col[j] == true) ++j; res[i] = j; col[j] = true; vis[i] = 1; } } for (auto i : v[node]) col[res[i]] = false; col[res[node]] = false; } printf( %d n , k); for (int i = 1; i <= n; ++i) printf( %d , res[i]); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 1e9 + 7; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int difference; int ans = 0; for (int i = 0; i < n - 1; i++) { if (a[i] + a[i + 1] < k) { difference = k - (a[i] + a[i + 1]); ans += difference; a[i + 1] = a[i + 1] + difference; } } cout << ans; cout << endl; ; for (int i = 0; i < n; i++) cout << a[i] << ; }
|
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; string s; cin >> s; vector<long long int> col; int zero = 0, one = 0; col.push_back(0); for (int i = 1; i < s.size(); i++) { if (s[i] >= s[zero]) { col.push_back(0); zero = i; } else { if (s[i] < s[one] && one != 0) { cout << NO ; return 0; } else { col.push_back(1); one = i; } } } cout << YES << n ; for (auto i : col) cout << i; return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int x, y; cin >> x >> y; if (y == 0) { cout << No << endl; return 0; } y = y - 1; if (y >= 1) { x = x - y; if (x >= 0 && x % 2 == 0) { cout << Yes << endl; } else { cout << No << endl; } } else { if (x == 0) { cout << Yes << endl; } else cout << No << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; bitset<1000001> L, R; vector<int> H1, H2, V1, V2, res; multiset<int> AA, BB; int A[1000], B[1000]; bool solve(int *A, int s, int e, int S) { int m = (s + e) >> 1; if (s == e || S == 0) { if (S) res.push_back(A[m]); return true; } for (int i = 0; i <= S; i++) L[i] = R[i] = 0; L[0] = R[0] = 1; for (int i = s; i <= m; i++) L |= L << A[i]; for (int i = e; i > m; i--) R |= R << A[i]; for (int i = 0; i <= S; i++) if (L[i] && R[S - i]) { solve(A, s, m, i); solve(A, m + 1, e, S - i); return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ((void)0); ((void)0); ((void)0); int T, N, M; for (cin >> T; T--;) { int H = 0, V = 0, x = 0, y = 0; cin >> N; AA.clear(); BB.clear(); for (int i = 0; i < N; i++) { cin >> A[i]; H += A[i]; AA.insert(A[i]); } cin >> M; for (int i = 0; i < M; i++) { cin >> B[i]; V += B[i]; BB.insert(B[i]); } if ((H & 1) || (V & 1) || N != M || N == 1 || M == 1) { cout << No n ; continue; } sort(A, A + N); sort(B, B + M); res.clear(); if (!solve(A, 0, N - 1, H / 2)) { cout << No n ; continue; } H1.clear(); H2.clear(); for (auto v : res) { H1.push_back(v); AA.erase(AA.find(v)); } for (auto v : AA) H2.push_back(v); res.clear(); if (!solve(B, 0, M - 1, V / 2)) { cout << No n ; continue; } V1.clear(); V2.clear(); for (auto v : res) { V1.push_back(v); BB.erase(BB.find(v)); } for (auto v : BB) V2.push_back(v); if (V1.size() > V2.size()) swap(V1, V2); if (H1.size() < H2.size()) swap(H1, H2); reverse(V1.begin(), V1.end()); reverse(V2.begin(), V2.end()); cout << Yes n ; for (auto &v : V1) v *= -1; for (auto &h : H2) H1.push_back(-h); for (auto v : V2) V1.push_back(v); for (int i = 0; i < N; i++) { y += V1[i]; cout << x << << y << n ; x += H1[i]; cout << x << << y << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; char board[2100][2100]; int mark[2100][2100]; class Graph { int V; list<int> *adj; bool isCyclicUtil(int v, bool visited[], bool *rs); public: Graph(int V); void addEdge(int v, int w); bool isCyclic(); }; Graph::Graph(int V) { this->V = V; adj = new list<int>[V]; } void Graph::addEdge(int v, int w) { adj[v].push_back(w); } bool Graph::isCyclicUtil(int v, bool visited[], bool *recStack) { if (visited[v] == false) { visited[v] = true; recStack[v] = true; list<int>::iterator i; for (i = adj[v].begin(); i != adj[v].end(); ++i) { if (!visited[*i] && isCyclicUtil(*i, visited, recStack)) return true; else if (recStack[*i]) return true; } } recStack[v] = false; return false; } bool Graph::isCyclic() { bool *visited = new bool[V]; bool *recStack = new bool[V]; for (int i = 0; i < V; i++) { visited[i] = false; recStack[i] = false; } for (int i = 0; i < V; i++) if (isCyclicUtil(i, visited, recStack)) return true; return false; } int move(int i, int j) { int i0 = i, j0 = j; if (board[i][j] == # ) return 0; int di = 0, dj = 0; if (mark[i][j] != 0) { return mark[i][j]; } di = 0; dj = 0; if (board[i][j] == v ) di = 1; if (board[i][j] == ^ ) di = -1; if (board[i][j] == > ) dj = 1; if (board[i][j] == < ) dj = -1; i += di; j += dj; if (mark[i][j] != 0) { mark[i0][j0] = mark[i][j] + 1; return mark[i][j] + 1; } else { int d = move(i, j); mark[i0][j0] = d + 1; return d + 1; } } bool check(int i1, int j1, int i2, int j2) { if (board[i1][j1] == # || board[i1][j2] == # ) return false; int di1 = 0, dj1 = 0, di2 = 0, dj2 = 0; while (board[i1][j1] != # || board[i2][j2] != # ) { di1 = 0; dj1 = 0, di2 = 0, dj2 = 0; if (board[i1][j1] == v ) di1 = 1; if (board[i1][j1] == ^ ) di1 = -1; if (board[i1][j1] == > ) dj1 = 1; if (board[i1][j1] == < ) dj1 = -1; i1 += di1; j1 += dj1; if (board[i2][j2] == v ) di2 = 1; if (board[i2][j2] == ^ ) di2 = -1; if (board[i2][j2] == > ) dj2 = 1; if (board[i2][j2] == < ) dj2 = -1; i2 += di2; j2 += dj2; if (i1 == i2 && j1 == j2) if (board[i1][j1] != # ) return false; } return true; } Graph g(2000 * 2000); int main() { int n, m, max = 0, val = 0, maxi[2000], maxj[2000], num = 0, cnt = 0; bool f = false; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> board[i][j]; if (board[i][j] == v && cnt < 10000) { g.addEdge(m * i + j, m * (i + 1) + j); cnt++; } if (board[i][j] == ^ && cnt < 10000) { g.addEdge(m * i + j, m * (i - 1) + j); cnt++; } if (board[i][j] == > && cnt < 10000) { g.addEdge(m * i + j, m * i + j + 1); cnt++; } if (board[i][j] == < && cnt < 10000) { g.addEdge(m * i + j, m * i + j - 1); cnt++; } } } if (g.isCyclic()) { cout << -1; return 0; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { val = move(i, j); if (val == max && !f && max != 0) { maxj[num] = j; maxi[num] = i; num++; } if (val > max) { max = val; maxi[0] = i; maxj[0] = j; num = 1; f = false; } } } if (max == 0) { cout << 0; return 0; } if (num > 1) f = check(maxi[0], maxj[0], maxi[1], maxj[1]); if (num > 2) { for (int i = 2; i < num; i++) { if (!f) { f = check(maxi[1], maxj[1], maxi[i], maxj[i]); } } } if (f) cout << max * 2; else cout << max * 2 - 1; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long n, x; long long k, count = 0; char c; cin >> n >> x; for (int i = 1; i <= n; i++) { cin >> c >> k; if (c == + ) { x += k; } else { if (x >= k) { x -= k; } else { count++; } } } cout << x << << count; return 0; }
|
#include <bits/stdc++.h> using namespace std; long int temp, i, j, k, T; int main() { int n, a, b; cin >> n >> a >> b; int h[2007]; for (i = 0; i < n; i++) cin >> h[i]; sort(h, h + n); int val = h[b - 1]; if (h[b] == val) cout << 0 << endl; else cout << h[b] - val << endl; return 0; }
|
#include <bits/stdc++.h> void unionInit(int d[], int s) { int i; for (i = 0; i < s; i++) d[i] = i; } int unionGet(int d[], int n) { int t = n, k; while (d[t] != t) t = d[t]; while (d[n] != n) k = d[n], d[n] = t, n = k; return n; } int unionConnect(int d[], int a, int b) { a = unionGet(d, a); b = unionGet(d, b); if (a == b) return 0; d[a] = b; return 1; } int main() { int i, j, k, l, m, n; int ind[110000]; int res; while (scanf( %d%d , &n, &m) == 2) { unionInit(ind, n); res = 1; while (m--) { scanf( %d%d , &i, &j); i--; j--; if (unionConnect(ind, i, j) == 0) res = (res * 2) % 1000000009; printf( %d n , (res + 1000000009 - 1) % 1000000009); } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); int ans = n; if (arr[0] == 0) { ans--; } for (int i = 1; i < n; i++) { if (arr[i] == 0) { ans--; } else if (arr[i] == arr[i - 1]) { ans--; } } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 105; struct ANS { int xa, ya, xb, yb, xc, yc; }; struct PRE { int p1, p2, s; } pre[MAXN][2][2]; int T, n, m; int a[MAXN][MAXN]; int f[MAXN][2][2]; char s[MAXN]; vector<ANS> ans; int popcount(int v) { return v ? popcount(v - (v & -v)) + 1 : 0; } void operate(int x, int y, int nx, int ny, bool flag = 0) { if (flag) ans.push_back((ANS){0, 0, 0, 0, 0, 0}); for (int i = 0; i <= 1; i++) for (int j = 0; j <= 1; j++) if (x + i != nx || j + y != ny) { if (flag) { if (ans.back().xa) { if (ans.back().xb) { ans.back().xc = x + i; ans.back().yc = y + j; } else { ans.back().xb = x + i; ans.back().yb = y + j; } } else { ans.back().xa = x + i; ans.back().ya = y + j; } } a[x + i][y + j] ^= 1; } } int main() { scanf( %d , &T); while (T--) { scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %s , s + 1); for (int j = 1; j <= m; j++) a[i][j] = s[j] - 0 ; } ans.clear(); for (int i = 1; i <= n - 2; i++) for (int j = 1; j <= m; j++) if (a[i][j]) { if (j < m) operate(i, j, i, j + 1, 1); else operate(i, j - 1, i, j - 1, 1); } for (int i = 1; i <= m; i++) for (int j = 0; j <= 1; j++) for (int k = 0; k <= 1; k++) f[i][j][k] = 1e9; f[1][a[n - 1][1]][a[n][1]] = 0; for (int i = 1; i < m; i++) for (int j = 0; j <= 1; j++) for (int k = 0; k <= 1; k++) if (f[i][j][k] != 1e9) { int t1 = a[n - 1][i], t2 = a[n][i]; a[n - 1][i] = j; a[n][i] = k; for (int l = 0; l < 16; l++) { if (l & 1) operate(n - 1, i, n - 1, i); if (l >> 1 & 1) operate(n - 1, i, n, i); if (l >> 2 & 1) operate(n - 1, i, n - 1, i + 1); if (l >> 3 & 1) operate(n - 1, i, n, i + 1); if (!a[n - 1][i] && !a[n][i] && f[i + 1][a[n - 1][i + 1]][a[n][i + 1]] > f[i][j][k] + popcount(l)) { f[i + 1][a[n - 1][i + 1]][a[n][i + 1]] = f[i][j][k] + popcount(l); pre[i + 1][a[n - 1][i + 1]][a[n][i + 1]] = (PRE){j, k, l}; } if (l & 1) operate(n - 1, i, n - 1, i); if (l >> 1 & 1) operate(n - 1, i, n, i); if (l >> 2 & 1) operate(n - 1, i, n - 1, i + 1); if (l >> 3 & 1) operate(n - 1, i, n, i + 1); } a[n - 1][i] = t1; a[n][i] = t2; } int t1 = 0, t2 = 0; for (int i = m; i > 1; i--) { int l = pre[i][t1][t2].s; if (l & 1) operate(n - 1, i - 1, n - 1, i - 1, 1); if (l >> 1 & 1) operate(n - 1, i - 1, n, i - 1, 1); if (l >> 2 & 1) operate(n - 1, i - 1, n - 1, i, 1); if (l >> 3 & 1) operate(n - 1, i - 1, n, i, 1); int n1 = pre[i][t1][t2].p1, n2 = pre[i][t1][t2].p2; t1 = n1; t2 = n2; } printf( %d n , (int)ans.size()); for (int i = 0; i < ans.size(); i++) printf( %d %d %d %d %d %d n , ans[i].xa, ans[i].ya, ans[i].xb, ans[i].yb, ans[i].xc, ans[i].yc); } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long int t, n; int main() { cin >> n >> t; long long int k = 0; long long int a, b; long long int res1 = 1; long long int res; cin >> a >> b; long long int m = (t - a) / b; if (a >= t) res = a; else if (m * b + a == t) res = t; else res = (m + 1) * b + a; for (int i = 1; i < n; i++) { cin >> a >> b; m = (t - a) / b; if (a >= t) { if (a < res) { res = a; res1 = i + 1; } } else if (m * b + a == t) { res = t; res1 = i + 1; } else if ((m + 1) * b + a < res) { res = (m + 1) * b + a; res1 = i + 1; } } cout << res1; }
|
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; const int man = 2e5 + 10; const long long mod = 1e9 + 7; struct edge { int v; int w; int next; } e[man << 1]; int head[man]; int cnt; void init(int n) { memset(head, 0, sizeof(int) * (n + 5)); cnt = 0; } void add(int u, int v, int w) { e[++cnt].next = head[u]; e[cnt].v = v; e[cnt].w = w; head[u] = cnt; } int vis[man]; int dfs(int u, int fa) { int num = 0; int cnt = 0; for (int i = head[u]; i; i = e[i].next) { if (e[i].v == fa) continue; ++cnt; int tp = dfs(e[i].v, u); num += tp; vis[i] = tp; } if (!cnt) num++; return num; } struct node { long long w; int cnt, va; bool operator<(const node &a) const { return 1ll * (va / 2 + va % 2) * cnt < 1ll * (a.va / 2 + a.va % 2) * a.cnt; } }; signed main() { int t; scanf( %d , &t); while (t--) { int n; long long s = 0; long long sum = 0; scanf( %d%lld , &n, &s); for (int i = 1; i < n; ++i) { int u, v, w; scanf( %d%d%d , &u, &v, &w); add(u, v, w); add(v, u, w); } dfs(1, 1); priority_queue<node> q; for (int i = 1; i <= cnt; ++i) { if (vis[i] == 0) continue; sum += 1ll * e[i].w * vis[i]; q.push(node{1ll * e[i].w * vis[i], vis[i], e[i].w}); } if (sum <= s) { cout << 0 << n ; } else { int cnt = 0; while (q.size()) { node tp = q.top(); q.pop(); ++cnt; int tpva = tp.va / 2 + tp.va % 2; sum -= 1ll * tpva * tp.cnt; tp.va -= tpva; tp.w = 1ll * tp.cnt * tp.va; if (tp.va) q.push(tp); if (sum <= s) break; } cout << cnt << n ; } memset(vis, 0, sizeof(int) * (cnt + 5)); init(n); } return 0; }
|
#include <queue> #include <cstdio> #include <algorithm> const int Maxn=200; const int Maxl=40; const int Mod=998244353; int n,m; namespace Trie{ struct Trie_Node{ int ch[26]; bool pos; }node[Maxl+5]; int id_tot; void insert(char *s,int len){ int root=0; for(int i=1;i<=len;i++){ if(node[root].ch[s[i]- a ]==0){ node[root].ch[s[i]- a ]=++id_tot; } root=node[root].ch[s[i]- a ]; } node[root].pos=1; } } struct Node{ int id,x,y; Node(int _id=0,int _x=0,int _y=0){ id=_id,x=_x,y=_y; } }; std::queue<Node> q; int id[Maxl+5][Maxl+5],id_tot; int get_id(int x,int y){ if(x>y){ std::swap(x,y); } if(id[x][y]==0){ id[x][y]=++id_tot; q.push(Node(id[x][y],x,y)); } return id[x][y]; } struct Matrix{ int a[Maxn+5][Maxn+5]; void init(){ for(int i=1;i<=id_tot;i++){ for(int j=1;j<=id_tot;j++){ a[i][j]=0; } } } friend Matrix operator *(Matrix a,Matrix b){ Matrix ans; ans.init(); for(int i=1;i<=id_tot;i++){ for(int k=1;k<=id_tot;k++){ for(int j=1;j<=id_tot;j++){ ans.a[i][j]=(ans.a[i][j]+1ll*a.a[i][k]*b.a[k][j])%Mod; } } } return ans; } }g; int main(){ scanf( %d%d ,&n,&m); for(int i=1;i<=n;i++){ static char s[Maxl+5]; scanf( %s ,s+1); int len=0; while(s[++len]!= 0 ); len--; Trie::insert(s,len); } get_id(0,0); while(!q.empty()){ Node u=q.front(); q.pop(); for(int i=0;i<26;i++){ int a=Trie::node[u.x].ch[i],b=Trie::node[u.y].ch[i]; if(a==0||b==0){ continue; } g.a[u.id][get_id(a,b)]++; if(Trie::node[a].pos){ g.a[u.id][get_id(0,b)]++; } if(Trie::node[b].pos){ g.a[u.id][get_id(a,0)]++; } if(Trie::node[a].pos&&Trie::node[b].pos){ g.a[u.id][get_id(0,0)]++; } } } Matrix ans; ans.init(); for(int i=1;i<=id_tot;i++){ ans.a[i][i]=1; } while(m){ if(m&1){ ans=ans*g; } g=g*g; m>>=1; } printf( %d n ,ans.a[1][1]); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, k, m, x, y, ans; bool b; int main() { scanf( %d%d , &n, &k); ans = n * 2 - k - 1; for (int i = 1; i <= k; i++) { scanf( %d , &m); b = 0; for (int j = 1; j <= m; j++) { scanf( %d , &x); if (j == 1 && x == 1) b = 1; if ((b) && j > 1 && x > y + 1) { ans -= (j - 2) * 2; b = 0; } if ((b) && j == m) ans -= (m - 1) * 2; y = x; } } printf( %d , ans); }
|
#include <bits/stdc++.h> using namespace std; const int N = -1; const int INF = 1.01e9; const int MOD = 1e9 + 7; long long rev(long long a, long long m) { if (a == 0) return 0; return ((1 - rev(m % a, a) * m) / a + m) % m; } int main() { int n, k; scanf( %d%d , &n, &k); vector<long long> fact(n + 1); fact[0] = 1; for (int i = 1; i <= n; i++) { fact[i] = (fact[i - 1] * i) % MOD; } vector<long long> rfact(n + 1); rfact[n] = rev(fact[n], MOD); assert(fact[n] * rfact[n] % MOD == 1); for (int i = n - 1; i >= 0; i--) { rfact[i] = (rfact[i + 1] * (i + 1)) % MOD; } auto getC = [&](int nn, int kk) { assert(0 <= kk && kk <= nn); return fact[nn] * rfact[kk] % MOD * rfact[nn - kk] % MOD; }; vector<long long> f(n + 1); vector<long long> g(n + 1); vector<long long> prefG(n + 1); f[1] = 1; g[1] = 1; prefG[1] = 1; for (int i = 2; i <= n; i++) { long long tmp = prefG[i - 1]; if (i - k - 1 >= 1) { tmp = (tmp - prefG[i - k - 1] + MOD) % MOD; } tmp = (tmp * fact[i - 2]) % MOD; f[i] = tmp; g[i] = f[i] * rfact[i - 1] % MOD; prefG[i] = (prefG[i - 1] + g[i]) % MOD; } long long answer = 0; for (int i = 1; i <= n; i++) { answer = (answer + getC(n - 1, i - 1) * f[i] % MOD * fact[n - i]) % MOD; } cout << (fact[n] - answer + MOD) % MOD << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; int paths[5001][5001]; int ct[5001], top[5001], freq[5001]; int main() { for (int i = 2; i <= 5000; i++) { for (int j = 2; j <= 5000; j++) { paths[i][j] = paths[i - 1][j]; } int tmp = i; for (int j = 2; j <= sqrt(tmp); j++) { while (tmp > 0 && tmp % j == 0) { tmp /= j; paths[i][j]++; } } if (tmp > 1) paths[i][tmp]++; } ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { int k; cin >> k; ct[k]++; } long long sol = 0; fill(top, top + 5001, 1); for (int i = 1; i <= 5000; i++) { if (!ct[i]) continue; for (int j = 1; j <= 5000; j++) { sol += 1LL * paths[i][j] * ct[i]; if (paths[i][j]) top[i] = j; } } while (true) { memset(freq, 0, sizeof freq); for (int i = 1; i <= 5000; i++) { if (!ct[i]) continue; freq[top[i]] += ct[i]; } int most = max_element(freq, freq + 5001) - freq; if (freq[most] * 2 <= n || most == 1) break; sol -= freq[most]; sol += n - freq[most]; for (int i = 1; i <= 5000; i++) { if (top[i] != most) { top[i] = 1; } if (top[i] == 1) continue; paths[i][top[i]]--; while (top[i] > 1 && paths[i][top[i]] == 0) { top[i]--; } } } cout << sol << n ; }
|
#include <bits/stdc++.h> using namespace std; using namespace std; int main() { long long int k, b, n, t; while (cin >> k >> b >> n >> t) { long long int s = 1; long long int cas = 0; while (s <= t && cas < n) { s = s * k + b; cas++; } if (cas == n && s <= t) cout << 0 << endl; else cout << n - cas + 1 << endl; } return 0; }
|
#include <bits/stdc++.h> const int maxn = 100005; int nbs[maxn], ev[maxn * 2], next[maxn * 2], color[maxn], d[maxn], ans[maxn], size[2], view[maxn], n, m, k; void addedge(int x, int y) { next[++k] = nbs[x]; ev[k] = y; nbs[x] = k; } void init() { scanf( %d%d , &n, &m); for (int i = 0; i < m; ++i) { int x, y; scanf( %d%d , &x, &y); addedge(x, y); addedge(y, x); ++d[x]; ++d[y]; } } void dfs(int x, int col) { color[x] = col; ++size[col]; for (int i = nbs[x]; i; i = next[i]) { if (color[ev[i]] == -1) dfs(ev[i], col ^ 1); } } void output(int x) { int y = 0; for (int i = 1; i <= n; ++i) { if (!ans[i] && color[i] == 0) { ans[i] = x; ++y; if (y % 3 == 0) ++x; } } for (int i = 1; i <= n; ++i) { if (!ans[i] && color[i] == 1) { ans[i] = x; ++y; if (y % 3 == 0) ++x; } } printf( YES n ); for (int i = 1; i <= n; ++i) printf( %d , ans[i]); printf( n ); } void solve(int x, int y = 1) { memset(view, 0, sizeof(view)); ans[x] = y; for (int i = nbs[x]; i; i = next[i]) view[ev[i]] = 1; int k = 0; for (int i = 1; i <= n && k < 2; ++i) { if (!ans[i] && color[i] != color[x] && !view[i]) { ans[i] = y; ++k; } } } void work() { memset(color, -1, sizeof(color)); for (int i = 1; i <= n; ++i) { if (color[i] == -1) dfs(i, 0); } if (size[0] % 3 == 0) output(1); else { int col = size[0] % 3 - 1, find = 0; for (int i = 1; i <= n && !find; ++i) { if (color[i] == col && d[i] + 2 <= size[col ^ 1]) { solve(i); find = 1; } } if (find) output(find + 1); else { col ^= 1; int t = 0; for (int i = 1; i <= n && find < 2; ++i) { if (color[i] == col && d[i] + 2 <= size[col ^ 1]) { solve(i, find + 1); ++find; } } if (find == 2) output(find + 1); else printf( NO n ); } } } int main() { init(); work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> s(n), r(n); for (int i = 0; i < n; i++) { cin >> s[i] >> r[i]; } vector<tuple<int, int, int>> T(n); for (int i = 0; i < n; i++) { T[i] = make_tuple(s[i], r[i], i); } sort(T.begin(), T.end(), greater<tuple<int, int, int>>()); vector<int> id(n); for (int i = 0; i < n; i++) { s[i] = get<0>(T[i]); r[i] = get<1>(T[i]); id[i] = get<2>(T[i]); } int mx = -1, ms = -1; vector<int> s2, r2, id2; vector<vector<int>> p; int n2 = 0; for (int i = 0; i < n; i++) { if (r[i] > mx) { mx = r[i]; ms = s[i]; s2.push_back(s[i]); r2.push_back(r[i]); id2.push_back(id[i]); p.push_back(vector<int>(0)); n2++; } else if (r[i] == mx && s[i] == ms) { p.back().push_back(id[i]); } } stack<int> st; st.push(0); if (n2 > 1) { st.push(1); } for (int i = 2; i < n2; i++) { while (st.size() >= 2) { int b = st.top(); st.pop(); int a = st.top(); st.pop(); long long A = (long long)s2[i] * r2[a] * (r2[b] - r2[i]) * (s2[b] - s2[a]); long long B = (long long)s2[a] * r2[i] * (r2[a] - r2[b]) * (s2[i] - s2[b]); if (A <= B) { st.push(a); st.push(b); break; } else { st.push(a); } } st.push(i); } vector<int> ans; while (!st.empty()) { int x = st.top(); st.pop(); ans.push_back(id2[x]); for (int y : p[x]) { ans.push_back(y); } } sort(ans.begin(), ans.end()); int cnt = ans.size(); for (int i = 0; i < cnt; i++) { cout << ans[i] + 1; if (i < cnt - 1) { cout << ; } } cout << endl; }
|
#include <bits/stdc++.h> #define MULTI_TEST false #define int long long #define double long double //#pragma GCC optimize( Ofast ) //#pragma GCC optimize( no-stack-protector ) //#pragma GCC optimize( unroll-loops ) //#pragma GCC target( sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native ) #define all(x) x.begin(), x.end() using namespace std; const int INF = 1e18; int n, k; vector<vector<int>> g; vector<int> p; vector<int> chainp, chainc; vector<vector<int>> chains; vector<vector<int>> g1; vector<int> tin, tout; vector<int> group; vector<int> used, used1; vector<int> ts; int timer = 1; int bad = 0; void dfs(int v) { used[v] = 1; int x = chainc[v]; if (used[x] == 1) { bad = 1; return; } if (used[x] == 0) { dfs(x); } used[v] = 2; } void dfs1(int v) { used1[v] = 1; for (auto &x: g1[v]) { if (used1[x] == 1) { bad = 1; return; } if (used1[x] == 0) { dfs1(x); } } used1[v] = 2; ts.push_back(v); } void solve() { cin >> n >> k; p.resize(n); g.resize(n); tin.resize(n, -1); tout.resize(n, -1); chainp.resize(n, -1); chainc.resize(n, -1); int q = 0; for (int i = 0; i < n; i++) { int x; cin >> x; x--; p[i] = x; } for (int i = 0; i < k; i++) { int x, y; cin >> x >> y; x--; y--; chainp[y] = x; chainc[x] = y; } used.resize(n, 0); used1.resize(n, 0); group.resize(n, -1); for (int i = 0; i < n; i++) { if (used[i] == 0) dfs(i); } if (bad == 1) { cout << 0; return; } for (int i = 0; i < n; i++) { if (chainp[i] == -1) { chains.emplace_back(); int v = i; group[v] = chains.size() - 1; chains.back().push_back(v); while (chainc[v] != -1) { v = chainc[v]; group[v] = chains.size() - 1; chains.back().push_back(v); } } } g1.resize(chains.size()); for (int i = 0; i < n; i++) { if (p[i] != -1) { int x = p[i]; if (group[x] != group[i]) { g1[group[x]].push_back(group[i]); } } } for (int i = 0; i < g1.size(); i++) { if (used1[i] == 0) { dfs1(i); } } reverse(all(ts)); vector<int> fin; if (bad == 1) { cout << 0; return; } for (auto &x: ts) { for (auto &y: chains[x]) { fin.push_back(y); } } map<int, int> topos; for (int i = 0; i < n; i++) { topos[fin[i]] = i; } for (int i = 0; i < n; i++) { if (p[i] != -1) { int x = i; int y = p[i]; if (topos[y] > topos[x]) bad = 1; } } if (bad == 1) { cout << 0; return; } for (auto &x: fin) { cout << x + 1 << ; } } signed main() { cin.tie(0); ios::sync_with_stdio(false); #ifdef DEBUG freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); #endif int t = 1; if (MULTI_TEST) cin >> t; while (t--) solve(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, i, j; char c = W ; cin >> t; for (i = 0; i < t; i++) { for (j = 0; j < t; j++) { cout << c; if (c == B ) c = W ; else c = B ; } if (t % 2 == 0) { if (c == B ) c = W ; else c = B ; } cout << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000 * 1000 * 1000 + 7; inline long long mod(long long n) { if (n < 0) { return (n % MOD + MOD) % MOD; } else { return n % MOD; } } long long fp(long long a, long long p) { long long ans = 1, cur = a; for (long long i = 0; (1ll << i) <= p; ++i) { if ((p >> i) & 1) ans = mod(ans * cur); cur = mod(cur * cur); } return ans; } long long dv(long long a, long long b) { return mod(a * fp(b, MOD - 2)); } const long long N = 103; long long m[N][N], ans[N][N], t[N][N]; void add(long long a[N][N], long long b[N][N]) { for (long long i = 0; i < N; ++i) { for (long long j = 0; j < N; ++j) { t[i][j] = 0; } } for (long long i = 0; i < N; ++i) { for (long long j = 0; j < N; ++j) { for (long long k = 0; k < N; ++k) { t[i][j] = mod(t[i][j] + a[i][k] * b[k][j]); } } } for (long long i = 0; i < N; ++i) { for (long long j = 0; j < N; ++j) { a[i][j] = t[i][j]; } } } void pw(long long p) { for (long long i = 0; i < N; ++i) ans[i][i] = 1; for (long long i = 0; (1ll << i) <= p; ++i) { if ((p >> i) & 1) add(ans, m); add(m, m); } } bool a[N]; long long cnt[2]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); long long n, k; cin >> n >> k; for (long long i = 0; i < n; ++i) { cin >> a[i]; ++cnt[a[i]]; } long long l = cnt[0]; long long r = n - l; long long op = n * (n - 1) / 2; for (long long l1 = 0; l1 <= cnt[0] && l1 <= cnt[1]; ++l1) { long long l0 = l - l1; long long r0 = cnt[0] - l0; long long r1 = cnt[1] - l1; m[l1][l1] = op; if (l1) { m[l1][l1 - 1] = mod(l1 * r0); m[l1][l1] = mod(m[l1][l1] - m[l1][l1 - 1]); } m[l1][l1 + 1] = mod(l0 * r1); m[l1][l1] = mod(m[l1][l1] - m[l1][l1 + 1]); } pw(k); long long sum = 0; for (long long i = 0; i < l; ++i) sum += a[i]; cout << dv(ans[sum][0], fp(op, k)) << n ; }
|
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; const long double EPS = 1e11; const long long INFL = 1e16; const int INF = 1e9 + 7; mt19937 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count()); int highdig(long long x) { int ans = 0; while (x > 0LL) { x /= 2LL; ++ans; } return ans; } long long umen(long long x, vector<long long>& ea, vector<long long>& eb, vector<char>& ec) { long long cx = x; long long highdigx = 1; while (highdigx * 2LL <= x) { highdigx *= 2LL; } while (cx % highdigx != 0LL) { ea.push_back(cx); eb.push_back(cx); ec.push_back( + ); cx *= 2LL; } ea.push_back(x); ea.push_back(x); eb.push_back(cx); eb.push_back(cx); ec.push_back( + ); ec.push_back( ^ ); long long y2 = cx + x; long long y3 = (cx ^ x); ea.push_back(y2); eb.push_back(y3); ec.push_back( ^ ); cx = (y2 ^ y3); while (highdig(cx) > highdig(x)) { long long ccx = x; while (highdig(ccx) < highdig(cx)) { ea.push_back(ccx); eb.push_back(ccx); ec.push_back( + ); ccx *= 2LL; } ea.push_back(cx); eb.push_back(ccx); ec.push_back( ^ ); cx ^= ccx; } while (highdig(cx) < highdig(x)) { ea.push_back(cx); eb.push_back(cx); ec.push_back( + ); cx *= 2LL; } ea.push_back(x); eb.push_back(cx); ec.push_back( ^ ); while ((x ^ cx) % 2 == 0) { cx = cx; } return (x ^ cx); } long long trie(long long x, vector<long long>& ea, vector<long long>& eb, vector<char>& ec) { ea.push_back(x); eb.push_back(x); ec.push_back( + ); long long y1 = x * 2LL; ea.push_back(x); eb.push_back(y1); ec.push_back( + ); long long y2 = x + y1; ea.push_back(y1); eb.push_back(y1); ec.push_back( + ); ea.push_back(y2); eb.push_back(y1 * 2LL); ec.push_back( ^ ); long long y3 = (y2 ^ (2 * y1)); ea.push_back(y2); eb.push_back(y3); ec.push_back( + ); long long y4 = y2 + y3; ea.push_back(2 * y1); eb.push_back(y4); ec.push_back( ^ ); for (long long cd = 2LL; x > 1LL; cd *= 2LL) { ea.push_back(x); eb.push_back(cd); ec.push_back( ^ ); ea.push_back(cd); eb.push_back(cd); ec.push_back( + ); x ^= cd; } return 1LL; } void solve() { long long x; cin >> x; vector<long long> ea, eb; vector<char> ec; while (x > 1LL) { if ((x & (x + 1LL)) > 0LL) { x = umen(x, ea, eb, ec); } else { x = trie(x, ea, eb, ec); } } cout << ea.size() << n ; for (int i = 0; i < ea.size(); ++i) { cout << ea[i] << << ec[i] << << eb[i] << n ; } } int main() { int t = 1; for (int i = 0; i < t; ++i) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { long long int n, i; cin >> n; i = 1; while (n % i == 0) { i = i * 3; } cout << n / i + 1; }
|
#include <bits/stdc++.h> int temp[500000], a[500000], indices[500000], increments[500000], previous_appearance[500000], numbers_equal_c[500000]; void mergesort(int Array[], int indices[], int first, int last) { if (first == last) return; int middle = (first + last) / 2; mergesort(Array, indices, first, middle); mergesort(Array, indices, middle + 1, last); int i, j, k; for (i = first, j = first, k = middle + 1; i <= last; i++) { if (j == middle + 1) temp[i] = indices[k++]; else if (k == last + 1) temp[i] = indices[j++]; else if (Array[indices[k]] < Array[indices[j]]) temp[i] = indices[k++]; else temp[i] = indices[j++]; } for (i = first; i <= last; i++) { indices[i] = temp[i]; } } int main() { int n, i, one_counter = 0, c, maximum_increament = 0, number_equal_to_c = 0; scanf( %d %d , &n, &c); for (i = 0; i < n; i++) { scanf( %d , &a[i]); indices[i] = i; previous_appearance[i] = -1; numbers_equal_c[i] = 0; increments[i] = 0; } mergesort(a, indices, 0, n - 1); for (i = 1; i < n; i++) { if (a[indices[i]] == a[indices[i - 1]]) { previous_appearance[indices[i]] = indices[i - 1]; } } for (i = 0; i < n; i++) { if (a[i] == c) { number_equal_to_c++; } else { if (previous_appearance[i] == -1 || increments[previous_appearance[i]] - number_equal_to_c + numbers_equal_c[previous_appearance[i]] + 1 <= 0) increments[i] = 1; else increments[i] = increments[previous_appearance[i]] - number_equal_to_c + numbers_equal_c[previous_appearance[i]] + 1; if (maximum_increament < increments[i]) maximum_increament = increments[i]; } numbers_equal_c[i] = number_equal_to_c; } printf( %d , number_equal_to_c + maximum_increament); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, k; cin >> n >> k; int ans = n; for (int i = 1; i * i <= n; i++) if (n % i == 0) { if (i <= k) ans = min(ans, n / i); if (n / i <= k) ans = min(ans, i); } cout << ans << endl; } }
|
#include <bits/stdc++.h> using namespace std; int main() { int t, s, x; scanf( %d%d%d , &t, &s, &x); if (x < t) { puts( NO ); return 0; } int temp = (x - t) % s; if (temp == 0 || temp == 1) { if (x == t + 1) puts( NO ); else puts( YES ); } else puts( NO ); return 0; }
|
#include <bits/stdc++.h> using namespace std; set<long long int> s; int main() { long long int n, m, i, ans = 0; cin >> n >> m; long long int a[n], c[200005] = {0}; for (i = 0; i < m; i++) s.insert(i); for (i = 0; i < n; i++) { long long int d, x; cin >> a[i]; d = a[i] % m; if (d > *s.rbegin()) x = *s.begin(); else x = *s.lower_bound(d); if (++c[x] == n / m) s.erase(x); ans += (x - d + m) % m; a[i] += (x - d + m) % m; } cout << ans << endl; for (i = 0; i < n; i++) cout << a[i] << ; }
|
#include <bits/stdc++.h> using namespace std; #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) const long long mod = 1e9 + 7; inline long long add(long long a, long long b) { return (a % mod + b % mod) % mod; } inline long long sub(long long a, long long b) { return (a % mod - b % mod + mod) % mod; } inline long long mul(long long a, long long b) { return (a % mod * b % mod) % mod; } inline long long power(long long a, long long b, long long MOD) { long long res = 1; while (b) { if (b & 1) { res *= a; res %= MOD; } a = a * a; a %= MOD; b >>= 1; } return res; } clock_t time_p = clock(); void time() { time_p = clock() - time_p; cerr << Time elapsed : << (long double)(time_p) / CLOCKS_PER_SEC << n ; } bool go(string a, string b) { if (a == b) return true; long long n1 = a.length(); long long n2 = b.length(); if (n1 & 1 || n2 & 1) return false; string a1, a2, b1, b2; for (long long i = 0; i < n1 / 2; i++) a1 += a[i]; for (long long i = n1 / 2; i < n1; i++) a2 += a[i]; for (long long i = 0; i < n2 / 2; i++) b1 += b[i]; for (long long i = n2 / 2; i < n2; i++) b2 += b[i]; if (go(a1, b2) && go(a2, b1)) return true; if (go(a1, b1) && go(a2, b2)) return true; return false; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; string a, b; cin >> a >> b; cout << (go(a, b) ? YES : NO ) << n ; time(); return 0; }
|
#include <bits/stdc++.h> using namespace std; char s[200005]; int main() { int l, t; scanf( %d %d , &l, &t); scanf( %s , s + 1); s[0] = 0 ; for (int i = 0; i <= l; i++) { if (s[i] == . ) { for (int j = i + 1; j <= l; j++) if (s[j] >= 5 ) { s[j] = 0; bool roundup = true; t--; for (int k = j - 1; k > i; k--) { if (roundup) { s[k]++; if (s[k] >= 5 && t) { s[k] = 0; t--; roundup = true; } else roundup = false; } } if (roundup) { s[i] = 0; for (int k = i - 1; k >= 0; k--) { s[k]++; if (s[k] <= 9 ) break; else s[k] = 0 ; } } break; } } } if (s[0] != 0 ) { printf( %s n , s); } else { printf( %s n , s + 1); } }
|
#include <bits/stdc++.h> using namespace std; long long n, m, k, d[5][2][100][100], kk; int a[100][100]; bool was[100][100], done = false, was2[100][100][2][5]; string s; int main() { cin >> n >> k; for (int i = 0; i < n; i++) { cin >> s; m = s.length(); for (int j = 0; j < m; j++) { a[i][j] = s[j] - 0 ; if (a[i][j] == 0) was[i][j] = true; } } for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (!was[i][j]) { int ii = i, jj = j; while (jj < m && a[i][jj] == a[i][j] && ii < n && a[ii][j] == a[i][j]) jj++, ii++; while (ii < n && a[ii][j] == a[i][j]) ii++; ii--; while (jj < m && a[i][jj] == a[i][j]) jj++; jj--; for (int g = i; g <= ii; g++) for (int h = j; h <= jj; h++) { was[g][h] = true; d[1][0][g][h] = ii * 100 + jj; d[1][1][g][h] = i * 100 + jj; d[2][0][g][h] = ii * 100 + j; d[2][1][g][h] = ii * 100 + jj; d[3][0][g][h] = i * 100 + j; d[3][1][g][h] = ii * 100 + j; d[4][0][g][h] = i * 100 + jj; d[4][1][g][h] = i * 100 + j; } } int in = 0, jn = 0, cp = 1, dp = 1, iin, jjn; kk = k; was2[0][0][1][1] = true; while (k) { bool flag = false; k--; iin = in, jjn = jn; in = d[dp][cp][iin][jjn] / 100; jn = d[dp][cp][iin][jjn] % 100; if (dp == 1 && jn < m - 1 && a[in][jn + 1] != 0) jn++, flag = true; else if (dp == 2 && in < n - 1 && a[in + 1][jn] != 0) in++, flag = true; else if (dp == 3 && jn > 0 && a[in][jn - 1] != 0) jn--, flag = true; else if (dp == 4 && in > 0 && a[in - 1][jn] != 0) in--, flag = true; if (!flag) if (cp == 1) cp = 0; else cp = 1, dp = dp % 4 + 1; if (was2[in][jn][cp][dp] && !done) k = k % (kk - k), done = true; } cout << a[in][jn]; return 0; }
|
#include <bits/stdc++.h> using namespace std; string rep(char c, int x) { string ret = ; for (int i = 0; i < x; i++) { ret += c; } return ret; } int main() { int n, k; cin >> n >> k; if (n == k) { string ans = ; for (int i = 0; i < n; i++) { ans += 0 ; } cout << ans << endl; return 0; } else if (k == 1) { string ans = 1 + rep( 0 , n - 1); cout << ans << endl; return 0; } else { int diff = n - k; string repl = 1 + rep( 0 , diff / 2); string ans = ; while (true) { if (ans.size() + repl.size() > n) { break; } ans += repl; } int rem = n - ans.size(); for (int i = 0; i < rem; i++) { ans += repl[i]; } cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> c >> d; int x, y, i; if (b * c > a * d) { x = b * c - a * d; y = b * c; } else { x = a * d - b * c; y = a * d; } while (1) { int k = 0; for (i = 2; i <= x; i++) { if (x % i == 0 && y % i == 0) { x = x / i; y = y / i; k++; } } if (k == 0) break; } if (x == 0) cout << x << / << 1 ; else cout << x << / << y; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int Mod = 1000000007; int N; struct M { int a[250][250]; M() { memset(a, 0, sizeof(a)); } }; M I() { M res; for (int i = 0; i < N; i++) res.a[i][i] = 1; return res; } M operator*(const M& a, const M& b) { M ans; for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) ans.a[i][j] = (ans.a[i][j] + 1ll * a.a[i][k] * b.a[k][j]) % Mod; return ans; } int k, m; int id(int x, int y) { return x * (1 << m) + y; } M fpow(M a, int b) { M ans = I(), t = a; while (b) { if (b & 1) ans = ans * t; t = t * t; b >>= 1; } return ans; } int cnt(int x) { int ans = 0; while (x) { ans += (x & 1); x >>= 1; } return ans; } int main() { int n; scanf( %d %d %d , &n, &k, &m); N = (k + 1) * (1 << m); M S, T; S.a[0][0] = 1; for (int c = 0; c <= k; c++) for (int s = 0; s < (1 << m); s++) { T.a[id(c, s)][id(c, s >> 1)]++; if (c < k) T.a[id(c, s)][id(c + 1, (s >> 1) | (1 << (m - 1)))] += cnt(s) + 1; } S = S * fpow(T, n); int ans = 0; for (int s = 0; s < (1 << m); s++) ans = (ans + S.a[0][id(k, s)]) % Mod; printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, v; cin >> n >> v; vector<vector<int> > mat(n + 1, vector<int>(v + 1, INT_MAX)); for (int i = 1, j = 0; j <= v; j++) { mat[i][j] = j; } for (int i = 2; i <= n; i++) { for (int j = 0; j <= v; j++) { if (j < v) { mat[i][j] = mat[i - 1][j + 1]; } else { mat[i][j] = mat[i][j - 1] + i; } } } cout << mat[n][0] << endl; return 0; }
|
#include <bits/stdc++.h> int n; double sum, tmp, ans; int main() { scanf( %d , &n); for (int div = 1; div <= n; div++) { scanf( %lf , &tmp); sum += tmp; if (sum / div > ans) ans = sum / div; } printf( %.20lf n , ans); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(); cout.tie(0); long long n, p = 0, q = 0, l = 0, i, flag = 0, k, m, t, j, r = 0, curr = 0, d; cin >> n >> m; long long a[n], b[n]; for (long long i = 0; i < n; i++) { cin >> a[i]; } for (long long i = 0; i < n; i++) { cin >> b[i]; } if (a[0] == 0) { cout << NO ; return 0; } if (a[0] != 0) { if (a[m - 1] != 0) { cout << YES ; return 0; } } if (a[m - 1] == 0) { for (long long i = m; i < n; i++) { if (a[i] == 1 && b[i] == 1) { if (b[m - 1] == 1) { flag = 1; break; } } } } if (flag == 1) { cout << YES ; return 0; } cout << NO ; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long Mo = 1000000007LL; long long f[60][60], g[60][60]; long long fac[70], inv[70]; int n, m; void add(long long &a, long long b) { a += b; a %= Mo; } long long fpm(long long a, long long b) { long long ans = 1LL; for (; b; b >>= 1) { if (b & 1LL) ans *= a, ans %= Mo; a *= a; a %= Mo; } return ans; } long long C(long long a, long long b) { a += b - 1; a %= Mo; if (a < b) return 0LL; long long ans = 1LL; for (int i = a; i > a - b; i--) ans = ans * i % Mo; ans *= inv[b]; return ans % Mo; } void solve() { f[2][1] = 1; for (int i = 1; i <= 52; i++) { for (int x = 2; x <= i + 1; x++) { int y = i + 3 - x; for (int a = 1; a <= x; a++) for (int b = 1; b <= y; b++) add(g[i][min(a, b)], f[x][a] * f[y][b]); } for (int x = 1; x <= i; x++) for (int j = 52; j >= 2; j--) { for (int k = 1; k * i + 2 <= j; k++) { for (int y = x * k; y <= j; y++) add(f[j][y], f[j - i * k][y - x * k] * C(g[i][x], k)); } } } } int main() { fac[0] = 1; for (int i = 1; i <= 60; i++) fac[i] = (fac[i - 1] * (long long)i) % Mo; for (int i = 0; i <= 60; i++) inv[i] = fpm(fac[i], Mo - 2LL); scanf( %d %d , &n, &m); solve(); cout << f[n + 2][m] << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 0x20202020; const int mod = 1000000007; inline void read(int &x) { char ch; bool f = 0; int a = 0; while (!((((ch = getchar()) >= 0 ) && (ch <= 9 )) || (ch == - ))) ; if (ch != - ) a *= 10, a += ch - 0 ; else f = 1; while (((ch = getchar()) >= 0 ) && (ch <= 9 )) a *= 10, a += ch - 0 ; if (f) a = -a; x = a; } const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1}; long long powmod(long long a, long long b) { long long res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } long long powmod(long long a, long long b, long long mod) { long long res = 1; a %= mod; for (; b; b >>= 1) { if (b & 1) res = res * a % mod; a = a * a % mod; } return res; } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } const int N = 111111, M = 111111; int l, m, n, t, tot; struct zcc { int x, v; } a[N]; inline bool cmp(const zcc &a, const zcc &b) { return a.v < b.v; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) scanf( %d , &a[i].v), a[i].x = i, tot += a[i].v; sort(a + 1, a + 1 + n, cmp); if (n == 1 && m == tot) { puts( Yes ); for (int i = 1; i <= 2 * a[1].v - 1; ++i) printf( %d , a[1].x); printf( %d n , a[1].x); } else if (n >= 2 && m >= 2 && m <= tot) { puts( Yes ); while (m > 2) { if (a[1].v > 1) a[1].v--, printf( %d %d , a[1].x, a[1].x), m--; else if (a[n].v) a[n].v--, printf( %d %d , a[n].x, a[n].x), m--; else n--; } if (a[2].v) { a[2].v--; a[1].v--; printf( %d , a[1].x); for (int i = 2; i <= n; ++i) for (int j = 1; j <= a[i].v; ++j) printf( %d %d , a[i].x, a[i].x); printf( %d , a[1].x); printf( %d , a[2].x); for (int i = 1; i <= a[1].v; ++i) printf( %d %d , a[1].x, a[1].x); printf( %d n , a[2].x); } else { printf( %d %d n , a[1].x, a[1].x); } } else if (n >= 2 && m == 1 && a[1].v == 1) { puts( Yes ); printf( %d , a[1].x); for (int i = 2; i <= n; ++i) for (int j = 1; j <= a[i].v; ++j) printf( %d %d , a[i].x, a[i].x); printf( %d n , a[1].x); } else puts( No ); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, i, j, x; long long sum; char s[30]; vector<int> a; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) { scanf( %s , s); if (s[0] == s ) { sum = 0; for (j = 2; j < a.size(); j += 5) { sum += a[j]; } cout << sum; printf( n ); } else { scanf( %d , &x); if (s[0] == a ) a.insert(lower_bound(a.begin(), a.end(), x), x); else a.erase(lower_bound(a.begin(), a.end(), x)); } } return 0; }
|
#include <bits/stdc++.h> const int N = 1e5 + 5; const unsigned long long bigN = 1e18; const long long mod9 = 1e9 + 9; const long long mod7 = 1e9 + 7; using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); vector<int> a, b; int n, l, r, x; cin >> n >> l >> r; for (int i = 1; i <= n; i++) { cin >> x; if (i >= l && i <= r) { continue; } else { a.push_back(x); } } for (int i = 1; i <= n; i++) { cin >> x; if (i >= l && i <= r) { continue; } else { b.push_back(x); } } if (a == b) { cout << TRUTH ; } else { cout << LIE ; } }
|
#include <bits/stdc++.h> using namespace std; map<string, string> M; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { string name, ip; cin >> name >> ip; M[ip] = name; } for (int i = 0; i < m; i++) { string cmd, ip; cin >> cmd >> ip; ip.pop_back(); cout << cmd << << ip << ; # << M[ip] << endl; } }
|
#include <bits/stdc++.h> #define ll long long using namespace std; const ll N = 5005, MOD = 998244353; vector<vector<ll>> dp(N, vector<ll>(N)); vector<vector<int>> edges(N); vector<int> h(N); int n, k; void add(ll &x, ll y) { if((x += y) >= MOD) { x -= MOD; } } void dfs(int x, int p) { dp[x][0] = 1; for(int to : edges[x]) { if(to != p) { dfs(to, x); vector<ll> temp(N); for(int L1 = 0; L1 <= min(h[x], k); ++L1) { for(int L2 = 0; L2 <= h[to]; ++L2) { ll ways = dp[x][L1] * dp[to][L2] % MOD; if(L1 + L2 < k) add(temp[max(L1, L2+1)], ways); add(temp[L1], ways); } } dp[x] = temp; h[x] = max(h[x], h[to]+1); } } } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for(int i = 0; i < n - 1; ++i) { int u, v; cin >> u >> v; edges[u].push_back(v); edges[v].push_back(u); } dfs(1, 0); ll ans = 0; for(int i = 0; i <= k; ++i) { add(ans, dp[1][i]); } cout << ans << endl; }
|
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int maxn = 2e5 + 9; int a[maxn], b[maxn]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); } for (int i = 1; i <= m; i++) { scanf( %d , &b[i]); } long long ans = 1; int l = n, r = n; for (int i = m; i >= 1; i--) { while (a[r] > b[i]) r--; if (a[r] != b[i] || r == 0) { ans = 0; break; } l = r; while (a[l] >= b[i]) l--; if (i != 1) ans = ans * (r - l) % mod; else if (l != 0) ans = 0; r = l; } printf( %lld n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[5] = {}, b[5] = {}; for (int k = 0; k < n; k++) { int x; cin >> x; a[x - 1]++; } for (int k = 0; k < n; k++) { int x; cin >> x; b[x - 1]++; } int cnt = 0; for (int k = 0; k < 5; k++) { if ((a[k] + b[k]) % 2 != 0) { cout << -1; return 0; } cnt += (max(a[k], b[k]) - min(a[k], b[k])) / 2; } cout << (cnt % 2 == 0 ? cnt / 2 : -1); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); unordered_map<int, int> m; for (int i = 0; i < n; i++) { int x; scanf( %d , &x); m[x]++; } int ans = 0; for (pair<int, int> x : m) ans += x.second / 2; printf( %d n , ans / 2); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 16; int from[MAXN], to[MAXN], p[MAXN], q[MAXN]; bool w[MAXN][MAXN]; long long dp[1 << MAXN]; int main() { int n, m, a, b; long long y; cin >> n >> y >> m; fill(from, from + n, 0); fill(to, to + n, 0); fill(w[0], w[m], false); for (int i = 0; i < m; ++i) { cin >> a >> b; --a; --b; w[a][b] = true; } for (int k = 0; k < n; ++k) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { w[i][j] |= w[i][k] && w[k][j]; } } } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (w[i][j]) { from[j] |= 1 << i; to[i] |= 1 << j; } } } fill(dp, dp + (1 << n), 0); dp[0] = 1; for (int i = 1; i < (1 << n); ++i) { for (int j = 0; j < n; ++j) { if ((i & (1 << j)) != 0 && (i & to[j]) == 0) { dp[i] += dp[i ^ (1 << j)]; } } } y -= 2001; m = (1 << n) - 1; if (y >= dp[m]) { cout << The times have changed << endl; return 0; } fill(p, p + n, -1); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (p[j] != -1) { continue; } p[j] = i; { fill(dp, dp + (1 << n), 0); dp[0] = 1; for (int i = 1; i < (1 << n); ++i) { int k = n - __builtin_popcount(i); if (p[k] != -1) { int j = p[k]; if ((i & (1 << j)) != 0 && (i & from[j]) == 0) { dp[i] += dp[i ^ (1 << j)]; } } else { for (int j = 0; j < n; ++j) { if ((i & (1 << j)) != 0 && (i & from[j]) == 0) { dp[i] += dp[i ^ (1 << j)]; } } } } } if (y < dp[m]) { q[i] = j; break; } else { p[j] = -1; y -= dp[m]; } } } for (int i = 0; i < n; ++i) { printf( %d%c , q[i] + 1, i == n - 1 ? n : ); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MX = 1000000 + 5; const long long inf = 1e9; const long long mod = 1e9 + 7; int a[MX], k; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, p, x, y, tc; cin >> tc; while (tc--) { cin >> n >> p >> k; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); int rs = 0, pre = 0; for (int i = 1; i <= k; i++) { int sm = pre; if (pre > p) break; rs = max(rs, i - 1); for (int j = i + k - 1; j <= n; j += k) { sm += a[j]; if (sm > p) break; rs = max(rs, j); } pre += a[i]; } cout << rs << endl; } return 0; }
|
#include <bits/stdc++.h> using namespace std; int32_t main() { unordered_map<string, long long> m; m[ Tetrahedron ] = 4; m[ Cube ] = 6; m[ Octahedron ] = 8; m[ Dodecahedron ] = 12; m[ Icosahedron ] = 20; long long n; cin >> n; long long count = 0; while (n--) { string str; cin >> str; count += m[str]; } cout << count << endl; return 0; }
|
#include<bits/stdc++.h> using namespace std; namespace Acc{ const int N = 1e2+10; string a,b; int n; void work(){ queue<pair<string,int> >q; cin>>n>>a,q.push({b,0}); while(1){ auto[u,pos]=q.front();q.pop(); u.resize(pos+1); for(int i=0;i<26;i++){ u[pos]=(char)( a +i); if(a.find(u)==string::npos)return (void)(cout<<u); q.push({u,pos+1}); } } } } int main(){ int T; for(cin>>T;T--;puts( ))Acc::work(); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long par[27]; long long parent(long long x) { while (x != par[x]) { par[x] = par[par[x]]; x = par[x]; } return x; } void uni(long long x, long long y) { long long px = parent(x); long long py = parent(y); par[y] = px; } int main() { long long t = 1; while (t--) { long long n; cin >> n; set<long long> st; for (long long i = 0; i < 27; i++) par[i] = i; for (long long i = 0; i < n; i++) { string s; cin >> s; st.insert(s[0] - a ); for (long long i = 1; i < s.length(); i++) { st.insert(s[i] - a ); uni(s[0] - a , s[i] - a ); } } long long ans = 0; for (long long i = 0; i < 26; i++) if (parent(i) == i && st.find(i) != st.end()) ans++; cout << ans << endl; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize(3, Ofast , inline ) using namespace std; const long long INF(0x3f3f3f3f3f3f3f3fll); const long long inf(0x3f3f3f3f); template <typename T> void read(T &res) { bool flag = false; char ch; while (!isdigit(ch = getchar())) (ch == - ) && (flag = true); for (res = ch - 48; isdigit(ch = getchar()); res = (res << 1) + (res << 3) + ch - 48) ; flag && (res = -res); } template <typename T> void Out(T x) { if (x < 0) putchar( - ), x = -x; if (x > 9) Out(x / 10); putchar(x % 10 + 0 ); } long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } long long lcm(long long a, long long b) { return a * b / gcd(a, b); } long long pow_mod(long long x, long long n, long long mod) { long long res = 1; while (n) { if (n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } long long fact_pow(long long n, long long p) { long long res = 0; while (n) { n /= p; res += n; } return res; } long long mult(long long a, long long b, long long p) { a %= p; b %= p; long long r = 0, v = a; while (b) { if (b & 1) { r += v; if (r > p) r -= p; } v <<= 1; if (v > p) v -= p; b >>= 1; } return r; } long long quick_pow(long long a, long long b, long long p) { long long r = 1, v = a % p; while (b) { if (b & 1) r = mult(r, v, p); v = mult(v, v, p); b >>= 1; } return r; } bool CH(long long a, long long n, long long x, long long t) { long long r = quick_pow(a, x, n); long long z = r; for (long long i = 1; i <= t; i++) { r = mult(r, r, n); if (r == 1 && z != 1 && z != n - 1) return true; z = r; } return r != 1; } bool Miller_Rabin(long long n) { if (n < 2) return false; if (n == 2) return true; if (!(n & 1)) return false; long long x = n - 1, t = 0; while (!(x & 1)) { x >>= 1; t++; } srand(time(NULL)); long long o = 8; for (long long i = 0; i < o; i++) { long long a = rand() % (n - 1) + 1; if (CH(a, n, x, t)) return false; } return true; } long long exgcd1(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return a; } long long t = exgcd1(b, a % b, y, x); y -= a / b * x; return t; } long long get_inv(long long a, long long mod) { long long x, y; long long d = exgcd1(a, mod, x, y); return d == 1 ? (x % mod + mod) % mod : -1; } void exgcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1, y = 0; return; } exgcd(b, a % b, x, y); long long t = x; x = y, y = t - (a / b) * y; } long long INV(long long a, long long b) { long long x, y; return exgcd(a, b, x, y), (x % b + b) % b; } long long crt(long long x, long long p, long long mod) { return INV(p / mod, mod) * (p / mod) * x; } long long FAC(long long x, long long a, long long b) { if (!x) return 1; long long ans = 1; for (long long i = 1; i <= b; i++) if (i % a) ans *= i, ans %= b; ans = pow_mod(ans, x / b, b); for (long long i = 1; i <= x % b; i++) if (i % a) ans *= i, ans %= b; return ans * FAC(x / a, a, b) % b; } long long C(long long n, long long m, long long a, long long b) { long long N = FAC(n, a, b), M = FAC(m, a, b), Z = FAC(n - m, a, b), sum = 0, i; for (i = n; i; i = i / a) sum += i / a; for (i = m; i; i = i / a) sum -= i / a; for (i = n - m; i; i = i / a) sum -= i / a; return N * pow_mod(a, sum, b) % b * INV(M, b) % b * INV(Z, b) % b; } long long exlucas(long long n, long long m, long long p) { long long t = p, ans = 0, i; for (i = 2; i * i <= p; i++) { long long k = 1; while (t % i == 0) { k *= i, t /= i; } ans += crt(C(n, m, i, k), p, k), ans %= p; } if (t > 1) ans += crt(C(n, m, t, t), p, t), ans %= p; return ans % p; } const long long N = 1e6 + 10; long long tree[N << 2]; long long n, m; long long a[N], sum[N]; map<long long, long long> pos; long long lowbit(long long x) { return x & (-x); } void add(long long pos, long long val) { while (pos <= n) { tree[pos] ^= val; pos += lowbit(pos); } } long long get(long long pos) { long long res = 0; while (pos) { res ^= tree[pos]; pos -= lowbit(pos); } return res; } long long get_sum(long long l, long long r) { return get(r) ^ get(l - 1); } struct Q { long long l, r, ans, id; bool operator<(const Q &a) const { return r < a.r; } } q[N]; bool cmp(Q a, Q b) { return a.id < b.id; } signed main() { std::ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n; for (long long i = 1; i <= n; i++) cin >> a[i], sum[i] = sum[i - 1] ^ a[i]; cin >> m; for (long long i = 1; i <= m; i++) cin >> q[i].l >> q[i].r, q[i].id = i; sort(q + 1, q + 1 + m); long long now = 1; for (long long i = 1; i <= m; i++) { long long l = q[i].l, r = q[i].r, id = q[i].id; while (now <= r) { if (pos[a[now]]) add(pos[a[now]], a[now]); pos[a[now]] = now; add(pos[a[now]], a[now]); now++; } q[i].ans = (sum[r] ^ sum[l - 1]) ^ get_sum(l, r); } sort(q + 1, q + 1 + m, cmp); for (long long i = 1; i <= m; i++) cout << q[i].ans << n ; return 0; }
|
#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __print(float x) { cout << x; } void __print(double x) { cout << x; } void __print(long double x) { cout << x; } void __print(char x) { cout << << x << ; } void __print(const char *x) { cout << << x << ; } void __print(const string &x) { cout << << x << ; } void __print(bool x) { cout << (x ? true : false ); } template <typename T, typename V> void __print(const pair<T, V> &x) { cout << { ; __print(x.first); cout << , ; __print(x.second); cout << } ; } template <typename T> void __print(const T &x) { int f = 0; cout << { ; for (auto &i : x) cout << (f++ ? , : ), __print(i); cout << } ; } void _print() { cout << ] n ; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << , ; _print(v...); } long long int fast_pow(long long int base, long long int exp, long long int M = 1000000007) { base = base % M; long long int result = 1; while (exp > 0) { if (exp % 2 == 1) result = (result * base) % M; base = (base * base) % M; exp = exp / 2; } return result; } long long int modInverse(long long int A, long long int M = 1000000007) { return fast_pow(A, M - 2, M); } long long int maxSubArraySum(long long int a[], long long int size) { long long int max_so_far = INT_MIN, max_ending_here = 0; for (long long int i = 0; i < size; i++) { max_ending_here = max_ending_here + a[i]; if (max_so_far < max_ending_here) max_so_far = max_ending_here; if (max_ending_here < 0) max_ending_here = 0; } return max_so_far; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int t; cin >> t; while (t--) { long long int n; long long int yass = 0; cin >> n; long long int v[n]; for (long long int i = 0; i <= n - 1; i++) { cin >> v[i]; yass += v[i]; } long long int m1 = maxSubArraySum(v, n - 1); long long int m2 = maxSubArraySum(v + 1, n - 1); ; long long int adel = max(m1, m2); if (yass > adel) { cout << YES n ; } else { cout << NO n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(NULL); int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; if (k % 3 == 0) { if (n >= k) { n = n % (k + 1); if (n == k) cout << Alice n ; else { if ((n) % 3 != 0) { cout << Alice n ; } else { cout << Bob n ; } } } else { if ((n) % 3 != 0) { cout << Alice n ; } else { cout << Bob n ; } } } else { if ((n) % 3 != 0) { cout << Alice n ; } else { cout << Bob n ; } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; #define mod 1000000007 typedef long long ll; #define MAXN 300005 #define mod 1000000007 int main(){ int n; cin>>n; vector<int>ar(n+1); for(int i=1;i<=n;i++)cin>>ar[i]; vector<pair<int,pair<int,int> > >supp; for(int i=1;i<=n;i++){ for(int j=i+1;j<=n;j++){ supp.push_back({abs(ar[i]-ar[j]),{i,j}}); } } sort(supp.rbegin(),supp.rend()); for(int i=0;i<(int)supp.size();i++){ pair<int,int>tmp=supp[i].second; if(ar[tmp.first]<ar[tmp.second])swap(tmp.first,tmp.second); cout<< ? <<tmp.first<< <<tmp.second<<endl; string ok; cin>>ok; if(ok== Yes ){ cout<< ! <<tmp.first<< <<tmp.second<<endl; return 0; } } cout<< ! 0 0 <<endl; }
|
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k; cin >> n >> m >> k; int a[m + 1]; for (int i = 0; i < m + 1; i++) { cin >> a[i]; } int ans = 0; for (int i = 0; i < m; i++) { int count = 0; for (int j = 0; j < n; j++) { if (((a[m] >> j) & 1) != ((a[i] >> j) & 1)) { count++; } } if (count <= k) ans++; } cout << ans; }
|
#include <bits/stdc++.h> using namespace std; unsigned long long mod = 1e9 + 7; int n, m; vector<int> depth; vector<bool> visited; vector<vector<int>> adj; void dfs(int curr, int dt) { depth[curr] = (dt) % 2; visited[curr] = true; for (int i = 0; i < adj[curr].size(); i++) { if (!visited[adj[curr][i]]) { dfs(adj[curr][i], dt + 1); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t; cin >> t; while (t--) { cin >> n >> m; adj = vector<vector<int>>(n + 1); depth = vector<int>(n + 1); visited = vector<bool>(n + 1, false); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } dfs(1, 0); vector<int> v1; vector<int> v2; for (int i = 1; i <= n; i++) { if (depth[i] % 2) { v1.push_back(i); } else { v2.push_back(i); } } if (v1.size() < v2.size()) { cout << v1.size() << endl; for (int i = 0; i < v1.size(); i++) { cout << v1[i] << ; } } else { cout << v2.size() << endl; for (int i = 0; i < v2.size(); i++) { cout << v2[i] << ; } } cout << endl; } }
|
#include <bits/stdc++.h> using namespace std; long long mod = 1e9 + 7; void self_add(long long &x, long long y) { x = (x + y) % mod; } long long binpow(long long a, long long n) { long long res = 1; while (n) { if (n & 1) res = (res * a) % mod; n >>= 1; a = (a * a) % mod; } return res; } int main() { long long n; cin >> n; long long fact = 1; for (long long i = 2; i <= n; i++) { fact = (fact * (i)) % mod; } long long power = binpow(2, n - 1); long long ans = (fact - power) % mod; if (ans < 0) ans += mod; cout << ans; return 0; }
|
#include <bits/stdc++.h> using namespace std; void solve() { int v; cin >> v; int a[9]; int t = 100000, x; for (long long i = 0; i < 9; ++i) { cin >> a[i]; t = min(t, a[i]); } if (t > v) { cout << -1; return; } x = v / t; while (x--) { for (int i = 8; i >= 0; i--) { if (a[i] <= v && (v - a[i]) / t == x) { cout << i + 1; v -= a[i]; break; } } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; int t = 1; while (t--) { solve(); } }
|
#include <bits/stdc++.h> int main() { int n, b = 1, i = 1; scanf( %d , &n); for (i = 1; i < n; i++) { b = b + i; if (b > n) b = b % n; printf( %d n , b); } return 0; }
|
#include <bits/stdc++.h> using namespace std; struct node { int x, y, f; char na; } f[30]; bool cmp(node a, node b) { return a.na < b.na; } char s[1005][1005]; int s1[1005][1005]; int s2[1005][1005]; int main() { int n, m; scanf( %d%d , &n, &m); for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); memset(f, 0, sizeof(f)); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { s1[i][j] = s1[i][j - 1] + ((s[i][j] == # ) ? 1 : 0); } for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) { s2[j][i] = s2[j - 1][i] + ((s[j][i] == # ) ? 1 : 0); } int ns = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (s[i][j] >= A && s[i][j] <= Z ) { f[ns].x = i; f[ns].y = j; f[ns].na = s[i][j]; ns++; } } sort(f, f + ns, cmp); int nq; scanf( %d , &nq); for (int i = 0; i < nq; i++) { char dir[9]; int len; scanf( %s %d , dir, &len); for (int j = 0; j < ns; j++) { if (!f[j].f) { if (dir[0] == W ) { if (f[j].y - len < 1) f[j].f = 1; else if (s1[f[j].x][f[j].y] - s1[f[j].x][f[j].y - len - 1] > 0) f[j].f = 1; f[j].y = f[j].y - len; } if (dir[0] == E ) { if (f[j].y + len > m) f[j].f = 1; else if (s1[f[j].x][f[j].y + len] - s1[f[j].x][f[j].y - 1] > 0) f[j].f = 1; f[j].y = f[j].y + len; } if (dir[0] == S ) { if (f[j].x + len > n) f[j].f = 1; else if (s2[f[j].x + len][f[j].y] - s2[f[j].x - 1][f[j].y] > 0) f[j].f = 1; f[j].x = f[j].x + len; } if (dir[0] == N ) { if (f[j].x - len < 1) f[j].f = 1; else if (s2[f[j].x][f[j].y] - s2[f[j].x - len - 1][f[j].y] > 0) f[j].f = 1; f[j].x = f[j].x - len; } } } } int flag = 0; for (int i = 0; i < ns; i++) { if (!f[i].f) { printf( %c , f[i].na); flag = 1; } } if (!flag) printf( no solution ); puts( ); }
|
#include <bits/stdc++.h> using namespace std; int n, head[100005], tot, d[100005], fa[100005], vis[100005], lf[100005], cnt; struct node { int v, nxt; } edg[100005 << 1]; inline void addedg(int u, int v) { edg[tot].v = v; edg[tot].nxt = head[u]; head[u] = tot++; } inline void init() { memset(head, -1, sizeof(int) * (n + 1)); tot = cnt = 0; } inline void dfs1(int u, int f) { int v; d[u] = 0; for (int i = head[u]; i != -1; i = edg[i].nxt) { v = edg[i].v; ++d[u]; if (v == f) continue; dfs1(v, u); } } inline void dfs2(int u, int f, int dis) { int v; fa[u] = f; d[u] = dis; for (int i = head[u]; i != -1; i = edg[i].nxt) { v = edg[i].v; if (f == v) continue; dfs2(v, u, dis + 1); } } inline bool cmp(int u, int v) { return d[u] > d[v]; } set<int> se; int main() { scanf( %d , &n); init(); int u, v; for (int i = 1; i < n; ++i) { scanf( %d%d , &u, &v); addedg(u, v); addedg(v, u); } dfs1(1, 1); for (int i = 1; i <= n; ++i) { if (d[i] == 1) lf[cnt++] = i; } int root = lf[0]; dfs2(root, root, 0); vis[root] = 1; int maxn = 0, minn = 1; for (int i = 1; i < cnt; ++i) { if (d[lf[i]] & 1) minn = 3; } fa[root] = edg[head[root]].v; maxn = n - 1 - cnt; for (int i = 0; i < cnt; ++i) se.insert(fa[lf[i]]); maxn += se.size(); printf( %d %d n , minn, maxn); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int MAXN = 200005; struct Edge { int to; int nxt; } edge[MAXN << 1]; int n, k, id; int first[MAXN]; int a[MAXN]; int fa[MAXN]; int f[MAXN]; int g[MAXN]; int sz[MAXN]; void addE(int u, int v) { edge[++id] = (Edge){v, first[u]}; first[u] = id; } void dfsinfo(int u) { sz[u] = 1; for (int i = first[u]; i; i = edge[i].nxt) if (edge[i].to != fa[u]) { fa[edge[i].to] = u; dfsinfo(edge[i].to); sz[u] += sz[edge[i].to]; } } void dfsf(int u, int lim) { int MX = 0, sum = 1; for (int i = first[u]; i; i = edge[i].nxt) if (edge[i].to != fa[u] && a[edge[i].to] >= lim) { dfsf(edge[i].to, lim); if (sz[edge[i].to] == f[edge[i].to]) sum += f[edge[i].to]; else MX = max(MX, f[edge[i].to]); } f[u] = MX + sum; } void dfsg(int u, int lim) { int MX1 = 0, MX2 = 0, sum = 1; for (int i = first[u]; i; i = edge[i].nxt) if (edge[i].to != fa[u] && a[edge[i].to] >= lim) { if (sz[edge[i].to] == f[edge[i].to]) sum += f[edge[i].to]; else if (f[edge[i].to] >= MX1) { MX2 = MX1; MX1 = f[edge[i].to]; } else if (f[edge[i].to] > MX2) MX2 = f[edge[i].to]; } if (n - sz[u] == g[u]) sum += g[u]; else if (g[u] >= MX1) { MX2 = MX1; MX1 = g[u]; } else if (g[u] > MX2) MX2 = g[u]; for (int i = first[u]; i; i = edge[i].nxt) if (edge[i].to != fa[u] && a[edge[i].to] >= lim) { if (sz[edge[i].to] == f[edge[i].to]) g[edge[i].to] = sum - f[edge[i].to] + MX1; else if (f[edge[i].to] == MX1) g[edge[i].to] = sum + MX2; else g[edge[i].to] = sum + MX1; dfsg(edge[i].to, lim); } } int getans(int lim) { memset(f, 0, sizeof(f)); memset(g, 0, sizeof(g)); if (a[1] >= lim) { dfsf(1, lim); dfsg(1, lim); } for (int i = 1; i <= n; i++) if (a[i] < lim) for (int j = first[i]; j; j = edge[j].nxt) if (edge[j].to != fa[i] && a[edge[j].to] >= lim) { dfsf(edge[j].to, lim); dfsg(edge[j].to, lim); } int res = 0; for (int i = 1; i <= n; i++) { if (a[i] < lim) continue; int MX = 0, sum = 1; for (int j = first[i]; j; j = edge[j].nxt) if (a[edge[j].to] >= lim) { int SZ = 0, FG = 0; if (edge[j].to == fa[i]) { SZ = n - sz[i]; FG = g[i]; } else { SZ = sz[edge[j].to]; FG = f[edge[j].to]; } if (FG == SZ) sum += FG; else MX = max(MX, FG); } res = max(res, MX + sum); } return res; } int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int u, v, i = 1; i < n; i++) { scanf( %d%d , &u, &v); addE(u, v); addE(v, u); } dfsinfo(1); int low = 1, high = 1000000; while (low < high) { int mid = low + high + 1 >> 1; if (getans(mid) >= k) low = mid; else high = mid - 1; } printf( %d n , low); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int maxn = 510; const int inf = 0x3f3f3f3f; int n; long long d[maxn][maxn]; int w(int i, int j, int k) { return i * j * k; } int main() { int n; scanf( %d , &n); memset(d, 0x3f, sizeof(d)); for (int i = 1; i <= n; i++) { d[i][i + 2] = w(i, i + 1, i + 2); d[i][i] = 0; d[i][i + 1] = 0; } for (int i = n - 2; i >= 1; i--) { for (int j = i + 2; j <= n; j++) { for (int k = i + 1; k < j; k++) { d[i][j] = min(d[i][j], d[i][k] + d[k][j] + w(i, j, k)); } } } printf( %I64d , d[1][n]); return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, k; int l, MOD; map<long long, int> mp; int fib(long long n) { if (mp.count(n)) return mp[n]; if (n & 1) return mp[n] = 1LL * fib(n / 2) * (fib(n / 2 - 1) + fib(n / 2 + 1)) % MOD; return mp[n] = (1LL * fib(n / 2) * fib(n / 2) + 1LL * fib(n / 2 - 1) * fib(n / 2 - 1)) % MOD; } int bpow(int a, long long b) { int ans = 1; while (b) { if (b & 1) ans = 1LL * ans * a % MOD; b >>= 1; a = 1LL * a * a % MOD; } return ans; } int main() { ios::sync_with_stdio(false); cin >> n >> k >> l >> MOD; if (k >= (1LL << min(l, 62))) { cout << 0 n ; return 0; } mp[0] = 1 % MOD; mp[1] = 1 % MOD; int zero = fib(n + 1); int one = (bpow(2, n) - zero + MOD) % MOD; int ans = 1 % MOD; for (int i = 0; i < min(l, 62); i++) if ((1LL << i) & k) ans = 1LL * ans * one % MOD; else ans = 1LL * ans * zero % MOD; for (int i = 62; i < l; i++) ans = 1LL * ans * zero % MOD; cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; void sol() { long long int n; cin >> n; vector<int> ar[6]; long long int a; vector<int> v = {4, 8, 15, 16, 23, 42}; for (long long int i = 0; i < n; i++) { cin >> a; ar[lower_bound(v.begin(), v.end(), a) - v.begin()].push_back(i); } int p[6] = {0, 0, 0, 0, 0, 0}; int sit = 0; int cnt = 0; while (1) { int prev = -1; for (long long int i = 0; i < 6; i++) { while (p[i] < ar[i].size() && ar[i][p[i]] < prev) { p[i]++; } if (p[i] >= ar[i].size()) { sit = 1; break; } prev = ar[i][p[i]]; p[i]++; } if (sit == 1) break; else cnt++; } cout << n - 6 * cnt << n ; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { sol(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int inf = 1e9; const int bound = 400; struct qq { int id, vl; bool operator<(const qq &temp) const { return vl < temp.vl; } }; qq bk[210000 / bound][bound], ns; int nk[210000 / bound]; struct pp { int vl, id, min_value, value; int flag; bool operator<(const pp &temp) const { return vl < temp.vl; } }; pp bl[210000 / bound][2 * bound], now; int num[210000 / bound], num_bl, cnt_list, np[2 * bound]; int m, n, a[220000], num_q, ans, nw; int lower_bound(int left, int right, qq bl[], int x) { int mid; while (left <= right) { mid = (left + right) >> 1; if (bl[mid].vl < x) left = mid + 1; else right = mid - 1; } return right; } int lower_bound(int left, int right, pp bl[], int x) { int mid; while (left <= right) { mid = (left + right) >> 1; if (bl[mid].vl < x) left = mid + 1; else right = mid - 1; } return right; } int main() { int i, j, s, p, q, ip, id, l, r, x, fir; scanf( %d%d , &n, &m); for (i = 0; i < n; i++) scanf( %d , &a[i]); memset(num, 0, sizeof(num)); memset(nk, 0, sizeof(nk)); num_bl = 0; for (i = 0; i < n; i++) { if (i % bound == 0) { for (j = i; j < min(n, i + bound); j++) { if (j + m < n) { now.id = j; now.vl = a[j]; now.flag = -1; bl[num_bl][num[num_bl]++] = now; now.id = j + m; now.vl = a[j + m]; now.flag = 1; bl[num_bl][num[num_bl]++] = now; } ns.id = j; ns.vl = a[j]; bk[num_bl][nk[num_bl]++] = ns; } num_bl++; } } for (i = 0; i < num_bl; i++) { sort(bl[i], bl[i] + num[i]); sort(bk[i], bk[i] + nk[i]); for (j = i * bound; j < min((i + 1) * bound, n); j++) np[j - i * bound] = 0; for (j = 0; j < num[i]; j++) { bl[i][j].value = bl[i][j].flag; ip = bl[i][j].id; if (bl[i][j].flag > 0) ip -= m; np[ip - i * bound] += bl[i][j].flag; if (bl[i][j].flag < 0) { if (bl[i][j].id + m >= n) { bl[i][j].value = 0; np[ip - i * bound]++; } } if (j) { bl[i][j].value += bl[i][j - 1].value; } bl[i][j].min_value = 0; nw = 0; for (s = i * bound; s < min((i + 1) * bound, n); s++) { nw += np[s - i * bound]; if (bl[i][j].min_value > nw) bl[i][j].min_value = nw; } } } scanf( %d , &num_q); ans = 0; while (num_q--) { scanf( %d%d%d , &l, &r, &x); l--; r--; x ^= ans; ans = 0; id = l / bound; nw = fir = 0; for (i = l; i <= min(l + m - 1, (l / bound + 1) * bound - 1); i++) { if (a[i] < x) fir++; } if (l + m - 1 >= (l / bound + 1) * bound) { for (i = (l + m - 1) / bound * bound; i <= l + m - 1; i++) { if (a[i] < x) fir++; } for (i = l / bound + 1; i < (l + m - 1) / bound; i++) { id = lower_bound(0, nk[i] - 1, bk[i], x); fir += (id + 1); } } for (i = l; i <= min(r - 1, (l / bound + 1) * bound - 1); i++) { if (i + m < n) { if (a[i] < x) nw--; if (a[i + m] < x) nw++; if (ans > nw) ans = nw; } } if (r - 1 >= (l / bound + 1) * bound) { for (i = l / bound + 1; i < (r - 1) / bound; i++) { id = lower_bound(0, num[i] - 1, bl[i], x); if (id >= 0) { if (nw + bl[i][id].min_value < ans) ans = nw + bl[i][id].min_value; nw += bl[i][id].value; } } for (i = ((r - 1) / bound) * bound; i <= r - 1; i++) { if (i + m < n) { if (a[i] < x) nw--; if (a[i + m] < x) nw++; if (ans > nw) ans = nw; } } } ans += fir; printf( %d n , ans); } return 0; }
|
#include <bits/stdc++.h> using namespace std; inline void readi(int &x); const int maxn = 300005; int n, b[maxn], id[maxn], rk[maxn]; double fl[maxn], fr[maxn]; bool cmpb(const int &i, const int &j) { return b[i] < b[j]; } struct node { double div, dta; node *lc, *rc; inline void downdate() { if (div != 1) lc->div *= div, lc->dta *= div, rc->div *= div, rc->dta *= div, div = 1; if (dta != 0) lc->dta += dta, rc->dta += dta, dta = 0; } inline void modify(int l, int r, const int &a, const int &b, const double &c, const double &d) { if (l >= a && r <= b) div *= c, dta *= c, dta += d; else { int mid = l + r >> 1; downdate(); if (a <= mid) lc->modify(l, mid, a, b, c, d); if (b > mid) rc->modify(mid + 1, r, a, b, c, d); } } inline double get(int l, int r, const int &p) { if (l == r) return dta; int mid = l + r >> 1; downdate(); if (p <= mid) return lc->get(l, mid, p); else return rc->get(mid + 1, r, p); } } ndl[maxn * 3], *root; int ns; node *build(int l, int r) { node *c = ndl + ns++; c->dta = 0; c->div = 1; if (l == r) c->lc = c->rc = NULL; else { int mid = l + r >> 1; c->lc = build(l, mid); c->rc = build(mid + 1, r); } return c; } void build() { ns = 1, root = build(1, n); } void init() { readi(n); for (int i = 1; i <= n; i++) readi(b[i]), id[i] = i; sort(id + 1, id + n + 1, cmpb); for (int i = 1; i <= n; i++) rk[id[i]] = i; } void work() { build(); for (int i = 1; i <= n; i++) { root->modify(1, n, 1, n, 1, 1); if (rk[i] > 1) root->modify(1, n, 1, rk[i] - 1, .5, 0); fl[i] = root->get(1, n, rk[i]) / 2; } build(); for (int i = n; i >= 1; i--) { root->modify(1, n, 1, n, 1, 1); if (rk[i] > 1) root->modify(1, n, 1, rk[i] - 1, .5, 0); fr[i] = root->get(1, n, rk[i]) / 2; } double ans = 0; for (int i = 1; i <= n; i++) ans += fl[i] * fr[i] * b[i]; ans /= (double)n * n; printf( %lf , (double)ans * 2); } int main() { init(); work(); return 0; } inline void readi(int &x) { char c; for (c = getchar(); c > 9 || c < 0 ; c = getchar()) ; x = c ^ 0 ; for (c = getchar(); c >= 0 && c <= 9 ; c = getchar()) x = x * 10 + (c ^ 0 ); }
|
#include <bits/stdc++.h> using namespace std; vector<pair<int, int> > seg[2]; int n, m, k, x, y, dX, dY; bool flag = 0; long long ans; void add(int tx, int ty) { seg[0].push_back(pair<int, int>(tx - ty, tx)); seg[1].push_back(pair<int, int>(tx + ty, tx)); } void reflect() { int fc; if (dX == dY) fc = 0; else fc = 1; pair<int, int> p = (fc) ? pair<int, int>(x + y, x) : pair<int, int>(x - y, x); vector<pair<int, int> >::iterator it = upper_bound(seg[fc].begin(), seg[fc].end(), p); while (it->first != p.first) it--; if (dX < 0) while (it->second >= x) it--; ans += abs(x - it->second) - 1; x = it->second; y = (fc) ? (it->first - x) : (x - it->first); bool A = binary_search(seg[0].begin(), seg[0].end(), pair<int, int>(x - y - dX, x - dX)); bool B = binary_search(seg[0].begin(), seg[0].end(), pair<int, int>(x - y + dY, x)); if (A == B) flag = 1, dX = -dX, dY = -dY; else { if (A) x -= dX, dY = -dY; else if (B) y -= dY, dX = -dX; } } int main() { scanf( %d %d %d , &n, &m, &k); for (int i = 1; i <= m; i++) add(0, i), add(n + 1, i); for (int i = 0; i <= n + 1; i++) add(i, 0), add(i, m + 1); for (int i = 1; i <= k; i++) { scanf( %d %d , &x, &y); add(x, y); } scanf( %d %d , &x, &y); char c = getchar(); while (c != N && c != S && c != W && c != E ) c = getchar(); if (c == N ) dX = -1; else dX = 1; c = getchar(); if (c == W ) dY = -1; else dY = 1; sort(seg[0].begin(), seg[0].end()); sort(seg[1].begin(), seg[1].end()); reflect(); int sx = x, sy = y, sdx = dX, sdy = dY; ans = 0; do reflect(); while (!(x == sx && y == sy && dX == sdx && dY == sdy)); printf( %lld n , (flag) ? (ans >> 1) : ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, a[200005], d[200005], m(0), id, x; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i], ++d[a[i]]; for (int i = 1; i <= n; i++) if (d[a[i]] > m) m = d[a[i]], id = i, x = a[i]; cout << n - m << n ; for (int i = id - 1; i; i--) { if (a[i] < x) cout << 1 << << i << << i + 1 << n ; else if (a[i] > x) cout << 2 << << i << << i + 1 << n ; } for (int i = id + 1; i <= n; i++) { if (a[i] < x) cout << 1 << << i << << i - 1 << n ; else if (a[i] > x) cout << 2 << << i << << i - 1 << n ; } return 0; }
|
#include <bits/stdc++.h> using namespace std; const int OO = 0x3f3f3f3f, N = 1e5 + 5, mod = 1e9 + 7; const double pi = acos(-1), eps = 1e-9; int n, x, c = 1; vector<int> v; long long ans; int main() { scanf( %d , &n); for (int i = 0; i < n; ++i) { scanf( %d , &x); if (x >= c) { while (c < x) { ans += i - v.back(); ++c; v.pop_back(); } ++c; } else { v.push_back(i); ans += c - x - 1; } } printf( %lld , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100010; int a[N]; long long dp[N]; int main() { int n; scanf( %d , &n); for (int i = 0; i < n; ++i) { int x; scanf( %d , &x); a[x]++; } long long ans = 0; dp[N - 1] = dp[N - 2] = 0; for (int i = N - 3; i >= 1; --i) { dp[i] = max(dp[i + 1], dp[i + 2] + 1LL * a[i] * i); ans = max(ans, dp[i]); } cout << ans << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const long long INF = 1e9 + 10, MAX = 2e5 + 1e4, MOD = 1e9 + 7, MAXL = 25; void OUT(long double o, int x) { cout << fixed << setprecision(x) << o; return; } long long a[MAX], t = 1; vector<int> adj[MAX]; void dfs(int v, int p) { long long c = 0; for (int u : adj[v]) { if (u != p) { dfs(u, v); if (adj[u].size() == 1) c++; } } if (adj[v].size() > 1 && c < 3) t = 0; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin >> n; for (int i = 2; i <= n; i++) { long long x; cin >> x; adj[x].push_back(i); adj[i].push_back(x); } dfs(1, 1); if (t) cout << Yes ; else cout << No ; return 0; }
|
#include <bits/stdc++.h> const int maxn = 1e6 + 1, mod = 1e9 + 7; int n, m, k, cnt[maxn], pow2[maxn], ans; int main() { scanf( %d%d%d , &n, &m, &k); ++k; while (m--) { int u, v; scanf( %d%d , &u, &v); if (u + 1 != v && u + k != v) { puts( 0 ); return 0; } if (u + k == v) cnt[u] = 1; } for (int i = 1; i <= n; ++i) cnt[i] += cnt[i - 1]; for (int i = k + 1; i <= n; ++i) if (cnt[i] - cnt[i - 1] && cnt[i - k]) { puts( 0 ); return 0; } pow2[0] = 1; for (int i = 1; i <= n; ++i) { pow2[i] = pow2[i - 1] << 1; if (pow2[i] >= mod) pow2[i] -= mod; } ans = !cnt[n]; for (int i = 1; i <= n - k; ++i) if (cnt[i] == cnt[n]) { if (i <= k) ans += pow2[i - cnt[i - 1] - 1]; else if (!cnt[i - k]) ans += pow2[k - cnt[i - 1] - 1]; if (ans >= mod) ans -= mod; } printf( %d n , ans); return 0; }
|
#include <bits/stdc++.h> using namespace std; template <class T> using v2d = vector<vector<T> >; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); const int maxN = 2e3 + 10; int n, k, a[maxN], dp[maxN][maxN]; void solve() { cin >> n >> k; for (int i = 1; i <= (int)(n); ++i) { cin >> a[i]; } for (int i = (int)(0); i <= (int)(n); ++i) { for (int j = (int)(0); j <= (int)(n); ++j) { dp[i][j] = -1e9; } } dp[0][0] = 0; for (int i = 1; i <= (int)(n); ++i) { for (int j = (int)(0); j <= (int)(i); ++j) { if (j > 0) { uax(dp[i][j], dp[i - 1][j - 1]); } uax(dp[i][j], dp[i - 1][j] + (a[i] == i - j)); } } for (int i = 0; i < (int)(n); ++i) { if (dp[n][i] >= k) { cout << i << n ; return; } } cout << -1 << n ; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T = 1; cin >> T; while (T--) { solve(); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, h, k, i, j, s2, H[2][3000], H2[2][3000], s, a, x, y, z, l[2], top; vector<pair<int, int> > v[2]; int main() { cin >> n >> m; for (i = 0; i < n; i++) { cin >> x >> y >> z; v[x].push_back(make_pair(z, y)); } h = m; sort(v[0].begin(), v[0].end()); sort(v[1].begin(), v[1].end()); l[0] = v[0].size(); l[1] = v[1].size(); while (1) { a = 0; for (i = l[k] - 1; i >= 0; i--) if (v[k][i].second <= m && !H[k][i]) { s++; H[k][i] = 1; m += v[k][i].first; a = 1; break; } if (!a) break; k = !k; } m = h; k = 1; while (1) { a = 0; for (i = l[k] - 1; i >= 0; i--) if (v[k][i].second <= m && !H2[k][i]) { s2++; H2[k][i] = 1; m += v[k][i].first; a = 1; break; } if (!a) break; k = !k; } cout << max(s, s2); }
|
#include <bits/stdc++.h> using namespace std; bool adj[200][200]; int bfs(int source, int dest) { bool vis[200]; for (int i = 0; i < 200; i++) vis[i] = 0; queue<pair<int, int> > qe; qe.push({source, 0}); while (!qe.empty()) { int node = qe.front().first; int d = qe.front().second; qe.pop(); if (node == dest) return d; vis[node] = 1; for (int i = 0; i < 200; i++) { if (adj[node][i] and !vis[i]) qe.push({i, d + 1}); } } return INT_MAX; } int main() { int n; cin >> n; vector<long long> arr; while (n--) { long long x; cin >> x; if (x != 0) arr.push_back(x); } n = arr.size(); if (n > 128) { cout << 3 << endl; return 0; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (arr[i] & arr[j]) adj[i][j] = 1; } } int min_cycle = INT_MAX; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (adj[i][j]) { adj[i][j] = 0; adj[j][i] = 0; int m = bfs(i, j); min_cycle = min(m, min_cycle); adj[i][j] = 1; adj[j][i] = 1; } } } if (min_cycle > 10000000) cout << -1 << endl; else cout << min_cycle + 1 << endl; }
|
#include <bits/stdc++.h> using namespace std; int is[1010]; int main() { int n; scanf( %d , &n); int x = 0; for (int i = (0); i < (n); ++i) for (int j = (0); j < (n); ++j) { int v; scanf( %d , &v); if ((i == j) && (v == 1)) x ^= 1; } int q; scanf( %d , &q); for (int i = (0); i < (q); ++i) { int t; scanf( %d , &t); if (t < 3) { x ^= 1; int v; scanf( %d , &v); } else printf( %d , x); } printf( n ); }
|
#include <bits/stdc++.h> using namespace std; const long long MAX = 840; long long arr[9], W, ans; long long dp[7890]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> W; for (int i = 1; i < 9; ++i) { cin >> arr[i]; } if (W > 840) { for (int i = 1; i < 9; ++i) { long long lef = max(arr[i] - 840 / i, (long long)0); long long g = (W - 840 - ans) / i; g = min(g, lef); if (g < 0) continue; ans += g * i; arr[i] -= g; } } dp[0] = 1; for (int i = 1; i < 9; ++i) { for (int j = 0; j < min(arr[i], (long long)840 / i); ++j) { for (int k = 6789; k >= i; --k) { if (dp[k - i]) dp[k] = 1; } } } for (int k = 6789;; --k) { if (dp[k] && ans + k <= W) { cout << ans + k << n ; return 0; } } }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a[n * n]; for (int i = 1; i <= n * n; ++i) a[i - 1] = i; if (k == 1) { long long sum = 0; for (int i = 0; i < n; ++i) { sum += n * i + 1; } cout << sum << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < n - 1; ++j) { printf( %d , a[i * n + j]); } printf( %d n , a[i * n + n - 1]); } return 0; } vector<int> v[n]; k--; for (int i = 0; i < k * n; ++i) { v[i % k].push_back(i + 1); } for (int i = k * n; i < n * n; ++i) { v[(i - k * n) % (n - k) + k].push_back(i + 1); } long long sum = 0; for (int i = 0; i < n; ++i) { sum += v[k][i]; } cout << sum << endl; for (int i = 0; i < n; ++i) { for (int j = 0; j < n - 1; ++j) { printf( %d , v[j][i]); } printf( %d n , v[n - 1][i]); } return 0; }
|
#include <bits/stdc++.h> using namespace std; int f[5010][5010], ans[5010][5010]; int n, q; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &f[i][i]); ans[i][i] = f[i][i]; } for (int i = 1; i < n; i++) for (int j = 1; j <= n - i + 1; j++) f[j][j + i] = f[j][j + i - 1] ^ f[j + 1][j + i], ans[j][j + i] = max(f[j][j + i], max(ans[j][j + i - 1], ans[j + 1][j + i])); scanf( %d , &q); for (int i = 1; i <= q; i++) { int l, r; scanf( %d%d , &l, &r); printf( %d n , ans[l][r]); } }
|
#include <bits/stdc++.h> using namespace std; int a[1003][1003]; int cost[43][1003][1003]; vector<vector<pair<int, int>>> COL(43); int n, m, k; int di1[4] = {0, 1, 0, -1}; int di2[4] = {1, 0, -1, 0}; void bfs(int col) { vector<bool> vis(43, 0); queue<pair<int, int>> q; for (int i = 0; i < COL[col].size(); i++) { cost[col][COL[col][i].first][COL[col][i].second] = 0; q.push({COL[col][i].first, COL[col][i].second}); } while (!q.empty()) { int x = q.front().first; int y = q.front().second; q.pop(); if (!vis[a[x][y]]) { vis[a[x][y]] = 1; for (int i = 0; i < COL[a[x][y]].size(); i++) { int nx = COL[a[x][y]][i].first; int ny = COL[a[x][y]][i].second; if (cost[col][nx][ny] == -1) { cost[col][nx][ny] = 1 + cost[col][x][y]; q.push({nx, ny}); } } } for (int i = 0; i < 4; i++) { int nx = x + di1[i]; int ny = y + di2[i]; if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && cost[col][nx][ny] == -1) { cost[col][nx][ny] = 1 + cost[col][x][y]; q.push({nx, ny}); } } } } int main() { cin >> n >> m >> k; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; COL[a[i][j]].push_back({i, j}); } } memset(cost, -1, sizeof(cost)); for (int i = 1; i <= k; i++) { bfs(i); } int q; cin >> q; while (q--) { int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey; int ans = abs(ex - sx) + abs(ey - sy); for (int i = 1; i <= k; i++) { ans = min(ans, 1 + cost[i][sx][sy] + cost[i][ex][ey]); } cout << ans << n ; } }
|
#include <bits/stdc++.h> using namespace std; long long i, i1, j, k, k1, t, n, m, res, flag[10], a, b, mt[110][110], s; char c; vector<array<long long, 6>> sl; vector<array<long long, 3>> cl; void mv(long long a, long long b, long long c, long long d, long long e, long long f) { sl.push_back({a, b, c, d, e, f}); mt[a][b] ^= 1; mt[c][d] ^= 1; mt[e][f] ^= 1; } void cl4(vector<long long> st) { long long i, l, x, s = 0; for (i = 1; i <= 4; i++) s += st[i]; if (s == 0) return; if (s == 3) { l = 0; cl.push_back({0, 0, 0}); x = cl.size(); x--; for (i = 1; i <= 4; i++) { if (st[i] == 1) { st[i] ^= 1; cl[x][l] = i; l++; } } } if (s == 2) { flag[1] = 0; l = 0; cl.push_back({0, 0, 0}); x = cl.size(); x--; for (i = 1; i <= 4; i++) { if (st[i] == 0 || (st[i] == 1 && flag[1] == 0)) { st[i] ^= 1; cl[x][l] = i; l++; if (st[i] == 0) flag[1] = 1; } } cl4(st); } if (s == 1) { flag[0] = 0; l = 0; cl.push_back({0, 0, 0}); x = cl.size(); x--; for (i = 1; i <= 4; i++) { if (st[i] == 1 || (st[i] == 0 && flag[0] < 2)) { st[i] ^= 1; cl[x][l] = i; l++; if (st[i] == 1) flag[0]++; } } cl4(st); } if (s == 4) { flag[1] = 0; l = 0; cl.push_back({0, 0, 0}); x = cl.size(); x--; for (i = 1; i <= 4; i++) { if (st[i] == 0 || (st[i] == 1 && flag[1] < 3)) { st[i] ^= 1; cl[x][l] = i; l++; if (st[i] == 0) flag[1]++; } } cl4(st); } } void init(vector<long long> st) { cl.clear(); cl4(st); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> t; while (t--) { cin >> n >> m; sl.clear(); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { cin >> c; if (c == 0 ) mt[i][j] = 0; else mt[i][j] = 1; } } for (i = 1; i <= n - 2; i++) { for (j = 1; j <= m - 1; j++) { if (mt[i][j] == 1 && mt[i][j + 1] == 1) { mv(i, j, i, j + 1, i + 1, j); } else if (mt[i][j] == 1 && mt[i][j + 1] == 0) { mv(i, j, i + 1, j, i + 1, j + 1); } else if (mt[i][j] == 0 && mt[i][j + 1] == 1) { mv(i, j + 1, i + 1, j, i + 1, j + 1); } } } if (m % 2) { if (mt[n - 1][m] == 1 && mt[n][m] == 1) { mv(n - 1, m, n, m - 1, n, m); } else if (mt[n - 1][m] == 1 && mt[n][m] == 0) { mv(n - 1, m - 1, n - 1, m, n, m - 1); } else if (mt[n - 1][m] == 0 && mt[n][m] == 1) { mv(n - 1, m - 1, n, m - 1, n, m); } } for (j = 1; j <= m - 1; j += 2) { vector<long long> st; vector<array<long long, 2>> fn; st.push_back(0); st.push_back(mt[n - 1][j]); st.push_back(mt[n - 1][j + 1]); st.push_back(mt[n][j]); st.push_back(mt[n][j + 1]); init(st); for (auto u : cl) { fn.clear(); for (i = 0; i < 3; i++) { if (u[i] == 1) fn.push_back({n - 1, j}); else if (u[i] == 2) fn.push_back({n - 1, j + 1}); else if (u[i] == 3) fn.push_back({n, j}); else if (u[i] == 4) fn.push_back({n, j + 1}); } sl.push_back({0, 0, 0, 0, 0, 0}); for (i = 0; i < 3; i++) { s = sl.size(); s--; sl[s][2 * i] = fn[i][0]; sl[s][2 * i + 1] = fn[i][1]; } } } s = sl.size(); cout << s << n ; for (auto u : sl) { for (i = 0; i < 6; i++) cout << u[i] << ; cout << n ; } } return 0; }
|
#include <bits/stdc++.h> using namespace std; int n; int sz0[400000]; vector<int> g[400000]; vector<int> c0[400000]; int centroid; int sz[400000]; vector<int> cs[400000]; int ans[400000]; void dfs0(int x) { sz0[x] = 1; for (int y : g[x]) { if (sz0[y] == 0) { c0[x].push_back(y); dfs0(y); sz0[x] += sz0[y]; } } } int findc(int x) { for (int y : c0[x]) { if (sz0[y] > n / 2) { return findc(y); } } return x; } void dfs1(int x) { sz[x] = 1; for (int y : g[x]) { if (sz[y] == 0) { cs[x].push_back(y); dfs1(y); sz[x] += sz[y]; } } } bool cmp(int a, int b) { return sz[a] > sz[b]; } void dfs2(int x, int s, int m) { if (s - m <= n / 2) ans[x] = 1; for (int y : cs[x]) { int ss = s + sz[x] - sz[y]; dfs2(y, ss, m); } } int main() { scanf( %d , &n); for (int i = 0; i < n - 1; i++) { int a, b; scanf( %d%d , &a, &b); a--; b--; g[a].push_back(b); g[b].push_back(a); } dfs0(0); centroid = findc(0); dfs1(centroid); ans[centroid] = 1; if (cs[centroid].size() == 1) { assert(n <= 2); ans[0] = ans[1] = 1; } else { vector<int>& c = cs[centroid]; sort(c.begin(), c.end(), cmp); dfs2(c[0], sz[centroid] - sz[c[0]], sz[c[1]]); for (int i = 1; i < c.size(); i++) dfs2(c[i], sz[centroid] - sz[c[i]], sz[c[0]]); if (sz[c[0]] * 2 == n) for (int i = 0; i < n; i++) ans[i] = 1; } for (int i = 0; i < n; i++) printf( %d , ans[i]); putchar( n ); }
|
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int a = min(k, 26) + 97; vector<char> b; for (int i = 97; i < a; i++) { b.push_back((char)i); } string key = ; for (int i = 0; i < b.size(); i++) key += b[i]; int c = n - k, j = 0; while (true) { key += b[j]; j++; if (j > b.size() - 1) j = 0; c--; if (c <= 0) break; } if (key.size() > n) { key.erase(key.size() - 1, 1); } cout << key; return 0; }
|
#include <bits/stdc++.h> using namespace std; string itoa(int x) { string s = ; char c; if (x < 0) x *= -1, s += - ; while (x) { c = x % 10 + 48; s += c; x /= 10; } if (s[0] == - ) reverse(s.begin() + 1, s.end()); else reverse(s.begin(), s.end()); if (s == ) s += 0 ; return s; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); priority_queue<int, vector<int>, greater<int> > pq; int n; cin >> n; string s, t, c; int x; vector<string> ans; while (n--) { cin >> s; if (s != removeMin ) { cin >> x; if (s == insert ) { pq.push(x); t = insert , c = itoa(x), t += c; ans.push_back(t); } else { while (!pq.empty() && pq.top() < x) { t = removeMin ; ans.push_back(t); pq.pop(); } if (pq.empty() || pq.top() > x) t = insert , c = itoa(x), t += c, ans.push_back(t), pq.push(x); t = getMin , c = itoa(x), t += c; ans.push_back(t); } } else { if (pq.empty()) t = insert 0 , ans.push_back(t), pq.push(0); t = removeMin , ans.push_back(t), pq.pop(); } } cout << ans.size() << n ; for (int i = 0; i < ans.size(); i++) cout << ans[i] << n ; }
|
#include <bits/stdc++.h> using namespace std; int getValue(vector<int> &ai, int n, int sum) { int val = 0; int mval = ai[ai.size() - 1]; for (int i = 1; i <= mval; i++) { if (n * i >= sum) { val = i; break; } } return val; } int main() { int q; scanf( %d , &q); for (int i = 0; i < q; i++) { int n; vector<int> ai; scanf( %d , &n); int sum = 0; for (int j = 0; j < n; j++) { int temp; scanf( %d , &temp); ai.push_back(temp); sum += temp; } sort(ai.begin(), ai.end()); int ret = getValue(ai, n, sum); printf( %d n , ret); } }
|
#include <bits/stdc++.h> using namespace std; const int N = 1000 * 100 + 3; int n, a[N]; void input() { cin >> n; for (int i = 0; i + 1 < n; i++) cin >> a[i]; } void solve() { sort(a, a + n - 1); for (int i = 0; i + 1 < n; i++) if (a[i] != i + 1) cout << i + 1 << endl, exit(0); cout << n << endl; } int main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); input(), solve(); return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( O2 ) using namespace std; inline long long input() { long long n; cin >> n; return n; } string base2(long long n) { string a = ; while (n >= 2) { a += (char)(n % 2 + 0 ); n /= 2; } a += (char)(n + 0 ); reverse((a).begin(), (a).end()); return a; } const int MAXN = 1e6 + 10; const int MOD = 1e9 + 7; const int MOD2 = 998244353; const long long INF = 8e18; long long pw(long long a, long long b, long long mod) { return (!b ? 1 : (b & 1 ? (a * pw(a * a % mod, b / 2, mod)) % mod : pw(a * a % mod, b / 2, mod))); } int n, m, mark[MAXN], king[MAXN], par[MAXN], sz[MAXN]; vector<pair<int, int> > G[MAXN]; vector<int> M; long long dis[MAXN]; pair<long long, pair<long long, long long> > E[MAXN]; vector<pair<long long, pair<long long, long long> > > E2; int GET(int x) { return ((x == par[x]) ? x : par[x] = GET(par[x])); } bool unify(int x, int y) { int v = GET(x), u = GET(y); if (v == u) return 0; if (sz[u] > sz[v]) { swap(u, v); } par[u] = v; sz[v] += sz[u]; return 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ; cin >> n >> m; for (int i = 1; i <= n; i++) dis[i] = 1e18, sz[i] = 1, par[i] = i; for (int i = 1; i <= m; i++) { int a, b, c; cin >> a >> b >> c; G[a].push_back(make_pair(b, c)); G[b].push_back(make_pair(a, c)); E[i] = make_pair(c, make_pair(a, b)); } set<pair<long long, long long> > st; int k; cin >> k; for (int i = 1; i <= k; i++) { int a; cin >> a; M.push_back(a); king[a] = a; st.insert(make_pair(0, a)); dis[a] = 0; } while (!st.empty()) { pair<long long, long long> cu = *st.begin(); st.erase(st.begin()); int v = cu.second; if (mark[v]) { continue; } mark[v] = 1; for (auto y : G[v]) { long long u = y.first, cost = y.second; if (dis[u] > dis[v] + cost) { king[u] = king[v]; dis[u] = dis[v] + cost; st.insert(make_pair(dis[u], u)); } } } for (int i = 1; i <= m; i++) { long long v = E[i].second.first, u = E[i].second.second, cost = E[i].first; if (king[u] != king[v]) { E2.push_back( make_pair(dis[v] + dis[u] + cost, make_pair(king[u], king[v]))); } } sort((E2).begin(), (E2).end()); long long MST = 0; for (auto x : E2) { long long u = x.second.first, v = x.second.second, cost = x.first; if (unify(v, u)) { MST += cost; } } set<long long> second; for (auto x : M) { second.insert(GET(x)); } if ((int)second.size() > 1) { return cout << 1e18, 0; } cout << MST + dis[1]; return 0; }
|
#include <bits/stdc++.h> using namespace std; int n, m, p[50]; int ask(int second) { cout << second << n ; fflush(stdout); cin >> second; return second; } int main() { cin >> m >> n; for (int i = 0; i < n; i++) { p[i] = ask(1); if (p[i] == 0) { cout << 1 << n ; exit(0); } } int l = 1, r = m, t = 0; while (l <= r) { int m = (l + r) / 2; int tmp = ask(m) * p[t]; if (tmp == 0) { cout << tmp << n ; exit(0); } if (tmp == -1) r = m - 1; else l = m + 1; t = (t + 1) % n; } }
|
#include <bits/stdc++.h> using namespace std; string s; long long int dp[510][501]; long long int solve(long long int l, long long int r) { if (dp[l][r] != -1) { return dp[l][r]; } if (l > r) return 0; long long int a = 1 + solve(l + 1, r); for (long long int i = l + 1; i <= r; i++) { if (s[i] != s[l]) continue; a = min(a, solve(l + 1, i - 1) + solve(i, r)); } dp[l][r] = a; return a; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n, i; cin >> n; cin >> s; memset(dp, -1, sizeof dp); cout << solve(0, s.size() - 1); }
|
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t; t = 1; while (t--) { long long n, a[1001]; cin >> n; for (int i = 0; i <= n - 1; i++) { cin >> a[i]; } sort(a, a + n); if (a[0] == 1) cout << -1; else cout << 1; } cerr << Time taken : << (float)clock() / CLOCKS_PER_SEC << secs << endl; return 0; }
|
#include <bits/stdc++.h> using namespace std; const double pi = 3.141592653589793; const int INF = 2000000000; const int mod = 1000000007; const int N = 100000000; const int base = 10; vector<int> read(string s) { vector<int> a; for (int i = (int)s.length(); i > 0; i -= 1) if (i < 1) a.push_back(atoi(s.substr(0, i).c_str())); else a.push_back(atoi(s.substr(i - 1, 1).c_str())); return a; } vector<int> add(vector<int> a, vector<int> b) { int carry = 0; for (size_t i = 0; i < max(a.size(), b.size()) || carry; ++i) { if (i == a.size()) a.push_back(0); a[i] += carry + (i < b.size() ? b[i] : 0); carry = a[i] >= base; if (carry) a[i] -= base; } return a; } vector<int> mul(vector<int> a, int b) { int carry = 0; for (size_t i = 0; i < a.size() || carry; ++i) { if (i == a.size()) a.push_back(0); long long cur = carry + a[i] * 1ll * b; a[i] = int(cur % base); carry = int(cur / base); } while (a.size() > 1 && a.back() == 0) a.pop_back(); return a; } vector<int> c; vector<int> a[100005], b[100005]; vector<bool> f; vector<bool> f1; int main() { vector<int> queue; int n, x, y, m; cin >> n >> m; for (int(i) = (0); (i) < (n); (i)++) { cin >> x; c.push_back(x); } for (int(i) = (0); (i) < (m); (i)++) { cin >> x >> y; x--; y--; a[x].push_back(y); b[y].push_back(x); } for (int(i) = (0); (i) < (c.size()); (i)++) if (c[i] == 1) { queue.push_back(i); f.push_back(true); } else { f.push_back(false); } for (int(i) = (0); (i) < (queue.size()); (i)++) { for (int(j) = (0); (j) < (a[queue[i]].size()); (j)++) { if (f[a[queue[i]][j]]) continue; queue.push_back(a[queue[i]][j]); f[a[queue[i]][j]] = true; } } queue.clear(); for (int(i) = (0); (i) < (c.size()); (i)++) if (c[i] == 2) { queue.push_back(i); f1.push_back(true); } else { f1.push_back(false); } for (int(i) = (0); (i) < (queue.size()); (i)++) { for (int(j) = (0); (j) < (b[queue[i]].size()); (j)++) { if (f1[b[queue[i]][j]]) continue; f1[b[queue[i]][j]] = true; if (c[b[queue[i]][j]] == 1) continue; queue.push_back(b[queue[i]][j]); } } for (int(i) = (0); (i) < (n); (i)++) if (f[i] && f1[i]) { cout << 1 << endl; } else { cout << 0 << endl; } return 0; }
|
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native ) using namespace std; const int MOD = 1000000007; const int UNDEF = -1; const int INF = 1 << 30; template <typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; } template <typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; } int rint() { int x; scanf( %d , &x); return x; } long long rlong() { long long x; scanf( %lld , &x); return x; } const int mn = (5e5) + 4; long long c[mn]; map<long long, vector<pair<int, int> > > sig2e; map<int, vector<int> > h; set<int> seen; int cnt = 0; void dfs(int x) { seen.insert(x); for (auto &y : h[x]) { if (seen.find(y) == seen.end()) { --cnt; dfs(y); } } } int ptwo[mn]; int main() { int n = rint(), m = rint(), k = rint(); ptwo[0] = 1; for (int i = 1; i < mn; i++) { ptwo[i] = ptwo[i - 1] * 2; if (ptwo[i] >= MOD) ptwo[i] -= MOD; } for (int x = 1; x <= n; x++) c[x] = rlong(); for (int i = 0; i < m; i++) { int x = rint(), y = rint(); long long sig = c[x] ^ c[y]; sig2e[sig].push_back(make_pair(x, y)); } int rem = (ptwo[k] - (int)sig2e.size() + MOD) % MOD; int ans = (rem * (long long)ptwo[n]) % MOD; for (auto &sigve : sig2e) { auto &ve = sigve.second; h.clear(); seen.clear(); for (auto &e : ve) { int x = e.first, y = e.second; h[x].push_back(y); h[y].push_back(x); } cnt = n; for (auto &e : ve) { int x = e.first, y = e.second; if (seen.find(x) == seen.end()) dfs(x); if (seen.find(y) == seen.end()) dfs(y); } ans += ptwo[cnt]; if (ans >= MOD) ans -= MOD; } printf( %d n , ans); }
|
#include <bits/stdc++.h> const long long mod = 1000000007; const long long Inf = 1e9; using namespace std; long long a, b, d, k, t; double f(long long x) { double res = 0; res = (double)x * (double)a + (double)(max(x / k - (x % k == 0 ? 1 : 0), (long long)0)) * (double)t + (double)(d - x) * (double)b; return res; } int main() { scanf( %I64d%I64d%I64d%I64d%I64d , &d, &k, &a, &b, &t); long long l = 1, r = d; double ans = 1e18; while (r - l > 2000000) { long long x1 = l + (r - l) / 3; long long x2 = r - (r - l) / 3; if (f(x1) > f(x2)) l = x1; else if (f(x1) < f(x2)) r = x2; else { l = x1; r = x2; } } for (long long i = l; i <= r; ++i) { ans = min(ans, f(i)); } printf( %0.lf , ans); return 0; }
|
#include <bits/stdc++.h> static int solve(); using ll = long long; int main(int argc, char* argv[]) { int tc = 1; scanf( %d , &tc); while (tc--) solve(); return 0; } static constexpr int MOD = 998244353; static int solve() { int n, x, y; scanf( %d %d %d , &n, &x, &y); int sum = x + y; int min_pos, max_pos; if (sum == n + n) { min_pos = n; max_pos = n; } else if (sum <= n) { min_pos = 1; max_pos = sum - 1; } else { min_pos = sum - n + 1; max_pos = n; } printf( %d %d n , min_pos, max_pos); return 0; }
|
#include <bits/stdc++.h> using namespace std; const int N = 100005; int power(int x, int y, int mod) { int ret = 1; for (; y; y >>= 1) { if (y & 1) ret = 1LL * ret * x % mod; x = 1LL * x * x % mod; } return ret; } int n, m; char s[N], t[N]; vector<int> primes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271}; int P[60][300]; bool isPrime(int n) { for (int i = 2; i * i <= n; ++i) if (n % i == 0) return false; return true; } int main() { scanf( %d %d , &n, &m); scanf( %s , s); scanf( %s , t); for (int i = 0; i < primes.size(); ++i) { int p = primes[i]; for (int j = 0; j < n; ++j) { P[i][j % p] += s[j] - t[j]; } } for (int p = m;; ++p) { if (!isPrime(p)) continue; for (int i = 0; i < primes.size(); ++i) { int d = primes[i]; if (d >= p) break; if ((p - 1) % d > 0) continue; int r = -1; do { r = rand() % (p - 1) + 1; } while ((r = power(r, (p - 1) / d, p)) == 1); for (int k = 0, rr = 1; k < d; ++k) { rr = 1LL * rr * r % p; int sum = 0, mul = 1; for (int j = 0; j < d; ++j) { sum = (1LL * P[i][j] * mul + sum) % p; mul = (1LL * mul * rr) % p; } if (sum == 0) return 0 * printf( %d %d n , p, rr); } } } return 0; }
|
#include <bits/stdc++.h> using namespace std; long long n, m, l, r, p, span, t, lwr, upr; long pr[200000]; vector<long> vec[200000]; long calc[200000]; long long res, nmoves[200000]; long long check[200000]; long long temp; long long answ; long long gcd(long long a, long long b) { while (a && b) a > b ? a %= b : b %= a; return a + b; } long long solve1(long long x, long long lim) { long long res = 0; for (int mask = 0; mask < (1 << (vec[x].size())); mask++) { temp = 1; for (int j = 0; j < vec[x].size(); j++) if (mask & (1 << j)) temp *= vec[x][j]; if (calc[mask] % 2) res -= lim / temp; else res += lim / temp; } return res; } long long solve(long long x, long long lim) { long long res = 0; long long ts = 0; long long q, qsum; for (int mask = 0; mask < (1 << (vec[x].size())); mask++) { temp = 1; for (int j = 0; j < vec[x].size(); j++) if (mask & (1 << j)) temp *= vec[x][j]; q = lim / temp; qsum = q * (q + 1) / 2; qsum *= temp; if (calc[mask] % 2) res -= qsum; else res += qsum; } return res; } long long gett(long long g, long long x, long long lim) { if (lim <= 0) return 0; long long tsum = (g + 1) * solve1(x, lim); tsum -= solve(x, lim); return tsum; } int main() { ios_base::sync_with_stdio(0); pr[1] = 1; for (int i = 2; i <= 100000; i++) if (pr[i] == 0) for (int j = i * 2; j <= 100000; j += i) { pr[j] = 1; vec[j].push_back(i); } for (int i = 2; i <= 100000; i++) if (pr[i] == 0) vec[i].push_back(i); calc[0] = 0; for (int i = 1; i <= (1 << 15); i++) { t = i; for (int j = 0; j < 15; j++) if (t & (1 << j)) ++calc[i]; } long long a, b; cin >> n >> m; cin >> l >> r >> p; l *= l; r *= r; for (long long span = 2; span <= 100000 && span <= n; span++) { if (span * span > r) continue; t = l - span * span; if (t <= 0) lwr = 0; else lwr = sqrt(t - 0.5) + 1; t = r - span * span; upr = sqrt(t + 0.5); if (upr >= span) upr = span - 1; if (upr > m) upr = m; if (upr < lwr) continue; res = (gett(m, span, upr) - gett(m, span, lwr - 1)) * (n - span + 1) * 2; answ = answ + res; answ %= p; } swap(n, m); for (long long span = 2; span <= 100000 && span <= n; span++) { if (span * span > r) continue; t = l - span * span; if (t <= 0) lwr = 0; else lwr = sqrt(t - 0.5) + 1; t = r - span * span; upr = sqrt(t + 0.5); if (upr >= span) upr = span - 1; if (upr > m) upr = m; if (upr < lwr) continue; res = (gett(m, span, upr) - gett(m, span, lwr - 1)) * (n - span + 1) * 2; answ = answ + res; answ %= p; } if (1 >= l && 1 <= r) answ += n * (m + 1), answ += m * (n + 1); if (2 >= l && 2 <= r) answ += 2 * n * m; cout << answ % p << endl; cin.get(); cin.get(); return 0; }
|
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string p( / ), t; while (n--) { string foo; cin >> foo; if (foo == pwd ) { cout << p << endl; } else { string dir; cin >> dir; dir += / ; for (int i = 0; i < dir.length(); i++) { t += dir[i]; if (dir[i] == / ) { if (t == / ) p = t; else if (t == ../ ) { for (int j = p.length() - 1; j > 0 && p[j - 1] != / ; j--) { p.resize(j - 1); } } else p += t; t = ; } } } } return 0; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.