source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define floop(i,a,b) for(int i=a;i<=b;++i)
const ll mod=1e9+7;
const int maxn=1e5+5;
const int lognum=18;
void merge(int a[],int b[],int c[]){
int temper[10];
for (int i... | C++ | ff84bc8e8e01c82e1ecaa2a39a7f8dc6 | f49fd87d60ed7a60bed525aff98990ef | 2,200 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define ld long double
#define fi first
#define se second
#define ll long long
#define ss(x) (int) x.size()
#define mp make_pair
#define up(i, n) for(int i = 1; n >= i; ++i)
using namespace std;
const int nax = 100005, mod = 1e9 + 7;
const ll inf = 1e18;
int n, m, q;
int a,... | C++ | ff84bc8e8e01c82e1ecaa2a39a7f8dc6 | dd4224928c223b176068ca5f8ee405c6 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = int(1.1e5);
const int N = MAXN;
const int LG = 20;
vector<vector<int>> g(MAXN);
vector<vector<int>> par(MAXN, vector<int>(LG, 0));
vector<int> dep(MAXN);
void dfs(int u, int p) {
if(p == 0) dep[u] = 0;
else dep[u] = dep[p] + 1;
... | C++ | ff84bc8e8e01c82e1ecaa2a39a7f8dc6 | dd3b6615055b18c975df895c5654b486 | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <tr1/unordered_map>
typedef long long ll;
typedef unsigned long long ull;
#define clr(ma) memset(ma,-1,sizeof ma)
#define inf 10000000000000ll
#define vi vector<int>
#define pi pair<int ,ll >
#define T pair<pi ,int >
#define mk make_pair
#define getBit(m,i) ((m&(1<<i))==(1<<i))
#defi... | C++ | ff84bc8e8e01c82e1ecaa2a39a7f8dc6 | 290427ba09b1a6660aad94caf011dee8 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define _DO_(x) if(DEBUG) x
const int N = 1e5+10, L = 19;
vector< int > adj[N];
int ctz[N][10];
bool vis[N];
int par[L+1][N];
int path[L+1][N][10];
int tin[N], tout[N], timer;
bool is_ancestor(int u, int v){
return tin[u] <= tin[... | C++ | ff84bc8e8e01c82e1ecaa2a39a7f8dc6 | d48582596532a486d251d4157cedf720 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fs first
#define sc second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define pb push_back
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define MP make_pair
#def... | C++ | 3d721e8bd069b44655797d18df9dbf12 | f7efd5d8aa4b18f87bd601fe209f666a | 2,600 | PASSED |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) ... | C++ | 3d721e8bd069b44655797d18df9dbf12 | 3cca5ca324aed1bc2a757bf68ca2756f | 2,600 | PASSED |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) ... | C++ | 3d721e8bd069b44655797d18df9dbf12 | 5195ad29b24ab92feb06921ea4154b1f | 2,600 | PASSED |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) ... | C++ | 3d721e8bd069b44655797d18df9dbf12 | eb46aeddebafc67a68c16b621854ff55 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) ... | C++ | 3d721e8bd069b44655797d18df9dbf12 | 486a71f3abf0229af971ecd707f9b403 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) ... | C++ | 3d721e8bd069b44655797d18df9dbf12 | b8ac4762da84f1a2a1bff029e88a355f | 2,600 | PASSED |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scahf("%c",&a);
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) ... | C++ | 3d721e8bd069b44655797d18df9dbf12 | 8cb137ed5bcec29a0aa0b24517f0bd12 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | C++ | 3d721e8bd069b44655797d18df9dbf12 | 9dacdbdc0aa04e27d64e12954cd78e62 | 2,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define x1 x1228
#define y1 y1228
#define left left228
#define right right228
#define tm tm228
#define pb push_back
#define eb emplace_back
#define mp make_pair
... | C++ | 3d721e8bd069b44655797d18df9dbf12 | a78fe75e544d1c69977e6ee346fdc44d | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
const int INF = 1012345678;
char s[500005];
int B[500005];
int N[500005];
int n;
int cntOp = 0;
int maxCnt = 0;
int dist(ii a, ii b){
cntOp ++;
if(a.first < b.first && a.second < b.second){
r... | C++ | 3d721e8bd069b44655797d18df9dbf12 | 0af69da9e5cd1d8a8c4ab8bf647e9314 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,m,ta,tb,k;cin>>n>>m>>ta>>tb>>k;
vector<ll>a(n),b(m);for(int i=0;i<n;i++)cin>>a[i];ll g=0;
for(int i=0;i<m;i++)cin>>b[i];ll ans=-1;if(k>=n||k>=m){cout<<"-1";return 0;}
for(int i=0;i<=k;i++)
{ans=a[i]+ta;
ll h... | C++ | bf60899aa2bd7350c805437d0fee1583 | b1e2bc779c79cece98b87cda45aad47c | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m,ta,tb,k,fa=0,fb=0,ans=0,b1,b2;
cin>>n>>m>>ta>>tb>>k;
vector<ll> a(n,0),b(m,0);
for(int i=0;i<n;i++)
{
cin>>a[i]; a[i]+=ta;
}
for(int i=0;i<m;i++)
{
cin>>b[i];
... | C++ | bf60899aa2bd7350c805437d0fee1583 | 2096c43d34f4892168c6cb558eae37a3 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m,ta,tb,k,fa=0,fb=0,ans=0;
cin>>n>>m>>ta>>tb>>k;
vector<ll> a(n,0),b(m,0);
for(int i=0;i<n;i++)
{
cin>>a[i]; a[i]+=ta;
}
for(int i=0;i<m;i++)
{
cin>>b[i];
}
... | C++ | bf60899aa2bd7350c805437d0fee1583 | b209525a50409933f0a8908bb7d3a3a1 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
ll n, m, ta, tb, k;
ll a[200005], b[200005];
ll ans=0;
void nope()
{
cout << "-1\n";
exit(0);
}
int main ()
{
cin >> n >> m >> ta >> tb >> k;
if(k >= min(n, m))
nope();
for(int i=0; i<... | C++ | bf60899aa2bd7350c805437d0fee1583 | 0ae65178a3cc16aad7813946697e16ac | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long n,m,ta,tb,k;
long long a[1000001],b[1000001];
long long ans=0;
long long times=1e16;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>m>>ta>>tb>>k;
if(k>=min(m,n))
{
cout<<-1;
return 0;
}
for(lo... | C++ | bf60899aa2bd7350c805437d0fee1583 | 5b17731638c34e7c5e584085f97d869f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define INF 1000000009
#define gcd(a,b) __gcd(a,b)
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) for(auto it=x.begin();it!=x.end();it++) cout<<*it<<' '; cout<<endl;
#define in(x,... | C++ | bf60899aa2bd7350c805437d0fee1583 | 5852693ea4eb7087ec95c04873076471 | 1,600 | PASSED |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#define lld long long int
#define DBG1(vari1) cerr<<#vari1<<" = "<<(vari1)<<endl;
#define DBG2(vari1,vari2) cerr<<#vari1<<" = "<<(va... | C++ | bf60899aa2bd7350c805437d0fee1583 | b8bb5f65b41057d19edee705f303167d | 1,600 | PASSED |
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long int64;
char ch;
bool ok;
void read(int64 &x){
for (ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') ok=1;
for (x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());
if (ok) x=-x;
}
const i... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 70c4af9e33834eb97192d924284b422d | 3,000 | PASSED |
#include<cstdio>
#include<algorithm>
#define LL long long
#define N 1000100
using namespace std;
struct ha{
int m1,m2,cnt;
}M[N];
LL pre_A[N],pre_B[N];
int n;
bool ok=0;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&pre_A[i]);
pre_A[i]+=pre_A[i-1];
}
for(int i=1;i<=n;i++)
{
scanf("%ll... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 80eedd3f7076244e9a23a331dcbbaa55 | 3,000 | PASSED |
#include <cstdio>
#include <utility>
#include <vector>
#define st first
#define nd second
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MAXN = 1E6 + 10;
int n;
ll a[MAXN], b[MAXN];
pair<PII, PII> solve(ll a[], ll b[]){
static int c[MAXN], res[MAXN];
int r;
for (int i = 0; i <... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 3e2a6b3d160b6e63c64d20ee0aac5e48 | 3,000 | PASSED |
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#define MX 1000005
#define R register
#define gc getchar()
#define IN inline
#define W while
#define ll long long
using namespace std;
int vis[MX];
int pos[MX], dat1[MX], dat2[MX], ans[2][2], res[MX];
ll len... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 979c9c29f8ef5763637bc7c91c4bc4d4 | 3,000 | PASSED |
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#define MX 1000005
#define R register
#define gc getchar()
#define IN inline
#define W while
#define ll long long
using namespace std;
int vis[MX];
int pos[MX], dat1[MX], dat2[MX], ans[2][2], res[MX];
ll len... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 61bb55408d5c07b63ecf318b73f8d342 | 3,000 | PASSED |
#include<cstdio>
const int N=1000005;
long long n,j,_i,_j,a[N],b[N],s1[N],s2[N],pos[N],bo[N];
int main(){
scanf("%I64d",&n);
for (int i=1;i<=n;i++) scanf("%I64d",&a[i]),s1[i]=s1[i-1]+a[i];
for (int i=1;i<=n;i++) scanf("%I64d",&b[i]),s2[i]=s2[i-1]+b[i];
j=0;
for (int i=0;i<=n;i++){
while (s2[j]<s1[i] && j<=n) j++... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | afbe8f93dffeec782e5b931a5bd8a43a | 3,000 | PASSED |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#ifdef WIN32
#define LL "%I64d"
#else
#define LL "%lld"
#endif
#ifdef Lightning
#define debug(orz...) printf(orz)
const int DEBUG = 1;
#else
#define debug(...)
const int DEBUG = 0;
#endif
#defin... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | bd251eb65c1af7c931949dbc251e9f88 | 3,000 | PASSED |
#include<cstdio>
using namespace std;
typedef long long ll;
const int N=1001000;
int i,j,k,n,ch,tt,l;
struct cc {int x,y;} A[N];
ll t,a[N],b[N];
void R(int &x)
{
x=0;ch=getchar();
while (ch<'0' || '9'<ch) ch=getchar();
while ('0'<=ch && ch<='9') x=x*10+ch-'0',ch=getchar();
}
void W(int x)
{
if (x>=10) W(x/10);
put... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 78e772292b80881e8917296425f817ce | 3,000 | PASSED |
# include <bits/stdc++.h>
# define IL inline
# define RG register
# define Fill(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long ll;
IL int Input(){
RG char c = getchar(); RG int x = 0, z = 1;
for(; c < '0' || c > '9'; c = getchar()) z = c == '-' ? -1 : 1;
for(; c >= '0' && c <= '9'; c ... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | 691f1dc3dac611fc6e5ce7a8d8269cfa | 3,000 | PASSED |
#include<cstdio>
const int N=1000005;
long long n,j,_i,_j,a[N],b[N],s1[N],s2[N],pos[N],bo[N];
int main(){
scanf("%I64d",&n);
for (int i=1;i<=n;i++) scanf("%I64d",&a[i]),s1[i]=s1[i-1]+a[i];
for (int i=1;i<=n;i++) scanf("%I64d",&b[i]),s2[i]=s2[i-1]+b[i];
j=0;
for (int i=0;i<=n;i++){
while (s2[j]<s1[i] && j<=n) j++... | C++ | ae3641c46635b8c679b3016b7f8c59d8 | fa7b15837bd8e35aeccafaf66696311f | 3,000 | PASSED |
#include <stdio.h>
using namespace std;
#define N 505
long long dp[2][N][N] ;
long long a[N];
long long min(long long x,long long y){return x<y?x:y ;}
main(){
long long n,m,b,mod;
//input
scanf("%I64d%I64d%I64d%I64d", &n,&m,&b,&mod) ;
for (long long i=0; i<n;i++)scanf("%I64d" , a+i) ;
//pre
long... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | b7437015445d5b7840a2514ab4320155 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi >
#define str string
#define vs vector<str>
#define vb vector<bool>
#define si set<int>
#define slli set<lli>
#define mii map<int, int>
#define mlli map<int... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | 25f3416f9d5d42c72727737fdabb55fb | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long dp[2][501][501],ara[502];
long long solve(long long n,long long m,long long b,long long mod)
{
long long idx,line,bug;
for(idx=n;idx>=1;idx--)
{
for(line=0;line<=m;line++)
{
for(bug=0;bug<=b;bug++)
{
... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | ce8334ce49cd894340c51cfcbddbf3c5 | 1,800 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
typedef unsigned short us;
typedef short s;
typedef unsigned long ul;
typedef long l;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const l INF = 1e9 + 9;
const l MOD = 1e9 + 7;
const... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | 0762fcd00867d79b5a50f383d3d94908 | 1,800 | PASSED |
/*input
3 6 5 1000000007
1 2 3
*/
#include <bits/stdc++.h>
using namespace std;
int dp[2][501][501];
int main(int argc, char const *argv[])
{
for(int i = 0; i<2; i++) dp[i][0][0] = 1;
int n,m,b,mod;
cin >> n >> m >> b >> mod;
int ara[n+2];
for(int i = 1; i<=n; i++) cin >> ara[i];
int now = 1;
for(int i = 1; i<... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | c73969ebcd4f15c23cf2b9b474f05764 | 1,800 | PASSED |
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,m,b,mod;
cin>>n>>m>>b>>mod;
long long dp[2][m+1][b+1];
int a[n+1];
memset(dp,0,sizeof(dp));
for(int i=0;i<=1;i++)
for(int k=0;k<=b;k++)dp[i][0][k]=1;
for(int i=1;i<=n;i++)cin>>a[i];
... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | 990955e63a090985469654339e407907 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define F first
#define S second
... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | 6e57300b6af05b6f858080ce03f17e68 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define F first
#define S second
... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | 33f32e6594a2dcbf851544454938ce86 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m,b,mod;
int a[510];
int dp[2][510][510];
int main()
{
scanf("%d%d%d%d",&n,&m,&b,&mod);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
dp[0][0][0]=1;
int state=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<=m;j++)
{
for(int k=0;k<=b;k++)
{
dp[state][j][k]+... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | c807e59fcdd0d0510079aa47023ffee2 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,m,b,mod;
int a[510];
int dp[510][510];
int main()
{
scanf("%d%d%d%d",&n,&m,&b,&mod);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
dp[0][0]=1;
int state=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<=m;j++)
{
for(int k=0;k<=b;k++)
{
if(k>=a[i]&&j>0)
... | C++ | 139febdb9c01bf0e6598fdf65a1a522c | 40051a414cc5e06f3fe75100cdc61c05 | 1,800 | PASSED |
#include <set>
#include <tr1/unordered_map>
#include <vector>
#include <iostream>
#include <cstring>
#include <stdio.h>
#include <stdlib.h>
#define uint unsigned int
#define ull unsigned long long
using namespace std;
int main(void) {
int cant; // 1 <= cant <= 10**5
scanf("%u", &cant);
if(cant>2){
... | C++ | 4798211615bcff8730378330756ae63f | 92435bd49e6eae5785bc73f93db74224 | 2,000 | PASSED |
/**
* Author: Sehriyar Novruzov (n.sehriyar@hotmail.com)
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<ctime>
#include<fstream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#inc... | C++ | 4798211615bcff8730378330756ae63f | 03888c2f020cbff1612ddf0536ebf86b | 2,000 | PASSED |
#include<iostream>
using namespace std;
long long int n,a[100005],sum=0,p=0,s=0,ans=0;
bool mark[100005],rang[100005];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
if(sum%3==0){
sum/=3;
for(int i=1;i<=n;i++){
s+=a[i];
if(s==sum){
... | C++ | 4798211615bcff8730378330756ae63f | e66a8bfdc60c6091cb4dcf9eb3536fe4 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n; cin>>n;
ll a[n],s=0;
for(int i=0;i<n;i++){ cin>>a[i]; s+=a[i];}
if(s%3!=0) { cout<<0<<endl; return 0;}
ll c=0,l=0,r=0;
ll val=s/3;
for(int i=0;i<n-1;i++)
{
c+=a[i];
... | C++ | 4798211615bcff8730378330756ae63f | 45295e4825bb94397e6845c718be779e | 2,000 | PASSED |
// C. Stripe 2
#include <iostream>
#include <cstdio>
#include <set>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <complex>
#include <sstream>
#include <iomanip>
#define int long long
#define eps 10e-8
#define sqr(x) ((x) * (x))
#define equal(... | C++ | 4798211615bcff8730378330756ae63f | c34660471caa84b6bc5606a16f56a5b5 | 2,000 | PASSED |
#include <iostream>
using namespace std;
const int maxN = 100 * 1000 + 100;
#define int long long
int n, k, a[maxN], s[maxN], d[maxN];
int C (int r, int n) {
if (n < r) return 0;
int res = 1;
for (int i = 1; i <= r; i++) {
res *= n - i + 1;
res /= i;
}
return res;
}
main() {
cin >> n;
k = 3; //cin >> k... | C++ | 4798211615bcff8730378330756ae63f | c93d246d11fbb4c713c1727e39a045b9 | 2,000 | PASSED |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <iostream>
using namespace std;
const int MAXN = 100010;
int v[MAXN], s[MAXN];
int calc_sum(int a, int b) {
return s[b] - s[a-1];
}
map<int, int> dp;
int main() {
int n;
scanf("%d", &n);
v[0] = 0;
s[0] = 0;
int tot = 0;
fo... | C++ | 4798211615bcff8730378330756ae63f | e323efc0fc4c5beb6ef6fd42de7643d1 | 2,000 | PASSED |
#include <iostream>
using namespace std;
const int MAX=1000*1000 + 20;
int number[MAX];
int number_l[MAX];
int number_r[MAX];
int l[MAX];
int r[MAX];
int main(){
int n;
cin >> n;
for(int i=1;i<=n;i=i+1){
cin >> number[i];
}
for(int i=1;i<=n;i=i+1){
number_l[i]=number_l[i-1]+number[i];
}
for(int i=1;i<=n;i... | C++ | 4798211615bcff8730378330756ae63f | 75a9a92879ecf45ed00ec14151ab42d3 | 2,000 | PASSED |
#include <stdio.h>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int tmax = (int)1e5 + 100;
#define pb push_back
#define mp make_pair
long long bit[tmax];
int main(){
int N;
scanf("%d", &N);
int soma = 0;
vector < int > valores;
for( int i = 1; i <= N; i++){... | C++ | 4798211615bcff8730378330756ae63f | a815b0099d9a59e0fe478e29b7e2148b | 2,000 | PASSED |
#include <cstdlib>
#include <cstdio>
//Stripe 2
//http://www.codeforces.com/contest/21/problem/C
int n, tot, temp;
long long soma[ 100100 ];
long long terco, resp;
void read () {
scanf("%d", &n);
soma[0] = 0;
for ( int i = 1; i <= n; i++ ) {
scanf("%d", &temp );
soma[i] =... | C++ | 4798211615bcff8730378330756ae63f | 8e7271d5cdb264056c561d033e1618da | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
//////////////////////////////////////////////////////
typedef struct s{
int a;
int b;
}sor;
int sorter(sor lhs, sor rhs) {
if (lhs.a < rhs.a)
return 1;
return 0;
}
bool isNumber(string s)
{
for (i... | C++ | bfef3f835357dae290620efabe650580 | c102d4b9453ca70632299679117fdeb0 | 1,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define mk make_pair
#define endl '\n'
#define pb push_back
#define foi(a,n) for(long long i=a;i<n;i++)
#define foj(a,n) for(long long j=a;j<n;j++)
#define fok(a,n) for(long long k=a;k<n;k++)
using namespace std;
void crap() {
ios_base::sync_with_stdio(false); cin.tie(NULL... | C++ | bfef3f835357dae290620efabe650580 | 8ede0632ee36041ce1198aa1efaa6182 | 1,400 | PASSED |
// SmartCoder
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c)... | C++ | bfef3f835357dae290620efabe650580 | 4368f5177b5d2f77c61b8f5c315efd35 | 1,400 | PASSED |
import java.util.Arrays;
import java.util.Scanner;
public class B_79_Colorful_Field {
@SuppressWarnings("unused")
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt(), m = s.nextInt(), k = s.nextInt(), t = s.nextInt();
int[] is = new int[k];
for (int i = 0; i < k; ... | Java | bfef3f835357dae290620efabe650580 | 49fef5a0d65f50c4cc603ae04e44c76f | 1,400 | PASSED |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.concurrent.*;
@SuppressWarnings("unchecked")
public class P79B {
final static String [] fruits = {"Carrots", "Kiwis", "Grapes"};
public void run() throws Exception {
int n = nextInt();
int m = nextInt();
int k = nextInt();
... | Java | bfef3f835357dae290620efabe650580 | 02f916697550b1eeaa008a8e0a4597f3 | 1,400 | PASSED |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.concurrent.*;
@SuppressWarnings("unchecked")
public class P79B {
final static String [] fruits = {"Carrots", "Kiwis", "Grapes"};
public void run() throws Exception {
int n = nextInt();
int m = nextInt();
int k = nextInt();
... | Java | bfef3f835357dae290620efabe650580 | 147fa731519b4b7af9aa27050fb1de71 | 1,400 | PASSED |
/*
* @Author: steve
* @Date: 2015-04-07 22:59:22
* @Last Modified by: steve
* @Last Modified time: 2015-04-07 23:41:09
*/
import java.io.*;
import java.util.*;
public class ColorfulField {
public static void main(String[] args) throws Exception{
BufferedReader entrada = new BufferedReader(new InputStream... | Java | bfef3f835357dae290620efabe650580 | 968bb91ebc4cc717987a866b0ddb0bdd | 1,400 | PASSED |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparato... | Java | bfef3f835357dae290620efabe650580 | e212cfd080839d4586c5412414da3973 | 1,400 | PASSED |
import java.util.*;
import java.io.*;
public class zanah{
public static void main(String args[]) throws IOException{
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
String tmp[] = lector.readLine().split(" ");
int a = Integer.parseInt(tmp[0]);
int b = Integer.parseInt(tmp[1]);
int c = Inte... | Java | bfef3f835357dae290620efabe650580 | f96887d14abb0b10aa989feadd44a9ec | 1,400 | PASSED |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int t = sc.nextInt();
int[][] waste = new int[k][2];
for (int i = 0; i < k; i++)
waste[i] = new int[] { sc.nex... | Java | bfef3f835357dae290620efabe650580 | 12b25a01a0701889f1a7bfa801de116d | 1,400 | PASSED |
import sys, math
input = sys.stdin.readline
def main():
t = int(input())
for _ in range(t):
s = input().replace("\n","")
se = set()
inc = 0
co = (0,0)
se.add((co,co))
for x in range(len(s)):
last_co = co
if s[x] == "N":... | Python | 8190d3bc81a4d76f8256f31f07441a36 | a7384951438432beb9ecfea20de4bff4 | 1,400 | PASSED |
from sys import stdin, exit
input = stdin.readline
def i(): return input()
def ii(): return int(input())
def iis(): return map(int, input().split())
def liis(): return list(map(int, input().split()))
def print_array(a): print(" ".join(map(str, a)))
t = ii()
for _ in range(t):
time = 0
x, y = 0, 0
visited = set()
... | Python | 8190d3bc81a4d76f8256f31f07441a36 | 7d5007b1a46cfe4057568e19bee80679 | 1,400 | PASSED |
T = int(input())
#MOVE FUNCTION TO UPDATE TUPLE
def move(position,direction):
if direction=='N':
x,y=position
y=y+1
position=(x,y)
elif direction=='E':
x,y=position
x=x+1
position=(x,y)
elif direction=='S':
x,y=position
y=y-1
positio... | Python | 8190d3bc81a4d76f8256f31f07441a36 | 11d319ab4c04986e3ef14eebfc6992cf | 1,400 | PASSED |
from sys import stdin, setrecursionlimit, stdout
#setrecursionlimit(1000000) #use "python" instead of "pypy" to avoid MLE
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
from heapq import heapify, heappop, heappush, heapreplace, heappushpop
def ii(): return in... | Python | 8190d3bc81a4d76f8256f31f07441a36 | 71582f755a6d709307c5b52baff1fbb3 | 1,400 | PASSED |
for ii in range(int(input())):
s = input()
dic = {}
x = 0
y = 0
ans= 0
dic[(x,y)] = 1
for i in s:
inix = x
iniy = y
if i == "N":
y+=1
elif i == "S":
y-=1
elif i == "W":
x-=1
elif i == "E":
x+=1
if (inix,iniy,x,y) in dic:
ans+=1
else:
dic[(inix,iniy,x,y)] = 1
dic[(x,y,inix,ini... | Python | 8190d3bc81a4d76f8256f31f07441a36 | 98909f5d943a56354af539544b4d710a | 1,400 | PASSED |
for t in range(int(input())):
dic = {}
x = y = 0
time = 0
for c in input().rstrip('\n'):
p = x
q = y
if c == 'N':
y += 1
elif c == 'S':
y -= 1
elif c == 'W':
x -= 1
elif c == 'E':
x += 1
if (x, y, p, ... | Python | 8190d3bc81a4d76f8256f31f07441a36 | 7d7aa4f778c16b4d8d4770d5dbd3a82b | 1,400 | PASSED |
for case in range(int(input())):
path = input()
cur = [0,0]
ans = 0
all_routes = set()
for i in path:
curx = cur[:]
if i == "N":
cur[0] += 1
elif i =="S":
cur[0] -= 1
elif i == "E":
cur[1] += 1
elif i == "W":
cur[1] -= 1
if tuple(curx+cur) in all_routes or tuple(cur+curx) in all_routes:
... | Python | 8190d3bc81a4d76f8256f31f07441a36 | 007e2e63d18de39592336aa0e3b18c5e | 1,400 | PASSED |
h=100050
for s in[*open(0)][1:]:
r=x=0;d={}
for c in s[:-1]:y=x+(1,-1,-h,h)['SNWE'.find(c)];p=x|y,x&y;x=y;r+=d.get(p,5);d[p]=1
print(r) | Python | 8190d3bc81a4d76f8256f31f07441a36 | 43c499d4d55bb604561b1e8bc5a5efcd | 1,400 | PASSED |
h=7**6
for s in[*open(0)][1:]:
r=x=0;d={}
for c in s[:-1]:y=x+(1,-1,-h,h)['SNWE'.find(c)];p=x|y,x&y;x=y;r+=d.get(p,5);d[p]=1
print(r) | Python | 8190d3bc81a4d76f8256f31f07441a36 | 8fb8ef62446068adf9fc2e0f2dc3a0d1 | 1,400 | PASSED |
t=int(input())
for i in range(t):
s=str(input())
n=len(s)
lis=[0,0]
dict={}
ans=0
for j in range(n):
tuple1=(lis[0],lis[1])
if s[j]=="W":
lis[0]-=1
if s[j]=="E":
lis[0]+=1
if s[j]=="N":
lis[1]+=1
if s[j]=="S":
... | Python | 8190d3bc81a4d76f8256f31f07441a36 | e72488e89ec2c947c83e7aa3f25bfc92 | 1,400 | PASSED |
from collections import deque
__author__ = 'aste'
def main():
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
q = [0] * m
for i in range(0, m):
t, r = map(int, input().split())
q[i] = (r, t)
max_range = [0] * m
max_range[m - 1] = m - 1
for i in range... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | 4100dec6ac798a934c9ea44a43665c8d | 1,700 | PASSED |
from collections import deque
__author__ = 'aste'
def reverse_in_place(lst, i, j):
while i < j:
t = lst[i]
lst[i] = lst[j]
lst[j] = t
i += 1
j -= 1
def main():
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
q = [0] * m
for i in ra... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | bbb9c9430079cff77d6f3ddac3a6a794 | 1,700 | PASSED |
from collections import deque
__author__ = 'aste'
def main():
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
q = [0] * m
for i in range(0, m):
t, r = map(int, input().split())
q[i] = (r, t)
max_range = [0] * m
max_range[m - 1] = m - 1
for i in rang... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | e584a1d10857f784421600ce8141cee7 | 1,700 | PASSED |
#!/usr/bin/python3
class StdReader:
def read_int(self):
return int(self.read_string())
def read_ints(self, sep = None):
return [int(i) for i in self.read_strings(sep)]
def read_float(self):
return float(self.read_string())
def read_floats(self, sep = None):
return [float(i) for i in self.read_strings(se... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | a36cdfc83366524d4c6b317203661f61 | 1,700 | PASSED |
#!/usr/bin/python3
class StdReader:
def read_int(self):
return int(self.read_string())
def read_ints(self, sep = None):
return [int(i) for i in self.read_strings(sep)]
def read_float(self):
return float(self.read_string())
def read_floats(self, sep = None):
return [float(i) for i in self.read_strings(se... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | 10e233c7b824c14773db4044a2291b74 | 1,700 | PASSED |
n, m = map(int, input().split())
a = list(map(int, input().split()))
t = []
for i in range(m):
asc, r = map(int,input().split())
while t:
if r >= t[-1][1]:
t.pop()
else:
break
t.append([asc, r])
t.append([0, 0])
x = 0
y = t[0][1] - 1
sor = sorted(a[:t[0][1]])
for ... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | 0101d896e947773d6b096d676be2f9fd | 1,700 | PASSED |
n, m = map(int, input().split())
a = list(map(int, input().split()))
deq = []
for i in range(0,m):
t, r = map(int, input().split())
while deq and deq[-1][1] < r:
deq.pop(-1)
deq.append((t, r))
b = sorted(a[0: deq[0][1]])
seq = []
for t, r in deq:
if seq:
it = (t, ) + ((seq[-1][2] - r, seq[-1][2]) if seq[-1][0] ... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | 9558207a03a95fc86bf6f564d48aa742 | 1,700 | PASSED |
n,m=[int(i) for i in input().split()]
_report=[int(i) for i in input().split()]
working=[]
for i in range(m):
x,y=map(int,input().split())
while len(working)!=0 and y>=working[-1][1]:
working.pop()
working.append([x,y])
P=working[0][1]
sample=_report[:P]
sample.sort()
x=0
y=P-1
working.append(... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | 03e12a8a34c3df8ae811f79832f8573a | 1,700 | PASSED |
n, m = map(int, input().split())
l = list(map(int, input().split()))
ml = []
for i in range(m):
t, r = input().split()
r = int(r)
while len(ml) > 0 and r >= ml[-1][1]:
ml.pop()
ml.append([t, r])
x, y = 0, ml[0][1] - 1
ml.append([0, 0])
b = sorted(l[: y + 1])
for i in range(1, len(ml)):
for... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | 876deb3c9d60faa76f45356cf6006bb7 | 1,700 | PASSED |
n,m = [int(i) for i in input().split()]
a = list(map(int,input().split()))
b = []
for i in range(m):
t,r = [int(x) for x in input().split()]
while len(b) > 0 and r >= b[-1][1]:
b.pop()
b.append([t,r])
t,r = 0, b[0][1]
b.append([0,0])
f = sorted(a[:r])
for i in range(1,len(b)):
for y in range(b[i... | Python | 61e662dd3ae6e29dff2f24817b36b3f7 | ca62f9ee7da36ed11dd986046740f124 | 1,700 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(nullptr);
ll maxq = 0;
string s;
ll n,k;
ll kc;
cin >> n >> k;
cin >> s;
kc = k;
fo... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | 51bce6254e842def1293002c8f8ef04f | 1,300 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2")
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <unordered_map>
#include <numeric>
#include <fstream>
using std::cin;
using std::cout;
using std::vector;
u... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | 54ccd488061e1a40e9af4fec05866ba2 | 1,300 | PASSED |
/***from dust i have come, dust i will be***/
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define dbg printf("in\n");
#define nl printf("\n");
#define N 60
#define sf(n) scanf("%d", &n)
#define sff(n,m) scanf("%d%d",&n,&m)
#define sfl(n) scanf("%I64d", &n)
#define sffl(n,m)... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | ee5ecf36a7094cafc8912399701248d2 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
ll t=1;
while(t--)
{
ll n,k,i;
cin>>n>>k;
string s,s1;
cin>>s;
vector<char> v;
for(i=0;i<26;i++)
{
char x = 'a'+i;
v.push_back(x);
}
for(i=0;... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | f940ef5aa7600909353e6840f71c83e5 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,a,b,ff=0,i=0;
string s,t="";
cin>>n>>m>>s;
for(i=0;i<n;i++)
{a=s[i]-'a';
if(m==0)
{
break;
}
if(a<13)
while(s[i]<'z'&&m>0)
{
s[i]++,m--;
}
else
while(s[i]>'a'&&m>... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | eacc3818c753943e16e252676afbceb5 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
scanf("%d%d",&n,&k);
char s[100005];
scanf("%s",s);
for(int i=0;i<n;i++){
int d1=(25-(int)(s[i]-'a'));
int d2=(int)s[i]-'a';
k-=max(d1,d2);
if(k>=0){
if(s[i]<='m')s[i]='z';
else s[i]='a';
}
else {
k+=max(d1,d2);
if(s[i]<='m'... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | b58f3fb110e6c258529b39be27db3973 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
string s;
cin>>s;
int e1=k;
string j;
int p=s.size();
p--;
if(n*25<k){
cout<<-1<<endl;
return 0;
}
if(k==0)
{
cout<<s<<endl;
return 0;
}
long long int q=0;
... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | 6f8899270bdc8274d24aab451f509d19 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k; cin >> n >> k;
string s; cin >> s;
map<char, map<char, int>> dist;
for(char i = 'a'; i <= 'z'; i++)
for(char j = 'a'; j <= 'z'; j++)
dist[i][j] = max(abs(i - j), abs(j - i));
// for(char i = 'a'; i <= 'z'; i++... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | 159822f3a65ecb0d5daf46353461b446 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define eps 1e-8
#define ll long long
#define ed cout<<endl
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define ll long long
#define se second
#define inf 2e9
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define sz 456789
#define all(x) x.begin(), x.en... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | 2af083874da3b69aefa59dc32d60eac6 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define pf push_front
#define mp make_pair
#define fs ... | C++ | b5d0870ee99e06e8b99c74aeb8e81e01 | 91794484d93b3782b2fb0a7252c13607 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define min3(a, b, c) min((a), min((b), (c)))
#define max3(a, b, c) max((a), max((b), (c)))
#define lcm(a,b) (a / __gcd(a,b) ) *b
#define gcd(a,b) __... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | cc26edbc64c27ab0479f02f4e8608ac7 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n), b(n);;
for (auto &it: b) cin >> it;
int j = 0;
for (int i = 0; i < n; i += 2, j++) a[j] = b[i];
for (int i = 1; i < n; i += 2, ... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | d0a09723b19b59da465049705b3313bb | 2,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | 5745066fa613fcbc27c2e79e958d57ed | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// macros
#define int long long
#define ll long long
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define PB push_back
#define MP make_pair
#define bitcount __builtin_popcount
#define watch(x) cerr<< (#x) << " is " << (x) <<"\n";
#define s... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | d063c5be3ad5276438d695c64b1967ce | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int64_t> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<int64_t> pref = a;
vector<int64_t> suff = a;
for(int i = 0; i + 2 < n; i++){
pref[i + 2] += pref[i];
}
for(int i = n - 1; i >= 2; i--)... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | 442db9f7df508f0d3d286def3d2185fa | 2,100 | PASSED |
#include <bits/stdc++.h>
#include <stdio.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
const int maxn=1e6;
const int mod=1e9+7;
const int inf=123456789;
const ll p=2e18;
using namespace std;
ull n,t,m,ans,a[maxn],b[maxn];
bool cmp(int i,int j){
return a[i]<a[j];
}
void run(){
... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | 1667beffee6d0885b131b566903d6c02 | 2,100 | PASSED |
//Created By:Hardik Kapoor
#include<bits/stdc++.h>
using namespace std;
//template begins
#define int long long int
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);
#define itt vector<int>:: iterator
#define pb push_back
#define mp make_pair
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) ma... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | 7e5e97f172b044cc902c218d2b65046c | 2,100 | PASSED |
#include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <set>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
using namespace std;
typedef long long ll;
int n;
ll a[200001];
ll d[200001];
int main() {
ios_base::sync_with_stdio(false)... | C++ | a9473e6ec81c10c4f88973ac2d60ad04 | 3a0d3a86594207af785708705c1f2618 | 2,100 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.