solution
stringlengths 53
181k
| difficulty
int64 0
13
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int n, mm;
long long suml[1000000], sumr[1000000];
long long ans;
int main() {
cin >> n >> mm;
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
suml[i] = sumr[i] = x;
}
for (int i = 1; i <= n; ++i) suml[i] = (suml[i - 1] + suml[i]) % mm;
for (int i = n; i >= 1; --i) sumr[i] = (sumr[i + 1] + sumr[i]) % mm;
for (int i = 1; i < n; ++i) {
ans = max(ans, suml[i] + sumr[i + 1]);
}
cout << ans << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double EPS = 1e-6;
int a[1005];
int n;
bool Solve() {
int check = (n - a[0]) % n;
for (int i = 1; i < n; i++) {
int rotate = (i - a[i] + n) % n;
if (i & 1) rotate = (n - rotate) % n;
if (check != rotate) return false;
}
return true;
}
int main() {
{ ; };
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", a + i);
puts(Solve() ? "Yes" : "No");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
bool is_palindrom(string a) {
string s_reversed = "";
for (int i = a.size() - 1; i >= 0; i--) {
s_reversed += a[i];
}
if (a == s_reversed) {
return true;
}
return false;
}
int main() {
string no = "BCDEFGJKLNPQRSZ";
string s;
cin >> s;
if (s.find_first_of(no) != -1 || is_palindrom(s) == false) {
cout << "NO" << endl;
return 0;
}
cout << "YES";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:200000000")
const double EPS = 1E-9;
const int INF = 1000000000;
const long long INF64 = (long long)1E18;
const double PI = 3.1415926535897932384626433832795;
int a[110], n, n2, s, b[10][10];
bool u[110];
bool check() {
{
int sum = 0;
for (int i = 0; i < (int)(n); i++) sum += b[i][i];
if (sum != s) return false;
}
return true;
}
bool bad_col(int x, int y) {
if (x == 0) return false;
int sum = 0;
for (int i = 0; i < (int)(x + 1); i++) sum += b[i][y];
if (x == n - 3)
for (int i = 0; i < (int)(n2); i++)
if (!u[i])
for (int j = 0; j < (int)(i); j++)
if (!u[j] && s - sum == a[i] + a[j]) return false;
if (x == n - 2)
for (int i = 0; i < (int)(n2); i++)
if (!u[i] && s - sum == a[i]) return false;
if (x < n - 3) return false;
return true;
}
void rec(int x, int y) {
if (x == n - 1 && y == 1) {
int sum = 0;
for (int i = 0; i < (int)(n); i++) sum += b[i][n - i - 1];
if (sum != s) return;
}
if (x == n - 1 && y) {
int sum = 0;
for (int i = 0; i < (int)(n); i++) sum += b[i][y - 1];
if (sum != s) return;
}
if (x < n - 1 && y)
if (bad_col(x, y - 1)) return;
if (x == n) {
if (!check()) return;
for (int i = 0; i < (int)(n); i++) {
for (int j = 0; j < (int)(n); j++) printf("%d ", b[i][j]);
puts("");
}
exit(0);
}
if (y == n) {
int sum = 0;
for (int i = 0; i < (int)(n); i++) sum += b[x][i];
if (sum != s) return;
return rec(x + 1, 0);
}
int last = INF;
for (int i = 0; i < (int)(n2); i++)
if (!u[i] && last != a[i]) {
last = a[i];
u[i] = true;
b[x][y] = a[i];
rec(x, y + 1);
u[i] = false;
}
}
int main() {
cin >> n;
n2 = n * n;
for (int i = 0; i < (int)(n2); i++) cin >> a[i];
sort(a, a + n2);
for (int i = 0; i < (int)(n2); i++) s += a[i];
s /= n;
printf("%d\n", s);
rec(0, 0);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
bool black[MAX];
vector<int> vec[MAX];
bool old_black[MAX];
const int MAX_BLOCK_SIZE = 600;
int t[MAX], v[MAX];
bool used[MAX];
vector<pair<pair<int, int>, int> > v2[MAX];
int push[MAX];
bool clear[MAX];
void dfs_1(int pos, int prev = -1, int white = 0, int dist = 0) {
if (used[pos]) {
if (prev != -1) {
v2[prev].push_back(make_pair(make_pair(pos, white), dist));
}
for (int a : vec[pos]) {
dfs_1(a, pos, 0, 0);
}
} else {
if (!black[pos]) {
white++;
}
for (int a : vec[pos]) {
dfs_1(a, prev, white, dist + 1);
}
}
}
void make_1(int pos) {
if (!black[pos]) {
black[pos] = true;
return;
}
push[pos]++;
for (auto a : v2[pos]) {
if (a.first.second + 1 <= push[pos]) {
make_1(a.first.first);
}
}
}
void make_2(int pos) {
black[pos] = false;
push[pos] = 0;
clear[pos] = true;
for (auto &a : v2[pos]) {
a.first.second = a.second;
make_2(a.first.first);
}
}
void dfs_2(int pos, int p = 0, bool cl = false) {
if (used[pos]) {
p = push[pos];
cl |= clear[pos];
} else {
black[pos] = old_black[pos];
if (cl) {
black[pos] = false;
}
if (!black[pos] && p) {
black[pos] = true;
p--;
}
}
for (int a : vec[pos]) {
dfs_2(a, p, cl);
}
}
int main() {
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n >> q;
for (int i = 2; i <= n; i++) {
int a;
cin >> a;
vec[a].push_back(i);
}
for (int i = 1; i <= q; i++) {
cin >> t[i] >> v[i];
}
int root = 1;
for (int i = 1; i <= q; i += MAX_BLOCK_SIZE) {
for (int j = 1; j <= n; j++) {
used[j] = false;
v2[j].clear();
old_black[j] = black[j];
push[j] = 0;
clear[j] = false;
}
for (int j = 0; j < MAX_BLOCK_SIZE && i + j <= q; j++) {
used[v[i + j]] = true;
}
dfs_1(root);
for (int j = 0; j < MAX_BLOCK_SIZE && i + j <= q; j++) {
int t = ::t[i + j];
int v = ::v[i + j];
if (t == 1) {
make_1(v);
} else if (t == 2) {
make_2(v);
} else {
cout << (black[v] ? "black" : "white") << "\n";
}
}
dfs_2(root);
}
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
long long n, x, y;
cin >> n >> x >> y;
int status3 = 0;
int status1 = 0, status2 = 0;
vector<int> numbers(n, 0);
for (int j = 1; j <= y - x; j++) {
for (int i = 1; i <= x; i++) {
numbers = {0};
numbers[0] = i;
for (int k = 1; k <= n - 1; k++) {
numbers[k] = numbers[k - 1] + j;
if (numbers[k - 1] == x) status1 = 1;
if (numbers[k] == y) status2 = 1;
}
if (status1 == 1 && status2 == 1) {
status3 = 1;
break;
}
status1 = 0;
status2 = 0;
}
if (status3 == 1) break;
}
for (int i = 0; i < n; i++) cout << numbers[i] << " ";
cout << endl;
}
return (0);
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n % 2 == 0)
printf("white\n1 2\n");
else
printf("black\n");
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
bool sortinrevp(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.first > b.first);
}
bool sortinrev(const long long &a, const long long &b) { return (a > b); }
long long power(long long x, unsigned long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long isPrime(long long n) {
if (n <= 1) return 0;
for (long long i = 2; i < n; i++)
if (n % i == 0) return 0;
return 1;
}
void solve() {
long long n;
cin >> n;
long long a[n + 1];
for (long long i = 1; i < n + 1; i++) cin >> a[i];
for (long long i = 1; i < n + 1; i++) {
long long p = 1, j = a[i];
while (j != i) {
p++;
j = a[j];
}
cout << p << " ";
}
cout << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 + 10;
int n, m, c, col[maxn], sel[maxn];
vector<int> ve[maxn], vr[maxn], fn, comp[maxn], vc[maxn], fnc;
bool mark[maxn];
pair<int, int> edge[maxn];
void dfs(int x) {
mark[x] = 1;
for (int i = 0; i < ve[x].size(); i++)
if (!mark[ve[x][i]]) dfs(ve[x][i]);
fn.push_back(x);
}
void dfs2(int x) {
mark[x] = 1;
col[x] = c;
comp[c].push_back(x);
for (int i = 0; i < vr[x].size(); i++)
if (!mark[vr[x][i]]) dfs2(vr[x][i]);
}
void dfs3(int x) {
sel[x] = 2;
for (int i = 0; i < vc[x].size(); i++)
if (!sel[vc[x][i]]) dfs3(vc[x][i]);
}
void go(int x) {
for (int i = 0; i < comp[x].size(); i++) {
int a = comp[x][i];
if (a > m && !sel[col[a - m]])
dfs3(col[a - m]);
else if (a <= m && !sel[col[a + m]])
dfs3(col[a + m]);
break;
}
}
bool in(int a, int x, int b) {
if (a < x && x < b) return 1;
return 0;
}
bool check(int a, int b, int x, int y) {
if (b < a) swap(a, b);
if (y < x) swap(x, y);
if ((in(x, b, y) && !in(x, a, y) && a != x) ||
(in(a, y, b) && !in(a, x, b) && x != a))
return 1;
return 0;
}
void dfs4(int x) {
mark[x] = 1;
for (int i = 0; i < vc[x].size(); i++)
if (!mark[vc[x][i]]) dfs4(vc[x][i]);
fnc.push_back(x);
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
edge[i].first = a;
edge[i].second = b;
}
for (int i = 1; i <= m; i++)
for (int j = 1; j < i; j++) {
int a1 = edge[i].first;
int b1 = edge[i].second;
int a2 = edge[j].first;
int b2 = edge[j].second;
if (check(a1, b1, a2, b2)) {
ve[i + m].push_back(j);
ve[j + m].push_back(i);
ve[i].push_back(j + m);
ve[j].push_back(i + m);
vr[i + m].push_back(j);
vr[j + m].push_back(i);
vr[i].push_back(j + m);
vr[j].push_back(i + m);
}
}
for (int i = 1; i <= 2 * m; i++)
if (!mark[i]) dfs(i);
memset(mark, 0, sizeof mark);
for (int i = fn.size() - 1; i >= 0; i--)
if (!mark[fn[i]]) {
c++;
dfs2(fn[i]);
}
for (int i = 1; i <= m; i++)
if (col[i] == col[i + m]) {
cout << "Impossible\n";
return 0;
}
for (int i = 1; i <= m; i++)
for (int j = 1; j < i; j++) {
int a = col[i];
int b = col[j];
int x = col[i + m];
int y = col[j + m];
int a1 = edge[i].first;
int b1 = edge[i].second;
int a2 = edge[j].first;
int b2 = edge[j].second;
if (a != y && b != x && check(a1, b1, a2, b2)) {
vc[a].push_back(y);
vc[b].push_back(x);
vc[x].push_back(b);
vc[y].push_back(a);
}
}
memset(mark, 0, sizeof mark);
for (int i = 1; i <= c; i++)
if (!mark[i]) dfs4(i);
for (int i = fnc.size() - 1; i >= 0; i--) {
if (!sel[fnc[i]]) {
sel[fnc[i]] = 1;
go(fnc[i]);
}
}
for (int i = 1; i <= m; i++)
if (sel[col[i]] == 1)
cout << 'i';
else
cout << 'o';
cout << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
int main() {
int hh, mm;
while (scanf("%d:%d", &hh, &mm) == 2) {
int time = hh * 60 + mm + 1;
time %= 1440;
for (int i = time; true; i++) {
i %= 1440;
int th = i / 60;
int tm = i % 60;
if (th % 10 == tm / 10 && th / 10 == tm % 10) {
printf("%02d:%02d\n", th, tm);
break;
}
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, aux;
bool vec[3002];
scanf("%d", &n);
memset(vec, false, sizeof(vec));
for (int i = 0; i < n; i++) {
scanf("%d", &aux);
vec[aux] = true;
}
for (int i = 1; i <= 3001; i++) {
if (vec[i] == false) {
printf("%d\n", i);
break;
}
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
char str[1001][1001];
int n, m;
int fil(int x, int y) {
if (x < 0 || y < 0 || x >= n || y >= m) {
return 0;
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i == 1 && j == 1) continue;
if (str[x + i][y + j] != '#') {
return 0;
}
}
}
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", &str[i]);
}
int val = 1;
for (int i = 0; i < n && val; i++) {
for (int j = 0; j < m && val; j++) {
if (str[i][j] == '#') {
int res = 0;
for (int k = -2; k <= 0 && res == 0; k++) {
res = max(res, fil(i - 2, j + k));
res = max(res, fil(i, j + k));
}
if (res == 0) {
res = max(res, fil(i - 1, j));
res = max(res, fil(i - 1, j - 2));
}
if (res == 0) val = 0;
}
}
}
printf("%s\n", val ? "YES" : "NO");
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 62;
const int mods = 1e9 + 7;
const int MAXN = 400005;
const int INF = 0x3f3f3f3f;
inline int read() {
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3) + (x << 1) + (c ^ 48);
c = getchar();
}
return x * f;
}
set<int> Set;
vector<int> e[MAXN];
int id[MAXN], dfn[MAXN], DFN = 0, dep[MAXN], mn[18][MAXN], n, Log[MAXN],
sum = 0, k, ans = 1, num = 0, eul[MAXN], ID[MAXN];
void dfs(int x, int father) {
id[dfn[x] = ++DFN] = x, dep[x] = dep[father] + 1, ID[eul[x] = ++num] = x;
for (auto v : e[x])
if (v != father) {
dfs(v, x);
ID[++num] = x;
}
}
void Init() {
for (int i = 1; i <= num; i++) mn[0][i] = dep[ID[i]];
for (int i = 1; i <= 17; i++)
for (int j = 1; j <= num - (1 << i) + 1; j++)
mn[i][j] = min(mn[i - 1][j], mn[i - 1][j + (1 << (i - 1))]);
}
int getdep(int l, int r) {
l = eul[id[l]], r = eul[id[r]];
if (l > r) swap(l, r);
int x = Log[r - l + 1];
return min(mn[x][l], mn[x][r - (1 << x) + 1]);
}
void add(int x) {
set<int>::iterator it = Set.lower_bound(x);
int nxt, lst;
if (it == Set.end())
nxt = *Set.begin(), it--, lst = *it;
else if (it == Set.begin())
nxt = *it, lst = *Set.rbegin();
else
nxt = *it, it--, lst = *it;
if (nxt == lst)
sum += getdep(lst, lst) + getdep(x, x) - getdep(x, lst) * 2;
else
sum += getdep(x, x) + getdep(lst, nxt) - getdep(x, nxt) - getdep(lst, x);
Set.insert(x);
}
void del(int x) {
Set.erase(Set.find(x));
if (!Set.size()) return;
set<int>::iterator it = Set.lower_bound(x);
int nxt, lst;
if (it == Set.end())
nxt = *Set.begin(), it--, lst = *it;
else if (it == Set.begin())
nxt = *it, lst = *Set.rbegin();
else
nxt = *it, it--, lst = *it;
if (nxt == lst)
sum -= getdep(lst, lst) + getdep(x, x) - getdep(x, lst) * 2;
else
sum -= getdep(x, x) + getdep(lst, nxt) - getdep(x, nxt) - getdep(lst, x);
}
signed main() {
n = read(), k = read(), ans = 1;
for (int i = 1, u, v; i < n; i++)
u = read(), v = read(), e[u].push_back(v), e[v].push_back(u);
Log[1] = 0;
for (int i = 2; i <= n * 2; i++) Log[i] = Log[i >> 1] + 1;
dfs(1, 0), Init(), Set.insert(dfn[1]);
for (int l = 1, r = 1; l < n; l++) {
while (r < n && sum + 1 <= k) r++, add(dfn[r]);
if (sum + 1 > k)
upmax(ans, r - l);
else
upmax(ans, r - l + 1);
del(dfn[l]);
}
printf("%d\n", ans);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = (1uLL << 63) - 1;
const long long mod = 1e9 + 7;
const double Pi = acos(-1.0);
const int maxn = 1e6 + 5;
struct node {
int a, b;
} A[105];
bool cmp(node X, node Y) { return X.b > Y.b; }
int dp[105][10005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, V = 0;
int Big = 0;
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++) cin >> A[i].a, V += A[i].a;
for (int i = 0; i < n; i++) cin >> A[i].b, Big += A[i].b;
sort(A, A + n, cmp);
int anst = 0;
int S = 0;
for (int i = 0; i < n; i++) {
S += A[i].b;
if (S >= V) {
anst = i + 1;
break;
}
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) {
for (int j = anst - 1; j >= 0; j--) {
for (int v = 10000 - A[i].a; v >= 0; v--) {
if (dp[j][v] != -1) {
dp[j + 1][v + A[i].a] = max(dp[j + 1][v + A[i].a], dp[j][v] + A[i].b);
}
}
}
}
int ans = 0;
for (int i = 10000; i >= 0; i--) {
if (dp[anst][i] >= V) {
ans = i;
break;
}
}
cout << anst << " " << V - ans << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
struct stuf {
int a, b, c, d;
stuf() {}
stuf(int aa, int bb, int cc, int dd) {
a = aa;
b = bb;
c = cc;
d = dd;
}
};
stuf mat[12];
int n, m;
int c0, d0;
long long best[1005][102][12];
long long dp(int rn, int ra, int idm) {
if (idm >= m) return 0;
if (best[rn][ra][idm] != -1) return best[rn][ra][idm];
long long res = 0;
if (rn >= c0) res = dp(rn - c0, ra, idm) + d0;
if (rn >= mat[idm].c && ra >= mat[idm].b)
res = max(res, dp(rn - mat[idm].c, ra - mat[idm].b, idm) + mat[idm].d);
res = max(res, dp(rn, mat[idm + 1].a, idm + 1));
return best[rn][ra][idm] = res;
}
void path(int rn, int ra, int idm, int out) {
if (idm >= m) return;
if (rn >= c0 && dp(rn - c0, ra, idm) + d0 == out) {
cout << rn << " " << ra << " " << idm << " " << out << endl;
path(rn - c0, ra, idm, out - d0);
} else if (rn >= mat[idm].c && ra >= mat[idm].b &&
dp(rn - mat[idm].c, ra - mat[idm].b, idm) + mat[idm].d == out) {
cout << rn << " " << ra << " " << idm << " " << out << endl;
path(rn - mat[idm].c, ra - mat[idm].b, idm, out - mat[idm].d);
} else {
cout << rn << " " << ra << " " << idm << " " << out << endl;
path(rn, mat[idm + 1].a, idm + 1, out);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> c0 >> d0;
for (int i = 0; i < m; i++)
cin >> mat[i].a >> mat[i].b >> mat[i].c >> mat[i].d;
memset(best, -1, sizeof best);
cout << dp(n, mat[0].a, 0) << endl;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, k, l, arr[300];
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &arr[i]);
sort(arr, arr + n);
m = 0;
l = 0;
for (i = 0; i < n; i++) {
if (arr[i] < 0)
m++;
else if (arr[i] == 0)
l++;
}
if (l == n)
printf("0");
else {
for (i = 0; i < n; i++) {
if (arr[i] > 0)
printf("%d ", arr[i]);
else if (m % 2 == 1 && m == i + 1)
i = i;
else if (arr[i] < 0)
printf("%d ", arr[i]);
}
if (n == 1 && arr[0] < 0)
printf("%d ", arr[0]);
else if (l == n - 1 && arr[0] < 0)
printf("0");
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17 + 7;
long long t, n, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n >> m;
cout << (n * m + 1) / 2 << '\n';
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long mi, lzy;
} p[8020020];
long long n, x, y, hi[1005][1005], tot, chk[1002020], ans;
long long Q_y(long long i, long long j) { return x * j - y * i; }
void pushdn(long long i) {
long long k = p[i].lzy;
p[i << 1].mi = max(k, p[i << 1].mi);
p[i << 1].lzy = max(k, p[i << 1].lzy);
p[(i << 1) | 1].mi = max(k, p[(i << 1) | 1].mi);
p[(i << 1) | 1].lzy = max(k, p[(i << 1) | 1].lzy);
p[i].lzy = 0;
}
void in(long long x, long long y, long long k, long long l, long long r,
long long i) {
if (x <= l && r <= y) {
p[i].mi = max(k, p[i].mi);
p[i].lzy = max(p[i].lzy, k);
return;
}
long long mid = (l + r) >> 1;
if (p[i].lzy) pushdn(i);
if (x <= mid) in(x, y, k, l, mid, i << 1);
if (mid < y) in(x, y, k, mid + 1, r, (i << 1) | 1);
p[i].mi = min(p[i << 1].mi, p[(i << 1) | 1].mi);
}
long long Q(long long x, long long y, long long l, long long r, long long i) {
if (x <= l && r <= y) return p[i].mi;
long long mid = (l + r) >> 1, s = 1000000009;
if (p[i].lzy) pushdn(i);
if (x <= mid) s = Q(x, y, l, mid, i << 1);
if (mid < y) s = min(Q(x, y, mid + 1, r, (i << 1) | 1), s);
return s;
}
int main() {
scanf("%lld%lld%lld", &n, &x, &y);
if (x >= 0) {
if (y >= 0) {
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= n; j++) scanf("%lld", &hi[i][j]);
} else {
for (long long i = 1; i <= n; i++)
for (long long j = n; j >= 1; j--) scanf("%lld", &hi[i][j]);
}
} else {
if (y >= 0) {
for (long long i = n; i >= 1; i--)
for (long long j = 1; j <= n; j++) scanf("%lld", &hi[i][j]);
} else {
for (long long i = n; i >= 1; i--)
for (long long j = n; j >= 1; j--) scanf("%lld", &hi[i][j]);
}
}
x = abs(x);
y = abs(y);
for (long long i = 0; i <= n; i++)
for (long long j = 0; j <= n; j++) chk[++tot] = Q_y(i, j);
sort(chk + 1, chk + tot + 1);
tot = unique(chk + 1, chk + tot + 1) - chk - 1;
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= n; j++) {
long long l = lower_bound(chk + 1, chk + tot + 1, Q_y(i, j - 1)) - chk,
r = lower_bound(chk + 1, chk + tot + 1, Q_y(i - 1, j)) - chk,
ss = Q(2 * l, 2 * r - 1, 1, 2 * tot, 1);
if (hi[i][j] > ss) {
ans += hi[i][j] - ss;
in(2 * l, 2 * r - 1, hi[i][j], 1, 2 * tot, 1);
}
}
printf("%lld", ans);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long co = 0, ce = 0;
vector<long long> ar(n + 1);
for (long long i = 0; i < n; i++) {
scanf("%ld", &ar[i]);
if (ar[i] % 2 != 0)
co++;
else
ce++;
}
if (co == 0)
printf("Second\n");
else
printf("First\n");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long bi(int a, int b) {
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
long long b2 = bi(a, b / 2);
return (b2 * b2) % mod;
} else {
return (bi(a, b - 1) * a) % mod;
}
}
long long h, w, ans;
int main() {
cin >> h >> w;
cout << bi(2, h + w);
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
const int INF = 0x3f3f3f3f;
int n, a[maxn][maxn], pre[maxn][maxn], tot[maxn][maxn][maxn][maxn],
dp[maxn][maxn][maxn][maxn];
char ch;
int cal(int l, int r, int il, int ir) {
return pre[r][ir] - pre[r][il - 1] - pre[l - 1][ir] + pre[l - 1][il - 1];
}
int dfs(int l, int r, int il, int ir) {
if (r < l || ir < il) return 0;
if (dp[l][r][il][ir] != INF) return dp[l][r][il][ir];
int &res = dp[l][r][il][ir];
if (!tot[l][r][il][ir]) return res = 0;
res = max(r - l + 1, ir - il + 1);
for (int i = l; i <= r; i++) {
if (!tot[i][i][il][ir])
res = min(res, dfs(l, i - 1, il, ir) + dfs(i + 1, r, il, ir));
}
for (int i = il; i <= ir; i++) {
if (!tot[l][r][i][i])
res = min(res, dfs(l, r, il, i - 1) + dfs(l, r, i + 1, ir));
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
memset(dp, 0x3f, sizeof(dp));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> ch;
if (ch == '.')
a[i][j] = 0;
else
a[i][j] = 1;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
pre[i][j] = pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1] + a[i][j];
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
for (int k = 1; k <= n; k++) {
for (int s = k; s <= n; s++) tot[i][j][k][s] = cal(i, j, k, s);
}
}
}
cout << dfs(1, n, 1, n);
return 0;
}
| 7 |
#include <bits/stdc++.h>
int main() {
long long int a, b;
int c = 0;
scanf("%lld%lld", &a, &b);
while (a > 0 && b > 0) {
if (a >= (2 * b))
a = a % (2 * b);
else if (b >= (2 * a))
b = b % (2 * a);
else
break;
}
printf("%lld %lld", a, b);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
pair<long long, long long> seg[4 * N];
vector<int> add[N], rem[N];
struct node {
int l, r, c, p;
bool operator<(const node& s) const { return p < s.p; }
};
vector<node> v;
void update(int n, int l, int r, int in, int d) {
if (r < in || l > in) return;
if (l >= in && r <= in) {
if (d == 1) {
seg[n].first = v[in].c, seg[n].second += v[in].p * 1LL * v[in].c;
} else {
seg[n].first = 0, seg[n].second = 0;
}
return;
}
int mid = (l + r) >> 1;
update(n * 2 + 1, l, mid, in, d);
update(n * 2 + 2, mid + 1, r, in, d);
seg[n].first = seg[n * 2 + 1].first + seg[n * 2 + 2].first;
seg[n].second = seg[n * 2 + 1].second + seg[n * 2 + 2].second;
}
int n, k, m;
long long S, E;
int get(int n, int l, int r, long long sum) {
if (l == r) {
return l;
}
int mid = (l + r) >> 1;
if (sum + seg[n * 2 + 1].first >= k) {
return get(n * 2 + 1, l, mid, sum);
} else
return get(n * 2 + 2, mid + 1, r, sum + seg[n * 2 + 1].first);
}
pair<long long, long long> calc(int n, int l, int r, int s, int e) {
if (r < s || l > e) return make_pair(0, 0);
if (l >= s && r <= e) return seg[n];
pair<long long, long long> ret = {0, 0}, L, R;
int mid = (l + r) >> 1;
L = calc(n * 2 + 1, l, mid, s, e);
R = calc(n * 2 + 2, mid + 1, r, s, e);
return make_pair(L.first + R.first, L.second + R.second);
}
int main() {
cin >> n >> k >> m;
for (int i = 0, l, r, c, p; i < m; i++) {
scanf("%d%d%d%d", &l, &r, &c, &p);
v.push_back({l, r, c, p});
}
sort(v.begin(), v.end());
for (int i = 0; i < m; i++) {
add[v[i].l].push_back(i);
rem[v[i].r + 1].push_back(i);
}
long long fans = 0;
for (int i = 1; i <= n; i++) {
while (add[i].size()) {
int x = add[i].back();
add[i].pop_back();
update(0, 0, m - 1, x, 1);
}
while (rem[i].size()) {
int x = rem[i].back();
rem[i].pop_back();
update(0, 0, m - 1, x, -1);
}
int in = get(0, 0, m - 1, 0);
pair<long long, long long> temp = calc(0, 0, m - 1, 0, in);
if (temp.first >= k) temp.second -= (temp.first - k) * 1LL * v[in].p;
fans += temp.second;
}
cout << fans << endl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void change(int x1, int y1, int x2, int y2, int x3, int y3,
vector<vector<int> > &res, vector<string> &arr) {
res.push_back({x1, y1, x2, y2, x3, y3});
arr[x1][y1] = '0' + (1 - (arr[x1][y1] - '0'));
arr[x2][y2] = '0' + (1 - (arr[x2][y2] - '0'));
arr[x3][y3] = '0' + (1 - (arr[x3][y3] - '0'));
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int> > res;
vector<string> arr(n);
for (int i = 0; i < n; ++i) cin >> arr[i];
for (int i = 0; i < n - 2; ++i)
for (int j = 0; j < m; ++j)
if (arr[i][j] == '1') {
if (j < m - 1) {
if (arr[i][j + 1] == '1')
change(i, j, i, j + 1, i + 1, j, res, arr);
else
change(i, j, i + 1, j, i + 1, j + 1, res, arr);
} else if (j == m - 1) {
change(i, j, i + 1, j - 1, i + 1, j, res, arr);
}
}
for (int j = 0; j < m - 2; ++j) {
if (arr[n - 2][j] == '1' || arr[n - 1][j] == '1') {
if (arr[n - 2][j] == '1' && arr[n - 1][j] == '1')
change(n - 2, j, n - 1, j, n - 2, j + 1, res, arr);
else if (arr[n - 2][j] == '1')
change(n - 2, j, n - 1, j + 1, n - 2, j + 1, res, arr);
else if (arr[n - 1][j] == '1')
change(n - 1, j, n - 1, j + 1, n - 2, j + 1, res, arr);
}
}
vector<int> to = {0, 2, 3, 0, 1};
while (true) {
int cnt = (arr[n - 2][m - 2] - '0') + (arr[n - 1][m - 2] - '0') +
(arr[n - 2][m - 1] - '0') + (arr[n - 1][m - 1] - '0');
if (cnt == 0) break;
int need = to[cnt];
vector<pair<int, int> > ps = {
{n - 2, m - 2}, {n - 1, m - 2}, {n - 2, m - 1}, {n - 1, m - 1}};
bool ok = false;
for (int a = 0; a < 4 && !ok; ++a)
for (int b = a + 1; b < 4 && !ok; ++b)
for (int c = b + 1; c < 4 && !ok; ++c)
for (int d = 0; d < 4 && !ok; ++d)
if (d != a && d != b && d != c) {
int cur = 1 - (arr[ps[a].first][ps[a].second] - '0') + 1 -
(arr[ps[b].first][ps[b].second] - '0') + 1 -
(arr[ps[c].first][ps[c].second] - '0') +
(arr[ps[d].first][ps[d].second] - '0');
if (cur == need) {
ok = true;
change(ps[a].first, ps[a].second, ps[b].first, ps[b].second,
ps[c].first, ps[c].second, res, arr);
}
}
}
if (res.size() > n * m) throw(0);
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
if (arr[i][j] != '0') throw(0);
cout << res.size() << endl;
for (int i = 0; i < res.size(); ++i) {
for (int j = 0; j < 6; ++j) cout << res[i][j] + 1 << " ";
cout << endl;
}
}
int main() {
int tc;
cin >> tc;
for (int t = 0; t < tc; ++t) solve();
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int f[30][30];
bool flag[30];
int read() {
int ans = 0;
char ch = getchar(), last = ' ';
while (ch < '0' || ch > '9') {
last = ch;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
ans = ans * 10 + ch - '0';
ch = getchar();
}
if (last == '-') ans = -ans;
return ans;
}
int main(int argc, char const *argv[]) {
int n;
n = read();
f[1][2] = f[2][1] = 3;
f[1][3] = f[3][1] = 4;
f[1][4] = f[4][1] = 6;
f[1][5] = f[5][1] = 9;
f[1][6] = f[6][1] = 14;
f[1][7] = f[7][1] = 22;
f[1][8] = f[8][1] = 31;
f[1][9] = f[9][1] = 40;
f[1][10] = f[10][1] = 54;
f[1][11] = f[11][1] = 75;
f[1][12] = f[12][1] = 96;
f[1][13] = f[13][1] = 129;
f[1][14] = f[14][1] = 153;
f[1][15] = f[15][1] = 183;
f[1][16] = f[16][1] = 213;
f[1][17] = f[17][1] = 259;
f[1][18] = f[18][1] = 317;
f[1][19] = f[19][1] = 375;
f[1][20] = f[20][1] = 414;
f[2][3] = f[3][2] = 5;
for (int j = 4; j <= n; j++) {
for (int i = 2; i < j; i++) {
if (i == 2) f[2][j] = f[j][2] = f[2][3] + f[1][j] - f[1][3];
if (i != 2) f[i][j] = f[j][i] = f[2][i] + f[1][j] - f[1][2];
}
if (!f[1][j + 1]) f[1][j + 1] = f[j + 1][1] = f[j - 1][j] + 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) cout << f[i][j] << " ";
cout << endl;
}
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
const int inf = 1034567891;
const long long LL_INF = 1234567890123456789ll;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T>
T GCD(T a, T b) {
long long t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T>
string toString(T a) {
return to_string(a);
}
template <typename T>
void toInt(string s, T& x) {
stringstream str(s);
str >> x;
}
inline int add(int x, int y) {
x += y;
if (x >= mod) x -= mod;
return x;
}
inline int sub(int x, int y) {
x -= y;
if (x < 0) x += mod;
return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int powr(int a, long long b) {
int x = 1 % mod;
while (b) {
if (b & 1) x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
const int K = 20;
int dp[1 << K];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string str;
cin >> str;
int n = str.size();
for (int i = 0; i < n; i++) {
int mask = 0, j = i;
for (j = i; j < n; j++) {
int x = str[j] - 'a';
if ((mask & (1 << x))) break;
mask += (1 << x);
dp[mask] = j - i + 1;
}
}
for (int mask = 0; mask < (1 << K); mask++) {
for (int j = 0; j < K; j++) {
if ((mask >> j) & 1) {
dp[mask] = max(dp[mask], dp[mask ^ (1 << j)]);
}
}
}
int ans = 0;
for (int mask = 0; mask < (1 << K); mask++) {
ans = max(ans, dp[mask] + dp[((1 << K) - 1) ^ mask]);
}
cout << ans << '\n';
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int ans = 0;
while (n >= 10) {
ans++;
n++;
while (n % 10 == 0) n /= 10;
}
cout << ans + 9;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10005;
const int INF = 0x3f3f3f3f;
int x[MAXN], y[MAXN];
int n, m, k;
queue<int> q;
int vis[MAXN];
int dis[MAXN];
int SPFA() {
while (!q.empty()) q.pop();
memset(vis, 0, sizeof vis);
memset(dis, 0x3f, sizeof dis);
dis[1] = 0;
vis[1] = 1;
q.push(1);
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = 0;
for (int i = 1; i <= k; i++) {
if (i == u) continue;
int dx = abs(x[u] - x[i]), dy = abs(y[u] - y[i]);
int add = INF;
if (dx <= 2 || dy <= 2) add = 1;
if (dx + dy == 1) add = 0;
if (dis[i] > dis[u] + add) {
dis[i] = dis[u] + add;
if (!vis[i]) {
q.push(i);
vis[i] = 1;
}
}
}
}
if (dis[k] >= INF) dis[k] = -1;
return dis[k];
}
int main() {
cin >> n >> m >> k;
int f = 0;
for (int i = 1; i <= k; i++) {
cin >> x[i] >> y[i];
if (x[i] == n && y[i] == m) {
f = 1;
}
}
if (!f) {
x[++k] = n + 1;
y[k] = m + 1;
}
cout << SPFA() << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
int main(void) {
char ques[101];
int i;
gets(ques);
for (i = strlen(ques) - 1; i >= 0; i--)
if ((ques[i] >= 'a' && ques[i] <= 'z') ||
(ques[i] >= 'A' && ques[i] <= 'Z')) {
if (ques[i] == 'a' || ques[i] == 'A' || ques[i] == 'e' ||
ques[i] == 'E' || ques[i] == 'i' || ques[i] == 'I' ||
ques[i] == 'o' || ques[i] == 'O' || ques[i] == 'u' ||
ques[i] == 'U' || ques[i] == 'y' || ques[i] == 'Y')
printf("YES\n");
else
printf("NO\n");
break;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
void ps() { system("pause"); }
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, d, t, playerPos = 0;
vector<pair<int, int>> wood;
vector<int> index;
cin >> n >> m >> d;
for (int i = 0; i < n; i++) {
index.push_back(0);
}
for (int i = 0; i < m; i++) {
cin >> t;
wood.push_back(make_pair(0, t));
}
int c = 0;
for (int i = m - 1; i >= 0; i--) {
c += wood[i].second;
wood[i].first = n + 1 - c;
}
for (int i = 0; i < m; i++) {
while (1) {
if (playerPos + d >= wood[i].first) {
playerPos = wood[i].first + wood[i].second - 1;
break;
} else {
wood[i].first--;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < wood[i].second; j++) {
index[wood[i].first + j - 1] = i + 1;
}
}
if (playerPos + d >= n + 1) {
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << index[i] << " ";
}
} else
cout << "NO";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2 * 1e5;
long long n, m, p, ok, cnt, a[maxn], b[maxn];
map<long long, long long> cur, mp;
vector<long long> ans;
inline void insert(long long x) {
if (cur[x] == mp[x]) ok--;
cur[x]++;
cnt++;
if (cur[x] == mp[x]) ok++;
}
inline void erase(long long x) {
if (cur[x] == mp[x]) ok--;
cur[x]--;
cnt--;
if (cur[x] == mp[x]) ok++;
}
int main() {
ios_base ::sync_with_stdio(0);
cin >> n >> m >> p;
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long i = 0; i < m; i++) {
cin >> b[i];
mp[b[i]]++;
cur[b[i]] = 0;
}
for (long long i = 0; i < p; i++) {
if ((i + (m - 1) * p) >= n) continue;
long long x = i;
for (long long j = 0; j < m; j++, x += p)
if (mp.find(a[x]) != mp.end()) insert(a[x]);
if (ok == mp.size() && cnt == m) ans.push_back(i);
for (; x < n; x += p) {
if (mp.find(a[x - m * p]) != mp.end()) erase(a[x - m * p]);
if (mp.find(a[x]) != mp.end()) insert(a[x]);
if (ok == mp.size() && cnt == m) ans.push_back(x - (m - 1) * p);
}
for (map<long long, long long>::iterator it = cur.begin(); it != cur.end();
it++)
it->second = 0;
ok = cnt = 0;
}
sort(ans.begin(), ans.end());
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) cout << ans[i] + 1 << ' ';
cout << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, max = 0, ans = 0, sum, i, j, a[100];
cin >> n >> l;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) max = a[i];
}
if (l <= max) {
for (i = l; i <= max; i++) {
sum = 0;
for (j = 0; j < n; j++) sum += a[j] / i * i;
if (sum > ans) ans = sum;
}
}
cout << ans << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
const long long inf = 1ll << 61;
const int hinf = 0x3f3f3f3f;
const long long mod = 1000000007;
int n, q;
long long v[100010];
int c[100010];
long long dp[100010];
long long a, b;
int main() {
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) scanf("%I64d", &v[i]);
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
while (q--) {
scanf("%I64d%I64d", &a, &b);
for (int i = 1; i <= n; i++) dp[i] = -inf;
pair<int, int> pa;
pa.first = pa.second = -hinf;
for (int i = 1; i <= n; i++) {
if (pa.first == -hinf && pa.second == -hinf) {
dp[c[i]] = b * v[i];
pa.first = c[i];
} else if (pa.second == -hinf) {
if (pa.first == c[i]) {
if (a * v[i] > 0) {
dp[c[i]] = dp[pa.first] + a * v[i];
}
if (b * v[i] > dp[c[i]]) {
dp[c[i]] = b * v[i];
}
} else {
long long ano = dp[pa.first] + b * v[i];
long long ano2 = b * v[i];
if (max(ano, ano2) > dp[pa.first]) {
dp[c[i]] = max(ano, ano2);
pa.second = pa.first;
pa.first = c[i];
} else {
dp[c[i]] = max(ano, ano2);
pa.second = c[i];
}
}
} else {
if (pa.first == c[i]) {
long long ano = dp[pa.first] + a * v[i];
long long ano2 = dp[pa.second] + b * v[i];
long long ano3 = b * v[i];
if (max(ano, max(ano2, ano3)) > dp[pa.first]) {
dp[pa.first] = max(ano, max(ano2, ano3));
}
} else if (pa.second == c[i]) {
long long ano = dp[pa.second] + a * v[i];
long long ano2 = dp[pa.first] + b * v[i];
long long ano3 = b * v[i];
if (max(ano, max(ano2, ano3)) > dp[pa.first]) {
pa.second = pa.first;
pa.first = c[i];
dp[c[i]] = max(ano, max(ano2, ano3));
} else if (max(ano, max(ano2, ano3)) > dp[pa.second]) {
dp[pa.second] = max(ano, max(ano2, ano3));
}
} else {
long long ano = dp[pa.first] + b * v[i];
long long ano2 = dp[c[i]] == -inf ? b * v[i] : dp[c[i]] + a * v[i];
long long ano3 = b * v[i];
if (max(ano, max(ano2, ano3)) > dp[c[i]])
dp[c[i]] = max(ano, max(ano2, ano3));
if (max(ano, max(ano2, ano3)) > dp[pa.first]) {
pa.second = pa.first;
pa.first = c[i];
} else if (max(ano, max(ano2, ano3)) > dp[pa.second]) {
pa.second = c[i];
}
}
}
}
if (pa.first == -hinf || dp[pa.first] < 0)
puts("0");
else
cout << dp[pa.first] << '\n';
}
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
long long arr[500005];
long long n, ars, res;
void solve() {
long long i, x;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &x);
while (ars > 1 && arr[ars - 1] >= arr[ars] && x >= arr[ars]) {
res += min(arr[ars - 1], x);
ars--;
}
arr[++ars] = x;
}
sort(arr + 1, arr + 1 + ars);
for (i = 1; i <= ars - 2; i++) res += arr[i];
printf("%lld\n", res);
}
int main() {
solve();
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 155;
const int INF = 1e9;
int dp[2][N][N * N];
int Q[N];
int main() {
int n, k, s;
cin >> n >> k >> s;
for (int i = 1; i <= n; ++i) cin >> Q[i];
if (s > N * N) {
sort(Q + 1, Q + n + 1);
int ans = 0;
for (int i = 1; i <= k; ++i) ans += Q[i];
cout << ans << endl;
return 0;
}
for (int i = 1; i <= n; ++i) {
for (int tak = 0; tak <= min(k, i); ++tak) {
for (int swp = 0; swp <= s; ++swp) dp[1][tak][swp] = INF;
}
for (int tak = 0; tak <= min(k, i); ++tak) {
for (int swp = 0; swp <= s; ++swp) {
if (tak == 0) {
dp[1][tak][swp] = 0;
continue;
}
int req;
if (tak == 0)
req = 0;
else
req = i - tak;
int &x = dp[1][tak][swp];
if (swp >= req) x = min(x, dp[0][tak - 1][swp - req] + Q[i]);
if (tak != i) x = min(x, dp[0][tak][swp]);
}
}
for (int tak = 0; tak <= min(k, i); ++tak) {
for (int swp = 0; swp <= s; ++swp) {
dp[0][tak][swp] = dp[1][tak][swp];
dp[1][tak][swp] = INF;
}
}
}
cout << dp[0][k][s] << endl;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};
vector<pair<int, int> > vec, aux;
int xa, xb, xc, xd, ya, yb, yc, yd;
long double ans = 360;
bool comp(pair<int, int> &a, pair<int, int> &b) {
if (a.first >= 0 and b.first < 0) return true;
if (a.first < 0 and b.first >= 0) return false;
if (a.first == 0 and b.first == 0) {
if (a.second >= 0 or b.second >= 0) return a.second > b.second;
return b.second > a.second;
}
int det = (a.first * b.second) - (b.first * a.second);
if (det < 0) return true;
if (det > 0) return false;
int d1 = (a.first * a.first) + (a.second * a.second);
int d2 = (b.first * b.first) + (b.second * b.second);
return d1 > d2;
}
long double takeAngle(int x, int y, int xx, int yy) {
long double aa = x * xx + y * yy;
long double bb = x * yy - y * xx;
long double angle = atan2(bb, aa);
return angle * 180 / 3.14159265358979323846;
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
if (n == 1) {
cout << "0.0000000"
<< "\n";
return 0;
}
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
aux.push_back({a, b});
}
sort(aux.begin(), aux.end(), comp);
ans = 0;
long double aux2 =
takeAngle(aux[int(aux.size()) - 1].first, aux[int(aux.size()) - 1].second,
aux[0].first, aux[0].second);
aux2 = abs(aux2);
long double maxi = aux2;
for (int i = 0; i < int(aux.size()) - 1; i++) {
long double aa = takeAngle(aux[i].first, aux[i].second, aux[i + 1].first,
aux[i + 1].second);
aa = abs(aa);
maxi = max(maxi, aa);
aux2 += aa;
}
ans = aux2 - maxi;
printf("%.10Lf\n", abs(ans));
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 220;
const long long inf = 1e18;
long long d[N][N], n, m;
vector<array<int, 3>> ed;
void APSP() {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) d[i][j] = i == j ? 0 : inf;
for (int i = 0; i < m; i++) {
int u = ed[i][0], v = ed[i][1], w = ed[i][2];
d[u][v] = d[v][u] = min(d[u][v], w * 2LL);
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
long long MDST() {
if (n == 1) return 0;
APSP();
long long ans = inf;
for (auto p : ed) {
int u = p[0], v = p[1], w = p[2];
vector<pair<long long, long long>> a;
for (int i = 1; i <= n; i++) a.push_back({d[u][i], d[v][i]});
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
pair<long long, long long> cur = a[0];
long long nw = cur.first;
for (int i = 1; i < n; i++) {
if (a[i].second > cur.second) {
nw = min(nw, (w * 2 + cur.second + a[i].first) / 2);
cur = a[i];
}
}
nw = min(nw, cur.second);
ans = min(ans, nw);
}
return ans;
}
int32_t main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v, w;
cin >> u >> v >> w;
ed.push_back({u, v, w});
}
long long ans = MDST();
cout << fixed << setprecision(2) << ans / 2.0 << '\n';
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
bool flg = false;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') flg = true;
for (; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ 48);
return flg ? -x : x;
}
int n, m, K, T, W;
char getnext() {
static char str[3];
scanf("%s", str);
return str[0];
}
char mp[210][210], w[1000010];
struct Rec {
int t, x, y;
} rec[25];
bool operator<(Rec x, Rec y) { return x.t > y.t; }
int dp[2][210][210];
bool C;
int SX, SY, TX, TY;
bool tab[5][5][210][210];
inline void check(int &x, int &y) {
if (y > x) x = y;
}
int main() {
n = read(), m = read(), K = read(), W = read(), T = read();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
mp[i][j] = getnext();
if (mp[i][j] == 'M')
SX = i, SY = j, mp[i][j] = 'S';
else if (mp[i][j] == 'P')
TX = i, TY = j, mp[i][j] = 'S';
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (mp[i][j] == 'L') continue;
tab[0 + 2][0 + 2][i][j] = 1;
tab[0 + 2][1 + 2][i][j] = j + 1 <= m && mp[i][j + 1] != 'L';
tab[0 + 2][2 + 2][i][j] =
j + 2 <= m && mp[i][j + 1] != 'L' && mp[i][j + 2] != 'L';
tab[0 + 2][-1 + 2][i][j] = j - 1 >= 1 && mp[i][j - 1] != 'L';
tab[0 + 2][-2 + 2][i][j] =
j - 2 >= 1 && mp[i][j - 1] != 'L' && mp[i][j - 2] != 'L';
tab[1 + 2][0 + 2][i][j] = i + 1 <= n && mp[i + 1][j] != 'L';
tab[2 + 2][0 + 2][i][j] =
i + 2 <= n && mp[i + 1][j] != 'L' && mp[i + 2][j] != 'L';
tab[-1 + 2][0 + 2][i][j] = i - 1 >= 1 && mp[i - 1][j] != 'L';
tab[-2 + 2][0 + 2][i][j] =
i - 2 >= 1 && mp[i - 1][j] != 'L' && mp[i - 2][j] != 'L';
tab[-1 + 2][1 + 2][i][j] = i - 1 >= 1 && j + 1 <= m &&
(mp[i - 1][j] != 'L' || mp[i][j + 1] != 'L') &&
mp[i - 1][j + 1] != 'L';
tab[-1 + 2][-1 + 2][i][j] =
i - 1 >= 1 && j - 1 >= 1 &&
(mp[i - 1][j] != 'L' || mp[i][j - 1] != 'L') &&
mp[i - 1][j - 1] != 'L';
tab[1 + 2][1 + 2][i][j] = i + 1 <= n && j + 1 <= m &&
(mp[i + 1][j] != 'L' || mp[i][j + 1] != 'L') &&
mp[i + 1][j + 1] != 'L';
tab[1 + 2][-1 + 2][i][j] = i + 1 <= n && j - 1 >= 1 &&
(mp[i + 1][j] != 'L' || mp[i][j - 1] != 'L') &&
mp[i + 1][j - 1] != 'L';
}
for (int i = 1; i <= T; i++) w[i] = getnext();
for (int i = 1; i <= W; i++)
rec[i].x = read() + 1, rec[i].y = read() + 1, rec[i].t = read();
int lim = (W + 1) * K;
sort(rec + 1, rec + W + 1);
while (W && rec[W].t == 0) W--;
memset(dp[C], -1, sizeof dp[C]);
dp[C][SX][SY] = K;
for (int t = 1; t <= T && t <= lim; t++) {
C ^= 1;
memset(dp[C], -1, sizeof dp[C]);
int dx, dy;
if (w[t] == 'C')
dx = dy = 0;
else if (w[t] == 'N')
dx = -1, dy = 0;
else if (w[t] == 'S')
dx = 1, dy = 0;
else if (w[t] == 'W')
dx = 0, dy = -1;
else if (w[t] == 'E')
dx = 0, dy = 1;
else
assert(0);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (dp[C ^ 1][i][j] < 1) continue;
int s = dp[C ^ 1][i][j] - 1;
if (tab[dx + 2][dy + 2][i][j]) check(dp[C][i + dx][j + dy], s);
if (tab[dx + 1 + 2][dy + 2][i][j]) check(dp[C][i + dx + 1][j + dy], s);
if (tab[dx - 1 + 2][dy + 2][i][j]) check(dp[C][i + dx - 1][j + dy], s);
if (tab[dx + 2][dy + 1 + 2][i][j]) check(dp[C][i + dx][j + dy + 1], s);
if (tab[dx + 2][dy - 1 + 2][i][j]) check(dp[C][i + dx][j + dy - 1], s);
}
while (W && rec[W].t == t) {
int x = rec[W].x, y = rec[W].y;
if (~dp[C][x][y]) dp[C][x][y] = K;
W--;
}
if (~dp[C][TX][TY]) return printf("%d\n", t), 0;
}
puts("-1");
return 0;
}
| 11 |
#include <bits/stdc++.h>
int n, a[444], s, p, q, ans;
int main() {
scanf("%d", &n);
ans = -1;
for (int i = 0; i < n; ++i) scanf("%d", a + i);
for (int i = 1; i < n; ++i)
for (int j = 0; j < n; ++j) {
p = a[i - 1] - 1;
for (int k = q = s = 0; k <= j;)
q += p / a[k], s += p / a[k] * a[k], p %= a[k++];
++q, p = s += a[j];
for (int k = 0; k < n; ++k) q -= p / a[k], p %= a[k];
if (q < 0) ans = (unsigned)ans < s ? ans : s;
}
printf("%d\n", ans);
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a + b + c) & 1) {
puts("Impossible");
return 0;
}
int jun = (a + b + c) >> 1;
if (jun < a || jun < b || jun < c) {
puts("Impossible");
return 0;
}
printf("%d %d %d\n", jun - c, jun - a, jun - b);
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
long long ans = 0;
vector<int> a(m), b(m), c(m), x(k);
for (int i = 0; i < m; i++) cin >> a[i] >> b[i] >> c[i];
for (int i = 0; i < x.size(); i++) cin >> x[i];
for (int i = 0; i < m; i++) {
for (int j = 0; j < k; j++) {
if (x[j] >= a[i] && x[j] <= b[i]) ans += (c[i] + (x[j] - a[i]));
}
}
cout << ans;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long dp[20][20];
long long pow1(long long a, long long b) {
long long res = 1;
while (b != 0) {
if (b & 1) res = (res * a);
a = (a * a);
b >>= 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (i) {
dp[i][j] = max(dp[i][j], dp[i - 1][j] + ((s[2 * n - i - j] - '0') *
pow1(10, i - 1)));
}
if (j) {
dp[i][j] = max(dp[i][j], dp[i][j - 1] + ((s[2 * n - i - j] - '0') *
pow1(10, j - 1)));
}
}
}
for (int i = n, j = n; (i > 0 || j > 0);) {
if (i &&
dp[i - 1][j] + ((s[2 * n - i - j] - '0') * pow1(10, i - 1)) == dp[i][j])
cout << 'H', i--;
else
cout << 'M', j--;
}
cout << "\n";
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, sgn = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') sgn = -1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
return x * sgn;
}
const int N = 1e5 + 10;
int n;
long long ans1, ans2;
struct line {
int x, y, l, r;
} seg[N];
bool cmp1(line a, line b) { return a.x < b.x; }
bool cmp2(line a, line b) { return a.y < b.y; }
struct BITT {
int arr[N << 1];
void add(int x, int v = 1) {
for (; x <= (n * 2); x += x & -x) arr[x] += v;
return;
}
int q(int x, int v = 0) {
for (; x; x -= x & -x) v += arr[x];
return v;
}
void clear() { memset(arr, 0, sizeof(arr)); }
} BIT;
int main() {
n = read();
for (int i = 1; i <= n; i++) seg[i].x = read(), seg[i].y = read();
for (int i = 1; i <= n; i++)
if (seg[i].x > seg[i].y) swap(seg[i].x, seg[i].y);
sort(seg + 1, seg + n + 1, cmp1);
for (int i = 1; i <= n; i++) {
seg[i].l += BIT.q(seg[i].x) + BIT.q(n << 1) - BIT.q(seg[i].y);
BIT.add(seg[i].y);
}
BIT.clear();
for (int i = n; i >= 1; i--) {
seg[i].r += BIT.q(seg[i].y);
BIT.add(seg[i].y);
}
BIT.clear();
sort(seg + 1, seg + n + 1, cmp2);
for (int i = n; i >= 1; i--) {
seg[i].l += BIT.q(n << 1) - BIT.q(seg[i].y);
BIT.add(seg[i].x);
}
ans1 = 1ll * n * (n - 1) * (n - 2) / 6;
for (int i = 1; i <= n; i++) {
ans1 -= 1ll * seg[i].l * seg[i].r;
ans2 += 1ll * (seg[i].l + seg[i].r) * (n - seg[i].l - seg[i].r - 1);
}
printf("%lld\n", ans1 - ans2 / 2);
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, t;
int step = 0;
cin >> s >> t;
int j = 0, i = 0;
while (i < t.size()) {
if (s[j] == t[i]) {
j++;
}
i++;
}
cout << j + 1;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, y;
long long c = 0;
cin >> n;
vector<pair<long long, long long> > v;
map<long long, long long> m, m1;
map<long long, long long>::iterator it;
long long t, r;
for (int i = 0; i < n; i++) {
cin >> t >> r;
if (t == r) {
r = -1;
} else {
m1[r]++;
}
m[t]++;
}
for (it = m.begin(); it != m.end(); it++) {
v.push_back(make_pair(it->second, it->first));
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < v.size(); i++) {
if ((v[i].first + m1[v[i].second]) >= ceil(n / 2.0)) {
if (v[i].first >= ceil(n / 2.0)) {
cout << 0;
return 0;
}
cout << abs(v[i].first - ceil(n / 2.0));
return 0;
}
}
for (it = m1.begin(); it != m1.end(); it++) {
if (it->second >= ceil(n / 2.0)) {
cout << ceil(n / 2.0);
return 0;
}
}
cout << -1;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int ask(int a, int b) {
cout << "? " << a + 1 << ' ' << b + 1 << '\n';
int z;
cin >> z;
cout.flush();
return z;
}
int main() {
int n;
cin >> n;
vector<int> ans(n, -1);
int mx = 0;
for (int i = 1; i < n; i++) {
int a = ask(mx, i);
int b = ask(i, mx);
if (a > b) {
ans[mx] = a;
mx = i;
} else {
ans[i] = b;
}
}
ans[mx] = n;
cout << "! ";
for (int i = (0); (1) > 0 ? i < (n) : i > (n); i += (1))
cout << ans[i] << ' ';
cout << '\n';
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e15;
const long long NINF = -INF;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int ninf = -inf;
long long pow(long long a, long long b, long long mod) {
if (b == 0) return 1;
if (b == 1) return a;
long long res = pow(a, b / 2, mod);
if (b & 1) {
return (res % mod * (res % mod * a % mod) % mod) % mod;
} else {
return (res % mod * res % mod) % mod;
}
}
double fpow(float a, int b) {
if (b == 0) return 1;
if (b == 1) return a;
double res = fpow(a, b / 2);
if (b & 1) {
return res * res * a;
}
return res * res;
}
long long modInverse(long long n, long long mod) {
return pow(n, mod - 2, mod) % mod;
}
long long nCr(long long n, long long r, long long mod) {
long long fact[n + 1];
fact[1] = 1;
for (long long i = 2; i <= n; i++) {
fact[i] = (fact[i - 1] % mod * i % mod) % mod;
}
return (fact[n] % mod *
(modInverse(fact[r], mod) % mod * modInverse(fact[n - r], mod) %
mod) %
mod) %
mod;
}
vector<int> sieve(int n) {
vector<int> primes;
bool visited[n + 1];
memset(visited, 0, sizeof visited);
int i, j;
for (i = 2; i * i <= n; i++) {
if (visited[i]) continue;
for (j = 2 * i; j <= n; j += i) {
visited[j] = true;
}
}
for (i = 2; i <= n; i++) {
if (!visited[i]) primes.push_back(i);
}
return primes;
}
void solve() {
long long n;
cin >> n;
long long orig = n;
long long ans = 0;
bool chance = 0;
while (n > 0) {
if (chance) {
if (n & 1) {
n--;
} else if (n == 4) {
ans++;
break;
} else {
long long num = n / 2;
if (num & 1) {
n = n / 2;
} else {
n--;
}
}
} else {
if (n & 1) {
n--;
ans++;
} else if (n == 4) {
ans = ans + 3;
break;
} else {
long long num = n / 2;
if (num & 1) {
ans += n / 2;
n = n / 2;
} else {
ans++;
n--;
}
}
}
chance = !chance;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
inline long long int add(long long int a, long long int b) {
long long int c = (a % 1000000007) + (b % 1000000007);
if (c >= 1000000007) c -= 1000000007;
return c;
}
inline long long int mul(long long int a, long long int b) {
return ((a % 1000000007) * 1ll * (b % 1000000007)) % 1000000007;
}
inline long long int sub(long long int a, long long int b) {
long long int c = (a % 1000000007) - (b % 1000000007);
if (c < 0) c += 1000000007;
return c;
}
const long long int nax = 300 * 1000 + 10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void test_case();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
while (t--) {
test_case();
}
return 0;
}
long long int nc, ns, nt;
string c, s, t;
vector<long long int> pi_s, pi_t;
long long int nxt[2][52][27];
long long int dp[1010][52][52];
long long int vis[1010][52][52];
vector<long long int> prefix_function(string s, long long int c) {
long long int n = (long long int)s.size();
vector<long long int> pi(n, 0);
for (long long int i = 1; i < n; ++i) {
long long int j = pi[i - 1];
while (j > 0 && s[i] != s[j]) {
j = pi[j - 1];
}
if (s[i] == s[j]) {
++j;
}
pi[i] = j;
}
for (long long int i = 0; i < n; ++i) {
for (long long int ch = 0; ch < 26; ++ch) {
long long int id = i;
while (id > 0 && ch != (s[id] - 'a')) {
id = pi[id - 1];
}
if ((s[id] - 'a') == ch) {
++id;
}
nxt[c][i][ch] = id;
}
}
return pi;
}
long long int f(long long int id, long long int cur_s, long long int cur_t) {
if (id >= nc) {
return 0LL;
}
long long int& ans = dp[id][cur_s][cur_t];
if (vis[id][cur_s][cur_t]) {
return ans;
}
vis[id][cur_s][cur_t] = 1;
ans = -4e18;
long long int l = 0, r = 25;
if (c[id] != '*') {
l = r = (c[id] - 'a');
}
for (long long int ch = l; ch <= r; ++ch) {
long long int next_s = nxt[0][cur_s][ch];
long long int next_t = nxt[1][cur_t][ch];
if (next_s == ns && next_t == nt) {
ans = max(ans, f(id + 1, pi_s[ns - 1], pi_t[nt - 1]));
} else if (next_s == ns) {
ans = max(ans, 1 + f(id + 1, pi_s[ns - 1], next_t));
} else if (next_t == nt) {
ans = max(ans, -1 + f(id + 1, next_s, pi_t[nt - 1]));
} else {
ans = max(ans, f(id + 1, next_s, next_t));
}
}
return ans;
}
void test_case() {
cin >> c >> s >> t;
nc = (long long int)c.size(), ns = (long long int)s.size(),
nt = (long long int)t.size();
pi_s = prefix_function(s, 0);
pi_t = prefix_function(t, 1);
cout << f(0, 0, 0);
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int sl = s.length(), tl = t.length();
int i = 0, si = 0;
while (i < tl && si < sl) {
if (t[i] == s[si]) si++;
i++;
}
if (si == sl) i--;
int j = tl - 1;
si = sl - 1;
while (j >= 0 && si >= 0) {
if (t[j] == s[si]) si--;
j--;
}
if (si == -1) j++;
int ans = max(0, j - i);
cout << ans << "\n";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void FAST() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
long long power(long long x, long long n) {
if (n == 0) return 1;
if (n & 1) return (x * power(x, n - 1) % 1000000009) % 1000000009;
long long p = power(x, n / 2) % 1000000009;
return (p * p) % 1000000009;
}
int main() {
FAST();
long long n, m, k, x, ans1 = 0, ans = 0, slots = 0;
cin >> n >> m >> k;
slots = n / k;
if (n % k != 0) {
long long r = n % k;
if (m / (slots + 1) > r) {
ans1 = r;
m -= r;
} else {
ans1 = m / (slots + 1);
m -= m / (slots + 1);
}
}
if (slots * k == m) {
x = slots;
ans = (ans % 1000000009 + ((2 * k) * (power(2, x) - 1)) % 1000000009) %
1000000009;
} else {
x = m % slots;
long long y = m / slots;
if (y + 1 == k) {
ans = (ans % 1000000009 + ((2 * k) * (power(2, x) - 1)) % 1000000009) %
1000000009;
x = m % slots;
ans = (ans % 1000000009 + (slots - x) * (m / slots) % 1000000009) %
1000000009;
} else
ans = m;
}
cout << (ans + ans1) % 1000000009;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 != 0) {
for (int i = 0; i < n; i++) {
cout << i << " ";
}
cout << endl;
for (int i = 0; i < n; i++) {
cout << i << " ";
}
cout << endl;
for (int i = 0; i < n; i++) {
cout << (i + i) % n << " ";
}
cout << endl;
} else
cout << -1 << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const long long llINF = 9223372036854775807;
const int INF = 2147483647;
const int maxn = 1e6 + 7;
const int maxm = 1e5 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-8;
long long base = 131;
long long h[maxn];
void hashs(char s[]) {
int len = strlen(s + 1);
h[0] = 0;
for (int i = 1; i <= len; i++) {
h[i] = (h[i - 1] * base + (s[i] - 'a' + 1)) % mod;
}
return;
}
long long poww(long long a, long long b) {
long long ans = 1, base = a;
while (b != 0) {
if (b & 1 != 0) ans = (ans * base) % mod;
base = (base * base) % mod;
b >>= 1;
}
return ans % mod;
}
long long get(int l, int r) {
return (h[r] - h[l - 1] * poww(base, r - l + 1) % mod + mod) % mod;
}
char s[maxn], t[maxn];
long long cnt0, cnt1;
long long ans;
int main(int argc, char const *argv[]) {
scanf("%s", s + 1);
scanf("%s", t + 1);
hashs(t);
long long lens = strlen(s + 1);
long long lent = strlen(t + 1);
for (int i = 1; i <= lens; i++) {
if (s[i] == '1')
cnt1++;
else
cnt0++;
}
long long r0, r1;
for (r0 = 1; r0 <= lent; r0++) {
if ((lent - cnt0 * r0) > 0 && ((lent - cnt0 * r0) % cnt1) == 0) {
r1 = (lent - cnt0 * r0) / cnt1;
int flag = 1;
int p = 1;
long long ans0 = 0, ans1 = 0;
int flag0 = 0, flag1 = 0;
for (int i = 1; i <= lens; i++) {
if (s[i] == '0' && flag0 == 0) {
flag0 = 1;
ans0 = get(p, p + r0 - 1);
p = p + r0;
continue;
} else if (s[i] == '1' && flag1 == 0) {
flag1 = 1;
ans1 = get(p, p + r1 - 1);
p = p + r1;
continue;
} else if (s[i] == '0') {
long long tmp0 = get(p, p + r0 - 1);
if (tmp0 != ans0) {
flag = 0;
break;
}
p = p + r0;
continue;
} else {
long long tmp1 = get(p, p + r1 - 1);
if (tmp1 != ans1) {
flag = 0;
break;
}
p = p + r1;
continue;
}
}
if (ans1 == ans0) flag = 0;
if (flag) ans++;
}
}
printf("%lld\n", ans);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
char s[maxn];
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
scanf("%s", s);
int sum0 = 0, cnt1 = 0;
for (int i = 0; i < n;) {
for (; i < n && s[i] == '*'; i++)
;
int j = i;
for (; j < n && s[j] == '.'; j++)
;
int temp = j - i;
if (temp & 1) {
cnt1++;
sum0 += temp - 1;
} else {
sum0 += temp;
}
i = j + 1;
}
int c = min(a, b);
int ans;
if (c * 2 >= sum0) {
ans = sum0;
a -= sum0 / 2;
b -= sum0 / 2;
ans += min(cnt1, a + b);
} else {
ans = c * 2;
a -= c;
b -= c;
cnt1 += (sum0 - 2 * c) / 2;
ans += min(cnt1, a + b);
}
cout << ans << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int LCM = 840;
ll dp[9][LCM];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll w;
cin >> w;
for (int i = 1; i <= 8; ++i) {
ll cnt;
cin >> cnt;
for (int j = 0; j < LCM; ++j) {
ll add = min((w - dp[i - 1][j]) / i, cnt);
for (ll k = max(0LL, add - LCM / i + 1); k <= add; ++k) {
ll res = dp[i - 1][j] + k * i;
dp[i][res % LCM] = max(dp[i][res % LCM], res);
}
}
}
cout << *max_element(dp[8], dp[8] + LCM) << '\n';
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int n, m, t = 1;
set<int> adj[200001];
vector<int> height(200001);
vector<tuple<int, int, int>> ans;
void insert_triple(int a, int b, int c) {
adj[a].erase(adj[a].find(b));
adj[b].erase(adj[b].find(a));
adj[b].erase(adj[b].find(c));
adj[c].erase(adj[c].find(b));
ans.emplace_back(a, b, c);
}
void dfs(int now, int prev) {
height[now] = t++;
vector<int> v;
vector<int> ad(adj[now].begin(), adj[now].end());
for (int u : ad) {
if (!height[u]) dfs(u, now);
}
for (int u : adj[now]) {
if (height[u] > height[now]) v.push_back(u);
}
for (int i = 1; i < v.size(); i += 2) {
insert_triple(v[i - 1], now, v[i]);
}
if (v.size() % 2) {
if (prev != 0) insert_triple(prev, now, v.back());
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
while (m--) {
int x, y;
cin >> x >> y;
adj[x].insert(y);
adj[y].insert(x);
}
for (int i = 1; i <= n; i++) {
if (!height[i]) dfs(i, 0);
}
cout << ans.size() << '\n';
for (auto [u, v, w] : ans) {
cout << u << ' ' << v << ' ' << w << '\n';
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int t, n, d;
int p[5010], dep[5010], deg[5010];
bitset<5010> no;
int getLow(int x) {
int ret = 0, k = 0;
while (x) {
ret += min(x, (1 << k)) * k;
x = max(0, x - (1 << k));
++k;
}
return ret;
}
void solve() {
cin >> n >> d;
if (d < getLow(n) || n * (n - 1) / 2 < d) {
cout << "NO\n";
return;
}
for (int i = 1; i <= n; i++) no[i] = false;
deg[1] = 2;
for (int i = 2; i <= n; i++) p[i] = i - 1, dep[i] = i - 1, deg[i] = 2;
deg[n] = 1;
int cnt = n * (n - 1) / 2;
dep[0] = 1e9;
while (cnt > d) {
int v = 0;
for (int i = 1; i <= n; i++) {
if (!no[i] && deg[i] == 1 && dep[v] > dep[i]) v = i;
}
if (v == 0) {
cout << "NO\n";
return;
}
for (int i = 1; i <= n; i++) {
if (deg[i] <= 2 && dep[i] == dep[v] - 2) {
deg[p[v]]--;
deg[i]++;
dep[v]--;
p[v] = i;
break;
}
if (i == n) no[v] = true;
}
if (!no[v]) --cnt;
}
cout << "YES\n";
for (int i = 2; i <= n; i++) cout << p[i] << " \n"[i == n];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> t;
while (t--) solve();
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long MAX = 1e17;
map<int, int> mymap;
int main() {
ios_base::sync_with_stdio(0);
;
int n, m, k, r;
cin >> n >> m >> r >> k;
vector<pair<long long, long long> > hor, ver;
for (int i = 1; i <= n; i++) {
mymap[min(min(r, n - r + 1), min(i, n + 1 - i))]++;
}
for (auto it = mymap.begin(); it != mymap.end(); ++it) {
hor.push_back({it->first, it->second});
}
mymap.clear();
for (int i = 1; i <= m; i++) {
mymap[min(min(r, m - r + 1), min(i, m + 1 - i))]++;
}
for (auto it = mymap.begin(); it != mymap.end(); ++it) {
ver.push_back({it->first, it->second});
}
sort(hor.begin(), hor.end());
sort(ver.begin(), ver.end());
long long tot = ((long long)(n - r + 1)) * ((long long)(m - r + 1));
long long hor_size = hor.size(), ver_size = ver.size();
set<pair<long long, long long> > s;
long long id[hor_size];
for (int i = 0; i < hor_size; ++i) {
id[i] = ver_size;
s.insert({((long long)(i + 1)) * ver_size, i});
}
long long ans = 0;
int counter = k;
while (counter > 0) {
auto it = s.rbegin();
long long x = (*it).first;
long long y = (*it).second;
s.erase(next(it).base());
long long temp = hor[y].second * ver[id[y] - 1].second;
if (temp >= counter) {
ans += x * counter;
break;
} else {
ans += x * temp;
if (id[y] > 1) {
id[y]--;
s.insert({(y + 1) * (id[y]), y});
}
counter -= temp;
}
}
double fi = ((double)ans) / ((double)tot);
printf("%0.10f\n", fi);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
swap(a, b);
}
return a;
}
template <class _T>
inline _T sqr(const _T& first) {
return first * first;
}
template <class _T>
inline string tostr(const _T& a) {
ostringstream os("");
os << a;
return os.str();
}
const long double PI = 3.1415926535897932384626433832795L;
const double EPS = 1e-9;
char TEMPORARY_CHAR;
const int INF = 1e9;
inline void input(int& a) {
a = 0;
while (((TEMPORARY_CHAR = getchar()) > '9' || TEMPORARY_CHAR < '0') &&
(TEMPORARY_CHAR != '-')) {
}
char neg = 0;
if (TEMPORARY_CHAR == '-') {
neg = 1;
TEMPORARY_CHAR = getchar();
}
while (TEMPORARY_CHAR <= '9' && TEMPORARY_CHAR >= '0') {
a = 10 * a + TEMPORARY_CHAR - '0';
TEMPORARY_CHAR = getchar();
}
if (neg) a = -a;
}
inline void out(long long a) {
if (!a) putchar('0');
if (a < 0) {
putchar('-');
a = -a;
}
char s[20];
int i;
for (i = 0; a; ++i) {
s[i] = '0' + a % 10;
a /= 10;
}
for (int j = (i)-1; j >= 0; j--) putchar(s[j]);
}
inline int nxt() {
int(ret);
input((ret));
;
return ret;
}
void apply(vector<int>& first, const vector<int>& p) {
vector<int> res(first.size());
int n = first.size();
for (int i = 0; i < n; ++i) {
res[p[i]] = first[i];
}
first.swap(res);
}
void multiply(vector<int>& first, const vector<int>& p) {
vector<int> res(first.size());
int n = first.size();
for (int i = 0; i < n; ++i) {
res[i] = p[first[i]];
}
first.swap(res);
}
void apply(vector<int> p, int k, vector<int>& first) {
while (k) {
if (k & 1) {
apply(first, p);
}
multiply(p, p);
k >>= 1;
}
}
int main() {
srand(33);
string s;
cin >> s;
int n = s.length();
int(q);
input((q));
;
vector<int> shiftLeft(n);
for (int i = 0; i < n; ++i) {
shiftLeft[i] = (i - 1 + n) % n;
}
vector<int> shiftRight(n);
for (int i = 0; i < n; ++i) {
shiftRight[i] = (i + 1) % n;
}
while (q--) {
vector<int> first(n);
for (int i = 0; i < n; ++i) {
first[i] = i;
}
int(k);
input((k));
;
int(d);
input((d));
;
vector<int> sort(n);
for (int i = 0; i < n; ++i) {
sort[i] = i;
}
int sz = 0;
for (int i = 0; i < d; ++i) {
for (int j = 0; j * d + i < k; ++j) {
sort[j * d + i] = sz++;
}
}
multiply(sort, shiftLeft);
apply(sort, n - k + 1, first);
apply(shiftRight, n - k + 1, first);
string res(n, 0);
for (int i = 0; i < n; ++i) {
res[i] = s[first[i]];
}
s = res;
cout << res << "\n";
}
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long ar[10];
long long check(long long a, long long s, long long d, long long f) {
ar[1] = a;
ar[2] = s;
ar[3] = d;
ar[4] = f;
sort(ar + 1, ar + 5);
if (ar[4] - ar[1] == (ar[2] + ar[3]) / 2 &&
ar[4] - ar[1] == ((ar[2] + ar[3] + ar[1] + ar[4]) / 4) &&
(ar[2] + ar[3] + ar[1] + ar[4]) % 4 == 0 && (ar[2] + ar[3]) % 2 == 0) {
return 1;
}
return 0;
}
int main() {
long long a, s, d, f, g, h, j, k, l;
cin >> a;
if (a == 0)
cout << "YES\n1\n1\n3\n3\n";
else if (a == 4) {
cin >> ar[1] >> ar[2] >> ar[3] >> ar[4];
sort(ar + 1, ar + 5);
if (ar[4] - ar[1] == (ar[2] + ar[3]) / 2 &&
ar[4] - ar[1] == ((ar[2] + ar[3] + ar[1] + ar[4]) / 4) &&
(ar[2] + ar[3] + ar[1] + ar[4]) % 4 == 0 && (ar[2] + ar[3]) % 2 == 0) {
cout << "YES\n";
} else
cout << "NO\n";
} else if (a == 1) {
cin >> s;
cout << "YES"
<< "\n"
<< s << "\n"
<< 3 * s << "\n"
<< 3 * s << endl;
} else if (a == 3) {
cin >> s >> d >> f;
for (g = 1; g <= 3000; g++) {
if (check(s, d, f, g)) {
cout << "YES\n";
cout << g << endl;
return 0;
}
}
cout << "NO\n";
} else {
cin >> s >> d;
for (f = 1; f <= 3000; f++) {
for (g = 1; g <= 3000; g++) {
if (check(s, d, f, g)) {
cout << "YES\n";
cout << f << "\n" << g << endl;
return 0;
}
}
}
cout << "NO\n";
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string s = str;
reverse(s.begin(), s.end());
str += s;
cout << str << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
long long arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
vector<long long> pref(n);
pref[0] = arr[0];
for (int i = 1; i < n; i++) {
pref[i] = arr[i] + pref[i - 1];
}
int l[m];
for (int i = 0; i < m; i++) {
long long a;
cin >> a;
auto it = lower_bound(pref.begin(), pref.end(), a);
int first = it - pref.begin();
if (first == 0)
cout << first + 1 << " " << a << endl;
else
cout << first + 1 << " " << a - pref[first - 1] << endl;
}
}
| 1 |
#include <bits/stdc++.h>
namespace chtholly {
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) f ^= c == '-';
for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
return f ? x : -x;
}
template <typename mitsuha>
inline bool read(mitsuha &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c) && ~c; c = getchar()) f ^= c == '-';
if (!~c) return 0;
for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
return x = f ? x : -x, 1;
}
template <typename mitsuha>
inline int write(mitsuha x) {
if (!x) return 0 & putchar(48);
if (x < 0) x = -x, putchar('-');
int bit[20], i, p = 0;
for (; x; x /= 10) bit[++p] = x % 10;
for (i = p; i; --i) putchar(bit[i] + 48);
return 0;
}
inline char fuhao() {
char c = getchar();
for (; isspace(c); c = getchar())
;
return c;
}
} // namespace chtholly
using namespace chtholly;
using namespace std;
const int yuzu = 2e5;
typedef int fuko[yuzu | 10];
fuko a, b;
map<int, int> mp;
int n, m, ans;
void ck(int v, int i = 0) {
for (mp.clear(), i = 1; i <= n; ++i) ans = max(ans, ++mp[a[i] % v]);
for (i = 1; i <= m; ++i) ans = max(ans, ++mp[(b[i] + v / 2) % v]);
}
int main(int i) {
n = read(), read();
for (i = 1; i <= n; ++i) a[i] = read();
m = read(), read();
for (i = 1; i <= m; ++i) b[i] = read();
for (i = 1; i <= 1e9; ck(i *= 2))
;
write(n == 1 && m == 1 ? 2 : ans);
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m, x, i;
cin >> n >> m;
x = max(n, m) + 1;
long long dp[x];
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
for (i = 3; i < x; i++) dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
cout << ((2 * dp[n] + 2 * dp[m] - 2) % 1000000007 + 1000000007) % 1000000007;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
class sata {
public:
void prin() { cout << "this is sata" << endl; }
};
class matha {
public:
void prin() { cout << "this is matha" << endl; }
};
int main() {
int n, i, j;
cin >> n;
if (n == 1) {
cout << "4";
return 0;
}
if (n == 2) {
cout << "6";
return 0;
}
int m = ceil(sqrt(n)) * ceil(sqrt(n));
if (m == n) {
cout << 4 * sqrt(n);
} else if ((ceil(sqrt(n)) - 1) * ceil(sqrt(n)) < n) {
cout << 2 * ceil(sqrt(n)) + 2 * (ceil(sqrt(n)));
} else
cout << 2 * ceil(sqrt(n)) + 2 * (ceil(sqrt(n)) - 1);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n <= 2)
cout << -1;
else {
while (n) {
cout << n << " ";
n--;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int S = 260;
int n, ans, now, inf;
long long cnt;
int dp[N][10], f[10][10], d[N], w[N];
long long c[10][S];
bool vis[10];
char s[N];
queue<int> q;
void bfs(int c) {
int i, k;
memset(d, 0x3f, sizeof(d));
memset(vis, 0, sizeof(vis));
while (!q.empty()) q.pop();
vis[c] = 1;
for (i = 1; i <= n; i++)
if (s[i] - 'a' == c) d[i] = 0, q.push(i);
while (!q.empty()) {
k = q.front();
q.pop();
if (!vis[s[k] - 'a']) {
vis[s[k] - 'a'] = 1;
for (i = 1; i <= n; i++)
if (s[i] == s[k] && d[i] > n) d[i] = d[k] + 1, q.push(i);
}
if (k > 1 && d[k - 1] > n) d[k - 1] = d[k] + 1, q.push(k - 1);
if (k < n && d[k + 1] > n) d[k + 1] = d[k] + 1, q.push(k + 1);
}
for (i = 1; i <= n; i++) dp[i][c] = d[i];
}
int main() {
int i, j, k, l;
scanf("%d", &n);
scanf("%s", s + 1);
memset(dp, 0x3f, sizeof(dp));
inf = dp[0][0];
for (i = 0; i < 8; i++) bfs(i);
memset(f, 0x3f, sizeof(f));
for (i = 1; i <= n; i++)
for (j = 0; j < 8; j++) f[s[i] - 'a'][j] = min(f[s[i] - 'a'][j], dp[i][j]);
for (i = 1; i <= n; i++)
for (j = 0; j < 8; j++)
if (dp[i][j] > f[s[i] - 'a'][j]) w[i] |= (1 << j);
for (i = 1; i <= n; i++) {
for (j = max(1, i - 15); j < i; j++) {
now = i - j;
for (k = 0; k < 8; k++) now = min(now, dp[i][k] + dp[j][k] + 1);
if (now == ans) cnt++;
if (now > ans) ans = now, cnt = 1;
}
j = i - 16;
if (j >= 1) c[s[j] - 'a'][w[j]]++;
for (j = 0; j < 8; j++)
for (k = 0; k < 256; k++) {
if (!c[j][k]) continue;
now = inf;
for (l = 0; l < 8; l++) {
now = min(now, dp[i][l] + f[j][l] + 1 + ((k >> l) & 1));
}
if (now == inf) continue;
if (now == ans) cnt += c[j][k];
if (now > ans) ans = now, cnt = c[j][k];
}
}
printf("%d %I64d\n", ans, cnt);
return 0;
}
| 12 |
#include <bits/stdc++.h>
/// kitsune
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <ii, int> iii;
typedef array <int, 2> ar2;
template <typename _Tp, typename _Up> bool maximize(_Tp &__a, _Up __b) { if (__a < __b) { __a = __b; return true; } return false; }
template <typename _Tp, typename _Up> bool minimize(_Tp &__a, _Up __b) { if (__a > __b) { __a = __b; return true; } return false; }
const int siz = 2e5 + 2;
const int SIZ = 1e6 + 2;
const int mod = 1e9 + 7;
const int maxx = 2e9;
const int MAXX = 1e18;
const string file = "3";
ii a[siz];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen ((file + ".inp").c_str(), "r", stdin);
// freopen ((file + ".out").c_str(), "w", stdout);
int tc;
cin >> tc;
while (tc--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].fi >> a[i].se;
}
vector <iii> hold;
for (int i = 1; i <= n; i++) {
hold.push_back(iii(ii(a[i].fi, a[i].se), i));
hold.push_back(iii(ii(a[i].se, a[i].fi), i));
}
sort (all(hold));
for (int i = 1; i < sz(hold); i++) {
if (minimize(hold[i].fi.se, hold[i - 1].fi.se)) {
hold[i].se = hold[i - 1].se;
}
}
vector <int> tmp;
for (auto x : hold) {
tmp.push_back(x.fi.fi);
}
for (int i = 1; i <= n; i++) {
int j = lower_bound(all(tmp), a[i].fi) - tmp.begin() - 1;
if (j >= 0 && hold[j].fi.se < a[i].se) {
cout << hold[j].se << " ";
} else {
cout << -1 << " ";
}
}
cout << "\n";
}
// cerr << "Time: " << 1000 * clock() / CLOCKS_PER_SEC << " ms\n";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
string s;
cin >> s;
int mass[26];
memset(mass, 0, sizeof(mass));
for (int i = 0; i < n; i++) {
mass[s[i] - 'a']++;
}
int c = 0;
for (int i = 0; i < 26;) {
if (!a) {
cout << c << endl;
return 0;
}
if (mass[i]) {
c += i + 1;
a--;
i += 2;
continue;
} else {
i++;
continue;
}
}
if (a) {
cout << -1;
} else
cout << c;
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
vector<long long int> dp(n + 1);
dp[n] = 1;
long long int blue_s = 1, red_s = 0;
long long int y = 2;
for (long long int i = n - 1; i >= 1; i--) {
if (y % 2) {
dp[i] = 1 + red_s;
if (dp[i] >= 1000000007ll) dp[i] %= 1000000007ll;
blue_s += dp[i];
if (blue_s >= 1000000007ll) blue_s %= 1000000007ll;
} else {
dp[i] = 1 + blue_s;
if (dp[i] >= 1000000007ll) dp[i] %= 1000000007ll;
red_s += dp[i];
if (red_s >= 1000000007ll) red_s %= 1000000007ll;
}
y++;
}
long long int ans =
((red_s % 1000000007ll) + (blue_s % 1000000007ll)) % 1000000007ll;
cout << ans;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
if (n < m) swap(n, m);
long long dp[n + 1][2][2];
dp[0][0][1] = dp[0][1][1] = 0;
dp[0][0][0] = dp[0][1][0] = 1;
for (int i = 0; i < n; i++) {
dp[i + 1][0][0] = dp[i][0][1] % 1000000007;
dp[i + 1][0][1] = (dp[i][1][0] + dp[i][1][1]) % 1000000007;
dp[i + 1][1][0] = dp[i][1][1] % 1000000007;
dp[i + 1][1][1] = (dp[i][0][0] + dp[i][0][1]) % 1000000007;
}
long long ans = 0;
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) ans += dp[n][i][j], ans = ans % 1000000007;
vector<long long> fib(m + 1, 0);
fib[1] = fib[2] = 2;
for (int i = 3; i <= m; i++)
fib[i] = fib[i - 1] + fib[i - 2], fib[i] = fib[i] % 1000000007;
for (int i = 0; i < m; i++) ans += fib[i], ans = ans % 1000000007;
cout << ans << endl;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n], biceps = 0, chest = 0, Back = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
if (i % 3 == 1)
chest += arr[i - 1];
else if (i % 3 == 2)
biceps += arr[i - 1];
else
Back += arr[i - 1];
}
if (chest > biceps) {
if (chest > Back)
cout << "chest" << endl;
else
cout << "back" << endl;
} else {
if (biceps > Back)
cout << "biceps" << endl;
else
cout << "back" << endl;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int k,n;
string s;
cin>>n>>k;
cin>>s;
int l=0,r=n-1,ans=1;
while(s[l]!='*') l++;
while(s[r]!='*') r--;
for(int i=l ; i<r ; i+=k)
{while(s[i]=='.')i--;ans++; }
cout << ans << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
string alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MAXN = 100;
char c[MAXN];
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> c[i];
string g = "ACTG";
int ans = 1000;
for (int i = 0; i + 4 <= n; i++) {
int dist = 0;
for (int j = 0; j < 4; j++) {
char s = c[i + j];
int tmp = 100;
int k = (s - g[j] + 26) % 26;
tmp = min(k, 26 - k);
dist += tmp;
}
ans = min(ans, dist);
}
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0;
char c = getchar();
bool ok = 0;
while (c < 48 || c > 57) ok |= (c == '-'), c = getchar();
while (c > 47 && c < 58) x *= 10, x += c - 48, c = getchar();
if (ok) x = -x;
return x;
}
void print(long long x) { printf("%I64d\n", x); }
int a[100002];
int main() {
int n = read();
if (n == 1) {
print(0);
return 0;
}
for (int i = 0; i < n; i++) {
a[i] = read();
}
int r = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0) r++;
}
if (r == n - 1) {
if (a[0] != 0)
print(0);
else
print(1);
return 0;
}
if (r == n - 2) {
if (a[0] == 0)
print(2);
else if (a[1] != 0)
print(0);
else
print(1);
return 0;
}
if (a[0] == 0) {
int cnt = 0;
for (int i = 1; i < n; i++) cnt += (a[i] != 0);
if (cnt <= 1) {
print(cnt);
return 0;
} else if (a[1] == 0) {
print(2);
return 0;
} else {
int b = a[2], c = a[1];
for (int i = 2; i < n; i++) {
if (a[i] * c != a[i - 1] * b) {
print(2);
return 0;
}
}
print(1);
return 0;
}
}
int cnt = 0, mi = 2;
int b = a[1], d = a[0], c = a[0];
if (d != 0) {
for (int i = 1; i < n; i++) {
if (a[i] * d == c * b) {
c *= b;
c /= d;
} else
cnt++;
}
if (cnt < 2) {
mi = min(mi, cnt);
}
}
cnt = 0;
b = a[2], d = a[0], c = a[2];
if (d != 0) {
if (a[2] * d != a[1] * b || a[1] * d != a[0] * b) cnt++;
for (int i = 3; i < n; i++) {
if (a[i] * d == c * b) {
c *= b;
c /= d;
} else
cnt++;
}
if (cnt < 2) {
mi = min(mi, cnt);
}
}
cnt = 0;
b = a[2], d = a[1], c = a[2];
if (a[1] * d != a[0] * b) cnt++;
if (d != 0) {
for (int i = 3; i < n; i++) {
if (a[i] * d == c * b) {
c *= b;
c /= d;
} else
cnt++;
}
if (cnt < 2) {
mi = min(mi, cnt);
}
}
print(mi);
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
int n;
while (t--) {
cin >> n;
int k = n / 3;
if (n % 3 == 0) {
cout << k << ' ' << k << '\n';
} else if (n % 3 == 1) {
cout << k + 1 << ' ' << k << '\n';
} else
cout << k << ' ' << k + 1 << '\n';
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
int n, m;
double ans = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
ans = max(ans, (a[u - 1] + a[v - 1]) / (double)w);
}
std::cout << std::setprecision(16) << ans << endl;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int z = 0; z < t; z++) {
int n;
cin >> n;
int odd = 0, even = 0;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] % 2 == 0) {
even++;
} else {
odd++;
}
}
if (odd == 0) {
cout << "NO" << endl;
} else if (odd == n && n % 2 == 0) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
const int MAXN = 1e5 + 7;
int n, k;
struct T1 {
long long x, y;
int id;
bool operator<(const T1 &other) const {
return x == other.x ? y < other.y : x < other.x;
}
} p1[MAXN];
struct T2 {
long long x, y;
int id;
bool operator<(const T2 &other) const {
return y == other.y ? x < other.x : y < other.y;
}
} p2[MAXN];
int main() {
scanf("%d %d", &n, &k);
long long x1, x2, Y1, y2;
for (int i = (1); i <= (n); ++i) {
scanf("%lld %lld %lld %lld", &x1, &Y1, &x2, &y2);
p1[i] = (T1){(x1 + x2), (Y1 + y2), i};
p2[i] = (T2){(x1 + x2), (Y1 + y2), i};
}
std::sort(p1 + 1, p1 + n + 1);
std::sort(p2 + 1, p2 + n + 1);
long long ans = LLONG_MAX;
for (int i = (0); i <= (k); ++i)
for (int j = (0); j <= (k); ++j)
for (int ii = (0); ii <= (i); ++ii)
for (int jj = (0); jj <= (j); ++jj) {
std::set<int> set;
int lx = 1, rx = n, ly = 1, ry = n;
for (int l = (1); l <= (ii); ++l) set.insert(p1[l].id), lx = l + 1;
for (int l = (1); l <= (i - ii); ++l)
set.insert(p1[n - l + 1].id), rx = n - l;
for (int l = (1); l <= (jj); ++l) set.insert(p2[l].id), ly = l + 1;
for (int l = (1); l <= (j - jj); ++l)
set.insert(p2[n - l + 1].id), ry = n - l;
if (set.size() > k) continue;
long long xx = p1[rx].x - p1[lx].x;
long long yy = p2[ry].y - p2[ly].y;
yy = yy / 2 + yy % 2;
if (!xx) xx = 1;
xx = xx / 2 + xx % 2;
if (!yy) yy = 1;
ans = std::min(ans, xx * yy);
}
printf("%lld\n", ans);
return 0;
}
| 7 |
#include <bits/stdc++.h>
using std::cerr;
using std::make_pair;
using std::pair;
using std::swap;
using std::vector;
int f[100010];
class data {
public:
int len, lmx, rmx, sum;
data operator+(const data &t) const {
data ret;
ret.len = len + t.len;
ret.sum = sum + t.sum;
ret.lmx = lmx;
if (lmx == len) ret.lmx += t.lmx;
ret.rmx = t.rmx;
if (t.rmx == t.len) ret.rmx += rmx;
if (rmx && t.lmx) ret.sum += -f[rmx] - f[t.lmx] + f[rmx + t.lmx];
return ret;
}
data inverse() {
data ret = *this;
swap(ret.lmx, ret.rmx);
return ret;
}
};
class node {
public:
int ch[2];
data dat;
} t[2200000];
int rt[100010];
int nodecnt = 0;
void build(int &p, int l, int r) {
p = ++nodecnt;
t[p].dat = (data){r - l + 1, 0, 0, 0};
if (l == r) return;
int mid = (l + r) >> 1;
build(t[p].ch[0], l, mid);
build(t[p].ch[1], mid + 1, r);
}
void modify(int &p, int q, int l, int r, int pos) {
p = ++nodecnt;
t[p] = t[q];
if (l == r) {
t[p].dat = (data){1, 1, 1, f[1]};
return;
}
int mid = (l + r) >> 1;
if (pos <= mid)
modify(t[p].ch[0], t[q].ch[0], l, mid, pos);
else
modify(t[p].ch[1], t[q].ch[1], mid + 1, r, pos);
t[p].dat = t[t[p].ch[0]].dat + t[t[p].ch[1]].dat;
}
void query(int p, int l, int r, int ql, int qr, data &ret) {
if (ql <= l && r <= qr) {
ret = ret + t[p].dat;
return;
}
int mid = (l + r) >> 1;
if (ql <= mid) query(t[p].ch[0], l, mid, ql, qr, ret);
if (qr > mid) query(t[p].ch[1], mid + 1, r, ql, qr, ret);
}
vector<pair<int, int> > edg;
int fa[100010], dfn[100010], siz[100010], ch[100010], top[100010], tim,
dep[100010];
vector<pair<int, int> > v[100010];
inline int lca(int x, int y) {
while (top[x] != top[y]) {
if (dep[top[x]] > dep[top[y]])
x = fa[top[x]];
else
y = fa[top[y]];
}
return dep[x] > dep[y] ? y : x;
}
void dfs1(int np, int fath) {
siz[np] = 1;
fa[np] = fath;
dep[np] = dep[fath] + 1;
for (int i = 0; i < v[np].size(); i++) {
pair<int, int> x = v[np][i];
if (x.first == fath) continue;
dfs1(x.first, np);
siz[np] += siz[x.first];
if (!ch[np] || siz[x.first] > siz[ch[np]]) ch[np] = x.first;
}
}
void dfs2(int np, int tp) {
top[np] = tp;
dfn[np] = ++tim;
if (ch[np]) dfs2(ch[np], tp);
for (int i = 0; i < v[np].size(); i++) {
pair<int, int> x = v[np][i];
if (x.first == fa[np]) continue;
if (x.first == ch[np]) {
edg.push_back(make_pair(x.second, dfn[x.first]));
continue;
}
dfs2(x.first, x.first);
edg.push_back(make_pair(x.second, dfn[x.first]));
}
}
int n, m, ev[100010];
data getchain(int x, int y, int t) {
data ret = (data){0, 0, 0};
while (top[x] != top[y]) {
data v = (data){0, 0, 0};
query(t, 1, n, dfn[top[x]], dfn[x], v);
x = fa[top[x]];
ret = v + ret;
}
if (x != y) {
data v = (data){0, 0, 0};
query(t, 1, n, dfn[y] + 1, dfn[x], v);
ret = v + ret;
}
return ret;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i < n; i++) scanf("%d", &f[i]);
for (int i = 1, a, b, c; i < n; i++) {
scanf("%d%d%d", &a, &b, &c);
v[a].push_back(make_pair(b, c));
v[b].push_back(make_pair(a, c));
}
dfs1(1, 0);
dfs2(1, 1);
sort(edg.begin(), edg.end());
reverse(edg.begin(), edg.end());
build(rt[0], 1, n);
for (int i = 0; i < n - 1; i++) {
ev[i + 1] = edg[i].first;
modify(rt[i + 1], rt[i], 1, n, edg[i].second);
}
ev[0] = 0x3f3f3f3f;
while (m--) {
int x, y, l;
scanf("%d%d%d", &x, &y, &l);
int p = -1;
int LL = 0, RR = n - 1;
while (LL <= RR) {
int mid = (LL + RR) >> 1;
if (ev[mid] >= l)
p = mid, LL = mid + 1;
else
RR = mid - 1;
}
int L = lca(x, y);
data A = getchain(x, L, rt[p]), B = getchain(y, L, rt[p]);
A = B.inverse() + A;
printf("%d\n", A.sum);
}
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
int a[300000];
vector<pair<int, int> > fac[300000];
int co[100];
int d[300000];
int dd[600000];
int now;
long long tot;
int diff;
int c(int x, int y) {
int i, ret;
ret = 1;
for (i = 0; i < y; i++) {
ret *= (x - i);
ret /= (i + 1);
}
return ret;
}
void search(int x, int ind, int v) {
int i, tmpnow, tmpdiff;
if (x == fac[ind].size()) {
dd[now] += v;
tot += co[diff] * dd[now];
return;
}
tmpnow = now;
tmpdiff = diff;
for (i = 0; i <= 1; i++) {
search(x + 1, ind, v);
if (i == fac[ind][x].second) break;
now *= fac[ind][x].first;
if (i == 0) diff++;
}
now = tmpnow;
diff = tmpdiff;
}
void rem1(int x) {
now = 1;
search(0, x, -1);
}
void add1(int x) {
now = 1;
search(0, x, 1);
}
int cal(int x) {
tot = 0;
now = 1;
diff = 0;
search(0, x, 0);
return tot;
}
int main() {
int i, j, n, q, x, tmp, cnt;
long long ans;
co[0] = 1;
co[1] = -1;
for (i = 2; i <= 15; i++) {
co[i] = 0;
for (j = 0; j < i; j++) co[i] += co[j] * c(i, j);
co[i] = -co[i];
}
scanf("%d%d", &n, &q);
for (i = 0; i < n; i++) {
fac[i].clear();
scanf("%d", &a[i]);
tmp = a[i];
for (j = 2; j * j <= tmp; j++) {
cnt = 0;
while (tmp % j == 0) {
tmp /= j;
cnt++;
}
if (cnt > 0) fac[i].push_back(make_pair(j, cnt));
}
if (tmp > 1) {
fac[i].push_back(make_pair(tmp, 1));
}
}
memset(d, 0, sizeof(d));
memset(dd, 0, sizeof(dd));
ans = 0;
for (i = 0; i < q; i++) {
scanf("%d", &x);
x--;
tmp = d[x];
if (tmp == 1) {
rem1(x);
}
if (tmp == 1)
ans -= cal(x);
else
ans += cal(x);
if (tmp == 0) {
add1(x);
}
d[x] = 1 - d[x];
cout << ans << endl;
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long mod1 = 998244353;
const long long mod = 1e9 + 7;
long long mod_mul(long long a, long long b) {
a = a % mod;
b = b % mod;
return (((a * b) % mod) + mod) % mod;
}
long long inv(long long i) {
if (i == 1) return 1;
return (mod - ((mod / i) * inv(mod % i)) % mod) % mod;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long pwr(long long a, long long b) {
a %= mod;
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
long long findMinNumber(long long n) {
long long count = 0, ans = 1;
while (n % 2 == 0) {
count++;
n /= 2;
}
if (count % 2) ans *= 2;
for (int i = 3; i <= sqrt(n); i += 2) {
count = 0;
while (n % i == 0) {
count++;
n /= i;
}
if (count % 2) ans *= i;
}
if (n > 2) ans *= n;
return ans;
}
long long binarySearch(long long arr[], long long l, long long r, long long x) {
if (r >= l) {
long long mid = l + (r - l) / 2;
if (arr[mid] == x) return mid;
if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
long long nCrModp(long long n, long long r, long long p) {
if (r > n - r) r = n - r;
long long C[r + 1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (long long i = 1; i <= n; i++) {
for (long long j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j - 1]) % p;
}
return C[r];
}
long long count_set_bit(long long n) {
long long count = 0;
while (n) {
count += n & 1;
n >>= 1;
}
return count;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long k;
bool ispalindrome(string &s, long long n) {
long long d = n / 2;
for (k = 0; k < d; k++) {
if (s[k] != s[n - k - 1]) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
string s;
cin >> s;
long long n = s.length(), d, j, i;
if (n == 1)
cout << s[0] << '\n';
else {
long long ans = n - 1, ans1 = 1, ans2 = 1, ans3 = 1, idx, ans4 = 1;
for (i = 0; i < n / 2; i++) {
if (s[i] != s[n - 1 - i]) {
ans = 2 * i;
idx = i;
for (j = i; j < n - idx; j++) {
string a;
a = s.substr(idx, j - idx + 1);
d = a.length();
if (ispalindrome(a, d)) ans1 = d;
}
for (j = n - idx - 1; j >= idx; j--) {
string a;
a = s.substr(j, n - idx - j);
d = a.length();
if (ispalindrome(a, d)) ans4 = d;
}
break;
}
}
ans += max(ans1, ans4);
for (i = 1; i < n; i++) {
string a;
a = s.substr(0, i + 1);
d = a.length();
if (ispalindrome(a, d)) {
ans2 = d;
}
}
for (i = n - 2; i >= 0; i--) {
string a;
a = s.substr(i, n - i);
d = a.length();
if (ispalindrome(a, d)) {
ans3 = d;
}
}
if (ans == max(max((ans), (ans2)), (ans3))) {
if (ans == n)
for (i = 0; i < n; i++) cout << s[i];
else {
for (i = 0; i < idx; i++) cout << s[i];
if (ans1 >= ans4)
for (i = idx; i < idx + ans1; i++) cout << s[i];
else
for (i = n - idx - ans4; i < n - idx; i++) cout << s[i];
for (i = n - idx; i < n; i++) cout << s[i];
}
cout << '\n';
} else if (ans2 == max(max((ans), (ans2)), (ans3))) {
for (i = 0; i < ans2; i++) cout << s[i];
cout << '\n';
} else {
for (i = 0; i < ans3; i++) cout << s[n - (ans3 - i)];
cout << '\n';
}
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int x;
int sum;
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
int val;
scanf("%d", &val);
sum += val;
}
if (sum < 0) {
sum = -sum;
int ans = sum / x;
if (sum % x) ans++;
printf("%d\n", ans);
} else if (sum == 0) {
puts("0");
} else {
int ans = sum / x;
if (sum % x) ans++;
printf("%d\n", ans);
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (auto i = begin(v); i != end(v); i++)
os << *i << (i == end(v) - 1 ? "" : " ");
return os;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto i = begin(v); i != end(v); i++) is >> *i;
return is;
}
vector<vector<pair<int, int>>> g;
vector<int> will_use;
bool visited[10000000];
bool run_dfs(int v) {
if (visited[v]) return true;
visited[v] = true;
if (will_use[v] == -1) will_use[v] = 1;
for (auto u : g[v]) {
int targ_use = will_use[v] ^ u.second;
if (will_use[u.first] != -1 && will_use[u.first] != targ_use) return false;
will_use[u.first] = targ_use;
if (!run_dfs(u.first)) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<string> orig(n), target(n);
cin >> orig >> target;
string row;
cin >> row;
g.resize(2 * n);
will_use.resize(2 * n, -1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int h_vtx = i, v_vtx = n + j;
bool needs_change = orig[i][j] != target[i][j];
bool h_bit = (row[j] == '1');
bool v_bit = (row[i] == '1');
if (needs_change) {
if (h_bit && !v_bit) {
if (will_use[h_vtx] != -1 && !will_use[h_vtx]) {
cout << -1;
return 0;
}
will_use[h_vtx] = true;
} else if (!h_bit && v_bit) {
if (will_use[v_vtx] != -1 && !will_use[v_vtx]) {
cout << -1;
return 0;
}
will_use[v_vtx] = true;
} else if (h_bit && v_bit) {
g[h_vtx].push_back({v_vtx, 1});
g[v_vtx].push_back({h_vtx, 1});
} else {
cout << -1;
return 0;
}
} else {
if (h_bit && !v_bit) {
if (will_use[h_vtx] != -1 && will_use[h_vtx]) {
cout << -1;
return 0;
}
will_use[h_vtx] = false;
} else if (!h_bit && v_bit) {
if (will_use[v_vtx] != -1 && will_use[v_vtx]) {
cout << -1;
return 0;
}
will_use[v_vtx] = false;
} else if (h_bit && v_bit) {
g[h_vtx].push_back({v_vtx, 0});
g[v_vtx].push_back({h_vtx, 0});
}
}
}
}
for (int i = 0; i < 2 * n; i++) {
if (will_use[i] != -1 && !run_dfs(i)) {
cout << -1;
return 0;
}
}
for (int i = 0; i < 2 * n; i++) {
if (!run_dfs(i)) {
cout << -1;
return 0;
}
}
vector<string> ans;
for (int i = 0; i < 2 * n; i++) {
if (will_use[i]) {
string val = "";
if (i < n)
val = "row " + to_string(i);
else
val = "col " + to_string(i - n);
ans.push_back(val);
}
for (auto u : g[i]) {
if (will_use[i] != (u.second ^ will_use[u.first])) {
cout << -1;
return 0;
}
}
}
cout << ans.size() << "\n";
for (auto x : ans) cout << x << "\n";
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
bool line(vector<long long> a, vector<long long> b, vector<long long> c) {
return ((a[0] - b[0]) * (b[1] - c[1]) == (a[1] - b[1]) * (b[0] - c[0]));
}
long long len(vector<long long> a, vector<long long> b) {
return (a[0] - b[0]) * (a[0] - b[0]) + (a[1] - b[1]) * (a[1] - b[1]);
}
int main() {
int t;
cin >> t;
for (int tt = (int)(0); tt < (int)(t); tt++) {
bool bad = 0;
vector<vector<vector<long long> > > a(
3, vector<vector<long long> >(2, vector<long long>(2)));
for (int i = (int)(0); i < (int)(3); i++) {
for (int j = (int)(0); j < (int)(2); j++)
for (int k = (int)(0); k < (int)(2); k++) cin >> a[i][j][k];
if (len(a[i][0], a[i][1]) == 0) bad = 1;
}
for (int i1 = (int)(0); i1 < (int)(3); i1++)
for (int i2 = (int)(0); i2 < (int)(2); i2++)
for (int j1 = (int)(0); j1 < (int)(i1); j1++)
for (int j2 = (int)(0); j2 < (int)(2); j2++)
if (a[i1][i2] == a[j1][j2]) {
swap(a[0], a[j1]);
swap(a[0][j2], a[0][0]);
swap(a[1], a[i1]);
swap(a[1][i2], a[1][0]);
break;
}
if (a[0][0] != a[1][0]) bad = 1;
if (!line(a[0][0], a[0][1], a[2][0])) swap(a[2][0], a[2][1]);
if (!line(a[0][0], a[0][1], a[2][0])) bad = 1;
if (!line(a[1][0], a[1][1], a[2][1])) bad = 1;
if (line(a[0][0], a[0][1], a[1][1])) bad = 1;
if (len(a[0][0], a[0][1]) + len(a[1][0], a[1][1]) < len(a[0][1], a[1][1]))
bad = 1;
if (a[2][0] == a[0][1] || a[2][1] == a[1][1]) bad = 1;
long long x1 = len(a[0][0], a[2][0]), x2 = len(a[2][0], a[0][1]);
long long y1 = len(a[1][0], a[2][1]), y2 = len(a[2][1], a[1][1]);
long long x3 = len(a[0][0], a[0][1]), y3 = len(a[1][0], a[1][1]);
if (25 * y1 < y3 || y1 > y3 || 25 * y2 < y3 || y2 > y3) bad = 1;
if (25 * x1 < x3 || x1 > x3 || 25 * x2 < x3 || x2 > x3) bad = 1;
if (bad)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, n1, n2, ch;
pair<int, int> p1[101];
cin >> n;
ch = n;
for (int i = 0; i < n; i++) {
cin >> n1 >> n2;
p1[i] = make_pair(n1, n2);
}
cin >> t;
for (int i = 0; i < n; i++) {
if (t > p1[i].first && t > p1[i].second) {
ch--;
}
}
cout << ch;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
long long int n, i, j, p, k, m, ans = 0, r, c;
cin >> r >> c;
p = 0;
if (c == 1) {
p = 1;
m = c;
c = r;
r = m;
}
vector<long long int> a[r];
vector<long long int> tmp(c);
for (i = 0; i < r; i++) {
a[i] = tmp;
}
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
a[i][j] = (i + 1) * (r + j + 1);
}
}
if (r == 1 && c == 1)
cout << 0 << endl;
else {
if (p == 0) {
for (i = 0; i < r; i++) {
for (j = 0; j < c; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
} else {
for (i = 0; i < c; i++) {
for (j = 0; j < r; j++) {
cout << a[j][i] << " ";
}
cout << endl;
}
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200;
int n, deg[maxn];
int G[maxn][maxn];
inline void add_edge(int u, int v) {
++G[u][v], ++G[v][u];
++deg[u], ++deg[v];
}
inline void del_edge(int u, int v) {
--G[u][v], --G[v][u];
--deg[u], --deg[v];
}
int cc_id[maxn], cnt_cc;
vector<int> cc[maxn];
void floodfill(int u, int id) {
cc_id[u] = id;
cc[id].push_back(u);
for (int v = 0; v < n; ++v)
if (G[u][v] && cc_id[v] == -1) floodfill(v, id);
}
void find_cc(void) {
memset(cc_id, -1, sizeof cc_id);
cnt_cc = 0;
for (int u = 0; u < n; ++u)
if (cc_id[u] == -1) {
cc[cnt_cc].clear();
floodfill(u, cnt_cc++);
}
}
int G2[maxn][maxn];
void find_circuit(int u) {
for (int v = 0; v < n; ++v)
if (G[u][v]) {
del_edge(u, v);
++G2[u][v];
find_circuit(v);
}
}
void solve(void) {
find_cc();
memset(G2, 0, sizeof G2);
for (int i = 0; i < cnt_cc; ++i) {
vector<int> odd;
for (int j = 0; j < (int)cc[i].size(); ++j) {
int u = cc[i][j];
if (deg[u] & 1) odd.push_back(u);
}
for (int j = 0; j < (int)odd.size(); j += 2) {
int u = odd[j], v = odd[j + 1];
add_edge(u, v);
}
find_circuit(cc[i][0]);
for (int j = 0; j < (int)odd.size(); j += 2) {
int u = odd[j], v = odd[j + 1];
if (G2[u][v])
--G2[u][v];
else
--G2[v][u];
}
}
for (int u = 0; u < n; ++u)
for (int v = 0; v < n; ++v) {
if (G2[u][v]) printf("%d %d\n", u + 1, v + 1);
}
}
int main(void) {
int t;
scanf("%d", &t);
while (t--) {
int m;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d%d", &u, &v), --u, --v;
add_edge(u, v);
}
int tot = 0;
for (int u = 0; u < n; ++u) {
if (~deg[u] & 1) ++tot;
}
printf("%d\n", tot);
solve();
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, m;
cin >> n >> m;
long long ans_m = 0, res = 0, ans_u = 0, ans_l = 0, ans_ul = 0;
long long k = n / m;
long long l = n % m;
for (long long i = 1; i <= m; i++) {
for (long long j = 1; j <= m; j++) {
if ((i * i + j * j) % m == 0) {
if (j <= l) {
ans_l++;
}
if (i <= l) {
ans_u++;
}
if (i <= l && j <= l) {
ans_ul++;
}
ans_m++;
}
}
}
if (n <= m) {
long long ans_n = 0;
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) {
if ((i * i + j * j) % m == 0) {
ans_n++;
}
}
}
cout << ans_n << "\n";
} else {
res = ans_m * k * k + (ans_l + ans_u) * k + ans_ul;
cout << res << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, a, b, c, n, t, f, d, p, bp, cc, bf, ch, sum, mod, max,
min, a1, a2, k1, k2;
string s, v;
vector<long long int> vv, ss;
map<long long int, long long int> it, ki;
map<long long int, long long int>::iterator ma;
map<long long int, long long int, greater<long long int> > ba, sa;
map<long long int, long long int, greater<long long int> >::iterator ka;
long long int ii;
ios_base::sync_with_stdio(false);
cin >> a1 >> a2 >> k1 >> k2 >> n;
a = n;
max = 0;
min = 0;
if (k1 < k2) {
b = n / k1;
if (b < 0) {
b = 0;
}
if (b <= a1) {
max = max + b;
n = n - (k1 * b);
} else if (b > a1) {
n = n - (a1 * k1);
max = max + (a1);
}
b = n / k2;
if (b < 0) {
b = 0;
}
if (b <= a2) {
max = max + b;
n = n - (k2 * b);
} else if (b > a2) {
n = n - (a2 * k2);
max = max + (a2);
}
} else if (k2 < k1) {
b = n / k2;
if (b < 0) {
b = 0;
}
if (b <= a2) {
max = max + b;
n = n - (k2 * b);
} else if (b > a2) {
n = n - (a2 * k2);
max = max + (a2);
}
b = n / k1;
if (b < 0) {
b = 0;
}
if (b <= a1) {
max = max + b;
n = n - (k1 * b);
} else if (b > a1) {
n = n - (a1 * k1);
max = max + (a1);
}
} else if (k2 == k1) {
if (a2 >= a1) {
b = n / k2;
if (b < 0) {
b = 0;
}
if (b <= a2) {
max = max + b;
n = n - (k2 * b);
} else if (b > a2) {
n = n - (a2 * k2);
max = max + (a2);
}
b = n / k1;
if (b < 0) {
b = 0;
}
if (b <= a1) {
max = max + b;
n = n - (k1 * b);
} else if (b > a1) {
n = n - (a1 * k1);
max = max + (a1);
}
} else {
b = n / k1;
if (b < 0) {
b = 0;
}
if (b <= a1) {
max = max + b;
n = n - (k1 * b);
} else if (b > a1) {
n = n - (a1 * k1);
max = max + (a1);
}
b = n / k2;
if (b < 0) {
b = 0;
}
if (b <= a2) {
max = max + b;
n = n - (k2 * b);
} else if (b > a2) {
n = n - (a2 * k2);
max = max + (a2);
}
}
}
n = a;
d = a1 * (k1 - 1);
c = a2 * (k2 - 1);
d = c + d;
if (d < n) {
n = n - d;
if (n <= a1) {
min = min + n;
n = 0;
} else if (n > a1) {
min = min + a1;
n = n - a1;
}
if (n <= a2) {
min = min + n;
n = 0;
} else if (n > a2) {
min = min + a2;
}
} else if (d >= n) {
min = 0;
}
cout << min << " " << max << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
const int xn = 3e2 + 10;
const int xm = 5e5;
const int SQ = 320;
const int sq = 1e3 + 10;
const long long inf = 1e18 + 10;
long long power(long long a, long long b) {
return (!b ? 1
: (b & 1 ? a * power(a * a % md, b / 2) % md
: power(a * a % md, b / 2) % md));
}
long long zarb(long long a, long long b) { return (a * b) % md; }
long long jaam(long long a, long long b) { return (a + b) % md; }
int n;
long long dp[xn][xn][xn], a[xn], cnt = 1;
vector<int> vec, adj[xn];
bool Mark[xn];
void DFS(int v) {
Mark[v] = true;
vec.push_back(cnt++);
for (int i = 0; i < adj[v].size(); i++) {
int u = adj[v][i];
if (Mark[u]) continue;
DFS(u);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
long long sqr = sqrt(a[i] * a[j]);
if (sqr * sqr == a[i] * a[j]) {
adj[i].push_back(j);
adj[j].push_back(i);
}
}
}
for (int i = 0; i < n; i++) {
if (Mark[i]) continue;
cnt = 1;
DFS(i);
}
dp[0][0][1] = 1;
for (long long i = 1; i < n; i++) {
if (vec[i] == 1) {
for (long long j = 0; j <= i; j++) {
for (long long k = 1; k <= vec[i - 1]; k++) {
if (vec[i - 1] - k - 1 + j >= 0)
dp[i][j + vec[i - 1] - k - 1][1] =
jaam(dp[i][j + vec[i - 1] - k - 1][1],
zarb(dp[i - 1][j][k], j + vec[i - 1] - k));
dp[i][j + vec[i - 1] - k][1] =
jaam(dp[i][j + vec[i - 1] - k][1],
zarb(dp[i - 1][j][k], i + 1 - j - vec[i - 1] + k));
}
}
continue;
}
for (long long j = 0; j < i; j++) {
for (long long k = 1; k <= vec[i]; k++) {
if (k > 1)
dp[i][j][k] =
jaam(dp[i][j][k], max(0LL, zarb(dp[i - 1][j + 1][k - 1], j + 1)));
dp[i][j][k] = jaam(dp[i][j][k],
max(0LL, zarb(dp[i - 1][j][k], (vec[i - 1] + k))));
if (k > 1)
dp[i][j][k] = jaam(dp[i][j][k],
max(0LL, zarb(dp[i - 1][j][k - 1],
i + 1 - (vec[i - 1] + k - 1 + j))));
}
}
}
cout << dp[n - 1][0][vec[n - 1]] << '\n';
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
const int N = 1005;
const double PI =
3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989;
int n, m;
long long a[N][N];
bool b[N][N];
bool check(long long x) {
memset(b, 0, sizeof(b));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] >= x) {
for (int k = j + 1; k < m; k++) {
if (a[i][k] >= x) {
if (b[j][k])
return 1;
else
b[j][k] = 1;
}
}
}
}
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
;
cin >> n >> m;
long long l = INT_MAX, r = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
l = min(l, a[i][j]);
r = max(r, a[i][j]);
}
}
while (r - l > 1) {
long long mid = (l + r) >> 1;
if (check(mid))
l = mid;
else
r = mid;
}
if (check(r)) l = r;
cout << l << endl;
}
| 6 |
#include <bits/stdc++.h>
typedef struct {
double x, y;
} Point;
double X, Y;
double cross(Point A, Point B, Point C) {
Point AB;
Point AC;
AB.x = B.x - A.x;
AB.y = B.y - A.y;
AC.x = C.x - A.x;
AC.y = C.y - A.y;
double cross = AB.x * AC.y - AB.y * AC.x;
return cross;
}
int sig(double a) { return a < 0 ? -1 : 1; }
int main() {
long long decx, decy, izq, der, med, sol;
double dir, tmp;
Point DX, DY, P;
scanf("%lf %lf", &P.x, &P.y);
decx = (P.x < 0 ? -1 : 1);
decy = (P.y < 0 ? -1 : 1);
DX.x = 100000000001 * decx;
DX.y = 0;
DY.y = 100000000001 * decy;
DY.x = 0;
dir = cross(DX, DY, P);
izq = 0;
der = 100000000001;
sol = 0;
while (izq <= der) {
med = (izq + der) / 2;
DX.x = med * decx;
DX.y = 0;
DY.y = med * decy;
DY.x = 0;
tmp = cross(DX, DY, P);
if (tmp == 0 || sig(tmp) == sig(dir)) {
sol = med;
der = med - 1;
} else {
izq = med + 1;
}
}
DX.x = sol * decx;
DX.y = 0;
DY.y = sol * decy;
DY.x = 0;
if (DX.x < DY.x)
printf("%.0lf %.0lf %.0lf %.0lf\n", DX.x, DX.y, DY.x, DY.y);
else
printf("%.0lf %.0lf %.0lf %.0lf\n", DY.x, DY.y, DX.x, DX.y);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int n;
scanf("%d", &n);
for (int i = 0; i < 3; ++i) {
for (int j = (i & 1 ? 1 : 2); j <= n; j += 2) {
v.push_back(j);
}
}
printf("%d\n", v.size());
for (auto vv : v) printf("%d ", vv);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int n, k, mn = 1e+9, mx = 0;
cin >> n >> k;
for (int j = 0; j < n; j++) {
int a;
cin >> a;
mn = min(mn, a);
mx = max(mx, a);
}
if (mn + k >= mx - k) {
cout << mn + k << '\n';
} else {
cout << -1 << '\n';
}
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int gint() {
char c;
int f = 1;
while (c = getchar(), c < 48 || c > 57)
if (c == '-') f = -1;
int x = 0;
for (; c > 47 && c < 58; c = getchar()) {
x = x * 10 + c - 48;
}
return x * f;
}
int n, m, k;
long long f[305][305], cost[305][305];
int main() {
n = gint(), m = gint(), k = gint();
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) cost[i][j] = 1ll << 40;
for (int i = 1, l, r, c; i <= m; ++i) {
l = gint(), r = gint(), c = gint();
for (int j = l; j <= r; ++j) cost[l][j] = min(cost[l][j], 1ll * c);
}
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= n; ++j) f[i][j] = 1ll << 40;
f[0][0] = 0;
for (int i = 1; i <= n; ++i) {
f[i][0] = 0;
for (int j = 1; j <= i; ++j) {
f[i][j] = f[i - 1][j];
for (int k = 1; k <= j; ++k) {
f[i][j] = min(f[i][j], f[i - k][j - k] + cost[i - k + 1][i]);
}
}
}
if (f[n][k] == 1ll << 40)
puts("-1");
else
printf("%I64d\n", f[n][k]);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
void USACO(string s) {
ios_base::sync_with_stdio(0);
cin.tie(0);
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const long long MAXN = 200010;
struct seg {
long long a, b, c;
bool operator<(const seg X) const {
if (a == X.a) return c < X.c;
return a < X.a;
}
};
void solve() {
set<long long> s;
vector<seg> v;
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
if (a > b) swap(a, b);
v.push_back({a, i, 0});
v.push_back({b, i, 1});
}
bool done[n + 1];
memset(done, 0, sizeof(done));
sort(v.begin(), v.end());
vector<long long> seq;
long long ans = 0;
for (long long i = 0; i < v.size(); i++) {
long long a = v[i].a, b = v[i].b, c = v[i].c;
if (c == 0) {
s.insert(b);
} else {
if (done[b]) continue;
ans++;
seq.push_back(a);
for (long long u : s) {
done[u] = true;
}
s.erase(b);
}
}
cout << ans << "\n";
for (long long i = 0; i < ans; i++) cout << seq[i] << " ";
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const long long MN = 2e5 + 5, N = 1e5;
const long long mod = 998244353;
long long M, freq[MN], mu[MN];
inline void inc(long long &x, long long y) {
x = x + y < mod ? x + y : x + y - mod;
}
inline long long qPow(long long a, long long b) {
long long c = 1;
for (; b; b >>= 1, a = 1ll * a * a % mod)
if (b & 1) c = 1ll * c * a % mod;
return c;
}
signed main() {
scanf("%lld", &M);
for (long long i = 1; i <= M; ++i) {
long long a, b;
scanf("%lld%lld", &a, &b);
freq[a] = b;
}
mu[1] = 1;
for (long long i = 1; i <= N; ++i)
for (long long j = 2 * i; j <= N; j += i) mu[j] -= mu[i];
long long ans = 0;
for (long long i = 1; i <= N; ++i) {
long long s = 0, sq = 0, K = 0;
for (long long j = i; j <= N; j += i) {
K += freq[j];
inc(s, 1ll * j * freq[j] % mod);
inc(sq, 1ll * j * j % mod * freq[j] % mod);
}
if (K < 2) continue;
long long t1 = 1ll * sq * qPow(2, K - 2) % mod * ((K - 1) % mod) % mod;
long long n2 = (1ll * s * s % mod - sq + mod) % mod;
long long t2 = qPow(2, K - 2);
if (K >= 3) t2 = (t2 + 1ll * ((K - 2) % mod) * qPow(2, K - 3) % mod) % mod;
t2 = 1ll * t2 * n2 % mod;
inc(ans, 1ll * (1ll * ((t1 + t2) % mod) * mu[i] + mod) % mod);
}
printf("%lld\n", ans);
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
const int MOD = 1e9 + 9;
int n;
long long work(long long a, long long b, long long c) {
long long t = 0;
while (a < c && b < c) {
if (a <= b)
a = a + b;
else
b = a + b;
t++;
}
return t;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b, c, ans = 0;
cin >> a >> b >> c;
if (a <= 0 && b <= 0) {
if (a >= c || b >= c)
cout << 0;
else
cout << -1;
exit(0);
}
if (a >= c || b >= c) {
cout << 0;
exit(0);
}
if (a < 0) {
a = -a;
long long p = a / b;
ans += a / b;
if (a % b != 0) ans++, p++;
a = p * b - a;
}
if (b < 0) {
b = -b;
long long p = b / a;
ans += b / a;
if (b % a != 0) ans++, p++;
b = p * a - b;
}
ans += work(a, b, c);
cout << ans;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
const int M = 400010;
const long long inf = 1e15;
int n, m, S, T;
long long val[N];
int head[N], v[M], nxt[M], cnt = 1;
long long w[N];
void addedge(int x, int y, long long z) {
nxt[++cnt] = head[x];
head[x] = cnt;
v[cnt] = y;
w[cnt] = z;
nxt[++cnt] = head[y];
head[y] = cnt;
v[cnt] = x;
w[cnt] = 0;
}
int used[N], d[N], cur[N], num[N], p[N], flag;
long long maxflow;
void bfs() {
queue<int> q;
q.push(T);
used[T] = 1;
d[T] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i; i = nxt[i]) {
if (!used[v[i]]) {
d[v[i]] = d[u] + 1;
used[v[i]] = 1;
q.push(v[i]);
}
}
}
return;
}
int agument() {
int x = T;
long long mi = 0x3f3f3f3f;
while (x != S) {
int i = p[x];
mi = min(mi, w[i]);
x = v[i ^ 1];
}
x = T;
while (x != S) {
int i = p[x];
w[i] -= mi;
w[i ^ 1] += mi;
x = v[i ^ 1];
}
return mi;
}
int isap() {
bfs();
for (int i = 0; i <= T; ++i) num[d[i]]++;
for (int i = 0; i <= T; ++i) cur[i] = head[i];
int now = S;
while (d[S] < T) {
if (now == T) {
maxflow += agument();
now = S;
}
flag = 0;
for (int i = cur[now]; i; i = nxt[i]) {
if (w[i] && d[now] == d[v[i]] + 1) {
flag = 1;
p[v[i]] = i;
cur[now] = i;
now = v[i];
break;
}
}
if (!flag) {
int mm = T - 1;
for (int i = head[now]; i; i = nxt[i]) {
if (w[i]) mm = min(mm, d[v[i]]);
}
num[d[now]]--;
if (num[d[now]] == 0) d[S] = T;
d[now] = mm + 1;
num[d[now]]++;
cur[now] = head[now];
if (now != S) now = v[p[now] ^ 1];
}
}
return maxflow;
}
int visited[N];
void _bfs() {
queue<int> q;
q.push(S);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i; i = nxt[i]) {
if (w[i] && !visited[v[i]]) {
visited[v[i]] = 1;
q.push(v[i]);
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
S = n * (n + 1);
T = S + 1;
for (int i = 1; i <= m; ++i) {
int x, y;
long long w;
cin >> x >> y >> w;
--x;
--y;
swap(x, y);
for (int j = 0; j < n; ++j) {
addedge(x * (n + 1) + j, y * (n + 1) + j + 1, inf);
}
val[x] -= w;
val[y] += w;
}
for (int i = 0; i < n; ++i) {
addedge(S, i * (n + 1), inf);
addedge(i * (n + 1) + n, T, inf);
for (int j = 0; j < n; ++j) {
addedge(i * (n + 1) + j, i * (n + 1) + j + 1, val[i] * j + 1e9);
}
}
isap();
_bfs();
for (int i = 0; i < n; ++i) {
int k = 0;
while (visited[i * (n + 1) + k + 1]) ++k;
cout << k << ' ';
}
cout << '\n';
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long int l, r;
int main() {
cin >> l >> r;
cout << "YES\n";
for (long long int i = l; i < r; i++) {
cout << i << " " << i + 1 << "\n";
i++;
}
return 0;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.