solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 3010, mod = 998244353, INF = 0x3f3f3f3f;
const double eps = 1e-6;
char a[N], b[N];
long long f[N][N];
int main() {
scanf("%s%s", a + 1, b + 1);
int n = strlen(a + 1), m = strlen(b + 1);
for (int i = 1; i <= n; i++)
if (i > m || a[1] == b[i]) f[i][i] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 30000;
bool f[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
int n;
cin >> n;
string a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
string aa = ... | 2 |
#include<iostream>
using namespace std;
long long N, A, B, C, D, E;
int main(){
cin >> N >> A >> B >> C >> D >> E;
long long m = min(A, min(B, min(C, min(D, E))));
cout << 4 + (N + m - 1) / m << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
vector<long long> diag[2000];
vector<long long> diag1[2000];
bool used[2000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int mas[n][m];
int mas1[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
cout << (X - Z) / (Y + Z) << "\n";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 5;
const int K = 100 + 5;
int n, k, mod;
inline int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
inline int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
inline int mul(int a, int b) { return 1LL * a * b % mod; }
int ... | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n + 1, vector<int>());
vector<int> list, degree(n + 1, 0);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
degree[x]+... | 2 |
#include <bits/stdc++.h>
const int N = 1e5 + 5;
std::vector<int> edge[N];
int a[N];
long long best[N], down[N];
long long ans;
int n;
void DFS(int u, int fa) {
std::vector<long long> downs;
for (auto v : edge[u]) {
if (v == fa) continue;
DFS(v, u);
best[u] = std::max(best[u], best[v]);
downs.push_ba... | 6 |
#include <bits/stdc++.h>
using namespace std;
int lx[6] = {4, 5, 3, 4, 6, 6};
char fol[6][10] = {"lios", "liala", "etr", "etra", "initis", "inites"};
char s[100100];
char e = 'a';
int len = 0;
int gend = -1;
int flagn = -1;
int flagv = -1;
int flag = 1;
int num = 0;
char word[100100];
void check() {
int match = 0;
... | 3 |
//#include<bits/stdc++.h>
//using namespace std;
#include<stdio.h>
#include<string.h>
const int MAXN=1e6+50;
char s[MAXN];
int main ()
{ scanf("%s",s);
int ans=0;
for(int i=strlen(s)-1;i>=1;i--)
{ if(s[i]>='6'||(s[i]=='5'&&s[i-1]>='5'))
{ans+='0'+10-s[i];s[i-1]++;}
else
... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).beg... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF(0x3f3f3f3f);
const long long LINF(0x3f3f3f3f3f3f3f3fLL);
const double DINF(1e20);
const double EPS(1e-12);
const double PI(acos(-1.0));
inline double cot(double x) { return 1.0 / tan(x); }
inline double sec(double x) { return 1.0 / cos(x); }
inline double csc(... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
int ind = -1;
int Min = INT32_MAX;
for (int i = 1; i <= n; ++i) {
int num;
cin >> num;
if (num < Min) {
count = 1;
Min = num;
ind = i;
} else if (num == Min)
count++;
}
cout... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
using LL = int64_t;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
LL x, temp, sum = 0;
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> temp;
if (i != 1) temp++;
sum += temp;
}
if (sum == x)
cout << "Y... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 50 * 1000 + 5, K = 500;
int p[MAXN], comp[MAXN], snd[MAXN];
char root[MAXN];
long long s[MAXN], ts[MAXN], pv[MAXN], pvs[MAXN], sv[MAXN];
pair<char, pair<int, int> > q[MAXN];
vector<int> g[MAXN], gc[MAXN];
bool dfsLca(int v) {
int cnt = root[v];
for (siz... | 5 |
#include <iostream>
#include <cstdio>
using namespace std;
const int P=1000000007;
const int N=2005;
int f[N][N][2];
int n,K,ans;
inline void update(int &x,int y){(x+=y)%=P;}
int main()
{
//freopen("solitaire.in","r",stdin),freopen("solitaire.out","w",stdout);
scanf("%d%d",&n,&K);
f[n+1][0][0]=1;
for (int i=n+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[51][51], dp[51][51][51][51];
int solve(int x1, int y1, int x2, int y2) {
if (x1 == x2 && y1 == y2) return a[x1][y1];
if (dp[x1][y1][x2][y2] != -1) return dp[x1][y1][x2][y2];
int ans = max(x2 - x1 + 1, y2 - y1 + 1);
for (int i = x1; i < x2; i++) {
ans = min... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e6 + 100;
int n, x, LOG[N];
bool have;
vector<int> vec;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
for (int i = 0; i <= 20; i++) LOG[1 << i] = i;
cin >> n >> x;
if (x >= (1 << n)) {
for (int i = 0; i < n; i++) vec.push_back(1 << i);
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m, l[101], r[101], t[101], c[101], d, s, k;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) cin >> l[i] >> r[i] >> t[i] >> c[i];
for (int i = 1; i <= n; i++) {
s = 0;
k = 1001;
for (int j = 1; j <= m; j++) {
if (l[j] <= i && r[j] >= i... | 2 |
#include <stdio.h>
#include <bitset>
std::bitset<4000400> b;
int main(){
int N, a[2020], s, i;
for (scanf("%d", &N), b[0] = 1, s = i = 0; i != N; i++)
scanf("%d", a+i), s += a[i], b |= b<<a[i];
for(i = s>>1; !b[i]; i--) ;
printf("%d\n", s-i);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
struct edge {
int to;
};
using graph = vector<vector<edge>>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
ll n, m;
cin >> n >> m;
vector<ll> a, b;
fo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
scanf("%d", &n);
cin >> s;
if (n & 1)
printf("%c%c%c", s[0], s[1], s[2]);
else
printf("%c%c", s[0], s[1]);
for (int i = (n & 1) + 2; i < n; i += 2) printf("-%c%c", s[i], s[i + 1]);
printf("\n");
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 200010;
const int inf = 2147483647;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + (ch ^ 48), ch = ge... | 6 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 0 |
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2,29);
const int MOD = 1000000007;
int main() {
int Q; cin >> Q;
priority_queue<ll> l; l.push(-1*LLINF);
priority_queue<ll, vector<ll>,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int tmp[109], arr[109];
int main() {
int n, m, r;
cin >> n >> m >> r;
if (m >= 2 * r && n >= 2 * r)
cout << "First\n";
else
cout << "Second\n";
return 0;
}
| 1 |
#include<iostream>
#include<iomanip>
#include<algorithm>
using namespace std;
int main(){
int n, w, x;
while(cin >> n >> w, n+w){
int hist[11] = {};
for(int i = 0; i < n; i++){
cin >> x;
hist[x/w]++;
}
int ma = *max_element(hist, hist+11);
int wid... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
map<int, vector<int>> mp;
cin >> n;
int arr[n];
int min = 1000000001;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mp[arr[i]].push_back(i);
if (arr[i] < min) min = arr[i];
}
map<int, vector<int>>::iterator itr = mp.find(min);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long binpow(long long a, long long b) {
a %= 1000000007;
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
b >>= 1;
}
return res;
}
void fun(int x, vector<int>& v) {
if (x == 4) {
v.push_back(3... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXS = 1000;
char str[MAXS];
unsigned char pre;
unsigned char rever(unsigned char now) {
unsigned char ret = 0;
for (unsigned int i = 0; i < 8; i++)
ret |= ((now & (1 << i)) != 0) << (7 - i);
return ret;
}
int main() {
cin.getline(str, MAXS);
pre = 0... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef bool boolean;
#define ll long long
void exgcd(int a, int b, int& x, int& y) {
if (!b) {
x = 1, y = 0;
} else {
exgcd(b, a % b, y, x);
y -= (a / b) * x;
}
}
int inv(int a, int n) {
int x, y;
exgcd(a, n, x, y);
return (x < 0) ? (x + n) : (x)... | 0 |
//Largest Rectangle
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
using namespace std;
class Rectangle {
public:
int pos, height;
Rectangle(int pos, int height): pos(pos), height(height) {}
};
int largestRectangle(int h, int w, vector<vector<int>> &G) {
vector<vector<int>> d... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)4e6;
int n, m;
int cnt[maxn], d[maxn];
int head, tail;
int q[maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &d[i]);
}
scanf("%d", &m);
for (int i = 0; i < m; ++i) {
int x;
scanf("%d", &x);
--x;
... | 5 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
int n,data[11][11];
while(1){
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
data[n][i]=0;
for(int j=0;j<n;j++){
cin>>data[j][i];
data[n][i]+=data[j][i];
}
}
for(int i=0;i<=n;i++){
data[i][n]=0;
fo... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int MOD = 998244353;
long long int mod = 1e9 + 7;
long long int INF = 1e18;
long long int dx[] = {1, -1, -1, 1};
long long int dy[] = {1, -1, 1, -1};
long long int binpow(long long int a, long long int b) {
if (b == 0) return 1;
long long int res = binpow(a, b... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5000005;
int prime[N + 2];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for (int i = 2; i <= N; i++) {
if (!prime[i])
for (int j = i; j <= N; j += i) {
prime[j] = prime[j / i] + 1;
}
}
for (int i = ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 21; i <= 50; i++)
cout << ((min(i, 25) + i) % (2 + (i % 3)) > 0) << endl;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int num[111111], n, a, b, timer = 1, val[111111];
vector<int> graf[111111];
void dfs(int v, int prev) {
printf("%d ", val[v]);
for (int i = 0; i < graf[v].size(); i++) {
int now = graf[v][i];
if (now == prev) continue;
dfs(now, v);
}
}
in... | 3 |
#include <iostream>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
int ans=0;
ans+=max((4-x)*100000,0);
ans+=max((4-y)*100000,0);
if(ans==600000)ans=1000000;
cout <<ans<<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main(){
scanf("%d %d",&a,&b);
if(a+b==15) puts("+");
else if(a*b==15) puts("*");
else puts("x");
return 0;
} | 0 |
#include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define ll long long
//#define file
using namespace std;
int d[250001],n,i,j,k,l,l1,l2,x,y,t;
ll a[501][501],mx,s;
map<ll,bool> mp;
bool bz[1000001];
ll gcd(ll x... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 5;
const long long naxN = 1e2 + 5;
long long fact[naxN], inv_fact[naxN];
long long power(long long a, long long n) {
long long res = 1;
while (n) {
if (n % 2)
res = (res * a) % 1000000007, n--;
else
a = (a * a) % 10000000... | 1 |
#include<bits/stdc++.h>
using namespace std;
int N,M;
int G[20][20],U[110],V[110],W[110];
int Sum[(1<<15)+5],F[(1<<15)+5][20];
int main()
{
int i,j,k,s;
scanf("%d%d",&N,&M);
for(i=1; i<=M; i++)
{
scanf("%d%d%d",&U[i],&V[i],&W[i]);
U[i]--,V[i]--;
G[U[i]][V[i]]=G[V[i]][U[i]]=W[i];
}
for(i=0; i<1<<N; i++)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T &get(T &n) {
cin >> n;
return n;
}
int main() {
int T, N, i, j;
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long row;
char col;
cin >> row >> col;
row--;
col -= 'a';
long long ans = 0;
ans += (row / 4) * 16;
row %=... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int g[405][405];
vector<int> v[405];
double ans;
double gai[405];
double pos[405];
double suan(int yi, int juli) {
memset(gai, 0, sizeof(gai));
for (int i = 1; i <= n; i++) {
if (g[i][yi] == juli) {
for (int j = 0; j < (int)v[i].size(); j++) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> x;
int main() {
cin >> n >> k;
for (int i = 1, j = n; i <= j; i++, j--) {
x.push_back(i);
if (i != j) x.push_back(j);
}
for (int i = 0; i < k; i++) cout << x[i] << ' ';
sort(x.begin() + k, x.end());
if (k % 2 == 0) reverse(x.begin()... | 1 |
#include <bits/stdc++.h>
inline long long rd() {
long long _x = 0;
int _ch = getchar(), _f = 1;
for (; !isdigit(_ch) && (_ch != '-') && (_ch != EOF); _ch = getchar())
;
if (_ch == '-') {
_f = 0;
_ch = getchar();
}
for (; isdigit(_ch); _ch = getchar()) _x = _x * 10 + _ch - '0';
return _f ? _x :... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> adj[1000];
stack<int> s;
int pos[1000];
bool vis[1000];
void dfs(int i) {
vis[i] = 1;
for (auto j : adj[i])
if (!vis[j]) dfs(j);
s.push(i);
}
int main() {
scanf("%d", &n);
scanf("%d", &m);
for (int i = 1; i <= m; i++) {
int x, y;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > l[300009];
vector<pair<long long int, int> > lol;
vector<int> temp;
set<pair<long long int, int> > possible;
long long int dp[300009][2];
void dfs(int ver, int par, int typ) {
for (auto it : l[ver]) {
if (it.first == par) {
continue;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
bool good = true;
for (int j = 0; j < n; ++j) {
int res;
cin >> res;
if (res == 1 || res == 3) good = false;
}
if (good) ans.push_back(i + 1);
}
cout << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
vector<long long> primeFact(long long n) {
vector<long long> ans;
for (long long t = 2; t <= sqrt(n); t++) {
if (n % t == 0) {
ans.push_back(t);
while (n % t == 0... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long s[1000003], a[2][1000003], p[2][1000003], n, ans, r, d;
int main() {
cin >> n;
for (int i = 0; i < 2; i++)
for (int j = 0; j < n; j++) scanf("%d", &a[i][j]);
for (int i = n - 1; i >= 0; i--) s[i] = s[i + 1] + a[0][i] + a[1][i];
for (int i = n - 1; i >=... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
const long long inf = 1e18 + 10;
int n;
vector<int> G[maxn];
vector<pair<int, int> > ans;
int du[maxn];
int T;
void dfs(int u, int fa, int pre) {
int i = pre;
int j = (int)G[u].size() - 1;
ans.push_back({u, pre});
for (auto v : G[u]) {
... | 6 |
#include <bits/stdc++.h>
using namespace std;
vector<int> vec[100010];
long long a[100010];
long long s;
int n;
long long dfs(int f, int u, long long val) {
int sz = vec[u].size(), v;
long long ret = 0, mv = ((long long)1e18), tmp;
if (sz == 1 && vec[u][0] == f)
return (a[u] = ((val) < (a[u]) ? (val) : (a[u])... | 4 |
#include <bits/stdc++.h>
int a[100010];
char b[100010];
int main() {
int damn = 1;
int n, l = -1000000000, r = 1000000000, cnt = 0, z = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
scanf("%s", &b);
for (int i = 4; i < n; ++i) {
if (!damn) {
if (++cnt == 4) damn = 1;
} el... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void chkmax(T& x, U y) {
if (x < y) x = y;
}
template <typename T, typename U>
inline void chkmin(T& x, U y) {
if (y < x) x = y;
}
int deg[110000];
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
if (n == 1) return p... | 5 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <assert.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <memory.h>
#include <time.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
typed... | 0 |
#include <bits/stdc++.h>
int gcd(int a, int b) {
if (a > b) {
a = a + b;
b = a - b;
a = a - b;
}
if (b % a == 0) return a;
return gcd(b % a, a);
}
int main() {
int T, tc, n, k, d, l, r, tans, ans, sum, m, tgt;
register int i;
scanf("%d", &T);
for (tc = 1; tc <= T; tc++) {
scanf("%d %d", ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;
int N;
const... | 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) (x)&(-x)
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define per(i,a,b) for (int i=a;i>=b;i--)
#define maxd 1000... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, par[200000][18], dist[200000], ans[200000];
long long a[200000], b[200000], pre[200000];
vector<int> g[200000];
void dfs(int x) {
for (int i = 1; i < 18; i++) par[x][i] = par[par[x][i - 1]][i - 1];
dist[x] = dist[par[x][0]] + 1;
pre[x] = b[x];
if (x != 0) pre... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct point {
int x, y;
};
point a, b;
double d(point a, point b) {
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
int ok1(int ra, int rb) {
double t = d(a, b);
int t1 = ra - rb;
if (t1 < 0) return 0;
if (t - t1 < 1E-6)
return 1;
el... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int NIL = -1;
void sizeDfs(const vector<vector<int>>& tree, const vector<bool>& isErased,
const int x, const int father, vector<int>& sizes) {
sizes[x] = 1;
for (const auto& y : tree[x]) {
if (y != father && !isErased[y]) {
sizeDfs(tree, isE... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int SIZE = 3e5 + 10;
int v[SIZE];
int nxt[SIZE][26], sz[SIZE];
char s[SIZE];
vector<int> e[SIZE];
void merge(int x, int y, int &num) {
for (int i = 0; i < (26); ++i) {
if (nxt[y][i]) {
if (!nxt[x][i]) {
num += sz[nxt[y][i]]... | 4 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
int N;
int l[523456],r[523456];
int nc[523456];
long long wos[523456];
long long mem[523456];
long long rec(int x,int d){
if(x==N)return 0;
auto lr=rec(l[x],d+1),rr=rec(r[x],d+1);
nc[x]=nc[l[x]]+n... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename... T>
void read(T &...args) {
((cin >> args), ...);
}
template <typename... T>
void write(T... args) {
((cout << args << ' '), ...);
}
const long long MOD = 1000000007;
const long long INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
cons... | 3 |
#include <bits/stdc++.h>
#pragma hdrstop
#pragma argsused
using namespace std;
int main(int argc, char* argv[]) {
int n, m;
cin >> n >> m;
vector<int> Y(n, 0), N(n, 0), Z(n);
vector<bool> K(n, false);
int yes = 0, no = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &Z[i]);
if (Z[i] > 0) {
Y[Z[i]... | 2 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n, k, p[200001];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for(int i=0; i<n; ++i) {
cin >> p[i+1];
p[i+1]+=p[i];
}
int ans=0;
for(int i=k; i<=n; ++i) {
ans=max(ans, p[i]-p[i-k]);
}
cout << f... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
int na, nb, nc, ra, rb, rc, da, db, lim = 1594323, num[13], sp[110], ss, tp, vp,
op;
pair<double, double> p[110], rg[110], obj[110];
double v[110], f[110][110], g[110][110], ans;
bool cmp(pair<double, double> x, p... | 5 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef l... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
char ch = getchar();
long long w = 1, c = 0;
for (; !isdigit(ch); ch = getchar())
if (ch == '-') w = -1;
for (; isdigit(ch); ch = getchar()) c = (c << 1) + (c << 3) + (ch ^ 48);
return w * c;
}
const int M = 3e5 + 10;
map<vector<vecto... | 6 |
#include <bits/stdc++.h>
using namespace std;
int N;
char str[15];
int main() {
scanf("%d", &N);
while (N--) {
scanf("%s", str);
vector<pair<int, int> > ans;
for (int a = 1; a <= 12; a++)
if (12 % a == 0) {
int b = 12 / a;
for (int i = 0; i < b; i++) {
bool is_ans = 1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long mod = 1e9 + 7;
const long long maxn = 1e5 + 10, maxt = 100 + 10;
long long pa[9][49];
long long n, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < ... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, n;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long t;
scanf("%I64d", &t);
while (t--) {
scanf("%I64d%I64d%I64d", &a, &b, &n);
if (n == 0)
printf("%I64d\n", a);
else if (n == 1)
printf("%lld\n"... | 1 |
#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))... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m, b[300001], a[300001], l, r, mid, res;
bool check(int x) {
int y;
for (int i = 1; i <= n; i++) b[i] = a[i];
for (int i = 1; i <= n; i++) {
y = b[i - 1] - b[i];
if (y < 0) y += m;
if (y <= x)
b[i] = b[i - 1];
else if (b[i] < b[i - 1])
... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> smPrime(1000000 + 2);
vector<long long> primeAr;
void prAr(vector<long long> a) {
auto print = [](const long long &n) { cout << n << " "; };
for_each(a.begin(), a.end(), print);
cout << endl;
}
void prAr(vector<vector<long long> > a) {
auto print =... | 3 |
#include <bits/stdc++.h>
using namespace std;
void update(int, int, int, int, int, int, int);
long long int query(int, int, int, int, int, int, int);
int l[200001], r[200001], c[200001];
pair<int, int> tree[2][10000001];
vector<int> v[200001];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, x, i, j;
lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
struct unit {
int w1, w2, w3, sw1, sw2, sw3;
long long up, l, l1, l2, l3, s1, s2, s3;
};
struct unit f[100010];
struct edge {
int u, v, next;
};
struct edge e[400010];
int n, num;
int head[200010], a[200010];
long long ans;
void add(int u, int v) {
e[num].u = u;
e... | 6 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline int size(T& n) {
return n.size();
}
int toInt(string s) {
int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
template <class T>
string toString(T n) {
ostringstream ost;
ost << n;
ost.flush();
return ost.str();
}
int N, x, y;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long int left1, right1, ans;
};
node st[401001];
long long int n, array1[100001], destr, compleft[401000], compright[401000];
void build(int a, int b, int index) {
if (a == b) {
st[index].left1 = st[index].right1 = st[index].ans = array1[a];
c... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s[n], p[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
s[i] = a[i];
p[i] = 0;
}
sort(s + 1, s + n + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
p[j] += abs(a[i] - s[j]);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long int pow(long long int x, long long int y, long long int m) {
long long int res = 1;
x = x % m;
while (y > 0) {
if (y & 1) res = ((res % m) * (x % m)) % m;
y = y >> 1;
x = ((x % m) * (x % m)) % m;
}
return res % m;
}
template <typename Arg1>
v... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, mx2, meet = 0;
cin >> a >> b;
long long res = abs(a - b);
long long mx = max(a, b);
mx2 = mx;
long long mn = min(a, b);
long long ab = a * b;
while (mx <= ab) {
if ((mx % mn) == 0) meet++;
mx += mx2;
}
res -= meet;
... | 3 |
#include<bits/stdc++.h>
using l=long long;int main(){l h;std::cin>>h;printf("%llu",(l)pow(2,floor(log2(h))+1)-1);} | 0 |
#include <bits/stdc++.h>
using namespace std;
string ans[] = {
"OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT",
"OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT", "OUT",
"OUT", "OUT", "OUT", "OUT", "IN", "IN", "IN", "IN", "IN", "IN", "IN",
"IN", "IN"... | 5 |
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<map>
#include<string>
#include<cstring>
using namespace std;
map <string,int> ke;
int main(){
int n;
char k[256];
while(scanf("%d,%s",&n,k)!=EOF){
string st=k;
ke[st]++;
}
cout << ke["A"] << endl;
cout << ke["B"] << endl;
cout << ke[... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct al {
int kol_vo;
int ob;
int rev;
priority_queue<int> s, s1;
};
int main() {
int kol_vo, len, max_pol = 0, answ = 0;
cin >> kol_vo >> len;
unordered_map<string, al> m;
unordered_map<string, pair<int, priority_queue<int> > > pol;
for (int c = 0; c < ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, a[200010];
int qd(int l, int r, int tot, int b) {
if (r - l <= 1) return 0;
int lb = lower_bound(a, a + n, tot + (1 << b)) - a;
if (lb >= r - 1) return qd(l, lb, tot, b - 1);
if (lb <= l + 1) return qd(lb, r, tot + (1 << b), b - 1);
return min(lb - l - 1 + ... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long n;
int cnt;
int main() {
cin >> n;
while (n > 0) {
if (n % 10 == 4 || n % 10 == 7) cnt++;
n = n / 10;
}
if (cnt == 4 || cnt == 7)
cout << "YES";
else
cout << "NO";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, a[3 * 100000 + 5], r[3 * 100000 + 5];
bool cmp(int x, int y) { return a[x] < a[y]; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
r[i] = i;
}
sort(r + 1, r + n + 1, cmp);
for (int i = 2; i <= n; i++) {
if (a[r... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = (long long)(1e6) + 10;
const long long mod = 998244353;
const long long inf = 1e9;
const double eps = 1e-16;
const double pi = acos(-1);
inline long long rd() {
long long p = 0;
long long f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {... | 2 |
#include <bits/stdc++.h>
using namespace std;
int N;
int A[202020];
int main() {
int tc; scanf("%d", &tc);
while(tc--) {
scanf("%d", &N);
for(int i = 1; i <= N; i++) scanf("%d", &A[i]);
set<int> S;
set<int>::iterator it;
bool ok = true;
for(int i = 1; i <= N; i++) {
S.insert(A[i]);
if(i > 1) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
double l, v1, v2;
while (~scanf("%d%lf%lf%lf%d", &n, &l, &v1, &v2, &k)) {
int g = n / k + (n % k != 0);
double a = (v1 + v2) * l / (v1 + v2 + 2 * (g - 1) * v1);
double sum = a / v2 + (l - a) / v1;
printf("%.10f\n", sum);
}
re... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int n, k;
int a[N], f[N];
bool check(long long x) {
memset(f, 0, sizeof f);
f[1] = 1;
int ans = 0;
for (int i = 2; i <= n; i++) {
f[i] = 1;
for (int j = i - 1; j >= 1; j--)
if (abs(a[i] - a[j]) <= 1ll * (i - j) * x) f[i] = max(f[i],... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, aux;
cin >> n >> k;
char w[2 * n];
for (int i = 1; i <= 2 * n; i++) {
cin >> w[i];
}
int d[2 * n + 1];
d[1] = 0;
for (int i = 2; i < 2 * n + 1; i++) {
d[i] = n;
}
queue<int> cola;
cola.push(1);
while (cola.empty() == 0)... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MXN = 1e5 + 1;
const int TMXN = 2e6 + 10;
const long long INF = 2e9 + 7;
const long long INFL = 1e18;
int n, ans, res, cnt[4], x, y, k, add;
string second = "BGR";
char a[MXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i]... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
vector<pair<long long int, long long int> > a;
int asdasd[N];
int main() {
int d, n, m;
cin >> d >> n >> m;
for (int i = 0; i < m; i++) {
int x, p;
cin >> x >> p;
a.push_back(make_pair(x, p));
}
a.push_back(make_pair(d, 0));
a... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, ans, mod = 1e9 + 7;
long long fexp(long long a, int x, long long mod) {
if (x == 0) return 1ll;
if (x % 2 == 0) {
long long y = fexp(a, x / 2, mod);
return (y * y) % mod;
}
return (a * fexp(a, x - 1, mod)) % mod;
}
long long divv(long long a,... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.