solution
stringlengths 53
181k
| difficulty
int64 0
27
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string cod = "CODEFORCES";
if (s.length() < cod.length()) {
cout << "NO\n";
return 0;
}
if (s[0] == 'C') {
int in = 0;
while (in < cod.length() && in < s.length() && s[in] == cod[in]) in++;
if (in == cod.length()) {
cout << "YES\n";
return 0;
}
int kin = cod.length() - 1;
int kkin = s.length() - 1;
while (cod[kin] == s[kkin]) {
kkin--;
kin--;
}
if (in > kin) {
cout << "YES\n";
return 0;
}
}
for (int(a) = 0; (a) < (s.length()); (a)++) {
if (s[a] == 'C') {
int plu = 0;
while (a + plu < s.length() && plu < cod.length() &&
s[a + plu] == cod[plu])
plu++;
if (plu == cod.length() && a + plu == s.length()) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
return 0;
}
| 6 |
#include<bits/stdc++.h>
using namespace std;
//======================
//
// Template OleschY
//
// Die M�glichkeiten der deutschen Grammatik k�nnen
// einen, wenn man sich darauf, was man ruhig, wenn
// man m�chte, sollte, einl�sst, �berraschen.
// - @Gedankenbalsam
//
//======================
//======================
// Solution Single testcase
//======================
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // random number generator
int n, m, p; // Input
vector<long long> like; // Here we save the people preferences from input
int A[1<<15]; // this we will use to calculate A[] and B[]
long long tryPerson(int u)
{
// This is Carl
long long carl = like[u];
// We compress the bits from m to p relevant bits. Only Carls favourites remain.
vector<int> bitPos;
for(int i = 0; i < m; i++)
{
if(carl & (1ll << i))
bitPos.push_back(i);
}
// initialise A[]
int nbits = bitPos.size();
for(long long mask = 0; mask < (1ll << nbits); mask++)
{
A[mask]=0;
}
// now compress the people (also Carl) and write them into A[]
for(int i = 0; i < like.size(); i++)
{
long long cntit = 0;
for(int j = 0; j < nbits; j++)
{
if(like[i] & (1ll << bitPos[j]))
cntit |= 1ll << j;
}
A[cntit]++;
}
// Memory-optimized codesnippet for O(p*2^p) with modification for supersets
// taken from https://codeforces.com/blog/entry/45223
for(int i = 0; i < nbits; i++)
{
for(int mask = 0; mask < (1 << nbits); mask++)
{
// those two lines are the main logic. Here we transofrom A[] into B[].
// We can do this in place without using a new array
if(mask & (1 << i))
A[mask - (1 << i)] += A[mask];
}
}
// Check for the best solution which we have found
long long bestCurr = 0;
for(long long mask = 0; mask < (1ll << nbits); mask++)
{
if(A[mask] >= (like.size() + 1) / 2)
if(__builtin_popcountll(mask) > __builtin_popcountll(bestCurr))
bestCurr = mask;
}
// Decompress the best answer now
long long bestCurrTrans = 0;
for(int j = 0; j < bitPos.size(); j++)
{
if(bestCurr & (1ll << j))
bestCurrTrans |= 1ll << bitPos[j];
}
return bestCurrTrans;
}
int solve()
{
// Read all inputs. Write the preferences of everyone into like[]
cin >> n >> m >> p;
like.resize(n, 0);
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < m; ++j)
{
char c;
cin >> c;
if(c == '1')
{
like[i] |= 1ll << j;
}
}
}
// shuffle to implement the randomized solution. Check for 20 people.
shuffle(like.begin(), like.end(), rng);
long long ans = 0;
for(int attempt = 0; attempt < min(20, (int) like.size()); attempt++)
{
long long tempans = tryPerson(attempt);
// check if the answer is better than the previous
if(__builtin_popcountll(tempans) > __builtin_popcountll(ans))
ans = tempans;
}
// output the answer
for(int i = 0; i < m; i++)
{
if(ans & (1ll << i))
cout << 1 ;
else
cout << 0 ;
}
cout << "\n";
return 0;
}
//======================
// Technical stuff
//======================
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("a.out","w",stdout); // console output is better (in most cases)
#else
// add i/o method of specific testing system
#endif
int ntest = 1;
//cin >> ntest;
for(int test = 0; test < ntest; ++test)
{
solve();
}
return 0;
} | 16 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> adj[101101];
int col[101101];
double l[101101];
double dfs(int v) {
if (col[v]) return l[v];
col[v] = 1;
double ret = 0;
int sz = adj[v].size();
for (int i = 0; i < sz; i++) {
int u = adj[v][i];
if (!col[u]) ret += (dfs(u) + 1) / (sz - 1);
}
return l[v] = ret;
}
int main() {
scanf("%d", &n);
int u, v;
for (int i = 0; i < n - 1; i++) {
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
col[1] = 1;
double ans = 0;
int sz = adj[1].size();
for (int i = 0; i < sz; i++) {
u = adj[1][i];
ans += (dfs(u) + 1) / sz;
}
printf("%.9f\n", ans);
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int func(int g, int b) { return (g - 1 <= b && b <= 2 * (g + 1)); }
int main() {
int al, ar, bl, br;
cin >> al >> ar >> bl >> br;
if (func(al, br) || func(ar, bl))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = INT_MAX;
const long long INFll = LLONG_MAX;
const long long mod = 998244353;
const double EPS = 1e-17;
void solveA();
void solveB();
void solveC();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solveA();
return 0;
}
vector<int> mark;
vector<vector<int>> adList;
vector<pair<int, int>> w;
bool dfs(int v) {
for (int to : adList[v]) {
if (!mark[to]) {
mark[to] = -mark[v];
if (!dfs(to)) return false;
} else if (mark[to] == mark[v]) {
return false;
}
}
return true;
}
bool check(int a, int b) {
return (w[a].first < w[b].first && w[a].second > w[b].first &&
w[a].second < w[b].second);
}
void solveA() {
int n, m;
cin >> n >> m;
mark.resize((unsigned)m);
adList.resize((unsigned)m);
w.resize((unsigned)m);
for (int i = 0; i < m; i++) {
cin >> w[i].first >> w[i].second;
if (w[i].first > w[i].second) swap(w[i].first, w[i].second);
for (int j = 0; j < i; j++) {
if (check(i, j) || check(j, i)) {
adList[i].push_back(j);
adList[j].push_back(i);
}
}
}
for (int i = 0; i < m; i++) {
if (!mark[i]) {
mark[i] = 1;
if (!dfs(i)) {
cout << "Impossible";
return;
}
}
}
for (int i = 0; i < m; i++) cout << ((mark[i] == -1) ? "i" : "o");
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<int> v;
int n;
cin >> n;
int a[5001] = {0};
for (int i = 2; i * i <= 5000; i++) {
if (a[i] == 0) {
for (int j = i * i; j <= 5000; j += i) a[j] = 1;
}
}
for (int i = 2; i <= 5000; i++)
if (a[i] == 0) v.push_back(i);
vector<pair<int, int>> ans;
for (int i = 1; i < n; i++) ans.push_back({i, i + 1});
ans.push_back({n, 1});
auto it = lower_bound(v.begin(), v.end(), n);
int h = *it, i = 1;
h -= n;
while (h--) {
ans.push_back({i, i + n / 2});
i++;
}
cout << ans.size() << "\n";
for (int i = 0; i < (int)ans.size(); i++)
cout << ans[i].first << " " << ans[i].second << "\n";
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
double eps = 1e-12;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string S;
cin >> S;
string initial;
int n = S.size();
int center = (n - 1) / 2;
initial += S[center];
for (int i = 1; i < center + 1; i++) {
initial += S[center + i];
initial += S[center - i];
}
if (n % 2 == 0) initial += S[n - 1];
cout << initial;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100224;
const double timeLimit = 2.94;
set<pair<int, int> > s;
int n, m, perm[maxN];
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
clock_t start = clock();
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
if (u > v) swap(u, v);
s.insert(pair<int, int>(u, v));
s.insert(pair<int, int>(v, u));
}
for (int i = 1; i <= n; i++) {
perm[i] = i;
}
int cnt = 0;
while ((double)(clock() - start) < timeLimit * CLOCKS_PER_SEC) {
random_shuffle(perm + 1, perm + n + 1);
perm[n + 1] = perm[1];
cnt = 0;
for (int i = 1; i <= n; i++) {
if (s.find(pair<int, int>(perm[i], perm[i + 1])) == s.end()) {
++cnt;
}
}
if (cnt >= m) {
for (int i = 1; i <= n && m; i++) {
if (!s.count(pair<int, int>(perm[i], perm[i + 1]))) {
--m;
cout << perm[i] << " " << perm[i + 1] << "\n";
}
}
return 0;
}
}
cout << -1 << "\n";
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e17;
int al[30];
int main() {
int n;
cin >> n;
int ans = 0;
bool k = 0;
for (int i = 0; i < n - 1; i++) {
char a;
string b;
cin >> a >> b;
if (a == '.') {
for (char j : b) al[j - 'a'] = -1;
} else
ans += k;
if (a == '?') al[b[0] - 'a'] = -1;
if (a == '!') {
for (int j = 0; j < 26; j++) {
if (b.find(char('a' + j)) == std::string::npos) {
al[j] = -1;
}
}
}
int s = 0;
for (int j = 0; j < 26; j++)
if (al[j] == 0) s++;
if (s == 1) k = true;
}
cout << ans;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int c = 4002, k = -1e9;
int n, m, l[c], s[c], f[c], dp[c][c], maxi;
void upd(int a, int b) {
if (a > m) return;
for (int i = 1; i <= b + 1; i++) {
int x = i - 1;
dp[a][x] =
max(dp[a][x], f[a] * x + max(dp[a - 1][2 * x], dp[a - 1][2 * x + 1]));
}
upd(a + 1, b / 2);
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m, m = n + m;
for (int i = 1; i <= n; i++) cin >> l[n + 1 - i];
for (int i = 1; i <= n; i++) cin >> s[n + 1 - i];
for (int i = 1; i <= m; i++) cin >> f[i];
for (int i = 1; i <= m; i++)
for (int j = 1; j <= m + 1; j++) dp[i][j] = k;
for (int i = 1; i <= n; i++) {
int x = l[i], p = f[x] - s[i];
for (int j = m; j > 0; j--) {
dp[x][j] = max(dp[x][j], dp[x][j - 1] + p);
}
upd(x + 1, m / 2);
}
for (int i = 1; i <= m; i++) maxi = max(maxi, dp[i][1]);
cout << maxi << "\n";
return 0;
}
| 20 |
#include <bits/stdc++.h>
using namespace std;
void debug() {
fflush(stdin);
printf("Press any key to continue");
getc(stdin);
fflush(stdin);
}
int k;
int a[105][105];
int fun(int n, int i) {
int ans = 0;
for (int j = 1; j < n; j++) {
if (j != i && a[n][j] == 1 && a[i][j] == 1) {
ans++;
}
}
return ans;
}
void fun() {
int cur = 0;
for (int n = 2; n <= 100; n++) {
for (int i = 1; i < n; i++) {
int tmp = fun(n, i);
if (cur + tmp == k) {
a[n][i] = 1;
a[i][n] = 1;
printf("%d\n", n);
for (int u = 1; u <= n; u++) {
for (int v = 1; v <= n; v++) printf("%d", a[u][v]);
printf("\n");
}
return;
} else if (cur + tmp < k) {
a[n][i] = 1;
a[i][n] = 1;
cur += tmp;
}
}
}
}
int main() {
std::ios::sync_with_stdio(false);
cin >> k;
fun();
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > roads;
vector<int> edge[100005];
int par[100005], kids[100005], edge_w[100005];
void dfs(int u) {
kids[u] = 1;
for (int i = 0, v; i < edge[u].size(); i++) {
v = edge[u][i];
if (v == par[u]) {
continue;
}
par[v] = u;
dfs(v);
kids[u] += kids[v];
}
}
long long comb(int n, int k) {
if (n < k) {
return 0;
}
long long res = 1;
for (int i = 0; i < k; i++) {
res = res * (n - i);
res = res / (i + 1);
}
return res;
}
long long cal(int n, int m) {
long long val1 = n, val2 = m;
long long res = val1 * comb(val2, 2);
res = res + val2 * comb(val1, 2);
return res;
}
int main() {
int n, q, u, v, w;
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
scanf("%d %d %d", &u, &v, &w);
edge[u].push_back(v);
edge[v].push_back(u);
edge_w[i] = w;
roads.push_back(make_pair(u, v));
}
dfs(1);
long long den = comb(n, 3);
double res = 0, prob;
long long x, y;
for (int i = 0; i < n - 1; i++) {
u = roads[i].first;
v = roads[i].second;
if (v == par[u]) {
swap(u, v);
}
x = kids[v];
y = n - x;
roads[i].first = x;
roads[i].second = y;
prob = (cal(x, y) * 1.0) / den;
res += (prob * edge_w[i] * 2.0);
}
int id, wt;
scanf("%d", &q);
while (q--) {
scanf("%d %d", &id, &wt);
id--;
y = roads[id].second;
x = roads[id].first;
prob = (cal(x, y) * 1.0) / den;
double curr = prob * 1.0 * (edge_w[id] - wt) * 2.0;
edge_w[id] = wt;
res -= curr;
printf("%0.10lf\n", res);
}
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
int n, q;
int a[100005];
int dp[100005][405];
int getdp(int p, int k) {
if (p > n) return 0;
if (k > (int)sqrt(n)) return 1 + getdp(p + a[p] + k, k);
int& ret = dp[p][k];
if (ret != -1) return ret;
return ret = 1 + getdp(p + a[p] + k, k);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof(dp));
cin >> q;
for (int i = 0; i < q; i++) {
int p, k;
cin >> p >> k;
cout << getdp(p, k) << endl;
}
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> items(k + 1);
for (int i = 1; i <= k; i++) {
int num;
cin >> num;
items[num] = i;
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int num, index;
cin >> num;
index = items[num];
ans += index;
for (int x = 1; x <= k; x++) {
if (items[x] < index) {
items[x] += 1;
}
}
items[num] = 1;
}
}
cout << ans << endl;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
string cal(string s) {
int64_t tmp1 = 0;
char ch;
int64_t tmp2 = 0;
int i;
for (i = 0; i < s.size(); i++) {
if (s[i] != '*' && s[i] != '+')
tmp1 = tmp1 * 10 + s[i] - '0';
else {
ch = s[i];
break;
}
}
for (i = i + 1; i < s.size(); i++) {
if (s[i] != '*' && s[i] != '+') tmp2 = tmp2 * 10 + s[i] - '0';
}
int64_t tmp;
if (ch == '*')
tmp = tmp1 * tmp2;
else
tmp = tmp1 + tmp2;
stringstream ss;
ss << tmp;
ss >> s;
return s;
}
string solve(string s) {
for (int i = 0; i < s.size(); i++)
if (s[i] == '*') {
int j;
for (j = i - 1; j >= 0; j--)
if (s[j] == '*' || s[j] == '+') break;
j++;
int st = j;
int SZ = 0;
for (j = i + 1; j < s.size(); j++, SZ++)
if (s[j] == '*' || s[j] == '+') {
break;
}
j--;
SZ += i - st + 1;
i = st;
s.replace(st, SZ, cal(s.substr(st, SZ)));
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '+') {
int j;
for (j = i - 1; j >= 0; j--)
if (s[j] == '*' || s[j] == '+') break;
j++;
int st = j;
int SZ = 0;
for (j = i + 1; j < s.size(); j++, SZ++)
if (s[j] == '*' || s[j] == '+') {
break;
}
j--;
SZ += i - st + 1;
i = st;
s.replace(st, SZ, cal(s.substr(st, SZ)));
}
}
return s;
}
int arr[20], C = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
string s;
cin >> s;
arr[C++] = -1;
for (int i = 0; i < s.size(); i++)
if (s[i] == '*') arr[C++] = i;
arr[C++] = s.size() + 1;
int64_t ans = 0;
for (int i = 0; i < C; i++)
for (int j = i + 1; j < C; j++) {
string tmpo = s;
int st, SZ;
st = arr[i] + 1;
SZ = arr[j] - st;
string t = solve(tmpo.substr(st, SZ));
tmpo.replace(st, SZ, t);
string str = solve(tmpo);
stringstream ss;
int64_t tmp;
ss << str;
ss >> tmp;
ans = max(ans, tmp);
}
cout << ans;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
int n, m, t;
string a[510];
int iWeekJClasses[510][510];
int total[510];
int dp[510][510];
int minHours(int week, int classes) {
int minHrs = 300010;
int last = 0;
int cnt = 0;
int j = 0;
while (j < m && a[week][j] != '1') ++j;
for (int i = (j); i < (m); ++i) {
cnt += (a[week][i] == '1') ? 1 : 0;
if (cnt == classes) {
minHrs = min(minHrs, i - j + 1);
++j;
while (j < m && a[week][j] != '1') ++j;
cnt--;
}
}
return minHrs;
}
int main() {
cin >> n >> m >> t;
for (int i = (0); i < (n); ++i) {
cin >> a[i];
}
for (int i = (0); i < (n); ++i) {
iWeekJClasses[i][0] = 0;
for (int j = (1); j < (m + 1); ++j) {
iWeekJClasses[i][j] = minHours(i, j);
}
}
for (int i = (0); i < (n); ++i) {
int counter = 0;
for (int j = (0); j < (m); ++j) {
counter += (a[i][j] == '1') ? 1 : 0;
}
total[i] = counter;
}
for (int j = (0); j < (t + 1); ++j) {
dp[0][j] = iWeekJClasses[0][total[0] - j];
}
for (int i = (1); i < (n); ++i) {
for (int j = (0); j < (t + 1); ++j) {
dp[i][j] = INT_MAX;
for (int k = (0); k < (j + 1); ++k) {
dp[i][j] =
min(dp[i][j], dp[i - 1][k] + iWeekJClasses[i][total[i] - (j - k)]);
}
}
}
int ans = INT_MAX;
for (int j = (0); j < (t + 1); ++j) {
ans = min(ans, dp[n - 1][j]);
}
cout << ans << endl;
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
set<int> e[MAXN], st;
bool vis[MAXN], on_edge[MAXN];
int main() {
ios::sync_with_stdio(false);
int n, m, x, y;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> x >> y;
e[x].insert(y);
e[y].insert(x);
}
for (int i = 1; i <= n; i++) st.insert(i);
int ans = 0;
queue<int> q;
for (int i = 1; i <= n; i++) {
if (vis[i]) continue;
ans++;
vis[i] = true;
q.push(i);
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto j = st.begin(); j != st.end();) {
int v = *j++;
if (vis[v]) continue;
if (!e[now].count(v)) {
vis[v] = true;
q.push(v);
st.erase(v);
}
}
}
}
cout << ans - 1 << endl;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
void affiche(int t[], int n) {
for (int i = 0; i < n; i++) cout << t[i] << " ";
cout << '\n';
}
void afficheV(vector<long long> t) {
for (int i = 0; i < t.size(); i++) cout << t[i] << " ";
cout << '\n';
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, k;
cin >> n >> k;
int t[n];
for (int i = 0; i < n; i++) cin >> t[i];
sort(t, t + n);
int ans = t[k - 1];
if (k == 0) {
if (t[0] == 1)
return cout << -1, 0;
else
return cout << 1, 0;
}
if (k == n) return cout << t[k - 1], 0;
if (t[k] != t[k - 1]) {
cout << ans;
} else
cout << -1;
}
| 4 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
#define Ri register
typedef long long ll;
const int N = 1e5 + 100, M = 500;
int n, f[N], son[N], dep[N], A, B, maxdep;
int ansnum, ls[N], tot, fre[N], dp[M][N];
char ans[N];
vector<int> ed[N], d[N];
int cnt[N];
void dfs(int u) {
dep[u] = dep[f[u]]+ 1;
d[dep[u]].push_back(u);
maxdep = max(maxdep, dep[u]);
for (auto v : ed[u]) {
if (v == f[u]) continue;
dfs(v);
}
}
int Find(int x) {
return lower_bound(ls + 1, ls + 1 + tot, x) - ls;
}
int cmp(int a, int b) {
return son[a] > son[b];
}
void findcnt(int layer, int cur) {
if (layer == 0) return;
cnt[layer] = dp[layer][cur];
findcnt(layer-1, cur - cnt[layer] * ls[layer]);
}
void solve(int pos) {
int num = d[pos].size();
if (min(A, B) >= num) {
if (A > B) {
for (auto i : d[pos])
ans[i] = 'b';
B -= num;
}
else {
for (auto i : d[pos])
ans[i] = 'a';
A -= num;
}
}
else if (max(A, B) >= num) {
if (A >= num) {
for (auto i : d[pos])
ans[i] = 'a';
A -= num;
}
else {
for (auto i : d[pos])
ans[i] = 'b';
B -= num;
}
}
else {
ansnum++;
if (A > B) {
for (auto i : d[pos]) {
if (A) { ans[i] = 'a'; A--; }
else { ans[i] = 'b'; B--; }
}
}
else {
for (auto i : d[pos]) {
if (B) {ans[i] = 'b'; B--;}
else {ans[i] = 'a'; A--;}
}
}
}
}
int main() {
scanf("%d%d", &n, &A);
B = n - A;
for (int i = 2; i <= n; ++i) {
scanf("%d", &f[i]);
son[f[i]]++;
ed[i].push_back(f[i]);
ed[f[i]].push_back(i);
}
dfs(1);
ansnum = maxdep;
for (int i = 1; i <= maxdep; ++i)
sort(d[i].begin(), d[i].end(), cmp);
for (int i = 1; i <= maxdep; ++i)
ls[i] = d[i].size();
tot = maxdep;
sort(ls + 1, ls + 1 + tot);
tot = unique(ls + 1, ls + 1 + tot) - ls - 1;
for (int i = 1; i <= maxdep; ++i)
fre[Find(d[i].size())]++;
memset(dp, -1, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= tot; ++i) {
for (int j = 0; j <= n; ++j) {
if (dp[i - 1][j] >= 0)
dp[i][j] = 0;
else if (j - ls[i] >= 0 && dp[i][j - ls[i]] >= 0 && dp[i][j - ls[i]] < fre[i])
dp[i][j] = dp[i][j - ls[i]] + 1;
}
}
if (dp[tot][A] >= 0) {
findcnt(tot, A);
for (int i = 1; i <= maxdep; ++i) {
int x = Find(d[i].size());
if (cnt[x]) {
cnt[x]--;
for (auto j : d[i])
ans[j] = 'a';
}
else {
for (auto j : d[i])
ans[j] = 'b';
}
}
printf("%d\n", maxdep);
printf("%s\n", ans + 1);
return 0;
}
for (int i = 1; i <= maxdep; ++i) {
solve(i);
}
printf("%d\n", ansnum);
printf("%s\n", ans + 1);
return 0;
} | 23 |
#include <bits/stdc++.h>
using namespace std;
struct ha {
long long x;
long long a;
};
bool cmp(ha a, ha b) {
if (a.x == b.x) return a.a < b.a;
return a.x < b.x;
}
vector<ha> v;
int main() {
long long h, q, i, cl, cr, ch, ii, l, r, br = 1, a, p = 1, n = 1;
ha e;
cin >> h >> q;
for (i = 1; i < h; i++) {
p *= 2;
n = n * 2 + 1;
}
e.x = p;
e.a = 1;
v.push_back(e);
e.x = n + 1;
e.a = -1;
v.push_back(e);
for (i = 0; i < q; i++) {
cin >> ii >> l >> r >> a;
if (a) br++;
for (; ii < h; ii++) {
l *= 2;
r = (r * 2) + 1;
}
e.x = l;
if (a)
e.a = 1;
else
e.a = -1;
v.push_back(e);
e.x = r + 1;
if (a == 0)
e.a = 1;
else
e.a = -1;
v.push_back(e);
}
sort(v.begin(), v.end(), cmp);
long long c = 0, t = 0, o = -1;
for (i = 0; i < v.size(); i++) {
c += v[i].a;
if (c == br) {
if (t == 1) t = 2;
if (t == 0) {
t = 1;
o = v[i].x;
}
if (v[i + 1].x != v[i].x + 1) t = 2;
}
}
if (t == 0)
cout << "Game cheated!\n";
else if (t == 1)
cout << o << endl;
else
cout << "Data not sufficient!\n";
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
int gcdExtended(int a, int b, int *x, int *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
int x1, y1;
int gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
long long int modInverse(int a, int m) {
int x, y;
int g = gcdExtended(a, m, &x, &y);
long long int res = ((long long int)x % m + (long long int)m) % m;
return res;
}
long long int poww(long long int x, long long int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return poww(x * x, n / 2);
else
return x * poww(x * x, (n - 1) / 2);
}
long long int modularExponentiation(long long int x, long long int n,
long long int M) {
long long int result = 1;
while (n > 0) {
if (n % 2 == 1) result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
inline long long int max(long long int a, long long int b) {
if (a > b)
return a;
else
return b;
}
inline long long int min(long long int a, long long int b) {
if (a > b)
return b;
else
return a;
}
int gcd(int a, int b) {
if (a == 0) return b;
if (b == 0) return a;
if (a == b) return a;
if (a > b)
return gcd(a - b, b);
else
return gcd(a, b - a);
}
long long int ncr(int n, int r) {
long long int ans = 1;
r = min(r, n - r);
for (int i = 0; i < r; i++) {
ans = (ans * (n - i) / (i + 1)) % 1000000007;
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
long long int n, m, k;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
;
long long int ans = -1, ind = -1;
k = 1 << 30;
while (k > 0) {
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] & k) count++;
}
if (count == 1) {
for (int i = 0; i < n; i++) {
if (a[i] & k) {
ind = i;
break;
}
}
break;
}
k = k >> 1;
}
if (ind != -1) {
cout << a[ind] << " ";
for (int i = 0; i < n; i++) {
if (i != ind) cout << a[i] << " ";
}
} else {
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
}
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
void print(std::string& in, int pos) {
int i = 0;
for (i; i < in.length(); i++) {
if (in[i] == '1') {
break;
}
}
for (i; i < in.length(); i++) {
if (i != pos) {
std::cout << in[i];
}
}
std::cout << std::endl;
}
void process(std::string& in) {
for (int i = 0; i < in.length(); i++) {
if (in[i] == '0') {
print(in, i);
return;
}
}
print(in, 0);
}
int main() {
std::string in;
while (std::cin >> in) {
process(in);
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 9;
string s;
int l, r, st[MAX], t = 1, cnt[MAX], ans;
int main() {
cin >> s;
s += 's';
for (int i = s.size(); i >= 1; i--) s[i] = s[i - 1];
s[0] = ' ';
for (int i = 1; i < s.size(); i++) {
cnt[i] = cnt[i - 1] + (s[i] == '[');
if (s[i] == '[' || s[i] == '(')
st[t++] = i;
else if (s[i] == ']' && s[st[t - 1]] != '[' ||
s[i] == ')' && s[st[t - 1]] != '(')
t = 0, st[t++] = i;
else {
t--;
if (ans < cnt[i] - cnt[st[t - 1]])
ans = cnt[i] - cnt[st[t - 1]], l = st[t - 1], r = i;
}
}
cout << ans << '\n' << s.substr(l + 1, r - l);
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int m, n;
string s;
const int m_ = 2010;
long long int mm = (long long int)(1e9 + 7);
long long int dp[m_][m_];
int main() {
cin >> n >> m;
cin >> s;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= 2000; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
for (int i = 1; i <= n - m; i++) {
for (int j = 0; j <= i; j++) {
if (j - 1 >= 0) {
dp[i][j] = dp[i - 1][j - 1];
}
if (j + 1 <= i) {
dp[i][j] += dp[i - 1][j + 1];
}
dp[i][j] %= mm;
}
}
int b = 0;
int mb = 0;
for (int i = 0; i < m; i++) {
if (s[i] == '(') {
b++;
} else {
b--;
}
mb = min(mb, b);
}
long long int ans = 0;
for (int i = 0; i <= n - m; i++) {
for (int j = 0; j <= i; j++) {
if (j + mb >= 0) {
if (j + b <= (n - m - i) && j + b >= 0) {
ans = (ans + (dp[i][j] * dp[n - m - i][j + b]) % mm) % mm;
}
}
}
}
cout << (ans % mm) << endl;
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, can_delete = 0, i, star = 0;
string s, temp, ans;
cin >> s;
cin >> a;
for (i = 0; i < s.length(); i++) {
if (s[i] == '?')
can_delete++;
else if (s[i] == '*') {
can_delete++;
star = 1;
} else
temp += s[i];
}
if (temp.length() == a) {
cout << temp;
return 0;
}
b = a - temp.length();
if (b < 0) {
b *= -1;
if (b <= can_delete) {
for (i = 0; i < s.length(); i++) {
if (s[i] == '?' && b > 0) {
int len = ans.length();
len--;
ans.erase(ans.begin() + len);
b--;
} else if (s[i] == '*' && b > 0) {
int len = ans.length();
len--;
ans.erase(ans.begin() + len);
b--;
} else if (s[i] != '*' && s[i] != '?')
ans += s[i];
}
cout << ans << endl;
} else
cout << "Impossible" << endl;
} else if (star == 1) {
for (i = 0; i < s.length(); i++) {
if (s[i] == '*' && b > 0) {
char x;
int len = ans.length();
len--;
x = ans[len];
while (b--) {
ans += x;
}
}
if (s[i] != '?' && s[i] != '*') ans += s[i];
}
cout << ans << endl;
} else
cout << "Impossible" << endl;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 10 >= 1) {
if (n % 10 != 0) {
if (n / 10 == 9) cout << "ninety-";
if (n / 10 == 8) cout << "eighty-";
if (n / 10 == 7) cout << "seventy-";
if (n / 10 == 6) cout << "sixty-";
if (n / 10 == 5) cout << "fifty-";
if (n / 10 == 4) cout << "forty-";
if (n / 10 == 3) cout << "thirty-";
if (n / 10 == 2) cout << "twenty-";
} else if (n % 10 == 0) {
if (n / 10 == 9) cout << "ninety";
if (n / 10 == 8) cout << "eighty";
if (n / 10 == 7) cout << "seventy";
if (n / 10 == 6) cout << "sixty";
if (n / 10 == 5) cout << "fifty";
if (n / 10 == 4) cout << "forty";
if (n / 10 == 3) cout << "thirty";
if (n / 10 == 2) cout << "twenty";
if (n / 10 == 1) cout << "ten";
return 0;
}
if (n / 10 == 1) {
if (n % 10 == 0) {
cout << "ten" << endl;
return 0;
} else if (n % 10 == 1) {
cout << "eleven" << endl;
return 0;
} else if (n % 10 == 2) {
cout << "twelve" << endl;
return 0;
} else if (n % 10 == 3) {
cout << "thirteen" << endl;
return 0;
} else if (n % 10 == 4) {
cout << "fourteen" << endl;
return 0;
} else if (n % 10 == 5) {
cout << "fifteen" << endl;
return 0;
} else if (n % 10 == 6) {
cout << "sixteen" << endl;
return 0;
} else if (n % 10 == 7) {
cout << "seventeen" << endl;
return 0;
} else if (n % 10 == 8) {
cout << "eighteen" << endl;
return 0;
} else if (n % 10 == 9) {
cout << "nineteen" << endl;
return 0;
}
}
if (n % 10 == 0) {
} else if (n % 10 == 1) {
cout << "one" << endl;
return 0;
} else if (n % 10 == 2) {
cout << "two" << endl;
return 0;
} else if (n % 10 == 3) {
cout << "three" << endl;
return 0;
} else if (n % 10 == 4) {
cout << "four" << endl;
return 0;
} else if (n % 10 == 5) {
cout << "five" << endl;
return 0;
} else if (n % 10 == 6) {
cout << "six" << endl;
return 0;
} else if (n % 10 == 7) {
cout << "seven" << endl;
return 0;
} else if (n % 10 == 8) {
cout << "eight" << endl;
return 0;
} else if (n % 10 == 9) {
cout << "nine" << endl;
return 0;
}
} else {
if (n % 10 == 0) {
cout << "zero" << endl;
} else if (n % 10 == 1) {
cout << "one" << endl;
return 0;
} else if (n % 10 == 2) {
cout << "two" << endl;
return 0;
} else if (n % 10 == 3) {
cout << "three" << endl;
return 0;
} else if (n % 10 == 4) {
cout << "four" << endl;
return 0;
} else if (n % 10 == 5) {
cout << "five" << endl;
return 0;
} else if (n % 10 == 6) {
cout << "six" << endl;
return 0;
} else if (n % 10 == 7) {
cout << "seven" << endl;
return 0;
} else if (n % 10 == 8) {
cout << "eight" << endl;
return 0;
} else if (n % 10 == 9) {
cout << "nine" << endl;
return 0;
}
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int L = 840;
const int UP = 8 * L;
long long f[9][UP + 3], a[9], n;
int main() {
scanf("%lld", &n);
memset(f, -1, sizeof(f));
f[0][0] = 0;
for (int i = 1; i <= 8; ++i) {
scanf("%lld", &a[i]);
for (long long j = 0; j <= min(a[i], (long long)L / i); ++j) {
for (int k = 0; k <= min(n, (long long)UP) - j * i; ++k) {
if (f[i - 1][k] != -1)
f[i][k + j * i] =
max(f[i][k + j * i], f[i - 1][k] + (a[i] - j) / (L / i));
}
}
}
long long res = 0;
for (int i = 0; i <= min(n, (long long)UP); ++i) {
if (f[8][i] == -1) continue;
res = max(res, i + min(n - i - (n - i) % L, f[8][i] * L));
}
printf("%lld\n", res);
return 0;
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
int prioridade[220 * 2];
int resp[220 * 2];
int fixo[220 * 2];
unsigned long long dp[220 * 2][220 * 2];
int M[110 * 2][110 * 2];
int v[220 * 2];
int n, m;
bool comp(int a, int b) { return prioridade[a] < prioridade[b]; }
unsigned long long get(int x, int qnt) {
("x=%d qnt=%d fixo[%d]=%d\n", x, qnt, x, fixo[x]);
if (qnt == -1) return 0;
if (dp[x][qnt] + 1) return dp[x][qnt];
if (x == n + m - 1) return (qnt == 0) ? 1 : 0;
if (fixo[x])
return dp[x][qnt] = ((2500000000000000000LL < get(x + 1, qnt + resp[x]))
? 2500000000000000000LL
: get(x + 1, qnt + resp[x]));
return dp[x][qnt] = ((2500000000000000000LL <
get(x + 1, qnt - 1) + get(x + 1, qnt + 1))
? 2500000000000000000LL
: get(x + 1, qnt - 1) + get(x + 1, qnt + 1));
}
int main() {
long long k;
scanf("%d%d", &n, &m);
cin >> k;
for (int i = 0; i < 220; i++) prioridade[i] = 999999999;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &M[i][j]);
prioridade[i + j] = min(prioridade[i + j], M[i][j]);
}
}
for (int i = 0; i < n + m - 1; i++) v[i] = i;
sort(v, v + n + m - 1, comp);
for (int i = 0; i < n + m - 1; i++) {
("fixa %d\n", v[i]);
assert(!fixo[v[i]]);
fixo[v[i]] = 1;
resp[v[i]] = 1;
memset(dp, -1, sizeof(dp));
if (get(0, 0) < k) {
k -= get(0, 0);
resp[v[i]] = -1;
}
}
assert(k == 1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
printf("%c", (resp[i + j] == 1) ? '(' : ')');
if (resp[i + j] == 0) printf("?");
}
printf("\n");
}
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
int t;
map<int, int> has;
long long fj[55][50], gs[55], bh;
long long n, k;
const long long S = 31624000;
const long long mf = 1e5 + 10;
bool is[S];
long long p[2000000];
void init() {
for (int i = 2; i < S; i++) {
if (!is[i]) p[++p[0]] = i;
for (int j = 1; j <= p[0] && p[j] * i < S; j++) {
is[i * p[j]] = 1;
if (i % p[j] == 0) break;
}
}
}
long long mx, dis[mf];
vector<pair<int, int> > e[mf];
vector<int> ans[51];
long long Q[mf * 100], vis[mf];
void build(long long z) {
mx = fj[z][1];
for (int i = 0; i < mx; i++) {
e[i].clear();
for (int j = 1; j <= gs[z]; j++)
e[i].push_back(make_pair((i + fj[z][j]) % mx, fj[z][j]));
}
memset(dis, 127, sizeof dis);
dis[0] = 0;
int L = 0, R = 1;
Q[R] = 0;
while (L < R) {
int x = Q[++L];
vis[x] = 0;
for (int i = 0; i < e[x].size(); i++) {
long long y = e[x][i].first, c = e[x][i].second;
if (dis[x] + c < dis[y]) {
dis[y] = dis[x] + c;
if (!vis[y]) {
vis[y] = 1;
Q[++R] = y;
}
}
}
}
for (int i = 0; i < mx; i++) ans[z].push_back(dis[i]);
}
int fen(long long x) {
bh++;
for (int i = 1; p[i] * p[i] <= x; i++) {
if (x % p[i] == 0) {
fj[bh][++gs[bh]] = p[i];
while (x % p[i] == 0) x /= p[i];
}
}
if (x != 1) fj[bh][++gs[bh]] = x;
if (gs[bh] >= 3) build(bh);
return bh;
}
void getans(int n, int z) {
if (n < fj[z][1])
printf("NO\n");
else if (ans[z][n % fj[z][1]] <= n)
printf("YES\n");
else
printf("NO\n");
}
long long ksm(long long x, long long y, long long mo) {
long long ret = 1;
for (; y; y >>= 1) {
if (y & 1) ret = ret * x % mo;
x = x * x % mo;
}
return ret;
}
int main() {
init();
for (cin >> t; t; t--) {
scanf("%I64d %I64d", &n, &k);
int &z = has[k];
if (!z) z = fen(k);
if (k == 1) {
printf("NO\n");
continue;
}
if (gs[z] == 1) {
printf(n % fj[z][1] ? "NO\n" : "YES\n");
} else if (gs[z] == 2) {
long long a = fj[z][1], b = fj[z][2];
long long my = ksm(b, a - 2, a) * (n % a) % a;
if (my * b <= n)
printf("YES\n");
else
printf("NO\n");
} else
getans(n, z);
}
}
| 25 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
vector<long long> a;
int f(int x) {
if (x == 1) return 1;
if (x == 2) return 0;
if (x == 3) return 1;
if (x == 4) return 2;
if (x % 2) return 0;
return (f(x / 2) == 1 ? 2 : 1);
}
int g(int x) {
if (x == 1) return 1;
if (x == 2) return 2;
return (x % 2) ^ 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i) cin >> a[i];
long long res = 0;
for (int i = 0; i < n; ++i) res ^= (k % 2 ? f(a[i]) : g(a[i]));
cout << (res ? "Kevin" : "Nicky");
return 0;
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
vector<int> rez;
int n;
string a, b, s1, s2;
int main() {
cin >> n;
cin >> a >> b;
s1 = a;
sort(s1.begin(), s1.end());
s2 = b;
sort(s2.begin(), s2.end());
if (s1 != s2) {
cout << -1;
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (b[n - 1 - i] == a[j]) {
rez.push_back(n);
rez.push_back(j);
rez.push_back(1);
reverse(a.begin() + j, a.end());
rotate(a.begin(), a.end() - 1, a.end());
break;
}
}
}
cout << rez.size() << endl;
for (auto v : rez) cout << v << " ";
return 0;
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
struct _ {
ios_base::Init i;
_() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
int main() {
long long test;
cin >> test;
for (long long tst = 1; tst <= test; ++tst) {
long long n;
cin >> n;
vector<long long> a(n + 1, 0);
for (long long i = 1; i <= n; i++) cin >> a[i];
long long max_x = 0;
for (long long i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
long long diff = a[i - 1] - a[i];
a[i] += diff;
long long x = 0;
while (diff > 0) diff >>= 1, x++;
max_x = max(max_x, x);
}
}
cout << max_x << '\n';
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
long long ax[300000], ay[300000], x[300000], y[300000], n, J;
int main() {
int i, j, k;
while (cin >> n >> J) {
cin >> x[0] >> y[0];
for (i = 0; i < n; i++) {
cin >> ax[i] >> ay[i];
ax[i + n] = ax[i];
ay[i + n] = ay[i];
}
for (i = 1; i < 2 * n; i++) {
x[i] = 2 * ax[i - 1] - x[i - 1];
y[i] = 2 * ay[i - 1] - y[i - 1];
}
i = J % (2 * n);
cout << x[i] << " " << y[i] << endl;
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
int szx[N << 1], szy[N << 1], fa[N << 1];
long long ans = 0;
int Find(int x) { return x == fa[x] ? x : Find(fa[x]); }
void Union(int x, int y, stack<int> &S) {
x = Find(x), y = Find(y);
if (x == y) return;
ans += szx[x] * szy[y] + szy[x] * szx[y];
if (szx[x] + szy[x] < szx[y] + szy[y]) swap(x, y);
fa[y] = x, szx[x] += szx[y], szy[x] += szy[y];
S.push(y);
}
vector<pair<int, int> > E[N << 2];
void add(int rt, int l, int r, int L, int R, pair<int, int> y) {
if (L <= l && r <= R) {
E[rt].emplace_back(y);
return;
}
int mid = (l + r) >> 1;
if (mid >= L) add(rt << 1, l, mid, L, R, y);
if (mid < R) add(rt << 1 | 1, mid + 1, r, L, R, y);
}
void undo(stack<int> &S) {
while (!S.empty()) {
int x = S.top();
S.pop();
int y = fa[x];
szx[y] -= szx[x], szy[y] -= szy[x];
fa[x] = x;
}
}
void work(int rt, int l, int r) {
stack<int> S;
long long temp = ans;
for (pair<int, int> &e : E[rt]) Union(e.first, e.second + 300000, S);
int mid = (l + r) >> 1;
if (l == r)
cout << ans << ' ';
else
work(rt << 1, l, mid), work(rt << 1 | 1, mid + 1, r);
undo(S);
ans = temp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
map<pair<int, int>, int> mp;
for (int i = 1; i <= 600000; i++) fa[i] = i;
for (int i = 1; i <= 300000; i++) szx[i] = szy[i + 300000] = 1;
int n;
cin >> n;
for (int i = 1, x, y; i <= n; i++) {
cin >> x >> y;
if (mp.count(pair<int, int>(x, y))) {
add(1, 1, n, mp[pair<int, int>(x, y)], i - 1, pair<int, int>(x, y));
mp.erase(pair<int, int>(x, y));
} else
mp[pair<int, int>(x, y)] = i;
}
for (auto &e : mp) add(1, 1, n, e.second, n, e.first);
work(1, 1, n);
return 0;
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
long long fac[200010];
long long pow(long long a, long long b) {
long long ret = 1;
while (b) {
if (b & 1) ret = (ret * a) % ((long long)1e9 + 7);
b >>= 1;
a = (a * a) % ((long long)1e9 + 7);
}
return ret;
}
long long C(long long a, long long b) {
return (fac[a] * pow((fac[b] * fac[a - b]) % ((long long)1e9 + 7),
((long long)1e9 + 7) - 2)) %
((long long)1e9 + 7);
}
int n, m, g;
int main() {
cin >> n >> m >> g;
long long ans = 0;
if (m == 0)
ans = (n & 1) == 1 - g;
else if (n == 0)
ans = (m == 1) == g;
else {
fac[0] = 1;
for (int i = 1; i <= (n + m); i++)
fac[i] = (fac[i - 1] * i) % ((long long)1e9 + 7);
for (int i = 1; i <= n + 1; i++) {
if (i == n + 1 && m == 1)
ans = (ans + ((n & 1) == 1 - g)) % ((long long)1e9 + 7);
else if ((i & 1) == 1 - g) {
ans = (ans + C(n + m - i, m - 1)) % ((long long)1e9 + 7);
}
}
}
cout << ans << endl;
return 0;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string word, word2;
cin >> word;
for (int i = 1; i < n; ++i) {
cin >> word2;
word2.resize(word.size());
while (word != word2) {
if (word.size() == 0) {
cout << '0';
return 0;
}
word.resize((int)word.size() - 1);
word2.resize(word.size());
}
}
cout << word.size();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
template <class T>
void dbs(string str, T t) {
cout << str << " : " << t << endl;
}
template <class T, class... second>
void dbs(string str, T t, second... s) {
int idx = str.find(',');
cout << str.substr(0, idx) << " : " << t << ",";
dbs(str.substr(idx + 1), s...);
}
template <class second, class T>
ostream& operator<<(ostream& os, const pair<second, T>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
os << "[ ";
for (auto& it : p) os << it << " ";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
os << "[ ";
for (auto& it : p) os << it << " ";
return os << "]";
}
template <class second, class T>
ostream& operator<<(ostream& os, const map<second, T>& p) {
os << "[ ";
for (auto& it : p) os << it << " ";
return os << "]";
}
template <class T>
void prc(T a, T b) {
cout << "[";
for (T i = a; i != b; ++i) {
if (i != a) cout << ", ";
cout << *i;
}
cout << "]";
cout << endl;
}
int main() {
int x, h, m;
cin >> x >> h >> m;
int y = 0;
while (1) {
if (h % 10 == 7 || h / 10 == 7 || m % 10 == 7 || m / 10 == 7) break;
m -= x;
if (m < 0) {
h--;
m += 60;
if (h < 0) h += 24;
}
y++;
}
cout << y << "\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long xyp(long long x, long long y) {
if (y == 0) return 1LL;
if (y == 1) return x;
if (y % 2) {
long long p = xyp(x, y - 1);
return (x * p) % 1000000007;
}
long long p = xyp(x, y / 2);
return (p * p) % 1000000007;
}
long long inv(long long x) { return xyp(x, 1000000007 - 2); }
long long fact[10000007];
long long pr[10000007];
vector<long long> rp;
void init() {
fact[0] = 1;
for (long long i = 1; i < 10000007; i++) {
fact[i] = (fact[i - 1] * i) % 1000000007;
}
}
long long ncr(long long n, long long r) {
if (r < 0) return 0LL;
if (r == 0 || n == r) return 1LL;
if (r == 1 || ((n - r) == 1)) return n;
long long p =
(((fact[n] * inv(fact[r])) % 1000000007) * inv(fact[n - r])) % 1000000007;
return p;
}
void sieve() {
memset(pr, 1, sizeof(pr));
pr[0] = pr[1] = 0;
for (long long i = 2; i < 10000007; i++) {
if (pr[i]) {
rp.push_back(i);
for (long long j = i * i; j < 10000007; j += i) {
pr[j] = 0;
}
}
}
}
long long n;
vector<long long> a[1003];
vector<long long> lvl[1003];
vector<long long> sawal;
long long dist, node;
void dfs(long long u, long long pu, long long hu) {
lvl[hu].push_back(u);
for (auto x : a[u]) {
if (x == pu) continue;
dfs(x, u, hu + 1);
}
}
void puch() {
cout << "? " << sawal.size() << " ";
for (auto x : sawal) {
cout << x << " ";
}
cout << "\n";
cin >> node >> dist;
sawal.clear();
}
void solve() {
cin >> n;
for (long long i = 1; i < n; i++) {
long long x, y;
cin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
for (long long i = 1; i <= n; i++) {
sawal.push_back(i);
}
puch();
long long root = node;
long long dbtw = dist;
dfs(root, 0, 0);
long long l = 0, r = dist;
long long prev = -1;
while (l <= r) {
long long mid = (l + r) / 2;
sawal = lvl[mid];
if (sawal.size() == 0) {
r = mid - 1;
continue;
}
puch();
if (dist > dbtw) {
r = mid - 1;
} else {
prev = node;
l = mid + 1;
}
}
for (long long i = 0; i <= n; i++) lvl[i].clear();
root = prev;
dfs(root, 0, 0);
sawal = lvl[dbtw];
puch();
cout << "! " << prev << " " << node << "\n";
string waste;
cin >> waste;
if (waste != "Correct") root = (1 / (root - root));
for (long long i = 0; i <= n; i++) lvl[i].clear();
for (long long i = 1; i <= n; i++) a[i].clear();
}
int main() {
long long t1 = 1;
cin >> t1;
while (t1--) {
solve();
}
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int res = abs(a) + abs(b);
int x, y;
x = res;
y = res;
if (b < 0) {
y = 0 - y;
}
bool w = true;
if (a < 0) {
x = 0 - x;
cout << x << " " << 0 << " ";
w = false;
}
cout << 0 << " " << y;
if (w) {
cout << " " << x << " " << 0;
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1000000000;
int test;
void slove() {
int n;
cin >> n;
vector<long long> a(n + 1, 0), b(n + 1, 0);
long long mina = MAX, minb = MAX;
for (int i = 0; i < n; i++) {
cin >> a[i];
mina = min(mina, a[i]);
}
for (int i = 0; i < n; i++) {
cin >> b[i];
minb = min(minb, b[i]);
}
long long ans = 0;
for (int i = 0; i < n; i++) {
long long k = min(a[i] - mina, b[i] - minb);
ans += k;
a[i] -= k;
b[i] -= k;
if (a[i] > mina) ans += (a[i] - mina);
if (b[i] > minb) ans += (b[i] - minb);
}
cout << ans << endl;
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
;
cin >> test;
while (test--) {
slove();
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void getint(int &v) {
char ch, fu = 0;
for (ch = '*'; (ch < '0' || ch > '9') && ch != '-'; ch = getchar())
;
if (ch == '-') fu = 1, ch = getchar();
for (v = 0; ch >= '0' && ch <= '9'; ch = getchar()) v = v * 10 + ch - '0';
if (fu) v = -v;
}
const int MO = 1e9 + 7;
const long long N2 = 5e8 + 4;
int n, k;
long long ans, f[55][55][2], C[55][55];
long long pw(long long x, long long y) {
long long t = 1;
for (; y; y >>= 1) {
if (y & 1) t = t * x % MO;
x = x * x % MO;
}
return t;
}
int main() {
cin >> n >> k;
C[0][0] = 1;
for (int i = 1; i <= n; ++i) {
C[i][0] = 1;
for (int j = 1; j <= i; ++j) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MO;
}
f[1][0][0] = 1;
f[0][0][1] = 1;
for (int tot = 2; tot <= n; ++tot)
for (int i = 0; i <= tot - 1; ++i)
for (int j = 0; j <= k; ++j)
for (int J = 0; J <= k; ++J) {
int I = tot - i - 1;
if (i + I + 1 <= n && j + J + 1 <= k)
(f[i + I + 1][j + J + 1][1] += f[i][j][0] * f[I][J][0] % MO *
(i + I + 1) % MO * C[i + I][i] % MO *
N2 % MO) %= MO;
if (i + I + 1 <= n && j + J + 1 <= k)
(f[i + I + 1][j + J + 1][1] += f[i][j][0] * f[I][J][1] % MO *
(i + I + 1) % MO * C[i + I][i] % MO *
N2 % MO) %= MO;
if (i + I + 1 <= n && j + J + 1 <= k)
(f[i + I + 1][j + J + 1][1] += f[i][j][1] * f[I][J][0] % MO *
(i + I + 1) % MO * C[i + I][i] % MO *
N2 % MO) %= MO;
if (i + I + 1 <= n && j + J <= k)
(f[i + I + 1][j + J][0] += f[i][j][1] * f[I][J][1] % MO *
(i + I + 1) % MO * C[i + I][i] % MO *
N2 % MO) %= MO;
}
ans = (f[n][k][0] + f[n][k][1]) * pw(n, MO - 2) % MO;
cout << ans << endl;
return 0;
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
char w[500][500];
int i, j;
long long k, ans;
while (scanf("%d%d\n", &n, &m) != EOF) {
ans = 1;
for (i = 0; i < n; i++) scanf("%s", w[i]);
for (i = 0; i < m; i++) {
bool u[100];
memset(u, 0, sizeof(u));
for (j = 0; j < n; j++)
if (u[w[j][i]] == 0) u[int(w[j][i] - 'A')] = 1;
k = 0;
for (j = 0; j < 100; j++)
if (u[j] == 1) k++;
ans = ans * k % 1000000007;
}
printf("%I64d\n", ans);
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << __builtin_popcount(n);
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], b[n], sum = 0;
map<long long, long long> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<long long> v;
for (auto i : m) {
if (i.second >= 2) v.push_back(i.first);
}
for (int i = 0; i < n; i++) {
if (m[a[i]] >= 2) {
sum += b[i];
} else {
for (auto j : v) {
if ((j | a[i]) == j) {
sum += b[i];
break;
}
}
}
}
cout << sum;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
struct standing {
int point = 0, scored_goals = 0, missed_goals = 0;
string name = "";
};
bool cmp(const standing &a, const standing &b) {
if (a.point != b.point) return a.point > b.point;
int diff_a = a.scored_goals - a.missed_goals,
diff_b = b.scored_goals - b.missed_goals;
if (diff_a != diff_b) return diff_a > diff_b;
if (a.scored_goals != b.scored_goals) return a.scored_goals > b.scored_goals;
return a.name < b.name;
}
int main() {
map<string, standing> mp;
map<string, int> vis;
vector<string> v;
string team_1 = "BERLAND", team_2 = "";
int ans_x = 1e9, ans_y = 0;
for (int i = 0; i < 5; ++i) {
string team1, team2;
cin >> team1 >> team2;
if (!vis[team1]) v.push_back(team1);
if (!vis[team2]) v.push_back(team2);
++vis[team1], ++vis[team2];
string goals;
cin >> goals;
int goals1 = goals[0] - '0', goals2 = goals[2] - '0';
mp[team1].name = team1;
mp[team1].scored_goals += goals1;
mp[team1].missed_goals += goals2;
mp[team2].name = team2;
mp[team2].scored_goals += goals2;
mp[team2].missed_goals += goals1;
if (goals1 > goals2)
mp[team1].point += 3;
else if (goals1 < goals2)
mp[team2].point += 3;
else
mp[team1].point += 1, mp[team2].point += 1;
}
for (int i = 0; i < 4; ++i) {
if (v[i] == team_1) continue;
if (vis[v[i]] == 2) team_2 = v[i];
}
for (int x = 0; x <= 50; ++x) {
for (int y = 0; y < x; ++y) {
map<string, standing> cur;
for (int i = 0; i < 4; ++i) cur[v[i]] = mp[v[i]];
cur[team_1].scored_goals += x;
cur[team_1].missed_goals += y;
cur[team_1].point += 3;
cur[team_2].scored_goals += y;
cur[team_2].missed_goals += x;
vector<standing> fin;
for (int i = 0; i < 4; ++i) {
fin.push_back(cur[v[i]]);
}
sort(fin.begin(), fin.end(), cmp);
if ((fin[0].name == team_1) || (fin[1].name == team_1)) {
if ((ans_x - ans_y) < (x - y)) continue;
if ((ans_x - ans_y) > (x - y)) {
ans_x = x, ans_y = y;
} else {
if (y < ans_y) {
ans_x = x, ans_y = y;
}
}
}
}
}
if (ans_x == (1e9)) {
puts("IMPOSSIBLE");
return 0;
}
cout << ans_x << ':' << ans_y << endl;
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ip, m;
char cp;
string s;
cin >> s;
ip = s[1] - 48;
cp = s[0];
if ((ip == 1 || ip == 8) && (cp == 'a' || cp == 'h'))
m = 3;
else if ((ip == 1 || ip == 8) && (cp >= 'b' || cp <= 'g'))
m = 5;
else if ((ip >= 2 || ip >= 7) && (cp == 'a' || cp == 'h'))
m = 5;
else
m = 8;
cout << m << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int k = 0;
for (int i = 1; i < n - 1; i++) {
if (a[i - 1] == 1 && a[i + 1] == 1 && a[i] == 0) {
k++;
a[i + 1] = 0;
}
}
cout << k;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int n, f, inp;
long long ans;
struct my {
long long p, c, ip;
} a[100100];
bool cmp(my a, my b) { return a.p > b.p; }
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cin >> n >> f;
for (int i = 0; i < n; i++) {
cin >> a[i].p >> a[i].c;
a[i].ip = a[i].p;
if (a[i].p <= a[i].c) {
a[i].c -= a[i].p;
ans += a[i].p;
a[i].p = 0;
} else {
a[i].p -= a[i].c;
ans += a[i].c;
a[i].c = 0;
}
a[i].p = min(a[i].c, a[i].ip);
}
sort(a, a + n, cmp);
for (int i = 0; i < f; i++) ans += a[i].p;
cout << ans;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
int n = (int)s.length();
vector<int> a(n, 0), b(1, 0);
for (int(i) = (0); (i) < (n); (i)++) {
if (i) a[i] += a[i - 1];
if (s[i] == '1') {
a[i]++;
b.push_back(i);
}
}
long long ans = 0;
for (int(i) = (0); (i) < (n); (i)++) {
int t = a[i] + k;
int l = (int)b.size();
if (s[i] == '1') {
if (k == 0) continue;
if (t - 1 < l) ans += (t < l ? b[t] : n) - b[t - 1];
} else {
if (k == 0) {
ans += (t + 1 < l ? b[t + 1] : n) - i;
} else if (t < l)
ans += (t + 1 < l ? b[t + 1] : n) - b[t];
}
}
cout << ans << endl;
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fill0(a) memset(a,0,sizeof(a))
#define fill1(a) memset(a,-1,sizeof(a))
#define fillbig(a) memset(a,63,sizeof(a))
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
template<typename T1,typename T2> void chkmin(T1 &x,T2 y){if(x>y) x=y;}
template<typename T1,typename T2> void chkmax(T1 &x,T2 y){if(x<y) x=y;}
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned int u32;
typedef unsigned long long u64;
namespace fastio{
#define FILE_SIZE 1<<23
char rbuf[FILE_SIZE],*p1=rbuf,*p2=rbuf,wbuf[FILE_SIZE],*p3=wbuf;
inline char getc(){return p1==p2&&(p2=(p1=rbuf)+fread(rbuf,1,FILE_SIZE,stdin),p1==p2)?-1:*p1++;}
inline void putc(char x){(*p3++=x);}
template<typename T> void read(T &x){
x=0;char c=getchar();T neg=0;
while(!isdigit(c)) neg|=!(c^'-'),c=getchar();
while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
if(neg) x=(~x)+1;
}
template<typename T> void recursive_print(T x){if(!x) return;recursive_print(x/10);putc(x%10^48);}
template<typename T> void print(T x){if(!x) putc('0');if(x<0) putc('-'),x=~x+1;recursive_print(x);}
template<typename T> void print(T x,char c){if(!x) putc('0');if(x<0) putc('-'),x=~x+1;recursive_print(x);putc(c);}
void print_final(){fwrite(wbuf,1,p3-wbuf,stdout);}
}
const int MAXN=500;
const int MAXM=500*499/2;
int n,mod,ans=0,dp[MAXN+5][MAXM+5];
int sum[MAXM+5],_sum[MAXM+5],__sum[MAXM+5];
int c[MAXN+5][MAXN+5],fac[MAXN+5];
int sum0(int l,int r){if(l>r) return 0;return (sum[r]-((!l)?0:sum[l-1])+mod)%mod;}
int sum1(int l,int r){if(l>r) return 0;return (_sum[r]-((!l)?0:_sum[l-1])+mod)%mod;}
int sum2(int l,int r){if(l>r) return 0;return (__sum[r]-((!l)?0:__sum[l-1])+mod)%mod;}
int main(){
scanf("%d%d",&n,&mod);dp[1][0]=1;
for(int i=0;i<=MAXM;i++) sum[i]=1;
for(int i=2;i<=n;i++){
for(int j=0;j<=i*(i-1)/2;j++){
dp[i][j]=sum[j];
if(j-i>=0) dp[i][j]=(dp[i][j]-sum[j-i]+mod)%mod;
// printf("%d %d %d\n",i,j,dp[i][j]);
} memset(sum,0,sizeof(sum));sum[0]=dp[i][0];
for(int j=1;j<=MAXM;j++) sum[j]=(sum[j-1]+dp[i][j])%mod;
}
for(int i=(fac[0]=1)-1;i<=MAXN;i++){
c[i][0]=1;if(i) fac[i]=1ll*fac[i-1]*i%mod;
for(int j=1;j<=i;j++) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
}
for(int i=0;i<n;i++){
int lim=i*(i+1)/2,s=0;
memset(sum,0,sizeof(sum));
memset(_sum,0,sizeof(_sum));
memset(__sum,0,sizeof(__sum));
sum[0]=dp[i][0];
for(int j=1;j<=i*(i-1)/2;j++){
sum[j]=(sum[j-1]+dp[i][j])%mod;
_sum[j]=(_sum[j-1]+1ll*j*dp[i][j])%mod;
__sum[j]=(__sum[j-1]+1ll*j*(j+1)/2*dp[i][j])%mod;
}
for(int j=0;j<=i*(i-1)/2;j++){
s=(s+1ll*lim*sum[j-1]%mod*dp[i][j])%mod;
int T=i-j+1;
int A=(1ll*T*(T+1)/2%mod+mod)%mod;
int B=(T+mod)%mod;
int minus=(1ll*A*sum0(max(0,j-i),j-1)%mod
+1ll*B*sum1(max(0,j-i),j-1)%mod
+sum2(max(0,j-i),j-1))%mod;
s=(s-1ll*minus*dp[i][j]%mod+mod)%mod;
} //printf("%d\n",s);
ans=(ans+1ll*s*c[n][n-i-1]%mod*fac[n-i-1])%mod;
}
printf("%d\n",ans);
return 0;
} | 19 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[15][1 << 15];
ll tree[15][1 << 15];
int edge[15];
vector<int> lca[15];
int main(void) {
int n, m, q;
cin >> n >> m >> q;
for (int i = int(0); i < int(m); ++i) {
int a, b;
cin >> a >> b;
a--, b--;
edge[a] |= (1 << b);
edge[b] |= (1 << a);
}
for (int i = int(0); i < int(q); ++i) {
int a, b, c;
cin >> a >> b >> c;
a--, b--, c--;
lca[c].push_back((1 << (a)) | (1 << (b)));
}
for (int i = int(0); i < int(n); ++i) tree[i][1 << i] = 1LL;
const int all = (1 << n) - 1;
for (int mask = int(1); mask < int((1 << n)); ++mask)
for (int i = int(0); i < int(n); ++i) {
if (mask == all && i != 0) continue;
if ((mask & (1 << (i))) == 0) continue;
int cmask = mask ^ (1 << (i));
int limit = (1 << (31 - __builtin_clz(cmask)));
for (int child = cmask; child >= limit; child = (child - 1) & cmask) {
int root = mask ^ child;
for (int j = int(0); j < int(n); ++j) {
if ((child & (1 << (j))) == 0) continue;
bool ok = true;
if ((child ^ (1 << (j))) & edge[i]) ok = false;
if (((child | (1 << (i))) & edge[j]) != edge[j]) ok = false;
for (auto &check : lca[i])
if ((child & check) == check) ok = false;
if (ok) tree[i][mask] += tree[i][root] * dp[j][child];
}
}
bool ok = true;
for (auto &check : lca[i])
if ((mask & check) != check) ok = false;
if (ok) dp[i][mask] += tree[i][mask];
}
cout << dp[0][(1 << n) - 1] << endl;
return 0;
}
| 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char S[200005];
cin >> n >> k >> S;
if (k > 0) {
if (n > 1) {
if (S[0] != '1') {
S[0] = '1';
k--;
}
for (int i = 1; i < n && k != 0; i++) {
if (S[i] != '0') {
S[i] = '0';
k--;
}
}
} else
S[0] = '0';
}
cout << S << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, f[N], to[N];
pair<int, int> a[N];
bool done[N];
int find(int x) {
while (x != f[x]) {
x = f[x] = f[f[x]];
}
return x;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i].first);
a[i].second = i;
}
sort(a + 1, a + n + 1);
for (int i = 1, j = 1; i <= n; i = j) {
while (j <= n && a[j].first == a[i].first) {
++j;
}
for (int k = i; k < j; ++k) {
if (a[k].second >= i && a[k].second < j) {
to[a[k].second] = a[k].second;
done[a[k].second] = true;
++m;
}
}
int t = i;
for (int k = i; k < j; ++k) {
if (a[k].second < i || a[k].second >= j) {
while (done[t]) {
++t;
}
to[a[k].second] = t++;
}
}
}
if (m < n) {
puts("-1");
return 0;
}
for (int i = 1; i <= n; ++i) {
f[i] = i;
}
for (int i = 1; i <= n; ++i) {
f[find(i)] = find(to[i]);
}
for (int i = 1, j = 1; i <= n; i = j) {
while (j <= n && a[j].first == a[i].first) {
++j;
}
int last = 0;
for (int k = i; k < j; ++k) {
if (!done[a[k].second]) {
int t = a[k].second;
if (last && find(last) != find(t)) {
f[find(last)] = find(t);
swap(to[last], to[a[k].second]);
}
last = a[k].second;
}
}
}
int cycle = 0;
for (int i = 1; i <= n; ++i) {
if (find(i) == i && to[i] != i) {
++cycle;
}
}
int change = min(cycle, m - n);
vector<int> all, go;
if (change > 2) {
for (int i = 1; i <= n; ++i) {
if (find(i) == i && to[i] != i) {
all.push_back(i);
go.push_back(to[i]);
if (all.size() == change) {
break;
}
}
}
for (int i = 0; i < change; ++i) {
to[all[i]] = go[(i + change - 1) % change];
if (i) {
f[find(all[i])] = find(all[i - 1]);
}
}
}
int answer = 0;
for (int i = 1; i <= n; ++i) {
if (find(i) == i && to[i] != i) {
++answer;
}
}
printf("%d\n", answer + (!go.empty()));
for (int i = 1; i <= n; ++i) {
if (find(i) == i && to[i] != i) {
vector<int> a;
a.push_back(i);
for (int x = to[i]; x != i; x = to[x]) {
a.push_back(x);
}
printf("%d\n", a.size());
for (int j = 0; j < a.size(); ++j) {
printf("%d%c", a[j], j == a.size() - 1 ? '\n' : ' ');
}
}
}
if (!go.empty()) {
printf("%d\n", go.size());
for (int i = 0; i < go.size(); ++i) {
printf("%d%c", go[i], i == go.size() - 1 ? '\n' : ' ');
}
}
return 0;
}
| 23 |
#include <bits/stdc++.h>
using namespace std;
int mapp[200][200];
int n;
char s[200010], t[200010];
int main() {
while (scanf("%d", &n) != EOF) {
memset(mapp, 0, sizeof(mapp));
scanf("%s%s", s, t);
int ans = 0;
for (int i = 0; i < n; ++i)
if (s[i] != t[i]) {
mapp[s[i]][t[i]] = i + 1;
++ans;
}
bool ok = false;
int a = -1, b = -1;
for (int i = 'a'; i <= 'z'; ++i) {
for (int j = i + 1; j <= 'z'; ++j)
if (mapp[i][j] && mapp[j][i]) {
ok = true;
a = mapp[i][j];
b = mapp[j][i];
break;
}
if (ok) break;
}
if (ok) {
printf("%d\n%d %d\n", ans - 2, a, b);
continue;
}
ok = false;
for (int i = 'a'; i <= 'z'; ++i) {
for (int j = 'a'; j <= 'z'; ++j)
if (mapp[i][j]) {
for (int k = 'a'; k <= 'z'; ++k)
if (mapp[k][i]) {
a = mapp[k][i];
b = mapp[i][j];
ok = true;
break;
}
if (ok) break;
}
if (ok) break;
}
if (ok) {
printf("%d\n%d %d\n", ans - 1, a, b);
continue;
}
printf("%d\n-1 -1\n", ans);
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], c[100005];
int main() {
int n, m, i, cnt = 0;
long long sum = 0;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
sum += a[i];
c[i] = a[i] - b[i];
}
sort(c, c + n);
n--;
while (sum > m && n >= 0) {
sum -= c[n];
cnt++;
n--;
}
if (sum <= m)
cout << cnt;
else
cout << -1;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
struct Mat {
long long int v[110][110];
int c, r;
void creat(int c0, int r0) {
c = c0;
r = r0;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++) v[i][j] = (i == j) ? 1 : 0;
}
};
long long int adjust(long long int num) {
if (num >= 1000000007) num %= 1000000007;
if (num < 0) num = (num % 1000000007 + 1000000007) % 1000000007;
return num;
}
Mat pk(Mat a, Mat b) {
Mat ans;
ans.creat(b.c, a.r);
for (int i = 0; i < a.r; i++)
for (int j = 0; j < b.c; j++) {
ans.v[i][j] = 0;
for (int k = 0; k < a.c; k++) {
ans.v[i][j] = ans.v[i][j] + a.v[i][k] * b.v[k][j];
ans.v[i][j] = adjust(ans.v[i][j]);
}
}
return ans;
}
Mat quick_Mat(Mat a, long long int n) {
Mat ans;
ans.creat(a.c, a.r);
while (n) {
if (n & 1) ans = pk(ans, a);
a = pk(a, a);
n >>= 1;
}
return ans;
}
int ask_bits(long long int x) {
int cnt = 0;
while (x) {
if (x & 1) cnt++;
x >>= 1;
}
return cnt;
}
long long int in[210];
int main() {
int n;
long long int k;
scanf("%d%I64d", &n, &k);
for (int i = 0; i < n; i++) scanf("%I64d", &in[i]);
Mat a;
a.creat(n, n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (ask_bits(in[i] ^ in[j]) % 3 == 0)
a.v[i][j] = 1;
else
a.v[i][j] = 0;
}
Mat ans = quick_Mat(a, k - 1);
long long int all = 0;
for (int i = 0; i < ans.r; i++)
for (int j = 0; j < ans.c; j++) all += ans.v[i][j], all = adjust(all);
printf("%I64d\n", all);
return 0;
}
| 11 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin>>t;
while(t--)
{
int n; cin>>n;
int a=n%2020;
int b=n/2020;
if(b==0 || a>b)
{
cout<<"NO"<<endl;
}
else {
cout<<"YES"<<endl;
}
}
}
| 1 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
const int N = 1e5 + 64;
int XOR[4 * N], ass_[4 * N];
int ls(int v) { return 2 * v + 1; }
int rs(int v) { return 2 * v + 2; }
void push(int v) {
if (ass_[v]) {
ass_[ls(v)] = ass_[v];
XOR[ls(v)] = 0;
ass_[rs(v)] = ass_[v];
XOR[rs(v)] = 0;
ass_[v] = 0;
}
XOR[ls(v)] ^= XOR[v];
XOR[rs(v)] ^= XOR[v];
XOR[v] = 0;
}
inline void set_(int v, int vl, int vr, int ql, int qr, int val) {
if (qr <= vl || vr <= ql) {
return;
}
if (ql <= vl && vr <= qr) {
XOR[v] = 0;
ass_[v] = val;
return;
}
int vm = (vl + vr) / 2;
push(v);
set_(ls(v), vl, vm, ql, qr, val);
set_(rs(v), vm, vr, ql, qr, val);
}
void set_(int l, int r, int v) { set_(0, 0, N, l, r + 1, v); }
inline void xr(int v, int vl, int vr, int ql, int qr, int val) {
if (qr <= vl || vr <= ql) {
return;
}
if (ql <= vl && vr <= qr) {
XOR[v] ^= val;
return;
}
int vm = (vl + vr) / 2;
push(v);
xr(ls(v), vl, vm, ql, qr, val);
xr(rs(v), vm, vr, ql, qr, val);
}
void xr(int l, int r, int v) { xr(0, 0, N, l, r + 1, v); }
inline int find(int v, int vl, int vr, int pos) {
assert(vl <= pos && pos < vr);
if (vr - vl == 1) {
return ass_[v] ^ XOR[v];
}
int vm = (vl + vr) / 2;
push(v);
if (pos < vm) {
return find(ls(v), vl, vm, pos);
} else {
return find(rs(v), vm, vr, pos);
}
}
int find(int pos) { return find(0, 0, N, pos); }
int n, q;
int a[N];
void print() {
for (int i = 0; i < n; ++i) {
int val = find(abs(a[i]));
if (val == 0) {
cout << a[i] << " ";
} else if (val == 1) {
cout << -a[i] << " ";
} else if (val == 2) {
cout << -abs(a[i]) << " ";
} else {
assert(val == 3);
cout << abs(a[i]) << " ";
}
}
cout << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
while (q--) {
char c;
int x;
cin >> c >> x;
if (c == '<') {
if (x > 0) {
xr(0, x - 1, 1);
set_(x, N - 1, 3);
} else {
set_(-x + 1, N - 1, 3);
}
} else {
assert(c == '>');
if (x < 0) {
xr(0, -x - 1, 1);
set_(-x, N - 1, 2);
} else {
set_(x + 1, N - 1, 2);
}
}
}
print();
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
struct ofl {
long double value;
int precision;
inline ofl(long double value, int precision)
: value(value), precision(precision) {}
};
const int seed = hash<string>()("alex256");
const int inf = (int)1e9 + 7;
const int64_t llInf = (int64_t)2e18 + 256;
const int mod = (int)1e9 + 7;
const long double pi = 3.141592653589793238462643383279502884197169399375105821;
const string luck = "🍀";
const char* errText = "error :(";
template <typename T1, typename T2>
inline istream& operator>>(istream& is, pair<T1, T2>& p) {
return is >> p.first >> p.second;
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << p.first << " " << p.second;
}
template <typename T>
inline istream& operator>>(istream& is, vector<T>& v) {
for (int i = 0; i < (int)(v.size()); i++) {
is >> v[i];
}
return is;
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
for (int i = 0; i < (int)(v.size()); i++) {
if (i) {
os << " ";
}
os << v[i];
}
return os;
}
inline ostream& operator<<(ostream& os, const ofl& o) {
return os << fixed << setprecision(o.precision) << o.value;
}
inline bool iosOptimize() {
ios_base::sync_with_stdio(false);
return true;
}
bool iosOptimized = iosOptimize();
template <typename T>
inline T get() {
T value;
cin >> value;
return value;
}
template <>
inline char get() {
char c = '\0';
while (c <= ' ') {
cin >> c;
}
return c;
}
inline string getLn() {
string s;
getline(cin, s);
return s;
}
template <typename T, size_t Count>
struct VectorPacker {};
template <typename T>
struct VectorPacker<T, 0> {};
template <typename T>
inline vector<T> getVector(int size) {
vector<T> res(size);
cin >> res;
return res;
}
template <typename T, typename U, typename... Args>
inline typename VectorPacker<T, sizeof...(Args) + 1>::T getVector(
U size, Args... sizes) {
typename VectorPacker<T, sizeof...(Args) + 1>::T res(size);
for (int i = 0; i < (int)size; i++) {
res[i] = getVector<T>(sizes...);
}
return res;
}
inline void put() {}
template <typename T, typename... Args>
inline void put(const T& value, const Args&... vals) {
cout << value;
put(vals...);
}
template <typename... Args>
inline void putLn(const Args&... vals) {
put(vals...);
cout << "\n";
}
namespace std {
template <typename T1, typename T2>
struct hash<pair<T1, T2> > {
inline size_t operator()(const pair<T1, T2>& p) const {
return hash<T1>()(p.first) ^ hash<T2>()(p.second);
}
};
}; // namespace std
mt19937_64 rnd(seed);
inline void error(const char* text = errText) {
;
exit(256);
}
template <typename T1, typename T2>
inline void umax(T1& a, const T2& b) {
if (a < b) {
a = b;
}
}
template <typename T1, typename T2>
inline void umin(T1& a, const T2& b) {
if (a > b) {
a = b;
}
}
int64_t gcd(int64_t a, int64_t b) { return b ? gcd(b, a % b) : a; }
int64_t extGcd(int64_t a, int64_t b, int64_t& x, int64_t& y) {
if (!a) {
x = 0;
y = 1;
return b;
}
int64_t x1, y1, d = extGcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
inline int addMod(int a, int b, int m = mod) { return ((int64_t)a + b) % m; }
inline int subMod(int a, int b, int m = mod) {
return ((int64_t)a + m - b) % m;
}
inline int mulMod(int a, int b, int m = mod) { return ((int64_t)a * b) % m; }
inline int divMod(int a, int b, int m = mod) {
int64_t x, y;
int64_t g = extGcd(b, m, x, y);
if (g != 1) {
;
exit(42);
}
x = (x % m + m) % m;
return mulMod(a, x, m);
}
int n = get<int>();
string s = get<string>();
int dp[80][80][80][3];
signed main() {
vector<int> q(n);
for (int i = 0; i < n; i++) {
if (s[i] == 'V') {
q[i] = 0;
} else if (s[i] == 'K') {
q[i] = 1;
} else {
q[i] = 2;
}
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k <= n; k++) {
for (int l = 0; l < 3; l++) {
dp[i][j][k][l] = inf;
}
}
}
}
int ans = inf;
dp[0][0][0][2] = 0;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k <= n; k++) {
for (int l = 0; l < 3; l++) {
if (i + j + k == n) {
umin(ans, dp[i][j][k][l]);
}
if (dp[i][j][k][l] == inf) {
continue;
}
int ktr[3] = {i, j, k};
int add[3] = {i, j, k};
int beforeThis = 0;
for (int m = 0; m < n; m++) {
int qur = q[m];
if (ktr[qur] == 0) {
if (!(l == 0 && qur == 1)) {
add[qur]++;
umin(dp[add[0]][add[1]][add[2]][qur],
dp[i][j][k][l] + beforeThis);
add[qur]--;
}
beforeThis++;
} else {
ktr[qur]--;
}
}
}
}
}
}
putLn(ans);
return 0;
}
| 17 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
const int maxn = 2500;
vector<int> road[2500];
const int inf = 0x3f3f3f3f;
int dis(int a, int b) {
if (a <= b)
return b - a;
else
return n - a + b;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
road[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
int ans = 0;
for (int j = 1; j <= n; j++) {
int len = road[j].size();
if (!len) continue;
int res = (len - 1) * n + dis(i, j);
int temp = inf;
for (int k = 0; k < len; k++) {
temp = min(temp, dis(j, road[j][k]));
}
res += temp;
ans = max(ans, res);
}
printf("%d ", ans);
}
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char a[n][n];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
char b[n][n];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> b[i][j];
}
}
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[n - 1 - i][j] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[n - 1 - i][n - 1 - j] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][n - 1 - j] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[j][i] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[n - 1 - j][i] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[j][n - 1 - i] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[n - 1 - j][n - 1 - i] != b[i][j]) {
break;
}
}
if (j != n) {
break;
}
}
if (i == n) {
cout << "Yes";
return 0;
}
cout << "No";
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, k = 1, cnt = 0;
double ans = 1;
cout.precision(14);
cout << fixed;
cin >> N >> M;
while (M >= k) {
k *= 2;
cnt++;
}
k /= 2;
for (double i = 2; i <= N; i++) {
double x = (i - 1) / N, ret = 1;
vector<double> v;
for (int i = 0; i < cnt; i++) {
v.push_back(x);
x *= x;
}
int t = k, c = M, si = cnt - 1;
while (c > 0) {
if (c >= t) {
c -= t;
ret *= v[si];
} else {
t /= 2;
si--;
}
}
ans += 1 - ret;
}
cout << ans;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int cnt1, cnt2, x, y;
bool check(long long v) {
long long n1, n2, n3, cn1 = cnt1, cn2 = cnt2;
n3 = v - v / x - v / y + v / (x * y);
n1 = v - v / x - n3;
n2 = v - v / y - n3;
cn1 -= min(cn1, n1);
cn2 -= min(cn2, n2);
return n3 >= cn1 + cn2;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
while (cin >> cnt1 >> cnt2 >> x >> y) {
long long L = 0, R = 9223372036854775807ll, M;
while (R - L > 1) {
M = (L + R) / 2;
(check(M) ? R : L) = M;
}
cout << R << endl;
}
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, ma, cnt, mi;
cnt = 0;
int ar[150];
int ans = 0;
memset(ar, 0, sizeof(ar));
scanf("%d %d %d", &a, &b, &c);
int a1 = a / 3;
int b1 = b / 2;
int c1 = c / 2;
int o = min(min(a1, b1), c1);
ans += 7 * o;
a = a - o * 3;
b = b - o * 2;
c = c - o * 2;
int g = ans;
int ai = a;
int bi = b;
int ci = c;
for (int j = 0; j <= 6; j++) {
a = ai;
b = bi;
c = ci;
int ans1 = g;
for (int i = 1; i <= 7; i++) {
int k = (i + j) % 7;
if (k == 1 || k == 4 || k == 0) {
if (a <= 0) {
break;
} else {
a--;
ans1++;
}
} else if (k == 2 || k == 6) {
if (b <= 0) {
break;
} else {
b--;
ans1++;
}
} else if (k == 3 || k == 5) {
if (c <= 0) {
break;
} else {
c--;
ans1++;
}
}
}
ans = max(ans, ans1);
}
printf("%d\n", ans);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
struct pr {
int val, nums;
} tp;
int cnt[3][1000005];
int num[3][3];
vector<pr> vec;
vector<long long> wtf;
long long temp, gg, mt, nowans;
long long ask(long long x, int y) {
long long now = 1;
while (y) {
if (y % 2) now *= x;
x *= x;
y /= 2;
}
return now;
}
void go(int x, long long now, int flag) {
if (x == wtf.size())
nowans += now * flag;
else {
go(x + 1, now, flag);
go(x + 1, now / wtf[x], flag * -1);
}
}
void dfs(long long now, int f) {
if (f == vec.size()) {
temp++;
return;
}
dfs(now, f + 1);
for (int i = 1; i <= vec[f].nums; i++) {
now *= vec[f].val;
if (now > gg) return;
dfs(now, f + 1);
}
}
int main() {
int t;
long long zeze;
scanf("%d", &t);
while (t--) {
vec.clear();
wtf.clear();
nowans = 0;
mt = 1;
gg = 1;
temp = 0;
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++) {
scanf("%d", &num[i][j]);
if (i == 1) mt *= num[i][j];
if (i == 0) gg *= num[i][j];
for (int k = 2; k <= 1000; k++) {
while (num[i][j] % k == 0) {
cnt[i][k]++;
num[i][j] /= k;
}
}
if (num[i][j] > 1) {
cnt[i][num[i][j]]++;
if (cnt[i][num[i][j]] != 1) num[i][j] = 1;
}
}
cnt[2][2]++;
sort(num[2], num[2] + 3);
for (int i = 2; i <= 1000; i++) {
if (cnt[2][i] > 0) {
tp.nums = cnt[2][i];
tp.val = i;
vec.push_back(tp);
}
}
for (int i = 0; i < 3; i++) {
if (num[2][i] > 1) {
tp.nums = cnt[2][num[2][i]];
tp.val = num[2][i];
vec.push_back(tp);
}
}
for (int i = 2; i <= 1000; i++) {
if (cnt[0][i] > cnt[2][i]) {
zeze = ask(i * 1LL, cnt[2][i] + 1);
wtf.push_back(zeze);
}
}
for (int i = 0; i < 3; i++) {
if (num[0][i] == 1) continue;
if (cnt[0][num[0][i]] > cnt[2][num[0][i]]) {
zeze = ask(num[0][i] * 1LL, cnt[2][num[0][i]] + 1);
wtf.push_back(zeze);
}
}
go(0, mt, 1);
dfs(1LL, 0);
printf("%lld\n", nowans + temp);
for (int i = 2; i <= 1000; i++) cnt[0][i] = cnt[1][i] = cnt[2][i] = 0;
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++) cnt[i][num[i][j]] = 0;
}
return 0;
}
| 21 |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9;
int n;
long double p, q, a, b;
vector<int> B(2), N;
vector<vector<long double>> D(4);
void Init() {
for (int i = 0; i < n; ++i) {
cin >> a >> b;
D[0][i] = -a;
D[1][i] = -b;
}
D[0][n] = D[1][n] = -1;
D[0][n + 1] = -p;
D[1][n + 1] = -q;
B[0] = n;
B[1] = n + 1;
for (int i = 0; i < n; ++i) {
N[i] = i;
D[2][i] = 1;
}
N[n] = -1;
D[3][n] = 1;
}
void Pivot(int r, int s) {
for (int i = 0; i < 4; ++i)
if (i != r)
for (int j = 0; j < n + 2; ++j)
if (j != s) D[i][j] -= D[r][j] * D[i][s] / D[r][s];
for (int j = 0; j < n + 2; ++j)
if (j != s) D[r][j] /= D[r][s];
for (int i = 0; i < 4; ++i)
if (i != r) D[i][s] /= -D[r][s];
D[r][s] = 1.0 / D[r][s];
swap(B[r], N[s]);
}
bool Simplex(int phase) {
int x = phase == 1 ? 3 : 2;
while (true) {
int s = -1;
for (int j = 0; j <= n; ++j) {
if (phase == 2 && N[j] == -1) continue;
if (s == -1 || D[x][j] < D[x][s] || D[x][j] == D[x][s] && N[j] < N[s])
s = j;
}
if (D[x][s] > -EPS) return true;
int r = -1;
for (int i = 0; i < 2; ++i) {
if (D[i][s] < EPS) continue;
if (r == -1 || D[i][n + 1] / D[i][s] < D[r][n + 1] / D[r][s] ||
(D[i][n + 1] / D[i][s]) == (D[r][n + 1] / D[r][s]) && B[i] < B[r])
r = i;
}
if (r == -1) return false;
Pivot(r, s);
}
}
long double Solve() {
int r = 0;
for (int i = 1; i < 2; ++i)
if (D[i][n + 1] < D[r][n + 1]) r = i;
if (D[r][n + 1] < -EPS) {
Pivot(r, n);
if (!Simplex(1) || D[3][n + 1] < -EPS)
return -numeric_limits<long double>::infinity();
for (int i = 0; i < 2; ++i)
if (B[i] == -1) {
int s = -1;
for (int j = 0; j <= n; ++j)
if (s == -1 || D[i][j] < D[i][s] || D[i][j] == D[i][s] && N[j] < N[s])
s = j;
Pivot(i, s);
}
}
if (!Simplex(2)) return numeric_limits<long double>::infinity();
return D[2][n + 1];
}
int main() {
cin >> n >> p >> q;
N.resize(n + 1);
for (auto &d : D) d.resize(n + 2);
Init();
cout << setiosflags(ios::fixed);
cout << setprecision(10) << -Solve() << endl;
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 1e4;
char s[N + 3];
bool v[2][N + 3];
set<string> ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout << fixed;
cin >> s;
int n = strlen(s);
v[0][n] = v[1][n] = true;
for (int i = n - 2; i > 4; i--) {
for (int l = 2; l <= 3; l++) {
int i0 = i + l;
if (v[l - 2][i0] && strncmp(s + i, s + i0, l) != 0) v[l - 2][i] = true;
if (v[5 - l - 2][i0]) v[l - 2][i] = true;
;
if (v[l - 2][i]) ans.emplace(s + i, l);
}
}
cout << ans.size() << endl;
for (auto& ss : ans) cout << ss << '\n';
return 0;
}
| 10 |
#include <bits/stdc++.h>
int n, a, b;
int f[44444][33];
bool g[44444][33];
int In() {
register int c, f, s;
for (; c = getchar(), c != '-' && !isdigit(c);)
;
for (s = (f = c == '-') ? 0 : c - '0'; c = getchar(), isdigit(c);)
s = s * 10 + c - '0';
return f ? -s : s;
}
bool ck(register int a, register int b) {
register int s = 1;
for (;;) {
if (b & 1) {
if (1ll * s * a > 1000000000) return 0;
s *= a;
}
b >>= 1;
if (!b) break;
if (1ll * a * a > 1000000000) return 0;
a *= a;
}
return s <= n;
}
bool sg(register int x, register int y) {
if (g[x][y]) return f[x][y];
g[x][y] = 1;
if (!ck(x, y + 1)) {
register int l = x, r = n;
for (register int m; m = (l + r + 1) >> 1, l < r;
ck(m, y) ? l = m : r = m - 1)
;
return f[x][y] = (l - x) & 1;
}
if (!ck(x + 1, y)) {
if (x == 1) {
puts("Missing");
exit(0);
}
return f[x][y] = !sg(x, y + 1);
}
return f[x][y] = !sg(x + 1, y) || !sg(x, y + 1);
}
int main() {
a = In(), b = In(), n = In() - 1, puts(sg(a, b) ? "Masha" : "Stas");
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
int lwb(vector<int>& a, int b) {
return int(lower_bound((a).begin(), (a).end(), b) - a.begin());
}
int upb(vector<int>& a, int b) {
return int(upper_bound((a).begin(), (a).end(), b) - a.begin());
}
long long updiv(long long a, long long b) {
return a / b + ((a ^ b) > 0 && a % b);
}
long long downdiv(long long a, long long b) {
return a / b - ((a ^ b) < 0 && a % b);
}
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << "1"
<< "\n";
return;
}
if (n == 2) {
cout << "2 3"
<< "\n";
return;
}
for (int i = 2; i <= n + 1; i++) cout << i << " ";
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.flush();
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 111111;
int main() {
int n = 0;
int a[nmax], p[nmax];
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d\n", &a[i], &p[i]);
}
int res = 0;
int price = 100000000;
for (int i = 0; i < n; i++) {
price = min(price, p[i]);
res += (a[i] * price);
}
cout << res;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
string int_to_str(int a) {
string s;
char c;
if (a < 10) {
c = '0' + a;
s += c;
} else {
c = '0' + a / 10;
s += c;
c = '0' + a % 10;
s += c;
}
return s;
}
int main() {
int n;
cin >> n;
int l;
cin >> l;
int* a = new int[n];
int* b = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
string a1 = "", b1 = "";
int tmp;
for (int i = 1; i < n; i++) {
tmp = a[i] - a[i - 1];
a1 = a1 + int_to_str(tmp) + '_';
tmp = b[i] - b[i - 1];
b1 = b1 + int_to_str(tmp) + '_';
}
a1 += int_to_str(a[0] + l - a[n - 1]) + '_';
b1 += int_to_str(b[0] + l - b[n - 1]);
a1 += a1;
if (a1.find(b1) <= a1.size())
cout << "YES";
else
cout << "NO";
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long n, long long p);
int main() {
long long n, bx, m, by, x = 0, x1, y = 0, y1;
cin >> n >> bx;
for (long long i = n - 1; i >= 0; i--) {
cin >> x1;
x = x + x1 * power(bx, i);
}
cin >> m >> by;
for (long long j = m - 1; j >= 0; j--) {
cin >> y1;
y = y + y1 * power(by, j);
}
if (x > y)
cout << ">" << '\n';
else if (x < y)
cout << "<" << '\n';
else
cout << "=" << '\n';
return 0;
}
long long power(long long n, long long p) {
if (p == 0)
return 1;
else
return n * power(n, p - 1);
}
| 3 |
#include <bits/stdc++.h>
int main() {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
double s, z;
s = 1.0 * a / b;
z = 1.0 * c / d;
double p = 1.0 * a / b;
double q = (1 - 1.0 * c / d) * (1 - 1.0 * a / b);
p = 1.0 * a / b;
q = (1 - 1.0 * c / d);
double a1 = p;
double r = (1 - p) * q;
printf("%.6lf\n", p / (1 - r));
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
void er(char s) {
if (s == 's')
puts("Stannis");
else
puts("Daenerys");
exit(0);
}
int main() {
int n, k;
cin >> n >> k;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (x % 2 == 0)
b++;
else
a++;
}
if (n == k) {
if (a % 2)
er('s');
else
er('d');
}
int mv = n - k;
if (mv / 2 >= a) er('d');
if (mv / 2 >= b && k % 2 == 0) er('d');
if ((mv + 1) / 2 >= b && k % 2 == 1) er('s');
if (mv % 2 == 1)
er('s');
else
er('d');
return 0;
}
| 14 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (c != '-' && (c < '0' || c > '9')) c = getchar();
if (c == '-') f = -1, c = getchar();
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
x *= f;
}
template <class T>
void write(T x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9)
write(x / 10), putchar(x % 10 + '0');
else
putchar(x + '0');
}
template <class T>
void writeln(T x) {
write(x), putchar('\n');
}
const long long inf = 1e14;
const int N = 1005;
vector<pair<int, long long> > e[N], E[N];
int n, m, x, y;
long long d[N];
void add_edge() {
int u, v;
long long w;
scanf("%d%d%lld", &u, &v, &w);
e[u].push_back(make_pair(v, w));
e[v].push_back(make_pair(u, w));
}
void dijkstra(int S) {
long long t, c;
scanf("%lld%lld", &t, &c);
for (int i = 1; i <= n; ++i) d[i] = inf;
d[S] = 0;
priority_queue<pair<long long, int>, vector<pair<long long, int> >,
greater<pair<long long, int> > >
pq;
pq.push(make_pair(d[S], S));
while (!pq.empty()) {
int now = pq.top().second;
long long D = pq.top().first;
pq.pop();
if (d[now] < D) continue;
for (int i = 0; i < (int)e[now].size(); ++i) {
int to = e[now][i].first;
long long cost = e[now][i].second;
if (D + cost < d[to]) {
d[to] = D + cost;
pq.push(make_pair(d[to], to));
}
}
}
for (int i = 1; i <= n; ++i) {
if (d[i] <= t && i != S) {
E[S].push_back(make_pair(i, c));
}
}
}
void init() {
scanf("%d%d%d%d", &n, &m, &x, &y);
for (int i = 1; i <= m; ++i) {
add_edge();
}
for (int i = 1; i <= n; ++i) {
dijkstra(i);
}
}
void solve() {
for (int i = 1; i <= n; ++i) d[i] = inf;
d[x] = 0;
priority_queue<pair<long long, int>, vector<pair<long long, int> >,
greater<pair<long long, int> > >
pq;
pq.push(make_pair(d[x], x));
while (!pq.empty()) {
int now = pq.top().second;
long long D = pq.top().first;
pq.pop();
if (d[now] < D) continue;
for (int i = 0; i < (int)E[now].size(); ++i) {
int to = E[now][i].first;
long long cost = E[now][i].second;
if (D + cost < d[to]) {
d[to] = D + cost;
pq.push(make_pair(d[to], to));
}
}
}
if (d[y] == inf) d[y] = -1;
printf("%lld\n", d[y]);
}
int main() {
init();
solve();
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long int N = 1e5 + 9;
vector<unsigned long long int> g[N], inic;
vector<pair<unsigned long long int, unsigned long long int> > rec;
unsigned long long int gcd(unsigned long long int a, unsigned long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
unsigned long long int lcm(unsigned long long int a, unsigned long long int b) {
return (a * b) / gcd(a, b);
}
unsigned long long int dfs(unsigned long long int u,
unsigned long long int father) {
unsigned long long int ans = 1, mul = 1;
for (auto x : g[u]) {
if (x == father) continue;
ans = lcm(dfs(x, u), ans);
}
if (u != 1 and (g[u]).size() == 1)
mul = 1;
else
mul = ((g[u]).size() - 1);
if (u == 1) mul = (g[u]).size();
return ans * mul;
}
void go_down(unsigned long long int u, unsigned long long int father,
unsigned long long int val) {
if (u != 1 and (g[u]).size() <= 1) rec.push_back(make_pair(val, u));
for (auto x : g[u]) {
if (x == father) continue;
unsigned long long int div;
if (u == 1)
div = (g[u]).size();
else if (u != 1 and (g[u]).size() == 1)
div = 1;
else
div = (g[u]).size() - 1;
go_down(x, u, val / div);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
unsigned long long int n, sumov = 0;
cin >> n;
inic.push_back(0);
bool chi = false;
for (unsigned long long int i = (unsigned long long int)(0);
i < (unsigned long long int)(n); i++) {
unsigned long long int op;
cin >> op;
inic.push_back(op);
sumov += op;
}
for (unsigned long long int i = (unsigned long long int)(0);
i < (unsigned long long int)(n - 1); i++) {
unsigned long long int n1, n2;
cin >> n1 >> n2;
g[n1].push_back(n2), g[n2].push_back(n1);
}
unsigned long long int topp = dfs(1, -1);
go_down(1, -1, topp);
unsigned long long int k = 1e9, sum = 0;
for (unsigned long long int i = (unsigned long long int)(0);
i < (unsigned long long int)((rec).size()); i++)
if (inic[rec[i].second] == 0 or rec[i].first == 0) chi = true;
if (chi)
cout << sumov;
else {
for (unsigned long long int i = (unsigned long long int)(0);
i < (unsigned long long int)((rec).size()); i++)
k = min(k, inic[rec[i].second] / rec[i].first);
for (unsigned long long int i = (unsigned long long int)(0);
i < (unsigned long long int)((rec).size()); i++)
sum += inic[rec[i].second] - k * rec[i].first;
cout << sum << endl;
}
return 0;
}
| 13 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long n, q, ans, dsum;
long long gcd(long long a, long long b) {
while (a && b) a > b ? a %= b : b %= a;
return a + b;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> q;
v.push_back(q);
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
ans += 1ll * v[i] * i - dsum;
dsum += v[i];
}
ans *= 2;
for (int i = 0; i < v.size(); i++) ans += v[i];
long long q = gcd(ans, n);
cout << ans / q << " " << n / q << endl;
cin.get();
cin.get();
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int oo = numeric_limits<int>::max() / 2;
mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
ll count(const int n) {
ll m = (n + 1) / 2;
ll r1 = m * m;
m = n / 2;
ll r2 = m * (m + 1);
return r2 - r1;
}
ll query(const int l, const int r) { return count(r) - count(l - 1); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
cout << query(l, r) << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
struct data {
int nt, to, w;
} a[N << 1];
int head[N], pre[N], c[N], vis[N], d[N], dis[N], q[N];
int mx = 0, cnt = 0;
void add(int x, int y, int w) {
a[++cnt].to = y, a[cnt].w = w, a[cnt].nt = head[x], head[x] = cnt;
a[++cnt].to = x, a[cnt].w = w, a[cnt].nt = head[y], head[y] = cnt;
}
void dfs(int u, int fa) {
pre[u] = fa;
for (int i = head[u]; i; i = a[i].nt) {
int to = a[i].to;
if (to == fa) continue;
dis[to] = dis[u] + a[i].w;
dfs(to, u);
}
}
void go(int u, int now) {
vis[u] = 1, mx = max(mx, now);
for (int i = head[u]; i; i = a[i].nt) {
int to = a[i].to;
if (vis[to]) continue;
go(to, now + a[i].w);
}
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 2; i <= n; ++i) {
int x, y, w;
scanf("%d%d%d", &x, &y, &w);
add(x, y, w);
}
dfs(1, 0);
int be = -1, maxn = 0;
for (int i = 1; i <= n; ++i) {
if (maxn < dis[i]) {
be = i, maxn = dis[i];
}
}
memset(dis, 0, sizeof dis);
memset(pre, 0, sizeof pre);
dfs(be, 0);
int st = -1;
maxn = 0;
for (int i = 1; i <= n; ++i) {
if (maxn < dis[i]) {
st = i, maxn = dis[i];
}
}
for (; st; st = pre[st]) {
c[++c[0]] = st, vis[st] = 1;
}
reverse(c + 1, c + 1 + c[0]);
for (int i = 1; i <= c[0]; ++i) {
mx = 0;
go(c[i], 0);
d[i] = mx;
}
k = min(k, c[0]);
int ans = 1e9;
int head = 1, tail = 0;
for (int i = 1; i <= c[0]; ++i) {
while (head <= tail && d[q[tail]] <= d[i]) tail--;
q[++tail] = i;
while (head <= tail && q[head] <= i - k) head++;
if (i >= k) {
int pos = max(dis[c[i - k + 1]], dis[c[c[0]]] - dis[c[i]]);
ans = min(ans, max(pos, d[q[head]]));
}
}
printf("%d\n", ans);
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
vector<int> V[10];
int g(int x) {
if (x < 10) return x;
int ret = 1;
while (x) {
if (x % 10) ret *= x % 10;
x /= 10;
}
return g(ret);
}
int main() {
int q, l, r, k;
for (q = 1; q < 1000009; ++q) V[g(q)].push_back(q);
scanf("%d", &q);
while (q--)
scanf("%d%d%d", &l, &r, &k),
printf("%d\n", upper_bound(V[k].begin(), V[k].end(), r) -
lower_bound(V[k].begin(), V[k].end(), l));
exit(0);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long jc[100];
int main() {
long long i, j, n, m;
jc[1] = 2;
long long bz = 1000000000000000000ll;
int jz;
cin >> n >> m;
for (i = 2; 1; i++) {
jc[i] = jc[i - 1] * 2;
if (jc[i] > bz) {
jz = i;
break;
}
}
if (n == 0 && m == 0)
cout << 0 << endl;
else if (n > m || (m - n) % 2 == 1) {
cout << -1 << endl;
} else if (n == m) {
cout << 1 << endl;
cout << n << endl;
} else {
int cnt = 1;
long long jp = 0;
long long dx = m - n;
jp = dx / 2;
if (((n + jp) ^ jp) == n) {
printf("2\n");
printf("%lld %lld\n", n + jp, jp);
} else {
printf("3\n");
printf("%lld %lld %lld\n", n, jp, jp);
}
}
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int a[1010], b[1010];
int n;
int ans[1010];
bool used[1010];
bool judge() {
memset(used, false, sizeof(used));
for (int i = 1; i <= n; ++i) {
int tmp = ans[i];
if (used[tmp]) return false;
used[tmp] = true;
}
return true;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) scanf("%d", &b[i]);
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (a[i] != b[i]) ++cnt;
if (cnt == 1) {
int id;
for (int i = 1; i <= n; ++i) {
if (a[i] == b[i]) {
ans[i] = a[i];
used[a[i]] = true;
} else
id = i;
}
for (int i = 1; i <= n; ++i)
if (!used[i]) ans[id] = i;
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
exit(0);
}
int id1 = 0, id2 = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] == b[i])
ans[i] = a[i];
else {
if (id1)
id2 = i;
else
id1 = i;
}
}
ans[id1] = a[id1];
ans[id2] = b[id2];
if (!judge()) {
ans[id1] = b[id1];
ans[id2] = a[id2];
}
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
ll sum = 0;
for (int i = 1; i <= x; i++) sum += pow(2, i);
cout << sum << endl;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, sum = 0, ans = 0, t = 0, d, j, m, c = 1, x, y, p = 1;
cin >> n;
int a[n];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
p = i;
break;
}
}
for (i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
c = i;
}
}
reverse(a + p, a + c + 1);
for (i = 1; i < n; i++) {
if (a[i] > a[i + 1]) {
cout << "no";
return 0;
}
}
cout << "yes\n";
cout << p << " " << c;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%i%i", &a, &b);
if (a < b)
printf("-1");
else
printf("%.12lf", (a + b) / (2.0 * ((a + b) / (2 * b))));
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 6;
const int MOD = 1e9 + 7;
string func(string str) {
if (str.size() <= 1) return str;
int zeroes = 0, ones = 0;
for (auto s : str) {
if (s == '0')
zeroes++;
else
ones++;
}
string result;
if (ones) result += '1';
for (int i = 0; i < zeroes; i++) {
result += '0';
}
return result;
}
int main() {
int n;
string str;
cin >> n >> str;
string result = func(str);
cout << result << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int m;
cin >> m;
vector<int> v;
int s2 = 0;
int s5 = 0;
for (int i = 1;; i++) {
int x = i;
while (x % 2 == 0) {
s2++;
x /= 2;
}
while (x % 5 == 0) {
s5++;
x /= 5;
}
if (min(s2, s5) == m) {
v.push_back(i);
}
if (min(s2, s5) > m) break;
}
cout << v.size() << endl;
for (int vv : v) {
cout << vv << " ";
}
cout << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long s = 0, w = 1;
char c;
while (c = getchar(), c > '9' || c < '0')
if (c == '-') w = -1;
while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
return s * w;
}
inline void write(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) write(x / 10);
putchar(x % 10 | '0');
}
inline void wln(long long x) {
write(x);
putchar(10);
}
inline void wlk(long long x) {
write(x);
putchar(32);
}
const long long maxn = 1e5 + 3;
map<long long, long long> M[maxn << 1];
long long f[maxn], wr[maxn], nxt[maxn], n, ans, opt;
signed main() {
long long n = read();
for (long long i = 1; i <= n; ++i) {
long long val = read(), num = read();
long long l = read(), r = read();
if (!l || M[l].find(r + num) != M[l].end()) {
long long now = M[l][r + num];
f[i] = f[now] + val;
nxt[i] = now;
if (!r & f[i] > f[opt]) opt = i;
if (f[i] > f[M[l + num][r]]) M[l + num][r] = i;
}
}
while (opt) wr[++ans] = opt, opt = nxt[opt];
wln(ans);
for (long long i = ans; i >= 1; --i) wlk(wr[i]);
return putchar(10), 0;
}
| 16 |
#include <bits/stdc++.h>
int main() {
long long int c = 0, n1, n2, i, mean;
scanf("%lli", &c);
for (i = 0; i < c; i++) {
scanf("%lli %lli", &n1, &n2);
if ((n1 * 2) <= n2) printf("%lli %lli\n", n1, n1 * 2);
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
int n, i;
cin >> n;
string s;
cin >> s;
if (n & 1)
cout << ":(";
else {
int a = n / 2, b = n / 2, c = 0, bad = 0;
for (i = 0; i < n; i++) {
if (s[i] == '(') a--;
if (s[i] == ')') b--;
}
for (i = 0; i < n; i++) {
if (a <= 0) break;
if (s[i] == '?') {
s[i] = '(';
a--;
}
}
for (i = 0; i < n; i++) {
if (b <= 0) break;
if (s[i] == '?') {
s[i] = ')';
b--;
}
}
for (i = 0; i < n; i++) {
if (s[i] == '(')
c++;
else
c--;
if (c <= 0 && i != n - 1) bad = 1;
}
if (!bad && c == 0)
cout << s;
else
cout << ":(";
}
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int w = 0, x = 0;
char c = getchar();
while (!isdigit(c)) w |= c == '-', c = getchar();
while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return w ? -x : x;
}
namespace star {
const int maxn = 2e5 + 10;
inline void work() {
int n = read();
puts("2");
if (n == 2) {
puts("1 2");
return;
}
printf("%d %d\n%d %d\n", n, n - 2, n - 1, n - 1);
for (int i = n - 1; i >= 3; i--) printf("%d %d\n", i, i - 2);
}
} // namespace star
signed main() {
int T = read();
while (T--) star::work();
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int INF = 1000000005;
vector<int> sieveOfEratosthenes(int n) {
vector<int> v;
bool prime[n + 1];
memset(prime, true, sizeof(prime));
v.push_back(0);
v.push_back(0);
for (int i = 2; i < n + 1; i++) {
if (prime[i]) {
for (int j = i; j <= n; j += i) {
prime[j] = false;
}
v.push_back(v[i - 1] + 1);
} else {
v.push_back(v[i - 1]);
}
}
return v;
}
int main() {
int t = 1;
cin >> t;
vector<int> v1;
int nMax = 1e6 + 1;
vector<int> v = sieveOfEratosthenes(nMax);
int n;
for (int i = 0; i < t; i++) {
scanf("%d", &n);
int d = sqrt(n);
printf("%d\n", v[n] - v[d] + 1);
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5+15;
const int mod = 1e9 + 7;
int add(int x,int y) {
return ((x+y)%mod+mod)%mod;
}
int mul(int x,int y) {
return (ll)x*y%mod;
}
int mypow(int x,int c) {
int ret = 1;
while(c>0) {
if(c&1) {
ret = mul(ret,x);
}
c/=2;
x = mul(x,x);
}
return ret;
}
int b[N];
int dp[N];
ll pre[N];
void solve2() {
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d", &b[i]), pre[i] = pre[i-1] + b[i];
map<ll, int> H;
H[b[1]-pre[1]] = 1;
int sum = 1;
for(int i=2;i<=n;++i) {
dp[i] = sum - H[-pre[i-1]];
H[ b[i]-pre[i]] = add(H[ b[i]-pre[i]], dp[i]);
sum = add(sum,dp[i]);
}
printf("%d\n",sum);
}
void solve() {
int t;
scanf("%d",&t);
while(t--) solve2();
}
int main()
{
//freopen("input.txt","r",stdin);
solve();
return 0;
}
| 16 |
#include <bits/stdc++.h>
using namespace std;
const int MXN = 3e6 + 10;
long long m, r, c, x, MX = 3e6, A[MXN];
long double P[MXN];
long long Solve(long long n) {
long long t = (long long)(x - P[n - 1] +
(((long double)n) * n * (n - 1) / 2)),
k = (n * n + n) / 2;
if (t % k != 0 || t < 0) return (-1);
return (t / k);
}
int main() {
scanf("%I64d", &x);
for (int i = 1; i <= MX; i++) {
P[i] = P[i - 1] + (1ll * i) * (1ll * i);
}
for (int i = 2; i <= MX; i++) {
r = Solve(1ll * i);
if (r < i) continue;
if (r == -1) continue;
A[i] = r;
if (i != r) c++;
c++;
}
A[1] = x;
if (x != 1) c++;
c++;
printf("%I64d\n", c);
for (int i = 1; i <= MX; i++)
if (A[i] != 0) printf("%d %I64d\n", i, A[i]);
for (int i = MX; i >= 1; i--)
if (A[i] != 0 && A[i] != i) printf("%I64d %d\n", A[i], i);
return (0);
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
int MOD;
inline int ADD(int a, int b) {
a += b;
if (a >= MOD) a -= MOD;
return (int)a;
}
inline void ADDTO(int &a, int b) {
a += b;
if (a >= MOD) a -= MOD;
}
inline void SUBTO(int &a, int b) {
a -= b;
if (a < 0) a += MOD;
}
inline int MUL(int a, int b) { return (int)((long long)a * b % MOD); }
int a[100010];
map<int, int> R;
int main() {
int k, b, n;
while (scanf("%d%d%d", &k, &b, &n) == 3) {
R.clear();
MOD = k - 1;
for (int i = (1); i <= (n); ++i) scanf("%d", &a[i]);
long long zero = 0, len = 0;
for (int i = (1); i <= (n + 1); ++i) {
if (a[i] == 0 && i <= n)
++len;
else {
zero += 1LL * len * (len + 1) / 2;
len = 0;
}
}
long long ans = 0;
if (b == 0)
ans = zero;
else {
b %= MOD;
int rem = 0;
for (int i = (1); i <= (n); ++i) {
rem = ADD(rem, a[i]);
++R[rem];
}
rem = 0;
for (int i = (1); i <= (n); ++i) {
int need = ADD(b, rem);
ans += R[need];
rem = ADD(rem, a[i]);
--R[rem];
}
if (b == 0) ans -= zero;
}
cout << ans << endl;
}
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
bool typetest;
inline void fastIOfileinput() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
typetest = 0;
}
const int N = 5e5 + 1;
int n;
ll k, p;
ll a[N];
void Read() {
cin >> n >> p >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
a[i] = ((a[i] * a[i] % p * a[i] % p * a[i] % p - k * a[i] % p) % p + p) % p;
}
}
void Solve() {
sort(a + 1, a + n + 1);
ll ans = 0;
for (int i = 1; i <= n; ++i) {
int j = i;
while (j <= n && a[i] == a[j]) ++j;
ans += 1ll * (j - i - 1) * (j - i) / 2;
i = j - 1;
}
cout << ans;
}
int32_t main() {
fastIOfileinput();
if (typetest) {
int t;
cin >> t;
while (t--) {
Read();
Solve();
}
} else {
Read();
Solve();
}
}
| 15 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
while (a && b) a > b ? a %= b : b %= a;
return a + b;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long fast_exp(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = ((res % 1000000007) * (base % 1000000007)) % 1000000007;
base = ((base % 1000000007) * (base % 1000000007)) % 1000000007;
exp /= 2;
}
return res % 1000000007;
}
long long A[100][100];
void compute() {
int i = 0, j = 0;
for (i = 0; i < 100; i++) {
A[i][0] = 1;
A[i][i] = 1;
}
for (i = 1; i < 100; i++) {
for (j = 1; j < 100; j++) {
A[i][j] = A[i - 1][j - 1] + A[i - 1][j];
}
}
}
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
int main() {
std::ios::sync_with_stdio(0);
cin.tie(0);
compute();
long long n, m, t, ans = 0;
cin >> n >> m >> t;
if (t < 5 || n < 4 || m < 1) {
cout << "0" << '\n';
return 0;
}
long long b, g;
t -= 5;
for (int i = 0; i <= t; i++) {
b = 4 + i;
g = 1 + t - i;
ans += A[n][b] * A[m][g];
}
cout << ans << '\n';
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
long long bit[100005];
int n;
void update(long long i, long long a) {
while (i <= n) {
bit[i] = max(bit[i], a);
i += i & -i;
}
}
long long read(long long i) {
long long r = 0;
while (i > 0) {
r = max(bit[i], r);
i -= i & -i;
}
return r;
}
int main() {
int a, m, h, w;
scanf(" %d", &n);
memset(bit, 0, sizeof(bit));
for (int i = 1; i <= n; i++) {
scanf(" %d", &a);
update(i, a);
}
scanf(" %d", &m);
for (int i = 0; i < m; i++) {
scanf(" %d %d", &w, &h);
long long t = read(w);
printf("%I64d\n", t);
update(1, t + h);
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, q, f = 0, s = 1, t, c = 0, x;
cin >> n >> q;
while (q--) {
cin >> t;
if (t == 1) {
cin >> x;
f += x;
s += x;
f %= n;
s %= n;
f += n;
s += n;
f %= n;
s %= n;
} else {
if (f % 2)
f--;
else
f++;
if (s % 2)
s--;
else
s++;
}
}
int res[n + 1];
for (int i = 0; i < n / 2; i++) {
res[(f + i * 2) % n] = 1 + i * 2;
}
for (int i = 0; i < n / 2; i++) {
res[(s + i * 2) % n] = 2 + i * 2;
}
for (int i = 0; i < n; i++) cout << res[i] << " ";
return 0;
}
| 10 |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ms(v,x) memset(v,x,sizeof(v))
#define td(v) v.begin(),v.end()
#define rtd(v) v.rbegin(),v.rend()
#define ff first
#define ss second
using namespace std;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
const ll INF=1ll<<60;
const ll mod=1000000007;
const long double PI=acosl(-1);
ll binpow(ll a, ll b) {
if (b == 0)
return 1;
ll res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
bool e_composto[1000100];
vector<ll> primo;
void crivo(ll n){
e_composto[1] = 1;
ll s=0;
for(ll i = 2; i <= n; ++i){
if(!e_composto[i]){
primo.pb(i);
for(ll j = i; j <= n; j+=i){
e_composto[j] = 1;
}
}
}
return;
}
void solve(){
ll n,m,i,j,minimo=30,ind=-1,sum=0,impar=-1;
cin>>n;
vector<ll> vet(n);
for(i=0;i<n;i++){
cin>>vet[i];
ll cnt=0,aux=vet[i];
while(aux%2==0){
cnt++;
aux/=2;
}
if(cnt<minimo) {
minimo=cnt;
ind=i;
}
sum+=vet[i];
}
if(sum%2){
cout<<0<<endl;
return;
}
sort(td(vet));
vector<int> pos(200002,0);
pos[0]=1;
for(j=0;j<n;j++){
for(i=200001;i>=vet[j];i--){
if(pos[i-vet[j]]==1) pos[i]=1;
}
}
if(pos[sum/2]==1) cout<<1<<endl<<ind+1<<endl;
else cout<<0<<endl;
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
// freopen("lcm.in", "r", stdin);
// freopen("hidden.out", "w", stdout);
ll t=1;
crivo(100500);
// cin>>t;
// ll aux=t;
while(t--){
// cout<<"CASE #"<<aux-t<<": ";
solve();
}
} | 9 |
Subsets and Splits