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>
//typedef long long ll;
typedef __int128_t ll;
#define endl '\n'
using namespace std;
mt19937 rnd(time(NULL));
const int N=1010;
const ll mod=1000000007;
const int L=20;
const ll inv2=(mod+1)/2;
ll a[N];
ll b[N];
ll G[N][N];
bool usedA[N],usedB[N];
void print(ll x){
vector<in... | C++ | f596e0bcefde8227e8a7b9d923da828a | a386758f2b53db6f69c28c5d68d3a77f | 3,200 | PASSED |
#include <bits/stdc++.h>
//typedef long long ll;
typedef __int128_t ll;
#define endl '\n'
using namespace std;
mt19937 rnd(time(NULL));
const int N=1010;
const ll mod=1000000007;
const int L=20;
const ll inv2=(mod+1)/2;
ll a[N];
ll b[N];
ll G[N][N];
bool usedA[N],usedB[N];
void print(ll x){
vector<in... | C++ | f596e0bcefde8227e8a7b9d923da828a | 9b185822193134750f0e44ba15632bc3 | 3,200 | PASSED |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()... | C++ | f596e0bcefde8227e8a7b9d923da828a | 29523c0643dcc69a36523139c17a9b89 | 3,200 | PASSED |
// 德丽莎你好可爱德丽莎你好可爱德丽莎你好可爱德丽莎你好可爱德丽莎你好可爱
// 德丽莎的可爱在于德丽莎很可爱，德丽莎为什么很可爱呢，这是因为德丽莎很可爱！
// orz 德丽莎
#include <bits/stdc++.h>
using namespace std;
namespace io {
const int SIZE = (1 << 21) + 1; char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = (iS = i... | C++ | f596e0bcefde8227e8a7b9d923da828a | 524e2d14274ef11f99812f121de92564 | 3,200 | PASSED |
// 德丽莎你好可爱德丽莎你好可爱德丽莎你好可爱德丽莎你好可爱德丽莎你好可爱
// 德丽莎的可爱在于德丽莎很可爱，德丽莎为什么很可爱呢，这是因为德丽莎很可爱！
// orz 德丽莎
#include <bits/stdc++.h>
using namespace std;
namespace io {
const int SIZE = (1 << 21) + 1; char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = ... | C++ | f596e0bcefde8227e8a7b9d923da828a | 36bd2bcc9427cd7b29d9f217d634a0f7 | 3,200 | PASSED |
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll __int128
using namespace std;
inline ll read()
{
char c=getchar();ll x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48... | C++ | f596e0bcefde8227e8a7b9d923da828a | 519752d233ca29fe8e736c6a9b9517dc | 3,200 | PASSED |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define fi first
#define se second
#define fill0(a) memset(a,0,sizeof(a))
#define fill1(a) memset(a,-1,sizeof(a... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | 9b0f5353c59985a3fa9f2dc27dbf3759 | 3,500 | PASSED |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define fi first
#define se second
#define fill0(a) memset(a,0,sizeof(a))
#define fill1(a) memset(a,-1,sizeof(a... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | 1128c56ebad2bf5cc2a9f397039f9a9a | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb emplace_back
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a <... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | 499e9758741aac594f9c82105c3b943a | 3,500 | PASSED |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#include<cassert>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | 80c19e596146d1445cc79e733d86753f | 3,500 | PASSED |
#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#include<cassert>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | 43d68e26cd0ede0850ec231d15d1e6d8 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 300005
int t,n,m,q,x,y,tmp,dfn[N],low[N],st[N],bl[N],K[N],nex[N],id[N];
vector<int>e[N],V[N],ans[N];vector<pair<int,int> >E[N];
pair<int,int>adj[N];queue<int>Q;set<int>S[N];
bool cmp(int x,int y){
return ((tmp<id[x])==(tmp<id[y]) ? id[x]<id[y] : tmp<id[x]);... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | f9e30907826f3a7258561deded884585 | 3,500 | PASSED |
#include<bits/stdc++.h>
#define f(i,x,y) for(int i=x;i<=y;i++)
#define df(i,x,y) for(int i=x;i>=y;i--)
#define pb push_back
using namespace std;
const int N=6e5;
int cs,n,m,x,y,df[N],lw[N],zl,d[N],dg[N],st[N],tp,fg,a[N],al,id[N],v[N],p[N],di[N],t,tot,ct;
vector<int>b[N],b1[N],b2[N];
vector<vector<int>>zb[N];
m... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | 431fe08dbd1d45d86fdb51c428fbbaaa | 3,500 | PASSED |
#include <stdio.h>
#include <vector>
#include <set>
#include <algorithm>
#define MN 300010
#define MM 300010
using namespace std;
int fr[MN],ne[MM*2],uu[MM*2],v[MM*2],bs;
void addb(int a,int b)
{
uu[bs]=a;v[bs]=b;
ne[bs]=fr[a];
fr[a]=bs++;
}
int dfn[MN],low[MN],st[MN],sb[MN],tm,tp,tb,ss;
vector<int> bb[MN],... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | dbec2dde330f1249b0c2c90f9afcc015 | 3,500 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define N 600012
int T;
int n,m,h[N],cnt=0;
struct Edge{int to,next;}e[N<<1];
inline void AddEdge(int x,int y){e[++cnt]=(Edge){y,h[x]};h[x]=cnt;}
int dfst=0,dfn[N],low[N],st[N],tp=0;
... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | edf6d49df74cf4b1b043a681c34875c0 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
struct graph {
int n;
int m;
vvi al;
vi morphism;
vvi dfs_children;
vi dfs_parent;
vi dfs_num;
vi dfs_low;
int dfs_... | C++ | 0c239111c4ea73eb02cc165bb53971a0 | d78462f305ca1c3dc07b4e0c15288ea2 | 3,500 | PASSED |
#pragma region Macros
#pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
#ifdef ONLINE_JUDGE
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("popcnt")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pra... | C++ | 15b005c10e363719db38ad7a97f2ecff | 23773ac3855548ebecadb802452be9ab | 3,200 | PASSED |
#pragma region Macros
#pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
#ifdef ONLINE_JUDGE
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("popcnt")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pra... | C++ | 15b005c10e363719db38ad7a97f2ecff | 7709ba02d5e2870ed9e89bee0f1b1f86 | 3,200 | PASSED |
#pragma region Macros
#pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
#ifdef ONLINE_JUDGE
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("popcnt")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// #pra... | C++ | 15b005c10e363719db38ad7a97f2ecff | 7cd9f592b06ec72a90143f88468c2717 | 3,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)... | C++ | 15b005c10e363719db38ad7a97f2ecff | a839e3e6bdae061ea43bdfc73d834c6c | 3,200 | PASSED |
/*
也许所有的执念 就像四季的更迭
没有因缘 不需致歉
是否拥抱着告别 就更能读懂人间
还是感慨 更多一点
*/
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define fi first
#define se second
#define int long long
#define mem(x, v, n) memset(x, v, sizeof(int) * (n))
#define mcpy(x, y, n) memcpy(x, ... | C++ | 15b005c10e363719db38ad7a97f2ecff | 284f93f91f254780056849532200cd5b | 3,200 | PASSED |
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define fi first
#define se second
#define int long long
#define mem(x, v, n) memset(x, v, sizeof(int) * (n))
#define mcpy(x, y, n) memcpy(x, y, sizeof(int) * (n))
#define lob lower_bound
#define upb uppe... | C++ | 15b005c10e363719db38ad7a97f2ecff | c6d0cde0c042690bb7ce71b4b9a7ed75 | 3,200 | PASSED |
/*
也许所有的执念 就像四季的更迭
没有因缘 不需致歉
是否拥抱着告别 就更能读懂人间
还是感慨 更多一点
*/
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define fi first
#define se second
#define int long long
#define mem(x, v, n) memset(x, v, sizeof(int) * (n))
#define mcpy(x, y, n) memcpy(x, ... | C++ | 15b005c10e363719db38ad7a97f2ecff | 0e14dcbe548d00b2c5fb50464de8d1d1 | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int T, n;
int a[200010];
int ans[200010], fa[200010];
vector < int > pos[200010];
int gf(int a) { return fa[a] == a ? a : fa[a] = gf(fa[a]); }
void merge(int a, int b) {
fa[gf(a)] = gf(b);
}
void rmain() {
scanf("%d", &n);
for (int i = ... | C++ | 15b005c10e363719db38ad7a97f2ecff | cd7aa8e934a43cc08f0040c1fcf6e9f2 | 3,200 | PASSED |
/*
也许所有的执念 就像四季的更迭
没有因缘 不需致歉
是否拥抱着告别 就更能读懂人间
还是感慨 更多一点
*/
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define fi first
#define se second
#define int long long
#define mem(x, v, n) memset(x, v, sizeof(int) * (n))
#define mcpy(x, y, n) memcpy(x, ... | C++ | 15b005c10e363719db38ad7a97f2ecff | ab7f580967f38688add40af06d65b7cd | 3,200 | PASSED |
/*
也许所有的执念 就像四季的更迭
没有因缘 不需致歉
是否拥抱着告别 就更能读懂人间
还是感慨 更多一点
*/
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define fi first
#define se second
// #define int long long
#define mem(x, v, n) memset(x, v, sizeof(int) * (n))
#define mcpy(x, y, n) memcpy(... | C++ | 15b005c10e363719db38ad7a97f2ecff | 017454fd36fae83eab6c92842ac96204 | 3,200 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2,lzcnt,bmi2,popcnt,abm")
// #include <iostream>
// constexpr int MEM = 4e8;
// char dataaaa[MEM];
// void* operator new(size_t sz) {
// static int ptr = 0;
// void* res = dataaaa + ptr;
// ptr += sz;
// ... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 823cfa8ea62dcee21f093cacdda49253 | 3,200 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2,lzcnt,bmi2,popcnt,abm")
#include <iostream>
constexpr int MEM = 4e8;
char dataaaa[MEM];
void* operator new(size_t sz) {
static int ptr = 0;
void* res = dataaaa + ptr;
ptr += sz;
if (ptr >= MEM) {
... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 18ed824620b2a522ee431f11dcb36c16 | 3,200 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2,lzcnt,bmi2,popcnt,abm")
#include <iostream>
constexpr int MEM = 4e8;
char dataaaa[MEM];
void* operator new(size_t sz) {
static int ptr = 0;
void* res = dataaaa + ptr;
ptr += sz;
if (ptr >= MEM) {
... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 36015b37bfc687589a17b59cc01189d9 | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#ifdef NONTOI
#define debug(args...) LKJ("\033[1;32m[ " #args " ]\033[0m", ... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 96e7e730b3a6773cfc392c614726c7d8 | 3,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<cmath>
#include<algorithm>
#include<cassert>
#define N 400000
using namespace std;
int read()
{
char c=0;
int sum=0;
while (c<'0'||c>'9') c=getchar();
while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
retur... | C++ | af7432b87c17ff91428153cd0c3fcf2d | b100971d9870dff61fbc59bd307b8d24 | 3,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<cmath>
#include<algorithm>
#include<cassert>
#define N 400000
using namespace std;
int read()
{
char c=0;
int sum=0;
while (c<'0'||c>'9') c=getchar();
while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
return sum;
}
stru... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 0ab3b0697055c2676c405b2c7c536d8c | 3,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<vector>
#include<set>
#include<cmath>
#include<algorithm>
#include<cassert>
#define N 400000
using namespace std;
int read()
{
char c=0;
int sum=0;
while (c<'0'||c>'9') c=getchar();
while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
return sum;
}
stru... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 10058c23b9ff37961860f70c5dcd9ce2 | 3,200 | PASSED |
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define lb long double
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b... | C++ | af7432b87c17ff91428153cd0c3fcf2d | e44802b899d921e02ec2ecafbfc01132 | 3,200 | PASSED |
// LUOGU_RID: 91387806
//No More Time, No More Chance.
#pragma GCC optimize("Ofast")
#include <cstdio>
#include <vector>
#include <algorithm>
namespace AzumiAkane{
const int maxn = 4e5+5;
int CASE,n,m,tm;
struct Edge{int x,y,z;}e[10000000],te[maxn];
struct DSU{
int fa[maxn];
void clr(){for(int i=1;i<... | C++ | af7432b87c17ff91428153cd0c3fcf2d | 0282beaa17f327ffc522d0af3bf78354 | 3,200 | PASSED |
#include<cstdio>
#include<vector>
#include<unordered_map>
struct edge
{
int x,y,w;
edge(int x=0,int y=0,int w=0){this->x=x,this->y=y,this->w=w;}
};
int ecmp(edge x,edge y){return x.w<y.w;}
struct dsu
{
int fa[400005];
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
int isrt(int x){return x==fa[x... | C++ | af7432b87c17ff91428153cd0c3fcf2d | c94b307a03bb7277ea2e43dec011355a | 3,200 | PASSED |
// wygzgyw
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
template <typename T> void write(T t) {
if (t... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 7c788662d944e9e19976ab848b1cff51 | 3,500 | PASSED |
/* https://acm.timus.ru/problem.aspx?space=1&num=1557 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 500000
#define M 500000
#define LN 19 /* LN = ceil(log2(N + 1)) */
#define N_ (1 + M * (LN + 1) * 2)
int *eh[N], eo[N], *ej[N], eo_[N], n;
int uu[M], vv[M], m;
void append(int **ej, int *eo, ... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 60c9128849d0ab79ccef8e7c1f44a639 | 3,500 | PASSED |
#include<bits/stdc++.h>
#define For(i,a,b) for( int i=(a);i<=(b);++i)
#define Rep(i,a,b) for( int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;return x;
}
#define ... | C++ | 423f3b1fc1a87f16f1175a007752a359 | b1cebfcb475b4ef7ade8cdc1fd17dadb | 3,500 | PASSED |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 1d9999f134fe2b78580cfe32cd23a9ec | 3,500 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<vector>
#include<random>
#include<ctime>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define int long long
using namespace std;
using namespace __gnu_pbds;
inline int read(){
int x=0; char c=... | C++ | 423f3b1fc1a87f16f1175a007752a359 | d3bef3a23d7edd1bdd5f1a812a78daed | 3,500 | PASSED |
/* https://acm.timus.ru/problem.aspx?space=1&num=1557 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 500000
#define M 500000
#define LN 19 /* LN = ceil(log2(N + 1)) */
#define N_ (1 + M * (LN + 1) * 2)
int *eh[N], eo[N], *ej[N], eo_[N], n;
int uu[M], vv[M], m;
void append(int **... | C++ | 423f3b1fc1a87f16f1175a007752a359 | e4078422c4704532d308b7397f61c425 | 3,500 | PASSED |
/* https://acm.timus.ru/problem.aspx?space=1&num=1557 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 500000
#define M 500000
#define LN 19 /* LN = ceil(log2(N + 1)) */
#define N_ (1 + M * (LN + 1) * 2)
int *eh[N], eo[N], *ej[N], eo_[N], n;
int uu[M], vv[M], m;
void append(int **... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 202cb0b741958029a5dc608a9ef256d2 | 3,500 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 500000
#define M 500000
#define LN 19 /* LN = ceil(log2(N + 1)) */
#define N_ (1 + M * (LN + 1) * 2)
int *eh[N], eo[N], *ej[N], eo_[N], n;
int uu[M], vv[M], m;
void append(int **ej, int *eo, int i, int j) {
int o = eo[i]++;
if (o >= 2 ... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 9c2a38c13015804fbf24e0d890d8e511 | 3,500 | PASSED |
/* https://acm.timus.ru/problem.aspx?space=1&num=1557 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 500000
#define M 500000
#define LN 19 /* LN = ceil(log2(N + 1)) */
#define N_ (1 + M * (LN + 1) * 2)
int *eh[N], eo[N], *ej[N], eo_[N], n;
int uu[M], vv[M], m;
void append(int... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 4647cb1e5738a3271e6beb9e871c78a3 | 3,500 | PASSED |
/* https://acm.timus.ru/problem.aspx?space=1&num=1557 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 500000
#define M 500000
#define LN 19 /* LN = ceil(log2(N + 1)) */
#define N_ (1 + M * (LN + 1) * 2)
int *eh[N], eo[N], *ej[N], eo_[N], n;
int uu[M], vv[M], m;
void append(int **ej, in... | C++ | 423f3b1fc1a87f16f1175a007752a359 | 5f8fa5597d37044ad0809baa782e3043 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t,n,s,c,prec;
cin>>t;
while(t--)
{ vector<int> v;
cin>>n;
long long val,d=1,m=0,c=-1,maxi=0,c1=-1;
for(int i=0;i<n;i++)
{ cin>>val;
maxi=max(maxi,val);
v.push_back(val);
}
for(int i=1;i<n;... | C++ | d6721fb3dd02535fc08fc69a4811d60c | 8f3bfb9d7d13418d64fab75752190a9b | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define long long ll;
const int N = 1e5 + 5;
int t, n, a[N];
bool valid(int m, int c, int mx) {
//cout << "--\n" << m << " " << c << "\n--";
if(m < mx || c >= m) return false;
bool ... | C++ | d6721fb3dd02535fc08fc69a4811d60c | d818b6257ae5df519dd68b8e88b8b70b | 1,500 | PASSED |
/*
||| ╔═══════════╗ ╔════╗ ╔═══════════╗ ╔═══════════╗ ╔══════════╗ |||
||| ║███████████║ ║████║ ║███████████║ ║███████████║ ║██████████║ |||
||| ║██╔════════╝ ║██║║██║ ║██╔════════╝ ║██╔════════╝ ║██══════╗██║ ... | C++ | d6721fb3dd02535fc08fc69a4811d60c | 0409c8009a6d4cf67c2ecadd77ace9c4 | 1,500 | PASSED |
/*
||| ╔═══════════╗ ╔════╗ ╔═══════════╗ ╔═══════════╗ ╔══════════╗ |||
||| ║███████████║ ║████║ ║███████████║ ║███████████║ ║██████████║ |||
||| ║██╔════════╝ ║██║║██║ ║██╔════════╝ ║██╔════════╝ ║██══════╗██║ ... | C++ | d6721fb3dd02535fc08fc69a4811d60c | 817b6fb576427f2d8517ef50ce197cdd | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define F first
#define S second
void solve(){
int n;
cin>>n;
ll a[n+1];
set<ll>s;
ll mx=-1;
for(int i=1; i<=n; i++)
{
cin>>a[i];
mx=max(mx,a[i]);
}
for(int i=2; i<... | C++ | d6721fb3dd02535fc08fc69a4811d60c | 81d28e1f06ad53d8f14f93a7aa4a3d23 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define F first
#define S second
void solve(){
int n;
cin>>n;
ll a[n+1];
set<ll>s;
ll mx=-1;
for(int i=1; i<=n; i++)
{
cin>>a[i];
mx=max(mx,a[i]);
}
for(int i=2; i<... | C++ | d6721fb3dd02535fc08fc69a4811d60c | be739627ce2bd3a9dbaaf7356d9d4351 | 1,500 | PASSED |
#include <bits/stdc++.h> // Include every standard library
#include <unordered_map>
using namespace std;
#ifdef _MSC_VER
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
typedef long long int ll;
//typedef int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
type... | C++ | d6721fb3dd02535fc08fc69a4811d60c | cd0356501b95f1557983753926337e5a | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << 0 << '\n';
... | C++ | d6721fb3dd02535fc08fc69a4811d60c | ee8992ae7603c73d5ae5a838f316cfc2 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> v1(n);
int ma = 0;
for (int i = 0; i < n; i++) {
cin >... | C++ | d6721fb3dd02535fc08fc69a4811d60c | d92ddfda3068f579d29229bbc242c784 | 1,500 | PASSED |
#include "bits/stdc++.h"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl '\n'
using namespace std;
//finally copied samadeol solution, sol credits samarth arora XD
void solve()
{
int n;
cin >> n;
vector<int> arr(n);
for(int i = 0; i < n; i++) c... | C++ | d6721fb3dd02535fc08fc69a4811d60c | b1f86fa6641ba0786ea189dd7ed9b080 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values... | C++ | 806dcdab8364f5169334e172a192598a | 965d2ede44982c5c81619e5b55a6921f | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | 9250cec80ace7b18b1f5ab67011c3bf1 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | 299bf223dba8540088ee5760d7052946 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | b7106d1c693452712378bd3cbbfeeef0 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | 612828d3d8e2950e8229d7121db63cad | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | 67428d826ecd1a90f7488342bf694935 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | 904fda40ee83490137be1acde5f5dcf4 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) ... | C++ | 806dcdab8364f5169334e172a192598a | 47eb0c0ccc8182ce15139d656aedbc02 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pb push_back
#define ss second
#define ff first
#define all(v) v.begin(), v.end()
#define deb(...) __logger(#__VA_ARGS__, __VA_ARGS__)
template <typename... Args>
void __logger(string vars, Args &&...values) {
cerr ... | C++ | 806dcdab8364f5169334e172a192598a | ab15a265e369c0cd240bd5ea2e8517e1 | 800 | PASSED |
/*
template
ref1:https://github.com/tatyam-prime/kyopro_library
ref2:https://tatyam.hatenablog.com/entry/2019/12/15/003634
*/
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
using ld = long double;
u... | C++ | 806dcdab8364f5169334e172a192598a | 738271c2adafa7b5e84a60b764b3cceb | 800 | PASSED |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <cstdio>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | 701e382ee53e300ea9c4fb5e8ccdb343 | 1,600 | PASSED |
/*
ID: Trump
TASK:
LANG: C++
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#define slc(n) scanf(" %s",n+1);
#define sll(n) scanf("%lld",&n);
#define sll... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | c4aeff41b465dcb0c8cc6085c6b611a9 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define mii map<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define mli map<ll,int>
#define mil map<int,ll>
/*
Author: Rye
Data: 2021-03-22
Email: Rye10000010000@hotmail.com
*/
... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | 762c1dbb8ea01eb054826a46bf0490d5 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define mii map<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define mli map<ll,int>
#define mil map<int,ll>
/*
Author: Rye
Data: 2021-03-22
Email: Rye10000010000@hotmail.com
*/
... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | c4c9840c123c41366486a27cbfa22623 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define d1(a) {cout<<#a<<"="<<(a)<<'\n';}
#define d2(a,b) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<'\n';}
#define d3(a,b,c) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<" "<<#c<<"="<<(c)<<'\n';}
#define d4(a,b,c,d) {cout<<#a<<"="<<(a)<<" "<<#b<<"="<<(b)<<" "<<#c<<"=... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | 74a8c8db755e801ca00c66528448da0b | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define db(a) cout<<#a<<"="<<(a)<<'\n';
#define DB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x<<' ';cout<<'\n';}
#define DBB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x.first<<' '<<x.second<<" ";cout<<'\n';}
#define bb begin()
#define ee end()
#define ss size()
#d... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | a3cbbaeaf19ca81d945b98aa61bb6fd2 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define db(a) cout<<#a<<"="<<(a)<<'\n';
#define DB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x<<' ';cout<<'\n';}
#define DBB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x.first<<' '<<x.second<<" ";cout<<'\n';}
#define bb begin()
#define ee end()
#define ss size()
#d... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | 29675efe6ae90e41e65c5eb58920f4fd | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define db(a) cout<<#a<<"="<<(a)<<'\n';
#define DB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x<<' ';cout<<'\n';}
#define DBB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x.first<<' '<<x.second<<" ";cout<<'\n';}
#define bb begin()
#define ee end()
#define ss size()
#d... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | e0ab4f788bc8c32e1842b4b811a29364 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define db(a) cout<<#a<<"="<<(a)<<'\n';
#define DB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x<<' ';cout<<'\n';}
#define DBB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x.first<<' '<<x.second<<" ";cout<<'\n';}
#define bb begin()
#define ee end()
#define ss size()
#d... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | b7daa254ef57a797818926850ea06a74 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define db(a) cout<<#a<<"="<<(a)<<'\n';
#define DB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x<<' ';cout<<'\n';}
#define DBB(a) {cout<<#a<<"里的元素为 ";for(auto x:a)cout<<x.first<<' '<<x.second<<" ";cout<<'\n';}
#define bb begin()
#define ee end()
#define ss size()
#d... | C++ | 1f6be4f0f7d3f9858b498aae1357c2c3 | b95c66d1c4571cb0df7a27002bbbd4bf | 1,600 | PASSED |
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from collections import deque
class segment_tree(object):
# self.flag True means get minimum, False means get maximum
def merge(self,num,curr):
if self.flag:
return min(curr,num)
else:
return... | Python | c21b78e3a3950446541a2a067f1e4d60 | 42f90f747de0f75c17ecaf7e1695753a | 2,100 | PASSED |
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from collections import deque
class segment_tree(object):
# self.flag True means get minimum, False means get maximum
def merge(self,num,curr):
if self.flag:
return min(curr,num)
else:
return... | Python | c21b78e3a3950446541a2a067f1e4d60 | 6071888bbb8ae98130500d2ae50ca8c9 | 2,100 | PASSED |
import sys
input = sys.stdin.readline
n = int(input())
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
dp = [0] * (n + 1)
val = [0] * (n + 1)
pre = [0] * (n + 1)
pre[0] = float("-inf")
stack = []
for i in range(1, n + 1):
tmp = dp[i - 1]
while stack and A[stac... | Python | c21b78e3a3950446541a2a067f1e4d60 | e0baf657f4e37e3d9725af3535c9a4b9 | 2,100 | PASSED |
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
#import threading
from collections import defaultdict
#threading.stack_siz... | Python | c21b78e3a3950446541a2a067f1e4d60 | e06943bf3084895e14726a02fb271b60 | 2,100 | PASSED |
import math
class SparseTable:
def __init__(self, arr, qFunc = min, qFuncIntervalFriendly = False):
N = len(arr)
K = N.bit_length()
stab = [[None] * N for _ in range(K)] #stab [k][i] = RMQ(i ... i+2**k-1)
for i, a in enumerate(arr):
stab[0][i] = a... | Python | c21b78e3a3950446541a2a067f1e4d60 | 48cdf4b8503351e23b77a06dbb52a07a | 2,100 | PASSED |
def calc_beauty_old(n, heights, beauty):
# max_beauty[k] = max beauty of photos of buildings 1 to k
# max_beauty[k] = max(max_beauty[0] + beauty of photo 1-k,
# max_beauty[1] + beauty of photo 2-k,
# ...,
# max_beauty[k-1] + beauty of photo k)
beau... | Python | c21b78e3a3950446541a2a067f1e4d60 | bf282017a71cd53d5498ad025a87ca80 | 2,100 | PASSED |
import io, os, sys
pypyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
cpyin = sys.stdin.readline
input = pypyin if 'PyPy' in sys.version else cpyin
def strput():
return input().decode() if 'PyPy' in sys.version else input()
# code starts here
inf = 10**9 + 7
class SegmentTree:
def ... | Python | c21b78e3a3950446541a2a067f1e4d60 | 2baf2ff4bde81a389c2f29d566082068 | 2,100 | PASSED |
class SegmentTree():
def __init__(self, n, oper, e):
self.n = n
self.oper = oper
self.e = e
self.log = (n - 1).bit_length()
self.size = 1 << self.log
self.data = [e] * (2 * self.size)
def update(self, k):
self.data[k] = self.oper(self.data[2 * k... | Python | c21b78e3a3950446541a2a067f1e4d60 | ff4c8f2ec0203b89183d3f53c35a3aba | 2,100 | PASSED |
class SegmentTree():
def __init__(self, n:int, func=lambda x,y:max(x,y), init=float('inf')):
self.n = 2**(n-1).bit_length()
self.init = init
self.data = [init]*(2*self.n)
self.func = func
def set(self, i:int, v:int):
self.data[i+self.n-1] = v
def set_lis... | Python | c21b78e3a3950446541a2a067f1e4d60 | b4f508cec35c7e809fc3c51dfe2ecb7c | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <i... | C++ | c21b78e3a3950446541a2a067f1e4d60 | 944c6c60fc7dca21a36dc035c1a7ddf5 | 2,100 | PASSED |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_mult... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 5fe33f161a4b4519edc81f97c1b5ea78 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define ac return 0
using namespace std;
typedef __int128 ll;
#define endl "\n"
const int mod=998244353;
const int N=2e5+10;
int nxt[N];
int a[N];
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
queue<int>q;
for(int i=1;i<=n... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 8e220b800e62088584425623ad6ae07c | 1,900 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define ac return 0
using namespace std;
typedef __int128 ll;
#define endl "\n"
const int mod=998244353;
const int N=2e5+10;
int pa[N];
int findpa(int x){return pa[x]==x?x:pa[x]=findpa(pa[x]);}
int nxt[N];
int a[N];
void solve()
{
int n;
cin>>n;
... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 7e79268ebed61724b3e509568d0c2365 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define xx first
#define yy second
#define pii pair <int, int >
#define pll pair < ll, ll >
#define xx first
#define yy s... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | f8af093e72df185e78a9b3571ca2c643 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define l1(i, n) for (ll i = 1; i <= n; i++)
#define l0(i, n) for (ll i = 0; i < n; i++)
#define pb push_back
#define xx first
#define yy second
#define sorted(x) sort... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 2076ecacc557e374097cba69c57892be | 1,900 | PASSED |
#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
using namespace std;
void solve(){
int n;
cin >> n;
vector<int>a(n + 1), prev(n + 1), next(n + 1), order(n + 1);
iota(prev.begin(), prev.end(), -1)... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 1e48e86e5ea590f7fb23926a351d7877 | 1,900 | PASSED |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<ctime>
#define iss ios::sync_with_stdio(false)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int>pii;... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 6e951a5f73aca78c436caa17a13b73fb | 1,900 | PASSED |
#include <iostream>
#include <vector>
#include<string>
using namespace std;
const int N = 1e5 + 5;
int a[N], ne[N];
bool st[N];
int gcd (int a, int b)
{
return b ? gcd (b, a % b) : a;
}
int main()
{
int t;
cin >> t;
while (t --)
{
int n;
cin >> n;
vector <int> del;
for (int i = 0; i < n; i ++)
... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | bd39c2f902fd1ce9f5b1b22a54908791 | 1,900 | PASSED |
#include <iostream>
#include <vector>
#include<string>
using namespace std;
const int N = 1e5 + 5;
int a[N], ne[N];
bool st[N];
int gcd (int a, int b)
{
return b ? gcd (b, a % b) : a;
}
int main()
{
int t;
cin >> t;
while (t --)
{
int n;
cin >> n;
vector <int> del;
for (int i = 0; i < n; i ++)
... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | 8ca48c3426eebdcbbef96399bee1cdaa | 1,900 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
... | C++ | 5d3d68a5b7a6e1357f4d4318805976ee | b555013fe250f13baff5090673525ba8 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 6e2 + 7;
const int mod = 998244353;
const ll inf = 0x3f3f3f3f3f3f3f3f;
int vis[N][N];
ll a[N][N];
ll b[N][N];
ll dis[N][N];
void solve() {
int n,m;
cin >> n >> m;
for (int i = 1; i <=... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 2a62ba99e0c23c71e24191ddf5e52d7c | 2,400 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define s second
#define f first
#define el "\n"
const int MM = 605, MOD = 1e9+7; // 998244353;
int gcd(int a, int b) {if(!b) return a; return gcd(b,a % b); }
int pwr(int b, int e) {int r=1;while(e){if(e&1)r=r*b%MOD;b=b*... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 47c67bc241dec0ef6acd96ac7314b473 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define ac return 0
using namespace std;
typedef __int128 ll;
#define endl "\n"
const int mod=998244353;
const int N=600+10;
int e[N][N];
int dis[N][N];
vector<pair<int,int>>g[N];
int mmax[N];
void solve()
{
memset(dis,0x3f3f3f,sizeof(dis));
int n,m;
... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 0992ddb9fcf120b4edc87acba17ef0c3 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//only for atcoder
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,l,r) for(ll i=(l); i<(r); i++)
#defin... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 4a543d0eb62711fcc8c25d43ab077100 | 2,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.