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>
#define int long long
using namespace std;
void testcase(){
int n,m,k;cin>>n>>m>>k;
vector<int>a(k);
for(int i=0;i<k;i++){
cin>>a[i];
}
int places=n*m-2;
vector<bool>was(k+1);
int nxt=k;
for(int card:a){
if(nxt==card){
... | C++ | aaebae32edfe31f45bbe95c185f5460f | 7c660ad2f3d14bd657653ede1d9daac0 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
void testcase(){
int n,m,k;cin>>n>>m>>k;
vector<int>a(k);
for(int i=0;i<k;i++){
cin>>a[i];
}
// int places=(n-1)*(m-1);
// int rest=(n-1)+(m-1)-1;
int places=n*m-2;
vector<bool>was(k+1);
... | C++ | aaebae32edfe31f45bbe95c185f5460f | e784cb155eb6b2b3039f372d77872262 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
void testcase(){
int n,m,k;cin>>n>>m>>k;
vector<int>a(k);
for(int i=0;i<k;i++){
cin>>a[i];
}
int places=(n-1)*(m-1);
int rest=(n-1)+(m-1)-1;
vector<bool>was(k+1);
int nxt=k;
for(int ca... | C++ | aaebae32edfe31f45bbe95c185f5460f | ea342faf8691696c300fa3ecbdb069b0 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
void testcase(){
int n,m,k;cin>>n>>m>>k;
vector<int>a(k);
for(int i=0;i<k;i++){
cin>>a[i];
}
int places=(n-1)*(m-1);
int rest=(n-1)+(m-1)-1;
bool blocked=false;
vector<bool>was(k+1);
i... | C++ | aaebae32edfe31f45bbe95c185f5460f | 7344bbd454cb27adb66617c4cc769918 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 100100;
int a[NN], f[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int T;
cin >> T;
while(T --){
int n, m, k, flag = 0;
cin >> n >> m >> k;
for(int i = 1; i <= k; ... | C++ | aaebae32edfe31f45bbe95c185f5460f | f013321a38a1c88daf544320514a6195 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 100100;
int a[NN], f[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int T;
cin >> T;
while(T --){
int n, m, k, flag = 0;
scanf("%d%d%d", &n, &m, &k);
for(int i = 1;... | C++ | aaebae32edfe31f45bbe95c185f5460f | 25b1a166bb3aa599d5d34305ff4415b1 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int NN = 1e6 + 100;
int a[NN];
int id[NN];
int B[NN];
int k;
int rev[NN];
void add(int u, int x) {
for(; u<=k; u += (u & (-u))) B[u] += x;
}
int calc(int u) {
int ans = 0;
for(; u; u -= (u & -u)) ans += B[u];
return ans;
}
int main(){
#ifndef ONLINE_JUDGE
fre... | C++ | aaebae32edfe31f45bbe95c185f5460f | 7d6ae074146b7bd77b08c50249c7123b | 1,500 | PASSED |
#include<bits/stdc++.h>
#define NN 100100
using namespace std;
using INT=long long;
int a[NN];
int b[NN];
void add(int u, int x) {
for(; u < NN; u += u & -u) b[u] += x;
}
int calc(int u, int ans = 0) {
for(; u; u -= u & -u) ans += b[u];
return ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin... | C++ | aaebae32edfe31f45bbe95c185f5460f | aac95e7c62fb585d863f1b9d88e6027c | 1,500 | PASSED |
#include <bits/stdc++.h>
#define DEBUG(X) { auto _X = (X); cout << "L" << __LINE__ << ": " << #X << " = " << (_X) << endl; }
#define PR(A, a, b) { cout << "L" << __LINE__ << ": " << #A << " = "; for(int i = (a); i <= (b); i ++) cout << A[i] << ' '; cout << endl; }
#define enter {cout << endl;}
using namespace std;
usin... | C++ | aaebae32edfe31f45bbe95c185f5460f | d4ba266cd372c2364efe91c9dc41329f | 1,500 | PASSED |
/*
Arunabho Bhattacharya
*/
#include<bits/stdc++.h>
#include<math.h>
#define MOD 1000000007
#define mod 998244353
#define ll long long
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t;
... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 8e6ece9bb169e73e522a54505abbd482 | 800 | PASSED |
/*
Arunabho Bhattacharya
*/
#include<bits/stdc++.h>
#include<math.h>
#define MOD 1000000007
#define mod 998244353
#define ll long long
using namespace std;
int main()
{
ll t;
cin>>t;
while(t--){
int n;
cin>>n;
ll sum1=0;
ll sum2=0;
for(int... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 0b773ea46334b116364921369b7ed3d3 | 800 | PASSED |
/*
Arunabho Bhattacharya
*/
#include<bits/stdc++.h>
#include<math.h>
#define MOD 1000000007
#define mod 998244353
#define ll long long
using namespace std;
int main()
{
ll t;
cin>>t;
while(t--){
int n;
cin>>n;
ll sum1=0;
ll sum2=0;
fo... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 70ef932b738ffd3de79a68ce20433332 | 800 | PASSED |
/*
Arunabho Bhattacharya
*/
#include<bits/stdc++.h>
#define MOD 1000000007
#define mod 998244353
#define ll long long
using namespace std;
void heapify(ll sub[], ll n, ll i)
{
ll largest = i;
ll l = 2 * i + 1;
ll r = 2 * i + 2;
if (l < n && sub[l] > sub[largest])
... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | cfcfa284d09008d1364a8c96bd78db3f | 800 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve() {
long long n,h=0,sum=0;
cin>>n;
for(int i=1;i<=n;i++) {
int x,y;
cin>>x>>y;
sum+=min(x,y);
h=max(h,max(x,y));
}
cout<<(sum+h)*2<<endl;
}
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0)... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 9f9e041755459abd5c297cd7be851a02 | 800 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<math.h>
#define FOR(a,b) for(int i=a;i<=b;i++)
#define ROF(a,b) for(int i=a;i>=b;i--)
#define FORj(a,b) for(int j=a;j<=b;j++)
#define ROFj(a,b) for(int j=a;j>=b;... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 2a7ac096c3b7309941adebd78da2ade0 | 800 | PASSED |
#define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<math.h>
#define FOR(a,b) for(int i=a;i<=b;i++)
#define ROF(a,b) for(int i=a;i>=b;i--)
#define FORj(a,b) for(int j=a;j<=b;j++)
... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 3960baa5b638cf55e16bfbc066d58665 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long a[200000][2],b[200000];
void solve() {
int n;
cin>>n;
long long sum=0, max=0;
for(int i=0; i<n; i++){
cin>>a[i][0]>>a[i][1];
sort(a[i], a[i]+2);
if(a[i][1]>max){
max=a[i][1];
}
sum+=a[i][0];
}
cout<<2*(sum+max)<... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | 7c5dd4813f3886bc9958bc7acabc423e | 800 | PASSED |
// sort
// sum the difference of every consecutive elemnt
// return sumof b *2 + above result
#include<bits/stdc++.h>
using namespace std;
long long solve(){
long long n,ans=0,length=0,breadth=0,temp=0;
cin>>n;
vector<long long>a(n,0);
vector<long long>b(n,0);
for(long long i=0;i<n;i++){
... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | fee9eedb82aab5f8f2649fe1b53c0b90 | 800 | PASSED |
#include <stdio.h>
#include <iostream>
using namespace std;
const int N=1e6+10;
long long x[N],y[N];
int main(){
long long n,a,d=0,h=0;
scanf("%lld",&n);
for(int i=0;i<n;i++){
scanf("%lld",&a);
for(int j=0;j<a;j++){
scanf("%lld%lld",&x[j],&y[j]);
if(x[j]>y[j]){
swap(x[j],y[j]);
}
... | C++ | 7100fa11adfa0c1f5d33f9e3a1c3f352 | d78f1cf37c70f3b2a47226cb0908b518 | 800 | PASSED |
#include<bits/stdc++.h>
#define NN 100100
using namespace std;
int L[NN], dp[NN], p[NN];
vector <int> vec[NN];
void dfs(int u){
int s = 0;
for(int v:vec[u]){
dfs(v);
dp[u] = max(dp[u], dp[v]);
s += L[v];
}
L[u] = max(s, dp[u] + 1), dp[u] ++;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | 98ce3b9b0a4786a22961d87b2d3112f0 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define DEBUG(X) { auto _X = (X); cout << "L" << __LINE__ << ": " << #X << " = " << (_X) << endl; }
#define PR(A, a, b) { cout << "L" << __LINE__ << ": " << #A << " = "; for(int i = (a); i <= (b); i ++) cout << A[i] << ' '; cout << endl; }
#define enter {cout << endl;}
using namespace std;
usin... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | 2371920386d03cb07fcf5750a99ba3be | 1,800 | PASSED |
#include<bits/stdc++.h>
#define NN 200100
#define INT long long
#define pb push_back
using namespace std;
int a[NN],mx[NN],dp[NN];
vector <int > vec[NN];
void dfs(int u, int pa = 0){
int sum = 0;
for(int v : vec[u]){
if(v == pa) continue;
else dfs(v,u);
sum += dp[v];
mx[u] = max(mx[u],mx[v]);
}
mx[u] ++;
d... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | b2dde09358e7f8cc5557ab577de4b7e1 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 2e5 + 10;
int A[NN],B[NN];
char str[NN];
int deep[NN];
vector<int > vec[NN];
int mx[NN];
void dfs(int u,int fa = 0){
int sum = 0;
deep[u] = 1;
for(int v : vec[u]){
if(v == fa) continue;
dfs(v,u);
sum += mx[v];
deep[u] = max(dee... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | 4dae69d2961ac253b1a7afe40f0dfed4 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int NN = 2e5 + 100;
int a[NN];
vector<int> vec[NN];
int dp[NN];
int mx[NN];
void dfs(int u, int fa = 0) {
int sum = 0;
dp[u] = 1;
mx[u] = 1;
for(int v : vec[u]) {
if(v == fa) continue;
dfs(v, u);
dp[u] = max(dp[u], dp[v] + 1);
sum += mx[v];
}
mx[u] = ... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | f01fd550bd26fed2cfd2d0ba168843b7 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN = 1e5 + 10;
int p[NN], ans[NN], deep[NN];
vector <int> adj[NN];
void dfs(int u){
int sum = 0;
for(int v : adj[u]){
dfs(v);
deep[u] = max(deep[u], deep[v]);
sum += ans[v];
}
deep[u]++;
ans[u] = max(sum, deep[u]);
}
int main() {
#ifndef ONLINE_JUDGE
... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | 8af6346ae8fca24100b8016d32aa7ed0 | 1,800 | PASSED |
#include<bits/stdc++.h>
#define NN 100100
using namespace std;
using INT=long long;
vector <int> adj[NN];
int dp[NN], mx[NN];
void dfs(int u) {
int tot = 0;
for(int v : adj[u]) {
dfs(v);
tot += dp[v];
mx[u] = max(mx[u], mx[v]);
}
mx[u] ++;
dp[u] = max(tot, mx[u]);
}
int main() {
#ifndef ONLINE_JUDGE
fre... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | 662fa8a599c0d6cbed8340ef4c20662d | 1,800 | PASSED |
// LUOGU_RID: 94437816
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int p[N],maxx;
struct node{
int v,nex;
}e[N];
int head[N],cnt;
void add(int u,int v){
e[++cnt].v=v;
e[cnt].nex=head[u];
head[u]=cnt;
}
int dp[N][2];
void dfs(int u){
dp[u][1]=1;
dp[u][0]=0;
for(int i=head[u];... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | 37b58b51db01545d10781e9017bce9bc | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int p[N],maxx;
struct node{
int v,nex;
}e[N];
int head[N],cnt;
void add(int u,int v){
e[++cnt].v=v;
e[cnt].nex=head[u];
head[u]=cnt;
}
int dp[N][2];
void dfs(int u){
dp[u][1]=1;
dp[u][0]=0;
for(int i=head[u];i;i=e[i].nex){
int v... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | bf73013cc1b972fc9402c126711193a3 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
vector<int> e[1000010];
int l1[1000010];
int l2[1000010];
int p[1000010];
void dfs(int u,int fa){
l1[u]=1;
for(int j:e[u]){
if(j==fa) continue;
dfs(j,u);
if(l1[j]+1>=l1[u]){
... | C++ | 5be268e0607f2d654d7f5ae4f11e2f08 | b3b424b1a2111a1810d3725e32807648 | 1,800 | PASSED |
//"… All I did was try my best, This the kind of thanks I get?"
#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), c(n + 1);
for (int i = 0; i < n; ++i) {
int x;
... | C++ | 2d062f89ec808fdcec25032da45d3725 | b2d9aa610ef2633b2f9b3cfd89c2d4db | 2,600 | PASSED |
//"… All I did was try my best, This the kind of thanks I get?"
#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), c(n + 1);
for (int i = 0; i < n; ++i) {
int x;
... | C++ | 2d062f89ec808fdcec25032da45d3725 | 0cea88d82ca7c6dabb31623a165a9ae7 | 2,600 | PASSED |
//"… All I did was try my best, This the kind of thanks I get?"
#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n), c(n + 1);
for (int i = 0; i < n; ++i) {
int x;
... | C++ | 2d062f89ec808fdcec25032da45d3725 | 4f39fc46f029fa0869a84e9cffd7c713 | 2,600 | PASSED |
#include <iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
using namespace std;
//#include <bits/stdc++.h>
int f[2005][2005];
int main() {
int n;
std::cin >> n;
std::vector<int> cnt(n + 1);
for (int i = 0... | C++ | 2d062f89ec808fdcec25032da45d3725 | ca74c876ec023aaaa4708fa794e8a426 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 2005;
vector<ll> dp[MAXN][2];
int max_add[MAXN][MAXN];
int main()
{
int n; cin >> n;
vector<int> cnt(n, 0);
for(int i = 0; i < n; i++)
{
int x;
cin>... | C++ | 2d062f89ec808fdcec25032da45d3725 | 442b0d703eb7791203ecdf9c3ad673bd | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 2005;
vector<ll> dp[MAXN][2];
int max_add[MAXN][MAXN];
int main()
{
int n; cin >> n;
vector<int> cnt(n, 0);
for(int i = 0; i < n; i++)
{
int x;
cin>... | C++ | 2d062f89ec808fdcec25032da45d3725 | ddc3be6bd48d01dcca84184611757d59 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 2005;
vector<ll> dp[MAXN][2];
int max_add[MAXN][MAXN];
int main()
{
int n; cin >> n;
vector<int> cnt(n, 0);
for(int i = 0; i < n; i++)
{
int x;
cin>... | C++ | 2d062f89ec808fdcec25032da45d3725 | 7eae4c534b34284c29929d843b5f7ed9 | 2,600 | 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;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 2005;
vector<ll> dp[MAXN][2];
int max_add[MAXN][MAXN];
int main()
{
int... | C++ | 2d062f89ec808fdcec25032da45d3725 | 7095ac7959935d1f372100c71cfe9cd1 | 2,600 | 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;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 2005;
vector<ll> dp[MAXN][2];
int max_add[MAXN][MAXN];
int solve(int n, vector<int>... | C++ | 2d062f89ec808fdcec25032da45d3725 | 0313dca5e8c2caf775375782be7e8285 | 2,600 | 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;
#define ll long long
const ll MOD = 998244353;
const int MAXN = 2005;
vector<ll> dp[MAXN][2];
int max_add[MAXN][MAXN];
int solve(int n, vector<int>... | C++ | 2d062f89ec808fdcec25032da45d3725 | 9da1f287c3b6a4ea427f573ab73f557a | 2,600 | PASSED |
// LUOGU_RID: 93407899
#include <cstdio>
using namespace std;
int read(){
char c=getchar();int x=0;
while(c<48||c>57) c=getchar();
do x=(x<<1)+(x<<3)+(c^48),c=getchar();
while(c>=48&&c<=57);
return x;
}
const int N=3000013,Bmask=4194302;
struct data{
int val,a[2],s[2];
int operator()(const int x)const{return a[x... | C++ | d1d99ceea4f7741e4da0283b73827a40 | c716257ce96b0e39726a1ce6feb54f9c | 3,300 | PASSED |
#include <cstdio>
using namespace std;
int read(){
char c=getchar();int x=0;
while(c<48||c>57) c=getchar();
do x=(x<<1)+(x<<3)+(c^48),c=getchar();
while(c>=48&&c<=57);
return x;
}
const int N=3000013,Bmask=4194302;
struct data{
int val,a[2],s[2];
int operator()(const int x)const{return a[x==val];}
... | C++ | d1d99ceea4f7741e4da0283b73827a40 | 6430b247c0b16c11e950ad9931ec5345 | 3,300 | PASSED |
// LUOGU_RID: 93108413
#include<bits/stdc++.h>
using namespace std;
struct ios{
inline char gc(){
static const int IN_LEN=1<<18|1;
static char buf[IN_LEN],*s,*t;
return (s==t)&&(t=(s=buf)+fread(buf,1,IN_LEN,stdin)),s==t?-1:*s++;
}
template <typename _Tp> inline ios & operator... | C++ | d1d99ceea4f7741e4da0283b73827a40 | 8c48dcd724aa211174c4b712e032a8d0 | 3,300 | 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 pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
const int N = 300020, M = 20;
int n;
vector<int> e[N];
... | C++ | d1d99ceea4f7741e4da0283b73827a40 | df27fa988c87bddad9d90b87d8330fc1 | 3,300 | PASSED |
// LUOGU_RID: 92451723
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
inline ll read(){
ll x=0;
bool f=0;
char c=getchar();
while(!isdigit(c)){
if(c=='-') f=1;
c=getchar();
}
while(isdigit(c)){
x=x*10+c-'0';
c=getchar();
}
return f?-x:x;
}
const int maxn=3e5+5;
int n,... | C++ | d1d99ceea4f7741e4da0283b73827a40 | e378ca03a421d5cbf9fc9672a88e9077 | 3,300 | PASSED |
// what is matter? never mind.
#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 long long
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++ | d1d99ceea4f7741e4da0283b73827a40 | ec6ca4cd40d8f9f26ed5da0eb2ccf8d7 | 3,300 | PASSED |
#include <bits/stdc++.h>
int q,x[300010];
int head[400001],nxt[400001],b[400001],k;
void push(int s,int t){
nxt[++k]=head[s];
head[s]=k;
b[k]=t;
}
int cnt[300010][21],m[300010];
int fa[300010],top[300010],dep[300010],size[300010],son[300010],dfn[300010],down[300010],now;
struct info{
int o1,o2,cr,s1,s2... | C++ | d1d99ceea4f7741e4da0283b73827a40 | e794cb12bf21cb6455a954fed35251d0 | 3,300 | PASSED |
// LUOGU_RID: 95195787
#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 ll long long
#define ls (rt<<1)
#define rs (rt<<1|1)
using namespace std;
const int N=300005,M=20;
int n,q,num,dfn[N],tid[N],son[N],siz[N],top[N],c[N][M+5],F[N],f[N],b... | C++ | d1d99ceea4f7741e4da0283b73827a40 | 499e50f4908aec3dc2985cb31b37bb94 | 3,300 | 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 ll long long
#define ls (rt<<1)
#define rs (rt<<1|1)
using namespace std;
const int N=300005,M=20;
int n,q,num,dfn[N],tid[N],son[N],siz[N],top[N],c[N][M+5],F[N],f[N],bom[N];
vector<int> G[N... | C++ | d1d99ceea4f7741e4da0283b73827a40 | ae48303e4b771b7191471419bd0da57a | 3,300 | PASSED |
// LUOGU_RID: 94467641
#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
x=0;T f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-')f=-1;
for(;isdigit(c);c=getchar()) x=(x<<1)+(x<<3)+(c^48);
x*=f;
}
template <typename T,typename ...Args>void read(T &x,Args... | C++ | d1d99ceea4f7741e4da0283b73827a40 | fa719335dc4e09a73e3fb3b56a539e94 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | f863cdff8ae3a7f0b8f9949608628f70 | 3,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | 749c031df6c4141eab2ee237f04bf079 | 3,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | dcac4e779e4f640f68e2f7b73ca30f92 | 3,100 | PASSED |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <numeric>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
// UnionFind Tree (0-indexed), based on size of ... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | 50330090e9174b495bdea0dffbaceaf9 | 3,100 | PASSED |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <numeric>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
// UnionFind Tree (0-indexed), based on size of ... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | b97dcbdfb504bb6f49e0c38dd294c0de | 3,100 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#incl... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | ff2b4ef72bd50e5a8e76589967723576 | 3,100 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#incl... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | 578ce021e02e41764d01cba0a6caabe4 | 3,100 | PASSED |
// LUOGU_RID: 94189055
#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define R(n) (rnd()%(n))
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
using ll=long long;using db=double;using lb=long db;usin... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | db4e893202cfbfeb716b3a2b005685f9 | 3,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <memory>
#include <deque>
#include <functional>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <chrono>
#include <random>... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | ec5d0670c7a33560489db3f3285b07a5 | 3,100 | PASSED |
/*
_/ _/ _/_/_/ _/ _/ _/ _/_/_/_/_/
_/ _/ _/ _/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/ _/
_/_/ _/ _/ _/ _/_/_/_/
_/ _/ _/ _/ _/ _/
... | C++ | c9664f2516ddf8f13df478dc6eccf5d1 | cef78aaa1128e8ca8bebf6b426f35af3 | 3,100 | 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 <bits/st... | C++ | 407944c9d70957d4caffcc05b596799f | 5eb480256e1b8a59f3f5e5bfb206cf16 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef ... | C++ | 407944c9d70957d4caffcc05b596799f | 0f3b521b0e56a7c7ff9e34648b144dee | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef ... | C++ | 407944c9d70957d4caffcc05b596799f | b71bb0bbd706b9b7ee405498c2ccc3c7 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef ... | C++ | 407944c9d70957d4caffcc05b596799f | 39faf17f48854c07b5d9a5fa2f45057c | 3,500 | PASSED |
// LUOGU_RID: 92551205
#include <bits/stdc++.h>
using namespace std;
#define N 1000005
#define LIM 10000005
#define ll long long
#define gc() (P1==P2 && (P2=(P1=buf)+fread(buf,1,LIM,stdin),P1==P2)?EOF:*P1++)
const ll INF=1e18;char buf[LIM],*P1=buf,*P2=buf;
int n,n1,m,c,d,tp,gl,a[N],a1[N],b[N],q[N];
ll ans,w[N],... | C++ | 407944c9d70957d4caffcc05b596799f | 9ffcd8f536590fdddb9ebace9eb4b616 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 1000005
#define LIM 10000005
#define ll long long
#define gc() (P1==P2 && (P2=(P1=buf)+fread(buf,1,LIM,stdin),P1==P2)?EOF:*P1++)
const ll INF=1e18;char buf[LIM],*P1=buf,*P2=buf;
int n,n1,m,c,d,tp,gl,a[N],a1[N],b[N],q[N];
ll ans,w[N],dp[N],tmp[N*2];struct N... | C++ | 407944c9d70957d4caffcc05b596799f | e66231bf8c2703ec733d268b333d6ba3 | 3,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#define LOG(FMT...) fprintf(stderr, FMT)
#define eb emplace_back
using namespace std;
const int N = 1000113;
const int INF = 0x3f3f3f3f;
int n, m, K, D, md, ts, res;
int a[N], c[N];
vector<vector<in... | C++ | 407944c9d70957d4caffcc05b596799f | c8d35108955d97ee38b1f5acb2239f40 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long N=1e6+10,inf=1e18;
int n,l,m,c,d,g,a[N],ta[N],b[N],L[N],R[N],q[N],ql,qr;
long long dp[N],p[N*2],w[N],W[N],ans=inf;
int main(){
scanf("%d%d%d",&n,&m,&c);d=__gcd(n,c),l=n/d;
for(int i=0;i<n;i++) scanf("%d",&ta[i]);
a[0]=(ta[0]-ta[n-1]+m)%m;g=ta[n-1];... | C++ | 407944c9d70957d4caffcc05b596799f | 7c837a15a7d0a89cdb757a016826af49 | 3,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#define LOG(FMT...) fprintf(stderr, FMT)
#define eb emplace_back
using namespace std;
const int N = 1000113;
const int INF = 0x3f3f3f3f;
int n, m, K, D, md, ts, res;
int a[N], c[N];
vector<vector<in... | C++ | 407944c9d70957d4caffcc05b596799f | 0307b7fc5d6b8580d42aa5691de460db | 3,500 | 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++ | 407944c9d70957d4caffcc05b596799f | c518ba2fb2b330516bd5a03f729f810c | 3,500 | PASSED |
/*#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpe... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | 248483a2cac3a6020b73cf9a20cc19e5 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
fast
... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | ba0d3947187559152df634d0f2c40ee4 | 2,400 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<a... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | d27df32cdd8dcbb99c0aebf0ddf2ea96 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ld = long double;
template <typename T>
int sz(T &x) {
return (int)(x.size());
}
int power(int x, int y, int mod) {
if (y == 0) {
return 1;
}
int z = power(x, y >> 1, mod);
z = z * 1... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | 7a8ab400e71f478267fad0287763bc77 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | 174cbe22133210651fa40396f97e70a7 | 2,400 | PASSED |
// problem coz
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<utility>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<set>
#include<map>
#define endl "\n"
#define all(v) v.begin(),v.end()
#define st first
#define nd second
#define pb push_... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | fa93021a7b6f8435252ef8c421e9ddc5 | 2,400 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#define ll long long
#define N 500010
using namespace std;
ll read(){
char cc;
while(1){cc=getchar();if((cc>='0'&&cc<='9')||cc=='-')break;}
ll sum=0,flag=1;
cc=='-'?flag=-1:sum=(cc^48);
while... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | cd01107a20ae0d3e97953dd751e298e9 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long double, pii> muchie;
const ll NMAX = 33;
const ll VMAX = 1001;
const ll INF = (1LL << 60);
con... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | 901c34cc28470f80cf7921d8daefd094 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<long long, long long>
using namespace std;
vector<int> v1, v2;
int mat[32][32];
void calcBase(int x) {
for (int i = 0; i < x * 2; i += 2) {
vec... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | 698833b58388f764a3388f8c14a8743e | 2,400 | PASSED |
#pragma GCC target("avx")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define between(x, l, r) (x >= l && x <= r)
#define point(a, b, m) ((a - 1) * m + b)
#define IDX(x, m) (PII){(x - 1) / m + 1, (x - 1) % m + 1}
#define all(x) (x).begin(), (x).end()
... | C++ | 9ab7d1142ede6fe3b642ac73a307cdd5 | 800c2d9f13f51da85800fcb86bb0b287 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define makedp memset(dp,-1,sizeof(dp))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
// #define MAX(a,b,c) max((int )a,max((int )b,(int )c))
// #define MIN(a,b,c) min((int )a,min((int )b,(int )c))
// #define cord4(x,y) vect... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | c02f9373974edeb9c2226ab254e0bc9f | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define makedp memset(dp,-1,sizeof(dp))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
// #define MAX(a,b,c) max((int )a,max((int )b,(int )c))
// #define MIN(a,b,c) min((int )a,min((int )b,(int )c))
// #define cord4(x,y) vect... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | edb86c07013232d6a639ff2f368cd4e1 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define makedp memset(dp,-1,sizeof(dp))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
// #define MAX(a,b,c) max((int )a,max((int )b,(int )c))
// #define MIN(a,b,c) min((int )a,min((int )b,(int )c))
// #define cord4(x,y) vect... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | 2ca6aea22e770b74281f6b9b41e7e5fc | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define makedp memset(dp,-1,sizeof(dp))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
// #define MAX(a,b,c) max((int )a,max((int )b,(int )c))
// #define MIN(a,b,c) min((int )a,min((int )b,(int )c))
// #define cord4(x,y) vect... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | 089548f3b0070572deaedadd81f79b59 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,t,base = 1000000007,a[500],m,dp[500][40001];
void getPalind(){
for(long long i=1;i<=40000;i++){
string x =to_string(i);
long long len = x.size();
x=' '+x;
int check =0;
for(long long j=1;j<=len/2;j++){
if(x[j]!=x[len-j+1]){
check=1;
... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | 5f4a1806bf03702aecb7e9c2b7324dec | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,t,base = 1000000007,a[500],m,dp[500][40001];
void getPalind(){
for(long long i=1;i<=40000;i++){
string x =to_string(i);
long long len = x.size();
x=' '+x;
int check =0;
for(long long j=1;j<=len/2;j++){
if(x[j]!=x[len-j+1]){
check=1;
... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | 46bb9fc501152ecbc7d8229baa0fdfab | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,t,base = 1000000007,a[500],m,dp[500][40001];
void getPalind(){
for(long long i=1;i<=40000;i++){
string x =to_string(i);
long long len = x.size();
x=' '+x;
int check =0;
for(long long j=1;j<=len/2;j++){
if(x[j]!=x[len-j+1]){
check=1;
... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | ddc62370a23de43296f83d33440f6f97 | 1,500 | PASSED |
/*Jaydev Sharma all oj id-:jaydevjaipur00*/
#include<bits/stdc++.h>
using namespace std;
using namespace chrono;
//gcc optimization
#pragma GCC optimize("Ofast")
#pragma GCC optimize "trapv"
#define fast(); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//macros
#define endl "\n"
#def... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | f614c03525994088147dcf3cdd73e157 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define Endl endl
#define float double
#define ll long long
#define endl '\n'
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | b2559aa14244106450d2c2ab1b03b16e | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define yes cout << "YES\n"
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb(k) push_back(k)
#define st string
#define no cout << "NO\n"
#define rep(lx,ix,rx) for (ix=lx; ix<=rx; ix++)
ll n,m,i,j,countt,k,p,... | C++ | 529d4ab0bdbb29d8b7f3d3eed19eca63 | f4b078b6f839c8167428f62a2623cac9 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define nn cout << "\n";
#define N cout << "NO\n";
#define Y cout << "YES\n";
#define v(a) a.begin(),a.end()
void vp(vector<ll>ab)
{
for(... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | b2fccf63627dc27cb52fcda2ad748994 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve(){
string s;
cin >> s;
set<char> ss;
for(char c : s){
ss.insert(c);
}
int k = ss.size();
for(int i = k; i < s.size(); i++){
if(s[i] != s[i-k]){
cout << "NO" << '\n';
return;
}
}
set<char> ts;
for(int i = 0; i < k; i++){
... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 88295ebd00eea5ad338048276cf64578 | 1,100 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define nl co... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 3e8536ae0d7e2ad38be3131ba0999595 | 1,100 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define nl co... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 5ade98cb50ee20a7ab39d2e744286898 | 1,100 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define nl co... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 0cbc0fb0f14aef46f7b8eb62284f507a | 1,100 | PASSED |
/*______________________________________________Bismillahir Rahmanir Rahim____________________________________________
|
| TTTTTTTTTTTTTTTTTTTTTTTRRRRRRRRRRRRRRRRR 888888888 ... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 8c481e1411d1908eddf4a9e06be79383 | 1,100 | PASSED |
#include <cstdio>
#include <cstring>
#define abs(x) ((x) < 0 ? -(x) : (x))
#define max(x, y) ((x) < (y) ? (y) : (x))
#define min(x, y) ((x) < (y) ? (x) : (y))
#define doit(x, j) (lst[x] == 0 ? 0 : fl[lst[x] - 1][j - 'a'])
int main() {
int T;
scanf("%d", &T);
while (T--) {
static char ch[2000001];... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 4cb694c56b4434676578cf9ea6044b5e | 1,100 | PASSED |
#include<iostream>
#include<cstring>
using namespace std;
const int N=2e5+10;
int t;
string s;
int a[27];
bool b[27];
int main(){
cin>>t;
while(t--){
for(int i=0;i<=26;++i) a[i]=b[i]=0;
cin>>s;
int ok=0,n=0;
for(int i=0,x;i<s.size();++i){
x=s[i]-'a'+1;
... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 61d3e07b5f706864627a2e094866ea03 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
int main()
{
int i,k,t;
cin>>t;
while(t--)
{
string s;
cin>>s;
... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | fff4893d581c589e7dd08523cbd5558e | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
int main()
{
int i,k,t;
cin>>t;
while(t--)
{
string s;
cin>>s;
... | C++ | dd098a17343a02fa5dc0d2d6cea853c7 | 70ac6d68f11b66e78ab07f19df99aaff | 1,100 | PASSED |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <stack>
#include <cmath>
#include <tuple>
#include <climits>
#include <fstream>
#include <sstream>
// #include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | e574469dd69641ddcba4cfddf79159c7 | 1,900 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.