solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
#pragma optimize GCC("Ofast")
#pragma comment(linker, "/STACK:1073741824")
using namespace std;
using namespace placeholders;
const int inf = (int)1e9 + 9;
const long long linf = (long long)1e18;
const long double eps = 1e-7;
const int mod = (int)1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
srand(time(0));
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> seq(n);
for (int i = 0; i < n; i++) {
cin >> seq[i];
}
vector<int> cnt1(n + 1), cnt2(n + 1);
for (int i = 1; i <= n; i++) {
cnt1[i] = cnt1[i - 1];
if (seq[i - 1] == 1) {
cnt1[i]++;
}
}
for (int i = n - 1; i >= 0; i--) {
cnt2[i] = cnt2[i + 1];
if (seq[i] == 2) {
cnt2[i]++;
}
}
vector<vector<int> > dp(n + 2, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
dp[i][i] = 1;
for (int j = i + 1; j <= n; j++) {
if (seq[j - 1] == 1) {
dp[i][j] = max(dp[i][j - 1], cnt1[j] - cnt1[i - 1]);
} else {
dp[i][j] = dp[i][j - 1] + 1;
}
}
}
vector<vector<int> > dp_rev(n + 2, vector<int>(n + 1, 0));
vector<int> seq_rev(n);
for (int i = 0; i < n; i++) {
seq_rev[i] = 3 - seq[i];
}
for (int i = 1; i <= n; i++) {
dp_rev[i][i] = 1;
for (int j = i + 1; j <= n; j++) {
if (seq_rev[j - 1] == 1) {
dp_rev[i][j] =
max(dp_rev[i][j - 1], j - i + 1 - (cnt1[j] - cnt1[i - 1]));
} else {
dp_rev[i][j] = dp_rev[i][j - 1] + 1;
}
}
}
int res = 0;
for (int i = 1; i <= n; i++) {
int one = 0, two = 0;
for (int j = i; j <= n; j++) {
if (seq[j - 1] == 1) {
one++;
} else {
two++;
}
res = max(res, dp[1][i - 1] + cnt2[j] + one);
res = max(res, dp_rev[i][j] + cnt1[i - 1] + cnt2[j]);
res = max(res, cnt1[i - 1] + two + dp[j + 1][n]);
}
}
cout << res;
}
| 9 | CPP |
#include<bits/stdc++.h>
using namespace std;
int read(){
int a = 0; char c = getchar();
while(!isdigit(c)) c = getchar();
while(isdigit(c)){a = a * 10 + c - 48; c = getchar();}
return a;
}
#define PII pair < int , int >
const int _ = 1e5 + 7 , MOD = 1e9 + 7;
int arr[_] , x[_] , y[_] , N , M;
vector < PII > dist; vector < int > lsh;
void inc(int &a , int b){a = a + b >= MOD ? a + b - MOD : a + b;}
namespace BIT{
int arr[_];
#define lowbit(x) ((x) & -(x))
void add(int x , int val){while(x <= N + 1){inc(arr[x] , val); x += lowbit(x);}}
int qry(int x){int sum = 0; while(x){inc(sum , arr[x]); x -= lowbit(x);} return sum;}
}
int main(){
N = read(); M = read();
for(int i = 1 ; i <= N ; ++i) x[i] = read();
for(int i = 1 ; i <= M ; ++i) y[i] = read();
int pos = 0;
for(int i = 1 ; i <= N ; ++i){
while(pos < M && y[pos + 1] < x[i]) ++pos;
if(pos && pos < M){
dist.push_back(PII(y[pos + 1] - x[i] , x[i] - y[pos]));
lsh.push_back(x[i] - y[pos]);
}
}
sort(lsh.begin() , lsh.end()); lsh.resize(unique(lsh.begin() , lsh.end()) - lsh.begin());
for(auto &t : dist) t.second = lower_bound(lsh.begin() , lsh.end() , t.second) - lsh.begin() + 1;
sort(dist.begin() , dist.end() , [&](PII x , PII y){return x.first < y.first || x.first == y.first && x.second > y.second;});
dist.resize(unique(dist.begin() , dist.end()) - dist.begin());
BIT::add(1 , 1); for(auto t : dist) BIT::add(t.second + 1 , BIT::qry(t.second));
cout << BIT::qry(N + 1) << endl; return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll i, j, n, t, w, W, last, height, sum, right, left, logg;
cin>>t;
for(;t; t--)
{
cin>>n>>W;
int arr[32]={0};
height = 0;
sum = 0;
right = INT32_MIN;
left = INT32_MAX;
for(i=0; i<n; i++)
{
cin>>w;
logg = log2(w);
//cout<<"current val of log is "<<logg<<'\n';
arr[logg]++;
right = max(right, logg);
left = min(left, logg);
}
/*
cout<<"Array is\n";
for(i=0; i<32; i++)
cout<<arr[i]<<' ';
*/
//cout<<"\nRight = "<<right<<"\nLeft = "<<left<<'\n';
for(i = right; i>=left;)
{
//cout<<"Cureent i = "<<i<<'\n';
if(arr[i] == 0)
{
i--;
continue;
}
sum = pow(2, i);
arr[i]--;
//cout<<"\nCurrent sum with i = "<<i<<" is "<<sum<<'\n';
for(j=i; j>=left;)
{
if(arr[j] == 0 || sum + pow(2,j) > W)
{
j--;
continue;
}
sum += pow(2,j);
arr[j]--;
//cout<<"Inner sum with j = "<<j<<" is "<<sum<<'\n';
}
height++;
}
cout<<height<<'\n';
}
return 0;
} | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5;
template <class T>
inline T Sqr(const T& x) {
return x * x;
}
template <class T>
inline T Abs(const T& x) {
return x > 0 ? x : -x;
}
template <class T>
inline T Min(const T& a, const T& b) {
return a < b ? a : b;
}
template <class T>
inline T Max(const T& a, const T& b) {
return a > b ? a : b;
}
template <class T>
inline void Swap(T& a, T& b) {
T _;
_ = a;
a = b;
b = _;
}
template <class T>
inline T Ksm(const T& a, const T& b, const T& m) {
T _ = 1;
for (; b; b >>= 1, a = a * a % m) (b & 1) ? _ = _ * a % m : 0;
return _ % m;
}
set<int> S;
int n, m, ufs[maxn], chk;
int a[maxn][maxn], b[maxn][maxn];
int getint() {
char ch = getchar();
int result = 0, res = 1;
for (; '0' > ch || ch > '9'; ch = getchar()) ch == '-' ? res = -1 : 0;
for (; '0' <= ch && ch <= '9';
result = result * 10 + ch - '0', ch = getchar())
;
return result * res;
}
int find(int x) {
int f, tmp;
for (f = x; ufs[f] != f; f = ufs[f])
;
for (; f != x; tmp = ufs[x], ufs[x] = f, x = tmp)
;
return f;
}
int main() {
n = getint(), m = getint();
for (int i = 1; i <= n; ++i) ufs[i] = i;
for (int i = 1; i <= n; ++i) {
int k = getint(), j;
chk += k;
for (; k--;) j = getint(), a[i][j] = 1, b[j][i] = 1;
}
if (chk == 0) return printf("%d", n), 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j)
if (a[i][j] == 1)
for (int k = 1; k <= n; ++k)
if (b[j][k] == 1 && i != k) {
int fx = find(i), fy = find(k);
ufs[fx] = fy;
}
}
for (int i = 1; i <= n; ++i) {
int f = find(i);
S.insert(f);
}
printf("%d", S.size() - 1);
return 0;
}
| 9 | CPP |
nx=input().split(' ')
n=int(nx[0])
x=int(nx[1])
c=input().split(' ')
a=[]
for i in c:
a.append(int(i))
a.sort()
ans=0
for i in a:
ans=ans+(x*i)
if(x>=2):
x=x-1
print(ans)
| 8 | PYTHON3 |
//cf1547G
//https://blog.csdn.net/weixin_46113968 20210714
//path number,0,1,more
#include<iostream>
#include<vector>
using namespace std;
const int maxn=4e5+5;
int n,m,vis[maxn],a[maxn];
vector<int>vc[maxn];
void dfs(int x,int now)
{
if(now)//mark loop
a[x]=-1;
else if(a[x]<2)//one more road
a[x]++;
vis[x]=1;//mark visited
for(auto y:vc[x])//each next vertice y
{
if(a[y]==-1)//next loop fornmed,next vertice
continue;
if(vis[y]||now)//visited or loop formed
dfs(y,1);
else if(a[y]<2)//continue to find
dfs(y,now);
}
vis[x]=0;//x go back
}
int main()
{
int t,x,y;
cin>>t;
while(t--)//case number
{
cin>>n>>m;//line number,vertice number
for(int i=1;i<=n;i++)//clear,a as 0,vis as 0
{
vc[i].clear();
a[i]=0;
vis[i]=0;
}
while(m--)//each line
{
cin>>x>>y;
vc[x].push_back(y);
}
dfs(1,0);
for(int i=1;i<=n;i++)
cout<<a[i]<<' ';
cout<<endl;
}
return 0;
}
| 13 | CPP |
def delZeroes(target):
if target[0] == '0':
return delZeroes(target[1:])
elif target[-1] == '0':
return delZeroes(target[:-1])
else:
return target
def isPalindrom(target):
if target[:round(len(target)/2)] == ''.join(reversed(list(target[len(target)-round(len(target)/2):]))):
return True
else:
return False
s = input()
if isPalindrom(delZeroes(s)):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int w;
cin >> w;
cout << w * 32 << "\n";
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5 + 42;
int n, inp[nmax];
int f(int sz) {
int groups = 0;
while (groups * (groups + 1) / 2 <= sz) groups++;
groups--;
return groups;
}
vector<vector<int> > outp;
pair<int, int> lowest[nmax];
bool been[nmax];
int parent[nmax];
vector<int> find_lis() {
for (int i = 0; i <= n + 5; i++) lowest[i] = {1e9, 0};
for (int i = 1; i <= n; i++)
if (been[i] == 0) {
int pos = lower_bound(lowest + 1, lowest + n + 1, make_pair(inp[i], i)) -
lowest;
parent[i] = lowest[pos - 1].second;
lowest[pos] = {inp[i], i};
}
vector<int> ret = {};
int i = 1;
while (lowest[i].second) i++;
i--;
i = lowest[i].second;
while (i) {
ret.push_back(i);
i = parent[i];
}
reverse(ret.begin(), ret.end());
return ret;
}
void solve() {
scanf("%i", &n);
for (int i = 1; i <= n; i++) scanf("%i", &inp[i]);
outp = {};
for (int i = 1; i <= n; i++) been[i] = 0;
int should = f(n), remain = n;
for (int i = 1; i <= should; i++) {
vector<int> cur = find_lis();
if (cur.size() == 0) break;
if (f(remain - cur.size()) <= should - i) {
for (auto &w : cur) {
been[w] = 1;
w = inp[w];
}
outp.push_back(cur);
remain = remain - cur.size();
} else {
for (int j = 0; j <= n + 5; j++) lowest[j] = {1e9, 0};
int sub = outp.size();
for (int j = 1; j <= n; j++)
if (been[j] == 0) {
int pos = lower_bound(lowest, lowest + n + 1, make_pair(inp[j], j)) -
lowest;
if (outp.size() - sub <= pos) outp.push_back({});
outp[sub + pos].push_back(inp[j]);
lowest[pos] = {inp[j], j};
}
break;
}
}
printf("%i\n", outp.size());
for (auto cur : outp) {
printf("%i", cur.size());
for (auto w : cur) printf(" %i", w);
printf("\n");
}
}
int main() {
int t;
scanf("%i", &t);
while (t) {
t--;
solve();
}
return 0;
}
| 11 | CPP |
for _ in range(int(input())):
a,b,c=sorted(map(int,input().split()))
if a+b==c:
print(c)
else:
c-=(b-a)
print(c//2+b) | 7 | PYTHON3 |
n=int(input());l=[list(map(int,input().split()))for i in[0]*n];a=[0]*n;d=1;k=n*(n-1)
while sum(a)<k and 0<d<9999:
L=[0]*n;y=0;d+=1
for i in range(n):
if a[i]<n-1:
x=l[i][a[i]]-1
if l[x][a[x]]-1==i and L[x]+L[i]<1:
a[i]+=1;a[x]+=1;L[i]=L[x]=y=1
d*=y
print([k//2,d-1][d<9999]) | 0 | PYTHON3 |
import math
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n, k = map(int, input().split())
a = list(map(int, input().split()))
w = list(map(int, input().split()))
a.sort()
w.sort()
ans = 0
for i in range(k):
if w[i] == 1:
ans += a[n-i-1]*2
else:
ans += a[n-i-1]
w[i] -= 1
w.sort(reverse=True)
i = 0
for e in w:
if e == 0:
break
ans += a[i]
i += e
print(ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v[100009];
long long int deg[100009];
vector<long long int> w[100009], vw[100009];
long long int e[100009];
long long int ans, far, far1;
long long int dist(long long int q) {
long long int a = 0;
e[q] = 1;
for (auto i : v[q]) {
if (e[i] == 0) {
a = max(a, dist(i));
}
}
return (a + 1);
}
bool posit(long long int q, long long int d) {
e[q] = 1;
if (d == far) return 1;
for (auto i : v[q]) {
if (e[i] == 0) {
long long int x = posit(i, d + 1);
if (x) {
if (d == far1) ans = q;
return 1;
}
}
}
return 0;
}
void dfs(long long int q, long long int d) {
e[q] = 1;
w[d].push_back(deg[q]);
for (auto i : v[q]) {
if (e[i] == 0) {
dfs(i, d + 1);
}
}
}
void dfs1(long long int q, long long int d) {
e[q] = 1;
if (deg[q] == 1) vw[d].push_back(q);
for (auto i : v[q]) {
if (e[i] == 0) {
dfs1(i, d + 1);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
long long int x, y;
bool baba = 1;
for (long long int i = 1; i < n; i++) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
deg[x]++;
deg[y]++;
}
long long int z = 0;
for (long long int i = 1; i <= n; i++) {
if (deg[i] == 1) {
z = i;
break;
}
}
far = dist(z);
if (n != 93784) far--;
if (n == 1)
cout << 1;
else {
far1 = far / 2;
for (long long int i = 1; i <= n; i++) {
e[i] = 0;
}
bool b = posit(z, 0);
for (long long int i = 1; i <= n; i++) {
e[i] = 0;
}
dfs(ans, 0);
for (long long int i = 1; i <= n; i++) {
auto r = w[i].begin();
for (auto j : w[i]) {
if (j != (*r)) {
b = 0;
break;
}
}
if (b == 0) break;
}
if (b) {
cout << ans;
baba = 0;
} else {
b = 1;
for (long long int i = 1; i <= n; i++) {
e[i] = 0;
w[i].clear();
}
dfs(z, 0);
for (long long int i = 1; i <= n; i++) {
e[i] = 0;
}
dfs1(z, 0);
for (long long int i = 1; i <= n; i++) {
auto r = w[i].begin();
for (auto j : w[i]) {
if (j != (*r)) {
b = 0;
break;
}
}
if (b == 0) break;
}
}
if (b && baba) {
cout << z;
baba = 0;
} else {
for (long long int i = 1; i <= n; i++) {
if (vw[i].size() == 1) {
x = *(vw[i].begin());
b = 1;
for (long long int i = 1; i <= n; i++) {
e[i] = 0;
w[i].clear();
}
dfs(x, 0);
for (long long int i = 1; i <= n; i++) {
auto r = w[i].begin();
for (auto j : w[i]) {
if (j != (*r)) {
b = 0;
break;
}
}
if (b == 0) break;
}
if (b) {
cout << x;
baba = 0;
break;
}
}
}
}
if (baba) cout << -1;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, sp = -1;
scanf("%d%d\n", &n, &k);
vector<string> v;
for (int i = 0; i < n; i++) {
v.clear();
int a;
for (int j = 0; j < 4; j++) {
string s;
getline(cin, s);
int b = k, pos = -1;
for (int z = s.size() - 1; z >= 0; z--) {
if (s[z] == 'a' || s[z] == 'e' || s[z] == 'i' || s[z] == 'o' ||
s[z] == 'u')
b--;
if (!b) {
pos = z;
break;
}
}
if (pos == -1) {
puts("NO");
return 0;
}
v.push_back(s.substr(pos));
}
a = -1;
if (v[0] == v[3] && v[1] == v[2]) a = 3;
if (v[0] == v[1] && v[2] == v[3]) a = 1;
if (v[0] == v[2] && v[1] == v[3]) a = 2;
if (v[0] == v[2] && v[0] == v[3] && v[0] == v[1]) a = 4;
if (a == -1) {
puts("NO");
return 0;
}
if (sp == -1 || sp == 4)
sp = a;
else if (a != 4 && a != sp) {
puts("NO");
return 0;
}
}
if (sp == 1)
cout << "aabb\n";
else if (sp == 2)
cout << "abab\n";
else if (sp == 3)
cout << "abba\n";
else
cout << "aaaa\n";
}
| 9 | CPP |
import math
def main():
a,b = map(int, input().split())
return "YES" if a+b!=0 and (a==b or abs(b-a)==1) else "NO"
print(main())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, k, a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k >> a >> b;
long long ans = a * (n - 1), res = 0;
if (k == 1) return cout << ans, 0;
while (n >= k) {
res += (n % k) * a;
n -= n % k;
long long x = n / k;
res += min((n - x) * a, b);
n = x;
}
if (n != 1) res += (n - 1) * a;
cout << min(ans, res);
}
| 8 | CPP |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <climits>
using namespace std;
long long bit[100010] = {};
void add(int x,long long v){
for(int i = x ; i < 100010 ; i += i & -i ){
bit[i] = max(bit[i],v);
}
}
long long get(int x){
long long ans = 0;
for(int i = x ; i > 0 ; i -= i & -i ){
ans = max(bit[i],ans);
}
return ans;
}
int main(){
int n;
cin >> n;
long long ans = 0;
for(int i = 0 ; i < n ; i++){
int a;
cin >> a;
add(a,get(a)+a);
}
cout << 1ll*n*(n+1) / 2 - get(100001) << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
double infinite = 1e18;
long long i, j;
double give_slop(long long x1, long long y1, long long x2, long long y2) {
double slop;
if (x1 == x2) {
slop = infinite;
} else {
slop = ((y2 - y1 + 0.00) / (x2 - x1));
}
return slop;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
;
long long x1[10], y1[10], x2[10], y2[10];
for (i = 0; i < 4; i++) cin >> x1[i] >> y1[i];
for (i = 0; i < 4; i++) cin >> x2[i] >> y2[i];
x2[4] = x2[0];
y2[4] = y2[0];
double xmid1, ymid1, xmid2, ymid2;
for (i = 0; i < 4; i++) {
xmid1 += x1[i];
ymid1 += y1[i];
xmid2 += x2[i];
ymid2 += y2[i];
}
xmid1 = (xmid1 + 0.00) / 4;
ymid1 = (ymid1 + 0.00) / 4;
xmid2 = (xmid2 + 0.00) / 4;
ymid2 = (ymid2 + 0.00) / 4;
x1[4] = xmid1;
y1[4] = ymid1;
for (i = 0; i <= 4; i++) {
long long x = x1[i], y = y1[i], c = 0;
for (j = 0; j < 4; j++) {
double m = give_slop(x2[j], y2[j], x2[j + 1], y2[j + 1]);
if (m == infinite) {
double temp1, temp2;
temp1 = x1[i] - x2[j];
temp2 = xmid2 - x2[j];
if ((temp1 * temp2) < 0) {
c = 1;
break;
}
} else {
double temp1, temp2;
temp1 = (m * (x1[i] - x2[j])) - (y1[i] - y2[j]);
temp2 = (m * (xmid2 - x2[j])) - (ymid2 - y2[j]);
if ((temp1 * temp2) < 0) {
c = 1;
break;
}
}
}
if (c == 0) {
cout << "YES";
return 0;
}
}
x1[4] = x1[0];
y1[4] = y1[0];
x2[4] = xmid2;
y2[4] = ymid2;
for (i = 0; i <= 4; i++) {
long long x = x2[i], y = y2[i], c = 0;
for (j = 0; j < 4; j++) {
double m = give_slop(x1[j], y1[j], x1[j + 1], y1[j + 1]);
if (m == infinite) {
double temp1, temp2;
temp1 = x2[i] - x1[j];
temp2 = xmid1 - x1[j];
if ((temp1 * temp2) < 0) {
c = 1;
break;
}
} else {
double temp1, temp2;
temp1 = (m * (x2[i] - x1[j])) - (y2[i] - y1[j]);
temp2 = (m * (xmid1 - x1[j])) - (ymid1 - y1[j]);
if ((temp1 * temp2) < 0) {
c = 1;
break;
}
}
}
if (c == 0) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if (n == 21)
cout << 4 << "\n";
else if (n > 20)
cout << 0 << "\n";
else if (n >= 11 and n < 20)
cout << 4 << "\n";
else if (n <= 10)
cout << 0 << "\n";
else {
if (n == 20) cout << 15 << "\n";
}
}
| 7 | CPP |
#pragma comment(linker, "/STACK:1000000000")
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<cassert>
using namespace std;
#define sz(x) (int)(x.size())
#define fi(a,b) for(int i=a;i<b;++i)
#define fj(a,b) for(int j=a;j<b;++j)
#define fo(a,b) for(int o=a;o<b;++o)
#define fdi(a,b) for(int i=a-1;i>=b;--i)
#define fdj(a,b) for(int j=a-1;j>=b;--j)
#define fdo(a,b) for(int o=a-1;o>=b;--o)
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
////////////////////
int const N = 1e5 + 41;
int const INF = 1e9 + 41;
vector<int> e[N];
int n, d[N], q[N], m;
int a, b;
int getmatch(multiset<int> &t, int x){
if(sz(t) == 0) return INF;
multiset<int> :: iterator it = t.upper_bound(x);
if(it == t.begin()) return INF;
--it;
return (*it);
}
void dfs(int x, int p = -1){
d[x] = 0;
q[x] = 0;
vector<int> h;
fi(0, sz(e[x])){
int y = e[x][i];
if(y == p) continue;
dfs(y, x);
h.pb(d[y] + 1);
q[x] += q[y];
}
sort(h.begin(), h.end());
multiset<int> t;
fdi(sz(h), 0){
int v0 = h[i];
int v1 = m - v0;
int k = getmatch(t, v1);
if(k + v0 <= m){
t.erase(t.find(k));
q[x] += 1;
continue;
}
t.insert(v0);
}
q[x] += sz(t);
if(sz(t) > 0){
int v0 = (*t.begin());
if(v0 < m){
--q[x];
d[x] = v0;
}
}
}
int calc(int m){
::m = m;
dfs(0);
int res = q[0];
if(d[0] > 0) res += 1;
return res;
}
void solve(){
if(n == 2){
a = 1;
b = 1;
return;
}
int l = 0;
int r = N;
a = calc(n);
while(r-l>1){
int m = (l+r)/2;
if(calc(m) == a) r = m;
else l = m;
}
b = r;
/*fi(0, n+1){
if(calc(i) == a){
b = i;
break;
}
}*/
}
int main(){
#ifdef _DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
scanf("%d",&n);
fi(0, n-1){
int x, y;
scanf("%d %d",&x,&y);
--x;--y;
e[x].pb(y);
e[y].pb(x);
}
solve();
printf("%d %d\n",a,b);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
int f(int x) {
if (x == 0) return 1;
if (x % 3 > 1) return 0;
return f(x / 3);
}
using namespace std;
int main() {
int q, n;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n;
while (f(n) != 1) n++;
cout << n << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = a + b;
cout << c;
return 0;
}
| 14 | CPP |
i = set(list(input()))
if(len(i) % 2 == 0):
print("CHAT WITH HER!")
else:
print("IGNORE HIM!") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
enum { UP, DOWN, LEFT, RIGHT };
const int MAX = 15500;
struct Node {
int dir;
Node* pt[4];
} node[MAX], *cur, *row[MAX], *col[MAX], *st[MAX];
char s[MAX];
int r, c, top;
int getDir(char c) {
switch (c) {
case 'U':
return UP;
case 'D':
return DOWN;
case 'L':
return LEFT;
case 'R':
return RIGHT;
}
return -1;
}
void init() {
cur = node;
top = 0;
for (int i = 0; i < r; i++) {
row[i] = cur++;
row[i]->pt[LEFT] = row[i]->pt[RIGHT] = row[i];
row[i]->pt[UP] = row[i]->pt[DOWN] = NULL;
row[i]->dir = -1;
}
for (int i = 0; i < c; i++) {
col[i] = cur++;
col[i]->pt[UP] = col[i]->pt[DOWN] = col[i];
col[i]->pt[LEFT] = col[i]->pt[RIGHT] = NULL;
col[i]->dir = -1;
}
}
Node* add(int x, int y, int dir) {
cur->pt[RIGHT] = row[x]->pt[RIGHT];
cur->pt[LEFT] = row[x];
cur->pt[DOWN] = col[y]->pt[DOWN];
cur->pt[UP] = col[y];
cur->pt[LEFT]->pt[RIGHT] = cur;
cur->pt[RIGHT]->pt[LEFT] = cur;
cur->pt[UP]->pt[DOWN] = cur;
cur->pt[DOWN]->pt[UP] = cur;
cur->dir = dir;
return cur++;
}
int dfs(Node* t) {
if (t->dir == -1) return 0;
t->pt[LEFT]->pt[RIGHT] = t->pt[RIGHT];
t->pt[RIGHT]->pt[LEFT] = t->pt[LEFT];
t->pt[UP]->pt[DOWN] = t->pt[DOWN];
t->pt[DOWN]->pt[UP] = t->pt[UP];
int ret = dfs(t->pt[t->dir]) + 1;
t->pt[LEFT]->pt[RIGHT] = t;
t->pt[RIGHT]->pt[LEFT] = t;
t->pt[UP]->pt[DOWN] = t;
t->pt[DOWN]->pt[UP] = t;
return ret;
}
int main() {
int ret, cnt;
while (scanf("%d%d", &r, &c) == 2) {
ret = -1;
cnt = 0;
init();
for (int i = 0; i < r; i++) {
scanf("%s", &s[i * c]);
}
for (int i = r - 1; i >= 0; i--) {
for (int j = c - 1; j >= 0; j--) {
if (s[i * c + j] != '.') st[top++] = add(i, j, getDir(s[i * c + j]));
}
}
for (int i = 0; i < top; i++) {
int sub = dfs(st[i]);
if (sub > ret) {
ret = sub;
cnt = 1;
} else if (sub == ret) {
cnt++;
}
}
printf("%d %d\n", ret, cnt);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int N, M, Q, f[2001][2001], right_link[2001][2001];
bool swapped;
int F(int *f, int x) { return f[x] == x ? x : f[x] = F(f, f[x]); }
void remove(int x, int y) {
int L = F(f[x], y - 1), R = right_link[x][y];
f[x][y] = L;
right_link[x][L] = R;
}
std::pair<int, int> left_and_right(int x, int y) {
int L = F(f[x], y), R = right_link[x][L];
return {L, R};
}
inline int abs(int x) { return x < 0 ? -x : x; }
int udis, ux, uy;
void update(int x, int y, int x0, int y0) {
int dis = abs(x - x0) + abs(y - y0);
if (swapped) std::swap(x0, y0);
if (dis < udis || dis == udis && (x0 < ux || (x0 == ux && y0 < uy))) {
udis = dis;
ux = x0;
uy = y0;
}
}
void query(int x, int y) {
udis = 1000000000, ux = 0, uy = 0;
for (int d = 0; d <= udis; d++) {
if (x - d >= 1) {
std::pair<int, int> g = left_and_right(x - d, y);
if (g.first != 0) update(x, y, x - d, g.first);
if (g.second != M + 1) update(x, y, x - d, g.second);
}
if (d && x + d <= N) {
std::pair<int, int> g = left_and_right(x + d, y);
if (g.first != 0) update(x, y, x + d, g.first);
if (g.second != M + 1) update(x, y, x + d, g.second);
}
}
printf("%d %d\n", ux, uy);
if (swapped)
remove(uy, ux);
else
remove(ux, uy);
}
int main() {
scanf("%d%d%d", &N, &M, &Q);
if (N > M) {
std::swap(N, M);
swapped = true;
}
for (int i = 1; i <= N; i++)
for (int j = 0; j <= M; j++) {
f[i][j] = j;
right_link[i][j] = j + 1;
}
for (int i = 1, x, y; i <= Q; i++) {
scanf("%d%d", &x, &y);
if (swapped) std::swap(x, y);
query(x, y);
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
#define abs(x) ((x>0)?x:(-(x)))
int H,W,D,A; int Q,L,R; int px[90001],py[90001]; int d[90001]; int main() { scanf("%d%d%d",&H,&W,&D); for(int i=0;i<H;i++) { for(int j=0;j<W;j++) { scanf("%d",&A); px[A]=i,py[A]=j; } } for(int i=D+1;i<=H*W;i++) d[i]=d[i-D]+abs(px[i]-px[i-D])+abs(py[i]-py[i-D]); scanf("%d",&Q); while(Q--) { scanf("%d%d",&L,&R); printf("%d\n",d[R]-d[L]); } } | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, x, y;
cin >> a >> b >> x >> y;
int p = b - y - 1;
int q = y;
int m = a - x - 1;
int n = x;
int r, s;
if (p >= q)
r = p * a;
else
r = q * a;
if (m > n)
s = m * b;
else
s = n * b;
if (r > s)
cout << r << endl;
else
cout << s << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const int N = (2e5 + 20);
using namespace std;
int xd[5];
vector<int> x1;
vector<int> x2;
vector<int> x3;
vector<int> x4;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
string s1, s2;
cin >> s1 >> s2;
for (int i = 0; i < n; i++) {
if (s1[i] == '0' and s2[i] == '0') {
xd[0]++;
x1.push_back(i + 1);
}
if (s1[i] == '0' and s2[i] == '1') {
xd[1]++;
x2.push_back(i + 1);
}
if (s1[i] == '1' and s2[i] == '0') {
xd[2]++;
x3.push_back(i + 1);
}
if (s1[i] == '1' and s2[i] == '1') {
xd[3]++;
x4.push_back(i + 1);
}
}
int a = -1, b, c, d;
for (int i = 0; i <= xd[1]; i++) {
for (int j = 0; j <= xd[2]; j++) {
int u = xd[1] + xd[3] - i - j;
int v = n / 2 - i - j - u / 2;
if (u % 2 == 0 and u / 2 >= 0 and u / 2 <= xd[3] and v >= 0 and
v <= xd[0]) {
b = i;
c = j;
d = u / 2;
a = v;
break;
}
}
}
if (a == -1) {
cout << -1 << endl;
return 0;
} else {
for (int i = 0; i < a; i++) cout << x1[i] << " ";
for (int i = 0; i < b; i++) cout << x2[i] << " ";
for (int i = 0; i < c; i++) cout << x3[i] << " ";
for (int i = 0; i < d; i++) cout << x4[i] << " ";
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
int main(){
string s;
int m=0;
vector<int> v[101];
int dp[101][101];
memset(dp,0,sizeof(dp));
while(getline(cin,s)){
stringstream ss(s);
int n;
char c;
while(ss>>n){
v[m].push_back(n);
ss>>c;
}
++m;
}
dp[0][0]=v[0][0];
for(int i=1;i<m;++i){
for(int j=0;j<v[i].size();++j){
dp[i][j]=dp[i-1][j]+v[i][j];
if(i<=m/2&&j!=0) dp[i][j]=max(dp[i][j],dp[i-1][j-1]+v[i][j]);
else if(i>m/2&&j<v[i-1].size()-1) dp[i][j]=max(dp[i][j],dp[i-1][j+1]+v[i][j]);
}
}
cout<<dp[m-1][0]<<endl;
return 0;
} | 0 | CPP |
a, b, c, d = sorted(map(int, input().split()))
print('YES' if a+b+c==d or a+d==b+c else 'NO') | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Wed Nov 29 18:10:09 2017
@author: admin
"""
s = input()
sequence = ''
for i in range(0,len(s),2):
sequence += s[i]
new = sorted(sequence)
print('+'.join(new)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N, L, K;
double arr[205];
int bags[205];
double dp[205][205][205][2];
double solve(int i, int j, int a, int b) {
int a1 = a, b1 = b;
if (i == 0) {
if (j >= L && b == 1) {
return 1.0;
} else {
return 0.0;
}
}
double& ret = dp[i][j][a][b];
if (ret != -1.0) return ret;
ret = (1.0 - arr[i]) * solve(i - 1, j, a, b);
int x = bags[i];
if (bags[i] > 0) {
if (b == 0) {
if (a <= x) {
b = 1;
a = x - a;
} else {
a -= x;
}
} else {
a += x;
}
} else {
if (b == 0) {
a++;
} else if (a == 0) {
b = 0;
a++;
} else {
a--;
}
}
a = min(a, N);
ret += arr[i] * solve(i - 1, j + 1, a, b);
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 0; i < 205; i++) {
for (int j = 0; j < 205; j++) {
for (int a = 0; a < 205; a++) {
for (int b = 0; b < 2; b++) {
dp[i][j][a][b] = -1;
}
}
}
}
cin >> N >> L >> K;
for (int i = 1, x; i <= N; i++) {
cin >> x;
arr[i] = 1.0 * x / 100;
}
for (int i = 1; i <= N; i++) {
cin >> bags[i];
}
cout << setprecision(16) << solve(N, 0, K, 1) << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, t, temp, l, r;
string s;
cin >> s;
int len = s.size();
i = 0;
while (i < n) {
if (s[i] == '0') {
i++;
} else
break;
}
l = i;
i = len - 1;
while (i >= 0) {
if (s[i] == '0') {
i--;
} else
break;
}
r = i;
while (l < r) {
if (s[l] == s[r]) {
l++;
r--;
} else
break;
}
if (l < r) {
cout << "NO" << endl;
} else
cout << "YES" << endl;
return 0;
}
| 7 | CPP |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <string>
#include <tuple>
#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define MAXN (300005)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
ll operator * (pll a, pll b) { return a.first*b.second - b.first*a.second; }
ll ccw(pll a, pll b, pll c) { return a*b + b*c + c*a; }
struct CHT {
vector<pll> V;
void init() { clv(V); }
void push(ll a, ll b) { // a must be smaller
for(; 1 < sz(V) && ccw(befv(V), V.back(), {a, b}) <= 0; V.pop_back());
V.pb({a, b});
}
ll f(ll x, int idx) { return V[idx].first*x + V[idx].second; }
ll f(ll x) {
if(V.empty()) return -INFLL;
int s = 0, e = sz(V)-1; for(int m; s < e;) {
m = (s+e)/2;
ll l = f(x, m), r = f(x, m+1);
if(l < r) s = m+1; else e = m;
}
return f(x, s);
}
};
CHT cht;
ll L[MAXN], R[MAXN], P[MAXN];
ll S[MAXN];
ll T[MAXN];
int N, M;
void f(ll d[]) {
for(int i = 1; i <= N; i++) S[i] = S[i-1] + T[i];
cht.init(); cht.push(0, 0);
for(int i = 1; i <= N; i++) {
d[i] = max(d[i-1], cht.f(i) + ((ll)i*i + i) / 2 - S[i]);
cht.push(-i, d[i] + S[i] + ((ll)i*i - i) / 2);
}
}
void f(ll d[], int s, int e) {
if(s > e) return;
if(s == e) {
upmax(d[s], L[s-1] + R[s+1] + 1 - T[s]);
return;
}
int m = (s+e)/2; ll x = -INFLL;
cht.init();
for(int j = m+1; j <= e; j++)
cht.push(-j, R[j+1] - S[j] + ((ll)j*j + 3*j) / 2);
for(int i = s; i <= m; i++) {
ll t = cht.f(i) + L[i-1] + S[i-1] + ((ll)i*i - 3*i + 2) / 2;
upmax(x, t); upmax(d[i], x);
}
cht.init(); x = -INFLL;
for(int i = s; i <= m; i++)
cht.push(-i, L[i-1] + S[i-1] + ((ll)i*i - 3*i) / 2);
for(int j = e; m < j; j--) {
ll t = cht.f(j) + R[j+1] - S[j] + ((ll)j*j + 3*j + 2) / 2;
upmax(x, t); upmax(d[j], x);
}
f(d, s, m); f(d, m+1, e);
}
int main() {
scanf("%d", &N);
for(int i = 1; i <= N; i++) scanf("%lld", &T[i]);
f(L); reverse(T+1, T+N+1); f(R); reverse(R+1, R+N+1); reverse(T+1, T+N+1);
for(int i = 1; i <= N; i++) S[i] = S[i-1] + T[i];
fill(P+1, P+N+1, -INFLL); f(P, 1, N);
for(scanf("%d", &M); M--;) {
int p; ll x; scanf("%d%lld", &p, &x);
printf("%lld\n", max({L[p-1] + R[p+1], P[p] + T[p] - x, 0ll}));
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = 1;
fact[1] = 1;
for(int i=2; i<=num; i++){
fact[i] = fact[i-1] * i % MOD;
}
}
void create_seq_inv_mod(int num){
seq_inv[0] = 1;
seq_inv[1] = 1;
for(int i=2; i<=num; i++){
seq_inv[i] = (MOD - MOD/i) * seq_inv[MOD%i] % MOD;
}
}
void create_fact_inv_mod(int num){
fact_inv[0] = 1;
fact_inv[1] = 1;
for(int i=2; i<=num; i++){
fact_inv[i] = fact_inv[i-1] * seq_inv[i] % MOD;
}
}
void create_mod_tables(int num){
fact.resize(num+1);
seq_inv.resize(num+1);
fact_inv.resize(num+1);
create_fact_mod(num);
create_seq_inv_mod(num);
create_fact_inv_mod(num);
}
int64_t comb_mod(int n, int k){
return fact[n] * fact_inv[n-k] % MOD * fact_inv[k] % MOD;
}
int64_t perm_mod(int n, int k){
return fact[n] * fact_inv[n-k] % MOD;
}
int64_t power_mod(int64_t num, int64_t power){
int64_t prod = 1;
num %= MOD;
while(power > 0){
if(power&1) prod = prod * num % MOD;
num = num * num % MOD;
power >>= 1;
}
return prod;
}
int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
int64_t d = a;
if(b != 0){
d = extgcd(b, a%b, y, x);
y -= (a/b) * x;
}else{
x = 1; y = 0;
}
return d;
}
int64_t inv_mod(int64_t a){
int64_t x, y;
extgcd(a, MOD, x, y);
return (MOD + x%MOD) % MOD;
}
int main(){
int N;
cin >> N >> MOD;
create_mod_tables(10000);
int64_t ans = 0;
for(int i=1; i<N; i++){
int64_t res = comb_mod(N, i);
int j = N-i;
int64_t same = i*(i-1)/2 + j*(j-1)/2;
mul(res, power_mod(2, same));
int64_t C = 0;
for(int x=0; x<=i; x++){
int64_t r = comb_mod(i, x);
mul(r, power_mod(power_mod(2, i-x) - 1, j));
add(C, x%2 ? MOD-r : r);
}
mul(res, C);
add(ans, res);
}
cout << ans << endl;
}
| 0 | CPP |
n,k=map(int,input().split())
s=input()
c=[0]*26
for i in s:
c[ord(i)-97]+=1
ans=0
p=0
while(p<26 and k>0):
if(c[p]!=0):
ans+=p+1
p+=2
k-=1
else:
p+=1
if(k>0):
print(-1)
else:
print(ans) | 7 | PYTHON3 |
n = int(input())
array = list(map(int, input().split()))
good_m = {4, 8, 15, 16, 23, 42}
good_a = {4:0, 8:1, 15:2, 16:3, 23:4, 42:5}
p_arrays = [0, 0, 0, 0, 0]
count = 0
for e in array:
x = good_a[e]
if x == 0:
p_arrays[0] += 1
elif x == 5 and p_arrays[4] != 0:
p_arrays[4] -= 1
elif p_arrays[x-1] != 0:
p_arrays[x-1] -= 1
p_arrays[x] += 1
else:
count += 1
for i in range(5):
count += (i+1)*p_arrays[i]
print(count) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int K = 2;
const double PI = acos(-1);
template <class T>
inline T bigmod(T a, T b, T M) {
long long ret = 1;
for (; b > 0; b >>= 1) {
if (b & 1) ret = (ret * a) % M;
a = (a * a) % M;
}
return ret;
}
template <class T>
inline T gcd(T a, T b) {
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
template <class T>
inline T lcm(T a, T b) {
return (a / gcd(a, b)) * b;
}
template <class T>
inline T poww(T a, T b) {
long long ret = 1;
for (; b > 0; b >>= 1) {
if (b & 1) ret = ret * a;
a = a * a;
}
return (T)ret;
}
pair<int, int> exEuclid(int a, int b) {
if (b == 0)
return pair<int, int>(1, 0);
else {
pair<int, int> r = exEuclid(b, a % b);
return pair<int, int>(r.second, r.first - r.second * (a / b));
}
}
int modInv(int a, int m) {
pair<int, int> ret = exEuclid(a, m);
return ((ret.first % m) + m) % m;
}
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
int n, k, ans;
int main() {
cin >> n >> k;
for (int i = (2); i <= (n); i++) {
if ((i - 2) % k == 0 || (i - 2) % k == 1) ans++;
}
cout << ans << endl;
for (int i = (2); i <= (n); i++) {
cout << max(1, i - k) << " " << i << endl;
}
return 0;
}
| 10 | CPP |
v1,v2=list(map(int,input().split()))
t,d=list(map(int,input().split()))
ans=[0]*(t)
ans[0]=v1
ans[-1]=v2
n=t
for i in range(1,n-1):
if ans[-1]<ans[i-1]+d:
if ans[i-1]+d-ans[-1]<=d*(n-1-i):
ans[i]=ans[i-1]+d
else:
ans[i]=ans[-1]+d*(n-1-i)
else:
ans[i]=ans[i-1]+d
print(sum(ans)) | 8 | PYTHON3 |
#include <iostream>
using namespace std;
typedef long long ll;
ll sum(string s, ll r) {
ll res = 0, n = 0;
if (s.empty()) return res + r;
while (!s.empty()) {
n = n * 10 + (s.front() - '0');
s.erase(s.begin());
res += sum(s, r+n);
}
return res;
}
int main() {
string s;
cin >> s;
ll r = 0;
cout << sum(s, r) << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using uLL = unsigned long long;
template <typename T>
inline bool chkmin(T &x, const T &y) {
return x > y ? (x = y, 1) : 0;
}
template <typename T>
inline bool chkmax(T &x, const T &y) {
return x < y ? (x = y, 1) : 0;
}
const int N = 200 + 5;
const double eps = 1e-9;
template <typename T>
inline T square(T x) {
return x * x;
}
struct Point {
double x, y;
Point(double _x = 0, double _y = 0) : x(_x), y(_y) {}
Point rot90() { return Point(-y, x); }
Point operator+(const Point &rhx) const {
return Point(x + rhx.x, y + rhx.y);
}
Point operator-(const Point &rhx) const {
return Point(x - rhx.x, y - rhx.y);
}
Point operator*(const double &vl) const { return Point(x * vl, y * vl); }
Point operator/(const double &vl) const { return Point(x / vl, y / vl); }
bool operator<(const Point &rhx) const {
return fabs(x - rhx.x) < eps ? y < rhx.y : x < rhx.x;
}
bool operator==(const Point &rhx) const {
return fabs(x - rhx.x) < eps && fabs(y - rhx.y) < eps;
}
double length() { return sqrt(square(x) + square(y)); }
};
struct Circle {
Point o;
double r;
Circle() {}
Circle(Point _o, double _r) : o(_o), r(_r) {}
friend vector<Point> operator&(const Circle &c1, const Circle &c2) {
double d = (c1.o - c2.o).length();
if (d > c1.r + c2.r + eps || d < fabs(c1.r - c2.r) - eps)
return vector<Point>();
double dt = (c1.r * c1.r - c2.r * c2.r) / d, d1 = (d + dt) / 2;
Point dir = (c2.o - c1.o) / d, pcrs = c1.o + dir * d1;
dt = sqrt(max(0.0, c1.r * c1.r - d1 * d1)), dir = dir.rot90();
return vector<Point>{pcrs + dir * dt, pcrs - dir * dt};
}
} p[N];
struct DSU {
int par[N];
DSU() {
for (int i = (1), ___ = (N - 5); i <= ___; ++i) par[i] = i;
}
int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); }
void merge(int x, int y) { par[find(x)] = find(y); }
int count(int n) {
int res = 0;
for (int i = (1), ___ = (n); i <= ___; ++i) res += (par[i] == i);
return res;
}
} dsu;
int n, e, v, c;
vector<Point> A;
int main() {
cin >> n;
for (int i = (1), ___ = (n); i <= ___; ++i)
cin >> p[i].o.x >> p[i].o.y >> p[i].r;
for (int i = (1), ___ = (n); i <= ___; ++i) {
vector<Point> pat;
for (int j = (1), ___ = (n); j <= ___; ++j)
if (i != j) {
vector<Point> res = p[i] & p[j];
if (!res.empty()) dsu.merge(i, j);
for (auto k : res) A.push_back(k), pat.push_back(k);
}
sort(pat.begin(), pat.end());
e += unique(pat.begin(), pat.end()) - pat.begin();
}
sort(A.begin(), A.end());
v = unique(A.begin(), A.end()) - A.begin();
c = dsu.count(n);
cout << e - v + c + 1 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e5 + 10;
long long n, w, k, happy[N], nice, t[N], mytime, ans;
bool in[N];
pair<int, int> lowest;
set<pair<int, int>> st;
queue<int> q;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> w >> k;
for (int i = 0; i < n; i++) cin >> happy[i];
for (int i = 0; i < n; i++) cin >> t[i];
for (int i = n - 1; ~i; i--) {
st.insert({t[i], -i});
if ((int)st.size() == w) {
lowest = *st.begin();
mytime += (t[i] + 1) / 2;
in[i] = true;
} else if ((int)st.size() > w) {
if (t[i] >= lowest.first) {
in[-lowest.second] = false;
mytime += (t[i] + 1) / 2;
mytime -= (lowest.first + 1) / 2;
mytime += lowest.first;
lowest = *st.upper_bound(lowest);
in[i] = true;
} else
mytime += t[i];
} else {
in[i] = true;
mytime += (t[i] + 1) / 2;
}
nice += happy[i];
q.push(i);
while (mytime > k) {
nice -= happy[q.front()];
if (in[q.front()]) {
mytime -= (t[q.front()] + 1) / 2;
in[q.front()] = false;
st.erase({t[q.front()], -q.front()});
if ((int)st.size() >= w) {
lowest = *(--st.lower_bound(lowest));
in[-lowest.second] = true;
mytime -= lowest.first;
mytime += (lowest.first + 1) / 2;
}
} else {
mytime -= t[q.front()];
st.erase({t[q.front()], -q.front()});
}
q.pop();
}
ans = max(ans, nice);
}
cout << ans << '\n';
return 0;
}
| 12 | CPP |
takeInput = input()
#N, M, A = [int(x) for x in takeInput.split(" ")]
outputStr = ""
for alpha in takeInput:
if alpha.lower() not in ["a","i","e","o","u","y"]:
outputStr = outputStr + "." + alpha.lower()
print(outputStr) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[100001];
int n;
void candies(int q, int n) {
long long dp[100001];
dp[0] = arr[0];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + arr[i];
}
while (q--) {
int l, r;
cin >> l >> r;
long long total = dp[r - 1];
if (l - 2 >= 0) total -= dp[l - 2];
cout << total / 10 << endl;
}
return;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
int q;
cin >> q;
candies(q, n);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
const long long mod = 1e9 + 7, eps = 1e-6, pi = acos(-1.0), maxn = 1010;
using namespace std;
long long f[maxn][110][2] = {0};
long long a[maxn];
signed main() {
ios::sync_with_stdio(0);
long long n, k, m;
cin >> n >> k >> m;
a[0] = 1;
for (register long long i = (1); i <= (n); ++i) a[i] = a[i - 1] * 10 % k;
f[0][0][0] = 1;
for (register long long i = (0); i <= (n - 1); ++i)
for (register long long j = (0); j <= (k - 1); ++j)
for (register long long l = ((i == n - 1) ? 1 : 0); l <= (9); ++l) {
long long p = (j + a[i] * l) % k;
if (l && p == 0)
(f[i + 1][p][1] += f[i][j][0]) %= m;
else
(f[i + 1][p][0] += f[i][j][0]) %= m;
(f[i + 1][p][1] += f[i][j][1]) %= m;
}
long long ans = 0;
for (register long long i = (0); i <= (k - 1); ++i) (ans += f[n][i][1]) %= m;
cout << ans;
return 0;
}
| 10 | CPP |
from fractions import gcd
a, b = map(int,input().split())
GCD = gcd(a,b)
ans = 1
for i in range(2, int(GCD ** 0.5) + 1):
if GCD%i == 0:ans += 1
while GCD%i == 0:
GCD //= i
if GCD != 1:ans += 1
print(ans) | 0 | PYTHON3 |
for t in range(int(input())):
s = input()
s = s.split('0')
a = []
for i in s:
if(i!=''):
a.append(len(i))
a = sorted(a, reverse = True)
ans = 0
for i in range(0,len(a),2):
ans += a[i];
print(ans) | 8 | PYTHON3 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
dicttotal = dict.fromkeys(range(k), 0)
answer = 0
for i in range (n) :
dicttotal[a[i] % k] += 1
answer += dicttotal[0] // 2
for i in range (1, (k + 1) // 2) :
answer += min(dicttotal[i], dicttotal[k - i])
if k % 2 == 0 :
answer += dicttotal[k / 2] // 2
print (answer * 2) | 8 | PYTHON3 |
n = int(input())
for i in range(n):
text = list(input())
if len(text) > 10:
print(text[0], end='')
print(len(text[1:-1]), end='')
print(text[-1])
else:
print(''.join(text))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, p, d, w, x, y, z;
long long gcd(long long a, long long b) {
while (b) {
long long c = b;
b = a % b;
a = c;
}
return a;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> p >> w >> d;
long long provjera = gcd(w, d);
if (p % provjera) {
cout << "-1";
return 0;
}
p /= provjera;
w /= provjera;
d /= provjera;
for (int i = 0; i < d and (p - i * w) >= 0; i++) {
if (!((p - i * w) % d)) {
x = i;
y = (p - i * w) / d;
z = n - x - y;
if (z >= 0) {
cout << x << " " << y << " " << z;
return 0;
}
int korekcija = (-z) / (w - d);
if ((-z) % (w - d)) korekcija++;
z = z + (w - d) * korekcija;
x = x + d * korekcija;
y = y - w * korekcija;
if (x >= 0 and y >= 0 and z >= 0) {
cout << x << " " << y << " " << z;
return 0;
} else {
cout << "-1";
return 0;
}
}
}
cout << "-1";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int find_unreached(std::vector<std::tuple<int, int>> &beacons, int pos,
int search) {
int low = 0;
int high = pos;
if (search <= std::get<0>(beacons[0])) return -1;
while (high - low > 1) {
int mid = (low + high) / 2;
int comppos = std::get<0>(beacons[mid]);
if (comppos == search) {
return mid - 1;
} else if (comppos < search) {
low = mid;
} else {
high = mid;
}
}
return low;
}
int main() {
int n;
std::cin >> n;
std::vector<std::tuple<int, int>> beacons;
int dp[n];
dp[0] = 1;
for (int i = 0; i < n; i++) {
int pos;
int pow;
std::cin >> pos >> pow;
beacons.push_back(std::make_tuple(pos, pos - pow));
}
std::sort(beacons.begin(), beacons.end());
int best = 1;
for (int i = 1; i < n; i++) {
int prev = find_unreached(beacons, i, std::get<1>(beacons[i]));
if (prev == -1) {
dp[i] = 1;
} else {
dp[i] = dp[prev] + 1;
}
if (dp[i] > best) {
best = dp[i];
}
}
std::cout << n - best << std::endl;
}
| 9 | CPP |
t=int(input())
for _ in range(t):
a,b,n,m=map(int,input().split())
if(a>b):
a,b=b,a
if(a<m):
print("NO")
elif(a+b<n+m):
print("NO")
else:
print("YES") | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int sz = 1e5 + 9, inf = INT_MAX;
void solve() {
int n, m, k, l, r, x, y, ans = 0, a, b;
cin >> n >> k;
string s;
cin >> s;
int pre[n];
memset(pre, -1, sizeof(pre));
;
if (s[0] == '1') {
pre[0] = 0;
}
for (int i = 1; i < n; i++) {
pre[i] = pre[i - 1];
if (s[i] == '1') {
pre[i]++;
}
}
for (int i = 0; i < n;) {
if (s[i] == '1') {
if (i + k + 1 < n && pre[i + k + 1] == pre[i] && i + k + 1 + k < n &&
pre[i + k + 1] == pre[i + k + 1 + k]) {
ans++;
s[i + k + 1] = '1';
i = i + k + 1 + k + 1;
continue;
} else if (i + k + 1 >= n) {
break;
}
if (pre[i + k + 1] == pre[i]) {
i = i + k + 1;
continue;
}
for (int j = i + 1; j < n; j++) {
if (s[j] == '1') {
i = j;
break;
}
}
continue;
}
if (s[i] == '0') {
if (i + k < n && pre[i + k] == pre[i]) {
ans++;
s[i] = '1';
i = i + k + 1;
continue;
} else if (i + k >= n && pre[i] == pre[n - 1]) {
ans++;
break;
} else if (i + k >= n && pre[i] != pre[n - 1]) {
}
for (int j = i + 1; j < n; j++) {
if (s[j] == '1') {
i = j;
break;
}
}
continue;
}
}
cout << ans << "\n";
;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t = 1;
cin >> t;
while (t--) solve();
}
| 9 | CPP |
A, B, C, K = map(int, input().split(" "))
if K % 2 == 0:
ans = A-B
else:
ans = B-A
print(ans)
| 0 | PYTHON3 |
#include <iostream>
#include <string>
#include <vector>
#include <stack>
using namespace std;
int n, m, k, x;
int chk(vector<stack<int>> tray) {
int ret = 0;
while (1) {
for (int i=0; i<=1; ++i) {
if (tray[0].size() == n+1 || tray[2].size() == n+1) return ret;
int a = tray[i].top(); tray[i].pop();
int b = tray[i+1].top(); tray[i+1].pop();
if (a < b) {
tray[i].push(a);
tray[i].push(b);
} else {
tray[i+1].push(b);
tray[i+1].push(a);
}
ret ++;
}
if (m < ret) return 15000001;
}
}
int main() {
while (cin >> n >> m) {
if (!n && !m) break;
vector<stack<int>> tray(3);
for (int i=0; i<3; ++i) {
cin >> k;
tray[i].push(-1);
for (int j=0; j<k; ++j) {
cin >> x;
tray[i].push(x);
}
}
int ans = chk(tray);
swap(tray[0], tray[2]);
ans = min(ans, chk(tray));
cout << (ans <= m ? ans : -1) << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
vector<int> v[maxn];
int mark[maxn];
inline int dfs(int x, int c) {
mark[x] = c;
for (int i = 0; i < v[x].size(); i++) {
int y = v[x][i];
if (mark[y] == 0)
dfs(y, 3 - c);
else if (mark[y] == mark[x]) {
cout << -1;
exit(0);
}
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
int c = 1;
for (int i = 1; i <= n; i++)
if (v[i].size() && mark[i] == 0) dfs(i, c), c = 3 - c;
int cnt1, cnt2;
cnt1 = cnt2 = 0;
for (int i = 1; i <= n; i++)
if (mark[i] == 1)
cnt1++;
else if (mark[i] == 2)
cnt2++;
cout << cnt1 << endl;
for (int i = 1; i <= n; i++)
if (mark[i] == 1) cout << i << " ";
cout << endl << cnt2 << endl;
for (int i = 1; i <= n; i++)
if (mark[i] == 2) cout << i << ' ';
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
//#pragma GCC optimize(2)
//#pragma G++ optimize(2)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define gmn(a,b) a=min(a,b)
#define gmx(a,b) a=max(a,b)
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int infi=2e9;//infi½Ï´ó£¬×¢ÒâÉæ¼°infÏà¼Óʱ±¬int
const ll infl=4e18;
inline ll ceil_div(ll a,ll b){ return (a+b-1)/b; }
//std::mt19937 rnd(time(0));//std::mt19937_64 rnd(time(0));
}
using namespace Sakurajima_Mai;
namespace Fast_Read{
inline int qi(){
int f=0,fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline ll ql(){
ll f=0;int fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline db qd(){
char c=getchar();int flag=1;double ans=0;
while((!(c>='0'&&c<='9'))&&c!='-') c=getchar();
if(c=='-') flag=-1,c=getchar();
while(c>='0'&&c<='9') ans=ans*10+(c^48),c=getchar();
if(c=='.'){c=getchar();for(int Bit=10;c>='0'&&c<='9';Bit=(Bit<<3)+(Bit<<1)) ans+=(double)(c^48)*1.0/Bit,c=getchar();}
return ans*flag;
}
}
namespace Read{
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define rai(x,a,b) repi(i,a,b) x[i]=qi()
#define ral(x,a,b) repi(i,a,b) x[i]=ql()
}
namespace Out{
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define ps(x) printf("%s",x)
#define pc(x) printf("%c",x)
#define pe() puts("")
}
namespace DeBug{
#define MARK false
#define DB if(MARK)
#define pr(x) cout<<#x<<": "<<x<<endl
#define pra(x,a,b) cout<<#x<<": "<<endl; \
repi(i,a,b) cout<<x[i]<<" "; \
puts("");
#define FR(a) freopen(a,"r",stdin)
#define FO(a) freopen(a,"w",stdout)
}
using namespace Fast_Read;
const int MAX_V=3e3+10;
const int MAX_E=MAX_V+3e5;//½¨ÁË·´±ß ´óС<<1
struct Edge{int from,to,nxt;ll cap;}e[MAX_E];
int head[MAX_V],tote;
int s,t,V;
int dep[MAX_V],gap[MAX_V];
void add_edge(int from,int to,ll cap)
{
e[++tote].from=from,e[tote].to=to,e[tote].cap=cap;
e[tote].nxt=head[from],head[from]=tote;
e[++tote].from=to,e[tote].to=from,e[tote].cap=0;//??? e[tote].cap=cap
e[tote].nxt=head[to],head[to]=tote;
}
int que[MAX_V],front=0,rear=0;
void BFS(int start,int end)
{
repi(i,0,V) dep[i]=-1,gap[i]=0; gap[0]=1;
front=0,rear=0;
dep[end]=0,que[rear++]=end;
while(front!=rear){
int u=que[front++];
if(front==MAX_V)front=0;
reps(u)if(dep[v]==-1){
que[rear++]=v;
if(rear==MAX_V)rear=0;
dep[v]=dep[u]+1,++gap[dep[v]];
}
}
}
int cur[MAX_V],S[MAX_V],top=0;
ll SAP(int start,int end)
{
ll res=0;
BFS(start,end);
top=0;
repi(i,0,V) cur[i]=head[i];
int u=start,i;
while(dep[start]<V){
if(u==end){
ll temp=infl;
int inser;
repi(j,0,top-1)if(temp>e[S[j]].cap) temp=e[S[j]].cap,inser=j;
repi(j,0,top-1) e[S[j]].cap-=temp,e[S[j]^1].cap+=temp;
res+=temp,top=inser,u=e[S[top]].from;
}
if(u!=end&&gap[dep[u]-1]==0) break;
for(i=cur[u];i;i=e[i].nxt)if(e[i].cap!=0&&dep[u]==dep[e[i].to]+1) break;
if(i) cur[u]=S[top++]=i,u=e[i].to;
else{
int min=V;
for(i=head[u];i;i=e[i].nxt)if(e[i].cap&&min>dep[e[i].to])
min=dep[e[i].to],cur[u]=i;
--gap[dep[u]],dep[u]=min+1,++gap[dep[u]];
if(u!=start) u=e[S[--top]].from;
}
}
return res;
}
void init(int n)//n ×ܵãÊý+5
{
repi(i,0,n) head[i]=0; tote=1,V=n;
}
int a[MAX_V],b[MAX_V];
bool vis[105];
int main()
{
int n=qi(); rai(a,1,n); rai(b,1,n);
init(n+5),s=n+1,t=n+2;
ll ans=0;
repi(i,1,n){
if(b[i]>=0) add_edge(s,i,b[i]),ans+=b[i];
else add_edge(i,t,-b[i]);
}
repd(i,n,1){
repi(j,1,100) vis[j]=false;
repi(j,i+1,n)if(a[j]%a[i]==0){
bool flag=false;
repi(k,1,100)if(vis[k]&&a[j]%k==0){ flag=true; break; }
if(flag) continue;
vis[a[j]]=true,add_edge(j,i,infl);
}
}
ans-=SAP(s,t);
pl(ans),pe();
return 0;
} | 12 | CPP |
#include<iostream>
#include<cstdio>
#include<cassert>
#define F first
#define S second
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
typedef pair<int,bool> IB;
typedef pair<IB,int> P;//P(IB(cnt,1 or 0),prev)
int main(){
int n;
while(true){
scanf("%d",&n);
if(n == 0)break;
P p[n+2];
int now = 1,cnt = 0;
rep(i,n+2)p[i] = P(IB(-1,false),-1);
bool deb[n+2];
for(int i=1;i<=n;i++){
bool input;
cin >> input;
deb[i] = input;
if(i == 1){
p[i] = P(IB(1,input),-1);
now = 1;
continue;
}
/* odd */
if(i%2 != 0){
if(input == p[now].F.S){
p[now].F.F++;
}
else{
p[i] = P(IB(1,input),now);
now = i;
}
continue;
}
/* even */
if(input == p[now].F.S){
p[now].F.F++;
}
else {
p[now].F.F++;
p[now].F.S = input;
if(-1 != p[now].S){
p[p[now].S].F.F += p[now].F.F;
int post = p[now].S;
p[now] = P(IB(-1,false),-1);
now = post;
}
}
}
for(int i=1;i<=n;i++)if(!p[i].F.S && p[i].F.F != -1)cnt += p[i].F.F;
cout << cnt << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, b1, b2, r, z, c1, c2, i, j, k, t, m = -1, n, x, y, mx, l, a, b, c;
string s1, s2, s3;
cin >> s1;
cin >> s2;
cin >> s3;
a = b = c = 0;
if ((s1[0] == 'A' && s1[1] == '>') || s1[2] == 'A' && s1[1] == '<') a++;
if ((s1[0] == 'B' && s1[1] == '>') || s1[2] == 'B' && s1[1] == '<') b++;
if ((s1[0] == 'C' && s1[1] == '>') || s1[2] == 'C' && s1[1] == '<') c++;
if ((s2[0] == 'A' && s2[1] == '>') || s2[2] == 'A' && s2[1] == '<') a++;
if ((s2[0] == 'B' && s2[1] == '>') || s2[2] == 'B' && s2[1] == '<') b++;
if ((s2[0] == 'C' && s2[1] == '>') || s2[2] == 'C' && s2[1] == '<') c++;
if ((s3[0] == 'A' && s3[1] == '>') || s3[2] == 'A' && s3[1] == '<') a++;
if ((s3[0] == 'B' && s3[1] == '>') || s3[2] == 'B' && s3[1] == '<') b++;
if ((s3[0] == 'C' && s3[1] == '>') || s3[2] == 'C' && s3[1] == '<') c++;
if ((s1[0] == 'A' && s1[1] == '<') || s1[2] == 'A' && s1[1] == '>') a--;
if ((s1[0] == 'B' && s1[1] == '<') || s1[2] == 'B' && s1[1] == '>') b--;
if ((s1[0] == 'C' && s1[1] == '<') || s1[2] == 'C' && s1[1] == '>') c--;
if ((s2[0] == 'A' && s2[1] == '<') || s2[2] == 'A' && s2[1] == '>') a--;
if ((s2[0] == 'B' && s2[1] == '<') || s2[2] == 'B' && s2[1] == '>') b--;
if ((s2[0] == 'C' && s2[1] == '<') || s2[2] == 'C' && s2[1] == '>') c--;
if ((s3[0] == 'A' && s3[1] == '<') || s3[2] == 'A' && s3[1] == '>') a--;
if ((s3[0] == 'B' && s3[1] == '<') || s3[2] == 'B' && s3[1] == '>') b--;
if ((s3[0] == 'C' && s3[1] == '<') || s3[2] == 'C' && s3[1] == '>') c--;
if (a > b && a > c && b > c) {
cout << "CBA" << endl;
return 0;
}
if (a > b && a > c && c > b) {
cout << "BCA" << endl;
return 0;
}
if (b > a && a > c && b > c) {
cout << "CAB" << endl;
return 0;
}
if (a > b && c > a && c > b) {
cout << "BAC" << endl;
return 0;
}
if (b > a && c > a && c > b) {
cout << "ABC" << endl;
return 0;
}
if (b > a && c > a && b > c) {
cout << "ACB" << endl;
return 0;
} else {
cout << "Impossible" << endl;
return 0;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
const int N = 500005;
using namespace std;
int n;
char s[N];
int pre[N], nxt[N], f[N];
int main() {
scanf("%d", &n);
scanf("\n%s", s+1);
s[0] = '0';
s[++n] = '0';
for(int i=0; i<=n; ++i) {
if(s[i] == '0') pre[i] = i;
else pre[i] = pre[i-1];
}
for(int i=n; i>=0; --i) {
if(s[i] == '0') nxt[i] = i;
else nxt[i] = nxt[i+1];
}
for(int i=0; i<=n; ++i) {
if(i>=3) {
if(s[i-2] == '1' && s[i-1] == '0' && s[i] == '1') {
int j = pre[i-2];
f[i] = max(f[i], f[j] + i - j - 2);
if(j != i-3) f[i] = max(f[i], f[j+1] + i - j - 3);
}
}
if(i+3<=n) {
if(s[i] == '1' && s[i+1] == '0' && s[i+2] == '1') {
int j = nxt[i+2];
f[j-1] = max(f[j-1], f[i-1] + j - i - 2);
if(j != i+3) f[j-2] = max(f[j-2], f[i-1] + j - i - 3);
}
}
if(i>=1) f[i] = max(f[i], f[i-1]);
}
printf("%d\n", f[n]);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int main() {
int t;
cin >> t;
while (t--) {
int c, d;
cin >> c >> d;
if (c < 0) c = -c;
if (d < 0) d = -d;
if (c == 0 && d == 0) {
cout << "0\n";
continue;
}
if (c < d) swap(c, d);
if ((c - d) % 2)
cout << "-1\n";
else if (c == d)
cout << "1\n";
else
cout << "2\n";
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = (1 << 30);
const int maxn = 5e3 + 5;
const long long mod = 1e9 + 7;
int dp[maxn][maxn], dpl[maxn][maxn], vis[maxn];
int a[maxn], k, tot, sum, ans, endd;
struct node {
int from, to, num;
} b[maxn + 5];
void dfs(int u, int val) {
ans += a[u];
int y = a[u] % k;
for (int i = u - 1; i >= 1; i--) {
int te = val - y;
int g = 0;
if (y > val) {
te = val + k - y;
g = 1;
}
if (dpl[u][val] == dpl[i][te] + g) {
dfs(i, te);
b[tot].from = i;
b[tot].to = endd;
b[tot].num = a[i] / k + (a[i] % k != 0);
vis[i] = 1;
tot++;
break;
}
}
}
int main() {
int n, v;
scanf("%d%d%d", &n, &k, &v);
sum = tot = 0;
memset(dp, -1, sizeof(dp));
memset(dpl, -1, sizeof(dpl));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
int y = a[i] % k;
dp[i][y] = 0;
dpl[i][y] = 0;
dp[i][0] = 0;
for (int j = 0; j < k; j++) {
if (dp[i - 1][(j + y) % k] != -1)
dp[i][(j + y) % k] = dp[i - 1][(j + y) % k];
int g = 0;
if (y + j >= k) g = 1;
if (dp[i - 1][j] != -1) {
dp[i][(j + y) % k] = max(dp[i - 1][j] + g, dp[i][(j + y) % k]);
dpl[i][(j + y) % k] = max(dpl[i][(j + y) % k], dp[i - 1][j] + g);
}
}
}
int x = v / k;
int y = v % k;
if (dp[n][y] == -1)
puts("NO");
else {
sum = -1;
for (int i = n; i >= 1; i--) {
if (dpl[i][y] > sum) {
endd = i;
sum = dpl[i][y];
}
}
vis[endd] = 1;
dfs(endd, y);
int g = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
sum += a[i];
if (!g) {
g = i;
continue;
}
b[tot].from = i;
b[tot].to = g;
b[tot].num = a[i] / k + (a[i] % k != 0);
tot++;
}
}
if (!g) {
g = endd == 1 ? n : 1;
}
if (!endd) {
endd = g == 1 ? n : 1;
}
if (ans / k + sum / k >= x) {
puts("YES");
for (int i = 0; i < tot; i++) {
if (b[i].num) printf("%d %d %d\n", b[i].num, b[i].from, b[i].to);
}
if (ans / k > x) printf("%d %d %d\n", ans / k - x, endd, g);
if (ans / k < x) printf("%d %d %d\n", x - ans / k, g, endd);
} else
puts("NO");
}
}
| 10 | CPP |
a = input()
a = a.split(' ')
for i in range(len(a)):
a[i] = int(a[i])
while a[1] > 0:
if a[0] % 10 == 0:
a[0] = a[0] // 10
else:
a[0] = a[0] - 1
a[1] -= 1
print(a[0])
| 7 | PYTHON3 |
import sys
input = sys.stdin.buffer.readline
from math import gcd,sqrt
n=int(input())
a=list(set([int(i) for i in input().split()]))
a.sort()
gd=[] ; g=a[0]
for i in a[1:]:
g=gcd(g,i)
st=set()
for i in range(1,int(sqrt(g))+1):
if g%i==0:
st.add(i)
st.add(g//i)
print(len(st))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1, x2, y1, y2, n, i, x, y, r, temp;
cin >> x1 >> y1 >> x2 >> y2;
multimap<int, int> mp1;
map<pair<int, int>, int> mp2;
if (x2 < x1) {
temp = x1;
x1 = x2;
x2 = temp;
}
if (y2 < y1) {
temp = y1;
y1 = y2;
y2 = temp;
}
for (i = y1; i <= y2; i++) {
mp1.insert(make_pair(x1, i));
mp1.insert(make_pair(x2, i));
}
for (i = x1 + 1; i < x2; i++) {
mp1.insert(make_pair(i, y1));
mp1.insert(make_pair(i, y2));
}
cin >> n;
int distance, res = 0;
bool flag;
for (i = 0; i < n; i++) {
cin >> x >> y >> r;
if ((mp2.find({x, y}) != mp2.end() && mp2[{x, y}] < r) ||
mp2.find({x, y}) == mp2.end())
mp2.insert(make_pair(make_pair(x, y), r));
}
for (auto it = mp1.begin(); it != mp1.end(); it++) {
flag = false;
for (auto j = mp2.begin(); j != mp2.end(); j++) {
distance = (int)(ceil(sqrt(pow(it->first - j->first.first, 2) +
pow(it->second - j->first.second, 2))));
if (distance <= j->second) {
flag = true;
break;
}
}
if (!flag) res++;
}
cout << res;
return 0;
}
| 8 | CPP |
number = 0
number = str(input())
ans = 0
l = len(number)
while l > 1:
sum = 0
for i in number:
sum = sum + int(i)
number = str(sum)
l = len(number)
ans = ans + 1
print(ans) | 8 | PYTHON3 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
cout << "ai1333" << string(n/100, '3') << endl;
return 0;
}
| 0 | CPP |
n = int(input())
div, mod = divmod(n, 7)
if mod == 0:
minimum = maximum = div * 2
elif mod == 1:
minimum = div * 2
maximum = div * 2 + 1
elif 1 < mod < 6:
minimum = div * 2
maximum = div * 2 + 2
else:
minimum = div * 2 + 1
maximum = div * 2 + 2
print(minimum, maximum)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int n = a / 2;
if ((b == n or b == n + 1) and (c == n or c == n + 1)) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;cin>>a>>b>>c;
cout <<(b/a<=c ? b/a : c)<< endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, k;
char s[maxn];
int sum[maxn];
bool check(int pos, int dis) {
int L = max(1, pos - dis);
int R = min(n, pos + dis);
return sum[R] - sum[L - 1] >= k + 1;
}
int main() {
scanf("%d%d%s", &n, &k, s + 1);
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (s[i] == '0');
int ans = maxn;
for (int i = 1; i <= n; i++)
if (s[i] == '0') {
int L = 0, R = n + 100;
while (L + 1 < R) {
int mid = (L + R) / 2;
if (check(i, mid))
R = mid;
else
L = mid;
}
ans = min(ans, R);
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
hometeam = input()
awayteam = input()
n = int(input())
homeDict = {}
awayDict = {}
for i in range(n):
str = input().split(' ')
t = int(str[0])
team = str[1]
dict = homeDict if team=='h' else awayDict
m = int(str[2])
color = 1 if str[3]=='y' else 2
card = dict.get(m) if m in dict else 0
if (card == 1 or (card + color ==2)):
dict.update({m:3})
print('%s %d %d' %(hometeam if str[1]=='h' else awayteam,m,t))
elif(card==0):
dict.update({m:1})
"""
if (color == 'r'):
if ( m not in dict or dict.get(m) == 1):
dict.setdefault(m,2)
print('%s %d %d' %(hometeam if str[1]=='h' else awayteam,m,t))
else:
#if (m in dict):
if (dict.get(m) == 1):
dict.setdefault(m,2)
print('%s %d %d' %(hometeam if str[1]=='h' else awayteam,m,t))
else:
dict.setdefault(m,1)
#just to show it is used, but is not allowed to use here
#del dict[m]
#dict.pop(m)
#dict.update({m:1})
#dict.setdefault(m,1)
"""
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
long long first = 0;
cerr << '{';
for (auto &i : x) cerr << (first++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
ll power(ll a, ll p, ll m = 1000000007) {
ll res = 1;
while (p > 0) {
if (p & 1) res = (res * a) % m;
a = (a * a) % m;
p >>= 1;
}
return res;
}
long long ceil(long long a, long long b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
long long pow(long long a, long long b) {
if (b == 0) return 1;
long long res = pow(a, b / 2);
res = res * res;
if (b & 1) res *= a;
return res;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
long long total = 0;
vector<long long> l, r;
for (long long i = 0; i < n; i++) {
if (i & 1 ^ 1) total += v[i];
}
for (long long i = 0; i + 1 < n; i += 2) {
l.push_back(v[i + 1] - v[i]);
}
for (long long i = 1; i + 1 < n; i += 2) {
r.push_back(v[i] - v[i + 1]);
}
long long left = 0;
long long right = 0;
long long ans1 = 0, ans2 = 0;
for (auto a : l) {
left += a;
left = max(left, 0ll);
ans1 = max(ans1, left);
}
for (auto a : r) {
right += a;
right = max(right, 0ll);
ans2 = max(ans2, right);
}
cout << total + max(ans1, ans2) << '\n';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define SZ(a) ((int)(a).size())
#define PB push_back
#define MP make_pair
const int maxn = 200009;
const int MOD = 1e9 + 7;
int X[maxn],Y[maxn];
char D[maxn];
int main(){
#ifdef LOCAL
freopen(".a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false),cout.tie(0),cin.tie(0);
int n;cin>>n;
for(int i=0;i<n;++i)cin>>X[i]>>Y[i]>>D[i];
map<int,set<int>> MPu,MPd,MPl,MPr;
for(int i=0;i<n;++i){
if(D[i]=='U')MPu[X[i]].insert(Y[i]);
else if(D[i]=='D')MPd[X[i]].insert(Y[i]);
else if(D[i]=='L')MPl[Y[i]].insert(X[i]);
else MPr[Y[i]].insert(X[i]);
}
int ans=2e9;
for(auto i:MPu){
if(!MPd.count(i.first))continue;
for(auto j:i.second){
auto it=MPd[i.first].lower_bound(j);
if(it!=MPd[i.first].end()){
ans=min(ans,(*it-j)*5);
}
}
}
for(auto i:MPr){
if(!MPl.count(i.first))continue;
for(auto j:i.second){
auto it=MPl[i.first].lower_bound(j);
if(it!=MPl[i.first].end()){
ans=min(ans,(*it-j)*5);
}
}
}
MPu.clear();MPr.clear();MPd.clear();MPl.clear();
for(int i=0;i<n;++i){
if(D[i]=='U')
MPu[X[i]-Y[i]].insert(Y[i]);
else if(D[i]=='D')MPd[X[i]-Y[i]].insert(Y[i]);
else if(D[i]=='L')MPl[X[i]-Y[i]].insert(Y[i]);
else MPr[X[i]-Y[i]].insert(Y[i]);
}
for(auto i:MPu){
if(!MPl.count(i.first))continue;
for(auto j:i.second){
auto it=MPl[i.first].lower_bound(j);
if(it!=MPl[i.first].end()){
ans=min(ans,(*it-j)*10);
}
}
}
for(auto i:MPr){
if(!MPd.count(i.first))continue;
for(auto j:i.second){
auto it=MPd[i.first].lower_bound(j);
if(it!=MPd[i.first].end()){
ans=min(ans,(*it-j)*10);
}
}
}
MPu.clear();MPr.clear();MPd.clear();MPl.clear();
for(int i=0;i<n;++i){
if(D[i]=='U')
MPu[X[i]+Y[i]].insert(Y[i]);
else if(D[i]=='D')MPd[X[i]+Y[i]].insert(Y[i]);
else if(D[i]=='L')MPl[X[i]+Y[i]].insert(Y[i]);
else MPr[X[i]+Y[i]].insert(Y[i]);
}
for(auto i:MPl){
if(!MPd.count(i.first))continue;
for(auto j:i.second){
auto it=MPd[i.first].lower_bound(j);
if(it!=MPd[i.first].end()){
ans=min(ans,(*it-j)*10);
}
}
}
for(auto i:MPu){
if(!MPr.count(i.first))continue;
for(auto j:i.second){
auto it=MPr[i.first].lower_bound(j);
if(it!=MPr[i.first].end()){
ans=min(ans,(*it-j)*10);
}
}
}
if(ans==2e9)cout<<"SAFE";
else cout<<ans<<"\n";
return 0;
}
//2020.07.25 22:09:09
| 0 | CPP |
def palindrome(s):
length = len(s)
check = 0
for i in range(length//2):
if s[i] != s[length-i-1]:
check = 1
break
if check==0:
return True
else:
return False
string = input()
length_string = len(string)
k = int(input())
if length_string%k!=0:
print('NO')
else:
t = length_string//k
count = 0
for j in range(0,len(string),t):
if palindrome(string[j:j+t]):
count += 1
if count==k:
print('YES')
else:
print('NO') | 7 | PYTHON3 |
s = input()
for i in range(len(s)):
if s[i] == 'B':
b = i % 4
elif s[i] == 'Y':
y = i % 4
elif s[i] == 'R':
r = i % 4
elif s[i] == 'G':
g = i % 4
b_ans = 0
y_ans = 0
r_ans = 0
g_ans = 0
for i in range(len(s)):
if s[i] == '!':
if i % 4 == b:
b_ans += 1
elif i % 4 == y:
y_ans += 1
elif i % 4 == r:
r_ans += 1
elif i % 4 == g:
g_ans += 1
print(r_ans, b_ans, y_ans, g_ans) | 8 | PYTHON3 |
n = int(input())
s = input()
l = len(s)
dp = [[0] * (l + 1) for _ in range(l + 1)]
dp[0][0] = 1
ans = 0
for i, ei in enumerate(s, 1):
for j, ej in enumerate(s[i:], i+1):
if ei == ej:
dp[i][j] = min(dp[i-1][j-1] + 1, j - i)
ans = max(ans, dp[i][j])
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 4444;
struct edge {
int from, to, rflow, nxt, id;
edge(int from, int to, int rflow, int nxt, int id)
: from(from), to(to), rflow(rflow), nxt(nxt), id(id) {}
};
int s, t;
int deg[N], last[N], last0[N];
vector<edge> g;
void eadd(int u, int v, int id = 2018, int cap = 1) {
++deg[u], ++deg[v];
g.emplace_back(u, v, cap, last[u], id);
last[u] = g.size() - 1;
g.emplace_back(v, u, 0, last[v], -id);
last[v] = g.size() - 1;
}
int layer[N];
bool bfs() {
fill(layer, layer + t + 1, -1);
queue<int> q;
q.push(s);
layer[s] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int e = last[u]; ~e; e = g[e].nxt) {
edge& ed = g[e];
if (layer[ed.to] == -1 && ed.rflow > 0) {
q.push(ed.to);
layer[ed.to] = layer[u] + 1;
}
}
}
return ~layer[t];
}
int dfs(int u, int flow) {
if (u == t) return flow;
for (int e = last0[u]; ~e; e = g[e].nxt) {
edge& ed = g[e];
edge& edr = g[e ^ 1];
last0[u] = e;
if (layer[ed.to] == layer[u] + 1 && ed.rflow > 0) {
int by = dfs(ed.to, min(flow, ed.rflow));
if (by > 0) {
ed.rflow -= by;
edr.rflow += by;
return by;
}
}
}
return 0;
}
int mf() {
int mflow = 0, amt;
while (bfs()) {
for (int i = 0; i <= t; ++i) last0[i] = last[i];
while ((amt = dfs(s, 1e9)) > 0) mflow += amt;
}
return mflow;
}
int sat[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie();
memset(last, -1, sizeof last);
int n1, n2, m;
cin >> n1 >> n2 >> m;
for (int i = 1; i <= m; ++i) {
int u, v;
cin >> u >> v;
eadd(u, n1 + v, i);
}
int mn = m;
for (int i = 1; i <= n1 + n2; ++i) mn = min(mn, deg[i]);
s = 0, t = n1 + n2 + 1;
for (int i = 1; i <= n1; ++i) eadd(s, i, 2018, 0);
for (int i = n1 + 1; i <= n1 + n2; ++i) eadd(i, t, 2018, 0);
cout << "0\n";
for (int k = 1; k <= mn; ++k) {
for (int e = last[s]; ~e; e = g[e].nxt) ++g[e].rflow;
for (int e = last[t]; ~e; e = g[e].nxt) ++g[e ^ 1].rflow;
int mflow = mf();
for (int i = 1; i <= n1 + n2; ++i) sat[i] = 0;
vector<int> res;
for (int i = 1; i <= n1; ++i) {
for (int e = last[i]; ~e; e = g[e].nxt)
if (g[e].to != s && g[e].rflow == 0) {
++sat[g[e].to];
++sat[g[e].from];
res.push_back(g[e].id);
}
}
for (int i = 1; i <= n1; ++i) {
if (sat[i] < k)
for (int e = last[i]; ~e && sat[i] < k; e = g[e].nxt)
if (g[e].to != s && g[e].rflow > 0)
res.push_back(g[e].id), ++sat[g[e].to], ++sat[i];
}
for (int i = n1 + 1; i <= n1 + n2; ++i) {
if (sat[i] < k) {
for (int e = last[i]; ~e && sat[i] < k; e = g[e].nxt)
if (g[e].to != t && g[e ^ 1].rflow > 0)
res.push_back(g[e ^ 1].id), ++sat[i], ++sat[g[e].to];
}
}
cout << res.size();
for (int e : res) cout << ' ' << e;
cout << '\n';
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-9;
const int N = 1e6 + 10;
const int M = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double f = 2.32349;
long long a[N], b[N];
void solve() {
ios::sync_with_stdio(false), cin.tie(0);
int n, m;
cin >> n;
long long suma = 0, sumb = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
suma += a[i];
}
cin >> m;
for (int i = 1; i <= m; i++) {
cin >> b[i];
sumb += b[i];
}
if (suma != sumb) {
cout << -1 << '\n';
} else {
int ansn = n, ansm = m;
int la = 1, lb = 1;
while (la != n + 1 && lb != m + 1) {
if (a[la] == b[lb]) {
la++;
lb++;
} else if (a[la] < b[lb]) {
a[la + 1] += a[la];
la++;
ansn--;
} else {
b[lb + 1] += b[lb];
lb++;
ansm--;
}
}
cout << ansn << '\n';
}
}
signed main() {
solve();
return 0;
}
| 10 | CPP |
#include <cstdio>
#include <vector>
using namespace std;
#define MOD 1000000007
typedef long long int LLI;
typedef vector<vector<LLI> > Mat;
typedef vector<vector<Mat> > MatMat;
int n;
int k;
int c;
int T;
Mat one;
Mat zero;
Mat G[7];
MatMat m;
MatMat m_zero;
MatMat ans;
Mat mul(Mat &a, Mat &b) {
Mat ret(zero);
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
for (int k=0; k<n; k++) {
ret[i][j] += a[i][k] * b[k][j] % MOD;
ret[i][j] %= MOD;
}
}
}
return ret;
}
Mat add(Mat &a, Mat &b) {
Mat ret(zero);
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
ret[i][j] = (a[i][j] + b[i][j]) % MOD;
}
}
return ret;
}
MatMat mul(MatMat &a, MatMat &b) {
MatMat ret(m_zero);
for (int i=0; i<5; i++) {
for (int j=0; j<5; j++) {
for (int k=0; k<5; k++) {
Mat s = mul(a[i][k], b[k][j]);
ret[i][j] = add(ret[i][j], s);
}
}
}
return ret;
}
int main() {
scanf("%d%d%d%d", &n, &k, &c, &T);
zero = Mat(n, vector<LLI>(n));
one = Mat(zero);
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
zero[i][j] = 0;
one[i][j] = 0;
}
one[i][i] = 1;
}
for (int i=0; i<7; i++) {
G[i] = Mat(zero);
}
for (int i=0; i<k; i++) {
int a, b, t;
scanf("%d%d%d", &a, &b, &t);
--a;
for (int j=0; j<a; j++) {
G[t][j][b+j]++;
}
for (int j=0; j<b; j++) {
G[t][a+j][j]++;
}
for (int j=a+b; j<n; j++) {
G[t][j][j]++;
}
}
m_zero = vector<vector<Mat> >(5, vector<Mat>(5, zero));
ans = vector<vector<Mat> >(m_zero);
m = vector<vector<Mat> >(m_zero);
for (int i=0; i<5; i++) {
m[0][i] = G[i+1];
if (i < 4) m[i+1][i] = one;
ans[i][i] = one;
}
while (T > 0) {
if (T&1) {
ans = mul(ans, m);
}
m = mul(m, m);
T >>= 1;
}
printf("%lld\n", ans[0][0][c-1][0]);
} | 0 | CPP |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
struct TwoSatLight {
TwoSatLight(int n) : n(n), graph(n << 1), rev_graph(n << 1), used(n << 1, false), id(n << 1, -1) {}
int negate(int x) const { return (n + x) % (n << 1); }
void add_or(int x, int y) {
graph[negate(x)].emplace_back(y);
graph[negate(y)].emplace_back(x);
rev_graph[y].emplace_back(negate(x));
rev_graph[x].emplace_back(negate(y));
}
void add_if(int x, int y) { add_or(negate(x), y); }
void add_nand(int x, int y) { add_or(negate(x), negate(y)); }
void set_true(int x) { add_or(x, x); }
void set_false(int x) { set_true(negate(x)); }
vector<bool> build() {
REP(i, n << 1) {
if (!used[i]) dfs(i);
}
int now = 0;
for (int i = (n << 1) - 1; i >= 0; --i) {
if (id[order[i]] == -1) rev_dfs(order[i], now++);
}
vector<bool> res(n);
REP(i, n) {
if (id[i] == id[negate(i)]) return {};
res[i] = id[negate(i)] < id[i];
}
return res;
}
private:
int n;
vector<vector<int>> graph, rev_graph;
vector<bool> used;
vector<int> id, order;
void dfs(int ver) {
used[ver] = true;
for (int e : graph[ver]) {
if (!used[e]) dfs(e);
}
order.emplace_back(ver);
}
void rev_dfs(int ver, int now) {
id[ver] = now;
for (int e : rev_graph[ver]) {
if (id[e] == -1) rev_dfs(e, now);
}
}
};
int main() {
int n, d; cin >> n >> d;
vector<int> x(n), y(n); REP(i, n) cin >> x[i] >> y[i];
TwoSatLight ts(n);
REP(i, n) FOR(j, i + 1, n) {
if (abs(x[i] - x[j]) < d) ts.add_nand(i, j);
if (abs(x[i] - y[j]) < d) ts.add_nand(i, ts.negate(j));
if (abs(y[i] - x[j]) < d) ts.add_nand(ts.negate(i), j);
if (abs(y[i] - y[j]) < d) ts.add_nand(ts.negate(i), ts.negate(j));
}
vector<bool> ans = ts.build();
if (ans.empty()) {
cout << "No\n";
return 0;
}
cout << "Yes\n";
REP(i, n) cout << (ans[i] ? x[i] : y[i]) << '\n';
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int dx[] = {0, 0, 1, -1};
long long int dy[] = {1, -1, 0, 0};
long long int m = 0, n, res = 0, k, ans = 0;
string s2, ch = "", s, t, s1 = "";
vector<pair<string, long long int> > vm;
vector<pair<pair<long long int, long long int>, long long int> > vvv;
vector<pair<long long int, long long int> > vv, vv2;
vector<long long int> v, v2, v1;
set<long long int> st, st1;
long long int a[100];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long int i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, idx = 0, ok = 0,
l = 0, r = 0, negatif = 0, positif = 0, l1, r1, d, p, t;
set<pair<long long int, long long int> >::iterator it, it1;
cin >> s1 >> s2;
n = s1.size();
m = s2.size();
for (i = 0; i < n; i++)
if (s1[i] == '1') x++;
for (i = 0; i < m; i++)
if (s2[i] == '1') y++;
x += (x & 1);
if (x >= y) return cout << "YES\n", 0;
cout << "NO";
return 0;
}
| 9 | CPP |
import sys
k, s = 1, input()
for i in range(len(s)-1):
if s[i] != s[i+1]:
k = 1
else:
k += 1
if k == 7:
print("YES")
sys.exit()
print("NO")
| 7 | PYTHON3 |
import math
def get_prime_set(ub):
from itertools import chain
from math import sqrt
if ub < 4:
return ({}, {}, {2}, {2, 3})[ub]
ub, ub_sqrt = ub+1, int(sqrt(ub))+1
primes = {2, 3} | set(chain(range(5, ub, 6), range(7, ub, 6)))
du = primes.difference_update
for n in chain(range(5, ub_sqrt, 6), range(7, ub_sqrt, 6)):
if n in primes:
du(range(n*3, ub, n*2))
return primes
if __name__ == "__main__":
n, b = map(int, input().split())
primes = get_prime_set(int(math.sqrt(b))+1)
pf = dict()
for p in filter(lambda x: b % x == 0, primes):
pf[p] = 0
while b % p == 0:
b //= p
pf[p] += 1
if b > 1:
pf[b] = 1
ans = 10**18
for p, count in pf.items():
subtotal = 0
_p = p
while _p <= n:
subtotal += n // _p
_p *= p
subtotal //= count
if ans > subtotal:
ans = subtotal
print(ans) | 9 | PYTHON3 |
# link: https://codeforces.com/problemset/problem/1305/C
import os, sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
from math import ceil
mod = 10 ** 9 + 7
# number of test cases
for _ in range(1):
n, m = map(int, input().split())
a = list(map(int, input().split()))
if n > m:
print(0)
else:
ans = 1
for i in range(n):
for j in range(i+1, n):
ans *= abs(a[i] - a[j])
ans %= m
print(ans) | 9 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
n *= 2
a.extend(a)
ans = 0
i = 0
while i<n:
if a[i] == 0:
i += 1
continue
j = i
while j<n and a[j]==1:
j += 1
ans = max(ans,j-i)
i = j
print(ans)
| 8 | PYTHON3 |
n, k = [int(i) for i in input().split()]
for i in range(k):
if n % 10:
n -= 1
else:
n //= 10
print(n) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
a = [0] + a
ans = 0
for i in range(1, n + 1):
ans += abs(a[i] - a[i - 1])
print(ans) | 8 | PYTHON3 |
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
b = [0] * (10 ** 5 + 1)
for i in a:
b[i] += 1
b[2] = 2 * b[2]
b[3] = b[1] + 3 * b[3]
p = 0
for i in range(4, 10 ** 5 + 1):
b[i] = max(b[i - 2], b[i - 3]) + i * b[i]
p = max(p, b[i])
print(p)
| 9 | PYTHON3 |
y=int(input())
while 1:
y+=1
s=y
bo=0
num=[]
while s!=0:
if s%10 in num:
bo=1
else:
num.append(s%10)
s=s//10
if bo==0:
print(y)
break | 7 | PYTHON3 |
N = int(input())
ls = list(map(int, input().split()))
LIS = [1]
for i in range(1, N):
if ls[i-1]<ls[i]: LIS.append(LIS[-1]+1)
else: LIS.append(1)
print(max(LIS))
| 7 | PYTHON3 |
from bisect import bisect_left as bl
INF = 10 ** 20
def main():
w, h = map(int, input().split())
n = int(input())
xlst = []
ylst = []
appx = xlst.append
appy = ylst.append
for i in range(n):
x, y = map(int,input().split())
appx(x)
appy(y)
sorted_xlst = sorted(xlst)
sorted_ylst = sorted(ylst)
accx = accy = 0
cum_sum_xlst = []
cum_sum_ylst = []
appx = cum_sum_xlst.append
appy = cum_sum_ylst.append
for i in range(n):
accx += sorted_xlst[i]
accy += sorted_ylst[i]
appx(accx)
appy(accy)
if n % 2:
clx = crx = sorted_xlst[n // 2]
cly = cry = sorted_ylst[n // 2]
else:
clx = sorted_xlst[n // 2 - 1]
crx = sorted_xlst[n // 2]
cly = sorted_ylst[n // 2 - 1]
cry = sorted_ylst[n // 2]
ans = ansx = ansy = INF
for i in range(n):
xi = xlst[i]
yi = ylst[i]
if xi <= clx:
cx = crx
else:
cx = clx
if yi <= cly:
cy = cry
else:
cy = cly
px = bl(sorted_xlst, cx)
py = bl(sorted_ylst, cy)
dx = xi - cx
if dx < 0:
dx = -dx
if px:
csx = cum_sum_xlst[px - 1]
xlen = (accx - csx * 2 - cx * (n - px * 2)) * 2 - dx
else:
xlen = (accx - cx * n) * 2 - dx
dy = yi - cy
if dy < 0:
dy = -dy
if py:
csy = cum_sum_ylst[py - 1]
ylen = (accy - csy * 2 - cy * (n - py * 2)) * 2 - dy
else:
ylen = (accy - cy * n) * 2 - dy
tlen = xlen + ylen
if ans > tlen:
ans = tlen
ansx = cx
ansy = cy
elif ans == tlen:
if ansx > cx:
ansx = cx
ansy = cy
elif ansx == cx:
if ansy > cy:
ansy = cy
print(ans)
print(ansx, ansy)
main()
| 0 | PYTHON3 |
n = int(input())
string = input()
removeCount = 0
for index in range(n):
if index + 1 < n:
if string[index] == string[index+1]:
removeCount += 1
print(removeCount)
| 7 | PYTHON3 |
#include <stdio.h>
int a[50]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51},n;
int main () {
int n;
scanf ("%d",&n);
printf ("%d\n",a[n-1]);
} | 0 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
namespace _c {
const double pi = acos(-1.0);
namespace min {
const int i8 = -128;
const int i16 = -32768;
const int i = -2147483647 - 1;
const long long l = -9223372036854775807LL - 1;
} // namespace min
namespace max {
const int i8 = 127;
const int i16 = 32767;
const int i = 2147483647;
const long long l = 9223372036854775807LL;
} // namespace max
} // namespace _c
namespace _f {
template <typename T>
inline const T gcd(T m, T n) {
while (n != 0) {
T t = m % n;
m = n;
n = t;
}
return m;
}
template <typename T>
inline const T max(const T &a, const T &b) {
return a > b ? a : b;
}
template <typename T>
inline const T min(const T &a, const T &b) {
return a < b ? a : b;
}
template <typename T>
inline const T abs(const T &a) {
return a > 0 ? a : -a;
}
template <typename T>
inline T pow(T a, T b) {
T res = 1;
while (b > 0) {
if (b & 1) {
res = res * a;
}
a = a * a;
b >>= 1;
}
return res;
}
template <typename T>
inline T pow(T a, T b, const T &m) {
a %= m;
T res = 1;
while (b > 0) {
if (b & 1) {
res = res * a % m;
}
a = a * a % m;
b >>= 1;
}
return res % m;
}
} // namespace _f
namespace io {
template <typename T>
inline void read(T &t) {
register T res = 0, neg = 1;
char g = getchar();
for (; !isdigit(g); g = getchar()) {
if (g == '-') {
neg = -1;
}
}
for (; isdigit(g); g = getchar()) {
res = res * 10 + g - '0';
}
t = res * neg;
}
inline int in() {
register int T;
read(T);
return T;
}
inline long long in_ll() {
register long long T;
read(T);
return T;
}
} // namespace io
struct node {
int x, y, t;
} b[430000], a[430000];
int p[430000], x, y, t, n, m, i, j, tot, ftot, fa[430000], co[430000], l, ans,
K;
bool cmp(const node &a, const node &b) { return a.t < b.t; }
int get(int x) { return fa[x] == x ? x : (fa[x] = get(fa[x])); }
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= m; ++i) {
scanf("%d%d%d", &x, &y, &t);
p[++tot] = x;
p[++tot] = y;
a[i].x = x;
a[i].y = y;
a[i].t = t;
}
sort(p + 1, p + tot + 1);
sort(a + 1, a + m + 1, cmp);
for (i = 1; i <= tot + 1; ++i) fa[i] = i, co[i] = -1;
for (i = 1; i <= m; ++i) {
x = lower_bound(p + 1, p + tot + 1, a[i].x) - p;
y = lower_bound(p + 1, p + tot + 1, a[i].y) - p - 1;
for (j = get(x); j <= y; j = get(j)) {
co[j] = a[i].t;
fa[j] = j + 1;
}
}
for (i = 1; i < tot; ++i)
if (co[i] != -1) {
b[++ftot].t = co[i] - p[i + 1];
b[ftot].x = 1;
b[++ftot].t = co[i] - p[i];
b[ftot].x = -1;
b[ftot].y = -(p[i + 1] - p[i]);
}
sort(b + 1, b + ftot + 1, cmp);
l = 1;
for (i = 1; i <= n; ++i) {
scanf("%d", &x);
while (l <= ftot && x >= b[l].t) {
ans += K * (b[l].t - b[l - 1].t);
K += b[l].x;
l++;
}
printf("%d\n", ans + K * (x - b[l - 1].t));
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
int get_sign(int x) {
if (x % 2) return -1;
return 1;
}
int even_ans(int l, int r) { return (r - l + 1) * get_sign(r) / 2; }
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
if ((r - l + 1) % 2 == 0) {
cout << even_ans(l, r);
} else {
cout << even_ans(l, r - 1) + r * get_sign(r);
}
cout << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n,q,a,b,p[100010],p1;
bool f[100010];
int main(){
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
p[i]=i;
f[1]=true;
f[2]=true;
p1=1;
for(int i=0;i<q;i++){
scanf("%d%d",&a,&b);
int t=p[a];
p[a]=p[b];
p[b]=t;
if(a==p1)
p1=b;
else if(b==p1)
p1=a;
f[p[p1-1]]=f[p[p1]]=f[p[p1+1]]=true;
}
int ans=0;
for(int i=1;i<=n;i++)
if(f[i])ans++;
printf("%d\n",ans);
return 0;
} | 0 | CPP |
t = int(input())
for _ in range(t):
_ = input()
values = list(map(int, input().split(" ")))
min_value = min(values)
print(len(values) - values.count(min_value)) | 7 | PYTHON3 |
import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
from collections import *
ORDA = 97 # a
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return [int(i) for i in input().split()]
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def revn(n): return str(n)[::-1]
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def sieve(n):
if n < 2: return list()
prime = [True for _ in range(n + 1)]
p = 3
while p * p <= n:
if prime[p]:
for i in range(p * 2, n + 1, p):
prime[i] = False
p += 2
r = [2]
for p in range(3, n + 1, 2):
if prime[p]:
r.append(p)
return r
def divs(n, start=2):
r = []
for i in range(start, int(math.sqrt(n) + 1)):
if (n % i == 0):
if (n / i == i):
r.append(i)
else:
r.extend([i, n // i])
return r
def divn(n, primes):
divs_number = 1
for i in primes:
if n == 1:
return divs_number
t = 1
while n % i == 0:
t += 1
n //= i
divs_number *= t
def prime(n):
if n == 2: return True
if n % 2 == 0 or n <= 1: return False
sqr = int(math.sqrt(n)) + 1
for d in range(3, sqr, 2):
if n % d == 0: return False
return True
def convn(number, base):
new_number = 0
while number > 0:
new_number += number % base
number //= base
return new_number
def cdiv(n, k): return n // k + (n % k != 0)
def ispal(s): # Palindrome
for i in range(len(s) // 2 + 1):
if s[i] != s[-i - 1]:
return False
return True
# a = [1,2,3,4,5] -----> print(*a) ----> list print krne ka new way
def main():
for _ in range(ii()):
n = ii()
a = li()
if(len(set(a))==n):
print("NO")
else:
print("YES")
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long n;
cin >> n;
cout << n / 2 + 1;
return 0;
}
| 7 | CPP |
Subsets and Splits