source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dep(i,a,b) for(int i=(a);i>=(b);--i)
#define lowbit(x) (x&(-x))
#define debug(x) cout<<#x<<" :"<<x<<endl
#define debug1(x) cout<<#x<<" :"<<x<<" "
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef doubl... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | 78e82f5ec91a572d0e1782ef39592e51 | 2,600 | PASSED |
#include <bits/stdc++.h>
#include <unistd.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define pie 3.141592653589793238
#define ll long long
#define ld long double
#define vll vector<ll>
#define pl... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | 726f0a156765ea5e1f5b3ff5d1978b4c | 2,600 | PASSED |
#include<bits/stdc++.h>
// g++ -std=c++17 -Wl,-stack_size -Wl,0x10000000 main.cpp
#define mt make_tuple
#define mp make_pair
#define pu push_back
#define INF 1000000001
#define MOD 1000000007
#define EPS 1e-6
#define ll long long int
#define ld long double
#define fi first
#define se second
#define all(v) v... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | c45f3d71430a679ca00ba16ab7a1aab5 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
char s[2000005];
int l[2000005],del[2000005];
int r[2000005];
int main(){
scanf("%d",&n);
scanf("%s",s+1);
for(int i=1;i<=n;i++)
l[i]=s[n-i+1]-'0';
scanf("%s",s+1);
for(int i=1;i<=n;i++)
r[i]=s[n-i+1]-'0';
del[1]=r[1];
del[2]=r[2]-1;
for(... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | 307a50d4348a9c5cbb5169db4397fe74 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define P pair<int,int>
#define PI acos(-1.0)
#define ls o<<1
#define rs o<<1|1
using namespace std;
const int mod=998244353;
const int base=19260817;
const LL INF=1e18;
const int maxn=1e5+10;
const double eps=1e-8;
inline int ... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | eee4ddf8b2eb1cb54f25efbc6a70b80d | 2,600 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
using namespace std;
string l, r, zero, one;
int n;
int check()
{
if (l == r) return 0;
for (int i = n - 1; i >= 0; --i)
{
if (l[i] == '1') l[i... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | e3758381a5687cb94a338aad819fa617 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int i,n;
char l[1000100],r[1000100];
int main(){
scanf("%d%s%s",&n,l+1,r+1);
if (l[1]!=r[1]){
for (i=1;i<=n;i++) printf("1");
return printf("\n"),0;
}
if ((r[n]&1)||n==1) return printf("%s\n",r+1),0;
l[n-1]++;
for (i=n-1;i>0;i--)
if (l[i]>'1')
l... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | 2ac7ab7e4a4a02466ca0632aa499cd9d | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
string a,b;
long long n,cnt1,A[1000005],C[1000005],B[1000005];
bool PD,Pd,Pd2;
int main()
{
cin>>n;
cin>>a;
cin>>b;
for(int i=0;i<n;i++)
{
A[i+1]=a[i]-'0';
C[i+1]=A[i+1];
}
C[n]++;
for(int i=n;i>=1;i--)if(C[i]>=2)C[i-1]++,C[i]=0;
for(int i=0;i<n... | C++ | 1925187d2c4b9caa1e74c29d9f33f3a6 | 77cda0bbd84721b34b1fc8e73d213127 | 2,600 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | 725f45bba5561ea60211ea000b7be36f | 2,500 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | a1f26a13d37084902f55831a982cb247 | 2,500 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | 9d2adc2dc181182396c1b93f35bd3772 | 2,500 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | 45faab203e59bf15c64721f526d0daf5 | 2,500 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | 3cb359fc365b505287cfc9ec6f7049d5 | 2,500 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | 415ddc9fb11a3225ef483950d8227349 | 2,500 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | ea8f191447a4089e211a17bccced97dc | a99d82952941d4fae75e74884e4842af | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 205,P = 1e9+7;
int dp[N][N<<1][N<<1];//一共操作数为i，涉及到的数的个数为j，选到k长度的方案数目
int frac[N<<1],inv[N<<1],ans[N],n,k;
unordered_map<long long,int> mp;
inline void Inc(int &a,int b)
{
a = (a + b) % P;
}
inline int Mul(int a,int b)
{
return (long long... | C++ | ea8f191447a4089e211a17bccced97dc | 38a8da769479b8db89ebca9550de4230 | 2,500 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const int INF = 1e9; const ll INFLL = ... | C++ | ea8f191447a4089e211a17bccced97dc | 7c7f1682b60ca7160d3b2070371a6c89 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const int INF = 1e9; const ll INFLL = 1e18;
ll binPow(ll base, ll exp) {
ll ans = 1;
while(exp) {
if(exp%2) {
ans = (ans*base)%MOD;
}
exp >>= 1;
base = (base*base)%MOD;
}
return ans;
}... | C++ | ea8f191447a4089e211a17bccced97dc | 761645085a7510788d560c4b82e03787 | 2,500 | PASSED |
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define nl '\n'
#define ll long long
#define cin(vec) \
for (auto ... | C++ | 6854ad3597f9f41d475aacb774b823ed | 981bd305e7f9e5ea5a7e22135c3a28ab | 800 | PASSED |
//" قُلْ إِنَّ الْأَمْرَ كُلَّهُ لِلَّهِ"
//"يُؤْتِكُمْ خَيْرًا مِّمَّا أُخِذَ مِنكُمْ"
//استعن بالله ولا تعجز
#include <bits/stdc++.h>
#define fast cin.tie(0); cin.sync_with_stdio(0); cout.tie(0);
#define all(s) (s).begin(),(s).end()
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define OO 2e9
#define ll lon... | C++ | 6854ad3597f9f41d475aacb774b823ed | 1afc0fd0ac992e5f30ba326fa08778dd | 800 | PASSED |
#include <bits/stdc++.h>
#include<iostream>
#include <cstdlib>
#include<iomanip>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t;
cin>>t;
int n,m;
while(t--)
{
cin>>n>>m;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int i=0;
... | C++ | 6854ad3597f9f41d475aacb774b823ed | 25de55b517f865ee1172a9d1faedaec1 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
int n,k; cin>>n>>k;
vector <int> v(n);
for(auto &i : v)
cin>>i;
for(int i=0 ; i<n-1 ; i++)
{... | C++ | 6854ad3597f9f41d475aacb774b823ed | 530c5dc48cf8484ca0b0fb9207ec1e7e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define nn '\n'
#define print(x) for(auto i:x) {cout << i<< " ";} cout << nn;
#define ll long long
#define ld long double
#define pb push_back
#define foor(n) for(int i = 0; i<n; i++)
#define read(a) for(auto &i: a) cin ... | C++ | 6854ad3597f9f41d475aacb774b823ed | 5f7c74f56a5d3f3a754a904ab6e48e86 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int ;
class TC{
public :
void solve(){
int n , k ; cin >> n >> k ;
vector<int> v(n) ;
for(auto &x : v) cin >> x;
for(int i = 0 ; i < n - 1 && k; i ++){
int can_remove = min(v[i], k ) ;
k... | C++ | 6854ad3597f9f41d475aacb774b823ed | 93ac2a5d16e1407936cd4ca8fcef81d5 | 800 | PASSED |
#include<bits/stdc++.h>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
//G
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while(t--){
int n, k;
cin >> n >> k;
... | C++ | 6854ad3597f9f41d475aacb774b823ed | 9663b9446f560aa443880d874f343a1d | 800 | PASSED |
#include <bits/stdc++.h>
int main() {
int t;
std::cin>>t;
while(t--){
int n,k;
std::cin>>n>>k;
std:: vector<int>a(n);
for(int i=0;i<n;i++){
std:: cin>>a[i];
}
for(int i=0;i<n-1;i++) {
while (k > 0 && a[i] > 0) {
k--;
... | C++ | 6854ad3597f9f41d475aacb774b823ed | 6f21fe7450c7993588bfb5c169f703e2 | 800 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main () {
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
vector<int>vec(n);
for (int i = 0; i <n ; ++i) {
cin>>vec[i];
}
for (int i = 0; i <n-1 ; ++i) {
while (k>0 &... | C++ | 6854ad3597f9f41d475aacb774b823ed | c39501ad2c4e48b77f61e7c65f693c4a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int ;
class TC{
public :
void solve(){
int n , k ; cin >> n >> k ;
vector<int> v(n) ;
for(auto &x : v) cin >> x;
for(int i = 0 ; i < n - 1 && k; i ++){
int can_remove = min(v[i], k ) ;
k... | C++ | 6854ad3597f9f41d475aacb774b823ed | 944b5086ec472c709c3b324316e5d913 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pi (3.141592653589)
#define ll long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rev greater<int>()
ll a[5000007],b[5000007],primes[5000007];
ll mod=1e9+7;
vector<ll>primefactors;
unordere... | C++ | 4004c77b77076bf450cbe751e025a71f | f0dcad662cda40375ad1e7b446df203d | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pi (3.141592653589)
#define ll long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rev greater<int>()
ll a[5000007],b[5000007],primes[5000007];
ll mod=1e9+7;
vector<ll>primefactors;
unordere... | C++ | 4004c77b77076bf450cbe751e025a71f | e8df756b7d76febaf7fe1be06ecd875b | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define memo ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define md 1000000007
void solve()
{
int n;cin>>n;
int a[n];
for(int&i:a)cin>>i;
int ans=0;
for(int i=0;i<n;i++)
{
ans^=a[i];
}
if(ans==0)... | C++ | 4004c77b77076bf450cbe751e025a71f | 59260d401e7d6a6787049f0a84c6c0a5 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define memo ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define md 1000000007
bool solve()
{
int n;
cin>>n;
int a[n];
for(int&i:a)cin>>i;
int b=0;
int ans=0,cnt=0;
for(int i=0;i<n-1;i++)
{
ans^=... | C++ | 4004c77b77076bf450cbe751e025a71f | 39fdf52f64f4b1dfd3fe33c0b042a15e | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int t;
cin>>t;
int cnt=0;
bool isTest7=0;
while(t--)
{
int n;
cin>>n;
long long arr[n];
for(int i=0; i<n; i++)
cin>>arr[i];
long long xorleft[n];
long long x... | C++ | 4004c77b77076bf450cbe751e025a71f | 2c8489c201a91aea5e50b6cab91ba815 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int pre[2005];
int main()
{
int t;
scanf("%d",&t);
while (t--)
{
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
int a;
scanf("%d",&a);
pre[i]=(pre[i-1]^a);
}
... | C++ | 4004c77b77076bf450cbe751e025a71f | c19035b65f7fd66951c48e7a09fcd9e9 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
long long arr[n];
for(int i=0; i<n; i++)
cin>>arr[i];
long long xorleft[n];
long long xorright[n];
long long tmp;
... | C++ | 4004c77b77076bf450cbe751e025a71f | 5f036cf1d8191883ef502d8fe6b3d024 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
deque<long long> numbers;
deque<long long> build;
bool ans;
int cnt =0;
int sz;
bool IsEqual()
{
if(cnt <2)
return false;
for(int i =0 ; i <(int)build.size() ; i ++)
if(build[i] !=numbers[i])
return false;
r... | C++ | 4004c77b77076bf450cbe751e025a71f | 2a11f79fdd2877912b311121fc488668 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
deque<long long> numbers;
deque<long long> build;
bool ans;
int cnt =0;
int sz;
bool IsEqual()
{
if(cnt <2)
return false;
for(int i =0 ; i <(int)build.size() ; i ++)
if(build[i] !=numbers[i])
return false;
r... | C++ | 4004c77b77076bf450cbe751e025a71f | 13c1731a04d92ad8cba875a5ad428bc5 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
int z =1;
//SieveOfEratosthenes();
while(t--){
//cout<<"Case #"<<z<<": ";
int n;
cin>>n;
int a[n];
int x =0;
for(int i =0; i<n; i++){
c... | C++ | 4004c77b77076bf450cbe751e025a71f | b1d525847262b6c46d9cb5e9be929ab4 | 1,500 | PASSED |
///Dux
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define reset(a) memset(a, 0, sizeof(a))
#define For(i,a,b) for(int i=a; i<=b; i++)
#define Fod(i,a,b) for(int i=a; i>=b; i--)
#define NMAX 100005
#de... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 1e6b229f6a7bdefa8b26edf8700e6e2b | 2,100 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define PR pair<LL,int>
using namespace std;
int n,a[100010],q,prime[100100],tot,nex[100010],st[30][100010],_2[30],num[100050];
vector<int> e[100010];
bool isp[100050];
void Prime(){
isp[1]=1;
for (int i=2;i<=100005;++i) {
if (!isp[i]) prime[++tot] ... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 453c60d07fd21a0d49b98072433068b1 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define PR pair<LL,int>
using namespace std;
int n,a[100010],q,prime[100100],tot,nex[100010],st[30][100010],_2[30],num[100050];
vector<int> e[100010];
bool isp[100050];
void Prime(){
isp[1]=1;
for (int i=2;i<=100005;++i) {
if (!isp[i]) prime[++tot] ... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 3e98d615f2c608dd9cd4aed390542607 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define PR pair<LL,int>
using namespace std;
int n,a[100010],q,prime[100100],tot,nex[100010],st[30][100010],_2[30],num[100050];
vector<int> e[100010];
bool isp[100050];
void Prime(){
isp[1]=1;
for (int i=2;i<=100005;++i) {
if (!isp[i]) prime[++tot] ... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 18c51ddf2530c25ae5c4a4165f27d0d1 | 2,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define LL long long
#define PR pair<LL,int>
using namespace std;
const int kN = 1e5;
int n, a[kN + 10], q;
int prime[kN + 10], tot;
int nex[kN + 10], st[30][kN + 10];
int _2[30], num[kN + 10];
vector<... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 13fc5cfb6a3a32fd66ab4a8fdf7d0606 | 2,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define LL long long
#define PR pair<LL,int>
using namespace std;
const int kN = 1e5;
int n, a[kN + 10], q;
int prime[kN + 10], tot;
int nex[kN + 10], st[30][kN + 10];
int _2[30], num[kN + 10];
vector<... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | d5cc394ad8e34d3a4dc7b0cd1188cb27 | 2,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define LL long long
#define PR pair<LL,int>
using namespace std;
const int kN = 1e5;
int n, a[kN + 10], q;
int prime[kN + 10], tot;
int nex[kN + 10], st[30][kN + 10];
int _2[30], num[kN + 10];
vector<... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | a7c946d56322b93a3700619e54c0b8e8 | 2,100 | PASSED |
#include <bits/stdc++.h>
#define maxx 100109
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define db double
#define ll long long
#define lb lower_bound
#define up upper_bound
using namespace std;
const ll oo=1e5;
int n,q,a[maxx],nex[maxx],d[maxx],last[maxx],dp[25][maxx];
... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 13d3c2cd42522fdec4f0ba79f8f40c70 | 2,100 | PASSED |
/* Code Information
* Author: little_skqliao
* Time: 2021-04-21 21:35:54
* Source: https://codeforces.com/contest/1516/problem/D
* Problem:
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
int N, Q;
int A[MAXN];
bitset<MAXN> isnPri;
vector<int> p... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | 5ecb96bb79b45989020c2715357269ff | 2,100 | PASSED |
/* Code Information
* Author: little_skqliao
* Time: 2021-04-21 21:35:54
* Source: https://codeforces.com/contest/1516/problem/D
* Problem:
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
int N, Q;
int A[MAXN];
int F[20][MAXN], Nxt[MAXN];
vector... | C++ | 59e45a82cdafd64e0bf2a199cb08bbb9 | d0ccb2ad0bc50450dca6b0590fb5e925 | 2,100 | PASSED |
#include <stdio.h>
#include <string.h>
#define N 15000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int ftmn[N];
void update_mn(int i, int n, int x) {
while (i < n) {
ftmn[i] = min(ftmn[i], x);
i |= i + 1;
}
}
int que... | C++ | b3b8121400ef9f4811d4461c81f141d6 | 7293c33d46c89df654374ba138c0364c | 3,400 | PASSED |
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int>... | C++ | b3b8121400ef9f4811d4461c81f141d6 | c5486c679ca4901be1a031bd46008175 | 3,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 15100;
const int MAXS = 350;
const int B = 600;
const int C = 60;
int N;
int arr[MAXN];
int loc[MAXN]; // inverse of arr
int dp[MAXN][MAXS][2]; // 0 = lo end, 1 = hi end
void gogo()
{
for (int i = 0; i < MAXN; i+... | C++ | b3b8121400ef9f4811d4461c81f141d6 | 049736607b4d3ecbf10a933c3ea8b64b | 3,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define vi vector < int >
#define sz(a) ((int) a.size())
using namespace std;
const int N = 15007, B = 300, inf = 1e9;
int n;
struct fwt { // 单点 add, 后缀 min
in... | C++ | b3b8121400ef9f4811d4461c81f141d6 | b8f8c67d69c55309d46b89fb1e7a1704 | 3,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define vi vector < int >
#define sz(a) ((int) a.size())
using namespace std;
const int N = 15007, B = 500, inf = 1e9;
int n;
struct fwt { // 单点 add, 后缀 min
in... | C++ | b3b8121400ef9f4811d4461c81f141d6 | 31d7bc8f804f83f8ae324812af5cb153 | 3,400 | PASSED |
//submit on luogu?bug
#include <bits/stdc++.h>
using namespace std;
const int N=500005;
int n,a[N],mx[N][25],mi[N][25],pmx[N][25],pmi[N][25],Log[N];
int lmin[N],rmin[N],lmax[N],rmax[N];
int getmin(int l,int r)
{
int x=Log[r-l+1];
return min(mi[l][x],mi[r-(1<<x)+1][x]);
}
int getmax(int l,int r)
{
int x=... | C++ | 2592836c1457efda9ad333524abfdf56 | 0909d8c9644d2f18fd8b5c791aec8ac0 | 1,900 | PASSED |
//submit on luogu
#include <bits/stdc++.h>
using namespace std;
const int N=500005;
int n,a[N],mx[N][25],mi[N][25],pmx[N][25],pmi[N][25],Log[N];
int lmin[N],rmin[N],lmax[N],rmax[N];
int getmin(int l,int r)
{
int x=Log[r-l+1];
return min(mi[l][x],mi[r-(1<<x)+1][x]);
}
int getmax(int l,int r)
{
int x=Log[... | C++ | 2592836c1457efda9ad333524abfdf56 | 799e115069f7babe534efec34310e615 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N=500005;
int n,a[N],mx[N][25],mi[N][25],pmx[N][25],pmi[N][25],Log[N];
int lmin[N],rmin[N],lmax[N],rmax[N];
int getmin(int l,int r)
{
int x=Log[r-l+1];
return min(mi[l][x],mi[r-(1<<x)+1][x]);
}
int getmax(int l,int r)
{
int x=Log[r-l+1];
return ma... | C++ | 2592836c1457efda9ad333524abfdf56 | da5ef626d85d454648f6a16cd37e0033 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define maxn 300005
using namespace std;
int n;
int a[maxn],pos[maxn],rmax[maxn],rmin[maxn];
int s[maxn],top;
void init(){
top=0,s[0]=n+1; for(int i=n;i>=1;i--){while(top && a[i]<a[s[top]])top--;rmin[i]=s[top]-1,s[++top]=i;}
top=0,s[0]=n+1; for(int i=n;i>=1;i--){while(top && a[i]>a[s[t... | C++ | 2592836c1457efda9ad333524abfdf56 | 7312dd6c6049904b35e46a6ff008dda5 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define maxn 300005
using namespace std;
int n;
int a[maxn],pos[maxn],rmax[maxn],rmin[maxn];
int s[maxn],top;
void init(){
top=0,s[0]=n+1; for(int i=n;i>=1;i--){while(top && a[i]<a[s[top]])top--;rmin[i]=s[top]-1,s[++top]=i;}
top=0,s[0]=n+1; for(int i=n;i>=1;i--){while(top && a[i]>a[s[t... | C++ | 2592836c1457efda9ad333524abfdf56 | 5f3fd32c0e34b5e0100af2d2caa54cdd | 1,900 | PASSED |
#pragma warning(disable:4996)
#include<stdio.h>
#include<algorithm>
using namespace std;
int n, m, a[300005], maxSuffix[300005], minSuffix[300005];
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
maxSuffix[n] = minSuffix[n] = a[n];
for (int i = n - 1; i >= 1; i--) ... | C++ | 2592836c1457efda9ad333524abfdf56 | 69a72dc4bbceb60558eb4e12dbd19605 | 1,900 | PASSED |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<bitset>
using namespace std;
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
int n, m, a[300005], maxSuffix[300005], minSuffix[300005];
void solve() {
cin >> n;
for (int i = 1;... | C++ | 2592836c1457efda9ad333524abfdf56 | 500e8879cb9be2985362ff8bc22b52fa | 1,900 | PASSED |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<bitset>
using namespace std;
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
int n, m, a[300005];
int maxPrefix[300005], maxSuffix[300005], minPrefix[300005], minSuffix[300005];
i... | C++ | 2592836c1457efda9ad333524abfdf56 | 8ceda562f9751c8e85a9cab66dbc831e | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
namespace IO {
template <typename T>
inline void read(T &x) {
x = 0; T r = 1;
char ch = getchar();
while (!isdigit(ch)) r = ch == '-' ? -1 : 1, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
... | C++ | 2592836c1457efda9ad333524abfdf56 | b35c60849ab191fc32030bf5b958f548 | 1,900 | PASSED |
#include <iostream>
#include <math.h>
using namespace std;
int a[500005];
int pos[500005];
int n;
int min_v[2][500005];
int max_v[2][500005];
int solve(int l, int r, int flag) {
if (l == r) return 0;
if (l + 1 == r) return 1;
bool ff = false;
if (l == 1 && r == n) {
if (a[l] == n) ff = false;
... | C++ | 2592836c1457efda9ad333524abfdf56 | 5f2e7e2d4caa3c76c0f34bce191763ce | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(un... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 6987df909d34d614d876593f78aedb87 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc secon... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | cc8ca96e668f835e3dd02b0524dc9f2e | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc secon... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 1c717f693f30049d9e9b0668b2470a1c | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc secon... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 4790c8ad1d124157e0f102ecabc0b531 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc secon... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | d1891e2b0104e8756a69499028abea34 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc secon... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 5ee600c22ebea23656fd4cfb3b268b69 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(un... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 4956d43cc663042ed9ef30c14dae37b8 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(un... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 0dd6f2dc37601ccc82edd97e9eb19916 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//=======================================================================================//
#define int long long
// #define ll long long
#define pb push_back
#define sze ... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 1edec7b500e2cc2dbb028450974d25a0 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int> nums(n);
int check=0;
for(int i=0;i<n;i++){
cin>>nums[i];
}
... | C++ | da3d1b2615d51044a7b43bd0ce939f4c | 7f75ee51a631a6d72d7aa6778d723e13 | 900 | PASSED |
#include<iostream>
#include<stack>
#include<string>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<cassert>
using namespace std;
#ifdef LOCAL
#include "gogo/dbg.h"
#else
#define dbg(...) 55
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i... | C++ | bb6168528e04156f68bde2ffc1ba828f | 501d82d89e60ecb7fedc2ecd60f01a47 | 800 | PASSED |
#include<bits/stdc++.h>
#ifdef _qwertyuiop
#include "gogo/dbg.h"
#else
#define dbg(...) 55
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<... | C++ | bb6168528e04156f68bde2ffc1ba828f | bfe5df9be1d38c55b5a3a46310cb3061 | 800 | PASSED |
#include<bits/stdc++.h>
#ifdef _qwertyuiop
#include "gogo/dbg.h"
#else
#define dbg(...) 55
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<... | C++ | bb6168528e04156f68bde2ffc1ba828f | b46a861fc18324eb291be1e4dc61e99b | 800 | PASSED |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "gogo/dbg.h"
#else
#define dbg(...)
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;... | C++ | bb6168528e04156f68bde2ffc1ba828f | a3a972f6c4051aef226aa92e82cdd380 | 800 | PASSED |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "../../dbg.h"
#else
#define dbg(...) 55
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll... | C++ | bb6168528e04156f68bde2ffc1ba828f | 2df00a88d4a3fba39cc16cafac9d69d3 | 800 | PASSED |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "asdfg/../dbg.h"
#else
#define dbg(...) void(0)
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pa... | C++ | bb6168528e04156f68bde2ffc1ba828f | 606688b6cbc83aafcfe2b741633a54d2 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dbg.h"
#else
#define dbg(...) void(0)
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int>pi;
typedef... | C++ | bb6168528e04156f68bde2ffc1ba828f | 5476b74d8af72f652482201e4b2a11ff | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#ifndef LOCAL
#define debug(...) 55
#else
#include "../../debug.h"
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<... | C++ | bb6168528e04156f68bde2ffc1ba828f | 844b77fad560e7397f9462b64e396551 | 800 | PASSED |
#include<bits/stdc++.h>
#ifndef LOCAL
#define debug(...) 55
#else
#include "../../debug.h"
#endif
#define sz(x) (int)(x).size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<... | C++ | bb6168528e04156f68bde2ffc1ba828f | bd2ee0f4edd3e01d99a9c145c1108d08 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int t;
cin>>t;
for(int k=0; k<t; k++){
ll n,z;
cin>>n>>z;
ll arr[n];
for(int i=0; i<n; i++){
ll a;
cin>>a;
arr[i]=a;
}
ll ans=0... | C++ | bb6168528e04156f68bde2ffc1ba828f | 45e089dc3c1fabbd7b2d66451127ca07 | 800 | PASSED |
#include <bits/stdc++.h>
#define fi first
#define se second
#define forn(i,n) for(int i=0; i< (int)n; ++i)
#define for1(i,n) for(int i=1; i<= (int)n; ++i)
#define fore(i,l,r) for(int i=(int)l; i<= (int)r; ++i)
#define ford(i,n) for(int i=(int)(n) - 1; i>= 0; --i)
#define fored(i,l,r) for(int i=(int)r; i>= (int... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | 14d603d8d4f6773ffd7854151b0ab028 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void trace_() {cerr << "\n";}
template<typename T1, typename... T2> void trace_(T1 t1, T2... t2) {cerr << ' ' << t1; trace_(t2...); }
#define trace(...) cerr << #__VA_ARGS__ << " :", trace_(__VA_ARGS__);
const int N = 111, inf = 1e9;
bool mark[N][N][N], is_edge[N][N];
vec... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | ec250d7fd0f003c92e70ac6fdb8e055f | 2,600 | PASSED |
/*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
#define len(a) (int)a.size()
using namespace std;
const int N=110;
int T,n,cnt,c[N],in[N],d[N][N];
bool vi[N][N][N];
char s[N];
vector <pair<int,int> > p[N*N];
map <__int128,int> id;
__in... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | cddcd30697bb0d0bdadbc4d6756e0022 | 2,600 | PASSED |
#include<bits/stdc++.h>
#include<ctime>
#define N 105
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
using namespace std;
int fa[N],n,T,can[N][N][N],dep[N],vis[N],arr[N][N]; vector<int>g[N];
void dfs(int u,int f){
g[f].pb(u),g[u].pb(f); vis[u]=1;
for(int i=1;i<=n;i++) if... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | 1c051edc348e0e69693e6f1655dd122e | 2,600 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <functional>
#define all(arr) arr.begin(), arr.en... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | 79a35cb848336b8bd491e63df4fe93d3 | 2,600 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <functional>
#define all(arr) arr.begin(), arr.en... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | 411045937bd99083d4d3d73da66eb0be | 2,600 | PASSED |
#include <iostream>
#include <vector>
#include <random>
#include <utility>
#include <algorithm>
#include <ctime>
#include <set>
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
const int maxN = 1e2 + 10;
int N, M, same[maxN][maxN][maxN], dist[maxN][maxN]; //d(i, k) = d(j, k)... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | db94e1e4728d0e0eded0c3340c7914b1 | 2,600 | PASSED |
/* Generated by powerful Codeforces Tool
* You can download the binary file in here https://github.com/xalanq/cf-tool (Windows, macOS, Linux)
* Author: icey_z
* Time: 2022-06-27 11:03:02
**/
#include <bits/stdc++.h>
#include <thread>
#include <vector>
using namespace std;
using ll = long long;
using pii... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | 561bed131696e4a6c4d0cc7f1b06536c | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) fo... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | 9aeebf03a2b1f28ac850aa9a798dcd5d | 2,600 | PASSED |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> int sz(const T &a){return int(a.size());}
const int MN=101;
bool gone[MN];
bool conn[MN][MN][MN];
vector<vector<int>> groups[MN];
int group[MN];
int par[MN];
vector<in... | C++ | 2d96a753ae2df1f1084a2cda65839a86 | a3753df2beb07207d25706cb9237cac2 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int compare(vector<pair<ll,ll>> res1,vector<pair<ll,ll>> res2)
{
if(res1.size()!=res2.size())
{
return 0;
}
for (int i = 0; i < res1.size(); i++) {
if(res1[i].first!=res2[i].first || res1[... | C++ | 2ff40423619cefd8c2fb35a18549c411 | eb3aefa69aa07a8faa02141b7e5ffccc | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll test(ll a,ll m)
{
ll z = 1;
while(z<a)
{
z*=m;
}
if(z>a)
{
z/=m;
}
while(z>1)
{
... | C++ | 2ff40423619cefd8c2fb35a18549c411 | cf4d4f646ad4b83f4fa95222eeb13cf1 | 1,400 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
main()
{
ll t;
cin>>t;
while(t--)
{
ll n,m,k,x,a[50000],b[50000];
vector<ll>a1,b1;
cin>>n>>m;
for(ll i=0;i<n;i++)
{
cin>>a[i];
}... | C++ | 2ff40423619cefd8c2fb35a18549c411 | d47e9b5ed3e937d939ab6500811c2e61 | 1,400 | PASSED |
#include <iostream>
#include <math.h>
#include<algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<ll> vll;
#define oset tree<long, null_type,le... | C++ | 2ff40423619cefd8c2fb35a18549c411 | 843fc03e0add10c21a0753085be5ab5e | 1,400 | PASSED |
// Problem: C. Fishingprince Plays With Array
// Contest: Codeforces - Codeforces Global Round 21
// URL: https://codeforces.com/contest/1696/problem/C
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// Author: Bit_8
#include<bits/stdc++.h>
using namespace std;
#define lowbit(a) a&(-a)
#define FAST() ios::syn... | C++ | 2ff40423619cefd8c2fb35a18549c411 | 48776c5d9a2ade420bab96a311de0a83 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, k;
void solve()
{
cin >> n >> k;
int x;
if(k == 1)
{
int sum1 = 0, sum2 = 0;
for(int i = 1; i <= n; ++i) cin >> x, sum1 += x;
cin >> m;
for(int i = 1; i <= m; ++i) cin >> x, sum2 +=... | C++ | 2ff40423619cefd8c2fb35a18549c411 | 171f136514d23c2dba6d17b71f8c41f2 | 1,400 | PASSED |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define I... | C++ | 2ff40423619cefd8c2fb35a18549c411 | ac607bf2bafbfcae915240828047c378 | 1,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.