source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int f[1000009];
main()
{
int n,s,ans=100000000,t=0,q=0,z=0,p;
cin>>n>>s;
if(n==1) {cout<<0<<endl; return 0;} p=n;
for (int i=0; i<n; i++)
{
int a;
cin>>a;
if(i==s-1 && a!=0) {q++; a=0;}
if(i!=s-1 && a==0) {t++;}
f[a... | C++ | 3def8503f4e7841d33be5b4890065526 | 629418071f8580ca17abc4675f9d9657 | 1,900 | PASSED |
///written by Fekete///
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pii;
typedef vector<ll> vi;
typedef vector< pii > vii;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ins insert
#define ... | C++ | 3def8503f4e7841d33be5b4890065526 | 8fc5b99c4f3dda7a86d1549260f18b7c | 1,900 | PASSED |
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include<stack>
using namespace std;
#define OO ll(1e18)
#define MOD ll(1000000007)
typedef unsigned long long ull;
typedef long long ll;
bool ar[1111];
int main() {
int n, p, c = 0;
string s, str;
cin >> n >> p... | C++ | 788ae500235ca7b7a7cd320f745d1070 | 6724367da1aaa6f78bb4ce3d95947b15 | 1,700 | PASSED |
#include<bits/stdc++.h>
/*
expect problems and eat them for breakfast
*/
/*************************** MACROS **************************/
#define itn int
#define ld long double
#define ll long long
#define ull unsigned long long
#define vll vector<ll>
#define pb push_back
#define mp make_pair
#define S second
#defin... | C++ | 788ae500235ca7b7a7cd320f745d1070 | d00892abfbe87a7d454305236ce8d202 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,p, flag=0;
string s;
void pos()
{
int ptr1=n-2, ptr2=n-1;
while(flag==0 && ptr1>=0)
{
ptr1=s.size()-2;
ptr2=s.size()-1;
if(s[ptr2]-'a'+1>p)
{ if(ptr2==0)
break;
s.erase(s.begin()+ptr2);
s[ptr2-1]++;
}
else if(s[ptr1]==s[ptr2])
s[ptr2]++;
... | C++ | 788ae500235ca7b7a7cd320f745d1070 | cb87d9a7ed8708f8795c04fda324e631 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,p, flag=0;
string s;
void pos()
{
int ptr1=n-2, ptr2=n-1;
while(flag==0 && ptr1>=0)
{
ptr1=s.size()-2;
ptr2=s.size()-1;
if(s[ptr2]-'a'+1>p)
{ if(ptr2==0)
break;
s.erase(s.begin()+ptr2);
s[ptr2-1]++;
//cout<<"$1 ";
}
else if(s[ptr1]==s[ptr... | C++ | 788ae500235ca7b7a7cd320f745d1070 | 1032115a0ef54dbbf7d1fd6a9ac12aad | 1,700 | PASSED |
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int,int>
... | C++ | 788ae500235ca7b7a7cd320f745d1070 | aa2ff7bec3a3afcbc9ce8792a40c69b2 | 1,700 | PASSED |
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int,int>
... | C++ | 788ae500235ca7b7a7cd320f745d1070 | edc101478d777a959c10f1017e2078c3 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define tc(i) (char)('a'+i)
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n , p ;
cin>>n>>p;
string a ;
cin>>a;
for(int i=n-1;i>-1;i--){
string lc;
for(int j=max(i-2,0);j<i;j++) lc += a... | C++ | 788ae500235ca7b7a7cd320f745d1070 | e67d1edf97a9a0fa7abe3542c7bac6eb | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
# define ll long long
int main()
{
ios_base::sync_with_stdio(0);
ll n,p;
cin>>n>>p;
string s;
cin>>s;
string last;
char z='a'+p-1;
char y=z-1;
char x=y-1;
int i;
for(i=0;i<n;)
{
if(i<n)
last.push_back(z);
i++;
if(i<n)
last.push_back(y);... | C++ | 788ae500235ca7b7a7cd320f745d1070 | 18b112c11e951adfad4e123204cf840c | 1,700 | PASSED |
/******************************************************\
* *
* <Shablon information> : *
* <Created by> : <X1st> *
* <Version> : <1.1b> *
* <Date of last change> : ... | C++ | 788ae500235ca7b7a7cd320f745d1070 | ac07e506db2486c74317dbdd070e5c5b | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> II;
typedef vector< II > VII;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vector< VI > VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (in... | C++ | 788ae500235ca7b7a7cd320f745d1070 | 8f559ee210ca93e9fa3c0cdcca2ec965 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0); cin.tie(0);
#define fore(i, a, b) for(int i = a; i < b; i++)
#define fori(i, a, b) for(int i = a; i <= b; i++)
#define pb push_back
#define popb pop_back
#define mk make_pair
#define f first
#define s second
#define endl '\n... | C++ | 4b423274448ff3f0dee7644203706805 | d6cd3afb1a6c3b5f24e09bc2ccf3d3df | 1,500 | PASSED |
#include<bits/stdc++.h>
#define hell 1000000007
#define lcm(a,b) (a*b)/__gcd(a,b)
#define ll long long
#define vll vector<ll>
#define vi vector< int >
#define pll vector< pa... | C++ | 4b423274448ff3f0dee7644203706805 | 366a1dac7cb67e38be9f49185afd978c | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define f(j,n) for(int i=j;i<n;i++)
#define ll long long int
int main()
{
int n,k;
cin>>n>>k;
int a[n],l=0,p=0;
set<int>s,v;
f(0,n)
{
cin>>a[i];
s.insert(a[i]);
if(s.size()==k)
{
l=i+1;
break;
... | C++ | 4b423274448ff3f0dee7644203706805 | b70ce455a1a4acba353a519ee079dddb | 1,500 | PASSED |
#include<iostream>
#include<cmath>
#include<set>
using namespace std;
set<int>s,t;
int main()
{
int a[100005];
int n,i,m,j,k;
bool flag,Flag;
cin>>n>>m;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
flag=false;Flag=false;
for(i=1;i<=n;i++)
{
t.insert(a[i]);
if(t.size()... | C++ | 4b423274448ff3f0dee7644203706805 | c2dcb88a59bb7d32deac10088139922b | 1,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
int main()
{
int n, k;
int counts[100001];
bool flag[100001];
scanf("%d%d", &n, &k);
int arr[100001];
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
int l, r = 1;
for (; r <= n; r++)
{
counts[arr[r]]++;
if ... | C++ | 4b423274448ff3f0dee7644203706805 | 9743d521671a511bc70ac3a174eae3e0 | 1,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
const int N = 100001;
int main()
{
int n, k;
int arr[N];
int counts[N];
bool flag[N];
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
int sum = 0, l, r;
bool val = 0;
for (int i = 1; i <= n; ... | C++ | 4b423274448ff3f0dee7644203706805 | 2dbb4cfec619b8b3116360c597c557a3 | 1,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
const int N = 100001;
int main()
{
int n, k;
int arr[N];
int counts[N];
bool flag[N];
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
int l, r;
for (int i = 1; i <= n; i++)
{
counts[arr[i... | C++ | 4b423274448ff3f0dee7644203706805 | c048e7a5cd0fc8c7dcc583ae10ee5965 | 1,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
const int N = 100001;
int main()
{
int n, k;
int arr[N];
int counts[N];
bool flag[N];
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
int l, r;
bool val = 0;
for (int i = 1; i <= n; i++)
{
... | C++ | 4b423274448ff3f0dee7644203706805 | 8e5c1ebfd5f1270f376193159de56e20 | 1,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
const int N = 100001;
int main()
{
int n, k;
int arr[N];
int counts[N];
bool flag[N];
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
int l, r;
for (int i = 1; i <= n; i++)
{
counts[arr[i... | C++ | 4b423274448ff3f0dee7644203706805 | 1ddeeb5327d1ac93959205b7832075df | 1,500 | PASSED |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
const int N = 100001;
int main()
{
int n, k;
int arr[N];
int counts[N];
bool flag[N];
while (~scanf("%d%d", &n, &k))
{
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
memset(flag, 0, sizeof(flag));
memset(co... | C++ | 4b423274448ff3f0dee7644203706805 | 26da9a9c9be0d1d78b6473df585abe18 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | d5e0f771d88bc6c847f234fdc8343e41 | 2,700 | PASSED |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | d4328dc40e16f46131a51098a1917f1e | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | 1fe7a16e28e7b08b01d3f2cc14c7196f | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int ans[maxn];
map<int,int> mp;
int n;
void query(int L,int R,int &x,int &f){
printf("? %d %d\n", L,R);
fflush(stdout);
scanf("%d%d",&x,&f);
return ;
}
void dfs(int L,int R){
if(L > R) return ;
int x,f;
query(L,R,x,f)... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | db3974634764c1197cfd6b1a272d2784 | 2,700 | PASSED |
// {{{
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR(i, b, e) for (int i = (b); i <= (e); i++)
#define FORD(i, b, e) for (int i = (e); i >= (b); i--)
#define MP make_pair
#define FS ... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | 2c2d7baa7c49026b925421c85d3775db | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FOR(a,b) for (int a=0; a<b; a++)
#define FUR(a,b) for (int a=1; a<=b; a++)
#define ROF(a,b) for (int a=b; a-->0; )
#define RUF(a,b) for (int a=b; a>0; a--)
#define FORR(a,b,c) for (int a=b; a<c; a++)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | 86a058e182b5e951234c8f087767e2a9 | 2,700 | PASSED |
//
// Created by watemus on 12.07.2020.
//
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define FF first
#define SS second
using ll = long long;
using ld = long double;
template<typename T>
using vec... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | e9d2e118b0dbe3cb6a26b5d1ed380343 | 2,700 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e6+5;
long long arr[MAXN];
map<int,int> m1;
pair<int,int> query(int l,int r){
cout<<"? "<<l<<" "<<r<<endl;
cout.flush();
int x,f;
cin>>x>>f;
return make_pair(x,f);
}
void determine(int l,int r){
if(l>r){
... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | 9800c8d584183cb94eaf8b6779b803ea | 2,700 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e6+5;
long long arr[MAXN];
map<int,int> m1;
map<int,int> m2;
pair<int,int> query(int l,int r){
cout<<"? "<<l<<" "<<r<<endl;
cout.flush();
int x,f;
cin>>x>>f;
return make_pair(x,f);
}
void determine(int l,int r)... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | c787d9fb2e23c338ad2cc2f3e2edaed3 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int,int> pii;
#define x first
#define y second
const int N=2e5+100;
int a[N];
pii ask(int l,int r)
{
cout<<"? "<<l<<" "<<r<<endl;
int x;
cin>>x;
if(x==-1)
exit(0);
int... | C++ | 9ce4b5ae7fafe68494aa4c0c560a467c | 2a9f955f8ee2123b9f0f7d058ebeb58d | 2,700 | PASSED |
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
long long i,j,k,l,n,m,s,sum,A,C,tot,an;
const long long pp= 1000000007 ;
const long long N=210;
class arr
{
public:
long long x,y;
}a[N];
long long f[N][N];
long long X(long long ... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | c90ce6ea703fb00a853ad575de34b1a1 | 2,500 | PASSED |
#pragma comment(linker,"/STACK:100000000000,100000000000")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <iomanip>
#include <queue>
#include <map>
#include <fu... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 43e8d8756626cceb97983ff90e1e49d1 | 2,500 | PASSED |
#pragma comment(linker,"/STACK:100000000000,100000000000")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <iomanip>
#include <queue>
#include <map>
#include <fu... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 5d97a7be85ef5017dbd3d5d2c43f10e4 | 2,500 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 300;
#define ll long long
#define mod 1000000007
int n, x[N], y[N], dp[N][N];
bool get(int x, int y, int x2, int y2){
return (x * 1ll * y2 - x2 * 1ll * y) > 0;
}
int main(){
#ifndef ONLINE_JUDGE
freopen ("in","r",s... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 117df4acbb80324b8b7956e893358269 | 2,500 | PASSED |
/**************************************************************
But God commendeth his love toward us,
in that, while we were yet sinners, Christ died for us.
***************************************************************/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cm... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | e6f13854b5b2e41bc2c199b5331f3004 | 2,500 | PASSED |
/*
** CF 438C The Child and Polygon
** Created by Rayn @@ 2014/10/01
*/
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 210;
cons... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | e345f3e125ca2f324d392c89c7261191 | 2,500 | PASSED |
// The Child and Polygon.cpp : //
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 205
#define MOD 1000000007
using namespace std;
int n;
long long dp[MAXN][MAXN];
struct Point
{
int x,y;
Point(){}
Point(int x, int y):x(x),y(y){}
inline void read()
{
scanf("%d%d",&x,&y);
}
}vertex[MAXN];... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 7cb726b1c583d69960a02877ba9cd5d4 | 2,500 | PASSED |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1000000007;
struct point{
ll x,y;
point(){}
point(ll _x,ll _y){
x=_x;y=_y;
}
ll operator ^(const point &b)const{
retu... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 0ab8699ea8d4c22072f1c2183cf8c35f | 2,500 | PASSED |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<iostream>
using namespace std;
int n;
const int MOD=7+(int)1e9;
#define N 300
typedef long long LL;
struct point{
LL x,y;
void read(){
int xx,yy;
scanf("%d%d",&xx,&yy);
x=xx;y=yy;
}point operator -(point a){
return (point){x-a.x... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 5648c4c8f0498774bcf5960a88dee912 | 2,500 | PASSED |
/* 1.1
* 注意
* 1. 注意舍入方式(0.5 的舍入方向);防止输出-0.
* 2. 几何题注意多测试不对称数据.
* 3. 整数几何注意 xmult 和 dmult 是否会出界;
* 符点几何注意 eps 的使用.
* 4. 避免使用斜率;注意除数是否会为 0.
* 5. 公式一定要化简后再代入.
* 6. 判断同一个 2*PI 域内两角度差应该是
* abs(a1-a2)<beta||abs(a1-a2)>pi+pi-beta;
* 相等应该是
* abs(a1-a2)<eps||abs(a1-a2)>pi+pi-eps;
* 7. 需要的话尽量使用 atan2,注意:atan2(0,0)=0... | C++ | 2339fe6a7b09a941ab65ba73adcdb446 | 8923b82fba2e8b906f4532fca58758fd | 2,500 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define F first
#define S second
#define pb push_back
#define N 300006
int dp[N],c[N],cnt[N],sub[N],n,z=0;
vector<int> graph[N];
void dfs1(int u,int p)
{
int v,j,f=1,k=0;
map<int,int> mp;
set<int> s;
map<int,int>... | C++ | aaca5d07795a42ecab210327c1cf6be9 | 5973005a58ac4290cac8bafa763c14de | 1,600 | PASSED |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
vector <vector <int> > g;
vector <int> color;
vector <bool> used;
vector <bool> chernyshovnn;
vector <bool> hz;
int ... | C++ | aaca5d07795a42ecab210327c1cf6be9 | 2018279391a92dbefc5417bf10fa9e8c | 1,600 | PASSED |
#include <bits/stdc++.h>
#define ps push_back
#define fi first
#define se second
#define mr make_pair
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-10;
const double pi = acos(-1.0);
typedef long long ll;
typedef unsigned long long ULL;
const int maxn = 100000 + 10;
vector<int>g[maxn];
int c[ma... | C++ | aaca5d07795a42ecab210327c1cf6be9 | b0ce89829cc0683726dc801decdee35d | 1,600 | PASSED |
#include <bits/stdc++.h>
#define ps push_back
#define fi first
#define se second
#define mr make_pair
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-10;
const double pi = acos(-1.0);
typedef long long ll;
typedef unsigned long long ULL;
const int maxn = 100000 + 10;
vector<int>g[maxn];
unorder... | C++ | aaca5d07795a42ecab210327c1cf6be9 | ce949963dd1aaa232664576b6b4f8e97 | 1,600 | PASSED |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <cmath>
#include <map>
#include <set>
using namespace std;
int vis[100000] ={0} , a[100002];
vector< pair<int , int> > edge;
vector < vector <int> > path;
bool fail = 0;
void bfs(int x, int c, int len)
{
if (fail) return ;
vis[x] ... | C++ | aaca5d07795a42ecab210327c1cf6be9 | ac07817c80d488b88b5a603eb32d4d09 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define mp make_pair
#define pii pair<int,int>
#define F first
#define S second
#define sz(x) (int)(x).size()
#define nopos string::npos
#define fr(... | C++ | aaca5d07795a42ecab210327c1cf6be9 | 733399f7612ffb0354001c8f16117cc1 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define mp make_pair
#define pii pair<int,int>
#define F first
#define S second
#define sz(x) (int)(x).size()
#define nopos string::npos
#define fr(... | C++ | aaca5d07795a42ecab210327c1cf6be9 | 1c75e884764d08ee891b8b6065759cea | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const double EPS = 1.0E-9;
const double PI = acos(-1.0);
const int N = 1 << 18 ;
int gcd(int x, int y){ return y == 0 ? x : gcd(y, x % y); }
int lcm(int x, int y){ int d = gcd(... | C++ | aaca5d07795a42ecab210327c1cf6be9 | fc4c840330dba42b8bf0aa83482cf2af | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<vector <int > > a;
vector<int > vert;
int color[100002],vis[100002],fl,flag;
int dfs(int b, int c, int parent){
vis[b] = 1;
//cout << "On " << b << "Color " << c << "parent " << parent << endl;
for(int i=0;i<a[b].size();i++){
if(vis[a[b][i]] == 0) dfs(a[b][i], ... | C++ | aaca5d07795a42ecab210327c1cf6be9 | e787f2f28ac6cfd334615a0c17f09172 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<vector <int > > a;
vector<int > vert;
int color[100002],vis[100002],fl,flag;
int dfs(int b, int c, int parent){
vis[b] = 1;
//cout << "On " << b << "Color " << c << "parent " << parent << endl;
for(int i=0;i<a[b].size();i++){
if(vis[a[b][i]] == 0) dfs(a[b][i], ... | C++ | aaca5d07795a42ecab210327c1cf6be9 | 2ec8121c4ac3514e00b75f0d4f026c29 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define maxn 5010
#define INF 0x3f3f3f3f
int n;
int a[maxn];
int pre[maxn],nex[maxn];
int las[maxn];
int mm[maxn];
int dp1[maxn][20];
int dp2[maxn][20];
void init()
{
mm[0]=-1;
for(int i=1;i<=n;++i)
{
mm[i]=((i&(i-1))==0)?mm[i-1]+1:mm[i-1];
dp1[i]... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | a4bb707162bf78753e9fa68f9f4add9d | 1,900 | PASSED |
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
#define big_int -10000000000
ll n,arr[10000],first[10000],last[10000],vis[10000],xor_val[10000],dp[10000];
ll solve(ll i)
{
if(i>n)
return 0;
if(dp[i]!=-1)
return dp[i];
ll ans=big_int,sum=... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 5b40f80d27350d87886cf4d488eac5d1 | 1,900 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int N=5010;
int n,m;
int a[N],cnt;
int pl[N],pr[N];
long long dp[N];
long long w[N][N];
int ps[N];
int maxa=0;
int main(){
// freopen("er.in","r",stdin);
cin>>n;
for (int i=0;i<=... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | a99dda601aae3d50d25480a09ec2d4aa | 1,900 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
int a[ 5005 ];
int f[ 5005 ];
int l[ 5005 ];
int u[ 5005 ], dp[ 5005 ];
int main() {
cin.sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (!f[a[i]])
f[a[i]] = i;
l[a[i]] = i;
}
for ... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | bc9aac34fbc5176677ef3a0cc7f9019e | 1,900 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define MEM(x,v) memset(x,v,sizeof(x))
using namespace std;
const int M=5005;
typedef pair<int,int> pii;
template <class T>
inline void Rd(T &p){
p=0;char c;
while(c=getchar(),c<48);
do p=p*10+(c&15);
while(c=getchar(),c>47);
}
int n,a... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 7e9f69ded5f6893700f6bfff37d6962d | 1,900 | PASSED |
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define ll long long
#define up(i,j,n) for(int i=(j);i<=(n);i++)
#define db double
#define pii pair<int,int>
#define pb push_back
#define FILE "dealing"
#define eps 1e-8
template<class T> inline bool cmin(T&a,T b){return a>b?... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 69a9e92cf3195050d2f8d410ac8b9c92 | 1,900 | PASSED |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int d[10000],e[10000],f[10000],g[10000];
bool b[10000];
int i,j,n,l,r,t;
int main()
{
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&g[i]);
for (i=1;i<=n;i++)
{
if (! d[g[i]])
d[g[i]]=i;
e[g[i]]=i;
}
for (i=1;i<=n;i++)
{
... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 8fa7c422b14fffab3ffe6cb636490cd6 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5;
int ans[N] = {};
int a[N], s[N], l[N];
int n;
void find_first(){
for(int i=0;i<n;i++){
if(s[a[i]] == -1){
s[a[i]] = i;
}
}
return;
}
void find_last(){
for(int i=n-1;i>=0;i--){
if(l[a[i]] == -1){
l[a[i]] = i;
}
}
return;
}
pai... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 22fa84db04e1020098c569f908f368f6 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5;
int ans[N] = {};
int a[N], s[N], l[N];
int n;
void find_first(){
for(int i=0;i<n;i++){
if(s[a[i]] == -1){
s[a[i]] = i;
}
}
return;
}
void find_last(){
for(int i=n-1;i>=0;i--){
if(l[a[i]] == -1){
l[a[i]] = i;
}
}
return;
}
pai... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 1dfc0bbb1b7c6842e1e0dbd3843a4c1f | 1,900 | PASSED |
#include <iostream>
#include <stack>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 5007;
int ar[maxn];
int leftt[maxn];
int rightt[maxn];
int dp[maxn];
int main()
{
int n;
cin>>n;
for(int i =0 ; i < maxn ; i++){
leftt[i] = 1e6;
... | C++ | 158a9e5471928a9c7b4e728b68a954d4 | 73ddd7adde56b5daeb035919fcf88da0 | 1,900 | PASSED |
/*
* Task: D -
* Lang: C/C++11
* Author: comtalyst
* Site: Codeforces Round #419 (Div. 2)
* Last Update: 25/6/2017
*/
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
using namespace std;
/* Note
----------------------------
Learned :
Bugs found & solved :
----------------------------
*/
#define x fir... | C++ | 56b207a6d280dc5ea39ced365b402a96 | d8d435a66a69369739a2bb915bcdd410 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int inf = 0x3c3c3c3c;
const long long infl = 0x3c3c3c3c3c3c3c3c;
struct point{
int pi, pj;
};
int N,M,K;
point points[10003];
int dist[10003];
vector<int> endable;
vector<pair<int,int> > G[10003];
int S,T;
bool isDist1(po... | C++ | 56b207a6d280dc5ea39ced365b402a96 | 37d00d4a252e3aadcb8853f4f8bd8a25 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int inf = 0x3c3c3c3c;
const long long infl = 0x3c3c3c3c3c3c3c3c;
int N,M,K;
int par[10003];
vector<int> G[10003];
map<pair<int,int>,int> num;
int dist[10003];
int find(int u){
return par[u] == u ? u : par[u] = find(par[u]... | C++ | 56b207a6d280dc5ea39ced365b402a96 | aa85d4def20fe3cfee3bf5cfc998c9a1 | 2,200 | PASSED |
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<map>
#define pushin(x,s) { if(s<mem[x]) { mem[x]=s; if(!inq[x]) { Q.push(x); inq[x]=1; } } }
using namespace std;
const int N=10005;
struct node{int x,y;}px[N],py[N];
int mem[N],To_X[N],To_Y[N];
bool inq[N];
queue<int> Q;... | C++ | 56b207a6d280dc5ea39ced365b402a96 | fe74807d9b7016f19dbaa6f6ad5e0b1c | 2,200 | PASSED |
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<map>
#define pushin(x,s) { if(s<mem[x]) { mem[x]=s; if(!inq[x]) { Q.push(x); inq[x]=1; } } }
using namespace std;
const int N=10005;
struct node{int x,y;}px[N],py[N];
int mem[N],To_X[N],To_Y[N];
bool inq[N];
queue<int> Q;... | C++ | 56b207a6d280dc5ea39ced365b402a96 | b5286a84d8ebf1cc28c43db12038be91 | 2,200 | PASSED |
#include<stdio.h>
#define ll long long
const ll inf=1<<30-1;
ll n,m,k,litx[100001],lity[100001],q[100001],top,tail,dis[100001],book[100010];
ll d(ll x){return x>0?x:-x;}
int main(){
scanf("%lld%lld%lld",&n,&m,&k);
int qn=k,m1,m2=0;
while(k){
ll x,y;
scanf("%lld%lld",&x,&y);
if(x==1&&y==1)m1=qn-k+1;
if(x==n&&... | C++ | 56b207a6d280dc5ea39ced365b402a96 | 04d5cd7820c3142d7030b7f5c523ee1c | 2,200 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<climits>
#include<cmath>
#define ms(i, j) memset(i, j, sizeof i)
#define LL long long
#define db double
#define fir first
#define sec second
#define mp make_pa... | C++ | 56b207a6d280dc5ea39ced365b402a96 | bf09886a16d1e1e498f87bff5a5c2517 | 2,200 | PASSED |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<climits>
#include<cmath>
#define ms(i, j) memset(i, j, sizeof i)
#define LL long long
#define db double
#define fir first
#define sec second
#define mp make_pa... | C++ | 56b207a6d280dc5ea39ced365b402a96 | e7f7b6bc748e82a450499cf62e61bba1 | 2,200 | PASSED |
#include <cstdio>
#include <queue>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const bool debug = false;
const int maxn = 1e4 + 10;
const int MOD = 1000000007;
vector<int> vx[maxn], vy[maxn];
int x[maxn], y[maxn], d[maxn];
bool vis[maxn];
struct Node {
int id, v;
Node(int id ... | C++ | 56b207a6d280dc5ea39ced365b402a96 | 29043ac11c928e73d0b72e2a042e657c | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define PN printf("\n")
#define MODV 1000000007
typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
void addmod(int &a, ll b){a=(a... | C++ | 56b207a6d280dc5ea39ced365b402a96 | e9569bffb40fa24c7d15f2ad1b0b0d5d | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin>>n;
int sum=0;
string ans;
for( long long int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
if(sum+x<=500)
{sum+=x;
ans+='A'; }
else
{sum-=y;
ans+='G';}
}
cout<<ans;
return 0;
}
| C++ | 24fe280b88575516ec679ff78641440e | ff5ec362e7d8157d78d2f2e07bd10e1d | 1,500 | PASSED |
#include<stdio.h>
//using namespace std;
#define FOR(i, a, n) for (register int i = (a); i < (int)(n); ++i)
int main()
{
int n,g,a,Sa=0; scanf("%d",&n);
FOR(i, 0, n)
{
scanf("%d %d",&a,&g);
if(Sa+a<=500) {printf("%c",'A'); Sa+=a;}
else{ printf("%c",'G'); Sa-=g;}
}
return 0;
}... | C++ | 24fe280b88575516ec679ff78641440e | 2daeac187ef7d16c315e84918adec5dd | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long sum=0;
for(int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
sum+=x;
}
int k=(sum+499)/1000;
string s;
int i;
for( i=0;i<k;i++)
{
s+='G';
}
for(i;i<n;i++)
... | C++ | 24fe280b88575516ec679ff78641440e | 5b3003d6b64264d39a584c72dbcaf5ef | 1,500 | PASSED |
//
// main.cpp
// B. Painting Egg
//
// Created by Esteban Arocha Ortuño on 9/29/17.
// Copyright © 2017 EstebanAO. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
int main() {
int iEggs;
vector<pair<int, int>> numEggs;
cin>>iEggs;
int temp1, temp2;
for (... | C++ | 24fe280b88575516ec679ff78641440e | 0bbf4b5e173a33bacfa7774152eb95ca | 1,500 | PASSED |
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main() {
int n, ai, gi, a = 0, g = 0; string ans;
cin >> n;
while (n--) {
cin >> ai >> gi;
if (abs(g+gi-a) > abs(a+ai-g)) { a += ai; ans += "A"; }
else { g += gi; ans += "G"; }
}
if (abs(a-g... | C++ | 24fe280b88575516ec679ff78641440e | 21719b380e274dc277cbae6b6daa57eb | 1,500 | PASSED |
#include <iostream>
using namespace std;
int main() {
int n, ai, gi, delta = 0; string ans;
cin >> n;
while (n--) {
cin >> ai >> gi;
if (delta+ai < 500) { delta += ai; ans += "A"; }
else { delta -= gi; ans += "G"; }
}
if (delta>500 || delta<-500) cout << -1;
else co... | C++ | 24fe280b88575516ec679ff78641440e | cf9134cc88392e6ce6fa9ba0f4fcd102 | 1,500 | PASSED |
#include <fstream>
using namespace std;
int main() {
int n, ai, gi, delta = 0;
scanf("%d", &n);
while (n--) {
scanf("%d%d", &ai, &gi);
if (delta+ai < 500) { delta += ai; printf("A"); }
else { delta -= gi; printf("G"); }
}
}
| C++ | 24fe280b88575516ec679ff78641440e | 3c303953eec3f29b609d27965264de2e | 1,500 | PASSED |
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main() {
int n, ai, gi, delta = 0; string ans;
cin >> n;
while (n--) {
cin >> ai >> gi;
if (delta+ai < 500) { delta += ai; ans += "A"; }
else { delta -= gi; ans += "G"; }
}
if (delta>500 || ... | C++ | 24fe280b88575516ec679ff78641440e | 16f8fbac0caf8ecfec9abe5f00a25c7a | 1,500 | PASSED |
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main() {
int n, ai, gi, a = 0, g = 0; string ans;
cin >> n;
while (n--) {
cin >> ai >> gi;
if (a+ai-g <= 500) { a += ai; ans += "A"; }
else { g += gi; ans += "G"; }
}
if (abs(a-g) > 500) cou... | C++ | 24fe280b88575516ec679ff78641440e | fcde973b0237883d03bf7484e47bf39a | 1,500 | PASSED |
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main() {
int n, ai, gi, a = 0, g = 0; string ans;
cin >> n;
while (n--) {
cin >> ai >> gi;
if (abs(a+ai-g) < abs(g+gi-a)) { a += ai; ans += "A"; }
else { g += gi; ans += "G"; }
}
if (abs(a-g... | C++ | 24fe280b88575516ec679ff78641440e | e96009fec0068d9b7c41743774375c5e | 1,500 | PASSED |
# http://codeforces.com/contest/667/problem/B
# https://en.wikipedia.org/wiki/Triangle_inequality
# 「Generalization to any polygon」参照。
# 三角不等式の一般化が載っている。
# ポリゴンができる条件は最長辺が残りすべての辺の長さの和より短いこと
# longest< x+(total-longest)
# ∴ x > 2*longest-total
n = int(input())
lst = list(map(int, input().split()))
print(2 * max(lst) -... | Python | f00d94eb37c98a449615f0411e5a3572 | 784d0720df6b78ba1dce2cc79183593c | 1,100 | PASSED |
n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
x = 0
for i in range(1,n):
x += a[i]
ans = abs(a[0] - x) + 1
print(ans) | Python | f00d94eb37c98a449615f0411e5a3572 | 12a08505f25186b88c2ce79989c2c142 | 1,100 | PASSED |
##n = int(input())
##a = list(map(int, input().split()))
##print(" ".join(map(str, res)))
n = int(input())
l = list(map(int, input().split()))
l.sort()
sum = 0
for i in range(0, n-1):
sum += l[i]
res = l[n-1]-sum+1
print(res) | Python | f00d94eb37c98a449615f0411e5a3572 | 5ca8f6a9275114772f6d0593fe52caf1 | 1,100 | PASSED |
n = int(input())
l = list(map(int,input().split()))
l.sort(reverse=True)
total = sum(l)
answer = 2*l[0] - total +1
print(answer)
| Python | f00d94eb37c98a449615f0411e5a3572 | 5e63a8e411bd5ecbba426542d3e9533e | 1,100 | PASSED |
import sys
import os
import math
from sys import stdin, stderr, stdout, exit
n = int(stdin.readline())
a = list(map(int, stdin.readline().strip().split()))
print(2*max(a) - sum(a) + 1)
| Python | f00d94eb37c98a449615f0411e5a3572 | d8adb93e7d1be2747a2d95886ac01f74 | 1,100 | PASSED |
import math
n = int(input())
l = [int(p) for p in input().strip('\n').split(' ')]
a = max(l)
b = int(math.ceil(max(l)/2))
c = int(math.floor(max(l)/2)) + 1
temp = -1 * (sum(l) - a - b - c)
print(str(temp))
| Python | f00d94eb37c98a449615f0411e5a3572 | 98a95d66763750075563008e28885254 | 1,100 | PASSED |
n=input()
n=list(map(int,input().split()))
print(2*max(n)-sum(n)+1) | Python | f00d94eb37c98a449615f0411e5a3572 | aede2c9dc963a5f7c4772af8d0bb5b66 | 1,100 | PASSED |
n = int(input())
l = list(map(int, input().split()))
print (2*max(l) - sum(l) + 1)
| Python | f00d94eb37c98a449615f0411e5a3572 | b8441be3c24b13cc01fdb28116fde366 | 1,100 | PASSED |
#----Kuzlyaev-Nikita-Codeforces-----
#------------08.04.2020-------------
import math
alph="abcdefghijklmnopqrstuvwxyz"
#-----------------------------------
n=int(input())
l=list(map(int,input().split()))
l.sort();p=sum(l)
print(2*l[-1]-p+1)
| Python | f00d94eb37c98a449615f0411e5a3572 | 4c550e2887016b4e39840f4d95ee49a0 | 1,100 | PASSED |
def main():
input()
l = list(map(int, input().split()))
print(max(l) * 2 - sum(l) + 1)
if __name__ == '__main__':
main()
| Python | f00d94eb37c98a449615f0411e5a3572 | a2c290e5c43ed1ddb932792c94b4ab79 | 1,100 | PASSED |
/*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
using pii = pair<ll, ll>;
const double PI = acos(-1.0);
... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | c703a3abcc5a4c5162be20c74176f5bd | 1,900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define nmax 200010
using namespace std;
int n,f[nmax];
ll a[nmax],g[nmax];
vector<int> vt[nmax];
void dfs(int u)
{
g[u]=a[u];
if (vt[u].size()==0)
{
f[u]=1;
return;
}
for (int v:vt[u])
{
dfs(v);
f[u]+=f[v];
... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | 82263587e2b3a0b2d098ed92b0a64e79 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define setbits(x) __builtin_popcountll(x)
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#de... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | c2f954edc336600c68a84a67e646feac | 1,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define ff first
#define ss second
#define setbits(x) __builtin_popcountll(x)
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#de... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | cb8a1c98d5c27a31a451eb746ef77bbc | 1,900 | PASSED |
// Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define mx 200005
#define ll long long
#define mod 1000000007
int ar[mx];
char ch[mx];
int n,m,k,ii;
pair<int,pair<ll,ll>>cal[mx];
vector<int>g[mx];
pair<int,pair<ll,ll>> dfs(int u)
{
pair<int,pair<ll,ll>>re,tem;
ll sum=0;
ll boro=0... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | 97b54b0ad5de4b361c5314a37df911e5 | 1,900 | PASSED |
// Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define mx 200005
#define ll long long
#define mod 1000000007
ll ar[mx];
char ch[mx];
int n,m,k,ii;
pair<ll,pair<ll,ll>>cal[mx];
vector<int>g[mx];
pair<ll,pair<ll,ll>> dfs(int u)
{
pair<ll,pair<ll,ll>>re,tem;
ll sum=0;
ll boro=0;
... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | c7026e144256a3f9703d5576a21dcb1b | 1,900 | PASSED |
#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define rep(i,t,n) for(int i=t;i<n;i++)... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | 6f0479f4436ce5dd608d5a21040b7058 | 1,900 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <algorithm>
#include <math.h>
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef vector<int> vii;
typedef long long ll;
/**
*
* @author anhtaihsgs
*/
vector<vector<int>> e;
vector<int> a;
vecto... | C++ | 18cf79b50d0a389e6c3afd5d2f6bd9ed | dab44550f40614e05f1bed114ae89927 | 1,900 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.