solution
stringlengths 52
181k
| difficulty
int64 0
6
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
const size_t maxn = 51;
struct cnode {
long a, b, c;
};
int lena, lenb, n;
int a[maxn], b[maxn];
long long markA[maxn][maxn], markB[maxn][maxn];
cnode g[maxn];
int f[maxn][maxn];
int init() {
string sta, stb;
cin >> sta >> stb;
lena = sta.length();
lenb = stb.length();
for (int i = 0; i != lena; i++) a[i + 1] = sta[i] - 'a';
for (int i = 0; i != lenb; i++) b[i + 1] = stb[i] - 'a';
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> sta;
g[i].a = 1LL << (sta[0] - 'a');
g[i].b = 1LL << (sta[3] - 'a');
g[i].c = 1LL << (sta[4] - 'a');
}
return 0;
}
int prework() {
memset(markA, 0, sizeof(markA));
memset(markB, 0, sizeof(markB));
for (int i = 1; i <= lena; i++) markA[i][i] |= 1LL << a[i];
for (int c = 1; c != lena; c++)
for (int i = 1; i + c <= lena; i++) {
int j = i + c;
for (int k = i; k != j; k++)
for (int w = 1; w <= n; w++)
if ((markA[i][k] & g[w].b) && (markA[k + 1][j] & g[w].c))
markA[i][j] |= g[w].a;
}
for (int i = 1; i <= lenb; i++) markB[i][i] |= 1LL << b[i];
for (int c = 1; c != lenb; c++)
for (int i = 1; i + c <= lenb; i++) {
int j = i + c;
for (int k = i; k != j; k++)
for (int w = 1; w <= n; w++)
if ((markB[i][k] & g[w].b) && (markB[k + 1][j] & g[w].c))
markB[i][j] |= g[w].a;
}
return 0;
}
int work() {
memset(f, maxn, sizeof(f));
f[0][0] = 0;
for (int i = 1; i <= lena; i++)
for (int j = 1; j <= lenb; j++)
for (int a = 1; a <= i; a++)
for (int b = 1; b <= j; b++)
if (markA[a][i] & markB[b][j])
f[i][j] = min(f[i][j], f[a - 1][b - 1] + 1);
if (f[lena][lenb] >= maxn)
cout << "-1" << endl;
else
cout << f[lena][lenb] << endl;
cin >> f[0][0];
return 0;
}
int main() {
init();
prework();
work();
return 0;
}
| 5 |
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
if(n==7||n==5||n==3){
printf("YES\n");
}else{
printf("NO\n");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005];
long long tmp[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
long long ans = 0;
if (k == 0 || k >= 2) {
long long sum = 0;
for (int i = n; i >= 1; i--) {
sum += a[i];
ans = max(ans, sum - b[i]);
}
}
if (k == 1 || k >= 2) {
long long sum = 0;
for (int i = n; i >= 1; i--) {
sum += a[i];
tmp[i] = max(tmp[i + 1], sum - b[i]);
}
sum = a[1];
int minv = b[1];
for (int i = 2; i < n; i++) {
sum += a[i];
minv = min(minv, b[i]);
ans = max(ans, sum - minv + tmp[i + 1]);
}
sum = a[n] + a[n - 1];
minv = a[n - 1];
for (int i = n - 2; i >= 1; i--) {
sum += a[i];
ans = max(ans, sum - minv - b[i]);
minv = min(minv, a[i]);
}
sum = max(0, a[1] - b[1]);
for (int i = n; i >= 2; i--) {
sum += a[i];
ans = max(ans, sum - b[i]);
}
}
if (k >= 2) {
int minb = *min_element(b + 1, b + n);
long long sum = 0;
for (int i = 1; i <= n; i++) sum += a[i];
ans = max(ans, sum - minb);
}
cout << ans << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
int l, r;
long long b;
long long res;
int main() {
scanf("%d%d", &l, &r);
b = 1;
for (; r / b >= 10; b *= 10)
;
b *= 5;
if (l <= b && b <= r) {
res = b;
} else if (r < b) {
res = r;
} else {
res = l;
}
printf("%I64d\n", res * (2 * b - 1 - res));
return 0;
}
| 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
while(cin>>s){
int joi=0,ioi=0;
for(int i=0;i<s.size();i++){
string t=s.substr(i,3);
if(t=="JOI")joi++;
else if(t=="IOI")ioi++;
}
cout<<joi<<endl;
cout<<ioi<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
int n, k;
char s[4];
bool ask(int x, int y) {
printf("%d %d %d\n", 1, x, y);
fflush(stdout);
scanf("%s", s);
if (s[0] == 'N') return false;
return true;
}
bool test(int x) {
if (x == 1) return ask(x, x + 1);
if (x == n) return ask(x, x - 1);
return ask(x, x - 1) && ask(x, x + 1);
}
int find(int l, int r) {
while (r - l > 2 && r - l != 4) {
int x = (r - l - 1) / 3 + 1;
if (ask(l + x, r - x))
r -= x;
else
l += x;
}
if (r - l == 4) {
if (ask(l + 1, r - 1))
r -= 2;
else
l += 3;
}
if (r - l == 2) {
if (ask(l, r))
--r;
else
l += 2;
}
if (r - l == 1) {
if (ask(l, r)) return l;
return r;
}
return l;
}
int main() {
scanf("%d%d", &n, &k);
int f = find(1, n), s;
if (f == 1)
s = find(2, n);
else if (f == n)
s = find(1, n - 1);
else {
if (f <= n / 2) {
if (ask(1, f * 2 - 2))
s = find(1, f - 1);
else
s = find(f + 1, n);
} else {
if (ask(n, f * 2 - n + 1))
s = find(f + 1, n);
else
s = find(1, f - 1);
}
}
printf("2 %d %d\n", f, s);
return 0;
}
| 2 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:300000000")
#pragma warning(disable : 4800)
using namespace std;
const double pi = 3.1415926535897932384626433832795;
template <class T>
T abs(const T &a) {
return a >= 0 ? a : -a;
};
template <class T>
T sqr(const T &x) {
return x * x;
}
int xa, ya, xb, yb;
int n;
vector<pair<int, int> > v;
vector<int> r;
double dist(int xa, int ya, int xb, int yb) {
return hypot((xa - xb), (ya - yb));
}
bool check(int x, int y) {
for (int i = 0; i < (n); i++)
if (dist(v[i].first, v[i].second, x, y) <= r[i] + 1e-9) return true;
return false;
}
int main() {
cin >> xa >> ya >> xb >> yb;
if (xa > xb) swap(xa, xb);
if (ya > yb) swap(ya, yb);
cin >> n;
v.resize(n);
r.resize(n);
for (int i = 0; i < (n); i++) cin >> v[i].first >> v[i].second >> r[i];
int warmCnt = 0;
int allCnt = 0;
for (int x = xa; x <= xb; x++) {
allCnt += 2;
if (check(x, ya)) warmCnt++;
if (check(x, yb)) warmCnt++;
}
for (int y = ya + 1; y <= yb - 1; y++) {
allCnt += 2;
if (check(xa, y)) warmCnt++;
if (check(xb, y)) warmCnt++;
}
cout << allCnt - warmCnt;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 210;
inline int min(int a, int b) { return a < b ? a : b; }
inline int mas(int a, int b) { return a > b ? a : b; }
inline int read() {
int f = 1, x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar();
}
return f * x;
}
int n, K;
int a[maxn], f[2][maxn][1010];
int main() {
n = read();
K = read();
for (int i = 1; i <= n; ++i) a[i] = read();
sort(a + 1, a + 1 + n);
int o, p;
f[1][1][0] = f[1][0][0] = o = 1;
for (int i = 1; i < n; ++i) {
p = o ^ 1;
memset(f[p], 0, sizeof(f[p]));
for (int j = 0; j <= i; ++j) {
int t = j * (a[i + 1] - a[i]);
for (int k = 0; k + t <= K; ++k) {
f[p][j][k + t] =
(f[p][j][k + t] + 1ll * f[o][j][k] * (j + 1) % 1000000007) %
1000000007;
if (j < n)
f[p][j + 1][k + t] = (f[p][j + 1][k + t] + f[o][j][k]) % 1000000007;
if (j)
f[p][j - 1][k + t] =
(f[p][j - 1][k + t] + 1ll * f[o][j][k] * j % 1000000007) %
1000000007;
}
}
o = p;
}
int ans = 0;
for (int i = 0; i <= K; ++i) ans = (f[o][0][i] + ans) % 1000000007;
printf("%d\n", ans);
}
| 6 |
#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
std::vector<int> v[1000005];
int maxx;
int arr[1000005];
void dfs(int no, int p, int nn, int pn) {
maxx = max(maxx, nn);
int pnn = 0;
for (int i : v[no]) {
if (i != p) {
pnn++;
if (pnn == nn || pnn == pn) pnn++;
if (pnn == nn || pnn == pn) pnn++;
arr[i] = pnn;
dfs(i, no, pnn, nn);
}
}
}
int main() {
int n;
cin >> n;
memset(arr, 0, sizeof(arr));
arr[0] = 1;
for (int i = 0; i < n - 1; ++i) {
int x, y;
cin >> x >> y;
x--;
y--;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(0, -1, 1, -1);
cout << maxx << '\n';
for (int i = 0; i < n; ++i) {
cout << arr[i] << " ";
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int U = 1e6;
map<long long, int> A, B, C, F;
int n, pa[300005], pb[300005], pc[300005];
long long a[300005], b[300005], c[300005];
int dp(int x, int y) {
int &res = F[1LL * U * x + y];
if (pa[x] < 0 && pb[y] < 0 && pc[min(x, y)] < 0) return 0;
if (res) return res - 1;
if (pc[min(x, y)] >= 0) res = max(res, dp(pc[min(x, y)], pc[min(x, y)]) + 1);
if (pa[x] >= 0 || pb[y] >= 0) {
if (pa[x] > pb[y])
res = max(res, dp(pa[x], y) + 1);
else
res = max(res, dp(x, pb[y]) + 1);
}
res++;
return res - 1;
}
int main() {
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%I64d", &a[i]);
for (i = 1; i <= n; i++) scanf("%I64d", &b[i]);
for (i = 1; i <= n; i++) {
c[i] = c[i - 1] + a[i] + b[i];
a[i] += a[i - 1], b[i] += b[i - 1];
}
pa[0] = pb[0] = pc[0] = -1;
A[0] = B[0] = C[0] = 1;
for (i = 1; i <= n; i++) {
pa[i] = A[a[i]] - 1;
pb[i] = B[b[i]] - 1;
pc[i] = C[c[i]] - 1;
A[a[i]] = B[b[i]] = C[c[i]] = i + 1;
}
for (i = 1; i <= n; i++) {
pa[i] = max(pa[i], pa[i - 1]);
pb[i] = max(pb[i], pb[i - 1]);
pc[i] = max(pc[i], pc[i - 1]);
}
printf("%d\n", dp(n, n));
return 0;
}
| 5 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,l; cin >> n >> l;
int sum = l*n + n*(n+1)/2 - n;
if(l>0) cout << sum-l << endl;
else if(l+n-1<0) cout << sum-(l+n-1) << endl;
else cout << sum << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
inline void in(int &n) {
n = 0;
int ch = getchar();
int sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') sign = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = (n << 3) + (n << 1) + ch - '0', ch = getchar();
}
n = n * sign;
}
pair<int, int> a[100005];
long long int Fsum[100005], Rsum[100005];
long long int solve(long long int val, int low, int up) {
int n = up;
while (low < up) {
int mid = low + (up - low) / 2;
if (a[mid].first >= val) {
low = mid + 1;
} else {
up = mid;
}
}
long long int ans = val * (n - low + 1) - Rsum[low];
return ans;
}
int res[100005];
int main() {
int n;
long long int A;
int Cf, Cm;
in(n);
cin >> A;
in(Cf);
in(Cm);
long long int m;
cin >> m;
for (int i = 1; i <= n; i++) {
in(a[i].first);
a[i].second = i;
}
sort(a + 1, a + 1 + n);
reverse(a + 1, a + 1 + n);
Fsum[0] = 0;
for (int i = 1; i <= n; i++) {
Fsum[i] = Fsum[i - 1] + a[i].first;
}
Rsum[n + 1] = 0;
for (int i = n; i >= 1; i--) {
Rsum[i] = Rsum[i + 1] + a[i].first;
}
long long int ans = 0;
int X, Y;
if (A * n - Fsum[n] <= m) {
ans = n * Cf + A * Cm;
X = n;
Y = A;
}
for (int i = 1; i <= n; i++) {
int low = a[n].first;
int up = A;
while (low < up) {
int mid = low + (up - low + 1) / 2;
long long int total = A * (i - 1) - Fsum[i - 1] + solve(mid, i, n);
if (total <= m) {
low = mid;
} else {
up = mid - 1;
}
}
long long int total = A * (i - 1) - Fsum[i - 1] + solve(low, i, n);
if (total <= m) {
long long int p = low;
p *= Cm;
long long int curr = (i - 1) * Cf + p;
if (curr >= ans) {
ans = curr;
X = i - 1;
Y = low;
}
}
}
for (int i = 1; i <= n; i++) {
if (i <= X) {
res[a[i].second] = A;
} else {
res[a[i].second] = max(a[i].first, Y);
}
}
printf("%I64d\n", ans);
for (int i = 1; i <= n; i++) {
printf("%d ", res[i]);
}
printf("\n");
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s, t;
int main() {
cin >> n >> s >> t;
if (s == t) { cout << "0" << endl; exit(0); }
int up = n - 1, down = n - 1, ans = 0;
queue<int> q;
while (down >= 0) {
while (down && t[down - 1] == t[down]) down--;
while (up >= 0 && (up > down || s[up] ^ t[down])) up--;
if (up < 0) { cout << "-1" << endl; exit(0); }
while (!q.empty() && q.front() - q.size() >= down) q.pop();
if (up ^ down) q.push(up);
ans = max(ans, (int)q.size() + 1), down--;
}
cout << ans << endl;
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<string>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
#define INF 1<<30
struct edge {
int t, d;//to/dist
};
int N, K;
vector<int>C, R, vcos;//ngcos
vector<int> v[5002];//connection
vector<edge> V[5002];//connection
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;//cost/vartex id
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) vcos.push_back(INF);
for (int i = 0; i < N; i++) {
int c, r;
cin >> c >> r;
C.push_back(c);
R.push_back(r);
}
for (int i = 0; i < K; i++) {
int A, B; cin >> A >> B; A--; B--;
v[A].push_back(B);
v[B].push_back(A);
}
//BFS & make graph
for (int i = 0; i < N; i++) {
bool vzt[5002];
for (int j = 0; j < N; j++) vzt[j] = false;
queue<pair<int, int>> q;
q.push({ i, 0 });
while (!q.empty()) {
pair<int, int> tmp = q.front();
q.pop();
for (int j = 0; j < v[tmp.first].size(); j++) {
if (!vzt[v[tmp.first][j]]) {
vzt[v[tmp.first][j]] = true;
q.push({ v[tmp.first][j], tmp.second + 1 });
if (tmp.second + 1 <= R[i]) {
edge tm = { v[tmp.first][j], C[i] };
V[i].push_back(tm);
}
}
}
}
}
//Dijkstra
pq.push({ 0, 0 });
while (!pq.empty()) {
pair<int, int> tp = pq.top();
pq.pop();
if (vcos[tp.second] == INF) {
vcos[tp.second] = tp.first;
for (int i = 0; i < V[tp.second].size(); i++) {
pq.push({ vcos[tp.second] + V[tp.second][i].d, V[tp.second][i].t });
//コストが未確定頂点のうち最小のもの+辺のコスト, 辺の先の頂点
}
}
}
cout << vcos[N - 1] << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int te;
cin >> te;
while (te--) {
long long int n, ans = 0;
cin >> n;
string s;
cin >> s;
vector<long long int> pos(n);
set<int> se[2];
for (long long int i = 0; i <= s.size() - 1; i++) se[s[i] - '0'].insert(i);
while (!se[0].empty() && (!se[1].empty())) {
int z = 1, last = -1;
if (*se[0].begin() < *se[1].begin()) z = 0;
while (1) {
auto x = se[z].upper_bound(last);
if (x == se[z].end()) break;
last = *x;
pos[*x] = ans + 1;
se[z].erase(x);
z ^= 1;
}
ans++;
}
if ((!se[0].empty()) || (!se[1].empty()))
ans++;
else {
cout << ans << "\n";
for (auto x : pos) {
cout << x << " ";
}
cout << "\n";
;
continue;
}
if (!se[0].empty()) {
for (auto x : se[0]) pos[x] = ans++;
}
if (!se[1].empty()) {
for (auto x : se[1]) pos[x] = ans++;
}
ans--;
cout << ans << "\n";
for (auto x : pos) {
cout << x << " ";
}
cout << "\n";
;
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
namespace TwoSat {
const int nodes = 510;
int g[nodes][nodes];
vector<int> ed[nodes];
int n, cnt, top, ind;
int low[nodes], st[nodes], disc[nodes], comp[nodes], inst[nodes];
vector<int> result;
void init(int ct) {
n = ct;
cnt = top = ind = 0;
memset(g, 0, sizeof(g));
for (int i = 0; i <= n; i++) ed[i].clear();
}
void add(int u, int v) {
if (g[u][v]) return;
ed[u].push_back(v);
g[u][v] = 1;
}
void add_disjunction(int u, int v) {
add(u ^ 1, v);
add(v ^ 1, u);
}
void tarjan(int u) {
disc[u] = low[u] = ++ind;
inst[u] = 1;
st[++top] = u;
for (int i = 0; i < (int)ed[u].size(); i++) {
int v = ed[u][i];
if (!disc[v])
tarjan(v), low[u] = min(low[v], low[u]);
else if (inst[v])
low[u] = min(low[u], disc[v]);
}
if (disc[u] == low[u]) {
++cnt;
while (true) {
comp[st[top]] = cnt;
inst[st[top]] = 0;
if (st[top--] == u) break;
}
}
}
bool solve() {
memset(disc, 0, sizeof(disc));
for (int i = 0; i < n; i++) {
if (!disc[i]) tarjan(i);
}
for (int i = 0; i < n; i += 2) {
if (comp[i] == comp[i ^ 1])
return 0;
else if (comp[i] > comp[i ^ 1])
result.push_back(i / 2);
}
return 1;
}
} // namespace TwoSat
string T, s, ans;
const int N = 2e5;
pair<int, int> check[N];
int n, m, len;
bool ac, av;
bool solve(int l) {
TwoSat::init(n * 2);
for (int i = 0; i < m; i++) {
int u = check[i].first;
int v = check[i].second;
TwoSat::add_disjunction(u ^ 1, v);
}
for (int i = 0; i < l; i++) {
if (T[ans[i] - 'a'] == 'V')
TwoSat::add(i * 2, i * 2 + 1);
else
TwoSat::add(i * 2 + 1, i * 2);
}
for (int i = 0; i < n; i++) {
if (ac) TwoSat::add(i * 2 + 1, i * 2);
if (av) TwoSat::add(i * 2, i * 2 + 1);
}
bool flg = TwoSat::solve();
return flg;
}
void dfs(int d, int flag) {
if (d == n) {
cout << ans << endl;
exit(0);
} else {
int v = 0, c = 0;
for (int i = (flag ? 0 : s[d] - 'a'); i < len; i++) {
ans[d] = i + 'a';
if (T[i] == 'V') {
if (v >= 2) continue;
v++;
}
if (T[i] == 'C') {
if (c >= 2) continue;
c++;
}
if (solve(d + 1)) {
dfs(d + 1, flag | (i != (s[d] - 'a')));
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ac = true;
av = true;
cin >> T;
len = (int)T.length();
for (int i = 0; i < len; i++) {
ac = ac & (T[i] == 'C');
av = av & (T[i] == 'V');
}
cin >> n >> m;
for (int i = 0; i < m; i++) {
int p1, p2;
char ch1, ch2;
cin >> p1 >> ch1 >> p2 >> ch2;
p1--, p2--;
int u = p1 * 2 + (ch1 == 'V');
int v = p2 * 2 + (ch2 == 'V');
check[i] = make_pair(u, v);
}
cin >> s;
ans = s;
dfs(0, 0);
cout << -1 << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
int main() {
int a, b, t, k;
scanf("%d", &a);
scanf("%d", &b);
k = a - b;
if (k < 0) k = -k;
k = k % 3;
if (a + b < 3)
t = 0;
else if (k == 0)
t = a + b - 3;
else
t = a + b - 2;
printf("%d", t);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
int cnt=0;
cin>>S;
for(int i=0; i<S.size()-1; i++){
if(S[i]!=S[i+1])cnt++;
}
cout<<cnt<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int cmp(double a, double b = 0.0) {
if (fabs(a - b) <= (1e-9)) return 0;
if (a < b) return -1;
return 1;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
int a, b;
scanf("%d %d", &a, &b);
b *= 4;
if (b == 0) {
printf("1.0\n");
} else {
double r = 0;
if (a >= b) {
r = (1.0 * a - b) / a + b / (2. * a);
} else {
r = a * 1.0 / (2. * b);
}
printf("%.8lf\n", r / 2 + 0.5);
}
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int get_ans(int n, int w[], int total) {
int ans = 0;
unordered_map<int, int> m;
for (int i = 0; i < n; i++) m[w[i]]++;
for (int i = 0; i < n; i++) {
if (m.find(w[i]) != m.end()) {
m[w[i]]--;
if (m[w[i]] == 0) m.erase(w[i]);
int rem = total - w[i];
if (m.find(rem) != m.end()) {
m[rem]--;
if (m[rem] == 0) m.erase(rem);
ans++;
} else
m[w[i]]++;
}
}
return ans;
}
int main() {
int t;
cin >> t;
while (t--) {
int n, ans = 0;
cin >> n;
int w[n];
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 2; i <= (2 * n); i++) {
ans = max(ans, get_ans(n, w, i));
}
cout << ans << endl;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,a,ans=0;
cin >> n >> m;
priority_queue<long> q;
for(int i=0;i<n;i++) {
cin >> a;
q.push(a);
};
for(int i=0;i<m;i++) {
q.push(q.top()/2);
q.pop();
};
for(int i=0;i<n;i++) {
ans+=q.top();
q.pop();
};
cout << ans << endl;
} | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int num;
string before = "Hoshino", after = "Hoshina";
cin >> num;
cin.get();
for(int i = 0; i < num; i++)
{
string str;
getline(std::cin, str);
string::size_type pos;
for(pos = str.find(before); pos != string::npos; pos = str.find(before, after.size() + pos))
{
str.replace(pos, before.size(), after);
}
cout << str << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
pair<int, char> a[26];
int k, i, c = 0, n = s.size();
cin >> k;
for (i = 0; i < 26; i++) {
a[i].first = 0;
a[i].second = 'a' + i;
}
for (i = 0; i < n; i++) a[s[i] - 'a'].first++;
sort(a, a + 26);
i = 0;
while (i < 26 && k - a[i].first >= 0) {
k -= a[i].first;
a[i].first = 0;
i++;
}
if (i < 26) a[i].first -= k;
int b[26] = {0};
for (i = 0; i < 26; i++) b[a[i].second - 'a'] = a[i].first;
for (i = 0; i < 26; i++) {
if (b[i] > 0) c++;
}
cout << c << "\n";
for (i = 0; i < n; i++) {
if (b[s[i] - 'a'] > 0) {
cout << s[i];
b[s[i] - 'a']--;
}
}
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long int num[100005], n, k;
int main() {
cin >> n >> k;
int Min = -1, in;
for (int i = 0; i < n; i++) {
cin >> num[i];
if (Min == -1) Min = num[i];
if (Min >= num[i]) {
Min = num[i];
in = i;
}
}
k--;
if (in < k)
;
else if (num[k] == Min)
in = k;
else
for (int i = k; i >= 0; i--)
if (num[i] == Min) {
in = i;
break;
}
int l = k, ex = 0;
if (in > k) l = n - 1;
for (int i = in + 1; i <= l; i++) {
num[i]--;
ex++;
}
if (in > k)
for (int i = 0; i < k + 1; i++) {
num[i]--;
ex++;
}
for (int i = 0; i < n; i++)
if (i != in) num[i] = num[i] - num[in];
num[in] = ex + num[in] * n;
for (int i = 0; i < n; i++) cout << num[i] << " ";
cout << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
bool check(string s) {
int n = s.length();
if (n % 2 == 0) return false;
return s[n / 2] == '|';
}
int MAIN() {
string s;
cin >> s;
string t;
cin >> t;
string ans = "Impossible";
for (int i = 0; i <= t.length(); i++) {
string t1, t2;
for (int j = 0; j < i; j++) t1 += t[j];
for (int j = i; j < t.length(); j++) t2 += t[j];
if (check(t1 + s + t2)) ans = t1 + s + t2;
}
cout << ans << endl;
return 0;
}
int main() {
ios ::sync_with_stdio(false);
cout << fixed << setprecision(16);
return MAIN();
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<complex>
#include<string>
#include<cstring>
using namespace std;
#define rep2(x,from,to) for(long long x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
#define debug(x) cout<<#x<<": "<<x<<endl
#define all(x) x.begin(),x.end()
typedef pair<long long,long long> P;
typedef pair<long long,P> PP;
long long n,q;
long long v,u;
long long del;
int main()
{
cin>>n>>q;
del=n-2;
rep(i,q)
{
cin>>v>>u;
if(n==1)
{
if(v>u)cout<<u<<endl;
else cout<<v<<endl;
continue;
}
v+=del;
u+=del;
while(1)
{
if(u==v)
{
cout<<u-del<<endl;
break;
}
if(u>v)
{
u/=n;u+=del;
}
else
{
v/=n;
v+=del;
}
}
}
return 0;
} | 0 |
#include<iostream>
using namespace std;
#include<bits/stdc++.h>
#define ll long long
#define forn(i,n) for(ll i=0;i<n;i++)
ll minimum(ll x,ll y){
return min(x,y);
}
ll maximum(ll x,ll y){
return max(x,y);
}
// BIT
/*
vector<vector<ll> > bit(3e5);
ll lowbit(ll x){
return x&-x;}
void add(ll i,ll x,ll n){
for(;i<=n;i+=lowbit(i))bit[i].push_back(x);
}
ll query(ll i,ll x){
ll ans=0;
for(;i;i-=lowbit(i)){
ll pos = lower_bound(bit[i].begin(),bit[i].end(),x) - bit[i].begin();
ans += bit[i].size()-pos;
}
return ans;
}
*/
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll MAX= 9223372036854775807;
ll test;
cin>>test;
ll mod = 998244353;
//test = 1;
while(test--)
{
ll n;
cin>>n;
vector<ll> a(n);
forn(i,n)
cin>>a[i];
ll cnt=0;
while(true){
bool con=false;
forn(i,a.size()-1){
if(a[i]< a[i+1]){
if(a[i+1]>2*a[i]){
vector<ll> temp;
for(int j=0;j<=i;j++)
temp.push_back(a[j]);
temp.push_back(2*a[i]);
for(int j=i+1;j<a.size();j++)
temp.push_back(a[j]);
a=temp;
con = true;
// cout<<i<<endl;
cnt++;
break;
}
}
else if(a[i]>a[i+1]){
if(a[i]>2*a[i+1]){
vector<ll> temp;
for(int j=0;j<=i;j++)
temp.push_back(a[j]);
temp.push_back(2*a[i+1]);
for(int j=i+1;j<a.size();j++)
temp.push_back(a[j]);
con = true;
a=temp;
//cout<<i<<endl;
cnt++;
break;
}
}
}
//cout<<con<<endl;
if(!con)
break;
}
cout<<cnt<<"\n";
}
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans=0;
cin>>s;
for(int i=1;i<s.size();i++)
if(s[i-1]!=s[i])ans++;
cout<<ans<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 4000;
int N, M, a[NMAX + 2];
int m[NMAX + 2][NMAX + 2];
int sz[NMAX + 2];
int ls[NMAX + 2], lw[NMAX + 2];
int rs[NMAX + 2], rw[NMAX + 2];
long long dp[NMAX + 2][NMAX + 2];
void dfs(int node) {
sz[node] = 1;
if (ls[node] != 0) {
dfs(ls[node]);
for (int i = min(M, sz[node]); i >= 0; i--) {
for (int j = min(M, sz[ls[node]]); j >= 0; j--) {
dp[node][i + j] =
max(dp[node][i + j],
dp[node][i] + dp[ls[node]][j] + 1LL * j * (M - j) * lw[node]);
}
}
sz[node] += sz[ls[node]];
}
if (rs[node] != 0) {
dfs(rs[node]);
for (int i = min(M, sz[node]); i >= 0; i--) {
for (int j = min(M, sz[rs[node]]); j >= 0; j--) {
dp[node][i + j] =
max(dp[node][i + j],
dp[node][i] + dp[rs[node]][j] + 1LL * j * (M - j) * rw[node]);
}
}
sz[node] += sz[rs[node]];
}
}
void build_tree(int l, int r) {
if (l == r) {
return;
}
int v = m[l][r];
if (m[l][v - 1] != 0) {
ls[v] = m[l][v - 1];
lw[v] = a[m[l][v - 1]] - a[v];
build_tree(l, v - 1);
}
if (m[v + 1][r] != 0) {
rs[v] = m[v + 1][r];
rw[v] = a[m[v + 1][r]] - a[v];
build_tree(v + 1, r);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
if (M == 1) {
cout << 0 << '\n';
return 0;
}
for (int i = 1; i <= N; i++) {
m[i][i] = i;
}
for (int l = 2; l <= N; l++) {
for (int i = 1; i + l - 1 <= N; i++) {
if (a[m[i][i + l - 2]] < a[m[i + 1][i + l - 1]]) {
m[i][i + l - 1] = m[i][i + l - 2];
} else {
m[i][i + l - 1] = m[i + 1][i + l - 1];
}
}
}
build_tree(1, N);
dfs(m[1][N]);
cout << dp[m[1][N]][M] << '\n';
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+5,mod=1e9+7;
ll d[5005];
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll k,q;cin>>k>>q;
for(ll i=0;i<k;i++)cin>>d[i];
for(ll n,x,m;q>0;q--){
cin>>n>>x>>m;
x%=m;
ll zeroes=0,sum=x;
for(ll i=0;i<k;i++){
ll val = d[i]%m;
ll cnt = (n-1)/k;
if((n-1)%k>i)cnt++;
if(val==0)zeroes+=cnt;
else sum+=cnt*val;
}
ll ans = sum/m - x/m + zeroes;
cout<<(n-1)-ans<<"\n";
}
} | 0 |
#include<iostream>
typedef float f;f a,b,c,d,h,i,e,g;f r(f k,f l,f m,f n){m-=k;n-=l;k=e-k;l=g-l;return m*l-n*k?m*l-n*k>0?1:-1:0;}int main(){for(;!(std::cin>>a>>b>>c>>d>>h>>i>>e>>g).eof();)puts(r(a,b,c,d)==r(c,d,h,i)&&r(a,b,c,d)==r(h,i,a,b)?"YES":"NO");} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
long long a[maxn][maxn];
int main() {
int n, x, y;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
scanf("%lld", &a[i][j]);
if (a[i][j] == 0) x = i, y = j;
}
if (n == 1) {
printf("1");
return 0;
}
int ax = 1;
while (ax == x) ax++;
long long sum = 0;
for (int i = 1; i <= n; i++) sum += a[ax][i];
long long tmp = 0;
for (int i = 1; i <= n; i++) tmp += a[x][i];
a[x][y] = sum - tmp;
if (a[x][y] <= 0) {
printf("-1\n");
return 0;
}
for (int i = 1; i <= n; i++) {
tmp = 0;
for (int j = 1; j <= n; j++) tmp += a[i][j];
if (tmp != sum) {
printf("-1\n");
return 0;
}
}
for (int j = 1; j <= n; j++) {
tmp = 0;
for (int i = 1; i <= n; i++) tmp += a[i][j];
if (tmp != sum) {
printf("-1\n");
return 0;
}
}
tmp = 0;
for (int i = 1; i <= n; i++) tmp += a[i][i];
if (tmp != sum) {
printf("-1\n");
return 0;
}
tmp = 0;
for (int i = 1; i <= n; i++) tmp += a[i][n - i + 1];
if (tmp != sum) {
printf("-1\n");
return 0;
}
printf("%lld\n", a[x][y]);
}
| 2 |
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; }
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9+7)
int main(void) {
ll n, t; cin >> t >> n;
vector<P> a(n+1);
vll lens(n+2);
rep(i, n+1) {
if (i != n)
cin >> a[i].fi >> a[i].se;
else
a[i].fi = INF, a[i].se = INF + 1;
lens[i+1] = lens[i] + a[i].se - a[i].fi;
}
ll ret = 0;
rep(i, n) {
ll ng=i,ok=n;
while(ok-ng>1){
ll mid=(ok+ng)/2;
(a[i].fi+t<=a[mid].fi?ok:ng)=mid;
}
ll tmp =0;
tmp =lens[ng]-lens[i]+min(a[i].fi+t-a[ng].fi, a[ng].se - a[ng].fi);
chmax(ret, tmp);
}
cout << ret << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int sz = 100010;
const long long inf = 3e18;
long long x[sz], y[sz], z[sz];
long long ans_x, ans_y, ans_z;
int n;
bool tru(long long r) {
long long L[4], R[4];
int k, i;
for (k = 0; k < 4; k++) {
L[k] = -inf;
R[k] = inf;
}
for (k = 1; k <= n; k++) {
L[0] = max(L[0], x[k] + y[k] + z[k] - r);
R[0] = min(R[0], x[k] + y[k] + z[k] + r);
L[1] = max(L[1], -x[k] + y[k] + z[k] - r);
R[1] = min(R[1], -x[k] + y[k] + z[k] + r);
L[2] = max(L[2], x[k] - y[k] + z[k] - r);
R[2] = min(R[2], x[k] - y[k] + z[k] + r);
L[3] = max(L[3], x[k] + y[k] - z[k] - r);
R[3] = min(R[3], x[k] + y[k] - z[k] + r);
}
for (k = 0; k < 4; k++) {
if (L[k] > R[k]) return false;
}
for (i = 0; i < 2; i++) {
long long l[k], r[k];
for (k = 0; k < 4; k++) {
l[k] = L[k];
r[k] = R[k];
}
for (k = 1; k < 4; k++) {
if (abs(l[k]) % 2 != i) l[k]++;
if (abs(r[k]) % 2 != i) r[k]--;
}
l[0] = max(l[0], l[1] + l[2] + l[3]);
r[0] = min(r[0], r[1] + r[2] + r[3]);
if (abs(l[0]) % 2 != i) l[0]++;
if (abs(r[0]) % 2 != i) r[0]--;
if (l[0] > r[0]) continue;
if (l[1] > r[1]) continue;
if (l[2] > r[2]) continue;
if (l[3] > r[3]) continue;
if ((l[1] + l[2] + l[3]) > r[0] || (r[1] + r[2] + r[3]) < l[0]) continue;
long long s1 = l[1], s2 = l[2], s3 = l[3];
if (s1 + s2 + s3 < r[0]) {
s1 = min(r[1], l[0] - s2 - s3);
}
if (s1 + s2 + s3 < r[0]) {
s2 = min(r[2], l[0] - s1 - s3);
}
if (s1 + s2 + s3 < r[0]) {
s3 = min(r[3], l[0] - s1 - s2);
}
if (s1 + s2 + s3 >= l[0] && s1 + s2 + s3 <= r[0]) {
ans_x = (s2 + s3) / 2;
ans_y = (s1 + s3) / 2;
ans_z = (s1 + s2) / 2;
return true;
}
}
return false;
}
int main() {
int T, k;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (k = 1; k <= n; k++) scanf("%I64d%I64d%I64d", &x[k], &y[k], &z[k]);
long long L = 0, R = inf, M;
while (L <= R) {
M = (L + R) / 2;
if (tru(M))
R = M - 1;
else
L = M + 1;
}
tru(L);
printf("%I64d %I64d %I64d\n", ans_x, ans_y, ans_z);
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return (b == 0) ? a : gcd(b, a % b);
}
const unsigned int MOD = 1000000007;
long long int inf = 1000000000000000000;
template <class T>
T power(T a, long long int n) {
T res = 1;
while (n > 0) {
if (n % 2) res = (res * a);
a = (a * a), n = n / 2;
}
return (res);
}
unsigned int factorial(unsigned int n) {
if (n == 0) return 1;
return n * factorial(n - 1);
}
bool isprime(int n) {
if (n <= 1) return true;
for (int i = 2; i * i <= n; i++)
if (n % i == 0) return false;
return true;
}
inline long long int gcd(long long int a, long long int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
inline long long int lcm(long long int a, long long int b) {
return (a * b) / gcd(a, b);
}
int getsum(long long int n) {
int sum;
for (sum = 0; n > 0; sum += n % 10, n /= 10)
;
return sum;
}
void tobin(int n) {
int binaryNum[32];
int i = 0;
while (n > 0) {
binaryNum[i] = n % 2;
n = n / 2;
i++;
}
for (int j = i - 1; j >= 0; j--) cout << binaryNum[j];
}
long long int nCr(long long int n, long long int k) {
if (k > n) return 0;
long long int res = 1;
if (k > n - k) k = n - k;
for (int i = 0; i < k; i++) res *= (n - i), res /= (i + 1);
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n;
cin >> n;
long long int m = n * 2;
vector<long long int> arr(m + 1, 0);
;
for (long long int i = 1; i <= m; i++) cin >> arr[i];
long long int ans = 0;
for (int i = 1; i <= m; i += 2) {
long long int val = arr[i];
long long int index =
find(arr.begin() + i + 1, arr.end(), val) - arr.begin();
ans += index - i - 1;
arr.erase(arr.begin() + index);
arr.insert(arr.begin() + i, val);
}
cout << ans;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int a, x, y;
void ReadInput() { cin >> a >> x >> y; }
int main() {
ReadInput();
if (y <= 0 || x >= a || x <= -a || y % a == 0) {
cout << -1 << endl;
return 0;
}
int num = y / a;
int ted = num;
ted /= 5;
int T = ceil((double)a / 2);
if (num < 5) {
switch (num) {
case 0:
if (x > -T && x < T)
cout << ted * 7 + 1 << endl;
else
cout << -1 << endl;
return 0;
case 1:
if (x > -T && x < T)
cout << ted * 7 + 2 << endl;
else
cout << -1 << endl;
return 0;
case 2:
if (x > -1 * a && x < 0)
cout << ted * 7 + 3 << endl;
else if (x > 0 && x < a)
cout << ted * 7 + 4 << endl;
else
cout << -1 << endl;
return 0;
case 3:
if (x > -T && x < T)
cout << ted * 7 + 5 << endl;
else
cout << -1 << endl;
return 0;
case 4:
if (x > -1 * a && x < 0)
cout << ted * 7 + 6 << endl;
else if (x > 0 && x < a)
cout << ted * 7 + 7 << endl;
else
cout << -1 << endl;
return 0;
}
}
num -= 5;
ted = num;
ted /= 2;
num %= 2;
switch (num) {
case 0:
if (x > -T && x < T)
cout << ted * 3 + 1 + 7 << endl;
else
cout << -1 << endl;
return 0;
case 1:
if (x > -1 * a && x < 0)
cout << ted * 3 + 2 + 7 << endl;
else if (x > 0 && x < a)
cout << ted * 3 + 3 + 7 << endl;
else
cout << -1 << endl;
return 0;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
char trump;
string first;
string second;
int main() {
std::cin >> trump;
cin >> first >> second;
char no1 = first[0];
char no2 = second[0];
char suit1 = first[1];
char suit2 = second[1];
unordered_map<char, int> suitss;
suitss['6'] = 6;
suitss['7'] = 7;
suitss['8'] = 8;
suitss['9'] = 9;
suitss['T'] = 101;
suitss['J'] = 102;
suitss['Q'] = 103;
suitss['K'] = 104;
suitss['A'] = 105;
if (suit1 == trump) {
if (suit2 == trump) {
if (suitss[no1] > suitss[no2]) {
cout << "YES";
return 0;
} else {
cout << "NO";
return 0;
}
} else {
cout << "YES";
return 0;
}
} else {
if (suit1 == suit2) {
if (suitss[no1] > suitss[no2]) {
cout << "YES";
return 0;
} else {
cout << "NO";
return 0;
}
}
}
cout << "NO";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int N = 323456;
int he[N], ne[N], ss[N], ff[N];
long long lw[N], rw[N], d[N], ans[N];
int n, m;
bool gpath(int s1, int s2, int f0, int d1, int d2) {
for (int i = 0; i < m; i++) ans[i] = rw[i];
if (s1 == s2) {
return d1 < d2;
}
for (int i = 0; i < n; i++) d[i] = INF;
d[s1] = d1;
d[s2] = d2;
set<pair<long long, int> > q;
q.insert(make_pair(d[s1], s1));
q.insert(make_pair(d[s2], s2));
while (!q.empty()) {
pair<long long, int> st = *(q.begin());
q.erase(q.begin());
int v = st.second;
if (d[v] != st.first) continue;
for (int e = he[v]; e >= 0; e = ne[e]) {
long long cw = ((d1 & 1) == (d[v] & 1) ? lw[e] : rw[e]);
if (d[ff[e]] > d[v] + cw) {
q.erase(make_pair(d[ff[e]], ff[e]));
d[ff[e]] = d[v] + cw;
q.insert(make_pair(d[ff[e]], ff[e]));
ans[e] = cw;
}
}
}
if ((d1 & 1) == (d[f0] & 1)) return true;
return false;
}
int main() {
int k, s1, s2, f0;
scanf("%d%d%d%d%d%d", &n, &m, &k, &s1, &s2, &f0);
--s1;
--s2;
--f0;
for (int i = 0; i < m; i++) {
scanf("%d%d%I64d", ss + i, ff + i, lw + i);
rw[i] = lw[i];
--ss[i];
--ff[i];
}
for (int i = m; i < m + k; i++) {
scanf("%d%d%I64d%I64d", ss + i, ff + i, lw + i, rw + i);
--ss[i];
--ff[i];
}
m += k;
for (int i = 0; i < m; i++) {
lw[i] *= 2;
rw[i] *= 2;
}
for (int i = 0; i < n; i++) he[i] = -1;
for (int i = 0; i < m; i++) {
ne[i] = he[ss[i]];
he[ss[i]] = i;
}
if (gpath(s1, s2, f0, 1, 0)) {
puts("WIN");
for (int i = m - k; i < m; i++) {
if (i > m - k) putchar(' ');
printf("%I64d", (ans[i] / 2));
}
puts("");
return 0;
}
if (gpath(s1, s2, f0, 0, 1)) {
puts("DRAW");
for (int i = m - k; i < m; i++) {
if (i > m - k) putchar(' ');
printf("%I64d", (ans[i] / 2));
}
puts("");
return 0;
}
puts("LOSE");
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1000000007;
string x;
long long pow(int k) {
if (k == 0) return 1;
long long res = pow(k / 2);
res = (res * res) % M;
if (k & 1) res = (res * 2) % M;
return res;
}
void solve() {
int n = x.size();
long long ans = 0;
for (int i = 0; i < (n); ++i)
if (x[i] == '1') ans = (ans + pow(2 * n - (i + 1) - 1)) % M;
cout << ans << endl;
}
int main() {
cin >> x;
solve();
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin,s);
for(int i=0;i<s.size();i++){
if(s[i]=='A'&&s[i+1]=='C'){
cout<<"Yes";
return 0;
}
}
cout<<"No";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[20];
int x[4][4];
int check_mag() {
int sm = 0;
for (int i = 0; i < n; ++i) {
sm += x[0][i];
}
int flg = 0;
for (int i = 0; i < n; ++i) {
int cur = 0;
for (int j = 0; j < n; ++j) {
cur += x[j][i];
}
if (cur != sm) return 0;
cur = 0;
for (int j = 0; j < n; ++j) {
cur += x[i][j];
}
if (cur != sm) return 0;
}
int cur1 = 0, cur2 = 0;
for (int i = 0; i < n; ++i) cur1 += x[i][i], cur2 += x[i][n - 1 - i];
if ((cur1 != sm) || (cur2 != sm)) return 0;
return 1;
}
pair<int, int> order[] = {
make_pair(0, 0), make_pair(0, 1), make_pair(0, 2), make_pair(0, 3),
make_pair(1, 0), make_pair(2, 0), make_pair(3, 0), make_pair(2, 1),
make_pair(1, 2), make_pair(2, 2), make_pair(2, 3), make_pair(3, 2),
make_pair(1, 1), make_pair(1, 3), make_pair(3, 1), make_pair(3, 3)};
void init() {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
x[i][j] = a[n * i + j];
}
}
}
multiset<int> used;
int find_num(int ps) {
int tx = order[ps].first;
int ty = order[ps].second;
int glob_sum = 0;
for (int i = 0; i < 4; ++i) {
glob_sum += x[0][i];
}
int cnt = 0;
int sum = 0;
for (int i = 0; i < 4; ++i) {
if (x[tx][i] != -1000000000) {
++cnt;
sum += x[tx][i];
}
}
vector<int> possible;
if (cnt == 3 && ps != 3) {
possible.push_back(glob_sum - sum);
}
cnt = 0;
sum = 0;
for (int i = 0; i < 4; ++i) {
if (x[i][ty] != -1000000000) {
++cnt;
sum += x[i][ty];
}
}
if (cnt == 3 && ps != 3) {
possible.push_back(glob_sum - sum);
}
if (tx == ty) {
cnt = 0;
sum = 0;
for (int i = 0; i < 4; ++i) {
if (x[i][i] != -1000000000) {
++cnt;
sum += x[i][i];
}
}
if (cnt == 3 && ps != 3) {
possible.push_back(glob_sum - sum);
}
}
if (tx + ty == 3) {
cnt = 0;
sum = 0;
for (int i = 0; i < 4; ++i) {
if (x[i][3 - i] != -1000000000) {
++cnt;
sum += x[i][3 - i];
}
}
if (cnt == 3 && ps != 3) {
possible.push_back(glob_sum - sum);
}
}
if (possible.size() == 0) return -1000000000;
sort(possible.begin(), possible.end());
if (possible[0] != possible.back()) return -1000000000;
return possible[0];
}
int gl_sum = 0;
void rec(int ps) {
if (ps == 4) {
int tk = 0;
for (int i = 0; i < 4; ++i) {
tk += x[0][i];
}
if (tk != gl_sum) {
return;
}
}
if (ps == 16) {
if (!check_mag()) return;
int sum = 0;
for (int i = 0; i < 4; ++i) {
sum += x[0][i];
}
printf("%d\n", sum);
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
printf("%d ", x[i][j]);
}
printf("\n");
}
exit(0);
}
int ok = find_num(ps);
if (ok == -1000000000) {
set<int> cp;
for (multiset<int>::iterator it = used.begin(); it != used.end(); ++it) {
cp.insert(*it);
}
for (set<int>::iterator it = cp.begin(); it != cp.end(); ++it) {
x[order[ps].first][order[ps].second] = *it;
used.erase(used.find(*it));
rec(ps + 1);
x[order[ps].first][order[ps].second] = -1000000000;
used.insert(*it);
}
} else {
if (used.find(ok) != used.end()) {
used.erase(used.find(ok));
x[order[ps].first][order[ps].second] = ok;
rec(ps + 1);
x[order[ps].first][order[ps].second] = -1000000000;
used.insert(ok);
} else {
return;
}
}
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n * n; ++i) {
scanf("%d", &a[i]);
}
sort(a, a + n * n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
x[i][j] = -1000000000;
}
}
if (n <= 3) {
do {
init();
if (check_mag()) {
int sm = 0;
for (int i = 0; i < n; ++i) {
sm += x[i][i];
}
printf("%d\n", sm);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
printf("%d ", x[i][j]);
}
printf("\n");
}
return 0;
}
} while (next_permutation(a, a + n * n));
}
for (int i = 0; i < n * n; ++i) {
used.insert(a[i]);
gl_sum += a[i];
}
gl_sum /= 4;
rec(0);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll a, b, c, d;
vector<ll> arr(4);
for (int i = 0; i < 4; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
a = arr[0] + arr[1] - arr[2];
a /= 2;
b = arr[1] + arr[2] - arr[0];
b /= 2;
c = arr[0] + arr[2] - arr[1];
c /= 2;
cout << a << " " << b << " " << c;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long n, i, a[200005], t, ans;
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0) t++;
}
for (i = 0; i < n; i++) {
if (a[i] == 1)
ans = ans + t;
else
t--;
}
cout << ans;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int a[101], b[101];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
map<vector<int>, int> mp;
for (int mask = 0; mask < (1 << 15); mask++) {
for (int i = 0; i < n; i++) {
b[i] = a[i] ^ mask;
int s = 0;
for (int c = 0; c < 15; c++) s += ((b[i] & (1 << c)) > 0);
b[i] = s;
}
vector<int> s;
for (int i = 0; i < n; i++) s.push_back(b[0] - b[i]);
mp[s] = mask;
}
for (int mask = 0; mask < (1 << 15); mask++) {
for (int i = 0; i < n; i++) {
b[i] = a[i] ^ (mask << 15);
int s = 0;
for (int c = 15; c <= 30; c++) s += ((b[i] & (1 << c)) > 0);
b[i] = s;
}
vector<int> s;
for (int i = 0; i < n; i++) s.push_back(b[i] - b[0]);
if (mp.count(s)) {
cout << mp[s] + (mask << 15);
return 0;
}
}
cout << -1;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,i,k,s;
cin>>n>>k>>s;
for(i=1;i<=k;i++){
cout<<s<<" ";
}
if(s==1000000000){
s=1;
}
else{
s=s+1;
}
for(i=k+1;i<=n;i++){
cout<<s<<" ";
}
}
| 0 |
#include <bits/stdc++.h>
struct disjoin_set_union {
std::vector<int> parent;
std::vector<int> rank;
disjoin_set_union(int n = 0) : parent(n), rank(n, 1) {
std::iota(parent.begin(), parent.end(), 0);
}
int root(int v) { return (v ^ parent[v]) ? parent[v] = root(parent[v]) : v; }
bool unite(int v, int u) {
v = root(v), u = root(u);
if (v == u) return false;
if (rank[v] < rank[u]) std::swap(v, u);
rank[v] += rank[u];
parent[u] = v;
return true;
}
};
struct link_cut {
struct node {
int parent;
std::array<int, 2> sons;
bool inv;
int size;
int value, tot;
node()
: parent(-1), sons({-1, -1}), inv(false), size(1), value(0), tot(0) {}
};
std::vector<node> tree;
void push(int v) {
if (tree[v].inv) {
tree[v].inv = false;
std::swap(tree[v].sons[0], tree[v].sons[1]);
for (const auto u : tree[v].sons)
if (u != -1) tree[u].inv ^= 1;
}
}
void relax(int v) {
push(v);
tree[v].size = 1;
for (const auto x : tree[v].sons)
if (x != -1) tree[v].size += tree[x].size;
tree[v].tot = tree[v].value;
for (const auto x : tree[v].sons)
if (x != -1) tree[v].tot ^= tree[x].tot;
}
void rotate(int v) {
int u = tree[v].parent, w = tree[u].parent;
push(u), push(v);
tree[v].parent = w;
if (w != -1)
for (auto &x : tree[w].sons)
if (x == u) x = v;
int i = tree[u].sons[1] == v;
tree[u].sons[i] = tree[v].sons[i ^ 1];
if (tree[v].sons[i ^ 1] != -1) tree[tree[v].sons[i ^ 1]].parent = u;
tree[v].sons[i ^ 1] = u;
tree[u].parent = v;
relax(u), relax(v);
}
bool is_root(int v) {
return tree[v].parent == -1 || (tree[tree[v].parent].sons[0] != v &&
tree[tree[v].parent].sons[1] != v);
}
void splay(int v) {
while (!is_root(v)) {
int u = tree[v].parent;
if (!is_root(u))
rotate((tree[tree[u].parent].sons[0] == u) == (tree[u].sons[0] == v)
? u
: v);
rotate(v);
}
push(v);
}
void expose(int v) {
for (int u = v, prev = -1; u != -1; prev = u, u = tree[u].parent) {
splay(u);
tree[u].sons[1] = prev;
relax(u);
}
splay(v);
assert(tree[v].sons[1] == -1 && tree[v].parent == -1);
}
link_cut(int n = 0) : tree(n) {}
int add() {
tree.push_back(node());
return int(tree.size()) - 1;
}
void set_root(int root) {
expose(root);
tree[root].inv ^= 1;
}
bool connected(int v, int u) {
if (v == u) return true;
expose(v), expose(u);
return tree[v].parent != -1;
}
bool link(int v, int u) {
if (connected(v, u)) return false;
tree[u].inv ^= 1;
tree[u].parent = v;
expose(u);
return true;
}
bool cut(int v, int u) {
if (v == u) return false;
set_root(v), expose(u);
if (tree[u].sons[0] != v) return false;
tree[u].sons[0] = -1;
relax(u);
tree[v].parent = -1;
return true;
}
int parent(int v, int root) {
if (!connected(v, root)) return -1;
set_root(root), expose(v);
push(v);
if (tree[v].sons[0] == -1) return -1;
v = tree[v].sons[0];
while (push(v), tree[v].sons[1] != -1) v = tree[v].sons[1];
splay(v);
return v;
}
int distance(int v, int u) {
if (!connected(v, u)) return -1;
set_root(v), expose(u);
return tree[u].sons[0] == -1 ? 0 : tree[tree[u].sons[0]].size;
}
void update(int v, int value) {
splay(v);
tree[v].value = value;
relax(v);
}
int query(int v, int u) {
assert(v != u);
set_root(v), expose(u);
assert(tree[u].sons[0] != -1);
return tree[u].value ^ tree[tree[u].sons[0]].tot;
}
};
int main() {
using namespace std;
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, m;
cin >> n >> m;
disjoin_set_union dsu(n);
link_cut g(n + m);
for (int id = n; id < n + m; id++) {
int v, u, c;
cin >> v >> u >> c;
v--, u--;
if (dsu.root(v) != dsu.root(u)) {
cout << "YES\n";
dsu.unite(v, u);
g.link(v, id);
g.link(u, id);
g.update(id, c);
} else {
if (!g.connected(v, u) || (g.query(v, u) ^ c) == 0) {
cout << "NO\n";
continue;
}
cout << "YES\n";
while (u != v) {
int w = g.parent(u, v);
g.cut(u, w);
u = w;
}
}
}
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, i, x, y = 0, j, ans = 0;
cin >> n;
map<long long int, long long int> l, r;
pair<long long int, long long int> p;
map<pair<long long int, long long int>, long long int> xtra;
for (i = 0; i < n; ++i) {
cin >> p.first >> p.second;
l[p.first]++;
r[p.second]++;
xtra[p]++;
}
for (auto j = l.begin(); j != l.end(); ++j)
x = j->second, ans += (x * (x - 1)) / 2;
for (auto j = r.begin(); j != r.end(); ++j)
x = j->second, ans += (x * (x - 1)) / 2;
for (auto j = xtra.begin(); j != xtra.end(); ++j)
x = j->second, ans -= (x * (x - 1)) / 2;
cout << ans;
return 0;
}
| 1 |
#include <algorithm>
#include <iostream>
#include <string>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,k;
string s;
cin>>n>>k>>s;
int ans=2*k;
rep(i,n-1) if(s[i]==s[i+1]) ans++;
cout<<min(ans,n-1)<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <set>
#define N 200005
using namespace std;
typedef long long ll;
ll n, ans, l, r, a[N];
set<ll> s;
int main()
{
ll i, t;
cin >> n;
for (i = 1; i <= n; i++) scanf("%lld", &t), a[t] = i;
s.insert(0), s.insert(n + 1);
for (i = 1; i <= n; i++) {
l = *--s.lower_bound(a[i]);
r = *s.lower_bound(a[i]);
ans += (a[i] - l) * (r - a[i]) * i;
s.insert(a[i]);
}
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
int change(char c) {
if ('a' <= c && c <= 'z') {
return (c - 'a');
}
}
long long dp[100000][26]; //ｊ番目までの星で、入り口がiの星へのアクセスは何通りか
int main() {
int N;
cin >> N;
string s,t;
cin >> s >> t;
for (int j = 0; j < N; j++) {
if (j == 0) {
for (int i = 0; i < 26; i++) {
if (change(s[0]) == i) {
dp[0][i] = 1;
}
else {
dp[0][i] = 0;
}
}
}
else {
for (int i = 0; i < 26; i++) {
dp[j][i] = dp[j - 1][i]%1000000007;
}
dp[j][change(s[j])] = (dp[j][change(s[j])]+dp[j - 1][change(t[j])])%1000000007;
}
}
cout << dp[N-2][change(t[N-1])] << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = LONG_LONG_MAX;
const long long NINF = LONG_LONG_MIN;
const long long mmod = 998244353;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, q;
cin >> n >> q;
long long a[n];
for (long long& x : a) cin >> x;
long long mx = 0;
for (long long x : a) mx = max(x, mx);
vector<pair<long long, long long>> ans;
list<long long> dq;
for (long long x : a) dq.push_back(x);
while (dq.front() != mx) {
auto it = dq.begin();
ans.emplace_back(*it, *(next(it)));
long long aa = dq.front();
dq.pop_front();
long long bb = dq.front();
dq.pop_front();
if (aa > bb) {
dq.push_front(aa);
dq.push_back(bb);
} else {
dq.push_front(bb);
dq.push_back(aa);
}
}
vector<long long> remaining;
auto it = dq.begin();
it++;
while (it != dq.end()) remaining.push_back(*it++);
while (q-- > 0) {
long long m;
cin >> m;
if (m <= (long long)ans.size()) {
cout << ans[m - 1].first << ' ' << ans[m - 1].second << endl;
} else {
cout << mx << ' ' << remaining[(m - (long long)ans.size() - 1) % (n - 1)]
<< endl;
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> a) {
return o << a.first << ' ' << a.second;
}
template <typename A, typename B>
istream& operator>>(istream& o, pair<A, B>& a) {
return o >> a.first >> a.second;
}
const int mod = 1e9 + 7, abc = 864197532, N = 300087, K = 111;
long long int modpow(long long int a, int b) {
long long int ans = 1;
for (; b; b >>= 1, a = a * a % mod) {
if (b & 1) ans = ans * a % mod;
}
return ans;
}
long long int inter(vector<long long int> l, vector<long long int> r) {
long long int ll = *max_element(l.begin(), l.end()),
rr = *min_element(r.begin(), r.end());
if (ll <= rr) return rr - ll + 1;
return 0;
}
void add(long long int& a, long long int b) {
a += b;
if (a >= mod) a -= mod;
}
void del(long long int& a, long long int b) {
a -= b;
if (a < 0) a += mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long int> l(n), r(n), sz(n), inv(n);
for (int i = 0; i < n; ++i) cin >> l[i];
long long int al = 1;
for (int i = 0; i < n; ++i) {
cin >> r[i];
sz[i] = r[i] - l[i] + 1;
al = al * sz[i] % mod;
inv[i] = modpow(sz[i], mod - 2);
}
long long int square = 0, sum = 0;
for (int i = 0; i + 1 < n; ++i) {
add(sum, inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * al % mod * inv[i] %
mod * inv[i + 1] % mod);
}
square = sum;
for (int i = 0; i + 2 < n; ++i) {
add(square, inter({l[i], l[i + 1], l[i + 2]}, {r[i], r[i + 1], r[i + 2]}) *
al % mod * inv[i] % mod * inv[i + 1] % mod * inv[i + 2] %
mod * 2 % mod);
}
long long int now = 0;
for (int i = 0; i + 1 < n; ++i)
add(now, inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * inv[i] % mod *
inv[i + 1] % mod);
for (int i = 0; i + 1 < n; ++i) {
if (i - 1 >= 0)
del(now, inter({l[i - 1], l[i]}, {r[i - 1], r[i]}) * inv[i - 1] % mod *
inv[i] % mod);
del(now, inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * inv[i] % mod *
inv[i + 1] % mod);
if (i + 1 < n)
del(now, inter({l[i + 1], l[i + 2]}, {r[i + 1], r[i + 2]}) * inv[i + 1] %
mod * inv[i + 2] % mod);
add(square, now * inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) % mod * inv[i] %
mod * inv[i + 1] % mod * al % mod);
if (i - 1 >= 0)
add(now, inter({l[i - 1], l[i]}, {r[i - 1], r[i]}) * inv[i - 1] % mod *
inv[i] % mod);
add(now, inter({l[i], l[i + 1]}, {r[i], r[i + 1]}) * inv[i] % mod *
inv[i + 1] % mod);
if (i + 1 < n)
add(now, inter({l[i + 1], l[i + 2]}, {r[i + 1], r[i + 2]}) * inv[i + 1] %
mod * inv[i + 2] % mod);
}
cout << ((square + mod - sum * n * 2 % mod) * modpow(al, mod - 2) +
1ll * n * n) %
mod;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int T[2000];
const int M = 500;
int m, t, r;
void odpal(int start) {
for (int i = start; i < start + t; i++) {
T[i]++;
}
}
int main() {
cin >> m >> t >> r;
vector<int> gh;
gh.resize(m);
for (int i = 0; i < m; i++) cin >> gh[i];
if (t < r) {
cout << "-1\n";
return 0;
}
int res = 0;
for (int i = 0; i < m; i++) {
int c = gh[i];
if (T[c + M] >= r) continue;
int ile = r - T[c + M];
res += ile;
for (int i = c + M - ile + 1; i <= c + M; i++) odpal(i);
}
cout << res << "\n";
return 0;
}
| 3 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#define MAXN 710
int G[MAXN][MAXN], vis[MAXN], n, m;
std::vector<std::pair<int, int>> V;
int c1, c2;
void dfs(int x, int color) {
(color == 1 ? c1 : c2)++;
vis[x] = color;
for (int y = 1; y <= n; y++)
if (y != x && !G[x][y]) {
if (!vis[y])
dfs(y, 3 - color);
else if (vis[x] == vis[y])
puts("-1"), exit(0);
}
}
std::bitset<MAXN> f;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1, u, v; i <= m; i++) {
scanf("%d%d", &u, &v);
G[u][v] = G[v][u] = 1;
}
for (int i = 1; i <= n; i++)
if (!vis[i]) {
c1 = c2 = 0;
dfs(i, 1);
V.emplace_back(c1, c2);
}
f.set(0);
for (auto x : V) f = (f << x.first) | (f << x.second);
int ans = ~(0U) >> 1;
for (int i = 0; i <= n; i++) {
if (f[i]) {
int tmp = i * (i - 1) / 2 + (n - i) * (n - i - 1) / 2;
ans = std::min(ans, tmp);
}
}
printf("%d\n", ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
string s;
cin >> s;
cout << !(s[a - 1] == s[b - 1]);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n, m, f[N], sz[N];
bool g[N], ans[N];
vector<pair<int, int> > e[N], d[N];
struct Q {
int u, v, tim;
bool operator<(const Q &t) const {
if (u != t.u) return u < t.u;
if (v != t.v) return v < t.v;
return tim < t.tim;
}
} q[N];
void ins(int o, int L, int R, int st, int ed, int a, int b) {
if (st <= L && R <= ed) {
e[o].push_back(make_pair(a, b));
return;
}
if (st <= ((L + R) >> 1)) ins((o << 1), L, ((L + R) >> 1), st, ed, a, b);
if (((L + R) >> 1) < ed)
ins((o << 1 | 1), ((L + R) >> 1) + 1, R, st, ed, a, b);
}
pair<int, int> F(int x) {
if (!f[x]) return make_pair(x, 0);
pair<int, int> tmp = F(f[x]);
tmp.second ^= g[x];
return tmp;
}
void dfs(int o, int L, int R, bool flag) {
for (int i = 0; i < e[o].size(); ++i) {
pair<int, int> u = F(e[o][i].first), v = F(e[o][i].second);
int u1 = u.first, u2 = u.second, v1 = v.first, v2 = v.second;
if (u1 == v1) {
if (u2 == v2) flag = false;
} else {
if (sz[u1] < sz[v1]) {
swap(u1, v1);
swap(u2, v2);
}
sz[u1] += sz[v1];
f[v1] = u1;
g[v1] = u2 ^ v2 ^ 1;
d[o].push_back(make_pair(u1, v1));
}
}
if (L == R)
ans[L] = flag;
else {
dfs((o << 1), L, ((L + R) >> 1), flag);
dfs((o << 1 | 1), ((L + R) >> 1) + 1, R, flag);
}
for (int i = d[o].size() - 1; ~i; --i) {
int u = d[o][i].first, v = d[o][i].second;
sz[u] -= sz[v];
f[v] = g[v] = 0;
}
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> q[i].u >> q[i].v;
q[i].tim = i;
}
sort(q + 1, q + m + 1);
for (int i = 1; i <= m; ++i) {
if (q[i].u == q[i + 1].u && q[i].v == q[i + 1].v) {
ins(1, 1, m, q[i].tim, q[i + 1].tim - 1, q[i].u, q[i].v);
++i;
} else
ins(1, 1, m, q[i].tim, m, q[i].u, q[i].v);
}
for (int i = 1; i <= n; ++i) sz[i] = 1;
dfs(1, 1, m, true);
for (int i = 1; i <= m; ++i)
if (ans[i])
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, x, y, b, a, temp;
cin >> n >> b >> a;
temp = a;
long long int c[n];
for (i = 0; i < n; i++) cin >> c[i];
for (i = 0; i < n; i++) {
if (c[i] == 0 && a != 0)
a--;
else {
if (b > 0 && c[i] == 1) {
if (a < temp) {
a++;
b--;
} else {
a--;
}
} else {
if (b > 0 && c[i] == 0)
b--;
else {
if (b == 0) a--;
}
}
}
if (b == 0 && a == 0) break;
}
if (i == n)
cout << i;
else
cout << i + 1;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
char s[105][105][105];
int a[105][105][105];
int h, n, m;
int main() {
int i, j, k, u, v;
scanf("%d%d%d", &h, &n, &m);
for (k = 1; k <= h; k++) {
for (i = 1; i <= n; i++) scanf("%s", s[k][i] + 1);
}
for (k = 1; k <= h; k++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) a[k][i][j] = s[k][i][j] - '0';
}
}
int ans = 0;
for (i = 1; i <= h; i++)
for (j = 1; j <= n; j++)
for (k = 1; k <= m; k++)
if (a[i][j][k])
ans += a[i - 1][j][k] &&
(a[i + 1][j][k] || a[i][j + 1][k] && !a[i - 1][j + 1][k] ||
a[i][j][k + 1] && !a[i - 1][j][k + 1]) ||
a[i][j - 1][k] &&
(a[i][j + 1][k] || a[i + 1][j][k] && !a[i + 1][j - 1][k] ||
a[i][j][k + 1] && !a[i][j - 1][k + 1]) ||
a[i][j][k - 1] &&
(a[i][j][k + 1] || a[i][j + 1][k] && !a[i][j + 1][k - 1] ||
a[i + 1][j][k] && !a[i + 1][j][k - 1]);
printf("%d\n", ans);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int SIZE = 100005;
int gap, tmp[SIZE * 2];
class SuffixArray {
public:
int sa[SIZE], rk[SIZE], ht[SIZE];
static bool cmp(int x, int y) {
if (tmp[x] != tmp[y]) return tmp[x] < tmp[y];
return tmp[x + gap] < tmp[y + gap];
}
void gao(const char* s, int n) {
copy(s, s + n + 1, rk);
for (gap = 1; gap <= n; gap <<= 1) {
for (int i = 0; i <= n; i++) sa[i] = i;
copy(rk, rk + n + 1, tmp);
sort(sa, sa + n + 1, cmp);
for (int i = rk[*sa] = 0; i < n; i++)
rk[sa[i + 1]] = rk[sa[i]] + cmp(sa[i], sa[i + 1]);
}
for (int i = gap = ht[*sa] = 0; i < n; i++) {
if (gap) --gap;
while (s[i + gap] == s[sa[rk[i] - 1] + gap]) gap++;
ht[rk[i]] = gap;
}
}
};
char str[SIZE];
SuffixArray SA;
int main() {
int n = strlen(gets(str));
long long ans = n * (n + 1ll) / 2, cnt = 0;
SA.gao(str, n);
vector<int> u = {0};
for (int i = 1; i <= n; i++) {
while (SA.ht[i] < SA.ht[u.back()]) {
cnt -= SA.ht[u.back()] * (u.back() - u[u.size() - 2]);
u.pop_back();
}
u.push_back(i);
cnt += SA.ht[u.back()] * (u.back() - u[u.size() - 2]);
ans += cnt;
}
printf("%I64d\n", ans);
}
| 4 |
#include <bits/stdc++.h>
const int maxn = 100005;
int n, m, a[maxn], pos[maxn];
std::pair<int, int> b[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
b[i] = std::make_pair(a[i], i);
}
std::sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i) pos[b[i].second] = i;
int ans = 0, r = 0;
for (int i = 1; i <= n; ++i) {
if (i > r) ans++;
r = std::max(r, pos[i]);
}
printf("%d\n", ans);
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
bool win[1005][1005] = {};
int main() {
srand((unsigned int)time(NULL));
int n, k;
cin >> n >> k;
if (n * k > n * (n - 1) / 2) {
cout << -1 << endl;
return 0;
}
printf("%d\n", n * k);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= i + k; j++) {
int x = j;
if (j > n) x -= n;
printf("%d %d\n", i, x);
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[102], n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 1; i < n - 1; i++)
if (a[i] == 0 && a[i + 1] == 1 && a[i - 1] == 1) ans++, a[i + 1] = 0;
cout << ans << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 5;
int seg[N], ans[N];
vector<pair<int, int> > beg[N], fin[N];
set<pair<int, int> > pending;
set<pair<int, int> >::iterator it1, it2;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> seg[i];
for (int q = 0; q < m; q++) {
int l, r, x;
cin >> l >> r >> x;
beg[l].emplace_back(x, q);
fin[r].emplace_back(x, q);
}
for (int i = 1; i <= n; i++) {
for (pair<int, int> xq : beg[i]) pending.insert(xq);
it2 = pending.lower_bound(make_pair(seg[i], 0));
it1 = pending.begin();
while (it1 != it2) {
ans[it1->second] = i;
pending.erase(it1++);
}
it1 = pending.lower_bound(make_pair(seg[i] + 1, 0));
while (it1 != pending.end()) {
ans[it1->second] = i;
pending.erase(it1++);
}
for (pair<int, int> xq : fin[i])
if ((it1 = pending.find(xq)) != pending.end()) {
ans[xq.second] = -1;
pending.erase(it1);
}
}
for (int q = 0; q < m; q++) cout << ans[q] << '\n';
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
int n, h, l, r, dp[2222][2222], a[2222];
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> h >> l >> r;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < h; i++)
for (int j = 0; j <= n; j++) dp[j][i] = -1e9;
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < h; j++) {
int x = j + a[i];
if (x >= h) x -= h;
dp[i + 1][x] = max(dp[i + 1][x], dp[i][j] + (l <= x && x <= r));
int y = j + a[i] - 1;
if (y >= h) y -= h;
dp[i + 1][y] = max(dp[i + 1][y], dp[i][j] + (l <= y && y <= r));
}
}
cout << *max_element(dp[n], dp[n] + h);
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
class UnionFind{
private:
std::vector<int_fast32_t> par;
size_t n;
public:
UnionFind(){}
UnionFind(size_t n):n(n){
par.resize(n, -1);
}
uint_fast32_t find(uint_fast32_t x){
return par[x] < 0 ? x : par[x] = find(par[x]);
}
size_t size(uint_fast32_t x){
return -par[find(x)];
}
void unite(uint_fast32_t x, uint_fast32_t y){
x = find(x);
y = find(y);
if(x == y) return;
if(size(x) < size(y)) std::swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool same(uint_fast32_t x, uint_fast32_t y){
return find(x) == find(y);
}
};
int32 N, M, K;
int32 c[112345];
UnionFind uf;
int32 club(int32 x){
return c[uf.find(x)];
}
int main(void){
memset(c, -1, sizeof c);
cin >> N >> M >> K;
uf = UnionFind(N);
REP(i, K){
int32 t, a, b;
cin >> t >> a >> b; a--; b--;
if(t == 1){
if(club(a) == -1 || club(b) == -1 || club(a) == club(b)){
if(club(a) == -1) c[a] = club(b);
else c[b] = club(a);
uf.unite(a, b);
}else{
cout << i+1 << endl;
return 0;
}
}else{
if(club(a) != -1 && club(a) != b){
cout << i+1 << endl;
return 0;
}
c[uf.find(a)] = b;
}
}
cout << 0 << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct range {
int l, r, value;
};
int n, m;
int a[200000];
vector<range> levels[7009];
void ReadData() { scanf("%d %d", &n, &m); }
void add() {
int level;
range current;
scanf("%d %d %d %d", &level, ¤t.l, ¤t.r, ¤t.value);
levels[level].push_back(current);
}
set<int> answer;
void show() {
answer.clear();
int level, pos;
scanf("%d %d", &level, &pos);
int l = pos, r = pos;
for (; level <= n; level++) {
for (vector<range>::iterator it = levels[level].begin();
it != levels[level].end(); it++) {
if (r >= it->l && l <= it->r) {
answer.insert(it->value);
}
}
l = a[l];
r = (r & (r - 1)) == 0 ? a[r] + 1 : a[r];
}
printf("%d\n", answer.size());
}
void Solve() {
for (int T = 0; T < m; T++) {
int queryType;
scanf("%d", &queryType);
if (queryType == 1) {
add();
} else if (queryType == 2) {
show();
}
}
}
void WriteData() { printf("\n"); }
int main() {
int current = 1;
for (int i = 1; i <= 198000; i++) {
a[i] = current;
current++;
if ((i & (i - 1)) == 0) {
current++;
}
}
int QWE;
QWE = 1;
for (int T = 0; T < QWE; T++) {
ReadData();
Solve();
WriteData();
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a = 0, b = 0, n, l, bef, aft = INT_MAX, curr, flag = 0, abef = 0,
aaval;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; cin >> v[i++])
;
for (int i = 1; i < n; i++) {
if (v[i] < v[i - 1]) {
if (flag == 1) {
cout << "no" << endl;
return 0;
}
flag = 1;
a = i - 1;
while (i < n && v[i] <= v[i - 1]) {
b = i;
i++;
}
}
}
if ((b + 1 < n && v[a] > v[b + 1]) || (a - 1 >= 0 && v[b] < v[a - 1])) {
cout << "no" << endl;
return 0;
}
cout << "yes" << endl << a + 1 << " " << b + 1 << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int p[N], c[N];
pair<int, int> ej[N];
vector<int> G[N];
int dfs(int u) {
for (int i = 0; i < G[u].size(); i++) {
if (G[u][i] == p[u]) continue;
p[G[u][i]] = u;
int cur = dfs(G[u][i]);
if (cur == -1 || cur != c[u]) return -1;
}
return c[u];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
ej[i] = pair<int, int>(a, b);
}
for (int i = 1; i <= n; i++) cin >> c[i];
int x = -1, y;
for (int i = 0; i < n - 1; i++)
if (c[ej[i].first] != c[ej[i].second]) {
x = ej[i].first;
y = ej[i].second;
break;
}
if (x == -1) {
cout << "YES" << endl << "1" << endl;
return 0;
}
bool ans = 1;
p[x] = -1;
for (int i = 0; i < G[x].size(); i++) {
p[G[x][i]] = x;
if (dfs(G[x][i]) == -1) {
ans = 0;
break;
}
}
if (ans) {
cout << "YES" << endl << x << endl;
return 0;
}
p[y] = -1;
ans = 1;
for (int i = 0; i < G[y].size(); i++) {
p[G[y][i]] = y;
if (dfs(G[y][i]) == -1) {
ans = 0;
break;
}
}
if (ans)
cout << "YES" << endl << y << endl;
else
cout << "NO" << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, y, u, v, i, j, flag = 0;
char ttt[11][11];
for (i = 0; i < 9; i++) {
for (j = 0; j < 9; j++) {
cin >> ttt[i][j];
}
}
cin >> x >> y;
u = ((x - 1) % 3) * 3;
v = ((y - 1) % 3) * 3;
for (i = u; i < u + 3; i++) {
for (j = v; j < v + 3; j++) {
if (ttt[i][j] == '.') {
ttt[i][j] = '!';
flag = 1;
}
}
}
if (!flag) {
for (i = 0; i < 9; i++) {
for (j = 0; j < 9; j++) {
if (ttt[i][j] == '.') {
ttt[i][j] = '!';
}
}
}
}
for (i = 0; i < 9; i++) {
for (j = 0; j < 9; j++) {
if (j != 0 && (j + 1) % 3 == 0)
cout << ttt[i][j] << " ";
else
cout << ttt[i][j];
}
if (i != 0 && (i + 1) % 3 == 0)
cout << "\n\n";
else
cout << "\n";
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
int sum = 0;
for (int i = e; i != f + 1; ++i)
if (i == (((i % a) % b) % c) % d) sum++;
cout << sum;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100500;
struct Tnode {
int l, r, lval, rval, mval, max, cover;
int len() { return r - l; }
int mid() { return ((l + r) >> 1); }
bool in(int ll, int rr) { return l >= ll && r <= rr; }
void lr(int ll, int rr) {
l = ll;
r = rr;
}
};
Tnode node[MAX << 2];
void Build(int t, int l, int r) {
node[t].lr(l, r);
node[t].lval = node[t].rval = node[t].mval = node[t].max = r - l;
if (node[t].len() == 1) return;
int mid = ((l + r) >> 1);
Build((t << 1), l, mid);
Build((t << 1 | 1), mid, r);
}
void Updata_val(int t) {
node[t].lval = node[(t << 1)].lval;
if (node[(t << 1)].lval == node[(t << 1)].len())
node[t].lval += node[(t << 1 | 1)].lval;
node[t].rval = node[(t << 1 | 1)].rval;
if (node[(t << 1 | 1)].rval == node[(t << 1 | 1)].len())
node[t].rval += node[(t << 1)].rval;
node[t].mval = node[(t << 1)].rval + node[(t << 1 | 1)].lval;
node[t].max = max(node[(t << 1)].max, node[(t << 1 | 1)].max);
node[t].max =
max(node[t].max, max(node[t].lval, max(node[t].rval, node[t].mval)));
}
void Updata(int t, int l, int r, int val) {
if (node[t].in(l, r)) {
node[t].lval = node[t].rval = node[t].mval = node[t].max =
(val ? 0 : node[t].len());
return;
}
if (node[t].len() == 1) return;
int mid = node[t].mid();
if (l < mid) Updata((t << 1), l, r, val);
if (r > mid) Updata((t << 1 | 1), l, r, val);
Updata_val(t);
}
void Query(int t, int len, int &pos) {
if (node[t].max == node[t].len() && node[t].max >= len) {
pos = node[t].l;
return;
}
if (node[t].max < len) return;
if (node[t].len() == 1) return;
if (node[(t << 1)].max >= len)
Query((t << 1), len, pos);
else if (node[t].mval >= len) {
pos = node[(t << 1)].r - node[(t << 1)].rval;
return;
} else if (node[(t << 1 | 1)].max >= len)
Query((t << 1 | 1), len, pos);
}
struct NODE {
int len, pos;
};
NODE a[110];
void T(int t) {
cout << node[t].l << ' ' << node[t].r << ' ' << node[t].max << endl;
if (node[t].len() == 1) return;
T((t << 1));
T((t << 1 | 1));
}
int main() {
int l, b, f, n, cnt, pos, op, len;
while (~scanf("%d%d%d", &l, &b, &f)) {
scanf("%d", &n);
Build(1, 0, l + b + f);
for (int i = (1); i < (n + 1); i++) {
scanf("%d%d", &op, &len);
if (op == 1) {
a[i].len = len;
pos = -1;
Query(1, len + b + f, pos);
if (pos == -1) {
puts("-1");
a[i].pos = -1;
} else {
printf("%d\n", pos);
a[i].pos = pos + b;
}
if (pos != -1) Updata(1, pos + b, pos + b + len, 1);
} else {
a[i].pos = -1;
pos = a[len].pos;
if (pos == -1) continue;
Updata(1, pos, pos + a[len].len, 0);
}
}
}
return 0;
}
| 4 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int,int> pii;
int main(){
int n, m, k;
cin >> n >> m >> k;
vector<pii> v[n+1];
vector<pair<pii,int>> vp;
for(int i = 0; i < m; i++){
int a, b, c;
cin >> a >> b >> c;
vp.push_back({{a,b},c});
v[a].push_back({b,c});
v[b].push_back({a,c});
}
for(int i = 0; i < k; i++){
int x; cin >> x;
v[0].push_back({x,0});
}
vector<int> dp(n+1, 1<<30);
dp[0] = 0;
priority_queue<pii> pq;
pq.push({-0, 0});
while(!pq.empty()){
pii p = pq.top(); pq.pop();
int pos = p.second, cost = -p.first;
if(dp[pos] != cost) continue;
for(pii q : v[pos]){
int next = q.first;
if(dp[next] > dp[pos]+q.second){
dp[next] = dp[pos]+q.second;
pq.push({-dp[next], next});
}
}
}
int ret = 0;
for(int i = 0; i < m; i++){
int a = vp[i].first.first, b = vp[i].first.second, c = vp[i].second;
ret = max(ret, (dp[a]+dp[b]+c+1)/2);
}
cout << ret << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<min(b/a,c)<<endl;
return(0);
}
| 0 |
#include<iostream>
using namespace std;
int a[3000000][2]={};//
void f(int z){
if(a[z*2][1]>=a[z*2+1][1]){
a[z][0]=a[z*2][0];
a[z][1]=a[z*2][1];
}else{
a[z][0]=a[z*2+1][0];
a[z][1]=a[z*2+1][1];
}
if(z!=1)f(z/2);
}
int main(){
int m,x,y,n;
int q=0;
cin>>n>>m;
for(q=1;q<n;q=q*2);
for(int i=1;i<=n;i++)a[i+q-1][0]=i;
for(int i=0;i<m;i++){
cin>>x>>y;
a[q+x-1][1]+=y;
f((q+x-1)/2);
cout<<a[1][0]<<' '<<a[1][1]<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
set<long long> ans;
int l = 1, r = n;
long long sum1 = 0, sum3 = 0;
while (l <= r) {
if (sum1 == sum3) {
ans.insert(sum1);
if (l == r) {
break;
}
sum1 += arr[l];
l++;
sum3 += arr[r];
r--;
} else if (sum1 < sum3) {
sum1 += arr[l];
l++;
} else {
sum3 += arr[r];
r--;
}
}
if (sum1 == sum3) {
ans.insert(sum1);
}
cout << *(ans.rbegin());
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> input;
for (int a = 0; a < n; a++) {
int p;
cin >> p;
input.push_back(p);
}
long long counting = 0;
for (int a = 0; a < n - 1; a++) {
int k = input[a];
int r;
for (r = 1; a + r < n; r *= 2)
;
r /= 2;
input[a + r] += input[a];
counting += (long long)input[a];
input[a] = 0;
cout << counting << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int b[1234567];
int cnt = 0;
string s;
int k;
bool check(int x) {
int now = 0;
int t = 0;
for (int i = 0; i < cnt; i++) {
if (b[i] + now <= x)
now += b[i];
else {
t++;
now = 0;
now += b[i];
if (now > x) return false;
}
}
if (t >= k)
return false;
else
return true;
}
int main() {
cin >> k;
getline(cin, s);
getline(cin, s);
int len = s.size();
for (int i = 0; i < len; i++) {
b[cnt]++;
if (s[i] == ' ' || s[i] == '-') cnt++;
}
cnt++;
int l = 0, r = len + 1;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (check(mid))
r = mid;
else
l = mid;
}
cout << r << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
scanf("%d", &n);
vector<int> x(n), y(n);
for (int i = 0; i < n; ++i) {
scanf("%d%d", &x[i], &y[i]);
x[i] /= 2;
y[i] /= 2;
}
long long res = 0, res2 = 0;
for (int i = 0; i < n; ++i) {
long long odd = 0, even = 0;
for (int j = 0; j < n; ++j) {
if (i == j) {
continue;
}
if ((x[j] + x[i]) % 2 == 0 && (y[j] + y[i]) % 2 == 0) {
++even;
} else {
++odd;
}
}
res += even * odd;
res2 += even * (even - 1) / 2;
}
printf("%lld\n", res / 2LL + res2 / 3LL);
}
int main() {
int t;
t = 1;
for (int i = 0; i < t; ++i) {
solve();
}
return 0;
}
| 4 |
#include<iostream>
using namespace std;
int main()
{
int x;
cin>>x;
cout<<!x<<endl;
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int N_MAX = 50;
int main()
{
int n,k,tv,tm,t,i,j,ii,res=0;
int v[N_MAX],m[N_MAX];
cin >> n >> k;
for(i=0;i<n;i++)
cin >> v[i];
for(i=0;i<=n;i++)
for(j=0;j<=n-i;j++){
if(i+j>k)
break;
tv=0;
tm=0;
for(ii=0;ii<n;ii++){
if(ii>=i&&ii<n-j)
continue;
tv+=v[ii];
if(v[ii]<0){
m[tm]=v[ii];
tm++;
}
}
sort(m,m+tm);
for(ii=0;ii<min(k-(i+j),tm);ii++)
tv-=m[ii];
res=max(res,tv);
}
cout << res << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main(){
long long N; cin >> N;
string S; cin >> S;
long long ans = 1, cnt = 1;
long long p = 1;
for(int i=1; i<=N; i++) p = (p * i) % mod;
if(S[0] == 'W' || S[2*N-1] == 'W'){
cout << 0 << endl;
}else{
for(int i=1; i<2*N-1; i++){
if(cnt % 2 == 0 && S[i] == 'W'){
ans = (ans * cnt) % mod;
cnt--;
}else if(cnt % 2 == 0 && S[i] == 'B'){
cnt++;
}else if(cnt % 2 == 1 && S[i] == 'W'){
cnt++;
}else if(cnt % 2 == 1 && S[i] == 'B'){
ans = (ans * cnt) % mod;
cnt--;
}
}
if(cnt == 1){
cout << ans * p % mod<< endl;
}else{
cout << 0 << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long int t, n, m, x, y, z, i, j, k, g, q, koyda, khoroch, sum;
long long int pm[100005], bike[100005], a;
long long int st = 1, en, val, total_pm;
bool cmp(long long int a1, long long int b1) { return (a1 > b1); }
bool somvob(long long int mid) {
val = 0, total_pm = 0;
for (i = 1, j = mid; i <= mid && j >= 1; i++, j--) {
total_pm += bike[i];
val += max(0LL, bike[i] - pm[j]);
}
total_pm = max(0LL, total_pm - a);
return val <= a;
}
void bs() {
long long int mid;
while (st <= en) {
mid = (st + en) / 2;
if (somvob(mid)) {
st = mid + 1;
koyda = mid;
khoroch = total_pm;
} else {
en = mid - 1;
}
}
}
int main() {
scanf("%lld %lld", &n, &m);
scanf("%lld", &a);
for (i = 1; i <= n; i++) scanf("%lld", &pm[i]);
for (i = 1; i <= m; i++) scanf("%lld", &bike[i]);
sort(pm + 1, pm + n + 1, cmp);
sort(bike + 1, bike + m + 1);
en = min(n, m);
bs();
cout << koyda << " " << khoroch << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void amin(T &x, const T &y) {
if (y < x) x = y;
}
template <class T>
inline void amax(T &x, const T &y) {
if (x < y) x = y;
}
template <class Iter>
void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp = 0; begin != end; ++begin) {
if (sp)
putchar(' ');
else
sp = true;
printf(fmt, *begin);
}
putchar('\n');
}
template <unsigned MOD>
struct ModInt {
static const unsigned static_MOD = MOD;
unsigned x;
void undef() { x = (unsigned)-1; }
bool isnan() const { return x == (unsigned)-1; }
inline int geti() const { return (int)x; }
ModInt() { x = 0; }
ModInt(const ModInt &y) { x = y.x; }
ModInt(int y) {
if (y < 0 || (int)MOD <= y) y %= (int)MOD;
if (y < 0) y += MOD;
x = y;
}
ModInt(unsigned y) {
if (MOD <= y)
x = y % MOD;
else
x = y;
}
ModInt(long long y) {
if (y < 0 || MOD <= y) y %= MOD;
if (y < 0) y += MOD;
x = y;
}
ModInt(unsigned long long y) {
if (MOD <= y)
x = y % MOD;
else
x = y;
}
ModInt &operator+=(const ModInt y) {
if ((x += y.x) >= MOD) x -= MOD;
return *this;
}
ModInt &operator-=(const ModInt y) {
if ((x -= y.x) & (1u << 31)) x += MOD;
return *this;
}
ModInt &operator*=(const ModInt y) {
x = (unsigned long long)x * y.x % MOD;
return *this;
}
ModInt &operator/=(const ModInt y) {
x = (unsigned long long)x * y.inv().x % MOD;
return *this;
}
ModInt operator-() const { return (x ? MOD - x : 0); }
ModInt inv() const {
unsigned a = MOD, b = x;
int u = 0, v = 1;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0) u += MOD;
return ModInt(u);
}
ModInt pow(long long y) const {
ModInt b = *this, r = 1;
if (y < 0) {
b = b.inv();
y = -y;
}
for (; y; y >>= 1) {
if (y & 1) r *= b;
b *= b;
}
return r;
}
friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};
const long long MOD = 998244353;
int N, M;
ModInt<MOD> H;
int B[200011];
void MAIN() {
int h;
scanf("%d%d%d", &N, &M, &h);
H = h;
for (int i = 0, i_len = (M); i < i_len; ++i) scanf("%d", B + i);
int prv = 0;
ModInt<MOD> ans = 1;
for (int i = 0, i_len = (M); i < i_len; ++i) {
int len = B[i] - prv;
ModInt<MOD> p = H.pow(len);
ans *= (p * p - p) / 2 + p;
prv = B[i];
}
int rest = N - prv - prv;
ans *= H.pow(rest);
printf("%d\n", ans.geti());
}
int main() {
int TC = 1;
for (int tc = 0, tc_len = (TC); tc < tc_len; ++tc) MAIN();
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> s;
map<char, int> c2i = {{'A', 0}, {'G', 1}, {'C', 2}, {'T', 3}};
string i2c = "AGCT";
int col_cost(int n, int a, int b) {
int cost = 0;
for (int m = 0; m < M; ++m) {
if (m % 2 == 0) {
cost += (a != s[n][m]);
} else {
cost += (b != s[n][m]);
}
}
return cost;
}
int row_cost(int m, int a, int b) {
int cost = 0;
for (int n = 0; n < N; ++n) {
if (n % 2 == 0) {
cost += (a != s[n][m]);
} else {
cost += (b != s[n][m]);
}
}
return cost;
}
int main() {
cin >> N >> M;
string S[N];
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
s.resize(N);
for (int i = 0; i < N; ++i) {
s[i].resize(M);
for (int j = 0; j < M; ++j) {
s[i][j] = c2i[S[i][j]];
}
}
int mincost = N * M;
int best[2];
int a[2];
for (a[0] = 0; a[0] < 4; ++a[0]) {
for (a[1] = a[0] + 1; a[1] < 4; ++a[1]) {
int b[2], j = 0;
for (int i = 0; i < 4; ++i) {
if (i != a[0] && i != a[1]) {
b[j] = i;
++j;
}
}
int cost = 0;
for (int n = 0; n < N; ++n) {
if (n % 2 == 0) {
cost += min(col_cost(n, a[0], a[1]), col_cost(n, a[1], a[0]));
} else {
cost += min(col_cost(n, b[0], b[1]), col_cost(n, b[1], b[0]));
}
}
if (cost < mincost) {
memcpy(&best, &a, sizeof(best));
mincost = cost;
}
}
}
bool row = false;
for (a[0] = 0; a[0] < 4; ++a[0]) {
for (a[1] = a[0] + 1; a[1] < 4; ++a[1]) {
int b[2], j = 0;
for (int i = 0; i < 4; ++i) {
if (i != a[0] && i != a[1]) {
b[j] = i;
++j;
}
}
int cost = 0;
for (int m = 0; m < M; ++m) {
if (m % 2 == 0) {
cost += min(row_cost(m, a[0], a[1]), row_cost(m, a[1], a[0]));
} else {
cost += min(row_cost(m, b[0], b[1]), row_cost(m, b[1], b[0]));
}
}
if (cost < mincost) {
memcpy(&best, &a, sizeof(best));
mincost = cost;
row = true;
}
}
}
memcpy(&a, &best, sizeof(a));
int b[2], j = 0;
for (int i = 0; i < 4; ++i) {
if (i != a[0] && i != a[1]) {
b[j] = i;
++j;
}
}
vector<string> ans(N, string(M, '$'));
if (!row) {
for (int n = 0; n < N; ++n) {
if (n % 2 == 0) {
if (col_cost(n, a[0], a[1]) > col_cost(n, a[1], a[0])) swap(a[0], a[1]);
for (int m = 0; m < M; ++m) {
ans[n][m] = i2c[a[m % 2]];
}
} else {
if (col_cost(n, b[0], b[1]) > col_cost(n, b[1], b[0])) swap(b[0], b[1]);
for (int m = 0; m < M; ++m) {
ans[n][m] = i2c[b[m % 2]];
}
}
}
} else {
for (int m = 0; m < M; ++m) {
if (m % 2 == 0) {
if (row_cost(m, a[0], a[1]) > row_cost(m, a[1], a[0])) swap(a[0], a[1]);
for (int n = 0; n < N; ++n) {
ans[n][m] = i2c[a[n % 2]];
}
} else {
if (row_cost(m, b[0], b[1]) > row_cost(m, b[1], b[0])) swap(b[0], b[1]);
for (int n = 0; n < N; ++n) {
ans[n][m] = i2c[b[n % 2]];
}
}
}
}
for (int n = 0; n < N; ++n) {
cout << ans[n] << endl;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
inline int Getlen(int x) {
int res = 0;
while (x) {
res++;
x /= 10;
}
return res;
}
int PP10[5];
int a[51], len[51], n, p;
int id[51];
vector<int> res;
inline void dfs(int now, int Gmod, int Gxor) {
if (Gmod == 0 && Gxor == 0 && res.size() > 0) {
puts("Yes");
cout << res.size() << endl;
for (int i = 0; i < (int)res.size(); i++) cout << res[i] << ' ';
exit(0);
}
if (now > n) return;
dfs(now + 1, Gmod, Gxor);
res.push_back(id[now]);
dfs(now + 1, (Gmod * PP10[len[now]] + a[now]) % p, Gxor ^ a[now]);
res.pop_back();
}
int main() {
res.clear();
PP10[0] = 1;
for (int i = 1; i <= 3; i++) PP10[i] = PP10[i - 1] * 10;
scanf("%d%d", &n, &p);
int now = 0, tmp;
for (int i = 1; i <= n; i++) {
scanf("%d", &tmp);
if (tmp <= 31) a[++now] = tmp, len[now] = Getlen(a[now]), id[now] = i;
}
n = now;
dfs(1, 0, 0);
puts("No");
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long int dp[200009][2];
int siz;
vector<long long int> a;
long long int solve(int x, int p) {
if (x > siz || x <= 0) return 0;
if (dp[x][p] != -1) return dp[x][p];
if (x == 1) return dp[x][p] = -2;
dp[x][p] = -2;
if (p == 1) {
long long int t = solve(x + a[x - 1], 2);
if (t == -2) return dp[x][p] = -2;
return dp[x][p] = a[x - 1] + t;
} else {
long long int t = solve(x - a[x - 1], 1);
if (t == -2) return dp[x][p] = -2;
return dp[x][p] = a[x - 1] + t;
}
}
int main() {
int t, i, j, k, n, m;
scanf("%d", &n);
siz = n;
a.push_back(0);
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
a.push_back(x);
}
memset(dp, -1, sizeof(dp));
for (i = 1; i < n; i++) {
long long int ans = solve(i + 1, 2);
if (ans == -2)
cout << -1 << endl;
else
cout << ans + i << endl;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
string s;
cin >> s;
map<long long, long long> m;
set<long long> set;
set.insert(s[0] - 'a');
m[s[0] - 'a'] = 1;
long long flag = 0, l, r;
for (long long i = 1; i < s.length(); i++) {
long long x = s[i] - 'a';
auto it = set.end();
it--;
if (*it > x) {
flag = 1;
l = m[*it];
r = i + 1;
break;
} else {
set.insert(x);
m[x] = i + 1;
}
}
if (flag) {
cout << "YES\n";
cout << l << " " << r << "\n";
} else
cout << "NO\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a);
sum += a;
}
if (sum % n == 0)
printf("%d\n", n);
else
printf("%d\n", n - 1);
return 0;
}
| 2 |
#include <bits/stdc++.h>
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int NINF = -INF - 1;
const int maxn = 5e5 + 10;
using namespace std;
int main() {
string ss;
cin >> ss;
int len = ss.length();
int l = 0, r = len - 1;
int t = 0;
for (int i = 0; i < len; ++i) {
if (ss[i] == '[') {
t++;
l = i;
break;
}
}
for (int i = len - 1; i >= 0; --i) {
if (ss[i] == ']') {
t++;
r = i;
break;
}
}
int st = l, ed = r;
for (int i = l; i <= r; ++i) {
if (ss[i] == ':') {
t++;
st = i;
break;
}
}
for (int i = r; i >= l; --i) {
if (ss[i] == ':' && i != st) {
t++;
ed = i;
break;
}
}
if (t != 4) {
cout << "-1";
return 0;
}
int ans = 4;
for (int i = st; i < ed; ++i) {
if (ss[i] == '|') ans++;
}
cout << ans;
return 0;
}
| 2 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
#define min(a, b) ((a) < (b))? (a):(b)
#define max(a, b) ((a) > (b))? (a):(b)
#define abs(a) ((a) < (0)? -(a):(a))
#define rep(i, n) REP(i, 0, (n))
#define REP(i, a, n) for(typeof(n) i=(a); i<(n); i++)
#define pb push_back
int main() {
int N; cin >> N;
string s; cin >> s;
for(string head: {"SS", "SW", "WS", "WW"}) {
string ans = head;
REP(i, 1, N+1) {
string tail = ans.substr(ans.size()-2, 2);
if(s[i%N]=='o') ans.pb((tail=="SS"||tail=="WW")? 'S':'W');
else ans.pb((tail=="SS"||tail=="WW")? 'W':'S');
}
if(ans.substr(N,2)==head) {cout << ans.substr(0, N) << endl; return 0;}
}
cout << "-1" << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
int p;
int main() {
cin >> n >> k >> p;
for (int i = 0; i < p; i++) {
long long q;
cin >> q;
if (q == n && k > 0) {
cout << 'X';
} else if (q % 2 == 1) {
long long r = n / 2 - q / 2;
long long nk = (n % 2 == 1) ? (k - 1 - n / 2) : k - n / 2;
if (r <= nk) {
cout << 'X';
} else {
cout << '.';
}
} else {
long long r = n / 2 - q / 2 + 1;
long long nk = (n % 2 == 1) ? (k - 1) : k;
if (r <= nk) {
cout << 'X';
} else {
cout << '.';
}
}
}
cout << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
string S;
int P[105];
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> P[i];
bool ok = 1;
getline(cin, S);
for (int i = 0; i < n; i++) {
S = "";
getline(cin, S);
int j = 0;
string cur = "";
int cnt = 0;
for (int j = 0; j < S.size(); j++) {
if (S[j] == 'a' || S[j] == 'e' || S[j] == 'i' || S[j] == 'o' ||
S[j] == 'u' || S[j] == 'y')
cnt++;
}
if (cnt != P[i]) ok = 0;
}
cout << (ok ? "YES\n" : "NO\n");
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int CC(int n) {
if (n == 1) return 1;
return (n / 2) * 4;
}
int main() {
int x;
cin >> x;
if (x == 1)
cout << 1;
else if (x == 3)
cout << 5;
else {
int n = 1;
if (x % 2 == 1) {
x--;
}
while (x) {
n += 2;
int tt = CC(n);
if (x <= tt) {
if (tt % 4 == 2)
cout << n + 2;
else
cout << n;
x = 0;
} else {
x -= tt;
}
}
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long l, r;
cin >> l >> r;
if (2 * l <= r) {
cout << l << " " << 2 * l << '\n';
} else
cout << -1 << " " << -1 << '\n';
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int x,i,j,n,a[1<<17],p,q;
vector<int>v;
int main(){
for(cin>>n;i<n;)cin>>a[i++];
for(sort(a,a+n,greater<int>()),x=a[0],j=1;j<n;++j){
if(x==a[j])v.push_back(a[j]),++j;
x=a[j];
}
if(v.size()>1)cout<<(long long)v[0]*v[1]<<endl;
else cout<<0<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2020;
const int INF = 0x3f3f3f3f;
int n;
char s[N];
char t[N];
int f[N][N];
int suf1[N][26];
int suf2[N][26];
int dp(int i, int j) {
if (j == 0) return 0;
int &res = f[i][j];
if (res != -1) return res;
res = INF;
if (i != 0) {
res = 1 + dp(i - 1, j);
if (s[i] == t[j]) res = min(res, dp(i - 1, j - 1));
}
int ch = t[j] - 'a';
if (suf1[i + 1][ch] > suf2[j + 1][ch]) res = min(res, dp(i, j - 1));
return res;
}
int solve() {
scanf("%d", &n);
scanf("%s", s + 1);
scanf("%s", t + 1);
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++) f[i][j] = -1;
for (int i = 1; i <= n + 1; i++)
for (int j = 0; j < 26; j++) suf2[i][j] = suf1[i][j] = 0;
for (int i = n; i >= 1; i--) {
suf1[i][s[i] - 'a']++;
suf2[i][t[i] - 'a']++;
for (int j = 0; j < 26; j++) {
suf1[i][j] += suf1[i + 1][j];
suf2[i][j] += suf2[i + 1][j];
}
}
for (int i = 0; i < 26; i++)
if (suf1[1][i] != suf2[1][i]) return -1;
return dp(n, n);
}
int main() {
int T;
scanf("%d", &T);
while (T--) printf("%d\n", solve());
return 0;
}
| 6 |
// Tazoe
#include <iostream>
using namespace std;
void eratos(bool prime[], int n)
{
for(int i=0; i<n; i++){
prime[i] = false;
}
for(int i=0; 7*i<n; i++){
if(7*i+1<n)
prime[7*i+1] = true;
if(7*i+6<n)
prime[7*i+6] = true;
}
if(n>=2)
prime[1] = false;
for(int i=2; i<n; i++){
if(!prime[i])
continue;
for(int j=i+i; j<n; j+=i){
prime[j] = false;
}
}
}
int main()
{
bool P[300000];
eratos(P, 300000);
while(true){
int n;
cin >> n;
if(n==1)
break;
cout << n << ':';
for(int i=2; i<=n; i++){
if(!P[i])
continue;
if(n%i!=0)
continue;
cout << ' ' << i;
}
cout << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
void no() {
cout << "No";
exit(0);
}
int main() {
ios_base::sync_with_stdio(false);
long long n, t;
cin >> n >> t;
vector<long long> a = vector<long long>(n + 1);
vector<long long> x = vector<long long>(n);
vector<long long> b = vector<long long>(n, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
a[n] = static_cast<long long>(1e18 + 100);
for (int j = 0; j < n; ++j) {
cin >> x[j];
--x[j];
}
long long max_b = -1;
long long last_x = x[0];
for (int i = 0; i < n; ++i) {
if (x[i] < i) no();
if (i > last_x) {
last_x = x[i];
}
if (i <= last_x && x[i] != last_x) no();
if (i < last_x) {
b[i] = a[i + 1];
if (b[i] <= max_b) no();
max_b = b[i];
}
if (i == last_x) {
b[i] = a[i + 1] - 1;
if (b[i] <= max_b) no();
max_b = b[i];
}
}
cout << "Yes\n";
for (int k = 0; k < n; ++k) {
cout << (b[k] + t) << " ";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100001];
int used[100001];
int cnt = 0;
int main() {
int n;
long double s;
cin >> n >> s;
for (int i = 1; i <= n - 1; ++i) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i = 1; i <= n; ++i) {
if (g[i].size() == 1) cnt++;
}
cout << fixed << setprecision(20) << 2.0 * s / cnt;
}
| 2 |
#include<queue>
#include<cstdio>
#include<vector>
#include<complex>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef complex<double> Point;
enum {CCW=1,CW=-1,ON=0};
const double EPS=1e-9;
class Line:public vector<Point>{
public:
Line(){}
Line(const Point &a,const Point &b){ pb(a), pb(b); }
};
class Segment:public Line{
public:
Segment(){}
Segment(const Point &a,const Point &b):Line(a,b){}
};
double cross(const Point &a,const Point &b){
return real(a)*imag(b)-imag(a)*real(b);
}
int ccw(const Point &a,Point b,Point c){
b-=a,c-=a;
double rotdir=cross(b,c);
if(rotdir>EPS) return CCW;
if(rotdir<-EPS) return CW;
return ON;
}
// bool intersect(const Segment &s,const Segment &t){
// return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1])<=0
// && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1])<=0;
// }
bool intersect(const Segment &s,const Segment &t){
if(max(real(s[0]),real(s[1]))<min(real(t[0]),real(t[1]))
|| max(real(t[0]),real(t[1]))<min(real(s[0]),real(s[1]))
|| max(imag(s[0]),imag(s[1]))<min(imag(t[0]),imag(t[1]))
|| max(imag(t[0]),imag(t[1]))<min(imag(s[0]),imag(s[1]))) return false;
if(ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1])<=0
&& ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1])<=0) return true;
return false;
}
vvi toConnectedComponents(const vvi &adj){
int n=adj.size();
vvi res;
vb visited(n);
rep(i,n)if(!visited[i]){
vi comp;
queue<int> qu; qu.push(i); visited[i]=true;
while(!qu.empty()){
int u=qu.front(); qu.pop();
comp.pb(u);
rep(j,adj[u].size()){
int v=adj[u][j];
if(!visited[v]){ qu.push(v); visited[v]=true; }
}
}
res.pb(comp);
}
return res;
}
int main(){
for(int n;scanf("%d",&n),n;){
Segment s[1000];
rep(i,n){
int x1,y1,x2,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
s[i]=Segment(Point(x1,y1),Point(x2,y2));
}
vvi adj(n);
rep(i,n)rep(j,i){
if(intersect(s[i],s[j])){
adj[i].pb(j);
adj[j].pb(i);
}
}
int hist[10]={};
vvi comps=toConnectedComponents(adj);
rep(i,comps.size()){
vi comp=comps[i];
int num=comp.size();
int degsum=0;
rep(j,num) degsum+=adj[comp[j]].size();
if(num==1) hist[1]++;
else if(num==3){
int mid;
rep(j,3) if(adj[comp[j]].size()==2) mid=comp[j];
int cnt=0;
rep(j,3)if(comp[j]!=mid){
if(s[mid][0]==s[comp[j]][0] || s[mid][0]==s[comp[j]][1]
|| s[mid][1]==s[comp[j]][0] || s[mid][1]==s[comp[j]][1]) cnt++;
}
if(cnt==1) hist[4]++;
else hist[7]++;
}
else if(num==4){
if(degsum==6) hist[3]++;
else{
int cnt=0;
rep(j,4){
int u=comp[j];
rep(k,2){
int v=adj[u][k];
if(s[u][0]==s[v][0] || s[u][0]==s[v][1]
|| s[u][1]==s[v][0] || s[u][1]==s[v][1]) cnt++;
}
}
if(cnt==8) hist[0]++;
else hist[9]++;
}
}
else{ // num==5
if(degsum==10) hist[6]++;
else if(degsum==12) hist[8]++;
else{
Segment e1,e2;
rep(j,5){
if(adj[comp[j]].size()==1){
e1=s[comp[j]];
e2=s[adj[comp[j]][0]];
break;
}
}
if(e1[0]==e2[0]) swap(e1[0],e1[1]);
else if(e1[0]==e2[1]) swap(e1[0],e1[1]), swap(e2[0],e2[1]);
else if(e1[1]==e2[1]) swap(e2[0],e2[1]);
if(cross(e1[1]-e1[0],e2[1]-e2[0])<-1+EPS) hist[2]++;
else hist[5]++;
}
}
}
rep(i,10) printf("%s%d",i?" ":"",hist[i]);
putchar('\n');
}
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.