source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
double a[n+3];
for(int i=0; i<n; i++)
cin>>a[i];
int r=0;
int c=2;
if(n<=2)
{
cout<<0<<endl;
... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | 0ac386bbf44d672d5d4f1edbfa25716c | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define endl '\n'
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define pp pop_back
#define ins insert
#define lb lower_bound
#define ub upper_bound... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | a435caf33a039cdbb06516a0b6a28f2f | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void my_dbg() ... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | 941b6358b2d398fc1cd184a2f31a9d4f | 1,500 | PASSED |
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <utility>
#include <sstream>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <string>
#... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | e099cfff47da3d21d7daa80dbeaa7264 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define lld long double
#define fl(i,n) for(int i=0;i<n;i++)
using namespace std;
void asquare()
{
ll n;
cin>>n;
vector<lld>arr(n);
fl(i,n)cin>>arr[i];
lld d;
ll c=2;
ll ans=0;
if(n==1||n==2){cout<<"0\n";return;}
fl(i,n)
... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | 60737c7a665b145d1f5f0ed1399f2350 | 1,500 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
#define lld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define fl(i,n) for(int i=0;i<n;i++)
#define rl(i,m,n) for(int i=n;i>=m;i--)
#define py cout<<"YES\n";
#define pn cout<<"NO\n";
#define pi 3.... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | ea931a732b19bd9e6f9711fe23a7a115 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
using namespace std;
//ll n, mn, mx, x, ans;
map <ll, ll> us;
//vector < ll > vc, ans;
int main ()
{
fast
ll test = 1;
cin >> test;
while(test--)
{
int n;
... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | 0f5102c8ba32a1c181ba461f537ea7ea | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[1111];
int main(){
int t;
cin>>t;
while(t--){
int n,i,j,k,ans=1;cin>>n;
for(i=1;i<=n;i++) cin>>a[i];
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
int res=0;
for(k=1;k<=n;k++) if(k==i||k==j||(a[k]-a[i])*(k-j)==(a[k]-a[j])*(k-i)) res++;
an... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | 1d8ec72b8716ebdc10b4d722fe9cacc6 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 70 + 1;
int n, a[N];
void read_input() {
cin >> n;
for (int i = 0; i ^ n; i++)
cin >> a[i];
}
int find(int l, long double d, int res = 0) {
for (int i = 0; i ^ n; i++)
res += ((i - l) * d + a[l] < a[i] && a[i] - (i - l) * d - a[l... | C++ | 6aca8c549822adbe96a58aee4b0d4b3f | d9b6ff7ddfc3b603fb72e3c038103c45 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=105;
int t,n,m,a[N*N][N*3],id[N][N],f[N*3],cnt,tot;
int mp[N*3],tt[N*N],b[N*N][N*3];
void Gauss(int n)
{
for(int i=1;i<=n;++i)
{
for(int j=i;j<=tot;++j)if(a[j][i]){if(i!=j)swap(a[j],a[i]);break;}
if(!a[i][i]){for(int j=1;j<i;++j)if(!a[j][j]&&a[j][... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | 7dfcd32f0228fd7e413c7d03af9c1351 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define gc getchar()
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
inline int read(){
int x=0,fl=0;char s=gc;
while('0'>s||s>'9'){if(s=='-')fl=1;s=gc;}
while('0'<=s&&s<='9'){x=x*10+s-48;s=gc;}
return fl?-x:x;
}
const int N=3... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | ac7888aff4f6cf322cc88eed468ea413 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define gc getchar()
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
inline int read(){
int x=0,fl=0;char s=gc;
while('0'>s||s>'9'){if(s=='-')fl=1;s=gc;}
while('0'<=s&&s<='9'){x=x*10+s-48;s=gc;}
return fl?-x:x;
}
const int N... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | d522442dfb28403a60766f5d9c624ed1 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define gc getchar()
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
inline int read(){
int x=0,fl=0;char s=gc;
while('0'>s||s>'9'){if(s=='-')fl=1;s=gc;}
while('0'<=s&&s<='9'){x=x*10+s-48;s=gc;}
return fl?-x:x;
}
const int N... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | 2630aa8cd2d712a1a1b709915efbc0b8 | 2,900 | PASSED |
// LUOGU_RID: 94252683
#include<bits/stdc++.h>
using namespace std;
const int NR=305;
const int MR=NR*NR;
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=getchar();}
return x*f;
}
int n,m,flag;
int id[NR][NR];
int f[... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | 83ae0cb81241b36f87adceb18bfd23d4 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int a[20005][N], x[N];
int n, m, f[N][N], tot = 0, t;
void Out() {
for(int i = 1; i <= tot; i ++) {
for(int j = 1; j <= m + 1; j ++)
cout << a[i][j] << " ";
cout << endl;
}
cout << en... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | ceff5c963e8cb63e5062069756ecdca3 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ls u<<1
#define rs u<<1|1
#define mm(x) memset(x,0,sizeof(x))
#define debug(x) cout << #x << ":" << x << '\n'
using namespace std;
int read()
{
int a=0;int f=0;char p=getchar();
while(!isdigit(p)){f|=p=='-';p=getchar();}
while(isdigit(p)){a=(a<... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | ae05ef439b433da942b135cfc04dad41 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ls u<<1
#define rs u<<1|1
#define mm(x) memset(x,0,sizeof(x))
#define debug(x) cout << #x << ":" << x << '\n'
using namespace std;
int read()
{
int a=0;int f=0;char p=getchar();
while(!isdigit(p)){f|=p=='-';p=getchar();}
while(isdigit(p)){a=(a<... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | 921d9c775c9c69c4e8faa75509423805 | 2,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ls u<<1
#define rs u<<1|1
#define mm(x) memset(x,0,sizeof(x))
#define debug(x) cout << #x << ":" << x << '\n'
using namespace std;
int read()
{
int a=0;int f=0;char p=getchar();
while(!isdigit(p)){f|=p=='-';p=getchar();}
while(isdigit(p)){a=(a<... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | a1ddfc4d5fc297b9c716380715a973df | 2,900 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int maxn = 66, maxm = 260;
int T, n, m, id[maxn][maxn], w[maxn][maxn], ans[maxm];
bool has[maxm];
struct st {
int a[maxm];
st() { memset(a, 0, sizeof(a)); }
void operator += (const st &o) {
... | C++ | bb9f0e0431ef4db83190afd7b9ed4496 | 97cc2fd8584789ddf30b0ca1063543a9 | 2,900 | PASSED |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.141592653589793238462... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | 15c59175a0fbd055b348fa91707ee761 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.141592653589793238462... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | ad40ff5cd57a3e8c2b44010a807c2e9b | 2,000 | PASSED |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.141592653589793238462... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | 54afb09d312726e91fe9c484b9440916 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.141592653589793238462... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | 3ae909784a9269f3584798c9a4cf7373 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.141592653589793238462... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | 2d0bb449f71327cae53823eebbb9c92f | 2,000 | PASSED |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.141592653589793238462... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | 88875bcead2c626ac7c16d0b278a39ca | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
struct node
{
long long maxpre;
long long sum;
int num;
};
void solve()
{
int n;
cin >> n;
vector<vector<node>> V(n + 1, vector<node>(3));
vector<int> A(n + 1);
V[0][0] = V[0][1] = V[0][2] = {0, 0, ... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | def73bc03fbaa0eb77826468c14a4dab | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS std::ios::sync_with_stdio(false);
#define endl '\n'
#define int long long
#define mod 998244353
#define _1 first
#define _2 second
int x[50025];
int up[6*100009];
int t_max[6*100009];
void build(int rt,int l,int r)
{
if(l==r)
{
... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | 94f0e1ea55cdb3f26cc8a15a4afe4ce2 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ANS cout<<"ans: ";
const int N = 1e6 + 10;
int a[N];
struct node {
int v;
int w;
};
int n;
inline bool check (int x, int id)
{
if(id == 0) return x - 1 >= 0;
else return x + 1 < n;
}
void solve ()
{
... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | e4940b29b61c975a41f1e34eb989ca5b | 2,000 | PASSED |
// Problem: D. Keep the Average High
// Contest: Codeforces - Good Bye 2021: 2022 is NEAR
// URL: https://codeforces.com/contest/1616/problem/D
// Memory Limit: 256 MB
// Time Limit: 1500 ms
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);c... | C++ | 79ecf771f4a54c2c9f988e069f7bfceb | b6176c10115bac7bb20e895e4efe4ef7 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define re register
#define RI re int
#define ll long long
#define db double
#define lb long db
#define N (150000+5)
#define M (1<<20)
#define mod 998244353
#define Mod (mod-1)
... | C++ | e849aa63710c817aac610a1deeb366c5 | 380de0d00a67a7ba14dd4171b9da868b | 3,000 | PASSED |
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define re register
#define RI re int
#define ll long long
#define db double
#define lb long db
#define N (150000+5)
#define M (1<<20)
#define mod 998244353
#define... | C++ | e849aa63710c817aac610a1deeb366c5 | 8543ecb11327aa2bb56c488a7a6ce0e2 | 3,000 | PASSED |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i <= int(b); i ++)
#define per(i, a, b) for(int i = (a); i >= int(b); i --)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define sz(s) (int)(s.s... | C++ | e849aa63710c817aac610a1deeb366c5 | f8b5a5d428885985c8f1d83278490807 | 3,000 | PASSED |
#include <bits/stdc++.h>
#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)
using namespace std;
using ll = long long;
using db = double;
... | C++ | e849aa63710c817aac610a1deeb366c5 | ebd191facafda30555cb28ac1e40f120 | 3,000 | PASSED |
#include<iostream>
#include<cstdio>
using namespace std;
const int SIZE=1.5e5+10;
const int mod=998244353;
int tree[SIZE<<6][2],postot=1;
int siz[SIZE<<6];
int a[SIZE];
void insert(int x){
int cur=1;
siz[cur]++;
for(int i=30;i>=0;i--)
{
bool flag=(x>>i)&1;
if(!tree[cur]... | C++ | e849aa63710c817aac610a1deeb366c5 | fd231fed6b07781f2e09dd310e7eb2a9 | 3,000 | PASSED |
#include<iostream>
#include<cstdio>
#define int long long
using namespace std;
const int SIZE=1.5e5+10;
const int mod=998244353;
int tree[SIZE<<6][2],postot=1;
int siz[SIZE<<6];
int a[SIZE];
void insert(int x){
int cur=1;
siz[cur]++;
for(int i=30;i>=0;i--)
{
bool flag=(x>>i)&1;... | C++ | e849aa63710c817aac610a1deeb366c5 | b4129929a347180b76638e8296f39768 | 3,000 | PASSED |
#include<bits/stdc++.h>
#define N 150010
#define NN 4500010
#define lc(u) ch[u][0]
#define rc(u) ch[u][1]
using namespace std;
namespace modular
{
const int mod=998244353;
inline int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
inline int dec(int x,int y){return x-y<0?x-y+mod:x-y;}
inline int mul... | C++ | e849aa63710c817aac610a1deeb366c5 | fbaff325a6f09a0707f2ef5e046b8afc | 3,000 | PASSED |
#include<bits/stdc++.h>
#define N 150010
#define NN 4500010
#define lc(u) ch[u][0]
#define rc(u) ch[u][1]
using namespace std;
namespace modular
{
const int mod=998244353;
inline int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
inline int dec(int x,int y){return x-y<0?x-y+mod:x-y;}
inline int mul... | C++ | e849aa63710c817aac610a1deeb366c5 | 13c63f507f7da41b83fe3a1bd5b24135 | 3,000 | PASSED |
#include <bits/stdc++.h>
#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 pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define sz(x) int(x.size())
#define ll long long
using n... | C++ | e849aa63710c817aac610a1deeb366c5 | 48874e18bc7310954501418e7f0c6b8c | 3,000 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <map>
#include <bitset>
using namespace std;
#define N 7500005
int n, x;
int a[150002];
int mod = 998244353;
int ans = 0;
int L[N], R[N], sum[N];
long long bin[150002];
int tot = 0;
int root;
void insert(int &x, int... | C++ | e849aa63710c817aac610a1deeb366c5 | 41304e7f365d30da78f221a69541241c | 3,000 | PASSED |
//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <... | C++ | ce3f65acc33d624ed977e1d8f3494597 | 90ebdf4acddd5f668b816b74d680f853 | 3,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
bool Begin;
const int max_n=150005,N=150000;
inline int read(){
int x=0;bool w=0;char c=getchar();
while(c<'0' || c>'9') w|=c=='-',c=getchar();
while(c>='0' && c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return w?-x:x;
}
inline void writ... | C++ | ce3f65acc33d624ed977e1d8f3494597 | fa768e99281d3ff38ddf10405c846982 | 3,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
bool Begin;
const int max_n=150005,N=150000;
inline int read(){
int x=0;bool w=0;char c=getchar();
while(c<'0' || c>'9') w|=c=='-',c=getchar();
while(c>='0' && c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return w?-x:x;
}
inline void writ... | C++ | ce3f65acc33d624ed977e1d8f3494597 | 4c9a444b416dba27de90d58819228419 | 3,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
bool Begin;
const int max_n=150005,N=150000;
inline int read(){
int x=0;bool w=0;char c=getchar();
while(c<'0' || c>'9') w|=c=='-',c=getchar();
while(c>='0' && c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return w?-x:x;
}
inline void writ... | C++ | ce3f65acc33d624ed977e1d8f3494597 | 718863aa5fd505b66e2422414864a0bb | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 500010
#define ll long long
#define ld long double
#define inf 1e9
#define p 998244353
int read(){int x=0,f=1;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-'0',c=getchar();return x*f;}
int T,n,m,vis[... | C++ | ce3f65acc33d624ed977e1d8f3494597 | d929f64952a5c3816daedcbb178570b5 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 500010
#define ll long long
#define ld long double
#define inf 1e9
#define p 998244353
int read(){int x=0,f=1;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-'0',c=getchar();return x*f;}
int T,n,m,vis[... | C++ | ce3f65acc33d624ed977e1d8f3494597 | 1f3306735de5d8e1688eaeb53bb4cc22 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,m;
int flag[150005];
vector<int> edge1[150005],edge2[150005];
int L[150005],R[150005];
int vis[150005][2];
void dfs1(int x,int now){
if(vis[x][now])return;
vis[x][now]=1;
for(int y:edge1[x])if(y<=R[x+1]+1)dfs1(y-1,now^1);
}
void dfs... | C++ | ce3f65acc33d624ed977e1d8f3494597 | 1f30d32fcc31f1fa651043df83aa528a | 3,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
const int nn = 5e5 + 5;
typedef long long ll;
int T, n, m, pos1, pos2;
ll ans;
int vis1[nn], vis2[nn], vis3[nn], adj1[nn];
std::vector<int> adj2[nn], adj3[nn], adj4[nn];
void dfs(int p, int vis[], const std::vector<int> *adj) {
if (vis[p]) return; vi... | C++ | ce3f65acc33d624ed977e1d8f3494597 | 69875cb0d21dc997f1fe46adc8bbe304 | 3,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
const int nn = 5e5 + 5;
typedef long long ll;
int T, n, m, pos1, pos2;
ll ans;
int vis1[nn], vis2[nn], vis3[nn], adj1[nn];
std::vector<int> adj2[nn], adj3[nn], adj4[nn];
void dfs(int p, int vis[], const std::vector<int> *adj) {
if (vis[p]) return; vi... | C++ | ce3f65acc33d624ed977e1d8f3494597 | f1c6b292b49a98200a0b1e40659cce2b | 3,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
const int nn = 5e5 + 5;
typedef long long ll;
int T, n, m, pos1, pos2;
ll ans;
int vis1[nn], vis2[nn], vis3[nn], adj1[nn];
std::vector<int> adj2[nn], adj3[nn], adj4[nn];
void dfs(int p, int vis[], const std::vector<int> *adj) {
if (vis[p]) return; vi... | C++ | ce3f65acc33d624ed977e1d8f3494597 | a4fa79fa4b3cff883c7d28c2e44a3359 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int freq[400005];
int main()
{
int tt;
cin>>tt;
while(tt--){
int n;
cin>>n;
fill(freq,freq+n+13,0);
string s,t;
cin>>s>>t;
string sflipped=s;
for(int i=0;i<n;i++){
if(sflippe... | C++ | cc9abcff3224118b533881335e4c582b | 3a2d83cf7a2173e00d41e558381b7456 | 1,400 | PASSED |
/*
⣿⣆⠱⣝⡵⣝⢅⠙⣿⢕⢕⢕⢕⢝⣥⢒⠅⣿⣿⣿⡿⣳⣌⠪⡪⣡⢑
⣿⣿⣦⠹⣳⣳⣕⢅⠈⢗⢕⢕⢕⢕⢕⢈⢆⠟⠋⠉⠁⠉⠉⠁⠈⠼⢐
⢰⣶⣶⣦⣝⢝⢕⢕⠅⡆⢕⢕⢕⢕⢕⣴⠏⣠⡶⠛⡉⡉⡛⢶⣦⡀⠐
⡄⢻⢟⣿⣿⣷⣕⣕⣅⣿⣔⣕⣵⣵⣿⣿⢠⣿⢠⣮⡈⣌⠨⠅⠹⣷⡀
⡵⠟⠈⢀⣀⣀⡀⠉⢿⣿⣿⣿⣿⣿⣿⣿⣼⣿⢈⡋⠴⢿⡟⣡⡇⣿⡇
⠁⣠⣾⠟⡉⡉⡉⠻⣦⣻⣿⣿⣿⣿⣿⣿⣿⣿⣧⠸⣿⣦⣥⣿⡇⡿⣰
⢰⣿⡏⣴⣌⠈⣌⠡⠈⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣬⣉⣉⣁⣄⢖⢕
⢻⣿⡇⢙⠁⠴⢿⡟⣡⡆⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣵
⣄⣻⣿⣌⠘⢿⣷⣥⣿⠇⣿⣿⣿⣿⣿⣿⠛⠻⣿⣿⣿⣿⣿⣿⣿⣿⣿
⢄⠻⣿⣟⠿⠦⠍⠉⣡⣾⣿⣿⣿⣿⣿⣿⢸⣿⣦⠙⣿⣿⣿⣿⣿⣿⣿
⡑⣑⣈⣻⢗⢟⢞⢝⣻⣿⣿⣿⣿⣿⣿⣿⠸⣿⠿⠃⣿⣿⣿⣿⣿⣿... | C++ | cc9abcff3224118b533881335e4c582b | 1864ae74a9ed9d34a5385f3321480cef | 1,400 | PASSED |
// LUOGU_RID: 93293703
#include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define re register
#define N 1000012
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
inline int read(){
int x=0,w=0;char ch=getchar();
while (!isdigit(ch))w|=ch=='-',ch=getchar()... | C++ | cc9abcff3224118b533881335e4c582b | ddfd0b8dcf8fd99eaba0b023631bb0d7 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define re register
#define N 1000012
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
inline int read(){
int x=0,w=0;char ch=getchar();
while (!isdigit(ch))w|=ch=='-',ch=getchar();
while (isdigit(ch))... | C++ | cc9abcff3224118b533881335e4c582b | 84926502267c6d8548fd7b7504958c20 | 1,400 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define fin for(int i=0;i<n;i++)
#define fjk for(int j=0;j<k;j++)
#define fit for(int i=0;i<t;i++)
#define vi vector <int>
#define pb push_back
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define mii map<int,int>
#define nod(n) floor(log10(n))+1 ... | C++ | cc9abcff3224118b533881335e4c582b | 8b18733053a631e831c0c546b62842b3 | 1,400 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define fin for(int i=0;i<n;i++)
#define fjk for(int j=0;j<k;j++)
#define fit for(int i=0;i<t;i++)
#define vi vector <int>
#define pb push_back
#define vpii vector<pair<int,int>>
#define vs vector<string>
#define mii map<int,int>
#define nod(n) floor(log10(n))+1 ... | C++ | cc9abcff3224118b533881335e4c582b | f1a546c8830513c779cd95db2590829d | 1,400 | PASSED |
// LUOGU_RID: 93213820
#include<string>
#include<iostream>
#include<utility>
#include<vector>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(nullptr);
int T;
cin >> T;
while(T--){
vector<pair<int,int> > ans;
int cnt1=0,n;
string s1,s2;
cin ... | C++ | cc9abcff3224118b533881335e4c582b | 2762e5fb4b4d26f85a04046a4374fc3e | 1,400 | PASSED |
#include<string>
#include<iostream>
#include<utility>
#include<vector>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(nullptr);
int T;
cin >> T;
while(T--){
vector<pair<int,int> > ans;
int cnt1=0,n;
string s1,s2;
cin >> n >> s1 >> s2;
... | C++ | cc9abcff3224118b533881335e4c582b | 0c506f80c5a9f701737751944ca2e341 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+2;
int T,n,s,x;
char a[N],b[N];
signed main(){
scanf("%d",&T);
while(T--){
scanf("%d %s %s",&n,a+1,b+1);
s=x=0;
for(int i=1;i<=n;++i) s+=a[i]^b[i],x+=a[i]&1;
if(s&&s<n){printf("NO\n");continue;}
printf("YES\n");
if(x%2^!s) printf(... | C++ | cc9abcff3224118b533881335e4c582b | 4031ca1dc890dff6caffda864e8fa495 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const int INF = 1e9; const ll INFLL = 1e18;
int n;
string s; string s2;
struct segment {
char ch;
int l; int r;
segment(char i, int j, int k) {
ch = i; l = j; r = k;
}
segment() {}
};
int main() {
... | C++ | cc9abcff3224118b533881335e4c582b | 7fc395fff64490efc31a0c932ba8fec9 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(register int i=j;i<=k;++i)
#define g(i,j,k) for(register int i=j;i>=k;--i)
int n,m,s,l;
const int mo=998244353;
int a[202020];
int b[202020];
int p[202020];
inline void ycl(int n){
f(i,2,n){
g(j,sqrt(i),2)if(... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | 41baf8eb39b07a659dbd429a60b2bd92 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define mod 998244353
#define PII pair<int,int>
using namespace std;
int n, m, a[200005];
bool v[10000005];
vector<int> p;
void primes(int n) {
for(int i = 2; i <= n; i++) {
if(!v[i]) {
p.push_back(i);
v[i] = 1;
for(int j = i; j <= n / i; j++) {
... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | 2e97b88b8299e3b252e54ded02023347 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define mod 998244353
#define PII pair<int,int>
using namespace std;
int n, m, a[200005];
bool v[10000005];
vector<int> p;
void primes(int n) {
for(int i = 2; i <= n; i++) {
if(!v[i]) {
p.push_back(i);
v[i] = 1;
for(int j = i; j <= n / i; j++) {
... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | c295323438c914f1005838ddfd93f8e5 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define mod 998244353
#define PII pair<int,int>
using namespace std;
int n, m, a[200005];
bool v[10000005];
vector<int> p;
void primes(int n) {
for(int i = 2; i <= n; i++) {
if(!v[i]) {
p.push_back(i);
v[i] = 1;
for(int j = i; j <= n / i; j++) {
... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | 8b2c4fd08f8c01b392e3611522546584 | 1,800 | PASSED |
// LUOGU_RID: 94399119
#include <bits/stdc++.h>
using namespace std;
namespace IO
{
const int N = 1e7 + 5;
#ifdef ONLINE_JUDGE
char buf[1 << 21], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
#endif
templa... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | ac458f3b8b0f91d641221fa09d9f9965 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
int prime[5000010];
bool is_prime[5000010];
ll mu[5000010];
void init()
{
memset(is_prime,1,sizeof(is_prime));
int cnt=0;
is_prime[1]=0;
mu[1]=1;
for(int i=2;i<=5000000;i++)
{
... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | 75195e289597ab1196be0567f0901ae2 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
int b[200010];
int n, m;
int tmpb;
vector<pair<int, int>>fac;
int dfs(int now, int nowval, int mu) {
if(now == fac.size()) {
return mu * (m / nowval / tmpb);
}
auto nowfac = fac[now]... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | 6d82c56bb45bc4d2ec3a27431844e932 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=1e6+100;
const int MOD=998244353;
int a[N];
bool b[N];
vector<int> vec,p;
void sev()
{
for(int i=2;i<=1e5;i++){
if(b[i])continue;
p.push_back(i);... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | 9e942d493ec393710e18b9b16f888958 | 1,800 | PASSED |
///******* In the name of ALLAH, Who is Most Gracious, Most Merciful *******///
///******* There is no God but ALLAH, MUHAMMAD(S.A.W) is the Messenger of ALLAH. *******///
///******* Every soul shall taste death.*******///
// AL-HAMDULILLAH // AL-HAMDULILLAH // AL-HAMDULILLAH // AL-HAMDULILLAH
// A... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | ed3e8d19c76fd433499c6e93872e4a1f | 1,800 | PASSED |
///******* In the name of ALLAH, Who is Most Gracious, Most Merciful *******///
///******* There is no God but ALLAH, MUHAMMAD(S.A.W) is the Messenger of ALLAH. *******///
///******* Every soul shall taste death.*******///
// AL-HAMDULILLAH // AL-HAMDULILLAH // AL-HAMDULILLAH // AL-HAMDULILLAH
// A... | C++ | 116dd636a4f2547aef01a68f98c46ca2 | acf10661a5362261b8da0a5e250003ff | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;cin >> t;
while ( t-- ) {
int n;
cin >> n;
vector < int > vec(n);
for ( int i = 0;i<n ;i++ ) {
cin >> vec[i];
}
if( vec[0] == 1 ) {
c... | C++ | 76b3667cce9e23675e21caf6926f608d | db0b19f8937b57fa0b8836e7b07f7621 | 800 | PASSED |
#include "bits/stdc++.h"
// #include <sys/resource.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define Pi acos(-1.0)
#define ull unsigned... | C++ | 76b3667cce9e23675e21caf6926f608d | 69a9d58124c590125d23eba13034b457 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int k;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
if(a[0]==1)
{
cout<<"Yes"<<endl;
... | C++ | 76b3667cce9e23675e21caf6926f608d | 759c5abc577ea9968f77aadb785ba05f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | 76b3667cce9e23675e21caf6926f608d | e446ea384462973c111f13b6c486a199 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | 76b3667cce9e23675e21caf6926f608d | 559dd43b771cf937759d90eadbba60dc | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | 76b3667cce9e23675e21caf6926f608d | 3ad1532c5f18a3c436f327aad335ed76 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
... | C++ | 76b3667cce9e23675e21caf6926f608d | 6464571c71367c4c07c8d4cf0f21c0ba | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | 76b3667cce9e23675e21caf6926f608d | ea38808ac6a74424468a7134fe42c167 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | 76b3667cce9e23675e21caf6926f608d | 00b287a26d06fef6005f0d1e286c9c13 | 800 | PASSED |
#include<iostream>
#include<vector>
using namespace std;
void Solve(){
vector<int> input;
int i, j, k;
int n;
cin >> n;
for(int i =0; i < n; i++){
int tmp;
cin >> tmp;
input.push_back(tmp);
}
bool ans = true;
bool firstMin = true;
for(int ... | C++ | 76b3667cce9e23675e21caf6926f608d | 2877ec59ebde97ea404ed33201640bd8 | 800 | PASSED |
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int test,i,res,linebackup;
long long int sum, max_line,one,zero;
long long int word_lenth;
scanf("%d",&test);
while(test>0){
one=0,zero=0;
scanf("%lld",&word_lenth);
char word[word_lenth];
... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | f44ee7c6d897d533a1438d795d1f38fb | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t=1;
cin>>t;
while(t--){
ll n,c0=0,c1=0, conse1 = 0, conse0 = 0;
ll max1=0,max0=0;
cin>>n;
string s;
cin>>s;
for(ll i=0 ; i<n ; i++)
{
if(s[i]... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 1c2835505beae06193f969c40c486f8f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t=1;
cin>>t;
while(t--){
ll n,c0=0,c1=0, consecutive_1 = 0, consecutive_0 = 0;
ll max1=0,max0=0;
cin>>n;
string s;
cin>>s;
for(ll i=0 ; i<n ; i++)
{
... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 7a0a2549497b047a2973bb067206419a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t, n, i, j, ans, zero;
string a, b;
cin>>t;
for(;t--;)
{
cin>>n;
cin>>a;
a... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | d6cd1a1dd5724df0a93e52a1f8501dd3 | 800 | PASSED |
#include <iostream>
#include <cmath>
using namespace std;
typedef long long int ll;
int main(){
ll t;
cin>>t;
for (ll j=0; j<t; j++){
ll n;
string s;
ll x=0;
ll y=0;
ll xcons=0;
ll ycons=0;
ll maxX=0;
ll maxY=0;
cin>>n;
cin>>s;
... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | ba5d1f00f21aa677df2cb43d7224761c | 800 | PASSED |
//#include <bits/stdc++.h>
#include <algorithm>
#include <string>
#include <iostream>
#define ll long long
void solve()
{
ll n;
std::string s;
std::cin >> n >> s;
const ll zerosAmount = std::count_if(s.begin(), s.end(), [](const char sym) {
return sym == '0';
});
co... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 4bdede0412552b93ea2a1a8d1f990c82 | 800 | PASSED |
#include <iostream>
#include <numeric>
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
void solve(int t){
int N;
string v;
for (int i = 0; i < t; i++){
long long r1, r2, maxb = 0, x = 0, y = 0;
int cx = 0, cy = 0;
r1 = 0;
r2 = 0;
cin >> N;
cin >> v;
... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 946dab412f6724c12aebb64690a13e28 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
string s;
int main(){
int t,n;
cin >> t;
while(t--){
ll x=0,y=0,a=0,b=0,q=1;
cin >> n >> s;
if(s[0]=='1')
x++;
else
y++;
a=x;
b=y;
... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 5113cf1d4e215181c9da5d7533b12759 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int x=2e5+10;
long long int hsh1[x];
long long int hsh2[x];
int main(){
int t;
cin>>t;
while(t--){
long long int n;
cin>>n;
string s;
cin>>s;
long long int ct1=0,ct2=0,count=0,flag=0;
long long int m=0,a=0,b=0;
for(int i=0;i<n;i++){
if... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 9534c3b6642f7d246b7b319998f3e1da | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#include<algorithm>
#include <iostream>
using namespace std;
int main()
{long long int t;
cin>>t;
while(t--)
{ int n;
cin>>n;
string s;
cin>>s;
long long int c= n/2;
long long int x1=0;
long long int x2=0,x3=0;
long long int x0=0;
long long i... | C++ | 9070e0d4f8071d1ee8df5189b7c17bfa | 32f05cc6ae12dae7fbd580d18edaea1e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int tt, tc;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// find... | C++ | eaab346f1dd620c8634a7991fa581bff | f90ddb7bbdbe4d81d01f75b063592a17 | 2,400 | PASSED |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 5;
struct node {
ll l, r;
ll sum, cnt;
node *ls, *rs;
node(ll l, ll r) : l(l), r(r) {
sum = cnt = 0;
ls = rs = NULL;
}
};
void push_down(node *u) {
if (u->l == u-... | C++ | eaab346f1dd620c8634a7991fa581bff | d82fde7ed98aa5a04b3deb53b7808349 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int tt, tc;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// fin... | C++ | eaab346f1dd620c8634a7991fa581bff | b425b1d3837f3a1f43cad1120f6834b2 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int tt, tc;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// fin... | C++ | eaab346f1dd620c8634a7991fa581bff | ea72e5c42eec85985f08b811c763b1f4 | 2,400 | PASSED |
// سعاده الباشا منور مكانك ي عمهم تشرب شاي؟؟
#include<iostream>
#include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using L = __int128;
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long... | C++ | eaab346f1dd620c8634a7991fa581bff | a9c95fea95c3c9ab1ccca772e208516c | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// Template {{{
#define REP(n) for (int _ = 0; _ < (n); _++)
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int... | C++ | eaab346f1dd620c8634a7991fa581bff | d24fd969efe4d032de352c66aa499ab3 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// Template {{{
#define REP(n) for (int _ = 0; _ < (n); _++)
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int... | C++ | eaab346f1dd620c8634a7991fa581bff | f4e30181dd44a38dadb2ec3089f57240 | 2,400 | PASSED |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#define int long long
using namespace std;
void solve()
{
int n;cin>>n;
string s;cin>>s;
vector<int> a(n+1);
for(int i=0;i<n;i++)
a[i+1]=a[i]+(s[i]=='('?1:-1);
auto b=a;
sort(b.begin(),b.end());
int ... | C++ | eaab346f1dd620c8634a7991fa581bff | bb24a1c99c86f782e8536ac8ed24923f | 2,400 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e... | C++ | eaab346f1dd620c8634a7991fa581bff | 5006317c1e9996f0a6891c35507d39d7 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ls i<<1
#define rs i<<1|1
#define fi first
#define se second
#define min amin
#define max amax
#define pb push_back
using namespace std;
using ll=long long;
using pii=array<int,2>;
constexpr int N=2E5+10;
constexpr int inf=1E9;
constexpr int p=998244353;
int qpow(int x,int ... | C++ | eaab346f1dd620c8634a7991fa581bff | 3547c390eeb385d3ea73dfdb14c39877 | 2,400 | PASSED |
import java.util.*;
public class Problem1750F {
static long[] dp_sum2=new long[5001];/*dp_sum2[k] = sum from
dp_sum[1][k] to dp_sum[k][1], where dp_sum[i][j]=dp_sum[i][i]
when j>i*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long mod=sc.nextIn... | Java | 4840c4ddf8d9ca82c6e8fcf71802539a | d71758403f1e76479662ae68873923a3 | 2,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.