solution
stringlengths 53
181k
| difficulty
int64 0
13
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
long long int po(long long int base) {
long long int power = 1e9 + 5;
long long int mod = 1e9 + 7;
long long int ans = 1;
while (power > 0) {
if (power % 2 == 1) ans = (ans * base) % mod;
base = (base * base) % mod;
power /= 2;
}
return ans;
}
long long int fact[1000005] = {0}, mod = 1e9 + 7, a[1000005] = {0},
freq[1000005] = {0};
int main() {
ios::sync_with_stdio(false);
fact[0] = 1;
for (long long int i = 1; i <= 1000000; i++)
fact[i] = (fact[i - 1] * i) % mod;
int n;
cin >> n;
int m = n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int cnt = 1;
vector<pair<long long int, long long int> > v;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1])
cnt++;
else {
v.push_back({a[i - 1], cnt});
cnt = 1;
}
}
v.push_back({a[n - 1], cnt});
freq[0] = v[0].second;
n = v.size();
for (int i = 1; i < n; i++) freq[i] = freq[i - 1] + v[i].second;
int curr = v[n - 1].second;
long long int ans = 0;
for (int i = n - 2; i >= 0; i--) {
long long int d = curr + v[i].second;
long long int temp = (fact[m] * po(fact[d])) % mod;
temp = (temp * fact[d - 1]) % mod;
temp = (temp * v[i].second) % mod;
ans = (ans + (temp * v[i].first) % mod) % mod;
curr += v[i].second;
}
cout << ans;
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<int, int> > arr;
for (int i = 0; i < n; i++) {
long long b, e;
cin >> b >> e;
arr.push_back(make_pair(b, e));
}
sort(arr.begin(), arr.end());
long long res = 0, max_V = arr.at(0).second;
for (int i = 1; i < n; i++) {
if (arr.at(i).second < max_V)
res++;
else
max_V = arr.at(i).second;
}
cout << res;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k, d;
cin >> k >> d;
if (!d && k == 1) {
cout << 0;
return 0;
}
if (!d && k != 1) {
cout << "No solution";
return 0;
}
while (d < k) d += 9;
for (long long i = 1; i < k; i++) cout << 1;
cout << d - (k - 1);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
double p[105];
int cmp(double x, double y) { return x > y; }
int main(void) {
int n;
int i, j, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &p[i]);
}
sort(p, p + n, cmp);
double ans = 0;
ans = p[0];
double temp = 1.0 - p[0];
for (i = 1; i < n; i++) {
double sum = 0;
sum = (1 - p[i]) * ans + temp * p[i];
if (sum < ans)
break;
else {
ans = sum;
temp *= 1 - p[i];
}
}
printf("%.15f\n", ans);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename TT>
ostream &operator<<(ostream &s, pair<T, TT> t) {
return s << "(" << t.first << "," << t.second << ")";
}
template <typename T>
ostream &operator<<(ostream &s, vector<T> t) {
s << "{";
for (int i = 0; i < t.size(); i++)
s << t[i] << (i == t.size() - 1 ? "" : ",");
return s << "}" << endl;
}
int p[3000002];
int np[1000002];
int main() {
ios_base::sync_with_stdio(0);
int n;
scanf("%d", &(n));
;
for (int i = 0; i < n; i++) p[i] = i;
int of = 0;
for (int k = 2; k <= n; k++) {
int j = 0;
while (j < n) {
swap(p[of + j], p[of]);
j += k;
}
swap(p[of + n], p[of]);
of++;
}
for (int i = 0; i < n; i++) printf("%d ", p[of + i] + 1);
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vpii = vector<pair<int, int>>;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
void R() {}
template <class T, class... U>
inline void R(T &head, U &...tail) {
cin >> head;
R(tail...);
}
void W() {}
template <class T, class... U>
inline void W(const T &head, const U &...tail) {
cout << head << (sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
template <class T>
void W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); cout << (*i++)) {
if (i != x.cbegin()) cout << ' ';
}
cout << '\n';
}
template <class T>
inline void cmax(T &a, T b) {
a = max(a, b);
}
template <class T>
inline void cmin(T &a, T b) {
a = min(a, b);
}
mt19937 rng(time(0));
vector<int> pos[26];
char s[200005], t[100005];
int nxt[100005][26], d[100005][26];
void solve() {
cin >> (s + 1) >> (t + 1);
int n = strlen(s + 1);
for (int i = (1); i <= (int32_t)(n); ++i)
for (int j = (0); j < (int32_t)(26); ++j) nxt[i][j] = d[i][j] = 0;
for (int i = (0); i < (int32_t)(26); ++i) pos[i].clear();
int m = strlen(t + 1);
for (int i = (n + 1); i <= (int32_t)(2 * n); ++i) s[i] = s[i - n];
for (int i = (1); i <= (int32_t)(2 * n); ++i) pos[s[i] - 'a'].push_back(i);
for (int i = (1); i <= (int32_t)(n); ++i) {
for (int j = (0); j < (int32_t)(26); ++j) {
if (int32_t(pos[j].size()) == 0) continue;
int p = *upper_bound((pos[j]).begin(), (pos[j]).end(), i);
if (p > n) {
d[i][j]++;
p -= n;
}
nxt[i][j] = p;
}
}
int ok = 1;
map<char, int> pa;
for (int i = (1); i <= (int32_t)(n); ++i) pa[s[i]]++;
for (int i = (1); i <= (int32_t)(m); ++i)
if (pa.count(t[i]) == 0) ok = 0;
if (!ok) {
cout << -1 << '\n';
return;
}
int ans = 1;
int p;
for (int j = (1); j <= (int32_t)(n); ++j)
if (s[j] == t[1]) {
p = j;
break;
}
for (int i = (2); i <= (int32_t)(m); ++i) {
ans += d[p][t[i] - 'a'];
p = nxt[p][t[i] - 'a'];
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int t;
cin >> t;
while (t--) solve();
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[4][4] = {0}, visit[4] = {0};
int n;
cin >> n;
cin >> a[2][1];
cin >> a[2][3];
cin >> a[1][3];
a[1][2] = a[2][1], a[3][2] = a[2][3], a[3][1] = a[1][3];
visit[2] = 1;
if (n == 1)
cout << "0" << endl;
else {
int sum = 0;
n--;
while (n--) {
for (int i = 1; i < 4; i++) {
if (visit[i] == 1) {
int x = i - 1, y = i + 1;
if (x < 1) x += 3;
if (y > 3) y %= 3;
if (a[i][x] > a[i][y])
sum += a[i][y], visit[i] = 0, visit[y] = 1;
else
sum += a[i][x], visit[i] = 0, visit[x] = 1;
break;
}
}
}
cout << sum << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
long long gcd(long long a, long long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long i, n, x, y, sum = 0, tsum = 0, f = 0, p = 0;
cin >> n;
long long c[n];
for (int i = 0; i < int(n); i++) {
cin >> c[i];
tsum += c[i];
}
cin >> x >> y;
for (int i = 0; i < int(n); i++) {
sum += c[i];
if (sum >= x && sum <= y) {
if (tsum - sum <= y && tsum - sum >= x) {
cout << i + 2 << endl;
return 0;
}
}
}
cout << 0 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, n, m, t, a, b, c, d, shajib;
cin >> a >> b >> c >> d >> t;
c = c * t;
d = d * t;
shajib = a / t * t;
if (b < c || d < a)
cout << "NO" << endl;
else if (shajib != a && shajib + t > b)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[6] = {0};
int n, m, t;
cin >> m >> n;
for (int i = 0; i < m; i++) {
int z = 0;
for (int j = 0; j < n; j++) {
cin >> t;
if (j > 0) {
if (a[j] < a[j - 1]) {
a[j] += a[j - 1] - a[j];
}
}
a[j] += t;
if (a[j] > z) {
z = a[j];
}
}
cout << z << ' ';
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
char s[100001];
int main() {
int a, b, x, y, ss, mark = 0;
int c[500][500] = {0};
cin >> a >> b >> x >> y;
cin >> s;
ss = strlen(s);
cout << "1 ";
c[x - 1][y - 1] = 1;
for (int i = 0; i < ss; i++) {
if (i != ss - 1) {
if (s[i] == 'U') {
x--;
if (x < 1) {
x++;
cout << "0 ";
} else {
if (c[x - 1][y - 1] == 0) {
c[x - 1][y - 1] = 1;
cout << "1 ";
} else
cout << "0 ";
}
}
if (s[i] == 'D') {
x++;
if (x > a) {
x--;
cout << "0 ";
} else {
if (c[x - 1][y - 1] == 0) {
c[x - 1][y - 1] = 1;
cout << "1 ";
} else
cout << "0 ";
}
}
if (s[i] == 'L') {
y--;
if (y < 1) {
y++;
cout << "0 ";
} else {
if (c[x - 1][y - 1] == 0) {
c[x - 1][y - 1] = 1;
cout << "1 ";
} else
cout << "0 ";
}
}
if (s[i] == 'R') {
y++;
if (y > b) {
y--;
cout << "0 ";
} else {
if (c[x - 1][y - 1] == 0) {
c[x - 1][y - 1] = 1;
cout << "1 ";
} else
cout << "0 ";
}
}
} else {
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
if (c[i][j] == 0) mark++;
cout << mark << endl;
}
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int read();
const int N = 200005, P = 1000000007;
int n, m, ic;
struct Edge {
int v, nxt;
} e[N << 1];
int fir[N], o = 1;
void add(int u, int v) {
e[++o] = (Edge){v, fir[u]};
fir[u] = o;
}
vector<int> to[N];
void link(int x, int y) {
to[x].push_back(y);
to[y].push_back(x);
}
int dfn[N], low[N], now, sta[N], top, pw[N], mk[N], bl[N], f[N];
bool isbg[N << 1];
void Tarjan(int u, int ie) {
dfn[u] = low[u] = ++now;
sta[++top] = u;
for (int i = fir[u], v; i; i = e[i].nxt) {
v = e[i].v;
if (!dfn[v]) {
Tarjan(v, i);
low[u] = min(low[u], low[v]);
if (dfn[u] < low[v]) isbg[i] = isbg[i ^ 1] = 1;
} else if (i ^ (ie ^ 1))
low[u] = min(low[u], dfn[v]);
}
}
int tot;
void dfs3(int u) {
bl[u] = ic;
++tot;
for (int i = fir[u], v; i; i = e[i].nxt) {
v = e[i].v;
if (isbg[i] || bl[v]) continue;
dfs3(v);
}
}
void dccwork() {
for (int(i) = (1); (i) <= (n); ++(i))
if (!bl[i]) {
++ic;
tot = 0;
dfs3(i);
if (tot > 1) f[bl[i]] = 1;
}
for (int i = 2; i <= o; i += 2)
if (bl[e[i].v] ^ bl[e[i ^ 1].v]) link(bl[e[i].v], bl[e[i ^ 1].v]);
}
int sz[N], son[N], tp[N], dep[N], fa[N];
void dfs(int u) {
sz[u] = 1;
for (int v : to[u])
if (v != fa[u]) {
f[v] += f[u];
fa[v] = u;
dep[v] = dep[u] + 1;
dfs(v);
sz[u] += sz[v];
if (sz[son[u]] < sz[v]) son[u] = v;
}
}
void dfs2(int u, int t) {
tp[u] = t;
if (son[u]) dfs2(son[u], t);
for (int v : to[u])
if (v != son[u] && v != fa[u]) dfs2(v, v);
}
int getlca(int x, int y) {
while (tp[x] ^ tp[y]) {
if (dep[tp[x]] < dep[tp[y]]) swap(x, y);
x = fa[tp[x]];
}
return dep[x] < dep[y] ? x : y;
}
int cnt(int x, int y, int z = 0) {
z = getlca(x, y);
return f[x] + f[y] - f[z] - f[fa[z]];
}
int main() {
n = read(), m = read();
for (int i = 1, x, y; i <= m; ++i)
x = read(), y = read(), add(x, y), add(y, x);
Tarjan(1, 0);
dccwork();
dfs(1);
dfs2(1, 1);
pw[0] = 1;
for (int(i) = (1); (i) <= (n); ++(i)) pw[i] = (pw[i - 1] << 1) % P;
int Q = read();
for (int i = 1, x, y; i <= Q; ++i) {
x = read(), y = read();
printf("%d\n", pw[cnt(bl[x], bl[y])]);
}
return 0;
}
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return f * x;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int calc(int r1, int p1, int s1, int r2, int p2, int s2) {
int temp = min(r1, max(0, min(r2, (s2 + r2) - s1)));
int mn = 0;
mn += temp;
r2 -= temp;
r1 -= temp;
temp = min(r1, max(0, min(p2, (s2 + p2) - p1)));
mn += temp;
p2 -= temp;
r1 -= temp;
temp = min(r2, s1);
mn += temp;
s1 -= temp;
r2 -= temp;
temp = min(s2, s1);
mn += temp;
s2 -= temp;
s1 -= temp;
temp = min(p1, p2 + s2);
mn += temp;
return mn;
}
int main() {
int n, r1, p1, s1, r2, p2, s2;
cin >> n >> r1 >> s1 >> p1 >> r2 >> s2 >> p2;
int mx = 0;
mx += min(r1, s2) + min(p1, r2) + min(s1, p2);
int mn = 0;
mn = max(mn, calc(r1, p1, s1, r2, p2, s2));
cout << n - mn << " " << mx << endl;
}
| 5 |
#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const int N = (int)1e5 + 5;
using namespace std;
int t, n;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> t;
a[0] = -1;
while (t--) {
cin >> n;
for (int i = (1); i < (n + 1); i++) cin >> a[i];
if (n % 2 == 0) {
puts("YES");
continue;
} else {
bool ans = false;
for (int i = (1); i < (n + 1); i++) {
if (a[i] <= a[i - 1]) {
ans = true;
break;
}
}
puts(ans ? "YES" : "NO");
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int a[n];
int i, j;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
if (a[j] < a[i]) {
a[i] = a[j] + a[i];
a[j] = a[i] - a[j];
a[i] = a[i] - a[j];
}
}
if (n % 2 == 1)
printf("%d", a[n / 2]);
else
printf("%d", a[n / 2]);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
char s[90], r[90], a[90], b[90], ans[90] = {"Unhandled Exception"};
int n;
bool flag = false;
bool check() {
bool ok = false;
while (scanf("%*[^a-z]%[a-z]", s), s[1] != 'a') {
if (s[1] == 'r') ok |= check();
if (s[1] == 'h') {
scanf("%*[^A-Za-z]%[A-Za-z]", r);
ok = true;
}
}
scanf("%*[^A-Za-z]%[A-Za-z]", a);
scanf("%*[^\"]\"%[^\"]", b);
if (ok && !flag && strcmp(a, r) == 0) {
flag = true;
strcpy(ans, b);
}
return ok;
}
int main() {
scanf("%d", &n);
while (scanf("%*[^a-z]%[a-z]", s) != EOF && s[1] == 'r') check();
scanf("%*[^\n]\n");
printf("%s\n", ans);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3 * 10e5 + 5;
long long int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
if (n == 1) {
printf("%lld\n", a[0]);
return 0;
}
sort(a, a + n);
long long int sum = 0;
sum += n * a[n - 1] + n * a[n - 2];
for (int i = 0; i <= n - 3; i++) {
sum += (2 + i) * a[i];
}
printf("%lld\n", sum);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
for (cin >> n; n--;) {
cin >> a >> b;
if (b == 0)
cout << 1 << endl;
else
cout << setprecision(20)
<< (4 * b < a ? 1 - b * 1. / a : .5 + a / 16. / b) << endl;
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long a[12], ans;
long long n, k, need, sum;
bool have[12];
signed main() {
long long T;
cin >> T;
while (T--) {
ans = 0, need = 0, sum = 0;
cin >> n >> k;
for (long long i = 1; i <= n; ++i) cin >> a[i], a[i] = pow(10, a[i]);
a[++n] = 1e18;
for (long long i = 2; i <= n; ++i) {
if (need + (a[i] - a[i - 1]) / a[i - 1] > k) {
cout << (k - need + 2) * a[i - 1] - 1 << '\n';
break;
}
need += (a[i] - a[i - 1]) / a[i - 1];
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long int MOD = 998244353;
long long int pwr(long long int x, long long int y) {
long long int res = 1;
x = x % MOD;
while (y > 0) {
if (y & 1) res = (res * x) % MOD;
y = y >> 1;
x = (x * x) % MOD;
}
return res;
}
inline long long int addmod(long long int a, long long int b) {
return ((a + b) % MOD);
}
inline long long int mulmod(long long int a, long long int b) {
return ((a * b) % MOD);
}
class BIT {
int *bit;
int N;
public:
void update(int x, int val) {
int ind = x;
while (ind <= N) {
bit[ind] += val;
ind += (ind & (-ind));
}
}
BIT(int ar[], int n) {
bit = new int[n + 1];
N = n + 1;
for (int i = 1; i < N; i++) bit[i] = 0;
for (int i = 1; i < N; i++) update(i, ar[i - 1]);
}
int getSum(int x) {
if (x < 0) return 0;
int ind = x + 1;
int sum = 0;
while (ind > 0) {
sum += bit[ind];
ind = (ind & (ind - 1));
}
return sum;
}
int getValue(int x) { return getSum(x) - getSum(x - 1); }
void changeElem(int x, int val) { update(x + 1, val - getValue(x)); }
};
int main() {
int T;
cin >> T;
while (T--) {
string s, t;
cin >> t;
bool allsame = true;
for (int i = 0; i < t.size(); i++) {
s += "01";
if (i > 0) {
if (t[i] != t[i - 1]) allsame = false;
}
}
if (allsame)
cout << t << endl;
else
cout << s << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void reduce(string &s1, int &max1, int i, int l1) {
if (i >= l1 - 2) {
if (s1[i] == '1' && max1 > i) max1 = i;
return;
}
if (s1[i] == '1' && s1[i + 1] == '0' && s1[i + 2] == '0') {
if (max1 > i + 1) max1 = i + 1;
s1[i] = '0';
s1[i + 1] = '1';
s1[i + 2] = '1';
reduce(s1, max1, i + 2, l1);
} else if (s1[i] == '1' && s1[i + 1] == '0') {
if (i < max1) max1 = i;
reduce(s1, max1, i + 2, l1);
if (s1[i + 2] == '0') {
if (max1 == i) max1 = i + 1;
s1[i] = '0';
s1[i + 1] = '1';
s1[i + 2] = '1';
}
} else {
if (s1[i] == '1' && max1 > i) max1 = i;
reduce(s1, max1, i + 1, l1);
}
return;
}
int main() {
string s1, s2;
cin >> s1 >> s2;
int l1, l2, max1, max2;
l1 = s1.size();
l2 = s2.size();
max1 = l1 - 1;
max2 = l2 - 1;
reduce(s1, max1, 0, l1);
reduce(s2, max2, 0, l2);
int i;
if (l1 - max1 > l2 - max2)
cout << ">";
else if (l1 - max1 < l2 - max2)
cout << "<";
else {
for (int i = 0; i < l1 - max1; i++) {
if (s1[max1 + i] > s2[max2 + i]) {
cout << ">";
return 0;
} else if (s1[max1 + i] < s2[max2 + i]) {
cout << "<";
return 0;
}
}
cout << "=";
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, cnt0, cnt1, cnt2, cnt[3], sum, x[5005], y[5005];
vector<int> g[3];
bool f;
inline long long read() {
long long f = 1, sum = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
sum = (sum << 1) + (sum << 3) + (ch ^ 48);
ch = getchar();
}
return f * sum;
}
inline void write(int x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int main() {
n = read();
for (register int i = 1; i <= n; i++) {
char s = getchar();
while (s < '0' || s > '1') s = getchar();
x[i] = s - '0';
}
for (register int i = 1; i <= n; i++) {
char s = getchar();
while (s < '0' || s > '1') s = getchar();
y[i] = s - '0';
cnt[x[i] + y[i]]++;
sum += y[i];
g[x[i] + y[i]].push_back(i);
}
for (register int x2 = 0; x2 <= cnt[2]; x2++) {
int x1 = sum - (x2 << 1), x0 = (n >> 1) - x1 - x2;
if (x1 >= 0 && x1 <= cnt[1] && x0 >= 0 && x0 <= cnt[0]) {
for (register int i = 0; i <= x0 - 1; i++) write(g[0][i]), printf(" ");
for (register int i = 0; i <= x1 - 1; i++) write(g[1][i]), printf(" ");
for (register int i = 0; i <= x2 - 1; i++) write(g[2][i]), printf(" ");
f = 1;
break;
}
}
if (!f) {
cout << -1;
return 0;
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 1;
const long long inf = 0x7ffffffffff;
const long long NINF = -inf;
const long long mod = 998244353;
template <class T>
inline void read(T &res) {
char c;
T flag = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-') flag = -1;
res = c - '0';
while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
res *= flag;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
map<double, int> occ;
vector<pair<int, int> > v;
for (long long i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v.emplace_back(x, y);
}
long long nl = 0;
for (long long i = 0; i < n; i++) {
map<double, int> seen;
for (long long j = i + 1; j < n; j++) {
double dx;
int y = v[j].second - v[i].second, x = v[j].first - v[i].first;
if (x != 0)
dx = y / (double)x;
else
dx = 1234.9125123;
seen[dx]++;
}
for (pair<double, int> xx : seen) {
if (xx.second == 1) {
occ[xx.first]++;
nl++;
}
}
}
long long re = (nl) * (nl - 1) / 2;
for (pair<double, int> xx : occ) {
re -= (xx.second) * (xx.second - 1) / 2;
}
cout << re << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C& _a4, C _b4) {
_a4 = min(_a4, _b4);
}
template <class C>
void maxi(C& _a4, C _b4) {
_a4 = max(_a4, _b4);
}
template <class TH>
void _dbg(const char* sdbg, TH h) {
cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA>
void _dbg(const char* sdbg, TH h, TA... a) {
while (*sdbg != ',') cerr << *sdbg++;
cerr << '=' << h << ',';
_dbg(sdbg + 1, a...);
}
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
os << "[";
for (auto& vv : V) os << vv << ",";
os << "]";
return os;
}
const long long MAX = 30000;
long long a[MAX], b[MAX], c[MAX], f[MAX];
set<long long> inc[MAX];
vector<long long> d[MAX];
long long deg[MAX];
long long n, m;
long long find(long long a) { return f[a] == a ? a : f[a] = find(f[a]); }
vector<long long> todo;
void wrzuc(set<long long>& a, set<long long>& b) {
for (long long el : b) {
if (!a.insert(el).second) {
deg[c[el]]--;
if (deg[c[el]] == 1) todo.push_back(c[el]);
a.erase(el);
}
}
set<long long> pom;
swap(pom, b);
}
bool uni(long long i) {
long long a = find(::a[i]);
long long b = find(::b[i]);
if (a == b) return 0;
if (((long long)(inc[a]).size()) < ((long long)(inc[b]).size())) {
wrzuc(inc[b], inc[a]);
f[a] = b;
} else {
wrzuc(inc[a], inc[b]);
f[b] = a;
}
return 1;
}
long long res = 0;
void rob(long long k) {
for (long long i : d[k]) {
if (uni(i)) {
res++;
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(11);
if (0) cout << fixed << setprecision(6);
cin >> n >> m;
for (long long i = (0); i <= ((long long)(n)-1); i++) f[i] = i;
for (long long i = (0); i <= ((long long)(m)-1); i++) {
cin >> a[i] >> b[i] >> c[i];
a[i]--;
b[i]--;
c[i]--;
inc[a[i]].insert(i);
inc[b[i]].insert(i);
d[c[i]].push_back(i);
deg[c[i]]++;
}
for (long long i = (0); i <= ((long long)(m)-1); i++) {
if (deg[i] == 1) todo.push_back(i);
}
for (long long i = (0); i <= ((long long)(((long long)(todo).size())) - 1);
i++) {
rob(todo[i]);
}
for (long long i = (0); i <= ((long long)(m)-1); i++) {
if (deg[i] > 1) res++;
}
cout << res << endl;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 1000005, mod = 998244353;
long long n, a[MX], b[MX], x[MX], y[MX], z[MX], s, res;
bitset<MX> bs;
long long pot(long long b, int p) {
long long res = 1;
b %= mod;
while (p) {
if (p & 1) (res *= b) %= mod;
(b *= b) %= mod;
p /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
for (int k = s - 1; k >= 0; k--) {
long long inv = pot(s * (1 - y[k + 1]) + k * (n - 2 + y[k + 1]), mod - 2);
y[k] = k * (n - 1) % mod * inv % mod;
z[k] = (s * (n - 1) + (s - k) * z[k + 1]) % mod * inv % mod;
if (!inv) {
z[k - 1] = b[k - 1] = -(s * (n - 1) + (s - k) * z[k + 1]) % mod *
pot(k * (n - 1), mod - 2) % mod;
bs[k] = 1;
k--;
}
}
b[0] = z[0];
for (int k = 1; k < s; k++)
if (!bs[k]) b[k] = (y[k] * b[k - 1] + z[k]) % mod;
for (int i = 0; i < n; i++) res += b[a[i]];
res %= mod;
res = (n * res - n * (n - 1) % mod * b[0]) % mod;
(res *= pot(n * n, mod - 2)) %= mod;
cout << ((((res) % (mod)) + (mod)) % (mod)) << '\n';
return 0;
}
| 12 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int maxn = 4e3 + 10, INF = 0x3f3f3f3f;
int N, M, T[4];
char A[maxn], B[maxn];
int nearA[26][maxn], nearB[26][maxn];
int dp[maxn][maxn];
int main() {
for (int i = 0; i < 4; i++) scanf("%d", &T[i]);
scanf(" %s %s", A + 1, B + 1);
N = strlen(A + 1);
M = strlen(B + 1);
memset(nearA, -1, sizeof(nearA));
memset(nearB, -1, sizeof(nearB));
for (int i = 1; i <= N; i++) {
for (int j = 0; j < 26; j++) nearA[j][i] = nearA[j][i - 1];
nearA[A[i] - 'a'][i] = i;
}
for (int i = 1; i <= M; i++) {
for (int j = 0; j < 26; j++) nearB[j][i] = nearB[j][i - 1];
nearB[B[i] - 'a'][i] = i;
}
dp[0][0] = 0;
for (int i = 1; i <= N; i++) dp[i][0] = i * T[1];
for (int i = 1; i <= M; i++) dp[0][i] = i * T[0];
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
dp[i][j] = min(dp[i][j - 1] + T[0], dp[i - 1][j] + T[1]);
if (A[i] == B[j])
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]);
else
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + T[2]);
int na = nearA[B[j] - 'a'][i - 1], nb = nearB[A[i] - 'a'][j - 1];
if (~na && ~nb) {
dp[i][j] = min(dp[i][j], (i - na - 1) * T[1] + (j - nb - 1) * T[0] +
T[3] + dp[na - 1][nb - 1]);
}
}
}
printf("%d\n", dp[N][M]);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int const N = 100 * 1000 + 16;
int const M = 1000 * 1000 * 1000 + 7;
int n;
int a[N];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
cin >> n;
set<int> s;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
auto f = s.upper_bound(x);
if (f == s.end() || next(f) != s.end()) {
if (f == s.end()) a[x]--;
s.insert(x);
} else {
a[*f]++;
s.insert(x);
}
}
cout << (max_element(a + 1, a + n + 1) - a);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
const long long NN = 2e2 + 20;
const long long mod = 998244353;
long long n;
long long cnt = 0;
int32_t main() {
cin >> n;
long long k = n / 3;
for (long long i = -1; i <= 1; i++) {
long long t = abs(i);
for (long long j = 0; j < k; j++) {
cout << i << " " << t << "\n";
t += 2;
}
}
n %= 3;
if (n > 0) {
n--;
cout << "0 -2\n";
}
if (n > 0) {
n--;
cout << "0 -4\n";
}
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const double _PI = 3.141592653589793;
double n, m, k, ans = 0;
signed main() {
scanf("%lf %lf %lf", &n, &m, &k);
ans += ((n * n * sqrt(3)) / 4) * (sqrt(n * n * 2 / 3)) / 3;
ans += (m * m) / 3 * (sqrt(m * m / 2));
double S = (k * k * 5) / (4 * tan(_PI / 5)), r = S / (2.5 * k);
ans += S * sqrt(3 * k * k / 4 - r * r) / 3;
printf("%0.12lf", ans);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int ncr[101];
int a[101][101];
int main() {
int k, i, j, l, n = 100, c;
ncr[3] = 1;
for (i = 4; i <= n; i++) {
ncr[i] = (ncr[i - 1] * i) / (i - 3);
}
scanf("%d", &k);
c = 100;
l = 1;
while (k) {
if (ncr[c] <= k) {
k -= ncr[c];
for (i = l; i < l + c; i++) {
for (j = l; j < l + c; j++) {
if (i != j) a[i][j] = 1;
}
}
l = l + c;
break;
} else
c--;
}
for (i = 1; i <= 100; i++) {
for (j = 1; j < i; j++) {
if (a[i][j]) continue;
c = 0;
for (l = 1; l <= 100; l++) {
if (a[i][l] && a[j][l]) c++;
}
if (c <= k) {
a[i][j] = 1;
a[j][i] = 1;
k -= c;
}
if (k == 0) break;
}
}
printf("%d\n", n);
for (i = 1; i <= 100; i++) {
for (j = 1; j <= 100; j++) printf("%d", a[i][j]);
printf("\n");
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
const int mod = 51123987, maxn = 155;
__inline int abss(int a) {
if (a > 0) return a;
return -a;
}
char s[200];
int f[maxn][55][55][55], g[maxn][3], n;
int main() {
scanf("%d%s", &n, s);
g[n][0] = g[n][1] = g[n][2] = n;
for (int i = n - 1; i >= 0; i--) {
g[i][0] = g[i + 1][0];
g[i][1] = g[i + 1][1];
g[i][2] = g[i + 1][2];
g[i][s[i] - 'a'] = i;
}
f[0][0][0][0] = 1;
int m = (n + 2) / 3 + 1, ans = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
for (int k = 0; k < m; k++)
for (int l = 0; l < m; l++)
if (f[i][j][k][l]) {
if (j + k + l == n && abss(j - k) <= 1 && abss(k - l) <= 1 &&
abss(l - j) <= 1)
ans = (ans + f[i][j][k][l]) % mod;
if (g[i][0] != n)
f[g[i][0]][j + 1][k][l] =
(f[g[i][0]][j + 1][k][l] + f[i][j][k][l]) % mod;
if (g[i][1] != n)
f[g[i][1]][j][k + 1][l] =
(f[g[i][1]][j][k + 1][l] + f[i][j][k][l]) % mod;
if (g[i][2] != n)
f[g[i][2]][j][k][l + 1] =
(f[g[i][2]][j][k][l + 1] + f[i][j][k][l]) % mod;
}
printf("%d\n", ans);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long t, n, k, i;
cin >> n >> k;
long long a[n], cnt = 0, cost, l = 0, r = 0, maxrem = 0, rem = k;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 1; i < n; i++) a[i] += a[i - 1];
while (r < n) {
if (!l)
cost = a[r];
else
cost = a[r] - a[l - 1];
if (cost <= k) {
rem = k - cost;
if (cnt < (r - l + 1)) {
cnt = r - l + 1;
}
r++;
} else {
if (l == r) r++;
l++;
}
}
if (cnt)
cout << cnt;
else
cout << 0;
cout << "\n";
;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
solve();
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int fen[5][11][11][100100];
void upd_x(int id, int a, int b, int k, int x) {
for (; k <= 100010; k = (k | (k + 1))) {
fen[id][a][b][k] += x;
}
}
int sum_x(int id, int a, int b, int r) {
int s = 0;
for (; r >= 0; r = (r & (r + 1)) - 1) {
s += fen[id][a][b][r];
}
return s;
}
int sum_lr(int id, int a, int b, int l, int r) {
return sum_x(id, a, b, r) - sum_x(id, a, b, l - 1);
}
int get_id(char e) {
if (e == 'A') return 1;
if (e == 'T') return 2;
if (e == 'G') return 3;
if (e == 'C') return 4;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
long long n, ans, id, q;
char e;
string s, t;
cin >> s;
s = "0" + s;
for (int i = 1, kpf = int(s.size()); i < kpf; i++) {
id = get_id(s[i]);
for (int a = 1; a <= 10; a++) {
long long b = (i % a) + (a * (i % a == 0));
upd_x(id, a, b, i, 1);
}
}
n = int(s.size()) - 1;
cin >> q;
for (int i = 1; i <= q; i++) {
long long l, r;
cin >> l;
if (l == 1) {
cin >> l >> e;
id = get_id(s[l]);
for (int a = 1; a <= 10; a++) {
long long b = (l % a) + (a * (l % a == 0));
upd_x(id, a, b, l, -1);
}
s[l] = e;
id = get_id(s[l]);
for (int a = 1; a <= 10; a++) {
long long b = (l % a) + (a * (l % a == 0));
upd_x(id, a, b, l, 1);
}
} else {
cin >> l >> r >> t;
long long a = int(t.size());
ans = 0;
for (int j = 0, kpf = int(t.size()); j < kpf; j++) {
id = get_id(t[j]);
long long f, b;
f = l + j;
b = (f % a) + (a * (f % a == 0));
ans += sum_lr(id, a, b, l, r);
}
cout << ans << '\n';
}
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
char b[10] = "aouien";
int i, f = 1, f1, f2, j, len;
cin >> a;
len = a.length();
for (i = 0; i < len - 1; i++) {
f1 = 0;
f2 = 0;
for (j = 0; j < 6; j++) {
if (a[i] == b[j]) f1 = 1;
}
if (!f1) {
for (j = 0; j < 5; j++) {
if (a[i + 1] == b[j]) f2 = 1;
}
} else
continue;
if (!f2) {
f = 0;
break;
}
}
f1 = 0;
for (i = 0; i < 6; i++) {
if (a[len - 1] == b[i]) f1 = 1;
}
if (!f1) f = 0;
if (f)
printf("YES");
else
printf("NO");
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
string keyboard1, keyboard2, s1;
pair<char, char> translate[26];
int main() {
cin >> keyboard1 >> keyboard2 >> s1;
n = s1.size();
for (int i = 0; i < 26; i++) {
translate[i].first = char(keyboard1[i]);
translate[i].second = char(keyboard2[i]);
}
for (int i = 0; i < 26; i++)
cerr << translate[i].first << " " << translate[i].second << " ";
for (int i = 0; i < n; i++) {
if (s1[i] >= '0' && s1[i] <= '9') cout << s1[i];
for (int j = 0; j < 26; j++)
if (translate[j].first == s1[i] && s1[i] >= 'a') {
cout << char(translate[j].second);
break;
} else if (translate[j].first == tolower(s1[i])) {
cout << char(toupper(translate[j].second));
break;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int INF = 0x7f7f7f7f;
const double PI = acos(-1.0);
char CRTBUFF[30000];
template <class T>
inline T gcd(T a, T b) {
return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
return ((a) / gcd((a), (b)) * (b));
}
template <typename T>
string NumberToString(T Number) {
ostringstream second;
second << Number;
return second.str();
}
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
long long a[200004];
int get(int low, int high, long long val, long long biog) {
int res = 1;
while (low <= high) {
int mid = (low + high) / 2;
if (a[mid] - biog > val) {
high = mid - 1;
res = mid;
} else
low = mid + 1;
}
return res;
}
int main() {
int n, m;
while (~scanf("%d%d", &n, &m)) {
for (int i = (int)(1); i <= (int)(n); i++) {
scanf("%lld", &a[i]);
}
a[0] = 0;
for (int i = (int)(1); i <= (int)(n); i++) {
a[i] = a[i] + a[i - 1];
}
long long biog = 0;
int l = 1;
for (int i = (int)(1); i <= (int)(m); i++) {
long long x;
scanf("%lld", &x);
;
int kk = get(l, n, x, biog);
if (biog + x >= a[n])
biog = 0;
else
biog += x;
;
l = kk;
printf("%d\n", n - l + 1);
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
inline int add(int a, int b) {
if ((a += b) >= mod) a -= mod;
return a;
}
inline int dec(int a, int b) {
if ((a -= b) < 0) a += mod;
return a;
}
inline int mult(int a, int b) {
long long t = 1ll * a * b;
if (t >= mod) t %= mod;
return t;
}
int n, K, S[210][210], fac[210], f[100010][210], siz[100010], tmp[210], g[210],
tmp2[210];
vector<int> v[100010];
void dfs(int np, int fath) {
f[np][0] = 2;
siz[np] = 1;
for (int &x : v[np]) {
if (x == fath) continue;
dfs(x, np);
int kx = min(K, siz[x]);
int ky = min(K, siz[np]);
copy(f[x], f[x] + kx + 1, tmp);
for (int i = kx; i > 0; i--) tmp[i] = add(tmp[i], tmp[i - 1]);
for (int i = 0; i <= kx; i++) g[i] = dec(g[i], tmp[i]);
tmp[0] = add(tmp[0], 1);
fill(tmp2, tmp2 + K + 1, 0);
for (int i = 0; i <= ky; i++) {
for (int j = 0; j <= kx && i + j <= K; j++) {
tmp2[i + j] = add(tmp2[i + j], mult(f[np][i], tmp[j]));
}
}
copy(tmp2, tmp2 + K + 1, f[np]);
siz[np] += siz[x];
}
f[np][0] = dec(f[np][0], 1);
for (int i = 0; i <= K && i <= siz[np]; i++) g[i] = add(g[i], f[np][i]);
}
int main() {
scanf("%d%d", &n, &K);
for (int i = 1, ti, tj; i < n; i++) {
scanf("%d%d", &ti, &tj);
v[ti].push_back(tj);
v[tj].push_back(ti);
}
fac[0] = 1;
for (int i = 1; i <= K; i++) fac[i] = mult(fac[i - 1], i);
S[0][0] = 1;
for (int i = 1; i <= K; i++) {
S[i][0] = 0;
for (int j = 1; j <= i; j++)
S[i][j] = add(S[i - 1][j - 1], mult(S[i - 1][j], j));
}
dfs(1, 0);
int ans = 0;
for (int i = 1; i <= K; i++)
ans = add(ans, mult(mult(S[K][i], fac[i]), g[i]));
printf("%d\n", ans);
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
template <typename T>
using vec = vector<T>;
using vi = vec<int>;
using vl = vec<ll>;
template <typename T>
using que = queue<T>;
template <typename T>
using deq = deque<T>;
template <typename T>
T id(T b) {
return b;
};
template <typename T>
void chmax(T &x, T y) {
if (x < y) x = y;
}
template <typename T>
void chmin(T &x, T y) {
if (x > y) x = y;
}
template <typename S, typename K>
bool contains(S &s, K k) {
return s.find(k) != s.end();
}
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
constexpr ll TEN(int n) {
if (n == 0)
return 1LL;
else
return 10LL * TEN(n - 1);
}
string state[6];
int main() {
fastio();
for (int i = 0; i < int(6); i++) {
cin >> state[i];
}
int mx = 0;
int pi = -1, pj = -1;
for (int i = 0; i < int(6); i++) {
for (int j = 0; j < int(8); j++) {
if (state[i][j] == '*' || state[i][j] == '-') continue;
int temp = (j == 3 || j == 4) ? 1 : 0;
temp += (6 - i + 1) / 2;
if (mx < temp) {
pi = i;
pj = j;
mx = temp;
}
}
}
if (pi >= 0 && pj >= 0) {
state[pi][pj] = 'P';
}
for (int i = 0; i < int(6); i++) {
cout << state[i] << "\n";
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {0, 1, -1, 0, 1, -1, -1, 1};
const int dy[] = {-1, 0, 0, 1, 1, 1, -1, -1};
const long long int MOD = 0;
const long long int N = 0;
struct e {
int id;
int u, v;
long long int w;
e() {}
e(int a, int b, long long int c, int d) {
u = a;
v = b;
w = c;
id = d;
}
bool operator<(e other) const { return w < other.w; }
};
vector<e> a;
vector<pair<int, long long int> > g[200010];
int l[200010][19];
long long int mx[200010][19];
int n, m;
int pp[200010];
int h[200010], c[200010];
long long int saida[200010];
void dfs(int u, int pai, int cost) {
h[u] = h[pai] + 1;
c[u] = c[pai] + cost;
l[u][0] = pai;
mx[u][0] = cost;
for (int i = 1; i < 19; i++) {
l[u][i] = l[l[u][i - 1]][i - 1];
mx[u][i] = max(mx[u][i - 1], mx[l[u][i - 1]][i - 1]);
}
int v, w;
for (int i = 0; i < g[u].size(); i++) {
v = g[u][i].first;
w = g[u][i].second;
if (v == pai) continue;
dfs(v, u, w);
}
}
int find(int u) {
if (u == pp[u]) return u;
return pp[u] = find(pp[u]);
}
bool same(int u, int v) { return find(u) == find(v); }
void join(int u, int v) { pp[find(u)] = find(v); }
int get(int u, int v) {
if (h[v] > h[u]) swap(u, v);
int dist = abs(h[u] - h[v]);
long long int ans = -1e9 - 10LL;
for (int i = 19 - 1; i >= 0; i--) {
if (dist & (1 << i)) {
ans = max(ans, mx[u][i]);
u = l[u][i];
}
}
if (u == v) return ans;
for (int i = 19 - 1; i >= 0; i--) {
if (l[u][i] != l[v][i]) {
ans = max(ans, mx[u][i]);
ans = max(ans, mx[v][i]);
u = l[u][i];
v = l[v][i];
}
}
return max(max(mx[u][0], mx[v][0]), ans);
}
int main() {
int u, v;
long long int w;
cin >> n >> m;
for (int i = 0; i < n; i++) {
pp[i] = i;
}
for (int i = 0; i < m; i++) {
cin >> u >> v >> w;
u--;
v--;
a.push_back(e(u, v, w, i));
}
sort(a.begin(), a.end());
long long int total = 0LL;
for (int i = 0; i < a.size(); i++) {
u = a[i].u;
v = a[i].v;
w = a[i].w;
if (!same(u, v)) {
total += w;
join(u, v);
g[u].push_back(make_pair(v, w));
g[v].push_back(make_pair(u, w));
}
}
h[0] = -1;
dfs(0, 0, 0);
long long int aux;
for (int i = 0; i < m; i++) {
aux = total;
total -= get(a[i].u, a[i].v);
total += a[i].w;
saida[a[i].id] = total;
total = aux;
}
for (int i = 0; i < m; i++) {
cout << saida[i] << "\n";
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
map<char, int> counter;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
counter.clear();
for (int i = (0); i < (int)(n); i++) {
char c;
cin >> c;
counter[c]++;
}
int alone = 0;
queue<char> loners;
deque<char> inPairs;
for (auto& kv : counter) {
if (kv.second % 2) {
loners.push(kv.first);
alone++;
}
for (int i = (0); i < (int)((kv.second / 2)); i++) {
inPairs.push_front(kv.first);
inPairs.push_back(kv.first);
}
}
int res = max(1, alone);
while (n % res || (alone && !((n / res) % 2))) {
res += 2;
loners.push(inPairs.front());
inPairs.pop_front();
loners.push(inPairs.back());
inPairs.pop_back();
}
if (res > n) res = n;
cout << res << '\n';
for (int x = (0); x < (int)(res); x++) {
if (x) cout << " ";
string current(n / res, '?');
for (int i = (0); i < (int)(current.size() / 2); i++) {
current[i] = inPairs.front();
inPairs.pop_front();
}
if (current.size() % 2) {
current[current.size() / 2] = loners.front();
loners.pop();
}
for (int i = ((current.size()) - 1);
i >= (int)(current.size() / 2 + (current.size() % 2)); i--) {
current[i] = inPairs.back();
inPairs.pop_back();
}
cout << current;
}
cout << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int i, j, n, k, tot, ans, sum, b, t, head, tail, x;
int h[100005];
bool f[1000005], g1[100005], g2[100005];
string st;
char ch;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> ch;
if (ch == '-')
g1[i] = true;
else
g1[i] = false;
}
for (int i = 1; i <= n; i++) {
cin >> ch;
if (ch == '-')
g2[i] = true;
else
g2[i] = false;
}
memset(f, false, sizeof f);
int T = 1;
int en = 1;
head = 0;
tail = 1;
h[1] = 1;
f[1] = true;
while (T <= n) {
while (head != tail) {
head++;
head %= 100000;
x = h[head];
if (x > n) {
if (x == 2 * n) {
cout << "YES" << endl;
return 0;
}
if (x + k > 2 * n) {
cout << "YES" << endl;
return 0;
}
if (!f[x + 1] && g2[x - n + 1]) {
f[x + 1] = true;
en++;
en %= 100000;
h[en] = x + 1;
}
if (!f[x - 1] && g2[x - n - 1] && (x - n - 1) > T) {
f[x - 1] = true;
en++;
en %= 100000;
h[en] = x - 1;
}
if (!f[x - n + k] && g1[x - n + k]) {
f[x - n + k] = true;
en++;
en %= 100000;
h[en] = x - n + k;
}
} else {
if (x == n) {
cout << "YES" << endl;
return 0;
}
if (x + k > n) {
cout << "YES" << endl;
return 0;
}
if (!f[x + 1] && g1[x + 1]) {
f[x + 1] = true;
en++;
en %= 100000;
h[en] = x + 1;
}
if (!f[x - 1] && g1[x - 1] && (x - 1 > T)) {
f[x - 1] = true;
en++;
en %= 100000;
h[en] = x - 1;
}
if (!f[x + n + k] && g2[x + k]) {
f[x + n + k] = true;
en++;
en %= 100000;
h[en] = x + n + k;
}
}
}
tail = en;
T++;
}
cout << "NO" << endl;
}
| 3 |
#include <bits/stdc++.h>
const int MAX = 1e5 + 10;
using namespace std;
long long ar[MAX];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, h, x, k, ans = 0;
cin >> n >> h >> k;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
}
long long tm = 0, del = 0, y;
del = 0;
for (int i = 1; i <= n; i++) {
if (del + ar[i] <= h) {
del += ar[i];
} else {
tm++;
del = ar[i];
}
tm += del / k;
del %= k;
}
tm += del / k;
del %= k;
if (del > 0) tm++;
cout << tm << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int pwr(int a, int b, int p) {
long long ans = 1, tt = a;
while (b) {
if (b & 1) ans = (ans * tt) % p;
tt = (tt * tt) % p;
b >>= 1;
}
return (int)ans;
}
const int N = 610;
const int M = 100010;
int hd[N], nxt[M], to[M], indeg[N], outdeg[N], mr;
int topo[N], cnt[N], mat[N][N];
inline void link(int a, int b) {
nxt[mr] = hd[a], to[mr] = b;
hd[a] = mr++;
++indeg[b], ++outdeg[a];
}
int main() {
memset(hd, -1, sizeof hd);
int n, m, p;
scanf("%d %d %d", &n, &m, &p);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
link(x - 1, y - 1);
}
int tin[N], que[N], l, r;
l = r = 0;
for (int i = 0; i < n; i++) {
tin[i] = indeg[i];
if (tin[i] == 0) que[r++] = i;
}
int tmr = 0;
while (r > l) {
int c = que[l++];
topo[tmr++] = c;
for (int x = hd[c]; x != -1; x = nxt[x]) {
--tin[to[x]];
if (!tin[to[x]]) que[r++] = to[x];
}
}
int k = 0;
for (int i = 0; i < n; i++)
if (indeg[i] == 0) {
memset(cnt, 0, sizeof cnt);
cnt[i] = 1;
for (int j = 0; j < n; j++) {
int jj = topo[j];
for (int x = hd[jj]; x != -1; x = nxt[x]) {
cnt[to[x]] += cnt[jj];
if (cnt[to[x]] >= p) cnt[to[x]] -= p;
}
}
int tt = 0;
for (int j = 0; j < n; j++)
if (outdeg[j] == 0) {
mat[k][tt++] = cnt[j];
}
++k;
}
int ans = 1;
for (int i = 0; i < k; i++) {
int pivot = -1;
for (int j = i; pivot == -1 && j < k; j++) {
if (mat[j][i]) pivot = j;
}
if (pivot == -1) {
ans = 0;
break;
}
if (pivot != i) {
ans = p - ans;
for (int j = i; j < k; j++) swap(mat[pivot][j], mat[i][j]);
}
ans = (long long)ans * mat[i][i] % p;
int inv = pwr(mat[i][i], p - 2, p);
for (int j = i; j < k; j++) mat[i][j] = (long long)mat[i][j] * inv % p;
for (int j = i + 1; j < k; j++)
if (mat[j][i]) {
int mul = p - mat[j][i];
for (int t = i; t < k; t++) {
int adder = (long long)mat[i][t] * mul % p;
mat[j][t] += adder;
if (mat[j][t] >= p) mat[j][t] -= p;
}
}
}
if (ans) {
for (int i = 0; i < k; i++) ans = (long long)ans * mat[i][i] % p;
}
printf("%d\n", ans);
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 18;
vector<int> vec[maxn], rec[maxn];
int n, cnt[maxn], siz[maxn];
void erase(vector<int> &vec, int val) {
vector<int> ret;
for (int i : vec)
if (i != val) ret.push_back(i);
vec = ret;
}
void dfs1(int u, int r, int d) {
cnt[d]++;
for (int i : vec[u])
if (i != r) dfs1(i, u, d + 1);
}
bool chk() {
memset(cnt, 0, sizeof cnt);
for (int i = 1; i <= (1 << n) - 1; i++) cnt[vec[i].size()]++;
if (!(cnt[1] == (1 << n - 1) && cnt[2] == 1 && !cnt[4])) return false;
memset(cnt, 0, sizeof cnt);
for (int i = 1; i <= (1 << n) - 1; i++)
if (vec[i].size() == 2) dfs1(i, 0, 0);
for (int i = 0; i <= n - 1; i++)
if (cnt[i] != (1 << i)) return false;
return true;
}
void dfs2(int u, int r) {
siz[u] = 1;
for (int i : vec[u])
if (i != r) dfs2(i, u), siz[u] += siz[i], rec[u].push_back(siz[i]);
if (r) rec[u].push_back((1 << n) - 2 - siz[u]);
}
void solve(int i, vector<int> &ans) {
int p[3];
for (int j = 0; j <= 2; j++) p[j] = vec[i][j];
for (int j = 0; j <= 2; j++)
for (int k = j + 1; k <= 2; k++) {
int u = p[j], v = p[k];
erase(vec[u], i);
erase(vec[v], i);
erase(vec[i], u);
erase(vec[i], v);
vec[(1 << n) - 1].clear();
vec[u].push_back((1 << n) - 1);
vec[(1 << n) - 1].push_back(u);
vec[v].push_back((1 << n) - 1);
vec[(1 << n) - 1].push_back(v);
vec[i].push_back((1 << n) - 1);
vec[(1 << n) - 1].push_back(i);
bool flg = chk();
vec[u].pop_back();
vec[v].pop_back();
vec[i].pop_back();
vec[u].push_back(i);
vec[i].push_back(u);
vec[v].push_back(i);
vec[i].push_back(v);
if (flg) {
ans.push_back(i);
return;
}
}
}
int main() {
cin >> n;
if (n == 2) {
cout << "2\n1 2";
return 0;
}
for (int i = 1; i <= (1 << n) - 3; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
for (int i = 1; i <= (1 << n) - 2; i++)
if (vec[i].size() > 4) {
cout << 0;
return 0;
}
for (int i = 1; i <= (1 << n) - 2; i++)
if (vec[i].size() == 4) {
int p[4];
for (int j = 0; j <= 3; j++) p[j] = vec[i][j];
for (int j = 0; j <= 3; j++)
for (int k = j + 1; k <= 3; k++) {
int u = p[j], v = p[k];
erase(vec[u], i);
erase(vec[v], i);
erase(vec[i], u);
erase(vec[i], v);
vec[(1 << n) - 1].clear();
vec[u].push_back((1 << n) - 1);
vec[(1 << n) - 1].push_back(u);
vec[v].push_back((1 << n) - 1);
vec[(1 << n) - 1].push_back(v);
vec[i].push_back((1 << n) - 1);
vec[(1 << n) - 1].push_back(i);
if (chk()) {
cout << 1 << '\n' << i;
return 0;
}
vec[u].pop_back();
vec[v].pop_back();
vec[i].pop_back();
vec[u].push_back(i);
vec[i].push_back(u);
vec[v].push_back(i);
vec[i].push_back(v);
}
cout << 0;
return 0;
}
int cnt = 0;
for (int i = 1; i <= (1 << n) - 2; i++)
if (vec[i].size() == 2) cnt++;
if (cnt > 2) {
cout << 0;
return 0;
}
if (cnt == 2) {
vector<int> ans;
for (int i = 1; i <= (1 << n) - 2; i++)
if (vec[i].size() == 2) {
vec[(1 << n) - 1].clear();
vec[(1 << n) - 1].push_back(i);
vec[i].push_back((1 << n) - 1);
if (chk()) ans.push_back(i);
vec[i].pop_back();
}
cout << ans.size() << '\n';
for (int i : ans) cout << i << ' ';
return 0;
}
if (cnt == 1) {
cout << 0;
return 0;
}
dfs2(1, 0);
vector<int> ans;
for (int i = 1; i <= (1 << n) - 2; i++)
if (vec[i].size() == 3) {
int p1 = rec[i][0], p2 = rec[i][1], p3 = rec[i][2];
if (p1 < p2) swap(p1, p2);
if (p1 < p3) swap(p1, p3);
if (p2 < p3) swap(p2, p3);
if (p1 == (1 << n - 1) - 1 && p2 == p3 && p2 == (1 << n - 2) - 1)
solve(i, ans);
}
cout << ans.size() << '\n';
for (int i : ans) cout << i << ' ';
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000001;
const int MOD = 1e9 + 7;
void out(int n, int k) {
for (int i = 0; i < n / k; ++i) cout << k << ' ';
}
signed main() {
clock_t TIME = clock();
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n, m;
while (cin >> n >> m) {
vector<long long> a(n), c(n);
long long sum = 0, pref = 0;
for (auto &i : a) cin >> i, sum += i;
for (auto &i : c) cin >> i;
vector<pair<long long, long long> > b(m);
for (auto &i : b) cin >> i.first >> i.second;
vector<long long> ans(m);
priority_queue<pair<long long, long long> > p;
for (long long z = 0; z < n; ++z) p.push({-c[z], z});
for (long long z = 0; z < m; ++z) {
pref += b[z].second;
if (pref > sum) {
ans[z] = 0;
continue;
}
long long now = b[z].second;
b[z].first--;
pair<long long, long long> head;
if (a[b[z].first] < now)
now -= a[b[z].first], ans[z] += a[b[z].first] * c[b[z].first],
a[b[z].first] = 0;
else
ans[z] += now * c[b[z].first], a[b[z].first] -= now, now = 0;
while (now) {
head = p.top();
p.pop();
if (a[head.second] > now) {
ans[z] += c[head.second] * now, a[head.second] -= now;
p.push({head.first, head.second});
break;
}
ans[z] += c[head.second] * a[head.second], now -= a[head.second],
a[head.second] = 0;
}
}
for (auto &i : ans) cout << i << '\n';
cout << '\n';
}
cerr << "\nTIME EXEUTED: " << (clock() - TIME) / double(CLOCKS_PER_SEC);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, t;
while (cin >> n >> a >> b >> c >> t) {
int x;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (x > t) continue;
ans += a;
if (c > b) {
ans += (c - b) * (t - x);
}
}
cout << ans << endl;
}
}
| 2 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const bool dbg_flg = 0;
const int inf = 1e9 + 7;
const int MAXN = 1e5 + 5;
int n;
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
}
cout << (n - 4) / 2;
}
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
int tt = 1;
while (tt--) {
solve();
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
string impossible;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const int N = 1e6 + 5;
long long MOD = 1e9 + 7;
long long n, m, k, i, j;
bool f0, f1, f2;
const int MAXN = 2e3;
long long d[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(11);
int tests = 1;
cin >> tests;
for (int te = 1; te <= tests; te++) {
long long n, k, l;
cin >> n >> k >> l;
for (int i = 1; i <= n; i++) cin >> d[i];
d[0] = -k;
d[n + 1] = -k;
set<tuple<int, int, bool>> s;
function<bool(int, int, bool)> go = [&](int pos, int t, bool rise) {
if (pos > n) return true;
if (s.find({pos, t, rise}) != s.end()) return false;
s.insert({pos, t, rise});
t += rise ? 1 : -1;
if (t == 0) rise = true;
if (t == k) rise = false;
if (d[pos] + t <= l && go(pos, t, rise)) return true;
if (d[pos + 1] + t <= l && go(pos + 1, t, rise)) return true;
return false;
};
if (go(0, 0, true))
cout << "Yes\n";
else
cout << "No\n";
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T countbit(T n) {
return n ? 1 + countbit(n & (n - 1)) : 0;
}
template <class T>
inline T sqr(T a) {
return a * a;
}
template <class T>
inline void checkmin(T &a, T b) {
if (a == -1 || a > b) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
if (a < b) a = b;
}
const double eps = 1e-11;
const double Pi = acos(-1.0);
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
const int M = 205;
struct node {
int id, num;
} e[M];
bool cmp(node a, node b) { return a.num < b.num; }
int n, b[M], c[M], t1, t2, c1, c2, p1, p2;
int main() {
cin >> n;
for (int i = (1); i <= (2 * n); i++) {
cin >> e[i].num;
e[i].id = i;
c[e[i].num]++;
}
sort(e + 1, e + 2 * n + 1, cmp);
int f = 1;
for (int i = (1); i <= (2 * n); i++) {
if (c[e[i].num] == 1) continue;
b[e[i].id] = f;
if (f == 1) {
t1++;
if (e[i].num != p1) {
c1++;
p1 = e[i].num;
}
} else {
t2++;
if (e[i].num != p2) {
c2++;
p2 = e[i].num;
}
}
f = 3 - f;
}
for (int i = (1); i <= (2 * n); i++) {
if (c[e[i].num] == 1) {
if (t1 < n) {
t1++;
c1++;
b[e[i].id] = 1;
} else {
b[e[i].id] = 2;
c2++;
}
}
}
cout << c1 * c2 << endl;
for (int i = (1); i <= (2 * n); i++) cout << b[i] << ' ';
cout << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const int N = 201000;
using namespace std;
int n, x[N];
int main() {
while (scanf("%d", &n) == 1) {
for (int i = 0; i < (n); i++) scanf("%d", &x[i]);
sort(x, x + n);
int ans = INF;
for (int i = 0; i < (n / 2); i++)
ans = ((ans) < (x[i + n / 2] - x[i]) ? (ans) : (x[i + n / 2] - x[i]));
printf("%d\n", ans);
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
void read_file(bool outToFile = true) {}
const int MAXN = 100000 + 99;
int n;
int A[MAXN];
vector<int> pos[MAXN];
int st[MAXN * 10];
void update(int idx, int s = 0, int e = n - 1, int p = 1) {
st[p]++;
if (s == e) {
return;
}
int m = s + e >> 1;
if (idx <= m)
update(idx, s, m, 2 * p);
else
update(idx, m + 1, e, 2 * p + 1);
}
int query(int first, int to, int s = 0, int e = n - 1, int p = 1) {
if (first <= s && e <= to) return st[p];
if (s > to || first > e) return 0;
int m = s + e >> 1;
return query(first, to, s, m, 2 * p) + query(first, to, m + 1, e, 2 * p + 1);
}
int main() {
read_file();
while (scanf("%d", &n) != -1) {
memset(st, 0, sizeof st);
for (int i = 0; i < MAXN; i++) pos[i].clear();
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
pos[A[i]].push_back(i);
}
long long ans = 0;
int cur = 0;
for (int i = 1; i < MAXN; i++) {
if (pos[i].empty()) continue;
int pos1 = -1, pos2 = -1;
for (int j = 0; j < pos[i].size(); j++) {
int npos = pos[i][j];
if (cur <= npos)
pos2 = max(npos, pos2);
else
pos1 = max(pos1, npos);
}
if (pos1 == -1) pos1 = pos2;
assert(pos1 != -1);
long long cost = 0;
if (cur <= pos1) {
cost += pos1 - cur + 1;
cost -= query(cur, pos1);
} else {
cost += n - cur + pos1 + 1;
cost -= query(cur, n - 1) + query(0, pos1);
}
ans += cost;
cur = pos1;
for (int j = 0; j < pos[i].size(); j++) {
int npos = pos[i][j];
update(npos);
}
}
printf("%lld\n", ans);
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
int n, m, x, y, l, r, k, mx, mn;
pair<int, int> a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < (int)(n); ++i) cin >> a[i].first, a[i].second = -1;
cin >> m;
for (int i = 0; i < (int)(m); ++i) cin >> a[i + n].first, a[i + n].second = 1;
sort(a, a + n + m);
x = n * 3, y = m * 3;
mx = x, mn = y;
for (int i = 0; i < (int)(n + m); ++i) {
if (a[i].second == 1)
y--;
else
x--;
if (x - y > mx - mn) {
mx = x;
mn = y;
}
}
printf("%d:%d", mx, mn);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int p;
cin >> p;
while (p--) {
int n;
string s;
cin >> n;
cin >> s;
int bal = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
bal++;
else {
bal--;
if (bal < 0) {
bal = 0;
ans++;
}
}
}
cout << ans << "\n";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10, mod = 1e9 + 7, inf = 3e16;
pair<long long, long long> a[N], vs;
long long n = 1, ax, ay, bx, by, t;
long long dis(pair<long long, long long> p1, pair<long long, long long> p2) {
return abs(p1.first - p2.first) + abs(p1.second - p2.second);
}
long long best(pair<long long, long long> p0, pair<long long, long long> p1,
pair<long long, long long> p2) {
return min(dis(p0, p1), dis(p1, p2)) + dis(p0, p1) + dis(p1, p2);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> a[1].first >> a[1].second >> ax >> ay >> bx >> by >> vs.first >>
vs.second >> t;
while (a[n].first <= inf && a[n].second <= inf) {
n++;
a[n].first = a[n - 1].first * ax + bx;
a[n].second = a[n - 1].second * ay + by;
}
int res = 0;
for (int i = 1; i <= n; i++)
for (int l = 1; l <= i; l++)
for (int r = i; r <= n; r++)
if (dis(vs, a[i]) + best(a[l], a[i], a[r]) <= t)
res = max(res, r - l + 1);
cout << res;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
vector<int> a;
vector<pair<int, int> > b, c;
cin >> n;
a.resize(n);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n * n; i++)
for (int j = 0; j < n - 1; j++)
if (a[j] > a[j + 1]) {
swap(a[j], a[j + 1]);
b.push_back(make_pair(j, j + 1));
}
for (int i = 0; i < b.size(); i++)
cout << b[i].first + 1 << ' ' << b[i].second + 1 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
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...);
}
string gh = "here";
int main() {
long long n, k;
cin >> n >> k;
long long l = 1, r = k + 1;
long long ans = 1000000000000000007;
if (n == 1) {
cout << 0 << '\n';
return 0;
}
while (r - l > 1) {
long long mid = (l + r) / 2;
;
long long aa = (k * (k + 1)) / 2 - ((mid - 1) * (mid)) / 2 - k + mid;
;
if (n == aa)
ans = min(ans, k - mid + 1);
else if (n - aa + 1 < mid && n - aa + 1 >= 2) {
ans = min(ans, k - mid + 2);
}
if (aa > n) {
l = mid;
} else {
r = mid;
}
}
if (ans == 1000000000000000007) {
cout << -1 << '\n';
} else {
cout << ans << '\n';
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, s, a[200100], cnt[200100], ans, kol;
set<int> st;
int main() {
cin >> n >> s;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
if (i == s) {
if (a[i] != 0) {
a[i] = 0;
ans++;
}
st.insert(a[i]);
continue;
}
if (a[i] == 0) {
a[i] = n;
kol++;
}
cnt[a[i]]++;
st.insert(a[i]);
}
for (int i = 1; i <= n; ++i) {
if (i > *st.rbegin()) break;
if (cnt[i] == 0) {
int pp = *st.rbegin();
if (cnt[pp] == 1) {
st.erase(pp);
}
ans++;
st.insert(i);
cnt[pp]--;
}
}
cout << max(ans, kol);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100010], w[100010];
long long c[100010], tol;
long double ans;
void add(int x, int y) {
while (x <= n) c[x] += y, x += x & (-x);
}
long long sum(int x) {
long long t = 0;
while (x) t += c[x], x -= x & (-x);
;
return t;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
w[a[i]] = i;
}
for (int i = 2; i <= n; i++) tol += 1ll * i * (i - 1) * (n - i + 1) >> 1;
for (int i = n; i; i--) {
tol -= 1ll * (n - w[i] + 1) * sum(w[i]) << 1;
add(w[i], w[i]);
}
ans = (long double)tol / ((long double)n * (n + 1));
for (int i = 1; i <= n; i++) c[i] = 0;
for (int i = n; i; i--) ans += sum(w[i]), add(w[i], 1);
printf("%.20Lf", ans);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, Y0, Y1;
cin >> N >> M >> Y0 >> Y1;
vector<int> mice(N);
vector<int> cheeses(M);
for (int i = 0; i < N; ++i) cin >> mice[i];
for (int i = 0; i < M; ++i) cin >> cheeses[i];
int ans = 0;
vector<int> v(M, INT_MAX);
for (int i = 0; i < N; ++i) {
int p2 =
lower_bound(cheeses.begin(), cheeses.end(), mice[i]) - cheeses.begin();
int p1 = p2 - 1;
int d1 = INT_MAX, d2 = INT_MAX;
if (p2 < M) d2 = abs(mice[i] - cheeses[p2]);
if (p1 >= 0) d1 = abs(mice[i] - cheeses[p1]);
if (p2 == 0) {
if (v[p2] == INT_MAX) ++ans;
if (d2 < v[p2]) v[p2] = d2;
} else if (p2 == M) {
if (v[p1] == INT_MAX) ++ans;
if (d1 < v[p1])
v[p1] = d1;
else if (d1 == v[p1])
++ans;
} else {
if (d1 < d2) {
if (v[p1] == INT_MAX) ++ans;
if (d1 < v[p1])
v[p1] = d1;
else if (v[p1] == d1)
++ans;
} else if (d1 > d2) {
if (v[p2] == INT_MAX) ++ans;
if (d2 < v[p2]) v[p2] = d2;
} else {
if (v[p1] == d1 || v[p1] == INT_MAX) {
++ans;
v[p1] = d1;
} else {
v[p2] = d2;
++ans;
}
}
}
}
cout << N - ans << endl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
istream& operator>>(istream& input, vector<T>& s) {
for (T& a : s) {
input >> a;
}
return input;
}
template <typename T>
ostream& operator<<(ostream& output, vector<T>& s) {
for (T& a : s) {
output << a << ' ';
}
output << endl;
return output;
}
template <typename T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
template <typename T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template <typename T>
T gcd(T a, T b) {
return !b ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <typename T>
bool isPrime(T a) {
if (a == 1)
return false;
else if (a == 2)
return true;
else if (!(a % 2))
return false;
else {
for (unsigned long long i = 3; i * i <= a; i += 2) {
if (!(a % i)) return false;
}
}
return true;
}
int vsum(vector<int> vec) {
int sum = 0;
for (auto t : vec) sum += t;
return sum;
}
void solve() {
int a, b;
cin >> a >> b;
for (long long i = 0; i < (b); ++i) {
cout << a / b + (a % b > i) << " ";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int t = 1;
while (t--) {
solve();
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long N, rs, Y = -2e9;
struct my {
long long x, y;
} A[200100];
bool comp(my a, my b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 0, x, k; i < N; i++) {
cin >> x >> k;
A[i].x = x - k;
A[i].y = x + k;
}
sort(A, A + N, comp);
for (int i = 0, x, k; i < N; i++) {
if (A[i].x >= Y) {
rs++;
Y = A[i].y;
} else if (A[i].y < Y)
Y = A[i].y;
}
cout << rs;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const long long maxn = 112345;
long long n;
vector<pair<long long, long long> > adj[maxn];
long long cCont[1000005];
long long cTime[1000005];
long long tree[4000200][2];
long long val[100005];
pair<long long, long long> query(long long ind, long long l, long long r,
long long ql, long long qr) {
if (ql > qr) return make_pair(0, 0);
if (ql == l && qr == r) {
return make_pair(tree[ind][0], tree[ind][1]);
}
long long mid = (l + r) / 2;
pair<long long, long long> a = query(ind * 2 + 1, l, mid, ql, min(qr, mid));
pair<long long, long long> b =
query(ind * 2 + 2, mid + 1, r, max(ql, mid + 1), qr);
return make_pair(a.first + b.first, a.second + b.second);
}
void update(long long ind, long long l, long long r, long long pos,
long long added_cookie) {
if (l == r) {
tree[ind][0] += added_cookie * l;
tree[ind][1] += added_cookie;
} else {
long long mid = (l + r) / 2;
if (pos <= mid)
update(ind * 2 + 1, l, mid, pos, added_cookie);
else
update(ind * 2 + 2, mid + 1, r, pos, added_cookie);
tree[ind][0] = tree[ind * 2 + 1][0] + tree[ind * 2 + 2][0];
tree[ind][1] = tree[ind * 2 + 1][1] + tree[ind * 2 + 2][1];
}
}
long long check(long long x, long long t) {
pair<long long, long long> val = query(0, 0, 1000001, 0, x);
pair<long long, long long> val2 = query(0, 0, 1000001, x, x);
if (val.first <= t)
return val.second;
else if (val.first - val2.first <= t) {
long long z = val.second - val2.second;
long long tleft = t - (val.first - val2.first);
long long y = tleft / x;
return z + y;
}
return -1;
}
long long dfs(long long s, long long t) {
if (t < 0) return 0;
long long val;
;
update(0, 0, 1000001, cTime[s], cCont[s]);
long long l = 0, r = 1000001, mid;
while (l < r) {
long long mid = (l + r + 1) / 2;
if (check(mid, t) != -1) {
l = mid;
} else {
r = mid - 1;
}
}
val = check(l, t);
long long high = -200000000000000ll;
long long secHigh = -200000000000000ll;
for (auto child : adj[s]) {
long long to = child.first;
long long w = child.second;
long long x = dfs(to, t - 2 * w);
if (x > high) {
secHigh = high;
high = x;
} else if (x > secHigh) {
secHigh = x;
}
};
update(0, 0, 1000001, cTime[s], -1 * cCont[s]);
if (s == 0) return max(high, val);
return max(secHigh, val);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
long long n, t, x, y;
cin >> n >> t;
for (long long i = 0, _n = (n); i < _n; i++) {
cin >> cCont[i];
}
for (long long i = 0, _n = (n); i < _n; i++) {
cin >> cTime[i];
}
for (long long i = 0, _n = (n - 1); i < _n; i++) {
cin >> x >> y;
x--;
adj[x].push_back(make_pair(i + 1, y));
}
cout << dfs(0, t);
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, tot, u, v, ans;
int e[N];
int head[N], ver[N], last[N], deg[N];
queue<int> qa, qm;
void add(int x, int y) {
ver[++tot] = y;
last[tot] = head[x];
head[x] = tot;
}
void topo() {
for (int i = 1; i <= n; i++) {
if (!deg[i]) {
if (e[i])
qa.push(i);
else
qm.push(i);
}
}
while (qa.size() || qm.size()) {
while (qm.size()) {
int x = qm.front();
qm.pop();
for (int i = head[x]; i; i = last[i]) {
int y = ver[i];
deg[y]--;
if (!deg[y]) {
if (e[y])
qa.push(y);
else
qm.push(y);
}
}
}
if (qa.size()) ans++;
while (qa.size()) {
int x = qa.front();
qa.pop();
for (int i = head[x]; i; i = last[i]) {
int y = ver[i];
deg[y]--;
if (!deg[y]) {
if (e[y])
qa.push(y);
else
qm.push(y);
}
}
}
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> e[i];
for (int i = 1; i <= m; i++) {
cin >> u >> v;
u++;
v++;
add(v, u);
deg[u]++;
}
topo();
cout << ans;
return 0;
}
| 5 |
#include<bits/stdc++.h>
using namespace std;
int n,m,v[20];
int main()
{
scanf("%d%d",&n,&m);
while(n)
{
if(v[n%m])
{
puts("NO");
return 0;
}
v[n%m]=1;
n/=m;
}
puts("YES");
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') f = -1, ch = getchar();
while (isdigit(ch)) x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
return x * f;
}
void write(int x) {
int f = 0;
char ch[20];
if (x == 0) {
putchar('0');
putchar('\n');
return;
}
if (x < 0) {
putchar('-'), x = -x;
}
while (x) ch[++f] = x % 10 + '0', x /= 10;
while (f) putchar(ch[f--]);
putchar('\n');
}
int n, m, no, fir[2000007], nxt[2000007], v[2000007], cnte, dfn[2000007],
low[2000007], ans[2000007], ins[2000007], stk[2000007], tp, tim,
col[2000007], num;
void ade(int u1, int v1) {
v[cnte] = v1, nxt[cnte] = fir[u1], fir[u1] = cnte++;
}
void tar(int u) {
dfn[u] = low[u] = ++tim, ins[u] = 1, stk[++tp] = u;
for (int k = fir[u]; ~k; k = nxt[k]) {
if (!dfn[v[k]])
tar(v[k]), low[u] = min(low[u], low[v[k]]);
else if (ins[v[k]])
low[u] = min(low[u], dfn[v[k]]);
}
if (dfn[u] == low[u]) {
num++;
int cnt = 0;
while (1) {
cnt++;
col[stk[tp]] = num, ins[stk[tp]] = 0;
if (stk[tp--] == u) break;
}
if (cnt == n) no = 1;
}
}
int gx(int x, int f) { return x + f * n; }
int main() {
int t = read();
while (t--) {
n = read(), m = read(), no = 0;
int li = n << 1;
for (int i = (1); i <= (li); ++i) dfn[i] = 0, fir[i] = -1;
cnte = tim = num = 0;
for (int i = (1); i <= (m); ++i) {
int x = read(), y = read();
if (x == y) continue;
ade(gx(x, 0), gx(y, 0)), ade(gx(y, 1), gx(x, 1));
}
int c[2], co = 1;
c[0] = c[1] = 0;
for (int i = (1); i <= (li); ++i)
if (!dfn[i]) tar(i);
if (no) {
puts("No");
continue;
}
for (int i = (1); i <= (n); ++i)
if (col[i] == 1) co = 0;
for (int i = (1); i <= (n); ++i) {
if (col[gx(i, 0)] == col[gx(i, 1)]) {
puts("No");
no = 1;
break;
}
if (col[gx(i, co)] == 1)
ans[i] = co, c[co]++;
else
ans[i] = co ^ 1, c[co ^ 1]++;
}
if (no) continue;
puts("Yes");
printf("%d %d\n", c[0], c[1]);
for (int i = (1); i <= (n); ++i)
if (!ans[i]) printf("%d ", i);
puts("");
for (int i = (1); i <= (n); ++i)
if (ans[i]) printf("%d ", i);
puts("");
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
void vin(vector<int>& v) {
int i, p;
int n = (int)v.size();
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
}
void vin(vector<long long>& v) {
long long i, p;
int n = v.size();
for (i = 0; i < n; i++) {
scanf("%lld", &v[i]);
}
}
void vout(const vector<int>& v) {
for (auto q : v) printf("%d ", q);
printf("\n");
}
void vout(const vector<long long>& v) {
for (auto q : v) printf("%lld ", q);
printf("\n");
}
struct typ {
int tp = -1;
long long a = 0, b = 0;
};
struct comp {
bool operator()(typ const& a, typ const& b) { return a.a < b.a; }
};
int main(int argc, char const* argv[]) {
int t = 1;
cin >> t;
int co = 0;
while (t--) {
int n;
cin >> n;
string second;
cin >> second;
vector<string> v;
int i = 0, j = 0, k = 0;
vector<int> out(n);
char cur = second[0];
out[0] = 0;
v.push_back(second[0] == '0' ? "0" : "1");
set<int> Z, O;
second[0] == '0' ? Z.insert(0) : O.insert(0);
for (i = 1; i < n; i++) {
cur = second[i];
if (cur == '0') {
if (O.empty()) {
v.push_back("0");
out[i] = (int)v.size() - 1;
Z.insert((int)v.size() - 1);
} else {
int t = *O.begin();
O.erase(O.begin());
v[t] += cur;
out[i] = t;
Z.insert(t);
}
} else {
if (Z.empty()) {
v.push_back("1");
out[i] = (int)v.size() - 1;
O.insert((int)v.size() - 1);
} else {
int t = *Z.begin();
Z.erase(Z.begin());
v[t] += cur;
O.insert(t);
out[i] = t;
}
}
}
int l = (int)v.size();
printf("%d\n", l);
for (i = 0; i < n; i++) {
printf("%d ", out[i] + 1);
}
printf("\n");
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, e, f = 0, g, h[100];
cin >> h[0] >> h[1] >> h[2] >> d;
sort(h, h + 3);
for (int i = 0; i < 2; i++) {
if (h[i + 1] - h[i] < d) {
f += d - (h[i + 1] - h[i]);
}
}
cout << f;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int A[a], i;
for (i = 0; i < a; ++i) {
A[i] = b;
}
int x1, y1, z;
for (i = 0; i < c; ++i) {
cin >> x1 >> y1 >> z;
for (int j = x1 - 1; j < y1; ++j) {
A[j] = min(A[j], z);
}
}
int tot = 0;
for (auto x : A) {
tot += x * x;
}
cout << tot << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int _ = 0; _ < (int)(t); _++) {
int n;
int a[100];
cin >> n;
for (int i = 0; i < (int)(n); i++) cin >> a[i];
int ma = *max_element(a, a + n);
int sum = accumulate(a, a + n, 0);
if (sum < ma * 2) {
cout << "T" << endl;
} else if (sum % 2) {
cout << "T" << endl;
} else {
cout << "HL" << endl;
}
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
int main() {
int chores, acc, x, times = 0, curr;
scanf("%d %d %d\n", &chores, &acc, &x);
for (int i = 0; i < chores - acc; i++) {
scanf("%d", &curr);
times += curr;
}
times += acc * x;
printf("%d", times);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-11;
vector<vector<int> > g, gr;
vector<int> num, inComponent;
bitset<(int)1e5 + 5> us;
void dfs(int v, vector<int>& order) {
us[v] = true;
for (int i = 0; i < (int)g[v].size(); i++)
if (!us[g[v][i]]) dfs(g[v][i], order);
order.push_back(v);
}
vector<int> topsort() {
us.reset();
vector<int> res;
for (int i = 0; i < (int)g.size(); i++)
if (!us[i]) dfs(i, res);
reverse(res.begin(), res.end());
return res;
}
void dfs2(int v, int k) {
us[v] = true;
num[v] = k;
for (int i = 0; i < (int)gr[v].size(); i++)
if (!us[gr[v][i]]) dfs2(gr[v][i], k);
}
int dfs3(int v) {
us[v] = true;
int res = inComponent[num[v]] == 1;
for (int i = 0; i < (int)g[v].size(); i++)
if (!us[g[v][i]]) res &= dfs3(g[v][i]);
for (int i = 0; i < (int)gr[v].size(); i++)
if (!us[gr[v][i]]) res &= dfs3(gr[v][i]);
return res;
}
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
g.resize(n);
gr.resize(n);
for (int i = 0; i < (int)m; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
gr[b].push_back(a);
}
vector<int> order = topsort();
us.reset();
num.resize(n);
int k = 0;
for (int i = 0; i < n; i++)
if (!us[order[i]]) dfs2(order[i], k++);
inComponent.resize(k);
for (int i = 0; i < (int)n; i++) inComponent[num[i]]++;
us.reset();
int ans = n;
for (int i = 0; i < (int)n; i++)
if (!us[i]) ans -= dfs3(i);
cout << ans << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
int main() {
int t;
scanf("%d", &t);
int i = 0;
while (i < t) {
int n, k;
scanf("%d %d", &n, &k);
double *x;
x = static_cast<double *>(malloc((k + 2) * sizeof(double)));
for (int j = 1; j <= k; j++) {
scanf("%lf", &x[j]);
}
double max_interval = 0;
x[0] = -(x[1] - 1);
x[k + 1] = 2 * (n + 1) - x[k] - 1;
for (int j = 1; j <= k + 1; ++j) {
double temp_interval = ceil((x[j] - x[j - 1] + 1) / 2.0);
if (temp_interval > max_interval) {
max_interval = temp_interval;
}
}
free(x);
printf("%d\n", (int)max_interval);
i++;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long n, sum, first, b, k, ar[100000 + 5];
pair<long long, long long> p[100000 + 5];
int main() {
long long i;
scanf("%I64d %I64d", &n, &k);
scanf("%I64d", &b);
for (i = 0; i < n; i++) {
scanf("%I64d", &ar[i]);
p[i] = make_pair(ar[i], i);
}
sort(p, p + n - 1);
reverse(p, p + n - 1);
first = 2123123123;
for (i = 0; i < k; i++) {
sum += p[i].first;
first = min(first, p[i].second);
}
if (sum <= b) {
printf("%I64d\n", n);
return 0;
}
for (i = 0; i < first; i++) {
if (sum - p[k - 1].first + ar[i] > b) {
printf("%I64d\n", i + 1);
return 0;
}
}
printf("%I64d\n", first + 1);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> v(m);
for (int i = 0; i < m; i++) cin >> v[i];
set<pair<int, int>> ma;
vector<int> mav(n + 1, 0);
for (int i = 1; i <= n; i++) ma.insert(make_pair(0, i));
set<pair<int, int>>::iterator itr;
int r = 0;
for (int i = 0; i < m; i++) {
itr = ma.find(make_pair(mav[v[i]], v[i]));
ma.erase(itr);
mav[v[i]]++;
ma.insert(make_pair(mav[v[i]], v[i]));
itr = (ma.begin());
if ((*itr).first >= r + 1) {
cout << '1';
r++;
} else
cout << '0';
}
cout << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
long long max(long long a, long long b) { return a > b ? a : b; }
int oo[1 + (100000 - 1) * 2], oj[1 + (100000 - 1) * 2];
int link(int o, int j) {
static int _ = 1;
oo[_] = o, oj[_] = j;
return _++;
}
int ae[100000], aa[100000];
long long hh[100000], dp[100000], dq[100000];
void dfs1(int p, int i) {
int o;
long long h1, h2;
h1 = h2 = 0;
for (o = ae[i]; o; o = oo[o]) {
int j = oj[o];
if (j != p) {
dfs1(i, j);
if (h1 < hh[j])
h2 = h1, h1 = hh[j];
else if (h2 < hh[j])
h2 = hh[j];
dp[i] = max(dp[i], dp[j]);
}
}
hh[i] = h1 + aa[i];
dp[i] = max(dp[i], h1 + h2 + aa[i]);
}
void dfs2(int p, int i, long long h, long long q) {
int o, jh1, jh2, jdp1;
long long h1, h2, h3, dp1, dp2;
dq[i] = q;
h1 = h2 = h3 = 0, jh1 = jh2 = -1;
dp1 = dp2 = 0, jdp1 = -1;
for (o = ae[i]; o; o = oo[o]) {
int j = oj[o];
if (j != p) {
if (h1 < hh[j]) {
h3 = h2, h2 = h1, h1 = hh[j];
jh2 = jh1, jh1 = j;
} else if (h2 < hh[j]) {
h3 = h2, h2 = hh[j];
jh2 = j;
} else if (h3 < hh[j])
h3 = hh[j];
if (dp1 < dp[j]) {
dp2 = dp1, dp1 = dp[j];
jdp1 = j;
} else if (dp2 < dp[j])
dp2 = dp[j];
}
}
for (o = ae[i]; o; o = oo[o]) {
int j = oj[o];
if (j != p) {
long long h1_ = j == jh1 ? h2 : h1;
long long h2_ = j == jh1 || j == jh2 ? h3 : h2;
long long q_ = j == jdp1 ? dp2 : dp1;
dfs2(i, j, max(h, h1_) + aa[i],
max(max(q, q_), h1_ + max(h, h2_) + aa[i]));
}
}
}
int main() {
int n, h, i, j;
long long ans;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &aa[i]);
for (h = 0; h < n - 1; h++) {
scanf("%d%d", &i, &j), i--, j--;
ae[i] = link(ae[i], j);
ae[j] = link(ae[j], i);
}
dfs1(-1, 0);
dfs2(-1, 0, 0, 0);
ans = 0;
for (i = 0; i < n; i++) ans = max(ans, dp[i] + dq[i]);
printf("%lld\n", ans);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<pii>;
int n, s[1000000], t[1000000];
vi a;
int solve() {
int c01 = 0, c10 = 0;
for (int i = 0; i < n; ++i) {
if (!s[i] && t[i]) c01++, a.push_back(0);
if (s[i] && !t[i]) c10++, a.push_back(1);
}
if (c01 != c10) return -1;
int c0 = 0, c1 = 0;
for (auto it : a)
if (it == 0) {
if (c1) c1--;
c0++;
} else {
if (c0) c0--;
c1++;
}
return c0 + c1;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%1d", s + i);
for (int i = 0; i < n; ++i) scanf("%1d", t + i);
int ans = solve();
printf("%d", ans);
}
| 6 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
using namespace std;
int a, b, c, d, e, f, p = 1000000007, base = 157, mi = 1e9, id = 0, q, pos;
int ind[300000], ans[300000], si[300000], si2[300000];
pair<int, int> reb_price[300000];
string s, s2;
vector<int> vec[300000];
vector<pair<int, int>> rebra[300000];
void dfs(int v, int pred) {
int ma = 0, ma2 = 0;
si[v] = 1;
for (auto i : rebra[v]) {
if (i.first == pred) {
continue;
}
dfs(i.first, v);
b += (si[i.first] + i.second - 1) / id;
si[i.first] = (si[i.first] + i.second - 1) % id;
if (si[i.first] > ma) {
ma2 = ma;
ma = si[i.first];
} else if (si[i.first] > ma2) {
ma2 = si[i.first];
}
}
si[v] = ma + 1;
if (si[v] + ma2 >= id) {
si[v] = 0;
b++;
}
}
pair<int, int> dfs2(int v, int pred, int pred2) {
if (rebra[v].size() == 1 && v != 1) {
rebra[v][0] = {pred2, 0};
return {v, 1};
}
if (rebra[v].size() == 2 && v != 1) {
if (rebra[v][0].first == pred) {
auto pa = dfs2(rebra[v][1].first, v, pred2);
return {pa.first, pa.second + 1};
} else {
auto pa = dfs2(rebra[v][0].first, v, pred2);
return {pa.first, pa.second + 1};
}
}
int j = 0;
for (auto i : rebra[v]) {
if (i.first == pred) {
rebra[v][j] = {pred2, 0};
j++;
continue;
}
rebra[v][j] = dfs2(i.first, v, v);
j++;
}
return {v, 1};
}
signed main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
cin >> a;
for (int i = 0; i < a - 1; i++) {
cin >> b >> c;
rebra[b].push_back({c, 1});
rebra[c].push_back({b, 1});
}
dfs2(1, -1, -1);
for (int i = 0; i < a; i = i) {
if (i == 0 || i < 1000) {
b = 0;
id = i + 1;
dfs(1, -1);
cout << b << '\n';
;
i++;
} else {
b = 0;
id = i + 1;
dfs(1, -1);
c = b;
int l = i + 1, r = a / max(b, 1) + 1;
b = 0;
while (r - l > 1) {
int res = (r + l) / 2;
b = 0;
id = res;
dfs(1, -1);
if (b == c) {
l = res;
} else {
r = res;
}
}
for (int j = i; j < l; j++) {
cout << c << '\n';
;
}
i = l;
}
}
cin >> a;
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m, x, y, marker[N][N], cap[N][N];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> x >> y;
x--;
y--;
marker[y][x]++;
}
for (int i = 0; i < m; i++) {
cin >> x >> y;
x--;
y--;
cap[y][x]++;
}
int beautiful = 0, total = 0;
for (int i = 0; i < 1000; i++) {
int surplus_cap = 0, surplus_marker = 0;
for (int j = 0; j < 1000; j++) {
int v = min(cap[i][j], marker[i][j]);
beautiful += v;
total += v;
surplus_cap += cap[i][j] - v;
surplus_marker += marker[i][j] - v;
}
total += min(surplus_cap, surplus_marker);
}
cout << total << " " << beautiful << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> arr, barr, vec;
long long pos[100100];
multiset<pair<long long, long long> > st1, st2;
long long diff[100100];
int main() {
long long t, n, i, j, k, m;
ios_base::sync_with_stdio(0);
cin.tie(0);
t = 1;
for (long long T = 1; T <= t; T++) {
cin >> n;
for (i = 1; i <= n; i++) cin >> j, arr.push_back(j), pos[j] = i;
barr.push_back(0);
for (i = 1; i <= n; i++) cin >> j, barr.push_back(j);
for (i = 1; i <= n; i++) {
long long x = pos[barr[i]];
long long y = i;
if (x <= y)
st1.insert(pair<long long, long long>(y - x, i)), diff[i] = y - x;
else
st2.insert(pair<long long, long long>(x - y, i)), diff[i] = x - y;
}
long long x1 = 1e9, x2 = 1e9;
if (!st1.empty()) x1 = (*(st1.begin())).first;
if (!st2.empty()) x2 = (*(st2.begin())).first;
cout << min(x1, x2) << '\n';
for (i = 1; i < n; i++) {
long long j = i;
while (!st2.empty()) {
pair<long long, long long> op = *(st2.begin());
if (op.first > j) break;
long long tmp = 0;
if (op.first < j) tmp = 1;
st1.insert(pair<long long, long long>(tmp - i, op.second));
diff[op.second] = tmp - i;
st2.erase(st2.begin());
}
long long P = diff[n - i + 1];
st1.erase(st1.find(pair<long long, long long>(P, n - i + 1)));
diff[n - i + 1] = pos[barr[n - i + 1]] - 1;
st2.insert(pair<long long, long long>(diff[n - i + 1] + i, n - i + 1));
long long x1 = 1e9, x2 = 1e9;
if (!st1.empty()) x1 = (*(st1.begin())).first;
if (!st2.empty()) x2 = (*(st2.begin())).first;
vec.push_back(min(x1 + i, x2 - i));
}
reverse(vec.begin(), vec.end());
for (long long x : vec) cout << x << '\n';
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
long long pwr(long long base, long long p, long long mod = (1000000007LL)) {
long long ans = 1;
while (p) {
if (p & 1) ans = (ans * base) % mod;
base = (base * base) % mod;
p /= 2;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
double a, b;
cin >> a >> b;
int n;
cin >> n;
double ans = 1e16;
while (n--) {
double aa, bb, v;
cin >> aa >> bb >> v;
ans = min(ans, sqrt((a - aa) * (a - aa) + (b - bb) * (b - bb)) / v);
}
cout << fixed << setprecision(7) << ans;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int fw(string &s, char ch) {
int ret = 0;
for (auto it : s) {
if (it == ch)
ret++;
else {
if (ret == 0) return -1;
ret--;
}
}
return ret;
}
int bw(string s) {
reverse(s.begin(), s.end());
return fw(s, ')');
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
map<int, int> forward, backward;
int zero = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
int x = fw(s, '('), y = bw(s);
if (x == 0) zero++;
if (x > 0) forward[x]++;
if (y > 0) backward[y]++;
}
int ret = zero / 2;
for (auto it : forward) ret += min(it.second, backward[it.first]);
cout << ret << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int x[100], y[100];
long long mod = 1e9 + 7;
long long ncr[1001][1001];
int main() {
ncr[0][0] = 1;
for (int n = 1; n <= 1000; n++) {
ncr[n][0] = 1;
for (int k = 1; k <= 1000; k++) {
ncr[n][k] = ncr[n - 1][k] + ncr[n - 1][k - 1];
if (ncr[n][k] >= mod) ncr[n][k] -= mod;
}
}
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int k = 0;
for (int i = 0; i < n; i++) cin >> x[i], k += x[i];
for (int i = 0; i < n; i++) cin >> y[i];
vector<long long> dp(k + 1, 0);
dp[0] = 1;
long long mul = 1, left = k;
for (int i = 0; i < n; i++) {
(mul *= ncr[left][x[i]]) %= mod;
left -= x[i];
vector<long long> ndp(k + 1, 0);
for (int j = 0; j <= k - x[i]; j++) {
for (int l = 0; l <= j + x[i] && l <= y[i]; l++) {
(ndp[j + x[i] - l] += dp[j] * ncr[j + x[i]][l]) %= mod;
}
}
swap(dp, ndp);
}
cout << (dp[0] * mul) % mod << endl;
}
| 7 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using lld = long double;
using vll = int64_t;
int main() {
map<int, pair<int, int> > hm;
int a[] = {4, 8, 15, 16, 23, 42};
for (int i = 0; i < 6; i++) {
for (int j = i + 1; j < 6; j++) hm[a[i] * a[j]] = {a[i], a[j]};
}
int ans[7];
cout << "? "
<< "1 2\n"
<< flush;
int x;
cin >> x;
auto p1 = hm[x];
cout << "? 2 3\n" << flush;
cin >> x;
auto p2 = hm[x];
if (p1.first == p2.first || p1.first == p2.second) {
ans[2] = p1.first;
ans[1] = p1.second;
if (p1.first == p2.first) {
ans[3] = p2.second;
} else {
ans[3] = p2.first;
}
} else {
ans[2] = p1.second;
ans[1] = p1.first;
if (p1.second == p2.first)
ans[3] = p2.second;
else
ans[3] = p2.first;
}
cout << "? 4 5\n" << flush;
cin >> x;
p1 = hm[x];
cout << "? 5 6\n" << flush;
cin >> x;
p2 = hm[x];
if (p1.first == p2.first || p1.first == p2.second) {
ans[5] = p1.first;
ans[4] = p1.second;
if (p1.first == p2.first) {
ans[6] = p2.second;
} else {
ans[6] = p2.first;
}
} else {
ans[5] = p1.second;
ans[4] = p1.first;
if (p1.second == p2.first)
ans[6] = p2.second;
else
ans[6] = p2.first;
}
cout << "! ";
for (int i = 1; i < 7; i++) cout << ans[i] << " ";
cout << "\n" << flush;
return 0;
}
| 3 |
#include <bits/stdc++.h>
int main() {
int n, i, j, m, c, h, f;
int a[10005];
while (scanf("%d", &n) != EOF) {
m = n * n;
h = n / 2;
f = n % 2;
for (i = 1; i <= n * (h + f); i++) {
a[i] = i;
}
c = (h + f) * n + 1;
for (j = m; j >= n * (h + f) + 1; j--) {
a[c] = j;
c++;
}
for (j = 1; j <= n; j++) {
for (i = j; i <= m; i = i + n) {
printf("%d ", a[i]);
}
printf("\n");
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3;
char mp[maxn][maxn];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
pair<int, int> vis[maxn][maxn];
int n, m, xb, yb, cntx = 0, cnty = 0;
bool flag = 0;
void dfs(int x, int y, int prex, int prey) {
int xx = x % n, yy = y % m;
if (xx < 0) xx += n;
if (yy < 0) yy += m;
if (mp[xx][yy] == '#') return;
if (vis[xx][yy].first == -1 && vis[xx][yy].second - 1)
vis[xx][yy] = make_pair(x, y);
else if (vis[xx][yy] != make_pair(x, y)) {
printf("Yes\n");
exit(0);
} else
return;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i], ny = y + dy[i];
if (nx != prex || ny != prey) dfs(nx, ny, x, y);
}
}
int main() {
memset(vis, -1, sizeof(vis));
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", mp[i]);
for (int j = 0; j < m; j++)
if (mp[i][j] == 'S') {
xb = i;
yb = j;
}
}
dfs(xb, yb, -1, -1);
printf("No\n");
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long res = 0;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i += 1) cin >> a[i];
vector<int> b(n);
vector<bool> Sx(100000);
int c = 0;
for (int i = n - 1; i >= 1; i -= 1) {
if (!Sx[a[i] - 1]) {
Sx[a[i] - 1] = true;
b[i] = ++c;
} else {
b[i] = b[i + 1];
}
}
vector<bool> Sy(100000);
for (int i = 0; i < n - 1; i += 1) {
if (!Sy[a[i] - 1]) {
res += b[i + 1];
Sy[a[i] - 1] = true;
}
}
cout << res << '\n';
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
while (k--) {
if (n % 10 == 0)
n = n / 10;
else
n = n - 1;
}
cout << n << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long n, t;
cin >> n >> t;
string s = string(n, char(48 + t));
if (t == 10 && n != 1) {
s = string(n - 1, '1') + "0";
} else if (t == 10 && n == 1)
s = "-1";
cout << s << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> E[1000];
int n, m, x, y, nedges[1001], solution, isam;
bool connected[101][101], is_vertice[1001];
void dfs(int node) {
isam++;
if (is_vertice[node]) solution++;
is_vertice[node] = 1;
for (int i = 0; i < nedges[node]; i++) {
if (!connected[node][E[node][i]]) {
connected[node][E[node][i]] = 1;
connected[E[node][i]][node] = 1;
dfs(E[node][i]);
}
}
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &x, &y);
E[x].push_back(y);
E[y].push_back(x);
nedges[x]++;
nedges[y]++;
}
dfs(1);
if (solution != 1 || isam - 1 != n)
cout << "NO" << endl;
else
cout << "FHTAGN!" << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int LOG = 20;
const int DIM = 200005;
struct stru {
pair<int, int> val;
int pos;
};
stru aux[DIM];
string str;
int cod[LOG][DIM];
pair<int, int> qry[DIM * 2];
inline bool cmp(stru st1, stru st2) { return st1.val < st2.val; }
int _n;
inline int lcp(int p1, int p2) {
int ans = 0;
for (int k = LOG - 1; k >= 0; --k) {
if (cod[k][p1] == cod[k][p2] and max(p1, p2) + (1 << k) - 1 <= _n) {
ans += (1 << k), p1 += (1 << k), p2 += (1 << k);
}
}
return ans;
}
inline bool cmp2(const pair<int, int> &p1, const pair<int, int> &p2) {
if (p1.first == p2.first) {
return p1.second < p2.second;
}
int l = lcp(p1.first, p2.first),
cd1 = (p1.first + l > _n ? -1 : str[p1.first + l - 1]),
cd2 = (p2.first + l > _n ? -1 : str[p2.first + l - 1]);
return cd1 < cd2;
}
inline void debug(void) {
cout << lcp(1, 2);
exit(0);
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n >> q >> str;
_n = n;
for (int i = 1; i <= n; ++i) {
cod[0][i] = str[i - 1] - 'a';
}
for (int k = 1; k < LOG; ++k) {
for (int i = 1; i <= n; ++i) {
aux[i].val = make_pair(cod[k - 1][i], i + (1 << (k - 1)) <= n
? cod[k - 1][i + (1 << (k - 1))]
: -1);
aux[i].pos = i;
}
sort(aux + 1, aux + n + 1, cmp);
for (int i = 1; i <= n; ++i) {
cod[k][aux[i].pos] =
(i > 1) and aux[i].val == aux[i - 1].val ? cod[k][aux[i - 1].pos] : i;
}
}
while (q--) {
int l, r;
cin >> l >> r;
for (int i = 1; i <= l; ++i) {
cin >> qry[i].first;
qry[i].second = 1;
}
for (int i = l + 1; i <= l + r; ++i) {
cin >> qry[i].first;
qry[i].second = 2;
}
sort(qry + 1, qry + l + r + 1, cmp2);
long long ans = 0;
for (int s = 1; s <= 2; ++s) {
long long sum = 0;
map<int, int> cnt;
for (int i = 1; i <= l + r; ++i) {
int pos = qry[i].first, typ = qry[i].second;
if (typ == 2) {
ans += sum;
} else {
++cnt[n - pos + 1];
sum += n - pos + 1;
}
if (i + 1 <= l + r) {
int len = lcp(qry[i].first, qry[i + 1].first);
while (!cnt.empty()) {
auto it = prev(cnt.end());
if (it->first <= len) {
break;
}
sum -= 1LL * it->first * it->second;
cnt[len] += it->second;
sum += 1LL * it->second * len;
cnt.erase(it);
}
}
}
reverse(qry + 1, qry + l + r + 1);
}
cout << ans << endl;
}
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long ceil(long long x, long long y) {
if (x % y) return (x / y) + 1;
return x / y;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long l1, r1, l2, r2;
cin >> l1 >> r1;
cin >> l2 >> r2;
if (l2 < l1) {
swap(l1, l2);
swap(r1, r2);
}
long long c = r1 - l2;
long long ans = 1e18;
if (c < 0) {
for (long long i = 1; i <= n; i++) {
long long curAns = abs(c) * i;
long long maxPossible = (max(r1, r2) - min(l1, l2)) * i;
curAns += min(k, maxPossible) + max((long long)0, k - maxPossible) * 2;
ans = min(ans, curAns);
}
} else {
long long rem = max((long long)0, k - n * (min(r1, r2) - max(l1, l2)));
long long maxPossible = n * (abs(l1 - l2) + abs(r1 - r2));
ans = min(rem, maxPossible) + max((long long)0, rem - maxPossible) * 2;
}
cout << ans << '\n';
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ul = unsigned long long;
using ii = pair<int, int>;
const ll mod7 = 1000000007, mod = 1000000000, OO = 0x3f3f3f3f;
const ld EPS = 1e-7;
double Pi = acos(-1);
const ld rad = Pi / 180.0;
ll power(ll x, ll y, ll p) {
ll res = 1;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll nCr(ll n, ll m) { return (m == 0) ? 1 : n * nCr(n - 1, m - 1) / m; }
int main() {
ll n, mxAll = 0, sum = 0;
cin >> n;
vector<pair<ll, ll>> vec(n);
for (ll i = 0; i < n; ++i) {
ll m, mx = 0;
cin >> m;
vec[i].first = m;
for (ll j = 0; j < m; ++j) {
ll sal;
cin >> sal;
mx = max(mx, sal);
}
vec[i].second = mx;
mxAll = max(mxAll, mx);
}
for (ll i = 0; i < n; ++i) sum += (mxAll - vec[i].second) * vec[i].first;
cout << sum << "\n";
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const bool print = false;
const int MAXN = 100111;
int t0[MAXN];
int zl[MAXN];
int ans[MAXN];
int szukaj(int k, int n) {
for (int i = (1); i <= (n); i++) zl[i] = 0;
int pop = 1, ss = 0;
int wyn = 1;
for (int i = (1); i <= (n); i++) {
if (zl[t0[i]] == 0) ss++;
if (ss > k) {
while (pop < i) zl[t0[pop]] = 0, pop++;
ss = 1;
wyn++;
}
zl[t0[i]]++;
}
ans[k] = wyn;
return wyn;
}
int n;
void dfs(int a, int b, int va, int vb) {
if (a + 1 >= b || va == vb) return;
int sr = (a + b) / 2;
szukaj(sr, n);
dfs(a, sr, va, ans[sr]);
dfs(sr, b, ans[sr], vb);
}
int main() {
scanf("%d", &n);
for (int i = (1); i <= (n); i++) scanf("%d", &t0[i]);
szukaj(1, n);
szukaj(n, n);
dfs(1, n, ans[1], ans[n]);
for (int i = (1); i <= (n); i++) {
if (ans[i] == 0) ans[i] = ans[i - 1];
printf("%d ", ans[i]);
}
puts("");
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long int t, n, a[100005], i, p, q, r, ans;
map<long long int, long long int> m;
set<long long int> s;
int main() {
cin >> p >> q >> r;
cin >> n;
for (long long int i = (long long int)(1); i <= (long long int)(n); i++) {
cin >> a[i];
m[a[i]]++;
s.insert(a[i]);
}
ans = 0;
for (auto it : s)
if (it > q && it < r) ans += m[it];
cout << ans;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void dofast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
dofast();
int T;
long long int i, j, n, m, o, k, x, ctr = 0, total = 0, t = 1, flag = 0;
cin >> m;
cin >> n;
cin >> o;
total = max(m + n + o, o * (m + n));
total = max(total, m * (o + n));
total = max(total, m * n * o);
cout << total << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5010;
int n;
char s[N];
int f[N], b[N];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
b[f[i - 2]] = i;
for (int j = 2; j < i; j++) b[f[j - 2] ^ f[i - j - 1]] = i;
for (f[i] = 0; b[f[i]] == i; f[i]++)
;
}
for (int i = 2; i < n; i++)
if (s[i - 1] == s[i + 1]) {
int t = 0, _ = 0;
for (int j = 1; j <= n; j++)
if (s[j - 1] == s[j + 1] && (j < i - 1 || j > i + 1))
t++;
else
_ ^= f[t], t = 0;
if (!_) return printf("First\n%d\n", i), 0;
}
return puts("Second"), 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long a, long long n, long long m) {
if (n == 0) return 1LL;
if (n == 1) return a;
long long x = bigmod(a, n / 2, m);
if (n % 2) return (((a * x) % m) * x) % m;
return (x * x) % m;
}
int mxbd[200002], ch[200002], q[200002];
vector<int> cand, bids[200002];
struct info {
int bd, id;
bool operator<(const info& rhs) const { return bd > rhs.bd; }
};
int main() {
ios_base::sync_with_stdio(0);
int i, j, x, n, cnt = 0, m, y, k, g, flg, l, r, md;
scanf("%d", &n);
pair<int, int> bid[n + 1];
for (i = 1; i <= n; i++) {
scanf("%d %d", &x, &y);
bid[i].first = x;
bid[i].second = y;
bids[x].push_back(y);
if (!ch[x]) {
cand.push_back(x);
ch[x] = 1;
}
mxbd[x] = y;
}
multiset<info> st;
multiset<info>::iterator it;
info d;
for (i = 0; i <= cand.size() - 1; i++) {
d.id = cand[i];
d.bd = mxbd[d.id];
st.insert(d);
}
it = st.begin();
d = *it;
scanf("%d", &m);
for (j = 1; j <= m; j++) {
scanf("%d", &g);
for (i = 1; i <= g; i++) {
scanf("%d", &q[i]);
d.id = q[i];
d.bd = mxbd[d.id];
it = st.find(d);
if (it != st.end()) st.erase(it);
}
if (st.empty()) {
printf("0 0\n");
for (i = 1; i <= g; i++) {
d.id = q[i];
d.bd = mxbd[d.id];
st.insert(d);
}
continue;
}
it = st.begin();
d = *it;
x = d.id;
st.erase(it);
if (st.empty()) {
printf("%d %d\n", x, bids[x][0]);
d.id = x;
d.bd = mxbd[d.id];
st.insert(d);
for (i = 1; i <= g; i++) {
d.id = q[i];
d.bd = mxbd[d.id];
if (mxbd[d.id]) st.insert(d);
}
continue;
}
it = st.begin();
d = *it;
y = d.id;
l = 0;
r = bids[x].size() - 1;
while (r - l > 1) {
md = (l + r) / 2;
if (mxbd[y] > bids[x][md])
l = md;
else
r = md;
}
if (bids[x][l] > mxbd[y]) {
printf("%d %d\n", x, bids[x][l]);
} else {
printf("%d %d\n", x, bids[x][r]);
}
d.id = x;
d.bd = mxbd[d.id];
st.insert(d);
for (i = 1; i <= g; i++) {
d.id = q[i];
d.bd = mxbd[d.id];
if (mxbd[d.id]) st.insert(d);
}
}
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int n, m, g[500][500];
vector<vector<int> > e;
vector<pair<int, int> > es;
int p[1000];
bool use[1000];
bool rec(int s) {
if (s < 0) return 1;
for (__typeof((e[s]).begin()) i = (e[s]).begin(); i != (e[s]).end(); i++)
if (!use[*i]) {
use[*i] = 1;
if (rec(p[*i])) return p[*i] = s, p[s] = *i, 1;
}
return 0;
}
int matching() {
int res = 0;
for (int i = 0; i < (int)2 * n; i++) p[i] = -1;
for (int i = 0; i < (int)2 * n; i++)
if (p[i] < 0) {
for (int j = 0; j < (int)2 * n; j++) use[j] = 0;
if (rec(i)) res++;
}
return res;
}
int main() {
cin >> n >> m;
for (int i = 0; i < (int)m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a][b] = 1;
es.push_back(make_pair(a, b));
}
int ans = inf;
for (int i = 0; i < (int)n; i++) {
int cost = !g[i][i];
int cnt = 0;
for (int j = 0; j < (int)n; j++)
if (i != j) cost += (!g[i][j]) + (!g[j][i]);
e.clear();
e.resize(2 * n);
for (int j = 0; j < (int)m; j++) {
if (es[j].first == i || es[j].second == i) continue;
cnt++;
e[es[j].first].push_back(es[j].second + n);
e[es[j].second + n].push_back(es[j].first);
}
cost += n - 1 + cnt - 2 * matching();
ans = min(ans, cost);
}
cout << ans << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, n, cnt = 0;
string s;
cin >> n >> x >> y;
cin >> s;
reverse(s.begin(), s.end());
string temp = s.substr(0, x);
for (int i = 0; i < temp.size(); i++) {
if (i == y) {
if (temp[i] == '0') cnt++;
} else {
if (temp[i] == '1') cnt++;
}
}
cout << cnt << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
int n, q, fa[66666], aa[66666], kh[66666], a[66666], p[66666], fp[66666],
siz[66666], ck, pa[66666];
vector<int> edge[66666];
int dd[66666];
void dfs(int u) {
siz[u] = 1;
p[++ck] = u;
fp[u] = ck;
pa[ck] = fp[fa[u]];
dd[ck] = dd[pa[ck]] + 1;
for (auto v : edge[u]) {
dfs(v);
siz[u] += siz[v];
}
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; ++i) {
scanf("%d", aa + i);
}
for (int i = 2; i <= n; ++i) {
scanf("%d", fa + i);
edge[fa[i]].push_back(i);
}
dfs(1);
for (int i = 1; i <= n; ++i) {
a[fp[i]] = aa[i];
}
for (int i = 1; i <= q; ++i) {
int x;
scanf("%d", &x);
int y = siz[x];
x = fp[x];
int pp = i + 1, *jj = kh + x, *diao = dd + x, *aa = a + x;
int ans = 0, cnt = 0;
for (int j = 0; j < y; ++j) {
if (jj[j] < pp) {
jj[j] = i + aa[j];
ans += diao[j];
cnt++;
}
}
ans = ans - cnt * dd[x];
printf("%d %d\n", ans, cnt);
}
}
| 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.