source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int n, l, r, v, h;
vector<array<int, 3>> a;
int main() {
cin>>l>>r;
if(l==r) {
cout<<"YES\n2 1\n1 2 "<<l<<"\n";
exit(0);
}
if(l==1) {
l++;
a.push_back({1, 23, 1});
}
v = r-l;
while(v >> h)h++;
... | C++ | 86dd4550594a49f682f6bf2e950919f2 | 5ca1675288bda57d087daad7fcb232d8 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, l, r, v, h;
vector<array<int, 3>> a;
int main() {
cin>>l>>r;
if(l==r) {cout<<"YES\n2 1\n1 2 "<<l<<"\n"; exit(0);}
if(l==1) {l++; a.push_back({1, 23, 1});}
v = r-l;
while((v >> (h)) > 0)h++;
for(int i = 2; i < 22; ++i) {
a.p... | C++ | 86dd4550594a49f682f6bf2e950919f2 | 5325f1c3f7d91c746efb45ae6c4e0d9a | 2,500 | PASSED |
#include <bits/stdc++.h>
int n, l, r, val, hbit;
std::vector<std::array<int, 3>> ans;
int main() {
std::cin>>l>>r;
if(l==r) {std::cout<<"YES\n2 1\n1 2 "<<l<<"\n"; exit(0);}
if(l==1) {l++; ans.push_back({1, 23, 1});}
val = r-l;
while((val >> (hbit)) > 0)hbit++;
for(int i = 2; i < 22; ++... | C++ | 86dd4550594a49f682f6bf2e950919f2 | 0261f41b91a162bc12486f4fe42b0f17 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
const... | C++ | 86dd4550594a49f682f6bf2e950919f2 | 60d07152894724866e76ec9a7cc5226a | 2,500 | PASSED |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int main()
{
vector<pair<pair<int,int>,int> > ans;
int l,r;
cin>>l>>r;
int sk=0;
ans.push_back({{-1,30},l});
ans.push_back({{-1,0},1});
int b=1;
for(int i=9; i>=0; i--){
if(l+sk+b*4>r){... | C++ | 86dd4550594a49f682f6bf2e950919f2 | ebbe936c9637fb724d10567b7026f983 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
ll l,r;
vector<vector<ll> > sol;
const ll n=23;
int main()
{
ios_base::sync_with_stdio(false);
cin>>l>>r;
if(l==1)
{
sol.pb({1,n,l});
l++;
}
ll diff=(r-l+1);
ll cum=0... | C++ | 86dd4550594a49f682f6bf2e950919f2 | 1987347a20cbe2863383ca3d8fcae358 | 2,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout << x, 0;
#define int long long
#define vi vector<int>
#define pii pair<int, int>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(x) (x).begin(),... | C++ | c091ca39dd5708f391b52de63faac6b9 | b182689fe708751ef8fb199939bebf48 | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout << x, 0;
#define int long long
#define vi vector<int>
#define pii pair<int, int>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(x) (x).begin(),... | C++ | c091ca39dd5708f391b52de63faac6b9 | 481d86afe4659b3cd32bd24e701be38d | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout << x, 0;
#define int long long
#define vi vector<int>
#define pii pair<int, int>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(x) (x).begin(),... | C++ | c091ca39dd5708f391b52de63faac6b9 | 2d319096c56ae888f4ba1a19a5526390 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #define endl '\n'
#define int int64_t
int n;
int ask(int idx)
{
if(idx==0 or idx>n) return 1e9;
cout<<"? "<<idx<<endl;
cin>>idx;
return idx;
}
void answer(int idx)
{
... | C++ | c091ca39dd5708f391b52de63faac6b9 | 77e1f15a657350ead83686a6659ad8c7 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #define endl '\n'
#define int int64_t
int n;
int ask(int idx)
{
if(idx==0 or idx>n) return 1e9;
cout<<"? "<<idx<<endl;
cin>>idx;
return idx;
}
void answer(int idx)
{
... | C++ | c091ca39dd5708f391b52de63faac6b9 | 64c72da0e471e955853d3a22b4addfe3 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #define endl '\n'
#define int int64_t
int n;
int a[123456];
int ask(int idx)
{
if(idx==0 or idx>n) return 1e9;
if(a[idx])
return a[idx];
cout<<"? "<<idx<<endl;
int a... | C++ | c091ca39dd5708f391b52de63faac6b9 | b1854fef68fb5028cb767f6b8fe843ff | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #define endl '\n'
#define int int64_t
int n;
int a[123456];
int ask(int idx)
{
if(idx==0 or idx>n) return 1e9;
if(a[idx])
return a[idx];
cout<<"? "<<idx<<endl;
int a... | C++ | c091ca39dd5708f391b52de63faac6b9 | ab522316f47e55113178bffd614737b6 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #define endl '\n'
#define int int64_t
int n;
int ask(int idx)
{
if(idx==0 or idx>n) return 1e9;
cout<<"? "<<idx<<endl;
cin>>idx;
return idx;
}
void answer(int idx)
... | C++ | c091ca39dd5708f391b52de63faac6b9 | d73b073381dc31799a557cbb614df9fc | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #define endl '\n'
#define int int64_t
int n;
int ask(int idx)
{
if(idx==0 or idx>n) return 1e9;
cout<<"? "<<idx<<endl;
cin>>idx;
return idx;
}
void answer(int idx)
... | C++ | c091ca39dd5708f391b52de63faac6b9 | 4d921b784a207d8d02c89d2e83290c3e | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define endl "\n"
#define int long long
vector<int> v;
// typedef long long int ll;
int n;
const int N = 50001;
const int M = 1e9+7;
int query(int i)
{
if(i<0... | C++ | c091ca39dd5708f391b52de63faac6b9 | 41f1733a83b334ab317cc4cb4c51d050 | 1,700 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int N=1e3+10,mod=998244353;
int n,m,a[N],beg,end;
inline int fpow(int a,int b){
int ret=1;
for(;b;b>>=1,a=1ll*a*a%mod) if(b&1) ret=1ll*ret*a%mod;
return ret;
}
int main(){
scanf("%d",&m); if(m==1) return puts("0"),0;
for(i... | C++ | 384baab3c59208437951188b22d4f7a2 | 6a9e862317afa2b44d4482592ab3a014 | 3,500 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int mod=998244353;
int pow(int x,int y){
int res=1;
while(y){
if(y&1) res=1ll*res*x%mod;
x=1ll*x*x%mod,y>>=1;
}
return res;
}
int n,m,a[1010];
int main(){
scanf("%d",&m);
for(int i=1;i<=m;i+... | C++ | 384baab3c59208437951188b22d4f7a2 | 97b2a2bbfc765f8882ec6fede74083f1 | 3,500 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int mod=998244353;
int pow(int x,int y){
int res=1;
while(y){
if(y&1) res=1ll*res*x%mod;
x=1ll*x*x%mod,y>>=1;
}
return res;
}
int n,m,a[1010];
int main(){
scanf("%d",&m);
for(int i=1;i<=m;i+... | C++ | 384baab3c59208437951188b22d4f7a2 | 072c4d58816c3ec109b9fe7944753552 | 3,500 | PASSED |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int const mod=998244353;
int pow(int x,int y){
int res=1;
while(y){
if(y&1) res=1ll*res*x%mod;
x=1ll*x*x%mod,y>>=1;
}
return res;
}
int n,m,a[1010];
int main(){
scanf("%d",&m);
for(int i=1;i<=m;i+... | C++ | 384baab3c59208437951188b22d4f7a2 | 53293db7ab3a9fbd40104ff691d4cfea | 3,500 | PASSED |
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a);)
#define all(x) begin(x), end... | C++ | 384baab3c59208437951188b22d4f7a2 | f071acdbf9884f461204a4b69aef51f8 | 3,500 | PASSED |
//#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a)... | C++ | 384baab3c59208437951188b22d4f7a2 | 8ea0165baac13dae2b0dc1fbe2856c2e | 3,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a);)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) static_cast<int>((x).size())
... | C++ | 384baab3c59208437951188b22d4f7a2 | 33deca1706e2c597ea3863f392012824 | 3,500 | PASSED |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a);)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) static_cast<int>((x).size())
... | C++ | 384baab3c59208437951188b22d4f7a2 | 072587dfd594fb13ec17fc022b4db99d | 3,500 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a);)
#define all(x) begin(x), ... | C++ | 384baab3c59208437951188b22d4f7a2 | 5919762dcbba70989e471bcc4dea5081 | 3,500 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a);)
#define all(x) begin(x), ... | C++ | 384baab3c59208437951188b22d4f7a2 | 8b0c7be08ff72e744acfd1cd7c433fb5 | 3,500 | PASSED |
/***
created: 2022-09-04-20.23.42
***/
#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;
template<typename U> using ordered_set=tree<U, null_type,less<U>,rb_tree_tag,tree_order_statistics_node_update>;
#def... | C++ | c5d930c01af7470ef9353063213c5c54 | 389aa45946c119c9eac3018a2538bc69 | 1,000 | PASSED |
#pragma OCC optimize("O2")
#include <bits/stdc++.h>
#define run(i,a,b) for(int i=a;i<b;++i)
#define down(i,a,b) for(int i=a;i>b;--i)
#define ll long long
#define sum(a,x,y,s) accumulate(a+x,a+y,s)
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
... | C++ | c5d930c01af7470ef9353063213c5c54 | 3802412c955d74e2e469b2dcf1c5ed7c | 1,000 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define popCount(x) __builtin_popcountll(x)
using namespace __gnu_pbds;
ll MOD = 1e9 + 7;
const int N = (int) 1e6;
#define el '\n'
#define the_sun_will_ris... | C++ | c5d930c01af7470ef9353063213c5c54 | 2feb0b4e5d85415ced819fabf0b8145c | 1,000 | PASSED |
#include <iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<deque>
using namespace std;
#define ll long long
#define en "\n"
#define all(v) v.begin(),v.end()
#define alr(v) v.rbegin(),v.rend()
bool ispalind(string s) { int n = s.length(); for (int i = 0; ... | C++ | c5d930c01af7470ef9353063213c5c54 | 2c6391287fdc1d6732ec83fda25ac479 | 1,000 | PASSED |
/*
* Author: datqg
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int k;
cin>>k;
int min=-1;
vector<int>nums(n);
for(int i=0;i<n;i++) {
cin>>nums[i];
if (nums[i]>k) {
if (min==-1) {
min=nums[i];
}
else if (nums[i]<min) {
min=n... | C++ | c5d930c01af7470ef9353063213c5c54 | e8940093d85417fed3c5c168ab51a53b | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <windows.h>
#include <chrono>
#include <ctime>
#include <algorithm>
using namespace std;
/*
__ __ _ _ ____ _
| \/ | ___ | |__ __ _ _ __ ___ ___ __| | | __ ) __ _| | ___ __
| |\/| |/ _ \| '_ \ / _` | '_ ` _ \ / _ \/ _` ... | C++ | c5d930c01af7470ef9353063213c5c54 | 10a2288d43c865d9bca75a7dc163422d | 1,000 | PASSED |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
int n,a[100005],ans,crew2,pot,lat;
double d,mi,crew1;
bool cmp(int a,int b){
return a>b;
}
void basketball(){
mi=a[pot];
if(mi==0)return;
crew1=(floor(d/mi)+1);
crew2=(int)crew1;
if(... | C++ | c5d930c01af7470ef9353063213c5c54 | e40b886d8deff874f0792853514ece0d | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[100001],n,d,y,dem;
int main()
{
cin >> n >> d;
for(int i=1;i<=n;i++)
cin >> a[i];
sort(a+1,a+n+1);
for(int k=n;k>=1;k--)
{
y+=(d/a[k]+1);
if(y>n)break;
dem++;
};
cout << dem;
return 0;
... | C++ | c5d930c01af7470ef9353063213c5c54 | 37dd34a622db844ecca6a54018beb8b4 | 1,000 | PASSED |
//***************************************************************************************
//** ** ** ******** ********* *** ***** ** ********** **
//** ** ** * ** ** *** ** ** ** *** **
//** ***** * ** **... | C++ | c5d930c01af7470ef9353063213c5c54 | d2e324bb32156a7a390642ef40b41c3a | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
long long n,d,i;
cin>>n>>d;
long long arr[n+1];
for(i=1;i<=n;i++){
cin>>arr[i];
}
sort(arr+1,arr+n+1,greater<int>());
long long c=0,D=1;
while(n>0){
long long... | C++ | c5d930c01af7470ef9353063213c5c54 | f566c52b59c507ee2122472ec3e68f3a | 1,000 | PASSED |
#include <bits/stdc++.h>
#define int64 long long
#define fr first
#define sc second
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, i, u, v, w;
cin >> n >> m;
vector<vector<pair<int, int>>> g1(n), g2(n);
priority_queue < pair<int64, int>, vector<pair<int64, ... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 2a89d89d5118eeba7379a2e70d1877d8 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int64 long long
#define fr first
#define sc second
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int64 n, m, i, u, v, w;
cin >> n >> m;
vector<vector<pair<int64, int>>> g1(n), g2(n);
priority_queue < pair<int64, int>, vector<pair<int... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 134d1ccdd42a08c36bfd46c74cd07924 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
u--, v--;
adj0[u].push... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 016b51fbfb78548d8b32e2f55b2ff504 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fr first
#define sc second
const long long inf = 1e18;
long long n, m, nr[2][100069];
vector<pair<long long, long long>> al[2][100069];
priority_queue<pair<long long, pair<bool, long long>>> pq;
int main() {
long long i, ii, k, ... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 3b5acf8b9b54d3deea1446bb7b437ab5 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
u--, v--;
adj0[u].push... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | c158f66c3a903a69ccade68d38102929 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
u--, v--;
adj0[u].push... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 2d899ce47f55670aa841e665dbaf8e98 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
u--, v--;
adj0[u].push... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | c11852121b885ae89bb1a1a4e68b2bef | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<std::array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
std::cin >> u >> v >> w;
u--, v--;
ad... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 01539ae18b654a35639e6949695f1d21 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
// sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<std::array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
std::cin >> u >> v >> w;
u--, v--;
adj0[... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 382c985da10b2f60edbccec15957b678 | 1,800 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
std::cin >> n >> m;
std::vector<std::vector<std::array<int, 2>>> adj0(n), adj1(n);
for (int i = 0; i < m; i++) {
int u, v, w;
... | C++ | b08f925e09a9c2e7ccc6a8c5c143fc5f | 128c4f19cec150449deadc1914a676ff | 1,800 | PASSED |
#include<bits/stdc++.h>
int ev(int x){
int k =0;
while(x%2==0){
x/=2;
k++;
}
return x+k;
}
main(){
int p,q,t=1,s=1,ss,mx,mul=0,ded=0,turn=0,x,m;
scanf("%d %d",&p,&q);
long long sum = 0;
while(1){
ss=s+(t+1)/2;
if(ss>p){
m=(p-s+1... | C++ | b7942cf792c368cc240ed22e91ad406f | 7f9becde240ad3bf09545bdae00e1a8b | 2,900 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <v... | C++ | b7942cf792c368cc240ed22e91ad406f | fdf54982941c7d55511be68c45bdb61e | 2,900 | PASSED |
#include<cstdio>
#define RI register int
#define CI const int&
using namespace std;
const int N=100005;
int n,q,p,bkt[N],cnt; long long sum;
int main()
{
//freopen("CODE.in","r",stdin); freopen("CODE.out","w",stdout);
RI i; for (scanf("%d%d",&n,&q),i=1;n;++i)
{
int cur=(i+1)>>1; bkt[i]=1;
if (cur<=n)... | C++ | b7942cf792c368cc240ed22e91ad406f | 369ddecad014d98017b6a35f9f4bb2b4 | 2,900 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
#define all(p) p.begin(),p.... | C++ | b7942cf792c368cc240ed22e91ad406f | 71c960a811e93f8cb834171e6296e846 | 2,900 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
using namespace std;
#define int long long
const int N=1e5;
int n,q,a[N];
int bitsum[N],bs[2][N],s[N];
inline void modf(int x,int y,int w){
assert((x&1)==(y&1));
bs[x&1][x]+=w,bs[x&1][y+2]-=w;
}
vector<int>... | C++ | b7942cf792c368cc240ed22e91ad406f | 8bc3fd4114b648e3b425a0ebfd405c01 | 2,900 | PASSED |
//もう布団の中から出たくない
//布団の外は寒すぎるから
//布団の中から出たくない
//布団の中はあたたかすぎるから
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl
#... | C++ | b7942cf792c368cc240ed22e91ad406f | cdbb1640c3404cf1cfcded8753e283da | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> sum{0};
while (sum.back() < n) {
sum.push_back(sum.back() + (sum.size() + 1) / 2);
}
sum.back() = n;
int m = ... | C++ | b7942cf792c368cc240ed22e91ad406f | e97862bacce68a9767d82861e072f256 | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define data dataa
#define rep(i,n) for(int i=1;i<=n;i++)
typedef long long LL;
typedef long double LD;
const int N=100010;
struct data
{
int x,y;
friend data operator+(data a,data b)
{
if(a.y>b.y)swap(a,b);
b.x... | C++ | b7942cf792c368cc240ed22e91ad406f | 35ca2f80ce855d22f07758c34d227157 | 2,900 | PASSED |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) 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 INF (ll)(1e18... | C++ | b7942cf792c368cc240ed22e91ad406f | ae481bea017864b2bfc43577711b8b1d | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define reset(a, b) memset(a, b, sizeof a);
#define ALL(x) x.begin(), x.end()
template <typename T>
void cetak(T t)
{
cout << t << ')' << endl;
}
template <typename T, typename... V>
void cetak(T t, V.... | C++ | b7942cf792c368cc240ed22e91ad406f | ce258ef48736dbb4b0c03ecbeb6f4abd | 2,900 | PASSED |
#include<stdio.h>
#include<malloc.h>
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<bitset>
#include<stack>
using namespace std;
typedef lo... | C++ | 8b57854277fb7baead123473a609301d | 5812ff63ce450f03ca75cb41df881369 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int mod = 998244353;
#define int long long
int binpow(int a, int b) {
if (b == 0) return 1;
int res = binpow(a, (b >> 1));
if (b & 1) return ((a * res) % mod * res) % mod;
return (res * res) % mod;
}
int f[300001], rf[300001];
int C(int n,... | C++ | 8b57854277fb7baead123473a609301d | f652625014972589f99d922b165e565a | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(v) (v).begin(), (v).end()
using ll = long long;
ll KMOD = 998244353;
// ============== ADD MULTIPLY SUBTRACT POWER ============= */
ll madd(ll a, ll b) { return (a + b) % KMOD; }
ll mmul(ll a, ll b) { return a * b % KMOD; }
ll mmul(ll a, ... | C++ | 8b57854277fb7baead123473a609301d | f1d34a7b8165eb74f5c209f8d9c5b384 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(v) (v).begin(), (v).end()
using ll = long long;
ll KMOD = 998244353;
// ============== ADD MULTIPLY SUBTRACT POWER ============= */
ll madd(ll a, ll b) { return (a + b) % KMOD; }
ll mmul(ll a, ll b) { return a * b % KMOD; }
ll mmul(ll a, ... | C++ | 8b57854277fb7baead123473a609301d | e65d8b4585f11bf720888bda705aa9b3 | 2,000 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
using namespace std;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = pair<LL, LL>;
using TP = tuple<int, int, int>;
#define all(x) x.begin(),x.end()
#define mst(x,v) memset(x,v,sizeof(x))
#define... | C++ | 8b57854277fb7baead123473a609301d | 60bbd0c6509e279ada76aa5c9a5d8bdf | 2,000 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
using namespace std;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = pair<LL, LL>;
using TP = tuple<int, int, int>;
#define all(x) x.begin(),x.end()
#define mst(x,v) memset(x,v,sizeof(x))
#define... | C++ | 8b57854277fb7baead123473a609301d | f3d013aa2b99cc1daa65580d23b66bd3 | 2,000 | PASSED |
//
#ifndef __SIZEOF_INT128__
#define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
... | C++ | 8b57854277fb7baead123473a609301d | 9dea0dde304872f36a6f736f04ce1447 | 2,000 | PASSED |
// Author: Aaron He
// Created: 22 November 2022 (Tuesday)
#include <iostream>
#include <vector>
using namespace std;
#include <iostream>
#include <cassert>
#include <vector>
class Mint {
private:
int val = 0;
// Choose mod then hit Ctrl-o
//static const int mod = 1e9 + 7;
static const int mod = ... | C++ | 8b57854277fb7baead123473a609301d | b288d03d5f3f3c574c1b36ee24a18c20 | 2,000 | PASSED |
//const int MOD = 1e9 + 7;
const int MOD = 998244353;
const int mxN = 3e5;
int add(int a, int b) {
return ((1LL * a + b) % MOD + MOD) % MOD;
}
template <typename Head, typename... Tail>
int add(Head h, Tail... t) {
return add(h, mult(t...));
}
int sub(int a, int b) {
return add(a, -b);
}
int mul... | C++ | 8b57854277fb7baead123473a609301d | 487d8539f85b27443d014f243c91e54a | 2,000 | PASSED |
const int MOD = 998244353;
int add(int a, int b) {
return ((1LL * a + b) % MOD + MOD) % MOD;
}
template <typename Head, typename... Tail>
int add(Head h, Tail... t) {
return add(h, mult(t...));
}
int sub(int a, int b) {
return add(a, -b);
}
int mult(int a, int b) {
return 1LL * a * b % MOD;
}... | C++ | 8b57854277fb7baead123473a609301d | 4e2fef0d4894196152aec8cd79b492bc | 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;
template <typename T>
using ordset = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifdef LOCAL
#include "debug.h"
#endif
con... | C++ | 381a292a15cd0613eafd2f6ddf011165 | e35f773bfd103645b68318b4da8e1484 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int MOD = 1e9 + 7;
void solve(){
int n; cin >> n;
vector<int> cnt(3, 0);
vector<int> v(n);
for(int i = 0; i < n; i++){
int x; cin >> x;
v[i] = x;
cnt[(x % 3)]++;
}
... | C++ | 381a292a15cd0613eafd2f6ddf011165 | 8ff81019f846a2c838dab14a4f9e7fca | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std ;
int n ;
const int N = 1e5 + 10 ;
int a[N], b[N] ;
int color[5] ;
int k ;
int main()
{
cin >> n ;
for (int i = 1; i <= n; i ++ ) cin >> a[i] ;
//((b[i] + b[j]) * (b[i] + b[j]) % 3 + b[i] * b[j] % 3) % 3
//b[i] ^ 2 + b[j] ^ 2
//0 0 -> 0
//0 2 -> 1
//1 ... | C++ | 381a292a15cd0613eafd2f6ddf011165 | e1f4fc4ddb039dac42a477718eef8742 | 1,800 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORD(i, a, b) for (int i = (a - 1);... | C++ | 381a292a15cd0613eafd2f6ddf011165 | 94312541b06ef54ca3ab6790411ebb03 | 1,800 | PASSED |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define ss second
#define YES cout << "YES\n"
#def... | C++ | 381a292a15cd0613eafd2f6ddf011165 | ca5c00d397da521dff180a93e30f5e0a | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL INF = numeric_limits<LL>::max();
int main()
{
ios::sync_with_stdio(false); cin.tie(nullptr);
int n; cin>>n;
map<int, vector<int>> d;
for (int i=0; i<n; i++)
{
int x; cin>>x;
d[x % 3].push_back(i);
}
// (x, y) -> (x +... | C++ | 381a292a15cd0613eafd2f6ddf011165 | aa43c083361f6835e2d745a1ce21dc3a | 1,800 | PASSED |
/*
author:wuzx
*/
#include<bits/stdc++.h>
#define ll long long
#define int long long
#define endl "\n"
#define P pair<int,int>
#define f first
#define s second
using namespace std;
const int inf = 0x3f3f3f3f;
int t;
int n,m,k;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);... | C++ | 381a292a15cd0613eafd2f6ddf011165 | 91983d6a2c530733e2f3fdd607612fe6 | 1,800 | PASSED |
/*
██████╗ █████╗ ██████╗ ██████╗ ██╗ ██╗
██╔════╝██╔══██╗██╔══██╗██╔══██╗╚██╗ ██╔╝
██║ ███████║██████╔╝██████╔╝ ╚████╔╝
██║ ██╔══██║██╔══██╗██╔══██╗ ╚██╔╝
╚██████╗██║ ██║██║ ██║██║ ██║ ██║
╚═════╝╚═╝ ╚═╝╚═╝ ╚═╝╚═╝ ╚═╝ ╚═╝
*/
#include <stack>
#include <cstdlib>
#include <cstdio>
#inc... | C++ | 381a292a15cd0613eafd2f6ddf011165 | f1a19396eddeb5155b445ce49f313cd7 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define endl '\n'
void solve() {
int n;
cin >> n;
vector<int>s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
int temp = 0;
while (s[i] != 0) {
temp += s[i] % 10;
s[i] /= 10;
}
s[i] = temp;
... | C++ | 381a292a15cd0613eafd2f6ddf011165 | 77885c479d5608e4f2112f3dfd370599 | 1,800 | PASSED |
/*If it doesn't challange you, it won't change you!*/#include<iostream>
#include<set>
#include<vector>
using namespace std;
#define Fast_I_O ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
void solve()
{
int n ;cin >> n ;
int a[n];
int zero =0,one=0;
for(int i=0;i!=n;i++)
... | C++ | 381a292a15cd0613eafd2f6ddf011165 | 3a13d73513d80ad438dcea7136affb8f | 1,800 | PASSED |
#include <bits/stdc++.h>
// tiom4eg's precompiler options
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
// IO settings
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0)
// Quick types
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair <int, int>
... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 7f8040b65f0df099b02028bfcd19621c | 2,100 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,l[100001],r[100001],a[200001],q,w,x,cnt,mx;
map <int, int> mp;
vector <int> ve;
vector <pair <int, int> > v;
signed main(){
ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
cin >> n;
for (int i=0;i<n;i++)
cin >> l[... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 9945631385c91dcc1ab07bafb67a2763 | 2,100 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define rep(i,n) for(ll i=0;i<n;i++)
ll w=32;
ll solve(vector<array<long long,2>>&pos, ll bit) {
static vector<array<long long,2>> fin;
fin.clear();ll ans=0;ll n=pos.size();
... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 88d4113ad9c366caf5ebc8e703b8e55d | 2,100 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define rep(i,n) for(ll i=0;i<n;i++)
ll w=32;
ll solve(vector<array<long long,2>>&pos, ll bit) {
static vector<array<long long,2>> fin;
fin.clear();ll ans=0;ll n=pos.size();
... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | c64db1c37236671385f19a08cf90e939 | 2,100 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define rep(i,n) for(ll i=0;i<n;i++)
ll w=32;
ll solve(vector<array<long long,2>>&pos, ll bit) {
static vector<array<long long,2>> fin;
fin.clear();ll ans=0;ll n=pos.size();
... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 43ef023cecfd26523a4f8d91ee64a6cf | 2,100 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <string>
#define ll long long
#define MAXBIT 30
#define MAXN 100000
using namespace std;
int L[MAXN+1];
int R[MAXN+2];
int Lm[MAXN+2];
int Rm[MAXN+2];
int ans[MAXBIT+2];
int main() {
int N;
cin... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 13208c49e68c3e05c28a3afe64956c00 | 2,100 | PASSED |
// Harsha's code :)
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define reps(i,n) for(int i=0;i<n;i++)
#define debug(x) cout<<#x<<": "<<x<<endl;
#define all(x) (x).begin(),(x).end()
const int INF = LONG_LONG_MAX;
const int M = 998244353;
const int N = 3e5 + 5;
... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | e8e14164a5d2123a622ac9071e08c8a5 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
int t, n, q, x, L[1000005], R[1000005], ans[1000005], mod = 1e9 + 7;
string s;
mt19937_64 rng;
int mul(int x, int y){
if(y == 0) return 1;
int ans = mul(x, y / 2);
if(y % 2 == 0) return (ans... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 92f11c82d8a485e3e0ee5ca596b933cb | 2,100 | PASSED |
// Lights will guide you home
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll int
#define pll pair < ll, ll >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | fb59f2c96f7c9d23dd41f8f80eb1d655 | 2,100 | PASSED |
//cha fen bu shi zi ji xiang de
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define endl '\n'
struct akk {
int i;
int len;
akk() {}
akk(int ii, int ll) {
i = ii;
len = ll;
}
bool operator<(akk temp) {
return len < temp.len;
}
};
void solve() ... | C++ | 2a4838f8be91a542df4df8fd3a9f1cd4 | 6ed488433e4bdada960fb059adcab237 | 2,100 | PASSED |
/*
author: Maksim1744
created: 04.09.2022 19:37:10
*/
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_... | C++ | 46e06827506e86dfbed18f3c0066849a | e9ea5a7e8dbfe5fe83a9b246e58a3de2 | 2,800 | PASSED |
#include <cstdio>
using namespace std;
const long long mod = 998244353;
const int maxn = 100010;
int fa[maxn], siz[maxn];
int find(int);
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1;
long long ans = 1;
for (int i = 1; i < n; i++) {
i... | C++ | 46e06827506e86dfbed18f3c0066849a | 1bec45389613ddbae8b284e2774be3f0 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
int x = 0; bool op = 0;
char c = get... | C++ | 46e06827506e86dfbed18f3c0066849a | 980a661726dd77f2598486ed94d8f1d7 | 2,800 | PASSED |
#include <bits/stdc++.h>
template<typename T>
T power(T a, int b) {
T res = 1;
for (; b; b >>= 1, a *= a)
if (b & 1) res *= a;
return res;
}
template<int mod = 998244353>
struct mint {
typedef long long ll;
int x;
// assume -mod <= x < 2 * mod
int norm(int x) {
... | C++ | 46e06827506e86dfbed18f3c0066849a | e1930531d5a9b3208f53cec8c6019c01 | 2,800 | PASSED |
#include <bits/stdc++.h>
template<class T>
T power(T a, int b) {
T res = 1;
for (; b; b >>= 1, a *= a) {
if (b & 1) {
res *= a;
}
}
return res;
}
template<int mod = 998244353>
struct mint {
typedef long long ll;
int x;
// assume -mod <= x < 2 * mod
int nor... | C++ | 46e06827506e86dfbed18f3c0066849a | 47d3dfe13ac0ab31f8e09163efa6219b | 2,800 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
template<class T>
T power(T a, int b) {
T res = 1;
for (; b; b >>= 1, a *= a) {
if (b & 1) {
res *= a;
}
}
return res;
}
template<int mod = 998244353>
struct Z {
int x;
// assume -mod <= x < 2 * mo... | C++ | 46e06827506e86dfbed18f3c0066849a | 6617aa54c54e07fb7f6dccb7809f1ae9 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define int long long
#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;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define... | C++ | 46e06827506e86dfbed18f3c0066849a | 025fe33eefe2409f3d50cba47655f181 | 2,800 | PASSED |
#include <bits/stdc++.h>
#ifdef ALGO
#include "el_psy_congroo.hpp"
#else
#define DUMP(...)
#define PLOT(...)
#define CHECK(...)
#endif
namespace {
using LL = long long;
template<typename T, typename U> bool enlarge(T& a, U b) { \
return a < b ? (a = b, true) : false; }
template<typename T, typename U> bool minify(T... | C++ | 46e06827506e86dfbed18f3c0066849a | 27d03eac5f5778b325cdd002225a2e7f | 2,800 | PASSED |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int N = 300500, inf = 1e9, mod = 998244353;
int sum(int a, int b) {
a += b;
... | C++ | 46e06827506e86dfbed18f3c0066849a | 7d2643013635e22bf5a32b5298740f8d | 2,800 | PASSED |
# include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
const int mod=998244353;
typedef long long ll;
int fa[100010],sz[100010];
int getF(int x){return fa[x]==x?x:fa[x]=getF(fa[x]);}
int main()
{
int n,u,v,ans=1;
cin>>n;
for(int i=3;i<=2*n-3... | C++ | 46e06827506e86dfbed18f3c0066849a | 2e452224ff6ef4335e869645de865d44 | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long int inversionduringmerge(long double arr[], int leftstat, int rightstart, int leftend, int rightend)
{
if (rightend < rightstart || leftend < leftstat)
return 0;
long int i = leftstat;
long int j = rightstart;
long long int couont... | C++ | ac879e7c63151c50281cebaf09e790df | 1d174d1462d93fc05541aaef5443af21 | 2,400 | PASSED |
#define re return
#define dl '\n'
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Fenwick{
const int n ;
vector<int> tr;
int lowbit(int x){
re x & (-x);
}
void updata(int i, int k){
while(i <= n){
tr[i] += k;
i += lowbit(i);
}
}
int get(int i){
int r... | C++ | ac879e7c63151c50281cebaf09e790df | 5756dab6b06e74c78f2e5b5559b40fc4 | 2,400 | PASSED |
#define re return
#define dl '\n'
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Fenwick{
const int n ;
vector<int> tr;
int lowbit(int x){
re x & (-x);
}
void updata(int i, int k){
while(i <= n){
tr[i] += k;
i += lowbit(i);
}
}
int get(int i){
int r... | C++ | ac879e7c63151c50281cebaf09e790df | f27ac53defc9c5d52e9e33e0336e7084 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct node{
node *l, *r;
int v;
node() : l(NULL), r(NULL), v(0) { }
node(int v) : l(NULL), r(NULL), v(v) { }
};
node *root = new node();
void update(node *p, int l, int r, int i, int x){
if(l==r){
p->v +... | C++ | ac879e7c63151c50281cebaf09e790df | 52d3c4554f4208f04fc81e228266b5a8 | 2,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.