solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t))... | 11 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k;
cin >> n >> k;
long long d = n / 2 / (k + 1);
long long c = k * d;
long long w = n - c - d;
cout << d << " " << c << " " << w;
}
int main() {
int T = 1;
while (T--) {
solve();
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n--;
cout << "1 1" << endl;
for (int i = 0; i < n / 2 + (n % 2 || n % 12 == 6 || n % 12 == 10); i++)
cout << (!(i % 6) || i % 2) << ' ' << 2 + i / 6 * 4 + (i % 6 + 1) / 2
<< endl;
for (int i = 0; i < n / 2 - (n % 12 == ... | 18 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5000;
const int M = 50000;
char str[N];
int cntS[M];
int main() {
int a;
scanf("%d", &a);
scanf(" %s", str);
int len = strlen(str);
for (int i = 0; i < len; i++) {
int curSum = 0;
for (int s = i; s < len; s++) {
curSum += str[s] - '0';
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
map<long long int, long long int> m;
vector<long long int> v, v1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, x, y, t, k;
string s;
cin >> s;
long long int sum = 0;
for (long long int i ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
int ok = 0, wa = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
if (s.length() % 2) {
ok = 1;
} else {
int a = 0;
for (int j = 0; j < s.... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, k, a, r, l;
int pos[1000010];
int num[1000010];
int b[1000010];
long long ans = 0;
int lowbit(int o) { return o & -o; }
int query(int o) {
int res = 0;
while (o > 0) res += b[o], o -= (o & -o);
return res;
}
void insert(int o) {
while (o <= n) b[o]++, o += (o... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int inv = 1000000000;
const int minv = -inv;
const pair<int, int> ABSENT = pair<int, int>(-1, -1);
struct node {
int lr, rr, ct, id;
node* lc;
node* rc;
node() {}
node(int lr_, int rr_, int ct_, int id_, node* lc_, node* rc_) {
lr = lr_;
rr = rr_;
... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 55;
const int inf = 1 << 30;
int mp[300][300];
int main() {
int n, a[110], sum1[110], sum2[110];
while (scanf("%d", &n) != EOF) {
memset(sum1, 0, sizeof(sum1));
memset(sum2, 0, sizeof(sum2));
for (int i = 2; i <= n; i++) {
scanf("%d", ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = acosl(-1.0);
const int MAXN = 100005;
const long long mod = 1000000007ll;
int alp[26];
int cur[26];
void update() {
for (int i = 0; i < 26; ++i) cur[i] -= alp[i];
}
char getneed() {
for (int i = 0; i < 26; ++i)
if (cur[i] < alp[i]) {
++c... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, m;
int ans[N];
pair<int, int> p[N];
void solve() {
int t, sum = 0;
for (int i = 0; i < m; ++i) {
scanf("%d", &t);
sum += t;
p[i] = make_pair(t, i + 1);
}
if ((n == 3 && m == 2) || sum < n) {
puts("-1");
return;
}
so... | 13 |
#include <bits/stdc++.h>
using namespace std;
const long double epsylon = 1e-9;
int num(string c) {
if (c == "S") return 0;
if (c == "M") return 1;
if (c == "L") return 2;
if (c == "XL") return 3;
return 4;
}
char strs[5][6] = {"S", "M", "L", "XL", "XXL"};
int main() {
int n[5];
cin >> n[0] >> n[1] >> n[2... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<pair<int, int> > v[1000];
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
v[y / 1001].push_back(make_pair(x, i + 1));
}
for (int i = 0; i < 1000; i++) {
sort(v[i].begin(), v[i].end());
... | 13 |
#include <bits/stdc++.h>
using namespace std;
long long dp[5010][5010];
string s, t;
const int mod = 1000000007;
int main() {
cin >> s >> t;
long long curr = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == t[0]) {
curr++;
}
dp[i][0] = curr;
}
curr = 0;
for (int i = 0; i < t.length();... | 9 |
#include <bits/stdc++.h>
using namespace std;
int k, n, a[1000006], d[1003];
queue<int> que;
int main() {
cin >> k >> n;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i] -= k;
sort(a + 1, a + 1 + n);
n = unique(a + 1, a + 1 + n) - a - 1;
for (int i = 0; i <= 1000; i++) d[i] = -1;
for (int i = 1; i <= n... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, x, temp;
int t;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> a >> b;
if (b == 0 || (b == 0 && a == 0))
cout << 1 << endl;
else if (a == 0)
cout << 0.5 << endl;
else {
x = ((4 * b) < (a) ? (4 * b) : (a));
... | 10 |
#include <bits/stdc++.h>
using namespace std;
void Open() {}
int reverse(int x) {
int rev = 0;
while (x) {
rev *= 10;
rev += x % 10;
x /= 10;
}
return rev;
}
int main() {
Open();
string s;
cin >> s;
long long h1, h2, m1, m2, num = 0, revers;
h1 = s[0] - 48;
h2 = s[1] - 48;
m1 = s[3] - ... | 2 |
#include <bits/stdc++.h>
char F[10][10][11];
bool V[10][10][11];
int k, n, m, x, y;
int ans;
void DFS(int f, int x, int y) {
ans++;
V[f][x][y] = true;
if (f - 1 >= 0 && F[f - 1][x][y] == '.' && !V[f - 1][x][y]) DFS(f - 1, x, y);
if (f + 1 < k && F[f + 1][x][y] == '.' && !V[f + 1][x][y]) DFS(f + 1, x, y);
if (... | 6 |
#include <bits/stdc++.h>
using namespace std;
enum { UP, DOWN };
const int MAXN = 20 + 10;
long long dp[2][MAXN][5];
bool can(int mask, int n, int t) {
bool bits[21];
short len = 0, cnt = 0, cnt2 = 0;
bits[0] = false;
while (mask > 0) {
bits[++len] = (mask & 1);
if (bits[len] && bits[len - 1]) return fa... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < s.length(); i += 2) {
v.push_back(s[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (i < v.size() - 1) {
cout << v.at(i) << "+";
} else
cout <... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, i, e, f, g, n, m, k, l, A[200005], maxx, t, fix[200005];
map<long long, long long> dp;
string s[200005];
int main() {
cin >> t;
for (long long i = 1; i <= 0; i++) {
a++;
l = 1;
}
for (long long i = 1; i <= 0; i++) {
a++;
l = 1;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
vector<int> N(300500);
vector<pair<int, int> > P(300500);
map<pair<int, int>, int> m;
cin >> n >> p;
for (int i = 1; i <= n; i++) N[i] = 0;
for (int i = 1; i <= n; i++) {
cin >> P[i].first >> P[i].second;
if (P[i].first > P[i].se... | 11 |
#include <bits/stdc++.h>
using namespace std;
double a, b, c;
int main() {
cin >> a >> b >> c;
double k = b * b;
double l = 4 * a * c;
if (a == 0) {
if (b == 0 && c == 0) {
cout << -1 << endl;
return 0;
}
if (b == 0 && c != 0) {
cout << 0 << endl;
return 0;
}
if (c ==... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r;
cin >> n >> m;
int a[111], c[111];
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
c[i] = a[i];
}
for (int j = 1; j <= m; j++) scanf("%d%d", &l, &r);
sort(&a[1], &a[1] + n);
int b[111];
for (int i = 1; i <= n; i++) b... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, j = 0;
priority_queue<pair<long long, long long> > q;
cin >> n;
vector<pair<long long, long long> > w(n);
string s;
vector<long long> res(2 * n, 99);
for (long long i = 0; i < n; ++i) {
w[i].second = i;
cin >> w[i].first;
}
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int R, C;
string grid[maxn];
int ans[maxn * maxn];
int ds[maxn * maxn], sz[maxn * maxn];
int nxt_r[4] = {1, -1, 0, 0};
int nxt_c[4] = {0, 0, -1, 1};
int quadros(int a) {
int r = a / C, c = a % C;
if (grid[r][c] == '*') return 0;
int acc = 0;
f... | 9 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int INF = 1000 * 1000 * 1000;
char tbl[55][55];
bool ap[55][55];
int dst[55][55];
string p[55][55];
bool got[55];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, -1, 0, 1};
string path;
bool SUKASUKA;
int N, M, K;
pair<int, int> ... | 16 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
pair<int, int> t[4 * 100001];
pair<int, int> combine(pair<int, int> a, pair<int, int> b) {
if (a.first > b.first) return a;
if (b.first > a.first) return b;
return make_pair(a.first, a.second + b.second);
}
void build(int a[], int v, int tl... | 13 |
#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
vector<long long> pre(n);
pre[0] = a[0];
for (int i = 1; i < n; i++) pre[i] = a[i] + pre[i - 1];
vector<int> pos;
for (int i ... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n = 0, i = 0;
cin >> n;
while (n != 0) {
i = n % 2 + i;
n = n / 2;
}
cout << i;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
char c[1015][1015];
int main() {
memset(c, '.', sizeof(c));
int n;
cin >> n;
int s = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((i + j) % 2 == 0) c[i][j] = 'C';
}
}
cout << (n * n + 1) / 2 << endl;
for (int i = 0; i < n;... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int a, b, c, v, side1, side2, side3;
cin >> a >> b >> c;
v = sqrt((a * b * c));
side1 = v / a;
side2 = v / b;
side3 = v / c;
cout << (4 * (side1 + side2 + side3)) << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 300005, L = (1 << 19), inf = 1e8;
struct segtree {
int v[2 * L], l[2 * L];
void init() {
for (int i = 2 * L; --i;) {
v[i] = inf;
}
}
void lazydown(int P) {
v[2 * P] += l[P];
v[2 * P + 1] += l[P];
l[2 * P] += l[P];
l[2 * P ... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
cin >> q;
int b[q][3];
for (int i = 0; i < q; i++) {
cin >> b[i][0];
if (b[i][0] == 1)
cin >> b[i][1] >> b[i][2];
else
cin >> b[i][2];
}
int res[n],... | 8 |
#include <bits/stdc++.h>
using namespace std;
int k, a, b;
int main() {
cin >> k >> a >> b;
if (b > a) swap(a, b);
int fswins = a / k;
int scwins = b / k;
if (a % k && b / k == 0 || b % k && a / k == 0)
cout << -1;
else
cout << fswins + scwins;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> v;
bool can(long long val) {
long long curK = 0;
if (val <= v[n / 2]) {
return true;
} else {
curK += val - v[n / 2];
}
for (int i = n / 2 + 1; i < n; ++i) {
if (v[i] < val) {
curK += val - v[i];
if (curK > k) {
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, m, Query;
char ch;
bool a[520][520];
int A[520][520][15][18], P[520], dp[520];
void go(int tl, int tr, int deep, int pr) {
if (tl == tr) return;
int v = (tl + tr) / 2;
dp[v] = deep;
P[v] = pr;
for (int i = 1; i <= n; ++i) {
if (a[i][v] == 1) continue;
... | 22 |
#include <bits/stdc++.h>
using namespace std;
struct pt {
long long x, y;
pt operator-(pt a) { return {x - a.x, y - a.y}; }
void read() { cin >> x >> y; }
};
long long cross(pt a, pt b) { return a.x * b.y - b.x * a.y; }
vector<pt> v;
bool sol(pt a, pt b) {
vector<pt> vv;
for (auto u : v) {
if (cross(b - a... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n;
int f[1000 * 1000 + 5];
int tab[1000 * 1000 + 5];
vector<int> czyn[1000 * 1000 + 5];
int sil[1000 * 1000 + 5];
int podst[1000 * 1000 + 5];
int cnt[1000 * 1000 + 5], cntpodst[1000 * 1000 + 5];
int kogo[1000 * 1000 + 5], mam[1000 * 1000 + 5];
i... | 22 |
#include <bits/stdc++.h>
using namespace std;
class JuRuo {
bool sb;
int neg_IQ;
} LHM;
int ey[1000000], enext[1000000], ec[1000000], g[1000000], col[1000000],
dep[1000000], etot, n, m, ans, tot, fa[1000000];
pair<int, int> q[1000000];
int gcd(int x, int y) { return (y == 0) ? x : gcd(y, x % y); }
int get(int x... | 14 |
#include <bits/stdc++.h>
using namespace std;
struct st {
st *left, *right;
int sum, l, r, m;
st(int l, int r) : l(l), r(r), sum(0) {
if (l != r) {
m = (l + r) / 2;
left = new st(l, m);
right = new st(m + 1, r);
}
}
void update(int pos, int v, int o) {
if (l == r) {
sum = v... | 9 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const int mxN = 2e5 + 5;
template <class T>
T gcd(T a, T b) {
return ((b == 0) ? a : gcd(b, a % b));
}
void solve() {
int n;
cin >> n;
vector<int> b(n), a;
int mx = 0;
for (int i = 0; i < (int)(n); i++) cin >... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int j, t;
cin >> t;
for (j = 0; j < t; j++) {
long long int n, k;
cin >> n >> k;
long long int i, a[n];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
a[0] += k;
bool flag = false;
for (i = 1; i < n; i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
int n;
int a[maxN];
const int LIM = 100;
int pref[maxN][101];
const int SHIFT = maxN;
int lst[maxN + SHIFT];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
f... | 18 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = ~0ull >> 2;
const long long MAX = 100005;
const long long mod = 1e9 + 7;
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, len = 0;
cin >> n;
vector<pair<int, int> > v(3e6, {-1, -1});
vector<st... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n, m, x, y;
cin >> n >> m >> x >> y;
char arr[1001][1001];
for (long long int i = 0; i < n; i++) {
string s;
cin >> s;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool ok1, ok2;
char c[101][101];
int n, i, j, a[101], b[101];
int main() {
scanf("%d\n", &n);
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
scanf("%c", &c[i][j]);
if (c[i][j] == 'E') {
++a[i];
++b[j];
}
}
scanf("\n");
... | 7 |
#include <bits/stdc++.h>
using namespace std;
bool vis1[100011];
long long int vis2[100011];
vector<long long int> second;
vector<long long int> g[100011], gd[100011];
void dfs1(long long int v) {
vis1[v] = 1;
second.emplace_back(v);
for (auto x : g[v]) {
if (!vis1[x]) dfs1(x);
}
}
long long int dfs2(long l... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v1;
for (int i = 0; i < n; i++) {
int r;
scanf("%d", &r);
v1.push_back(r);
}
long long int sum = 0;
sort(v1.begin(), v1.end());
reverse(v1.begin(), v1.end());
while (n > 0) {
for (int i = 0; ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, M = 110;
struct edge {
int la, b;
char v;
} e[N << 1];
int n, q, tot, hd[N], fa[N][20], dep[N], rt[N], ans[N];
unsigned long long val[N][M], nowv[N];
void add(int from, int to, char val) {
e[++tot] = (edge){hd[from], to, val};
hd[from] = tot;
... | 18 |
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, f = 1;
char c;
for (; !isdigit(c); c = getchar())
if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + c - '0';
return x * f;
}
int n, mxn;
int main() {
n = read();
while (n--) {
int x = read(), y = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t;
t = 1;
for (int tc = 0; tc < t; tc++) {
int n;
cin >> n;
vector<long long int> arr(n), brr(n);
for (int i1 = 0; i1 < n; i1++) cin >>... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int INF32 = 1E9;
const long long INF64 = 4E18;
const long long M = 1E9 + 7;
const double EPS = 1E-9;
const double PI = 2 * acos(0);
vector<long long> suffix_sum(1E6);
bool cmp_v(pair<long long, long long> a, pair<long long, long long> b) {
return (a.second < b.secon... | 11 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int color;
int len;
node(int _color, int _len) : color(_color), len(_len) {}
};
char s[1000005];
list<node> ls;
int maintain() {
int res = INT_MAX;
for (auto it = ls.begin(); it != ls.end(); ++it) {
if (it == ls.begin() || it == prev(ls.end()))
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int a[N];
int sum[N];
int f[2 * N + 10];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[a[i]]++;
}
int mx = *max_element(sum + 1, sum + n + 1);
int cnt = 0, val;
for (int i = 1; i <= n;... | 22 |
#include <bits/stdc++.h>
using namespace std;
int n, len;
int nr;
int nr1, nr0, nrc, ok = 0;
char a[100005], aux[100005];
int check() {
nr1 = nr0 = nrc = 0;
for (int i = 1; i <= len; i++)
if (a[i] == '0')
nr0++;
else if (a[i] == '1')
nr1++;
else
nrc++;
if (nrc) return 1;
if (nr1 > ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long Nfact = 200005;
const long long mod = 1000000007;
const long long Nsieve = 1000005;
vector<bool> is_prime(Nsieve, true);
void sieve() {
is_prime[0] = is_prime[1] = false;
for (long long i = 2; i * i <= Nsieve; i++) {
if (is_prime[i]) {
for (lon... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long a = (1ll << n);
long long b = 0;
int i, j;
for (i = n - 1, j = 0; j < n / 2; i--, j++) {
b += (1ll << i);
}
wh... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, k1, k2, a[1007], b[1007];
int main() {
cin >> n >> k1 >> k2;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= n; ++i) cin >> b[i];
for (int i = 1; i <= k1; ++i) {
int pos = -1, curr = -1;
for (int i = 1; i <= n; ++i)
if (abs(... | 7 |
#include <bits/stdc++.h>
using namespace std;
int IN() {
int c, f, x;
while (!isdigit(c = getchar()) && c != '-')
;
c == '-' ? (f = 1, x = 0) : (f = 0, x = c - '0');
while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
return !f ? x : -x;
}
const int N = 4e5 + 19;
const int p = 1e9 + 7;
int P... | 21 |
#include <bits/stdc++.h>
using namespace std;
int getNumberOfAdditionalVotes(vector<int> array) {
if (array.size() < 1) {
return -1;
}
int x = array[0];
int count = 0;
array[0] = array[array.size() - 1];
array.pop_back();
sort(array.begin(), array.end());
while (x <= array[array.size() - 1]) {
a... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, i, a[5001], w;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[a[a[i]]] == i) w++;
}
if (w != 0)
cout << "YES";
else
cout << "NO";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int calc(int x, int y) { return x * 60 + y; }
string out(int x) {
int y = x / 60, z = x % 60;
stringstream s;
if (y < 10) {
s << "0";
}
s << y;
s << ":";
if (z < 10) {
s << "0";
}
s << z;
string res;
s >> res;
return res;
}
int main() {
int... | 1 |
#include <bits/stdc++.h>
const int N = 30006, D = 400;
int n, d, a[N];
int f[N][2 * D + 1];
inline int read() {
int s = 0, f = 1;
char ch;
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
s = (s << 1) + (s << 3) + ch - '0';
return s * f... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
unordered_map<long long, int> endspot, l;
unordered_map<long long, bool> visited;
pair<int, int> best[MAXN][3];
vector<int> edges[MAXN];
int pilg[MAXN];
int n, m;
set<int> notdone[MAXN];
int dfsorder[MAXN], tree[8 * MAXN], revdfs[MAXN];
int ct = 0;... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int dp[maxn], cnt[maxn];
int main() {
int n, m, t, x, y;
cin >> n >> m;
int mp[n + 5][m + 5];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> mp[i][j];
memset(dp, 0, sizeof dp);
memset(cnt, 0, sizeof cnt);
for (in... | 8 |
#include <bits/stdc++.h>
using namespace std;
struct myp {
int f;
int s;
};
struct edges {
int v;
bool check1;
};
int dx[5] = {-1, 0, 0, 1, 0};
int dy[5] = {0, 1, -1, 0, 0};
int len[1008][1008];
bool checktui[1008][1008];
int accum[1008][1008];
bool alpha[28];
long long first1[10009];
long long first2[10009];
l... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
long long int n, k, x, i, j;
cin >> n >> k >> x;
vector<pair<long long int, long long int>> v;
for (i = 0; i < n; i++) {
long long int tm, y = v.size() - ... | 6 |
#include <bits/stdc++.h>
using namespace std;
vector<int> G[200005];
long long ar[200005], tree[2][2 * 200005];
int dfstime, start[200005], finish[200005], dep[200005];
void dfs(int s, int fr, int len) {
start[s] = ++dfstime, dep[s] = len;
for (int v : G[s]) {
if (v != fr) dfs(v, s, len + 1);
}
finish[s] = ... | 12 |
#include <bits/stdc++.h>
using namespace std;
int x[100100], y[100100], z[100100], w[100100], tx[100100 * 2], dis[100100],
from[100100];
struct cmp {
bool operator()(int i, int j) const { return y[i] < y[j]; }
};
multiset<int, cmp> f[100100 * 2];
int main() {
int n, m;
scanf("%d", &n);
for (int i = 1; i <= ... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
char tab1[301][301];
for (int i = 0; i < n; i++) cin >> tab1[i];
bool tab[301][301];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (tab1[i][j] == '*')
tab[i][j] = 1;
else
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
char a[MAXN], ans[MAXN];
int n;
int main() {
cin >> (a + 1);
int n = strlen(a + 1);
if (n & 1) {
ODD_N:
for (int i = 1; i <= n / 2 + 1; i++) {
putchar('4');
}
for (int i = 1; i <= n / 2 + 1; i++) {
putchar('7');
... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int q = 0, cc = 0;
int z = 0;
int w = 0, e = 0;
if (a == b) {
cc;
cc = b;
cout << cc << " ";
}
if (a > b) {
z = b;
cout << z << " ";
a = a - b;
if (a % 2 == 0) {
q = a / 2;
a = 0;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 3e5 + 10;
int n;
vector<int> g[maxn];
long long fpow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1) r = r * a % mod;
b >>= 1;
a = a * a % mod;
}
return r;
}
long long dp[maxn][2][2], res[ma... | 17 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, q, l[N], r[N], u[N], d[N], ans = 2e9;
int f[N][2];
char ch[N];
int Min(int x, int y) { return x < y ? x : y; }
void tomin(int &x, int y) {
if (y < x) x = y;
}
int solve() {
int c0 = 0, c1 = 0, res = 0;
for (int j = 1; j <= m; j++) {
... | 25 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x[] = {0, 0, 0, 0, 2, 4};
void in() { scanf("%d%d", &n, &m); }
void ac() {
if (n > m) swap(n, m);
if (n == 1)
printf("%d", m / 6 * 6 + x[m % 6]);
else if (n == 2) {
if (m == 2)
puts("0");
else if (m == 3)
puts("4");
else if (m == ... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int N = 2e6 + 1;
const long long mod = 1e9 + 7;
void solve() {
int m = 6;
vector<int> arr(m);
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
int n;
cin >> n;
vector<array<int, 2>> store;
vector<int> freq(n, 0);
int cnt... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, d;
cin >> x;
d = x;
vector<int> vec, vec2;
while (x--) {
int q, r;
cin >> q >> r;
vec.push_back(q);
vec2.push_back(r);
}
int c = 0;
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec2.size(); j++)
if ... | 6 |
#include <bits/stdc++.h>
int main() {
int t;
int a[1005], b[1005], c[1005];
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
int i;
scanf("%d", &t);
for (i = 2; i <= t; i++) {
scanf("%d", &a[i]);
b[a[i]]++;
}
for (i = 2; i <= t; i++) {
if (b[i] == 0) {
c[a... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
ios_base::sync_with_stdio(1);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n >> m;
if (m == 0) {
cout << n << ' ' << n;
return 0;
}
long long i = 1;
for (i; i <= n; i++)
if ((long long)i * (i - 1) / 2 >= (long long)m) ... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long d[10];
long long mem[105][15][15];
long long mod = 1e9 + 7;
long long ncr[105][105];
long long get_ncr(long long n, long long r) {
if (n < r) return 0;
if (n == r || r == 0) return 1;
if (ncr[n][r] != -1) return ncr[n][r];
ncr[n][r] = get_ncr(n - 1, r - 1)... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
map<int, int> m;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
for (int j = 1; j <= k; ++j) m[x * j] = j;
}
int q;
cin >> q;
while (q--) {
int x;
cin >> x;
map<int, int>::iterator l = m.begin(), ... | 11 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll rd(){
char c=getchar();ll s=0;bool f=1;
for(;c<'0'||c>'9';c=getchar())if(c=='-')f=0;
for(;c>='0'&&c<='9';c=getchar())s=(s<<3)+(s<<1)+(c^48);
return f?s:~(s-1);
}
inline void wt1(ll x){if(x>=10)wt1(x/10);putchar('0'+x%10);}
inline void w... | 10 |
#include <bits/stdc++.h>
using namespace std;
int n;
set<int> S;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
if (t != 0) S.insert(t);
}
printf("%d\n", (int)S.size());
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int kNmax = 110;
const int kMod = 1e9 + 7;
int n, x, dp[kNmax][kNmax][kNmax][4], pw_fib[kNmax];
string s;
int main() {
pw_fib[0] = pw_fib[1] = 2;
for (int i = 2; i < kNmax; i++) {
pw_fib[i] = (1LL * pw_fib[i - 1] * pw_fib[i - 2]) % kMod;
}
cin >> n >> x >>... | 16 |
#include <bits/stdc++.h>
using namespace std;
bool lower(int a, int b) {
printf("? %d %d\n", a, b);
fflush(stdout);
char c;
scanf(" %c", &c);
return c == '<';
}
int main() {
int test;
scanf("%d", &test);
while (test--) {
int n;
scanf("%d", &n);
if (n == 1) {
printf("! 1 1\n");
ff... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
double a, b, res = 1;
cin >> a >> b;
if (b == 0)
res = 1;
else if (a == 0)
res = 0.5;
else {
double s, ss = (a * 2 * b);
if (a / 4.0 <= b)
s = (b - a / 4.0)... | 10 |
#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
long long ret = n % m;
if (ret < 0) ret += m;
return ret;
}
long long gcd(long long a, long long b) {
return (b == 0LL ? a : gcd(b, a % b));
}
long long exp(long long a, long long b, long long m) {
if (b == 0LL) ret... | 15 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int> > neg, pos;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
if (a < 0)
neg.push_back({-a, b});
else
pos.... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T Max(T a, T b) {
if (a > b)
return a;
else
return b;
}
template <class T>
inline T Min(T a, T b) {
if (a < b)
return a;
else
return b;
}
template <class T>
inline T gcd(T a, T b) {
if (a < 0) return gcd(-a, b);
if (b < ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int d[100000];
int s[100000];
queue<int> q;
int main() {
int n;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", d + i, s + i);
sum += d[i];
if (d[i] == 1) {
q.push(i);
}
}
printf("%I64d\n", sum / 2);
while ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int A[100005];
int bsearch(int q, int l, int r) {
if (l == r - 1) {
return l;
}
int mid = (l + r) / 2;
if (A[mid - 1] < q && q <= A[mid]) {
return mid;
} else if (q <= A[mid - 1]) {
return bsearch(q, l, mid);
} else {
return bsearch(q, mid, r);
... | 4 |
#include<bits/stdc++.h>
#define int long long
//#define PI pair<int,int>
using namespace std;
const int maxm=205;
const int maxd=20;
const int mod=1e9+7;
vector<int>g[maxm];
int d[maxm][maxm];
int f[maxm][25];
int dep[maxm];
int n;
int ppow(int a,int b,int mod){
int ans=1%mod;a%=mod;
while(b){
if(b&1)an... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int N = 22;
long long n, k, ft[N];
template <class T>
ostream& operator<<(ostream& out, vector<T> v) {
out << v.size() << '\n';
for (auto e : v) out << e << ' ';
return out;
}
long long get(vector<int> v) {
long long ans = 0;
long long cif[10];
unordered_s... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
bool flag[2000010];
int a[maxn], b[2 * maxn];
int n, m, cc;
int main() {
for (int i = 2; i <= 2000000; i++)
if (!flag[i]) {
b[cc++] = i;
for (int j = i * 2; j <= 2000000; j += i) flag[j] = 1;
}
scanf("%d%d", &n, &m);
m... | 16 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<char>> adj;
bool vis[2001][2001];
int d[2001][2001];
int main() {
int r, c, x, y, n, m;
cin >> n >> m >> r >> c >> x >> y;
--r;
--c;
adj.resize(n);
for (int i = 0; i < n; ++i) {
adj[i].resize(m);
for (int j = 0; j < m; ++j) {
cin >> a... | 10 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 3e5 + 5;
const long long SQ = 317;
long long dp[15][15][15][15];
long long zez[16];
long long fact[16];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
fact[0] = 1;
for (long long i =... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e6 + 3;
const int INFI = 1e9 * 2;
const long long LINFI = 1e17;
const double pi = acos(-1.0);
const int N = 22;
const int M = 222222;
const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
char a[3][N], d[5] = "FMS?";
bool win(char x... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> p1, pair<int, int> p2) {
if (p1.first == p2.first) {
return p1.second < p2.second;
} else {
return p1.first > p2.first;
}
}
int fc(int k, int pos, vector<pair<int, int> > a, vector<int> b) {
vector<int> y;
for (int i = 0; i < k; i++... | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.