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>
#include <iostream>
#include <algorithm>
using namespace std;
#define jfor for(int j=i+1; j<m; j++)
#define ifor for(int i=0; i<n; i++)
#define iforx for(int i=0; i<x; i++)
#define revfor for(int i=n-1; i>=0; i--)
#define vecsort sort(vec.begin(),vec.end())
#define ivec... | C++ | 9363df0735005832573ef4d17b6a8302 | 0d274f822079e8590da09089a9e2c93d | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <string>
#define ll long long
using namespace std;
int main(){
int t; cin >> t;
vector<string> res;
for(int r=0; r<t; r++){
int j, k, l;
cin >> j >> k >> l;
ll val;
if(j==k){
if(j==1) res.push_back("NO");
else res.... | C++ | 9363df0735005832573ef4d17b6a8302 | 5ad28289cc1a60316d1dc68370ca737a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int t;
cin>>t;
while(t--)
{
ll a,b,k;
cin>>a>>b>>k;
if(a==b && a>1)
{
cout<<"YES\n";
}
else if(a%2==0 && b%2==0)
{
if... | C++ | 9363df0735005832573ef4d17b6a8302 | 0510d8573b88661482a5d968aada842f | 800 | PASSED |
#include<iostream>
using namespace std;
int n;
int l, r, k;
int main()
{
cin >> n;
while(n --)
{
cin >> l >> r >> k;
if(l == r)
{
if(l == 1) cout << "NO" << endl;
else cout << "YES" << endl;
continue;
}
if(l % 2 == 0) l ++;
if(r % 2 == 0) r --;
int ans = (r - l + 2) / 2;
if(an... | C++ | 9363df0735005832573ef4d17b6a8302 | a1ce924335f77d695341b5a12f17d8cb | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin >> t;
while (t--)
{
string result = "YES";
ll l, r, k;
cin >> l >> r >> k;
ll even = 0, odd = 0;
if (l == r)
... | C++ | 9363df0735005832573ef4d17b6a8302 | 5afe36c34e496dd1fdfd63085e6ecf80 | 800 | PASSED |
#include<iostream>
using namespace std;
int T;
int l, r, k;
int main()
{
scanf("%d", &T);
while (T -- )
{
scanf("%d%d%d", &l, &r, &k);
if(l == r && l > 1) printf("YES");
if(l == r && l == 1) printf("NO");
if(r > l)
{
if((r - l) % 2 == 1)
{
if(k >= (r - l + 1) / 2) printf("YES");
else pr... | C++ | 9363df0735005832573ef4d17b6a8302 | 9060be6993bf866ca4f4f5cd9fd08c9e | 800 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | 3c1b4309bbd6e0c9d67af226d98fd9d8 | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | a231f30d1fd499e9123f94435ca4e72c | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | ce303e3ea876cb8fae88b709190493d7 | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | 8fc373952245460921ec1bcb069bc873 | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | 8865df8f1f17802935959de930f35ca4 | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | 29ab98d0a271537bd45f20abe49c5c21 | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | 1667e5d508d95d8f820e279e4c762aaa | 1,400 | PASSED |
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// CF1629C Meximum Array
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#inc... | C++ | 962c4354c936030da78261871dd6d55b | 820784f669a19b8bfd2ebc71ed3886e5 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int a[N],b[N];
bool vis[N];
int n;
map<int,int> num;
void work()
{
num.clear();
vis[0]=false;
scanf("%d",&n);
int cnt=0;
int mex=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
num[a[i]]++;
vis[i]=false;
//... | C++ | 962c4354c936030da78261871dd6d55b | 0482cb321cd4112d08d3d0f73d0ff247 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int a[N],b[N];
bool st[N];
int n,k;
map<int,int> mp;
void solve() {
cin >> n;
k = 0;
mp.clear();
st[0] = false;//多组注意清空
for (int i = 1; i <= n; i++)
cin >> a[i], mp[a[i]]++, st[i] = false;
//map记录数的个数
... | C++ | 962c4354c936030da78261871dd6d55b | b2adbfdd93db95d3a61694f01ba6ed00 | 1,400 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <cstring>
//#include <bits/stdc++.h>
using namespace std;
static struct FastInput {
static constexpr int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE];
size_t chars_read = 0;
size_t buf_pos = 0;
... | C++ | 33e9714f22b603f002d02ef42835ff57 | 88716a0fb05fcbb4cb46e065d519c528 | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <cstring>
using namespace std;
char b1[1024];
char b2[1024];
char b3[1024];
void run_case() {
int n, n2, i, j, v, ans = 0;
cin >> n;
n2 = n+2;
memset(b1, 1, n2);
memset(b2, 1, ... | C++ | 33e9714f22b603f002d02ef42835ff57 | 87565ed37f20ed47aa5cff06bb8b5e10 | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <cstdio>
#include <cstring>
using namespace std;
#define ll long long
char b1[1024];
char b2[1024];
char b3[1024];
void run_case() {
ll n, n2, i, j, v, ans = 0;
scanf("%d", &n);
n2 = n+2;
memset(b1, 1... | C++ | 33e9714f22b603f002d02ef42835ff57 | 9fd1bfccbbe4bf60e9bf62978006712f | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <cstring>
using namespace std;
#define ll long long
char b1[1024];
char b2[1024];
char b3[1024];
void run_case() {
ll n, n2, i, j, v, ans = 0;
cin >> n;
n2 = n+2;
memset(b1, 1, n2)... | C++ | 33e9714f22b603f002d02ef42835ff57 | 7bb60c82fe6dfa622a89e3ea0d4f0a54 | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
void run_case() {
ll n, i, j, v, ans = 0;
cin >> n;
vector<vector<ll>> b(n+2, vector<ll>(n+2, 1LL));
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
cin >> v;
... | C++ | 33e9714f22b603f002d02ef42835ff57 | e11c62816e41ea8afb4dfc873b2d8db6 | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <unordered_set>
using namespace std;
typedef long long ll;
ll mp(ll a, ll b) {
return (a << 32) | b;
}
void run_case() {
ll n, i, j, v, ans = 0, p1, p2, p3, p4;
cin >> n;
unordered_set<... | C++ | 33e9714f22b603f002d02ef42835ff57 | 0adbe755dca4e1c095f725fd2067c302 | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <cstring>
using namespace std;
#define ll long long
ll b[1002][1002];
void run_case() {
ll n, i, j, v, ans = 0;
cin >> n;
memset(b, 1LL, (n+2)*1002*sizeof(ll));
for (i = 1; i <= n; i++)
... | C++ | 33e9714f22b603f002d02ef42835ff57 | f8b2f37e666cd18f2f818b23633b4830 | 2,300 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
void run_case() {
ll n, i, j, v, ans = 0;
cin >> n;
vector<vector<ll>> b(n+2, vector<ll>(n+2, 1LL));
for (i = 1; i <= n; i++)
for ... | C++ | 33e9714f22b603f002d02ef42835ff57 | 23270f4f4ede92584cf0fdfd7b989ad0 | 2,300 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
void run_case() {
ll n, i, j, v, ans = 0;
cin >> n;
vector<vector<ll>> b(n+2, vector<ll>(n+2, 1LL));
for (i = 1; i <= n; i+... | C++ | 33e9714f22b603f002d02ef42835ff57 | 854e1aff6e1effb2754039aa68d735c1 | 2,300 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target ("avx2,bmi,bmi2,lzcnt,popcnt")
#include <iostream>
#include <cstring>
using namespace std;
#define ll long long
void run_case() {
ll n, n_2, n_22, i, ii, j, v, ans = 0;
cin >> n;
n_2 = n+2;
n_22 = n_2*n_2;
ll* b = new ll[n_22];
me... | C++ | 33e9714f22b603f002d02ef42835ff57 | 0bc7a3a663b2b5632beb02bef8aa19c3 | 2,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
#def... | C++ | 32ab22abbbce760be53ea8928876431c | ca55d89a23be0179fcea7eb2f33b7c3e | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
constexpr static long long MOD{1000000007};
long long mpow(long long n, long long x)
{
long long ans{1};
for (n %= MOD; x; x >>= 1) {
if (x & 1)
ans = ans * n % MOD;
n = n * n % MOD;
}
return ans;
}
long long mod_inv(long long... | C++ | 32ab22abbbce760be53ea8928876431c | 6dbb4d7ad895c488e089ad4bf2b085e0 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
constexpr static long long MOD{1000000007};
long long mpow(long long n, long long x)
{
long long ans{1};
for (n %= MOD; x; x >>= 1) {
if (x & 1)
ans = ans * n % MOD;
n = n * n % MOD;
}
return ans;
}
long long mod_inv(long long... | C++ | 32ab22abbbce760be53ea8928876431c | 2fcead04ea7569fbc96e9f001d306408 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
class mint
{
long long n{0};
public:
constexpr static long long mod{1000000007};
mint() = default;
mint(long long _n) : n{(_n % mod + mod) % mod} {}
mint(const mint &) = default;
mint &operator=(const mint &) = default;
operator long long() { r... | C++ | 32ab22abbbce760be53ea8928876431c | 4d9890550214db731f82480366a2f6a2 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
class mint
{
long long n{0};
public:
constexpr static long long mod{1000000007};
mint() = default;
mint(long long _n) : n{(_n % mod + mod) % mod} {}
mint(const mint &) = default;
mint &operator=(const mint &) = default;
operator long long() { r... | C++ | 32ab22abbbce760be53ea8928876431c | 7b8372761adf7a3c1912ccb009b224b3 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
class mint
{
long long n{0};
public:
constexpr static long long mod{1000000007};
mint() = default;
mint(long long _n) : n{(_n % mod + mod) % mod} {}
mint(const mint &) = default;
mint &operator=(const mint &) = default;
operator long long() { r... | C++ | 32ab22abbbce760be53ea8928876431c | 790a0831ebbd3b98f1596e8372735553 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
class mint
{
long long n{0};
public:
constexpr static long long mod{1000000007};
mint() = default;
mint(long long _n) : n{(_n % mod + mod) % mod} {}
mint(const mint &) = default;
mint &operator=(const mint &) = default;
operator long long() { r... | C++ | 32ab22abbbce760be53ea8928876431c | 397b47587adc3ee5d1c0fad3956af24c | 2,400 | PASSED |
#include<bits/stdc++.h>
#define gcd(a,b) __gcd(a,b)
#define debug(x) cout<<#x<<'='<<(x)<<endl
#define setp setiosflags(ios::fixed)<<setprecision
#define IOS ios_base::sync_with_stdio(false),cin.tie(0)
//#define double long double
#define int long long
//#define int unsigned long long
using namespace std;
mt199... | C++ | 32ab22abbbce760be53ea8928876431c | fb91ddaed8526bf2b6a92c51058d16e0 | 2,400 | PASSED |
#include <iostream>
// #include <fstream>
#include <string.h>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <math.h>
#include <set>
#include <map>
#include <iomanip>
#include <queue>
#include <utility>
//g++ --std=c++17 q1.cpp -o q1 &&./q1
using namespace std;
/*s... | C++ | 32ab22abbbce760be53ea8928876431c | 2709bbd4117458db783188912d57aa80 | 2,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// Operator overloads <<, >>
template<typen... | C++ | 32ab22abbbce760be53ea8928876431c | 178b1b59c0ed08cb5f78e1707a23bb78 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define int long long int
#define nl cout<<"\n"
#define Yes cout<<"YES\n"
#define No cout<<"NO\n"
#define scan(arr,n) for(int i=0;i<n;i++) cin>>arr[i];
#define all(a) a.begin(),a.end()
u... | C++ | ee4038a896565a82d2d0d5293fce2a18 | c8204d7ee2d9c7ce8ad8e79b101a1af5 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define gcd(a,b) __gcd(a,b)
#define debug(x) cout<<#x<<'='<<(x)<<endl
#define setp setiosflags(ios::fixed)<<setprecision
#define IOS ios_base::sync_with_stdio(false),cin.tie(0)
//#define double long double
#define int long long
//#define int unsigned long long
using namespace std;
mt199... | C++ | ee4038a896565a82d2d0d5293fce2a18 | fb3356cee5f4e1914374a1ca29d2a2a8 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define gcd(a,b) __gcd(a,b)
#define debug(x) cout<<#x<<'='<<(x)<<endl
#define setp setiosflags(ios::fixed)<<setprecision
#define IOS ios_base::sync_with_stdio(false),cin.tie(0)
//#define double long double
#define int long long
//#define int unsigned long long
using namespace std;
mt199... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 0f34e94955819b732f9de033a3c1f30f | 2,100 | PASSED |
#include<bits/stdc++.h>
#define gcd(a,b) __gcd(a,b)
#define debug(x) cout<<#x<<'='<<(x)<<endl
#define setp setiosflags(ios::fixed)<<setprecision
#define IOS ios_base::sync_with_stdio(false),cin.tie(0)
//#define double long double
#define int long long
//#define int unsigned long long
using namespace std;
mt199... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 5f9d4e4a9b2373a297b997a3d0585569 | 2,100 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<ctime>
#include<queue>
#include<stack>
#include<set>
#include<string>
#include<utility>
using namespace std;
#define ll long long
const int MOD = 1000000007;
const int MAX = 2005;
int ... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 660be8ee39ebc998139412002eb23265 | 2,100 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define vv vector<ll>
#define pii pair<ll,ll>
#define inp(arr, n) for(ll i = 0; i < n; i++) cin >> arr[i]
#define all(v) v.begin(),v.end()
#define print(v) for(auto u:v) cout << u << " "
... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 51e5f5977b302082ecf40f902a5ae37f | 2,100 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define vv vector<ll>
#define pii pair<ll,ll>
#define inp(arr, n) for(ll i = 0; i < n; i++) cin >> arr[i]
#define all(v) v.begin(),v.end()
#define print(v) for(auto u:v) cout << u << " "
... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 8be36c44414b1415e1d2e494b4e9674e | 2,100 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define vv vector<ll>
#define pii pair<ll,ll>
#define inp(arr, n) for(ll i = 0; i < n; i++) cin >> arr[i]
#define all(v) v.begin(),v.end()
#define print(v) for(auto u:v) cout << u << " "
... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 01c3dc70d31c06c046e9c562c1612c36 | 2,100 | PASSED |
/*
author: Mudit Balooja / mudit19258
*/
#include <bits/stdc++.h>
using namespace std;
#define FastIO() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define dbl long double
#define ll long long
#define pb push_back
#define mp make_pair
#define pf push_front
#define ppf pop_front
#de... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 48cdd28060d224114b74b2110aca066c | 2,100 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namesp... | C++ | ee4038a896565a82d2d0d5293fce2a18 | 80814a2e3aaf2342dc45c945b4b89a70 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=6e5+5;
int n,q,tot,cnt,va[N],Log[N],fa[N],dfn[N],dep[N],Min[N][20];
vector<int>E[N];
int get(int x,int y){return dep[x]<dep[y]?x:y;}
void dfs(int u,int Fa){
Min[dfn[u]=++tot][0]=u;
fa[u]=Fa;dep[u]=dep[Fa]+1;
for(auto v:E[u])
if(v!=Fa)dfs(v,u);
}
... | C++ | 0961b402269aa979dede267c457d203b | 5e0933b521c5f4f947708a10803ee7ac | 3,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int N = 300005;
const int M = 700005;
int st[M << 1][22] , dfn[M << 1] , pos[M << 1] , cnt;
int head[M] , ver[M <<... | C++ | 0961b402269aa979dede267c457d203b | 6c67fb883117af06fbaa41c9befa38fc | 3,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll read() {
ll x=0, f=1; char ch=' ';
while(!isdigit(ch)) { ch=getchar(); if(ch=='-') f=-1; }
while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch-48), ch=getchar();
return x*f;
}
int n, q, f[600005], val[600005], dfn[600005], clk, ch[600005][21], dp[6000... | C++ | 0961b402269aa979dede267c457d203b | 5a481701e0f343910e9891a21080635a | 3,100 | PASSED |
#include <bits/stdc++.h>
#define re register int
using namespace std;
int RD(){
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return x*f;
}
const int N=6e5+5;
int n,tot,hd[N],Q,f[N<<1][22],dep[N],dfn[N],rk[N],qwq;
... | C++ | 0961b402269aa979dede267c457d203b | 8bfee546d592073f11431f4af4b35cb0 | 3,100 | PASSED |
#include <bits/stdc++.h>
#define re register int
using namespace std;
const int N=6e5+5;
int n,tot,hd[N],Q,f[N<<1][22],dep[N],dfn[N],rk[N],qwq;
struct edge{int t,nxt;}es[N<<1];
int fa[N],siz[N];
inline int found(int x){return fa[x]==x?x:fa[x]=found(fa[x]);}
inline void merge(int x,int y){
int fx=found(x),fy=f... | C++ | 0961b402269aa979dede267c457d203b | 536c5be0f384f861110bff9fa4d7df5f | 3,100 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=3e5+10,K=25,INF=1e9;
template<class T>
inline void read(T &x)
{
x=0;int f=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getcha... | C++ | 0961b402269aa979dede267c457d203b | 4068e55a477f429ea5036a19e91c94fa | 3,100 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=3e5+10,K=25,INF=1e9;
template<class T>
inline void read(T &x)
{
x=0;int f=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getcha... | C++ | 0961b402269aa979dede267c457d203b | ae71cdd40c26bd9fa7c69484990bda21 | 3,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=6e5+10;
int n,n_,m;
int read(){
int r=0,s=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')
s=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
r=(r<<1)+(r<<3)+(c^48);
c=getchar();
}
return r*s;
}
void write(int x){
if(x<0)
put... | C++ | 0961b402269aa979dede267c457d203b | 8719eb398c468836273e51a29248a1a4 | 3,100 | 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 rz resize
#define pb push_back
using namespace std;
const int maxn = 3e5 + 10, inf = 2e9 + 7;
struct edge { int u, v, w; } e[maxn];
int par[maxn << 1];
inline int find(int x) { retur... | C++ | 0961b402269aa979dede267c457d203b | 7bf5351be91226eab5cf37ed1deb5900 | 3,100 | 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 rz resize
#define pb push_back
using namespace std;
const int maxn = 3e5 + 10, inf = 2e9 + 7;
struct edge { int u, v, w; } e[maxn];
int par[maxn << 1];
inline int find(int x) { ret... | C++ | 0961b402269aa979dede267c457d203b | 02db3ef3af451120dc54a266fdde3362 | 3,100 | PASSED |
#pragma GCC optimize ("O3", "unroll-loops")
// #pragma GCC target ("avx2")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#defin... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 7486243f1b33059dd3c78875a1f23834 | 3,500 | PASSED |
#pragma GCC optimize ("O3", "unroll-loops")
// #pragma GCC target ("avx2")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#defin... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | cf444ff6844739d12d051497fb071d21 | 3,500 | PASSED |
#pragma GCC optimize ("O3", "unroll-loops")
// #pragma GCC target ("avx2")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#defin... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 9836cf37e8ab7f0535e2f371ac10032c | 3,500 | PASSED |
#pragma GCC optimize ("O3", "unroll-loops")
// #pragma GCC target ("avx2")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#defin... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 4e2a74638796e959c5e7458d5edcfa39 | 3,500 | PASSED |
// LUOGU_RID: 93458933
#pragma GCC optimize(0)
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | d9739c24f49554570a53ef2c0280ebe5 | 3,500 | PASSED |
#include<bits/stdc++.h>
#include<sys/time.h>
#define maxn 1510
#define maxq 1010
#define maxm 2520
#define y1 bobaacad
using namespace std;
typedef long long LL;
int sgn(LL a) {return !a?0:(a<0?-1:1);}
int xx[maxm*2],yy[maxm*2],xx2[maxm*2],yy2[maxm*2],tt[maxm*2];
int zz[maxm*2],ll[maxm*2],rr[maxm*2],ii[max... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 8c69b4df71b9156531e1f801f64f9191 | 3,500 | PASSED |
#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 56517fa1bb81ba93e514c4c84ee4cd49 | 3,500 | PASSED |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 5583e56d57f68d7b9c5dc43715f694af | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 1487285985cf900a0da36026ec4ced17 | 3,500 | PASSED |
#include<bits/stdc++.h>
#include<sys/time.h>
#define maxn 1510
#define maxq 1010
#define maxm 2520
#define y1 bobaacad
using namespace std;
typedef long long LL;
int sgn(LL a) {return !a?0:(a<0?-1:1);}
int xx[maxm*2],yy[maxm*2],xx2[maxm*2],yy2[maxm*2],tt[maxm*2];
int zz[maxm*2],ll[maxm*2],rr[maxm*2],ii[maxm... | C++ | 3faa9439bb58b0efb3c5307ed5753fbf | 377a25cce4e381b644939289e79cfa6f | 3,500 | PASSED |
#include <bits/stdc++.h>
//#include <random>
//#include <ctime>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
typedef long long ll;
typedef long doubl... | C++ | 5fe5427f839768215d4129ab83f36778 | a87c55ae8544351de544a601d97a1707 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
int a[n+1];
for(int i=1;i<=n;i++){
cin>>a[i];
}
map<int,vector<int>> map1;
for(int i=1;i<=n;i++){
map1[a[i]].push_back(i);
}
vector<int>a1;
vector<int>a2;
a1.push_back(1);
for(int i=2;i<=n;i++){
... | C++ | 5fe5427f839768215d4129ab83f36778 | 12eda5c16f6b935f1da81f6f15a4f6ac | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N], s[N << 2], flag[N << 2];
#define ls (u << 1)
#define rs (ls | 1)
#define md (L + R >> 1)
void push_up(int u) {
s[u] = min(s[ls], s[rs]);
}
void build(int u, int L, int R) {
if(L + 1 == R) {
if(L) s[u] = 1e8;
else s[u] = 1;
} else {
... | C++ | 5fe5427f839768215d4129ab83f36778 | 4fba18a1e12952e1c0bb8b42cb1bb531 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int s[N << 2], flag[N << 2];
#define ls (u << 1)
#define rs (ls | 1)
#define md (L + R >> 1)
void push_up(int u) {
s[u] = min(s[ls], s[rs]);
}
void build(int u, int L, int R) {
if(L + 1 == R) {
if(L) s[u] = 1e8;
else s[u] = 1;
} else ... | C++ | 5fe5427f839768215d4129ab83f36778 | de34ee7028952c356a95b6b78081542f | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN=127272;
int a[NN],vst[NN];
vector <int> vec;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
int n;cin>>n;
for(int i=1;i<=n;i++) scanf("%d",a+i);
int A=0,B=0;
int ans=0;
for(int i=1;i<=n;i++){
ans++;
... | C++ | 5fe5427f839768215d4129ab83f36778 | 25c0c189db4cd4b45a6d08e96101d26c | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const int INF = 1000000000;
int n, m;
int a[MAXN];
int f[MAXN], last[MAXN];
void solve()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
// Initially, every color does not have its last occurrence.... | C++ | 5fe5427f839768215d4129ab83f36778 | 7b843a184b52708316199c939e6d7139 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const int INF = 1000000000;
int n, m;
int a[MAXN];
int f[MAXN], last[MAXN];
void solve()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
// Initially, every color does not have its last occurrence.... | C++ | 5fe5427f839768215d4129ab83f36778 | 13ddc8a404889ef0dfe3dc9e3241c097 | 2,100 | 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;
typedef long long ll;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::ste... | C++ | 5fe5427f839768215d4129ab83f36778 | 9e7415c1dca9817ec2de581ac6d438ae | 2,100 | PASSED |
// Problem: B2. Painting the Array II
// Contest: Codeforces - Codeforces Round #700 (Div. 1)
// URL: https://codeforces.com/problemset/problem/1479/B2
// Memory Limit: 512 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <b... | C++ | 5fe5427f839768215d4129ab83f36778 | a2ccf1919d2dd444eb3c23b965ec5d56 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6+6;
ll n;
ll a[maxn], b[maxn], c[maxn];
map<ll, ll> mp;
vector<ll> v;
int main()
{
cin >> n;
for(int i = 1; i <= n; i ++)
{
cin >> a[i];
}
for(int i = 1; i <= n;i ++)
{
if(a[i] != a[i-1]) v.push_back(a[i]... | C++ | 5fe5427f839768215d4129ab83f36778 | 049782dd7317470baa07fba238788116 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d",&a)
#define scc(a,b) scanf("%d %d",&a,&b)
#define sccc(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define lsc(a) scanf("%lld",&a)
#define lscc(a,b) scanf("%lld %lld",&a,&b)
#define lsccc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%d"... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 7c21bef0bf63feff54a98f3c8a7313bd | 1,900 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int mxn = 100001;
int n;
int a[mxn], f[2];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 6d44a3c07c4fa9cea93741b3868a0f45 | 1,900 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define f first
#define s second
const int k = 3;
int n;
pii a[k], b[2 * k];
int main(){
ios::sync_with_stdio(0... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 72de59f6db4b0c9392f2c31d464577c1 | 1,900 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'
using namespace std;
const int maxn = 1e5 + 3;
const int inf = 1e9;
int n;
int a[maxn];
void read()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
int tr[maxn * 4], lazy[maxn * 4];
void push(int v, int l, int r)... | C++ | 55f0ecc597e6e40256a14debcad1b878 | ccc65017410253cc56993a962fadcc28 | 1,900 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'
using namespace std;
const int maxn = 1e5 + 3;
int n;
int a[maxn];
void read()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
void solve()
{
stack <int> st1, st2;
for (int i = 1; i <= n; i++)
{
bool ca... | C++ | 55f0ecc597e6e40256a14debcad1b878 | b895805d218a350ee9efbc7ef8271e55 | 1,900 | PASSED |
#include<cstdio>
#include<cmath>
#include<set>
#include<cstring>
#include<vector>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<tuple>
#include<utility>
#include<string>
#include<map>
using namespace std;
using ll=long long;
using str=string;
using vi=vector<ll>;
using pii=pair<ll,ll... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 2229b56fb844f0038ec982ddbb17fe54 | 1,900 | PASSED |
#include<bits/stdc++.h>
// in case i need to use order_of_key () and find_by_order (i th largest elem)
//include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define gnu_set \
// tree<pair<int, int>, null_type, less<pair<int, int> >, \
/... | C++ | 55f0ecc597e6e40256a14debcad1b878 | e9b88f0cfb3b1d8daa03a8103ecc8581 | 1,900 | PASSED |
#include<bits/stdc++.h>
// in case i need to use order_of_key () and find_by_order (i th largest elem)
//include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define gnu_set \
// tree<pair<int, int>, null_type, less<pair<int, int> >, \
/... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 35953f4759a8d5c4263c5fe32dafb1df | 1,900 | PASSED |
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii = pair<int, int>;
const int NN = 101010;
int a[NN];
int b[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in ","r ",stdin);
freopen("out.out ","w ",stdout);
#endif
int n; cin>>n;
for(int i=1; i<=n; i++) scanf("%d", a+i);... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 26370edd62d3162fba6dce396f344c3e | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
// freopen("out.out", "w", stdout);
#endif
int n, m; cin >> n;
for(int i = 0; i < n; i ++) {
scanf("%d", a + i);
}
for(int i = m = 0; i < n; i ++) {
if(m < 2 || b[m - 1] != a[i... | C++ | 55f0ecc597e6e40256a14debcad1b878 | 323bef3a4fb29bb42f3b6858260f0d22 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 5;
int n, q, a[N], d[N], up[N][19], c[N], K, ver[N], cnt[N], bl[N], ct[N];
int tin[N], tout[N], timer;
vector <int> adj[N];
struct Query {
int l, r, lca, i, cl, cr, mda;
} req[N];
void Add(int x) {
x = ver[x];... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 27cb007912e6a5432c3cf146c0400795 | 2,900 | PASSED |
/// Cum e ba asta asa rapid
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300010;
const int MAXK = 20;
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int n, q;
int a[MAXN];
uint64_t h[MAXN];
vector<int> v[MAXN];
int pre[MAXN][MAXK];
int dis[MAXN];
stru... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 59ac05c48328712daa35162f6ea88912 | 2,900 | PASSED |
/// Asta e cea mai buna
#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 int NMAX = 300001;
const ll VMAX = 10;
cons... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 32476698f46576149efb22b69a08962b | 2,900 | PASSED |
/// Asta e cea mai buna
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#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 int NMAX = 300... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 8c2acb33a776ac497ef898da107a4044 | 2,900 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;
const ll NMAX = 300001;
const ll VMAX = 10;
c... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 72ea007da985ba820679eb63925bcefa | 2,900 | PASSED |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
// #define int long long
const int N=3e5+5,block=1000;
int n,m;
int col[N];
basic_string<int>e[N];
int fa[N],dep[N],sz[N],hson[N];
int dfn[N],top[N],Index;
int st[N],ed[N],ol[N<<1];
inline void dfs1(int u)
{
dep[u]=dep[fa[u]]+1;
sz[u... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | e2316c10fefee2b5fcba8658f9733eb7 | 2,900 | PASSED |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
// #define int long long
const int N=3e5+5,block=1000;
int n,m;
int col[N];
basic_string<int>e[N];
int fa[N],dep[N],sz[N],hson[N];
int dfn[N],top[N],Index;
int st[N],ed[N],ol[N<<1];
inline void dfs1(int u)
{
dep[u]=dep[fa[u]]+1;
sz[u... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 3ad0dcc2ba514d6cbfd50f10e320e84d | 2,900 | PASSED |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
// #define int long long
const int N=3e5+5,block=1000;
int n,m;
int col[N];
basic_string<int>e[N];
int fa[N],dep[N],sz[N],hson[N];
int dfn[N],top[N],Index;
int st[N],ed[N],ol[N<<1];
inline void dfs1(int u)
{
dep[u]=dep[fa[u]]+1;
sz[u... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 2d8bb865361f21bfc194ffb4643ca50a | 2,900 | PASSED |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
// #define int long long
const int N=3e5+5,block=1000;
int n,m;
int col[N];
basic_string<int>e[N];
int fa[N],dep[N],sz[N],hson[N];
int dfn[N],top[N],Index;
int st[N],ed[N],ol[N<<1];
inline void dfs1(int u)
{
dep[u]=dep[fa[u]]+1;
sz[u... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 054e86787d5bcc9faec21bfb89c50b5f | 2,900 | PASSED |
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=4e5+5,block=1000;
int n,m;
int col[N];
basic_string<int>e[N];
int fa[N],dep[N],sz[N],hson[N];
int dfn[N],top[N],Index;
int st[N],ed[N],ol[N<<1];
inline void dfs1(int u)
{
dep[u]=dep[fa[u]]+1;
sz[u]=1... | C++ | 3b452aca045bcf88d22520f1d2b10ac5 | 855e40bace1455f025db2b713e6212a6 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<tuple<int, int, int>> edges;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n_test = 1;
// cin >> n_test;
while (n_test--) {
int L, R, n = 23;
cin >> L >> R;
R -= L;
... | C++ | 86dd4550594a49f682f6bf2e950919f2 | a1a1eb47b3cd4f97b82bdbd1ebdf9a2c | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define llong long long
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#ifdef testing/*{{{*/
mt19937 rng(177013);
#else
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#endif
... | C++ | 86dd4550594a49f682f6bf2e950919f2 | c1cdb205f87a22f4af8a051e539e3c9b | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false);cin.tie(0)
int id[50];
int e[50][50];
int main() {
IO; //freopen("in.txt", "r", stdin);
int l, r; cin >> l >> r;
int n = 21, m = 0;
int ori = n;
for(int i = 0; i < n; ++i) {
id[i] = i + 2;
... | C++ | 86dd4550594a49f682f6bf2e950919f2 | e8fc0a68eb9b18db5a0a6683e3cb38de | 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)h++;a.push_back({1, 22, 1}); a.push_back({22, 23, r-1});
for(... | C++ | 86dd4550594a49f682f6bf2e950919f2 | ff46e232cdafc1081ce9258a2bfef8e9 | 2,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.