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;
typedef long long ll;
#define endl '\n';
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
const double PI = 2 * asin(1);
int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
void IO() {
ios_base::sync_with_stdio(false);
... | C++ | ff95cd4632b2ddf8bb54981634badcae | ced1ffcf55d555c30ba2310c936f6497 | 1,200 | PASSED |
#include <iostream>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <queue>
#define ll long long
using namespace std;
const int N=3e5+10;
char a[N],b[N];
int mp[N];
int main()
{
int i,j,k,n,m,t;
cin>>t;
while(t--)
{
memset(mp,0,sizeof(mp));
int s1=0,s2=0,f=0;
cin>>n;
cin>>a>>b;
if(strc... | C++ | ff95cd4632b2ddf8bb54981634badcae | 68f76c098b02bedcd5fd94fb53537aba | 1,200 | PASSED |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
const int M=3e5+10;
int n,t;
string a,b;
void solve(){
cin>>n>>a>>b;
int cnt=0;
for(int i=0;i<n;i++){
cnt+=(a[i]=='1')-(a[i]=='0');
if((a[i]==b[i])!=(a[i+1]==b[i+1])&&cnt!=0){
... | C++ | ff95cd4632b2ddf8bb54981634badcae | f9ec9cef72c39f6b137c7de0f47e67ef | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
char a[N],b[N];
int dp[N];
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
scanf("%s%s",a,b);
int a1=0,b1=0;
for(int i=0;i<n;i++){
dp[i]=0;
if(a[i]=='0')a1++;
... | C++ | ff95cd4632b2ddf8bb54981634badcae | f981d249cca71eb706b6e137770e704b | 1,200 | PASSED |
#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
const int M=1e6+9;
int q1[M],q0[M];
char a[M],b[M];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
int flag=0;
memset(q1,0,sizeof(a));
memset(q0,0,sizeof(b));
scanf("%d",&n);
getchar();
for(int i=0;i<n;i++)
{
sc... | C++ | ff95cd4632b2ddf8bb54981634badcae | 5fb8f629b73baa82b1e039c58d09e0d2 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define PRE(v) partial_sum(v.begin(),v.end(),v.begin())
#define SUM(v) accumulate(v.begin(),v.end(),0)
#define MAX(v) *max_element(v.begin(),v.end())
#define MIN(v) *min_element(v.begin(),v.end())
#define D(i,a,n) for(long long i=a;i<n;i++)
#define F(i,n) for(long... | C++ | ff95cd4632b2ddf8bb54981634badcae | 15cb6d79c0023b10081de3e89dcb2cf3 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void solve()
{
int n,m,f=0;
string a,b;
cin>>n;
cin>>a>>b;
int zero=0,one=0;
for(int i=0;i<n;i++)
{
if(a[i]=='0')zero++;
... | C++ | ff95cd4632b2ddf8bb54981634badcae | d26be67c0a9ce9cb1474ed0144a4a54e | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define pi (3.141592653589)
/****************************************************************************************************/
void solve()
{
string a,b;
int n,i,j,pos1=0,pos2=0,c0=0,c1=0,c=0;
... | C++ | ff95cd4632b2ddf8bb54981634badcae | a074f148beb3745284bd9669228680ca | 1,200 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
char a[300005],b[300005];
int n;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
scanf("%s",a);
scanf("%s",b);
int flag=0;
int a_0_cnt=0,a_1_cnt=0;
... | C++ | ff95cd4632b2ddf8bb54981634badcae | ca389f6ad0bebfb93e03de7dcbbbc3a3 | 1,200 | PASSED |
t = int(input())
for _ in range(t):
n = int(input())
temp = [int(i) for i in input()]
a, b = "", ""
temp_a, temp_b = 0, 0
flag = 0
k = temp.count(1)
if n % 2 != 0 or temp[0] == 0 or temp[-1] == 0 or k % 2 != 0:
flag = 1
open_a, open_b = n // 2, n // 2
close_a, clos... | Python | f2aedd618eae5c51386525b1f76b19a6 | 725ba7f9fa4f75060427ee20a6fa047f | 1,600 | PASSED |
def is_pos(text):
st1, st2, cnt1, cnt2 = (['('], ['('], 1, 1)
for i in range(1, len(text)-1):
is_high = cnt1 >= cnt2
#print(text[i], is_high, cnt1, cnt2)
if text[i] == '1':
if cnt1 == 0 or cnt2 == 0:
cnt1, cnt2 = cnt1 + 1, cnt2 + 1
st1.... | Python | f2aedd618eae5c51386525b1f76b19a6 | 1497f0d442a49f43943e3401a6ef24dc | 1,600 | PASSED |
for _ in range(int(input())):
n = int(input())
num = input()
h = (n//2)
a = []
b = []
last = True
count1 = 0
c1 = num.count('1')
for i in range(n):
if num[i] == '0':
if last:
a.append('(')
b.append(')')
else:
... | Python | f2aedd618eae5c51386525b1f76b19a6 | b65bf0065694c4bb7b869456402ae741 | 1,600 | PASSED |
t=int(input())
for i in range(t):
n=int(input())
s=input()
a=''
b=''
c1=s.count("1")
c0=s.count("0")
if c1%2!=0 or c0%2!=0 or s[0]!="1" or s[-1]!="1" :
print("NO")
else:
print("YES")
one=0
zer=0
for j in range(n):
if s[j]... | Python | f2aedd618eae5c51386525b1f76b19a6 | 8f8c51a02c7e579b18df1511325c5c80 | 1,600 | PASSED |
def answer(s):
count1=0
count=0
count0=0
a=''
b=''
if s[0]=='0' or s[-1]=='0':
return ['NO']
for i in s:
if i=='1':
count1+=1
else:
count0+=1
if count1%2!=0 or count1==0 or len(s)%2!=0:
return ['NO']
var=0
fo... | Python | f2aedd618eae5c51386525b1f76b19a6 | 6044f8817dc3276a99695102b02147d0 | 1,600 | PASSED |
for i in range(int(input())):
N=int(input())
s=input()
zero=0
for i in range(N):
if(s[i]=='0'):
zero+=1
if(zero%2):
print('NO')
else:
if(s[0]=='0' or s[-1]=='0'):
print('NO')
else:
one=N-zero
s1="";s2="... | Python | f2aedd618eae5c51386525b1f76b19a6 | 92ce1cc201eb2ad40c4eaf382e3ba9ed | 1,600 | PASSED |
for _ in range(int(input())):
n = int(input())
s = input()
ok = True
if(s[0]=='0' or s[-1] == "0"):
ok = False
zero = s.count("0")
ones = s.count("1")
ans1 = ["?"] * n
ans2 = ["?"] * n
if(zero%2 == 0 and ones % 2== 0):
half = int(ones/2)
for i in r... | Python | f2aedd618eae5c51386525b1f76b19a6 | 0ff4261e8080ca60899c85c746441cd9 | 1,600 | PASSED |
t = int(input())
for _ in range(t):
n = int(input())
s = str(input())
d = 0
for x in s:
if (x == '1'):
d =d+1
d=d//2
a, b = [], []
p0, p1 = 0, 1
for x in s:
if (x == '1'):
if (p1 <= d):
a.append('(')
... | Python | f2aedd618eae5c51386525b1f76b19a6 | f5d30291fdb8be0c3e6b9fd2a78bcf2e | 1,600 | PASSED |
for _ in range(int(input())):
n = int(input())
s = input()
k = s.count('1')
m = s.count('0')
if s[0] == '0' or s[n - 1] == '0' or m % 2 != 0 or k % 2 != 0:
print('NO')
continue
a = ''
b = ''
d = 0
c = 0
for i in s:
if i == '1':
if... | Python | f2aedd618eae5c51386525b1f76b19a6 | ea1fc8c8f7ba7c9f1cfb601c33b9f0ad | 1,600 | PASSED |
t = int(input())
while t:
n = int(input())
s = input()
o = s.count("1")
if s[0]=="0" or s[-1]=="0" or s.count("0")%2!=0 or o%2!=0:
print("NO")
else:
a = ""
b = ""
open_flag=1
p=o//2
for x in s:
if x=="1":
if p>... | Python | f2aedd618eae5c51386525b1f76b19a6 | 0a07cc34fa0bf016dcb4998534915109 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s1,s2,s3,s4;
char ch='a';
int t,n;
cin>>t;
while(t--){
cin>>s1;
n = s1.length();
s1.insert(0,1,ch);
s2=s1;
reverse(s2.begin(),s2.end());
// cout<<s1<<"=s1"<<endl;
// cout<<s2<<... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | ba6329360f87ce944fe47f9437e2e67e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N=3e5+105;
char s[N];
int main(){
int x;
cin>>x;
while(x--){
cin>>(s+1);
int n=strlen(s+1);
int flag1=0;
for(int i=1;i<=n;i++){
if(s[i]!='a'){
flag1=1;
}
}
if(flag1==0){
cout<<"NO"<<endl;
continue;
}else{
s[0]='a';
int flag2=... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | 9d8fc31231c2ffbc674c2a557659eb49 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define endl "\n"
#define ll long long
#define INF 1e18
typedef pair <int,int> pii;
typedef map <int,int> mii;
int main() {
int t;
cin>>t;
string s;
while(t--){
cin>>s;
int x=s.size(),i=0;
bool ya=1;
while(i<x && ya){
... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | 88630e15a9ce85d3afe81c083ef1259f | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll ;
int isPAL(string str){
string p = str;
reverse(p.begin(),p.end());
if(p==str){
return 1 ;
}else{
return 0;
}
}
void solve(){
string str;
cin>>str;
if(isPAL(str+"a") == 0){
cout<<"Yes\n";
cout<<str<<'a'<... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | 7cf1475d7295519ed42fd21e2382a4d3 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int t;
string s;
int main()
{
cin >> t;
while (t--)
{
cin >> s;
int cnt = 0, cnt1 = 0, cnt2 = 0;
for (int i = 0; i < s.size(); i++) if (s[i] == 'a') cnt++;
if (cnt == s.size())
{
cout << "NO" << endl;
con... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | c071ece5175be3dcc69d6b7f9a216215 | 800 | PASSED |
#include <iostream>
#define breakl "\n"
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int loop;
string word, left, right;
long long int size;
bool notA;
cin >> loop;
while(loop--){
notA = false;
cin >> word;
... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | a9e1ca37f99b9eb67e1c0ce85b18d246 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// For Loop
#define fi(i, a, c) for (ll i = (a); i < (c); i++)
#define fd(i, a, c) for (ll i = (a); i > (c); i--)
#define fe(it, a) for (auto it : a)
// Pair
#define pi pair<int, int>
#define pll pair<ll, ll>
#define ... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | f06a8cfdbe9156bb0e08ee7fd50f0a3b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
bool palindrom(string s) {
bool flag = true;
int len = s.size();
for(int i = 0; i < len / 2; i++) {
if(s[i] != s[len - i - 1]) {
flag = false;
break;
}
}
return flag;
}
int main()
{
int t;
cin >> t;
whi... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | 8adecfc5511cc5d10c8281e72deb4afb | 800 | PASSED |
/* ***Bismillahir Rahmanir Rahim*** */
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MAX 1000005
#define INF 1e18
#define nn "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | c85752a792ae0297171c833ab1f1cf98 | 800 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
//typedef tree<long long, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update> indexed_m... | C++ | e2dc3de62fc45c7e9ddb92daa5c5d8de | 764dce0c113be0effdb909cca107c7c8 | 800 | PASSED |
#include<bits/stdc++.h>
#define f(i,a,b) for(ll i=a;i<b;i++)
#define ll long long
#define ld long double
#define vll vector<ll>
#define vv vector<vll>
#define pll pair<ll,ll>
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define p... | C++ | 7c721cdb8e5709bba242957344851d48 | 0a02c0c56bafc12cd8bb2ccaade39a04 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define f(i,a,b) for(ll i=a;i<b;i++)
#define ll long long
#define ld long double
#define vll vector<ll>
#define vv vector<vll>
#define pll pair<ll,ll>
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define p... | C++ | 7c721cdb8e5709bba242957344851d48 | bba60ec448f70c0c40a730b27c97f59a | 1,700 | PASSED |
//cyc
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define vector<int> VI
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define ... | C++ | 7c721cdb8e5709bba242957344851d48 | 2bbf06e845ffb1a351ba50a6e9a52aca | 1,700 | PASSED |
//ABHISHEK AGRAWAL,BIT mesra//
//Newbie......You have to be odd to be no. ONE :)//
//Author: Abhishekagrawal
//Date: 04/04/2021
//Time: 10:16:10
#include<bits/stdc++.h>
using namespace std;
#define booga cout << "booga" << endl
#define ... | C++ | 7c721cdb8e5709bba242957344851d48 | 31abe7be2d19d49aedd8a58f4e21ab84 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define pi 3.1415926535898
#define INF 1000000000000
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
typedef long long ll;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
void make_move(int n, int val, int& i) {
int r = i / ... | C++ | 7c721cdb8e5709bba242957344851d48 | 03f59126a0e6a832ea7f20ad7d6685d4 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define INF 1000000000 // 1 billion, safer than 2B for Floyd Warshall's
#define EPS 0.0000000... | C++ | 7c721cdb8e5709bba242957344851d48 | a43d96833504e16bf25de4a68de310d2 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define INF 1000000000 // 1 billion, safer than 2B for Floyd Warshall's
#define EPS 0.0000000... | C++ | 7c721cdb8e5709bba242957344851d48 | 7b4ac7e3591b63b49d86c7b9098a2472 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define INF 1000000000 // 1 billion, safer than 2B for Floyd Warshall's
#define EPS 0.0000000... | C++ | 7c721cdb8e5709bba242957344851d48 | 57030ce3232c27e28dad412c93dc9aaa | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> ve[2];
#define BLACK 0
#define WHITE 1
// color the cells like a checkerboard
// ve[COLOR] = {list of unfilled cells of tha... | C++ | 7c721cdb8e5709bba242957344851d48 | 8b0d25c99dfe3581cebfa91693cf4bad | 1,700 | PASSED |
#include<bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define fi first
#define lb lower_bound
#define test ll int t;cin>>t;while(t--)
#define se second
#define pll pair<long long,long long>
#define icc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using name... | C++ | 7c721cdb8e5709bba242957344851d48 | 34dc14e06c840bdbf02a0e59e2a0a019 | 1,700 | PASSED |
//ダニヤ
#include <bits/stdc++.h>
using namespace std;
#define khan ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
#define pii pair < int, int >
#define pb push_back
const int N = 1e5 + 5, mod = 998244353, INF = 1e9 + 7;
const ll BIG = 1e18;
const int block = 316;
const... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | d531dc516ac29fd6fe050fd867455faa | 2,200 | PASSED |
//ダニヤ
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// int id = uniform_int_distribution<int>(l, r)(rng);
// result -= result / ... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | a158f90c7d4568db5349d17034a7d25a | 2,200 | PASSED |
//ダニヤ
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// int id = uniform_int_distribution<int>(l, r)(rng);
// result -= result / ... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | eafc340d528fab94c8a3545013e31aaa | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | 8f3709d2c59d17a63df69d512ef8b819 | 2,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch = getchar();}while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0', ch = g... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | a54662ebba87b0cbfd0107185abc19c7 | 2,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch = getchar();}while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0', ch = g... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | 3441b0ea94f3dc7ba4301189541da518 | 2,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch = getchar();}while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0', ch = g... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | cfe4683382f5f2995c6d9bf1da41dc3c | 2,200 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
inline ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch = getchar();}while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0', ... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | 59279e4985a1193f0010f148756dafd7 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct aa
{
ll x;
ll y;
}p[100005]={0};
bool cmp(aa a,aa b)
{
if(a.x==b.x) return a.y<b.y;
return a.x<b.x;
}
int main()
{
ll t,i,j,n,maxnow,ans=0;
cin>>n;
for(i=0;i<n;i++)
scanf("%lld %lld",&p[i].x,&p... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | 07e1c2e7363325866e161b7cb85adaa2 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100005]={0};
struct aa
{
ll x;
ll y;
}p[100005]={0};
bool cmp(aa a,aa b)
{
if(a.x==b.x) return a.y<b.y;
return a.x<b.x;
}
ll vis[100005]={0},n,ans=0;
int main()
{
ll t,i,j,z1,z2,maxnow,ans=0;
cin>>n;
... | C++ | 48f2c0307a29056a5e0fcc26af98f6dc | 02b1b7a032e58f61410e8433cecf73f3 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN=727272;
int a[NN],b[NN];
int pl[NN],fl[NN];
int st,ed;
int N,K;
void dfs(int A,int B,int ST,int ED);
void bfs(int A,int B,int ST,int ED){
// cerr<<"BBB "<<A<<' '<<B<<' '<<ST<<' '<<ED<<endl;
st=max(st,B+1);
ed=min(ed,A-1);
int id=pl[A]/2;
int C=0,D=1e9;
fo... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | aabcfca81f917befd28f0aaa3a86a99d | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define NN 400010
int a[NN], b[NN];
int f[NN], g[NN], nxt[NN], vst[NN], val[NN];
int tf[NN], tg[NN], tmp[NN], tp, tq;
int L, R, p, q, st, ed, ans;
void check1(int *arr, int len) {
for (int i = 1; i < len; i++) {
if (arr[i] < arr[i + 1]) {
cout << -1 << endl;
exi... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | 54d4257ccf565976fadde2748eba2ce3 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | dd8c37877893e3d52318d1101a002b97 | 2,600 | PASSED |
// Problem: F. Flip the Cards
// Contest: Codeforces - Codeforces Round #712 (Div. 2)
// URL: https://codeforces.com/contest/1504/problem/F
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | d0b194a4da4e3a825c16a4e9afc30df0 | 2,600 | PASSED |
#include <cstdio>
#include <utility>
#include <algorithm>
using namespace std;
const int MAXN = 2e5;
int n, a, b;
int f[MAXN + 5], c[MAXN + 5];
int pre[MAXN + 5], suf[MAXN + 5];
int top1 = 0x7fffffff, top2 = 0x7fffffff, sz1, sz2, s1, s2;
int Ans = 0;
int main()
{
scanf("%d", &n);
for ... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | 03fbd59493edaf0eaebfcf411b3fd99a | 2,600 | PASSED |
#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define ll long long
#define ull unsigned long long
#define db double
#define mem(a,b) memset(a,b,sizeof(a))
#define mpy(a,b) memcpy(a,b,sizeof(b))
#define dbg(...) cerr<<"#"<<__LINE__<<": "<<__VA_... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | 9593790530e5d93695c2506e872f8b48 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 444444;
int n,a[N],f[N],b[N],g[N];
int main(){
int i,x,y,o,s,t,u;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d",&x,&y);
if((x<=n)==(y<=n)){
printf("-1");
return 0;
}
a[x]=y,a[y]=x;
f[x]=(x<y),f[y]=(x<y);
}
for(i=1;i<=n;i++)
b[i]=a[n+i];... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | f13659b51927368c1f63793f85ca6073 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> ve(n + 1), c(n + 1), suffmax(n + 2), seq0, seq1;
bool flag = true;
for(int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int cost = 0;
if(a > b) {
cost... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | ae82aa15eb8ed273ed28eb9800c93d8a | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int N = 4*1e5 + 10 ;
pair<int ,int> ss[2*N+3];
int s[2*N+3];
int s1[2*N+3] ;
int demtrai ;
int demphai ;
int n ;
int f[2*N+3] ;
vector< int > c ;
vector< int > d ;
int maxbt ;
int dem1 ;
int dem2 ;
void thetrai( i... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | 09cc8375f6d8f6c742546fc03f77455b | 2,600 | PASSED |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
//#pragma GCC target("avx,avx2,sse2,ssse3,popcnt")
//#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define all(x) (x).... | C++ | b1a59d0c59f3e8fd3bf76de6463c6847 | b5fa1c3892ff3d3efd338aeeb3e6a287 | 2,600 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ok cout<<"YES\n";
#define no cout<<"NO\n";
#define For(i) for(ll i = 0; i < n; i ++)
#define For(s) for(ll j = 0; j < s.size(); j ++)
#define For(j) for(ll j = 0; j < m; j ++)
using namespace std;
void sol(){
ll n;
cin >> n;
string s;
... | C++ | fa761cd247a815f105668b716c20f0b4 | a173fc16031a9ce468cdbd19a56ed601 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define lin "\n"
#define pb push_back
#defin... | C++ | fa761cd247a815f105668b716c20f0b4 | aa348781763ecfebd582d009101e4fa8 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--)
{
int n ;cin>>n;
string s;
cin>>s;
int temp = s.size();
int cnt =0;
temp = temp/2;
// cout<<temp<<endl;
for(int i =temp-1;i>=0 ;i--)
{
if(s[i]==s[temp])
{
cnt=... | C++ | fa761cd247a815f105668b716c20f0b4 | 24888192311e61ba26eac12af17740e8 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--)
{
int n ;cin>>n;
string s;
cin>>s;
int temp = s.size();
int cnt =2;
temp = temp/2;
// cout<<temp<<endl;
for(int i =temp-1;i>=0 ;i--)
{
if(s[i]==s[temp])
{
cnt=... | C++ | fa761cd247a815f105668b716c20f0b4 | 2b890fbec52f14891083f984a0cf2984 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--)
{
int n ;cin>>n;
string s;
cin>>s;
int temp = s.size();
int cnt =2;
temp = temp/2;
// cout<<temp<<endl;
for(int i =temp+1;i<n ;i++)
{
if(s[i]==s[temp])
{
cnt=c... | C++ | fa761cd247a815f105668b716c20f0b4 | 22cd11f2f220626f80f728a1a7964423 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
bool pal(string s)
{
int start=0;int end=s.size()-1;
while(start<end)
{
if(s[start]!=s[end])
{
return false;
}
start++;
end--;
}
return true;
}
void solve()
{
int n;
cin>>n;
string s;
cin>>s;
int count=0;
for(int i=0;i<n;i++)
{
string s1=s.substr(i... | C++ | fa761cd247a815f105668b716c20f0b4 | 9d00b22808d568c180f4852202abb3b9 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
for(int i=0;i<t;i++)
{
int n;
cin>>n;
string s;
cin>>s;
int ans=0;
if(n%2!=0)
{
ans=1;
for(int j=(n/2)-1;j>=0;j--)
{
... | C++ | fa761cd247a815f105668b716c20f0b4 | e7051719f3ee1155515fcb1b3b05a4ca | 800 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
string palindrome(string y)
{
int i,j,n,y1;
n=y.length();
for(i=0;i<n;i++)
{
y[i]=y[n-i-1];
}
return y;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--)
{
int n,i,j,add=0,k,... | C++ | fa761cd247a815f105668b716c20f0b4 | 5bc4fc133e1fb87a2572f07675194d86 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define yes cout<<"YES"<<'\n'#define no cout<<"NO"<<'\n'
#define forn(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
... | C++ | fa761cd247a815f105668b716c20f0b4 | 72054973f9b3c86a2db8860f2be078a4 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
string a;
cin >> a;
int l = n / 2;
int r = n / 2;
while (a[l - 1] == a[l]) l--;
while (a[r + 1] == a[r]) r++;
cout << r - l + 1 << endl;
}
return 0;
} | C++ | fa761cd247a815f105668b716c20f0b4 | 8a4f9f96c9f2e522f2ed126e3ae178f2 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#define ll long long
#define lli long long int
#define ld long double
#define ull unsigned long long
#define ulli unsigned long long int
#define PI 3.1415926535897932384626433832795
#define sp ' '
#define pb push_back
... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | e56ba52598e4567cc3764c07aa09db0e | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=2e5+10;
int a[MAXN];
int n;
//int bin[]={1 ,2, 4, 8 ,16, 32, 64, 128, 256, 512, 1024, 2048, 4096 ,8192, 16384, 32768 ,65536, 131072};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t;
cin>>t;
while(t--)
{
cin>>n;
... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 493471cd09773c9555ed0b785bb1f913 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tc;cin>>tc;
while(tc--)
{
int n;cin>>n;
int arr[n];
vector<int>v;
for(int i=0;i<n;i++)
{
cin>>arr[i];
if(arr[i]!=i)v.push_back(arr[i]);
}
int cnt=v[0];
for(auto it:v)
cnt=cnt⁢
cout<<cnt<<endl;
}
... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 0327ec17c8e585d70a40a8668458c90a | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
using ll = long long;
const int inf = (int)1e9;
const int MAX_N = 200100;
void solve()
{
int n; cin>> n;
ve... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 73fbe662adb3fc2267d8556bb9916bbc | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
using ll = long long;
const int inf = (int)1e9;
const int MAX_N = 200100;
void solve()
{
int n; cin>> n;
ve... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 4935780bca5c2aa165a8082cd54a859a | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
using ll = long long;
const int inf = (int)1e9;
const int MAX_N = 200100;
void solve()
{
int n; cin>> n;
ve... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 7da7d7f9885e5cfc29633064aedd0519 | 1,100 | PASSED |
#include <iostream>
#include <set>
using namespace std;
int main()
{
int tests;
cin>>tests;
while(tests--)
{
int n, Result = -1;
cin>>n;
for(int i = 0; i<n; i++)
{
int x;
cin>>x;
if(x != i)
{
... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 67da29fba43d222ace59e5866e40d894 | 1,100 | PASSED |
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int N=2e5+10;
int n,a[N];
int main(){
//freopen("in.txt","r",stdin);
int _;
scanf("%d",&_);
while(_--){
scanf("%d",&n);
int res=(1<<30)-1;
for(int i=0;i<n;i++){
scanf("%d",&a... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 749274826a19f941b2bf7322711dc572 | 1,100 | PASSED |
#include<bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
void swap (char *a,char *b) {
char *temp;
temp = a;
a = b;
b = temp;
}
int binarysearch(vector<ll> arr, ll l, ll r, ll x)
{
if (r >= l) {
int mid = l + (r - l) / 2... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | 43d23db0251c2c31cc5de7ffa102bcb0 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[2 * 100010];
int b[2 * 100010];
int main()
{
int T;cin>>T;
while(T--)
{
int i;cin>>i;
for(int j = 0;j < i;j++)
{
cin>>a[j];
b[j] = a[j];
}
sort(a,a+i);
int X = -1;
for(int j = 0;j < i;j++)
{
... | C++ | dea37a75a4aedd3a3a6fd51efdc3f8b2 | e1879aaf336fdb1d3727493d6928cb76 | 1,100 | PASSED |
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#inclu... | C++ | 68b7567880b9980d793dae2bce690356 | a43f23f5cfa4fe82dd7ca71070d96abc | 1,400 | PASSED |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <unordered_map>
#include <functional>
using namespace std;
const int N = 200005;
int T, n;
int ss[N];
int main() {
ios::sync_with_stdio(false);
unordered_map<int, int> vv;
cin >> T;
while (T--) {
cin >> n... | C++ | 68b7567880b9980d793dae2bce690356 | 19799b79809c5b810e6cbafad1a9de22 | 1,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define pii pair<int,int>
#define fi first
#define se second
#define debug printf("++ ++\n");
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const... | C++ | 68b7567880b9980d793dae2bce690356 | 098ccc570c017fbbe8975f1f6d2c044d | 1,400 | PASSED |
/*
Author: Tangerine
itracers.xyz
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <iomanip>
#include <string>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace ... | C++ | 68b7567880b9980d793dae2bce690356 | c5d18b69d5459d87019866a78d192336 | 1,400 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
using ll = long long;
int main() {
size_t count_tests;
cin >> count_tests;
while (count_tests--) {
int n;
cin >> n;
unordered_map<int, int>mp;
for (int i = 0; i < n; ++i) {
int va... | C++ | 68b7567880b9980d793dae2bce690356 | af054a980110a28e9485cdd45351353f | 1,400 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define cout cout << '\t'
int nod(int a, int b) {
return b ? nod(b, a % b) : a;
}
int nok(int a, int b) {
return a / nod(a, b) * b;
}
void solve()
{
int n;
cin >> n;
vector<int> a(n), x, y;
... | C++ | 68b7567880b9980d793dae2bce690356 | 563c0fd878e94486b72118c24277d182 | 1,400 | PASSED |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <bitset>
#include <iomanip>
#include <cmath>
typedef long long ll;
using namespace std;
int t, n;
int a[200000];
void main() {
//... | C++ | 68b7567880b9980d793dae2bce690356 | ff5ebd9d2c6c570994126ec20aa622b8 | 1,400 | PASSED |
#ifndef STRING
#define STRING
#include <map>
#include <numeric>
#include <iostream>
#include <cstring>
#include <sstream>
#include <string>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <string>
#include <vector>
#include <iterator>
#include <deque>
#include <iomanip>
#include <lis... | C++ | 68b7567880b9980d793dae2bce690356 | b1c62788c53efe508fdd11be303d41dd | 1,400 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
int a[200007];
int main() {
int t, n, x, m;
cin >> t;
while (t--) {
cin >> n; x = 0, m = 0;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (!(a[i] == a[i - 2] && i >= 2)) x++;
if ((a[i]... | C++ | 68b7567880b9980d793dae2bce690356 | d97c01b078edb2178456604ea6423cd3 | 1,400 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <queue>
#include <climits>
using namespace std;
int n, m, i, j, k;
string s;
void solve(int T)
{
cin >> n;
vector<int... | C++ | 68b7567880b9980d793dae2bce690356 | e6249ef3c08bece394ff71584aa257bd | 1,400 | PASSED |
#include<bits/stdc++.h>
//#define int long long
#define ll long long
//#define x first
//#define y second
#define all(v) v.begin(),v.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define rb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
const int mod=998244353;
#define debug(args...) {... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 5f110147c80740baa921c94ce6918d1b | 2,000 | PASSED |
#include<queue>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int N=2e5+10;
char s[N];
vector<int> v;
int a[N],c[N],fa[N];
int find(int x){
if(x==fa[x]) return x;
return fa[x]=find(fa[x])... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 946454e1919058a247d7776f5bde53de | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=2e5+10;
int n,k;
int a[N];
void solve()
{
cin>>n;
string s;
cin>>s;
int p,rr=0;
for(int i=0;i<s.size();i++)
if(s[i]=='1')a[i]=1,rr++,p=i;
else a[i]=0;
if(rr<2||rr%2)
{
cout<<"NO\... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | c0d3d5e7522e0e11748edd1682b2ad5d | 2,000 | PASSED |
#include <bits/stdc++.h>
#define FIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define ull unsigned long long
#define ll long long
#define ld long double
#define sint short int
#define f first
#define s second
#define INF 1e17
#define eps 0.0000000001
using namespace std;
void ci... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 6a0fba5f03ae27ace111cb72d35e67fc | 2,000 | 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 all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define F(i, a) for (int i = 0; i < a; ++i)
#define F1(i, a, b) for (int i = a; i < b; ++i)
#defin... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | d691a3d79b4e96af6db82c8bc9fbcd57 | 2,000 | 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 all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define F(i, a) for (int i = 0; i < a; ++i)
#define F1(i, a, b) for (int i = a; i < b; ++i)
#defin... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 16ec36859604ca6cb57573719b9c89f7 | 2,000 | 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 all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define F(i, a) for (int i = 0; i < a; ++i)
#define F1(i, a, b) for (int i = a; i < b; ++i)
#defin... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 04402306d2f52ba0d97de681834b38d2 | 2,000 | 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 all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define F(i, a) for (int i = 0; i < a; ++i)
#define F1(i, a, b) for (int i = a; i < b; ++i)
#defin... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 9ee91ff99a7c7ad30e981a91f8df4d1d | 2,000 | 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 all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define F(i, a) for (int i = 0; i < a; ++i)
#define F1(i, a, b) for (int i = a; i < b; ++i)
#defin... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 87440175be0c9ea2b0bdc4ea75cb7d87 | 2,000 | 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 all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define F(i, a) for (int i = 0; i < a; ++i)
#define F1(i, a, b) for (int i = a; i < b; ++i)
#defin... | C++ | 65bb0f28d079ca94751048d326b3e1f1 | 5f13ee143b9b1d7a82acd4216b063c2c | 2,000 | PASSED |
#include <algorithm>
#include <bitset>
#include <map>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#include <ctime>
#include <cmath>
#include <stack>
#include <set>
#include <queue>
#include <array>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using nam... | C++ | 0da021cfe88c5a333db99064de12acbf | c4f0e7011c26ebbbf0f5896f0c521181 | 2,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.