text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
bool inrange(int y) { return ((y >= 1) && (y <= 9)); }
int main() {
int r1, r2, c1, c2, d1, d2;
bool taken[9] = {false};
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int x = (r1 + r2);
int y = (c1 + c2);
int z = (d1 + d2);
int w;
if (x == y && y == z) {
if (... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2, a = 1, b, c, d;
int main() {
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
while (a <= 9) {
b = 1;
while (b <= 9) {
if (a == b) {
b++;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, i;
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
int x1, x2, y1, y2, y3, y4;
bool flag = false;
for (i = 1; i <= 9; i++) {
y1 = i, y2 = r1 - i, y3 = c1 - y1, y4 = c2 - y2, x1 = y1 + y4, x2 = y2 + y3;
if (y1... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
bool cd = false;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
for (int k = 1; k <= 9; ++k) {
for (int l = 1; l <= 9; ++l) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d %d", &r1, &r2);
scanf("%d %d", &c1, &c2);
scanf("%d %d", &d1, &d2);
int a1 = -1;
int a2 = -1;
int a3 = -1;
int a4 = -1;
for (int i = 1; i <= 9; i++) {
for (int y = 1; y <= 9; y++) {
for (int l = ... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int a[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int k2 = (d2 + r2 - c2);
if (k2 % 2 == 1) {
cout << -1 << endl;
return 0;
}
i... |
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
vector<int> sums{r1, c1, d1, d2, c2, r2};
for (int c = ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int r1, r2, d1, d2, c1, c2, a, b, c, d;
cin >> r1 >> r2;
cin >> d1 >> d2;
cin >> c1 >> c2;
a = (c1 + d1 - r2) / 2;
b = c1 - a;
c = r1 - a;
d = r2 - b;
if (a != b && a != c && a !=... |
#include <bits/stdc++.h>
using namespace std;
bool compare(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main() {
float r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
float a = c1 / 2 + (d1 + r1 - d2 - r2) / 4;
float c = c1 / 2 - (d1 + r1 - d2 - r2) / 4;
float b = c2 ... |
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2, x1, x2, x3, x4;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
x1 = (d1 + r1 - c2) / 2;
x2 = (c2 + r1 - d1) / 2;
x3 = (2 * r2 + r1 - d1 - c2) / 2;
x4 = (d1 + c2 - r1) / 2;
bool ind = 1;
if (x1 == x2 || x1 == x3 || x1 == x4 || x2 == ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int num1, num2, num3, num4, flag = 0;
for (int i = 1; i < r1; i++) {
num1 = i;
num2 = r1 - i;
if (c1 - num1 > 0 && num1 <= 9) {
flag++;
num3 = c1 - num1;
} ... |
#include <bits/stdc++.h>
using namespace std;
int notIdentical(int a, int b, int c, int d) {
if (a != b && b != c && c != d && d != a && a != c && b != d) return 1;
return 0;
}
int main() {
int r1, r2, c1, c2, d1, d2, i;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (i = 1; i <= 9; ++i) {
if (r1 - i >= 1 &... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (a = 1; a <= 9; a++)
for (b = 1; b <= 9; b++)
for (c = 1; c <= 9; c++)
for (d = 1; d <= 9; d++) {
if (a != b && a != c && a != d && b != c && ... |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
if (i == j) continue;
for (int k = 1; k <= 9; ++k) {
if (k == i || k == ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, x1, x2, y1, y2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
x1 = (r1 + d1 - c2) / 2;
x2 = (r1 + d2 - c1) / 2;
y1 = (r2 + d2 - c2) / 2;
y2 = (r2 + d1 - c1) / 2;
if (x1 + x2 == r1 && y1 + y2 == r2 && c1 == x1 + y1 && c2 == x... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int a[2][2];
bool solve() {
if (a[0][0] + a[0][1] != r1) return false;
if (a[1][0] + a[1][1] != r2) return false;
if (a[0][0] + a[1][0] != c1) return false;
if (a[0][1] + a[1][1] != c2) return false;
if (a[0][0] + a[1][1] != d1) return ... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
bool dfs(vector<int>& a) {
bool ans = false;
if (a.size() == 4) {
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (i == j) continue;
if (a[i] == a[j]) return false;
}
}
int i = a[0];
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long c1, c2, r1, r2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
set<long> st;
long t = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int l = 1; l <= 9; l++) {
if ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
char s[N];
int t[N];
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int a = 1; a <= 9; a++)
for (int b = 1; b <= 9; b++)
for (int c = 1; c <= 9; c++)
for (int d = 1; d <= 9; d+... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a11 = (r1 + c1 - d2) / 2;
int a12 = r1 - a11;
int a21 = c1 - a11;
int a22 = d1 - a11;
if (a11 != a12 && a11 != a21 && a11 != a22 && a12 != a21 && a12 != a22 &&
a21 != a... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool flag = true;
int A, B, C, D;
if ((r1 - c2 + d1) % 2 == 0) {
A = (r1 - c2 + d1) / 2;
D = (d1 - r1 + c2) / 2;
} else {
flag = false;
}
if ((c2 - r2 + d2) % 2 == ... |
#include <bits/stdc++.h>
using namespace std;
long long fx[] = {1, -1, 0, 0};
long long fy[] = {0, 0, 1, -1};
bool isprime(int n) {
int i;
if (n == 1)
return false;
else if (n == 2)
return true;
for (i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
void SieveOE(int n) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a11, a12, a21, a22;
a11 = (r1 + c1 - d2) / 2;
a21 = c1 - a11;
a12 = r1 - a11;
a22 = r2 - a21;
if (a11 != a22 && a11 != a12 && a11 != a21 && a12 != a21 && a12 != a22 &&
... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int A[4];
int main() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
for (int k = 1; k <= 9; k++)
for (int l = 1; l <= 9; l++) {
if (i != j && i != k && i != l &... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int a = 1; a <= 9; a++)
for (int b = 1; b <= 9; b++)
for (int c = 1; c <= 9; c++)
for (int d = 1; d <= 9; d++) {
if (a + b == r1 && c + d == r2 && a + c ... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int main() {
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
for (int k = 1; k < 10; k++)
for (int z = 1; z < 10; z++) {
if (i == j || i == k || i == z... |
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> s;
int r1, r2, c1, c2, d1, d2, a1, a2, a3, a4;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 20; i++) {
for (int j = 1; j <= 20; j++) {
a1 = i;
a2 = j;
if (a1 + a2 == r1) {
a3 = c1 - a1;
a4 ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int c1, c2, d1, d2, r1, r2, i, j, k, l;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (i = 1; i < 10; i++) {
j = r1 - i;
k = c1 - i;
l = d1 - i;
if (i != j && i != k && i != l && j != k && j != ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int freq[10];
memset(freq, 0, sizeof(freq));
int k, r1, r2, c1, c2, d1, d2, x1, x2, y1, y2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
x1 = (c1 + r1 - d2) / 2;
v.push_back(x1);
x2 = c1 - x1;
v.push_back(x2);
y1 = (d2 + c2 - r2) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a1, a2, a3, a4;
for (int i = 1; i <= 9; i++) {
a1 = i;
a2 = r1 - a1;
a3 = c1 - a1;
a4 = c2 - a2;
if (1 > a2 or 1 > a3 or 1 > a4 or a2 > 9 or a3 > 9 or a4 > 9) c... |
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
return 0;
}
void solve() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a;
bool ans = false;
for (a = 1; a <... |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (long long int i = 1; i < 10; ++i) {
for (long long int j = 1; j < 10; ++j) {
for (long long int k = 1; k... |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool ff = false;
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int l = 1; l <= 9; l++) {
if (i + j == a && k + l == ... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int main() {
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
int tag = 0;
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
for (int k = 1; k <= 9; ++k) {
for (int l = 1; l <= 9; ++l) {
if (i == ... |
#include <bits/stdc++.h>
using namespace std;
bool comp(int n) { return n > 0 && n < 10; }
bool noteq(int a, int b, int c, int d) {
return a != b && a != c && a != d && b != c && b != d && c != d;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1... |
#include <bits/stdc++.h>
const int Inf = 2e9;
long long LINF = (long long)4e18;
using namespace std;
int r1, r2, c1, c2, d1, d2;
bool ok(int i, int j, int k, int l) {
if (i + j != r1) return false;
if (k + l != r2) return false;
if (i + k != c1) return false;
if (j + l != c2) return false;
if (i + l != d1) re... |
#include <bits/stdc++.h>
using namespace std;
void SR(int &x) { scanf("%d", &x); }
void SR(long long &x) { scanf("%lld", &x); }
void SR(double &x) { scanf("%lf", &x); }
void SR(char *s) { scanf("%s", s); }
void RI() {}
template <typename I, typename... T>
void RI(I &x, T &...tail) {
SR(x);
RI(tail...);
}
int main()... |
#include <bits/stdc++.h>
using namespace std;
int c[10];
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int x1, x2, x3, x4;
x2 = (c2 - r2 + d2) / 2;
x3 = (r2 - c2 + d2) / 2;
x1 = r1 - x2;
x4 = c2 - x2;
int flag = 0;
if (x1 + x2 == r1 && x3 + x4 == r2 && x1 + x3 == c1... |
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
if (i != j)
for (int k = 1; k < 10; k++)
if (k != i && k != j)
for (int l = 1; l < 10; l++)
... |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int MAXN = 100000 + 10;
const int INF = 0x7fffffff;
bool vis[10];
int main() {
int r1, r2, c1, c2, d1, d2, a, b, c, d;
while (scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2) == 6) {
bool f = false;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, r1, r2, d1, d2, x[5], i, j;
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
x[3] = ((r1 - d1) + c2) / 2;
x[2] = d2 - x[3];
x[4] = c2 - x[3];
x[1] = d1 - x[4];
if (x[1] + x[2] == c1 && x[3] + x[4] == c2 && x[1] + x[3] == r1 &&
... |
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int board[2][2];
bool taken[10];
bool ans;
void check() {
int a = board[0][0] + board[0][1];
int b = board[1][0] + board[1][1];
int c = board[0][0] + board[1][1];
int d = board[0][1] + board[1][0];
int e = board[0][0] + board[1][0];
i... |
#include <bits/stdc++.h>
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#define pb push_back
#define ALL(s) s.begin(),s.end()
#define FIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define SZ(s) int(s.size())
using namespace std;
typedef long long ll;
typedef pair<i... |
/**
* author: akifpathan
* created: Thursday 31.12.2020 11:51:21 AM
**/
/*
#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
#ifdef LOCAL
#include "debug.h"
#else
#include<bits/stdc++.h>
using namespace std;
#... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
// #include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-... |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... |
/*
`-:://:::-
`//:-------:/:`
... |
#include <bits/stdc++.h>
using namespace std;
#define debbuging false
#define _ if(!debbuging) ios_base::sync_with_stdio(0);cin.tie(0);
#define debug if(debbuging) cout
#define endl '\n'
typedef long long ll;
typedef tuple<int,int,int> t3;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const int... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> G;
int get_group(int x) {
if(G[x] == x)
return x;
return G[x] = get_group(G[x]);
}
void merge_group(int x, int y) {
int gx = get_group(x);
int gy = get_group(y);
if(gx == gy) return;
if(gx > gy)
sw... |
#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
int freex[500005];
int parent[500005];
vector<int> adj[500005];
int finder(int x)
{if(x==parent[x]){return x;}
int z=finder(parent[x]);
parent[x]=z;
return z;
}
void Union(int a,int b)
{if(finder(a)==finder(b)){return;}
int x... |
#include "bits/stdc++.h"
#define requires(...) typename std::enable_if<__VA_ARGS__::value, int>::type = 0
using namespace std;
template<class U, class V>
istream &operator>>(istream &is, pair<U, V> &p) { return is >> p.first >> p.second; }
template<class U, class V>
ostream &operator<<(ostream &os, const pair<U, V>... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define allv(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = INT_MAX;
const ll infll = LONG_LONG_MA... |
#include <iostream>
#include <map>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <iomanip>
#include <bitset>
using namespace std;
#define pi pair<int ,int>
int mod = 1e9+7 , n , m , ok[1000000] , lab[1000000];
vector <int> ruler[1000001] , res;
void unite(int u , int v)
{
if (lab[u] >... |
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define lun(x) (int)x.size()
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f... |
//goto line 42 for some useful code
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dbg(...) 47
#endif
// speed up hacks does not work with MSVC compilers
// refer https://codeforces.com/blog/entry/66279
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pra... |
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define em emplace
#define eb emplace_back
#define pb pop_back
#define sz(v) (int) v.size()
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
mt19937 rnd(chr... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pii pair<int, int>
#define pb emplace_back
#define pf emplace_front
#define mp make_pair
#define ld long double
#define all(x) x.begin(), x.end()
#define uniq(x) sort(all(x)), x.resize(unique(all(x)) - x.beg... |
#include <bits/stdc++.h>
using namespace std;
class union_find{
public:
vector<int> arr;
union_find(int n){
arr.resize(n);
fill(arr.begin(),arr.end(),-1);
}
int find(int x){
return arr[x]<0?x:arr[x]=find(arr[x]);
}
void unite(int x,int y){
x=find(x),y=find(y);
if(x==y) return;
if(arr[x]>arr[y]) swap... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
class DSU {
private:
vector <int> par, sz;
int n;
public:
DSU(int _n) : n(_n) {
sz.assign(n + 1, 1);
par.assign(n + 1, 0);
iota(par.begin(), par.end(), 0);
}
int find_parent(int a) {
if(a == par[a]) return ... |
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef pair<int, int> ii;
int p[500001];
int find(int a) {
if (a == p[a]) return a;
else return p[a] = find(p[a]);
}
void merge(int a, int b) {
a = find(a);
b = find(b);
if (a != b) {
p[a] = b;
}
}
int main() {
ios::sync_with_stdio(0);... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define benq queue
#define pbenq priority_queue
#define all(x) x.begin(), x.end()
#define sz(x) (ll)x.size()
#define m1(x) memset(x, 1, sizeof(x))
#define m0(x) memset(x, 0, sizeof(x))
#define inf(x) memset(x, 0x3f, sizeof(... |
#include <bits/stdc++.h>
//using namespace std;
typedef long long ll;
typedef long double ld;
//std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
//int randi = std::uniform_int_distribution<int>(0, 999)(rng);
const double EPS = 1e-9;
const double PI = acos(-1.0);
const ll OO = 2e18 + 10... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 2e5 + 5, MOD = 1000000007;
class UnionFind
{ // OOP style
private:
vector<int> p, rank, setSize; // remember: vi... |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int maxn=5e5+5;
int f[maxn],ans[maxn];
int _find(int x){return x!=f[x]?f[x]=_find(f[x]):f[x];}
int main(){
int n,m,id=0,num=1;scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)f[i]=i;
for(int i=1;i<=n;i++){
int k,a,b;scanf("%d",&k);
... |
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <deque>
#include <set>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <ctime>
#include <queue>
#include <stack>
#include <iomanip... |
#include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T>
bool chmax(T &val, T nv) { return val < nv ? (val = nv, true) : false; }
template<class T>
bool chmin(T &val, T nv) { return nv < val ? (val = nv, true) : false; }
#ifdef KEV
#defi... |
/// In the name of God
#include <bits/stdc++.h>
#define FILE_NAME "A"
using namespace std;
using ll = long long;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define SZ(x) ((int) x.size())
#define all(x) x.begin(), x.end()
#define what_is(x) cerr << #x << " is " << x << endl;
... |
#include <bits/stdc++.h>
#define endl '\n'
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define LL long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
const int mod=1e9+7;
int n,m;
vector<int>ans;
int fa[500010];
int find(int a)... |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 500005;
const ll MOD = 1000000007;
int T,n,m,tot;
int fa[MAXN];
int ans[MAXN];
int getroot(int u)
{
return u == fa[u] ? u : fa[u] = getroot(fa[u]);
}
int main()
{
scanf("%d%d",&n,&m);
for (int i = 0;i <= m... |
// author: erray
#include<bits/stdc++.h>
using namespace std;
// modular template by tourist
template <typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a; swap(a, m);
u -= t * v; swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T>
class Modul... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define ll long long
using namespace std;
int n, m;
int f[1234567];
int rrank[1234567];
bool cycle[1234567];
int getfa(int a)
{
if (a != f[a])
f[a] = getfa(f[a]);
return f[a];
}
void connect(int a, int b)
{
int fa = g... |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) cout<<i<<" ";puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#... |
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int n,m;
#define P pair<int,int>
P a[N];
int ans[N],nans;
const int mod=1e9+7;
P b[N];
int insert(int x,int y){
if(b[x].first==x&&b[x].second==y)return -1;
if(b[x].first==0){
b[x]=P(x,y);
return y;
}e... |
/*
Coded with Leachim's ACM Template.
No errors. No warnings. ~~
*/
#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-const-variable"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#pragma GCC diagnostic ignored "-Wsign-compare"
#define LL long long
using namespace std;
const int inf=0x3f3f3f3f;
c... |
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dbg(x) cout <<#x<<":"<<x<<endl;
#define dbgpo(x, y) cout<<"("<<x<<", "<<y<<")";
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define mp make_pair
#defi... |
#include<bits/stdc++.h>
#define fi first
#define se second
#define LL long long
#define PI std::pair<int,int>
#define MP std::make_pair
const int N=500005,INF=0x8000000;
int n,m,fa[N];
std::vector<int>ans;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
int k,x,y;
scanf("%d%d",&k,&x);
if(k==1)y=INF;
e... |
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template<typename... T> void rd(T&... args) {((cin>>args), ...);}
template<typename... T> void wr(T... args) {((cout<<args<<" "), ...);cout<<endl;}
struct UF {
vector<int> fa, sz;
... |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N, M; cin >> N >> M;
const int MOD = 1e9 + 7;
int tot = 1;
vector<int> ans;
vector<int> par(M); iota(par.begin(), par.end(), 0);
vector<bool> good(M);
auto get_par = [&](int v) {
while (v != par[v]) ... |
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#include <stack>
#include <queue>
#define ll long long
#define pii pair<int, int>
#define maxn 500005
#define mod 1000000007
#define Goodbye2020 ios_base::sync_with_stdio(0);cin.tie(0);
using namespace ... |
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 5e5 + 5;
const int mod = 1e9 + 7;
int f[maxn];
int Find(int u) {
if (u != f[u]) {
f[u] = Find(f[u]);
}
return f[u];
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++) {
f[i] = ... |
/*
Author: AquaBlaze
Time: 2020-12-30 23:16:53
Generated by powerful Codeforces Tool
You can download the binary file in here https://github.com/xalanq/cf-tool (Windows, macOS, Linux)
Keqing best girl :)
Nephren will always be in my heart
*/
#include<bits/stdc++.h>
#define x first
#define y second
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5+5;
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
struct DisjointSet{
int P[N];
int R[N];
DisjointSet( ){
memset(R,0,sizeof(R));
for( int i = 1 ; i < N ; i ++ ){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int ll
#define fast(); ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tests() int t; cin>>t; while(t--)
#define endl '\n'
#define F first
#define S second
#define mp make_pair
#define vi vector <ll>
#define pii pair<ll, ll>
... |
#include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
const int maxn = 5e5 + 10;
typedef long long ll;
const ll mode = 1e9+7;
ll bitcount[65];
ll a[maxn];
int pre[maxn];
int find(int x){
if(x==pre[x]) return x;
else return pre[x] = find(pre[x]);
}
bool unions(int x,int y){
int xx = find(x);
int yy = find(y)... |
#include <bits/stdc++.h>
using namespace std;
template <int mod> struct Modular {
int value;
Modular(int64_t v = 0) { value = v % mod; if (value < 0) value += mod; }
Modular& operator+=(Modular const& b) { value += b.value; if (value >= mod) value -= mod; return *this; }
Modular& operator-=(Modular co... |
#include <bits/stdc++.h>
using namespace std;
#define taskname "TEST"
typedef long long ll;
typedef long double ld;
const int N = 5e5 + 5;
const int MOD = 1e9 + 7;
int n, m, up[N];
vector <int> res;
void init() {
for (int i = 1; i <= 5e5 + 1; i++) up[i] = i;
}
int findset(int u) {
if (up[u] != u) up[u] = fi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#define debug(...) {\
std::cout << "[" << __FUNCTION__ << ":" << __LINE__ << "] " << #__VA_ARGS__ << " " << __VA_ARGS__ << std::endl;\
}
#else
#define debug(...)
#endif
const long long mod = 1000000007;
#define MOD(x) ((x)%mod)... |
#include <bits/stdc++.h>
//define/typeDef
#define all(a) a.begin(), a.end()
#define double long double
#define int long long
#define NIL 0
#define INF LLONG_MAX
#define loop(n) for(int i=0;i<n; i++)
#define rloop(n) for(int i=n-1; i>=0; i--)
using namespace std;
const int mod = 1e9 + 7;
const int N = 5e5 + 50;
int par... |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5 + 5;
const int mod = 1e9 + 7;
int n, m, cnt = 1, par[N];
vector<int> ans;
int find(int u) {
return (u == par[u]) ? u : par[u] = find(par[u]);
}
bool join(int a, int b) {
a = find(a), b = find(b);
... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
... |
#include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
#define mkp make_pair
#define fir first
#define sec second
const int N=1000005;
#define P 1000000007
template<class I>
il I Min(I p,I q){return p... |
#include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " = " << x << endl
#define _ << " _ " <<
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
vi p;
int find_p(int x) {
if (x == p[x]) return x;
retur... |
#include <iostream>
#include <vector>
#define ll long long
#define f first
#define s second
#define NMAX 500000
#define MOD 1000000007
using namespace std;
ll n, m, viz[NMAX+10];
ll nr, ans = 1, ans2, tata[NMAX+10], rang[NMAX+10];
vector <ll> nod[NMAX+10], a;
pair <ll, ll> v[NMAX+10];
ll findDaddy(ll x)
{ ll y = x... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#pragma region Macros
#define FOR(i, l, r) for(int i = (l) ;i < (r) ;i++)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n+1)
#define RFOR(i, l, r) for(int i = (l) ; i >= (r) ; i--)
#defin... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
class DSU {
public:
vector<int> uf, rank;
DSU(int n): uf(n), rank(n, 1) {iota(uf.begin(), uf.end(), 0);};
int find(int x){
if (uf[x] != x) uf[x] = find(uf[x]);
return uf[x];
}
bool unify(int x, int y){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef long double LD;
#define L first
#define smax(x, y) (x) = max((x), (y))
#define sz(x) ((int)(x).size())
#define R second
#define smin(x, y) (x) = min((x), (y))
#define PB push_back
#de... |
#include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c> {i, j}; }
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.