solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
struct pt {
int x, y;
pt(int _x, int _y) : x(_x), y(_y) {}
pt() {}
} st;
int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
int n, m;
int a[1010][1010];
int c[1010][1010], r[1010][1010];
int ttl1;
bool vis[1010][1010];
pt q[1000000];
int front, rear;
int f[2];
int gcd(int a, int b) {
while (a && b) {
a > b ? a = a % b : b = b % a;
}
return a + b;
}
bool bfs(pt _st) {
int cnt = 1;
memset(vis, 0, sizeof(vis));
q[0] = _st;
front = 0;
rear = 1;
vis[_st.x][_st.y] = 1;
while (front < rear) {
pt s = q[front++];
for (int i = 0; i < 4; i++) {
pt d = pt(s.x + dir[i][0], s.y + dir[i][1]);
if (!vis[d.x][d.y] && a[d.x][d.y]) {
vis[d.x][d.y] = 1;
cnt++;
q[rear++] = d;
}
}
}
if (cnt == ttl1)
return 0;
else
return 1;
}
int check(int i, int j) {
int ff[4] = {0, 0, 0, 0};
int cc = 0;
for (int k = 0; k < 4; k++) {
int ii = i + dir[k][0], jj = j + dir[k][1];
if (0 < ii && ii <= n && 0 < jj && jj <= m && a[ii][jj]) ff[k] = 1, cc++;
}
if (cc > 0) f[cc % 2]++;
if (cc == 2 && (ff[0] && ff[1] || ff[2] && ff[3])) return 0;
if (ff[1] && f[3]) return 3;
if (ff[1]) return 2;
if (ff[3]) return 1;
return 0;
}
int main() {
scanf("%d%d", &n, &m);
int f1 = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
if (a[i][j]) ttl1++;
if (a[i][j] && f1) st = pt(i, j), f1 = 0;
}
if (bfs(st)) {
puts("-1");
return 0;
}
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (a[i][j]) {
c[i][j] = c[i - 1][j] + a[i][j];
r[i][j] = r[i][j - 1] + a[i][j];
int cc = check(i, j);
if (cc) {
if (cc == 1)
ans = gcd(ans, c[i][j] - 1);
else if (cc == 2)
ans = gcd(ans, r[i][j] - 1);
else {
ans = gcd(ans, c[i][j] - 1);
ans = gcd(ans, r[i][j] - 1);
}
}
} else {
c[i][j] = 0;
r[i][j] = 0;
}
}
if (ans <= 1)
puts("-1");
else if (f[1] == 0 || f[1] == 2) {
for (int i = 2; i <= ans; i++)
if (ans % i == 0) printf("%d%c", i, i == ans ? '\n' : ' ');
} else
puts("-1");
return 0;
}
| 11 | CPP |
i = lambda x: 14 if x == 1 else x
a, b = [i(int(n)) for n in input().split()]
print('Alice' if a > b else 'Bob' if b > a else 'Draw')
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int a, b, c;
cin >> a >> b;
c = 2 * min(a, b);
if (c > a && c > b) {
cout << c * c << "\n";
} else {
c = max(a, b);
cout << c * c << "\n";
}
}
}
| 7 | CPP |
n = int(input())
s = input()
if n == 1:
print(0)
print(s)
else:
A = [[0]*3 for i in range(n)]
Aid = [[0]*3 for i in range(n)]
M = {'R':0,'G':1,'B':2}
M_ = {0:'R',1:'G',2:'B'}
v = M[s[0]]
A[0][(v+1)%3]= 1
A[0][(v+2)%3] = 1
def whichmax(A,id):
if A[id][0] <= A[id][1] and A[id][0] <= A[id][2]:
return 0
if A[id][1] <= A[id][0] and A[id][1] <= A[id][2]:
return 1
return 2
def min_and_id(a,ida,b,idb):
if a<b:
return a,ida
else:
return b,idb
for i in range(1,n):
v = M[s[i]]
vo0 = A[i-1][v]
vo1 = A[i-1][(v+1)%3]
vo2 = A[i-1][(v+2)%3]
val, vid = min_and_id(vo1,(v+1)%3,vo2,(v+2)%3)
#self
A[i][v] = val
Aid[i][v] = vid
val2,vid2 = min_and_id(vo0,v,vo2,(v+2)%3)
#N-1
A[i][(v+1)%3] = val2 + 1
Aid[i][(v + 1) % 3] = vid2
val3, vid3 = min_and_id(vo0, v, vo1, (v + 1) % 3)
#N-2
A[i][(v + 2) % 3] = val3 + 1
Aid[i][(v + 2) % 3] = vid3
ans = ""
i = n-1
midx = whichmax(A,n-1)
pid = midx
while i>=0:
ans += M_[pid]
pid = Aid[i][pid]
i-=1
print(A[n-1][midx])
print(ans[::-1])
| 9 | PYTHON3 |
n=int(input())
t=[]
for i in range(n):
t.append(input())
for i in t:
if len(i)>10:
a=i.replace(i[1:-1],str(len(i[1:-1])))
print(a)
else:
print(i)
| 7 | PYTHON3 |
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
arr=list(input())
flag=0
bal=0
ques=0
for i in range(k):
s=set()
s.add(arr[i])
for j in range(i,n,k):
s.add(arr[j])
if('1' in s and '0' in s):
flag=1
break
elif('0' in s and '?' in s):
bal-=1
elif('1' in s and '?' in s):
bal+=1
elif('1' in s):
bal+=1
elif('0' in s):
bal-=1
elif('?' in s):
ques+=1
if(bal==0 and ques==0):
pass
elif(bal!=0 and ques==0):
flag=1
elif(bal==0 and ques!=0):
if(ques%2!=0):
flag=1
else:
if(ques%2==0):
if(bal%2==0 and abs(bal)<=ques):
pass
else:
flag=1
else:
if(bal%2!=0 and abs(bal)<=ques):
pass
else:
flag=1
if(flag):
print("NO")
else:
print("YES") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int main() {
int n;
while (scanf("%d", &n) + 1) {
if (n & 1)
printf("black\n");
else
printf("white\n1 2\n");
}
return 0;
}
| 10 | CPP |
#include<iostream>
#include<algorithm>
using namespace std;
pair<int, int> X1[100000], X2[100000], X0[100000]; int n;
int solve_0(int _x1, int _x2, int _y1, int _y2) {
int minx1 = 1000000000, maxx1 = -1000000000, miny1 = 1000000000, maxy1 = -1000000000;
int minx2 = 1000000000, maxx2 = -1000000000, miny2 = 1000000000, maxy2 = -1000000000;
for (int i = 0; i < n; i++) {
if (_x1 <= X1[i].first && X1[i].first <= _x2 && _y1 <= X1[i].second && X1[i].second <= _y2) {
minx1 = min(minx1, X1[i].first); maxx1 = max(maxx1, X1[i].first);
miny1 = min(miny1, X1[i].second); maxy1 = max(maxy1, X1[i].second);
}
else {
minx2 = min(minx2, X1[i].first); maxx2 = max(maxx2, X1[i].first);
miny2 = min(miny2, X1[i].second); maxy2 = max(maxy2, X1[i].second);
}
}
int D1 = max(maxx1 - minx1, maxy1 - miny1);
int D2 = max(maxx2 - minx2, maxy2 - miny2);
return max(D1, D2);
}
int sub_1(int p) {
int miny1 = 1000000000, maxy1 = -1000000000;
for (int i = 0; i < n; i++) {
if (X1[i].first <= X1[0].first + p) {
miny1 = min(miny1, X1[i].second); maxy1 = max(maxy1, X1[i].second);
}
}
int C1 = solve_0(X1[0].first, X1[0].first + p, miny1, miny1 + p);
int C2 = solve_0(X1[0].first, X1[0].first + p, maxy1 - p, maxy1);
return min(C1, C2);
}
int solve_1() {
int maxn = 1000000000;
if (n <= 10000) {
for (int i = 0; i < n; i++) {
int _size = X1[i].first - X1[0].first;
maxn = min(maxn, sub_1(_size));
}
}
else {
int minid = 0, maxid = 0;
for (int i = 0; i < n + 100; i += 100) {
int I = i; if (I >= n)I = n - 1;
int _size = X1[I].first - X1[0].first;
int DD = sub_1(_size);
if (maxn > DD) { minid = i; maxid = i; maxn = DD; }
else if (maxn == DD) { maxid = i; }
}
for (int i = minid - 100; i < maxid + 100; i++) {
int I = i; if (I < 0)I = 0; if (I >= n)I = n - 1;
int _size = X1[I].first - X1[0].first;
maxn = min(maxn, sub_1(_size));
}
}
return maxn;
}
int sub_2(int p) {
int minx1 = 1000000000, maxx1 = -1000000000;
for (int i = 0; i < n; i++) {
if (X2[i].second <= X2[0].second + p) {
minx1 = min(minx1, X2[i].first); maxx1 = max(maxx1, X2[i].first);
}
}
int C1 = solve_0(minx1, minx1 + p, X2[0].second, X2[0].second + p);
int C2 = solve_0(maxx1 - p, maxx1, X2[0].second, X2[0].second + p);
return min(C1, C2);
}
int solve_2() {
int maxn = 1000000000;
if (n <= 10000) {
for (int i = 0; i < n; i++) {
int _size = X2[i].second - X2[0].second;
maxn = min(maxn, sub_2(_size));
}
}
else {
int minid = 0, maxid = 0;
for (int i = 0; i < n + 100; i += 100) {
int I = i; if (I >= n)I = n - 1;
int _size = X2[I].second - X2[0].second;
int DD = sub_2(_size);
if (maxn > DD) { minid = i; maxid = i; maxn = DD; }
else if (maxn == DD) { maxid = i; }
}
for (int i = minid - 100; i < maxid + 100; i++) {
int I = i; if (I < 0)I = 0; if (I >= n)I = n - 1;
int _size = X2[I].second - X2[0].second;
maxn = min(maxn, sub_2(_size));
}
}
return maxn;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) { cin >> X0[i].first >> X0[i].second; }
for (int i = 0; i < n; i++) {
X1[i].first = X0[i].first - X0[i].second; X2[i].second = X1[i].first;
X1[i].second = X0[i].second + X0[i].first; X2[i].first = X1[i].second;
}
sort(X1, X1 + n); sort(X2, X2 + n);
for (int i = 0; i < n; i++)swap(X2[i].first, X2[i].second);
cout << min(solve_1(), solve_2()) << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
const long long int LINF = 1LL * INF * INF;
const int MAXN = 2e5 + 10;
const int MAXM = 5e3 + 10;
priority_queue<int> pq;
vector<vector<int> > graph;
queue<int> que;
pair<int, int> A[MAXN];
pair<int, int> ans[MAXN];
pair<int, int> tree[MAXN * 8];
vector<int> val;
void update(pair<int, int> cur, int tmp) {
if (tree[tmp].first < cur.first) return;
if (tree[tmp].first > cur.first)
tree[tmp] = cur;
else
tree[tmp].second = (tree[tmp].second + cur.second) % 1000000007;
tmp >>= 1;
while (tmp) {
if (tree[tmp << 1].first == tree[(tmp << 1) | 1].first) {
tree[tmp].first = tree[tmp << 1].first;
tree[tmp].second =
(tree[tmp << 1].second + tree[((tmp << 1) | 1)].second) % 1000000007;
} else if (tree[tmp << 1].first < tree[(tmp << 1) | 1].first)
tree[tmp] = tree[tmp << 1];
else
tree[tmp] = tree[(tmp << 1) | 1];
tmp >>= 1;
}
return;
}
pair<int, int> getans(int L, int R) {
int mn = 0;
int res = 1;
while (L <= R) {
if (L & 1) {
if (tree[L].first < mn) {
mn = tree[L].first;
res = tree[L].second;
} else if (tree[L].first == mn) {
res = (res + tree[L].second) % 1000000007;
}
L++;
}
if (!(R & 1)) {
if (tree[R].first < mn) {
mn = tree[R].first;
res = tree[R].second;
} else if (tree[R].first == mn) {
res = (res + tree[R].second) % 1000000007;
}
R--;
}
L >>= 1;
R >>= 1;
}
return pair<int, int>(mn, res);
}
int main() {
int n, m, k, a, b, x, y, q;
int sum = 0;
int cnt = 0;
int mx = 0;
int mn = INF;
int idx = -1, idy = -1;
int tc;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i].first >> A[i].second;
val.push_back(A[i].first);
val.push_back(A[i].second);
mx = max(mx, A[i].second);
}
sort(val.begin(), val.end());
val.erase(unique(val.begin(), val.end()), val.end());
sort(A, A + n);
int sz = val.size();
int base = 1;
for (; base < sz; base <<= 1)
;
pair<int, int> cur, nxt;
for (int i = 0; i < n; i++) {
idx = lower_bound(val.begin(), val.end(), A[i].second) - val.begin();
idy = lower_bound(val.begin(), val.end(), A[i].first) - val.begin();
cur = getans(base, base + idx);
ans[i].first = cur.first + A[i].second;
ans[i].second = cur.second;
nxt = pair<int, int>(cur.first + A[i].second - A[i].first, cur.second);
update(nxt, base + idy);
}
pair<int, int> res;
res.first = INF;
for (int i = 0; i < n; i++) {
if (A[i].first > mx) {
if (res.first > ans[i].first)
res = ans[i];
else if (res.first == ans[i].first)
res.second = (res.second + ans[i].second) % 1000000007;
}
}
cout << res.second << "\n";
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int iinf = 1e9 + 10;
const long long inf = 1ll << 60;
const long long mod = 1e9 + 7;
void GG() {
cout << "0\n";
exit(0);
}
long long mpow(long long a, long long n, long long mo = mod) {
long long re = 1;
while (n > 0) {
if (n & 1) re = re * a % mo;
a = a * a % mo;
n >>= 1;
}
return re;
}
long long inv(long long b, long long mo = mod) {
if (b == 1) return b;
return (mo - mo / b) * inv(mo % b, mo) % mo;
}
const int maxn = 2e6 + 5;
int V[maxn];
vector<int> g[maxn];
int dp[maxn][2];
int re = 0;
inline void upd(int &f1, int &f2, int nw) {
if (nw > f1) {
f2 = f1;
f1 = nw;
} else if (nw > f2) {
f2 = nw;
}
}
int LIM = 0;
void dfs(int v, int p) {
dp[v][0] = dp[v][1] = 0;
int f01 = 0, f02 = 0, f11 = 0, f12 = 0;
for (int u : g[v]) {
if (u != p) {
dfs(u, v);
if (V[v] & 1) {
dp[v][0] =
max(dp[v][0], (__typeof__(dp[v][0]))(min(dp[u][0], dp[u][1] + 1)));
upd(f01, f02, min(dp[u][0], dp[u][1] + 1));
}
if (V[v] & 2) {
dp[v][1] =
max(dp[v][1], (__typeof__(dp[v][1]))(min(dp[u][1], dp[u][0] + 1)));
upd(f11, f12, min(dp[u][1], dp[u][0] + 1));
}
}
}
if (!(V[v] & 1) || f01 + f02 > LIM) {
dp[v][0] = 10000000;
}
if (!(V[v] & 2) || f11 + f12 > LIM) {
dp[v][1] = 10000000;
};
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> V[i], V[i] += !V[i] ? 3 : 0;
for (int i = 0; i < n; ++i) g[i].clear();
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
g[a].push_back(b);
g[b].push_back(a);
}
int l = 0, r = n - 1;
while (l != r) {
LIM = (l + r) / 2;
dfs(0, -1);
if (dp[0][0] < n || dp[0][1] < n) {
r = LIM;
} else {
l = LIM + 1;
}
};
cout << (l + 1) / 2 + 1 << '\n';
}
}
| 11 | CPP |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s[3];
cin >> s[0] >> s[1] >> s[2];
int turn = 0;
while(1)
{
if (s[turn].empty()) {
cout << char(turn + 'A') << endl;
return 0;
}
int tmp = s[turn][0] -'a';
s[turn].erase(0, 1);
turn = tmp;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long nmax, mmax;
int dig(long long x) {
int c = 0;
while (x) {
++c;
x /= 7;
}
return max(1, c);
}
bool d(int x, int y, int sx, int sy, int px, int py) {
int f[10];
memset(f, 0, sizeof f);
if (x == 0) f[0]++;
while (x) {
f[x % 7]++;
x /= 7;
}
if (y == 0) f[0]++;
while (y) {
f[y % 7]++;
y /= 7;
}
if (sx < px) f[0] += px - sx;
if (sy < py) f[0] += py - sy;
for (int i = 0; i < 7; ++i) {
if (f[i] > 1) return false;
}
return true;
}
int main(int argc, char const* argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, m;
cin >> n >> m;
nmax = dig(n - 1);
mmax = dig(m - 1);
if (nmax + mmax > 7) {
cout << 0 << "\n";
return 0;
}
long long sol = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (d(i, j, dig(i), dig(j), nmax, mmax)) {
++sol;
}
}
}
cout << sol << "\n";
return 0;
}
| 7 | CPP |
a=[len(input())-2 for x in range(4)]
b=sorted(a)
tall=True
if(b[0]*2<=b[1] and b[2]*2<=b[3]):
print("C")
exit()
if(b[0]*2<=b[1]):
print(chr(65+a.index(b[0])))
exit()
elif(b[2]*2<=b[3]):
print(chr(65+a.index(b[3])))
exit()
print("C")
| 7 | PYTHON3 |
N = int(input())
S = input()
east = S.count("E")
west = 0
ans = 10 ** 18
for s in S:
if s == "W":
ans = min(ans, east + west)
west += 1
else:
east -= 1
ans = min(ans, east + west)
print(ans) | 0 | PYTHON3 |
ini,gain = (int(n) for n in input().split(" "))
non_decreasing = (gain * (gain + 1)) // 2
allday = 10 ** 18
left = 0
# print(non_decreasing,gain * (gain))
if ini > gain:
while allday > left:
day = (allday + left) // 2
now_decreased = (day * (day + 1)) // 2 - gain * max(0,day - gain - 1) - non_decreasing
# print(now_decreased,day,left,allday,non_decreasing)
if now_decreased > ini:
allday = day
elif now_decreased < ini:
left = day + 1
else:
break
print((allday + left) // 2)
else:
print(ini)
| 9 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int component[100001],c=0;
vector<int> gr[100001];
void dfs(int node)
{
if(component[node]>0)
return;
component[node]=c;
for(auto neighbour:gr[node])
dfs(neighbour);
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y,z;
cin>>x>>y>>z;
gr[x].push_back(y);
gr[y].push_back(x);
}
memset(component,0,sizeof(component));
for(int i=1;i<=n;i++)
{
if(component[i]>0)
continue;
++c;
dfs(i);
}
cout<<c;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[100][100];
bool vst[100][100];
int main() {
int n;
scanf("%d", &n);
int k = n / 2;
int t = k * (k + 1) / 2;
int p = (int)(sqrt(t) + 1e-8);
for (int i = 1; i <= p; i++) {
for (int j = 1; j <= p; j++) vst[i][j] = 1;
}
int cnt = t - p * p;
for (int i = 1; i <= p; i++) {
if (cnt == 0) break;
vst[p + 1][i] = 1;
cnt--;
}
for (int i = 1; i <= p; i++) {
if (cnt == 0) break;
vst[i][p + 1] = 1;
cnt--;
}
for (int i = 1; i <= p + 1; i++) {
for (int j = 1; j <= p + 1; j++) {
if (vst[i][j]) {
vst[n - i + 1][j] = 1;
vst[i][n - j + 1] = 1;
vst[n - i + 1][n - j + 1] = 1;
}
}
}
int c1 = 2, c2 = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (vst[i][j])
ans[i][j] = c1, c1 += 2;
else
ans[i][j] = c2, c2 += 2;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (j != n)
cout << ans[i][j] << " ";
else
cout << ans[i][j] << endl;
}
}
return 0;
}
| 9 | CPP |
#include <iostream>
using namespace std;
int main()
{
int total,books;
while(true){
cin>>total;
if(total==0){
break;
}
for(int i=1;i<=9;i++){
cin>>books;
total-=books;
}
cout<<total<<"\n";
}
return 0;
} | 0 | CPP |
a = int(input())
n = list(map(int, input().split()))
m = round(sum(n) / len(n))
print(sum((i-m) ** 2 for i in n))
| 0 | PYTHON3 |
import math
def valid(a,b):
if a%2 == b%2:
return True
if abs(a-b) ==1:
return True
return False
def fun(array):
array.sort()
odd,even = [],[]
for i in range(len(array)):
if array[i]%2 ==0:
even.append(array[i])
else:
odd.append(array[i])
if len(even)%2==0:
return True
for i in even:
for j in odd:
if abs(j-i)==1:
return True
return False
for _ in range(int(input())):
n = int(input())
array= list(map(int,input().split()))
if fun(array):
print("YES")
else:
print("NO")
# print()
# print()
# print(fun(n,m,k))
| 9 | PYTHON3 |
import math
names = ["Sheldon", "Leonard", "Penny", "Rajesh", "Howard"]
n = int(input())
i = -1
s = 0
while s < n:
i = i + 1
s = s + 5 * pow(2,i)
s = n - s + 5 * pow(2,i)
print(names[math.ceil(s / (pow(2,i)))-1]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
string a,b,c; cin >> a >> b >>c;
int ans =0;
for (int i=0;i<n;++i) {
set<int> st;
st.insert(a[i]);
st.insert(b[i]);
st.insert(c[i]);
ans += (int)st.size() - 1;
}
cout << ans << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
const int N = 10000010;
int min[N], cnt[N], phi[N], mu[N];
long long ans[N];
std::vector<int> prime;
int main() {
int n;
scanf("%d", &n);
phi[1] = 1;
for (int i = 2; i <= n; ++i) {
if (!min[i]) {
min[i] = i;
phi[i] = i - 1;
prime.push_back(i);
mu[i] = -1;
}
for (int j = 0, k, sz = (int)prime.size(); j < sz && i * prime[j] <= n;
++j) {
min[k = i * prime[j]] = prime[j];
if (i % prime[j] == 0) {
phi[k] = phi[i] * prime[j];
mu[k] = 0;
break;
}
phi[k] = phi[i] * (prime[j] - 1);
mu[k] = -mu[i];
}
++cnt[min[i]];
}
long long cnt0 = 1;
for (auto u : prime) {
cnt0 += u << 1 > n;
}
cnt0 = cnt0 * (n - cnt0) + cnt0 * (cnt0 - 1) / 2;
long long cnt1 = 1ll * n * (n - 1) >> 1;
for (int i = 2; i <= n; ++i) {
cnt1 -= phi[i];
}
long long cnt2 = 0;
for (int i = 0, sz = prime.size(); i < sz; ++i) {
for (int j = 0; j < sz; ++j) {
if (prime[i] * prime[j] > n) break;
if (prime[i] == prime[j]) continue;
cnt2 += 1ll * cnt[prime[i]] * cnt[prime[j]];
}
}
for (auto u : prime) {
cnt2 += 1ll * cnt[u] * cnt[u];
}
for (int i = 2; i <= n; ++i) {
ans[i] = 1ll * (n / i) * (n / i);
if (1ll * min[i] * min[i] > n) {
for (int j = i << 1; j <= n; j += i) {
if (1ll * min[j] * min[i] > n) {
ans[i] -= 2;
}
}
}
}
for (int i = 2; i <= n; ++i) {
for (int j = i << 1; j <= n; j += i) {
ans[i] += ans[j] * mu[j / i];
}
cnt2 -= ans[i];
}
cnt2 >>= 1;
long long cnt3 = 1ll * n * (n - 1) / 2 - cnt0 - cnt1 - cnt2;
return printf("%I64d\n", cnt1 + 2 * cnt2 + 3 * cnt3), 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
void file(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
template <typename Tp>
void read(Tp &x) {
int fh = 1;
char c = getchar();
x = 0;
while (c > '9' || c < '0') {
if (c == '-') {
fh = -1;
}
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + (c & 15);
c = getchar();
}
x *= fh;
}
int n, m;
int ans, a[1000005];
int b[1000005];
int solve(int id) {
int ret = 0, l, r;
for (int i = 1; i <= n; i++) b[i] = (a[i] & ((1 << (id + 1)) - 1));
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; i++) {
int pl, pr;
if ((b[i] >> id) & 1) {
pl = ((1 << (id + 1)) - b[i]);
pr = pl + (1 << id);
l = lower_bound(b + 1, b + i, pl) - b - 1;
ret += l;
r = lower_bound(b + 1, b + i, pr) - b;
ret += (i - r);
ret &= 1;
} else {
pl = ((1 << id) - b[i]), pr = ((1 << (id + 1)) - b[i]);
l = lower_bound(b + 1, b + i, pl) - b;
r = lower_bound(b + 1, b + i, pr) - b - 1;
ret += (r - l + 1);
ret &= 1;
}
}
ret &= 1;
return ret ? (1 << id) : 0;
}
signed main() {
read(n);
for (int i = 1; i <= n; i++) read(a[i]);
for (int i = 25; ~i; i--) {
ans |= solve(i);
}
printf("%d\n", ans);
fclose(stdin);
fclose(stdout);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3000;
int TC, N, K;
long long A[MAXN + 10];
vector<int> adj[MAXN + 10];
int sz[MAXN + 10];
pair<long long, long long> dp[MAXN + 10][MAXN + 10], tmp[MAXN + 10];
void dfs(int now, int bef) {
int i, j;
sz[now] = 1;
dp[now][1] = pair<long long, long long>(0, A[now]);
for (int nxt : adj[now]) {
if (nxt == bef) continue;
dfs(nxt, now);
for (i = 1; i <= sz[now] + sz[nxt]; i++)
tmp[i] = pair<long long, long long>(0, -1e15);
for (i = 1; i <= sz[now]; i++) {
for (j = 1; j <= sz[nxt]; j++) {
tmp[i + j - 1] = max(
tmp[i + j - 1],
pair<long long, long long>(dp[now][i].first + dp[nxt][j].first,
dp[now][i].second + dp[nxt][j].second));
tmp[i + j] = max(tmp[i + j], pair<long long, long long>(
dp[now][i].first + dp[nxt][j].first +
(dp[nxt][j].second > 0),
dp[now][i].second));
}
}
for (i = 1; i <= sz[now] + sz[nxt]; i++) dp[now][i] = tmp[i];
sz[now] += sz[nxt];
}
}
int main() {
int i, j;
scanf("%d", &TC);
while (TC--) {
scanf("%d%d", &N, &K);
for (i = 1; i <= N; i++) adj[i].clear(), A[i] = 0;
for (i = 1; i <= N; i++) {
long long t;
scanf("%lld", &t);
A[i] -= t;
}
for (i = 1; i <= N; i++) {
long long t;
scanf("%lld", &t);
A[i] += t;
}
for (i = 1; i < N; i++) {
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++) dp[i][j] = pair<long long, long long>(0, -1e15);
dfs(1, 1);
printf("%lld\n", dp[1][K].first + (dp[1][K].second > 0));
}
}
| 12 | CPP |
import math
split = lambda: list(map(int, input().split()))
a, b = split()
rows = [split() for x in range(a)]
columns = [[x[y] for x in rows] for y in range(b)]
def choose(p, q):
n = 1
for x in range(p - q + 1, p + 1):
n *= x
n //= math.factorial(q)
return n
s = 0
for x in rows + columns:
p, q = x.count(0), x.count(1)
for y in range(1, p + 1):
s += choose(p, y)
for y in range(1, q + 1):
s += choose(q, y)
s -= a * b
print(s) | 8 | PYTHON3 |
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;
const ll INF=1e13;
ll a[2222][2222];
ll dp[422][222][222];
int main(){
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(0);
int n,m;
cin>>n>>m;
rep(i,n)rep(j,m) cin>>a[i][j];
fill(dp[0][0],dp[0][0]+422*222*222,-INF);
dp[0][0][0]=0;
rep(i,n+m-1)rep(j,m)rep(k,j+1){
if(i-j>=0){
dp[i][j][k]+=a[i-j][j];
if(j!=k) dp[i][j][k]+=a[i-k][k];
}
rep(a,2)rep(b,2) MX(dp[i+1][j+a][k+b],dp[i][j][k]);
}
cout<<dp[n+m-2][m-1][m-1]<<endl;
return 0;
}
| 0 | CPP |
# cr 1095 A (700)
n = int(input())
s = input()
o = []
i = 0
j = 1
while i < len(s):
o.append(s[i])
i += j
j += 1
print("".join(o))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[200500];
vector<long long> t(600500, -1);
long long binpow(long long a, long long b) {
if (b == 1) {
return a;
}
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
long long g = binpow(a, b / 2);
return g * g;
} else {
long long g = binpow(a, b / 2);
return g * g * a;
}
}
bool build(long long v, long long l, long long r) {
if (l == r) {
t[v] = a[l];
return 1;
}
long long mid = (l + r) / 2;
bool h = build(v * 2, l, mid);
build(v * 2 + 1, mid + 1, r);
if (t[v * 2 + 1] == -1) {
t[v] = t[v * 2];
} else if (h == 1) {
t[v] = t[v * 2] | t[v * 2 + 1];
return 0;
} else {
t[v] = t[v * 2] ^ t[v * 2 + 1];
return 1;
}
}
long long upd(long long v, long long l, long long r, long long pos,
long long val) {
if (l > pos || r < pos) {
return 2;
}
if (l == r) {
t[v] = val;
return 1;
}
long long mid = (l + r) / 2;
long long h = upd(v * 2, l, mid, pos, val);
h = min(upd(v * 2 + 1, mid + 1, r, pos, val), h);
if (t[v * 2 + 1] == -1) {
t[v] = t[v * 2];
} else if (h == 1) {
t[v] = t[v * 2] | t[v * 2 + 1];
return 0;
} else if (h == 0) {
t[v] = t[v * 2] ^ t[v * 2 + 1];
return 1;
}
return 2;
}
int main() {
long long n, m;
cin >> n >> m;
for (int i = 1; i <= binpow(2, n); i++) {
cin >> a[i];
}
build(1, 1, binpow(2, n));
n = binpow(2, n);
for (int i = 1; i <= m; i++) {
long long x, y;
cin >> x >> y;
upd(1, 1, n, x, y);
cout << t[1] << endl;
}
}
| 10 | CPP |
num = int(input())
l = [int(x) for x in input().split()]
l2 = l[::-1]
m = l.index(max(l))+l2.index(min(l2))
if m <= num - 2:
print(m)
else:
print(m-1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
while (1) {
string x = to_string(a);
int sum = 0;
for (int i = 0; i < x.length(); i++) {
sum += (x[i] - '0');
}
if (sum % 4 == 0) {
printf("%d\n", a);
break;
}
a++;
}
return 0;
}
| 7 | CPP |
import string
alp=string.ascii_lowercase
s=input()
k=int(input())
ans=''
i=0
while i<len(s)-1:
t=s[i]
d=(26-alp.index(t))%26
if d<=k:
k-=d
ans+='a'
else:
ans+=t
i+=1
if k>0:
ans+=alp[(alp.index(s[-1])+k%26)%26]
else:
ans+=s[-1]
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct ofl {
long double value;
int precision;
inline ofl(long double value, int precision)
: value(value), precision(precision) {}
};
const int seed = hash<string>()("alex256");
const int inf = (int)1e9 + 7;
const int64_t inf64 = (int64_t)2e18 + 256;
const int mod = (int)1e9 + 7;
const long double pi = 3.141592653589793238462643383279502884197169399375105821;
const string luck = "🍀";
const char* errText = "error :(";
const char* pairDelim = " ";
const char* vectorDelim = " ";
template <typename T1, typename T2>
inline istream& operator>>(istream& is, pair<T1, T2>& p) {
return is >> p.first >> p.second;
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << p.first << pairDelim << p.second;
}
template <typename T>
inline istream& operator>>(istream& is, vector<T>& v) {
for (int i = 0; i < (int)(v.size()); i++) {
is >> v[i];
}
return is;
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
for (int i = 0; i < (int)(v.size()); i++) {
if (i) {
os << vectorDelim;
}
os << v[i];
}
return os;
}
inline ostream& operator<<(ostream& os, const ofl& o) {
return os << fixed << setprecision(o.precision) << o.value;
}
inline bool iosOptimize() {
ios_base::sync_with_stdio(false);
return true;
}
bool iosOptimized = iosOptimize();
template <typename T>
inline T get() {
T value;
cin >> value;
return value;
}
template <>
inline char get() {
char c = '\0';
while (c <= ' ') {
cin >> c;
}
return c;
}
inline string getLn() {
string s;
getline(cin, s);
return s;
}
template <typename T, size_t Count>
struct VectorPacker {};
template <typename T>
struct VectorPacker<T, 0> {};
template <typename T>
inline vector<T> getVector(int size) {
vector<T> res(size);
cin >> res;
return res;
}
template <typename T, typename U, typename... Args>
inline typename VectorPacker<T, sizeof...(Args) + 1>::T getVector(
U size, Args... sizes) {
typename VectorPacker<T, sizeof...(Args) + 1>::T res(size);
for (int i = 0; i < (int)size; i++) {
res[i] = getVector<T>(sizes...);
}
return res;
}
inline void put() {}
template <typename T, typename... Args>
inline void put(const T& value, const Args&... vals) {
cout << value;
put(vals...);
}
template <typename... Args>
inline void putLn(const Args&... vals) {
put(vals...);
cout << "\n";
}
namespace std {
template <typename T1, typename T2>
struct hash<pair<T1, T2> > {
inline size_t operator()(const pair<T1, T2>& p) const {
return hash<T1>()(p.first) ^ hash<T2>()(p.second);
}
};
}; // namespace std
mt19937_64 rnd(seed);
inline void error(const char* text = errText) {
text = text;
;
exit(256);
}
template <typename T1, typename T2>
inline void umax(T1& a, const T2& b) {
if (a < b) {
a = b;
}
}
template <typename T1, typename T2>
inline void umin(T1& a, const T2& b) {
if (a > b) {
a = b;
}
}
int64_t gcd(int64_t a, int64_t b) { return b ? gcd(b, a % b) : a; }
int64_t extGcd(int64_t a, int64_t b, int64_t& x, int64_t& y) {
if (!a) {
x = 0;
y = 1;
return b;
}
int64_t x1, y1, d = extGcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
inline int addMod(int a, int b, int m = mod) { return ((int64_t)a + b) % m; }
inline int subMod(int a, int b, int m = mod) {
return ((int64_t)a + m - b) % m;
}
inline int mulMod(int a, int b, int m = mod) { return ((int64_t)a * b) % m; }
inline int divMod(int a, int b, int m = mod) {
int64_t x, y;
int64_t g = extGcd(b, m, x, y);
if (g != 1) {
;
exit(42);
}
x = (x % m + m) % m;
return mulMod(a, x, m);
}
const int factRange = 1000000;
int fact[factRange];
inline void precalcFactorials() {
fact[0] = 1;
for (int i = 1; i < factRange; i++) {
fact[i] = mulMod(fact[i - 1], i);
}
}
inline int first(int n) { return (n < 0) ? 0 : fact[n]; }
inline int C(int k, int n) {
return divMod(first(n), mulMod(first(n - k), first(k)));
}
vector<int> convert(vector<int> v, int sign) {
if (v.empty()) {
return {};
}
vector<int> ans((int)(v.size()) - 1);
for (int i = 0; i < (int)(v.size()) - 1; i++) {
if (sign == +1) {
ans[i] = addMod(v[i], v[i + 1]);
} else {
ans[i] = subMod(v[i], v[i + 1]);
}
sign *= -1;
}
return ans;
}
int brute(vector<int> v) {
int sign = +1;
while ((int)(v.size()) > 1) {
v = convert(v, sign);
if ((int)(v.size()) % 2 == 1) {
sign *= -1;
}
}
return v[0];
}
signed main() {
precalcFactorials();
auto n = get<int>();
auto v = getVector<int>(n);
int sign = +1;
while (n % 4 != 1) {
v = convert(v, sign);
n = (int)(v.size());
if (n % 2 == 1) {
sign *= -1;
}
}
int ans = 0;
int base = n / 2;
for (int i = 0; i <= n / 2; i++) {
ans = addMod(ans, mulMod(v[i * 2], C(i, base)));
}
putLn(ans);
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int i,j,n,m,a,b,c,k;
int main()
{
for(cin>>a>>b>>k,i=a;i<=b;i++)if(i<a+k||i>b-k)cout<<i<<endl;
} | 0 | CPP |
#include <iostream>
using namespace std;
int main(){
int n,x,c=0;
while(cin >> n >> x,(n || x)){
c=0;
for(int i=1;i<=n-1;i++){
for(int j=i+1;j<=n;j++){
for(int k=j+1;k<=n;k++){
if(i+j+k==x) c++;
}
}
}
cout << c << endl;
}
return 0;
} | 0 | CPP |
for i in range(int(input())):
h,m = [int(x) for x in input().split(" ")]
print((60*(23-h))+(60-m)) | 7 | PYTHON3 |
from fractions import gcd
t = int(input())
for _ in range(t):
_ = int(input())
a = list(map(int, input().split()))
corr = sorted(a)
if a == corr:
print("YES")
continue
MIN = min(a)
arr = [x for x, y in zip(a, corr) if x != y]
if all([gcd(x, MIN) == MIN for x in arr]):
print("YES")
else:
print("NO") | 9 | PYTHON3 |
#include <bits/stdc++.h>
const int N = 85;
using namespace std;
int dp[N][N][N][N];
int n, k, m, u, v, w, ma[N][N];
int dfs(int l, int r, int st, int cnt) {
if (dp[l][r][st][cnt] != -1) return dp[l][r][st][cnt];
if (cnt == 1) {
dp[l][r][st][cnt] = 0;
return 0;
}
int ans = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) {
if (ma[st][i] != 0x3f3f3f3f) {
if (i > l && i < r) {
int a = l, b = r;
if (i > st)
a = st;
else
b = st;
ans = min(ans, ma[st][i] + dfs(a, b, i, cnt - 1));
}
}
}
dp[l][r][st][cnt] = ans;
return dp[l][r][st][cnt];
}
int main() {
scanf("%d%d", &n, &k);
scanf("%d", &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) ma[i][j] = 0x3f3f3f3f;
memset(dp, -1, sizeof dp);
while (m--) {
scanf("%d%d%d", &u, &v, &w);
ma[u][v] = min(ma[u][v], w);
}
int ans = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) ans = min(ans, dfs(0, n + 1, i, k));
printf("%d\n", ans == 0x3f3f3f3f ? (-1) : ans);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long sum[maxn], v[maxn], ans[maxn], flag[maxn], t[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lld", &v[i]);
for (int i = 1; i <= n; i++) scanf("%lld", &t[i]);
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + t[i];
for (int i = 1; i <= n; i++) {
int l = i, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
if (v[i] >= (sum[mid] - sum[i - 1]))
l = mid + 1;
else
r = mid - 1;
}
flag[i]++;
flag[l]--;
ans[l] += v[i] - (sum[r] - sum[i - 1]);
}
for (int i = 1; i <= n; i++) {
flag[i] += flag[i - 1];
ans[i] += t[i] * flag[i];
if (i == 1)
printf("%lld", ans[i]);
else
printf(" %lld", ans[i]);
}
printf("\n");
return 0;
}
| 9 | CPP |
zr='0'
def dc(n):
ln=len(n)
for x,t in enumerate(n):
if t==zr:
continue
yield t+(ln-x-1)*zr
n=int(input())
v=[input() for _ in range(n)]
for x in v:
d=list(dc(x))
print(len(d))
print(*d) | 7 | PYTHON3 |
import sys
n, m = map(int, input().strip().split(' '))
arr = list(map(int, input().strip().split(' ')))
arr.sort()
a=sys.maxsize
min_diff=a
for i in range(n-1,m):
min_diff=min(min_diff,arr[i]-arr[i-(n-1)])
print(min_diff)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char a[10][10] = {"", "", "2", "3", "322", "5", "53", "7", "7222", "7332"};
int main() {
int n;
char b[110], c[1000];
while (cin >> n) {
int cnt = 0;
scanf("%s", b);
for (int i = 0; i < n; i++) {
int str = strlen(a[b[i] - '0']);
for (int j = 0; j < str; j++) c[cnt++] = a[b[i] - '0'][j];
}
sort(c, c + cnt);
for (int i = cnt - 1; i >= 0; i--) printf("%c", c[i]);
printf("\n");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dp[102][2600] = {1};
const int mod = 1e9 + 7;
int main() {
for (int i = 1; i <= 100; ++i)
for (int j = 0; j < 2501; ++j)
for (int k = 0; k < 26; ++k)
dp[i][j + k] = (dp[i][j + k] + dp[i - 1][j]) % mod;
int t;
string s;
for (cin >> t; t; t--) {
cin >> s;
int sum = 0;
for (int i = 0; i < s.size(); ++i) sum += s[i] - 'a';
cout << (mod + dp[s.size()][sum] - 1) % mod << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
cout << (60 * h2 + m2) - k - (60 * h1 + m1);
} | 0 | CPP |
print(''.join([str(int(i) * 9 % 10) for i in input()]))
| 0 | PYTHON3 |
for i in range(int(input())):
n=int(input())
lis = list(map(int,input().split()))
f={}
for i in lis:
if(i not in f):
f[i]=0
f[i]+=1
num=[]
for key in f:
num.append(f[key])
c = num.count(max(num))
ans = (n-max(num)-c+1)//(max(num)-1)
print(ans)
| 9 | PYTHON3 |
n = int(input())
s = input()
pre = 0
suf = 0
while pre < n and s[pre] == s[0]:
pre += 1
index = n - 1
while index >= 0 and s[index] == s[-1]:
suf += 1
index -= 1
if s[0] == s[-1]:
ans = (pre + 1)*(suf + 1)
else:
ans = 1 + pre + suf
print(ans % 998244353) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) a.begin(),a.end()
typedef complex<double> Point;
typedef vector<Point> VP;
#define X real()
#define Y imag()
const double INF = 1e9;
bool compX(const Point a, const Point b) {
return a.X<b.X;
}
bool compY(const Point a, const Point b) {
return a.Y<b.Y;
}
double closestPair(VP &a,int l,int r) {
if(r-l<=1) return INF;
int m = (l+r)/2;
double x = a[m].X;
double d = min(closestPair(a,l,m),closestPair(a,m,r));
inplace_merge(a.begin()+l,a.begin()+m,a.begin()+r,compY);
VP b;
for(int i=l;i<r;i++){
if(abs(a[i].X - x)>=d)continue;
for(int j=b.size()-1;j>=0;j--){
if((a[i]-b[j]).Y>=d)break;
d = min(d,abs(a[i]-b[j]));
}
b.push_back(a[i]);
}
return d;
}
double closestPair(VP ps){
sort(ps.begin(),ps.end(),compX);
return closestPair(ps,0,ps.size());
}
int main(void){
int n;
cin>>n;
VP ps(n);
rep(i,n){
double x,y;
cin>>x>>y;
ps[i] = Point(x,y);
}
printf("%.9f\n",closestPair(ps));
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
int n, s, e, x[5010], a[5010], b[5010], c[5010], d[5010];
long long leftbra[5010], rightbra[5010], leftarrow[5010], rightarrow[5010];
long long f[5010][5010];
void cmin(long long& A, long long B) { B < A ? A = B : 1; }
int main() {
scanf("%d%d%d", &n, &s, &e);
for (int i = 1; i <= n; i++) scanf("%d", x + i);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
for (int i = 1; i <= n; i++) scanf("%d", b + i);
for (int i = 1; i <= n; i++) scanf("%d", c + i);
for (int i = 1; i <= n; i++) scanf("%d", d + i);
for (int i = 1; i <= n; i++) {
leftbra[i] = b[i] - x[i] + d[i] - x[i];
rightbra[i] = (long long)a[i] + x[i] + x[i] + c[i];
leftarrow[i] = c[i] + b[i];
rightarrow[i] = d[i] + a[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
f[i][j] = 500000000000000LL;
if (j > i)
continue;
else if (i == 0)
f[i][j] = 0;
else if (!j) {
if (i < n)
continue;
else {
if (j < n) cmin(f[i][j], f[i - 1][j + 1] + rightbra[i]);
}
} else if (i == s) {
if (e > s) {
if (j) cmin(f[i][j], f[i - 1][j - 1] + leftbra[i]);
cmin(f[i][j], f[i - 1][j] + leftarrow[i]);
} else {
if (j < n) cmin(f[i][j], f[i - 1][j + 1] + rightbra[i]);
cmin(f[i][j], f[i - 1][j] + rightarrow[i]);
}
} else if (i == e) {
if (s < e) {
if (j < n) cmin(f[i][j], f[i - 1][j + 1] + rightbra[i]);
cmin(f[i][j], f[i - 1][j] + leftarrow[i]);
} else {
if (j) cmin(f[i][j], f[i - 1][j - 1] + leftbra[i]);
cmin(f[i][j], f[i - 1][j] + rightarrow[i]);
}
} else {
if (j) cmin(f[i][j], f[i - 1][j - 1] + leftbra[i]);
if (j < n) cmin(f[i][j], f[i - 1][j + 1] + rightbra[i]);
if (!(s < i && i < e && j == 1))
cmin(f[i][j], f[i - 1][j] + leftarrow[i]);
if (!(e < i && i < s && j == 1))
cmin(f[i][j], f[i - 1][j] + rightarrow[i]);
}
}
}
long long ans = f[n][0];
if (s < e) {
ans -= (long long)x[e] - x[s] + c[e] + b[s];
} else {
ans -= (long long)x[s] - x[e] + d[e] + a[s];
}
std::cout << ans;
}
| 10 | CPP |
import itertools
s = input()
print(len(list(itertools.groupby(s)))-1) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN(1000005);
string a, name[MAXN];
vector<int> tree[MAXN];
int now = 1, idx = 0;
void dfs(int node) {
while (idx < a.size()) {
idx++;
bool open = 0, close = 0, self = 0;
if (a[idx] == '/') {
close = true;
idx++;
}
string t = "";
while (idx < a.size() && a[idx] != '/' && a[idx] != '>') {
t += a[idx];
idx++;
}
if (a[idx] == '/') {
self = true;
idx++;
} else
open = true;
idx++;
if (close)
break;
else if (open) {
tree[node].push_back(now);
name[now] = t;
now++;
dfs(now - 1);
} else if (self) {
tree[node].push_back(now);
name[now] = t;
now++;
}
}
}
vector<string> d;
int ans;
void dfs2(int node, int idx) {
if (d[idx + 1] == name[node]) idx++;
if (idx == d.size() - 1) {
ans++;
idx--;
}
for (int i = 0; i < tree[node].size(); i++) dfs2(tree[node][i], idx);
}
int main() {
getline(cin, a);
name[0] = "?";
dfs(0);
int m;
char M[10];
gets(M);
m = atoi(M);
while (m--) {
string b;
getline(cin, b);
d.clear();
d.push_back("?");
int k = 0;
while (k < b.size()) {
int l = b.find(" ", k);
if (l == -1) l = b.size();
d.push_back(b.substr(k, l - k));
k = l + 1;
}
ans = 0;
dfs2(0, -1);
cout << ans << endl;
}
}
| 11 | CPP |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
string s; cin>>s;
if(s.length()==3) swap(s[0],s[2]);
cout<<s<<'\n';
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 5 * (100000);
const int mod = 1e9 + 7;
long long n, x, t, m, k;
vector<long long> v;
string s;
int main() {
cin >> t;
while (t--) {
cin >> n >> m;
n = n + m;
cout << n << endl;
}
return 0;
}
| 7 | CPP |
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO,IOBase
def main():
mod = 10**9+7
n,k,q = map(int,input().split())
a = list(map(int,input().split()))
curr = [[0]*(n+2) for _ in range(k+1)]
curr[0] = [0]+[1]*n+[0]
for i in range(1,k+1):
for j in range(1,n+1):
curr[i][j] = (curr[i-1][j-1]+curr[i-1][j+1])%mod
dp = [0]*n
for j in range(n):
for x in range(k+1):
dp[j] = (dp[j]+curr[k-x][j+1]*curr[x][j+1])%mod
su = 0
for i in range(n):
su = (su+dp[i]*a[i])%mod
ans = []
for _ in range(q):
x,y = map(int,input().split())
su = (su+dp[x-1]*(y-a[x-1]))%mod
a[x-1] = y
ans.append(su)
for i in ans:
print(i)
#Fast IO Region
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")
if __name__ == '__main__':
main() | 10 | PYTHON3 |
q = int(input())
for i in range(q):
n,m = map(int,input().split())
t0 = 0
t = []
l = []
h = []
ans = "YES"
r = m
for j in range(n):
t,l,h = map(int,input().split())
x = t-t0
t0 = t
m = max(l,m-x)
r = min(h, r+x)
if m > r:
ans = "NO"
print(ans)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, second, ans = 0, k = 1, i, a;
cin >> n >> second;
map<long long, long long> mp;
for (i = 1; i <= n; i++) {
cin >> a;
if (i == second && a)
ans++;
else
mp[a]++;
}
for (i = 1; i < n; i++) {
if (k >= n) break;
if (mp[i] == 0)
k++, ans++;
else
k += mp[i];
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
solve();
return 0;
}
| 11 | CPP |
n = int(input())
b = list(map(int, input().split()))
m = int(input())
g = list(map(int, input().split()))
b.sort()
g.sort()
res = 0
i = 0
j = 0
while i < n and j < m:
if abs(b[i]-g[j]) <= 1:
res += 1
i += 1
j += 1
elif b[i] > g[j]:
j += 1
else:
i += 1
print(res)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#define ii pair<int, int>
#define lli long long int
#define ll pair<lli, lli>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
lli bigmod = 1000000007;
lli fex(lli b) {
lli ret;
if (b == 0)
return 1;
ret = fex(b / 2);
ret = (ret * ret) % bigmod;
if (b & 1)
ret = (ret * 2) % bigmod;
return ret;
}
int main() {
lli n, c[200005], ans = 0, temp;
scanf("%lld", &n);
for (lli i = 0; i < n; i++)
scanf("%lld", &c[i]);
sort(c, c + n);
for (lli i = 0; i < n; i++) {
temp = ((n - i + 1) * c[i]) % bigmod;
ans = (ans + temp) % bigmod;
}
ans = (ans * fex(n + n - 2)) % bigmod;
printf("%lld\n", ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
#pragma GCC_OPTIMAZE("ofast")
using namespace std;
signed main() {
string t, s;
cin >> s >> t;
long long n = s.size();
long long m = t.size();
vector<long long> dp_l(m, -1);
vector<long long> dp_r(m, -1);
long long now = 0;
for (long long i = 0; i < n; i++) {
if (now < m && s[i] == t[now]) {
dp_l[now] = i;
now++;
}
}
now = m - 1;
for (long long i = n - 1; i >= 0; i--) {
if (now >= 0 && t[now] == s[i]) {
dp_r[now] = i;
now--;
}
}
long long ans = 0;
ans = max(ans, n - 1 - dp_l[m - 1]);
ans = max(ans, dp_r[0]);
for (long long i = 0; i < m - 1; i++) {
if (dp_l[i] != -1 && dp_r[i + 1] != -1) {
ans = max(ans, dp_r[i + 1] - dp_l[i] - 1);
}
}
cout << ans;
}
| 10 | CPP |
import math
def solve(n, m, a):
return math.ceil(n / a) * math.ceil(m / a)
n, m, a = [int(i) for i in input().split(' ')]
print(solve(n, m, a)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#define BM (1<<12)
#define BT (1<<19)
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
ll memo[BM][BM];
int A[BT],B[BT];
ll score(int s,int t)
{
if(s==t) return s+1;
return score((s-1)/2,(t-1)/2)*(ll) (s+1)%MOD*(ll) (t+1)%MOD;
}
int main()
{
int n;
scanf("%d",&n);n--;
int b=min(6,n),block=1<<b;
//b=2,block=1<<b;
for(int i=0;i<1<<n;i++)
{
scanf("%d",&A[i]);
A[i]--;
//A[i]=i;
B[A[i]]=i;
int a=i+(1<<n)-1,a2=A[i]+(1<<n)-1;
vector <int> vx,vy;
vector <ll> vs,vt;
ll now=1;
while(1)
{
now*=a+1;
now%=MOD;
if(a<(1<<(n-b+1))-1)
{
vx.push_back(a);
vs.push_back(now);
}
if(a==0) break;
a=(a-1)/2;
}
now=1;
a=a2;
while(1)
{
now*=a+1;
now%=MOD;
if(a<(1<<(n-b+1))-1)
{
vy.push_back(a);
vt.push_back(now);
}
if(a==0) break;
a=(a-1)/2;
}
for(int i=0;i<vx.size();i++)
{
for(int j=0;j<vy.size();j++)
{
memo[vx[i]][vy[j]]+=vs[i]*vt[j]%MOD;
if(memo[vx[i]][vy[j]]>=MOD) memo[vx[i]][vy[j]]-=MOD;
}
}
}/*
for(int i=0;i<1<<n ;i++)
{
for(int j=0;j<1<<n;j++) printf("%lld ",memo[i][j]);
puts("");
}*/
ll ret=0,ret2=0;
for(int i=0;i<1<<n;i++)
{
int r=i/block;
int r2=A[i]/block;
for(int j=i%block+1;j<block;j++)
{
int v=r*block+j;
if(A[v]/block!=r2)
{
ret+=score((1<<n)-1+i,(1<<n)-1+v)*score((1<<n)-1+A[i],(1<<n)-1+A[v])%MOD;
if(ret>=MOD) ret-=MOD;
}
}
for(int j=A[i]%block+1;j<block;j++)
{
int v=B[r2*block+j];
ret+=score((1<<n)-1+i,(1<<n)-1+v)*score((1<<n)-1+A[i],(1<<n)-1+A[v])%MOD;
if(ret>=MOD) ret-=MOD;
}
if(b<n)
{
int a=i+(1<<n)-1,a2=A[i]+(1<<n)-1;
vector <int> vx,vy;
vector <ll> vs,vt;
ll now=1;
int bef=-1;
while(1)
{
now*=a+1;
now%=MOD;
if(a<(1<<(n-b))-1)
{
int to=2*a+1;
if(bef==to) to++;
vx.push_back(to);
vs.push_back(now);
}
if(a==0) break;
bef=a;
a=(a-1)/2;
}
now=1;
bef=-1;
a=a2;
while(1)
{
now*=a+1;
now%=MOD;
if(a<(1<<(n-b))-1)
{
int to=2*a+1;
if(bef==to) to++;
vy.push_back(to);
vt.push_back(now);
}
if(a==0) break;
bef=a;
a=(a-1)/2;
}
for(int j=0;j<vx.size();j++)
{
for(int k=0;k<vy.size();k++)
{
//if(memo[vx[j]][vy[k]]!=0) printf("%d : %d %d\n",i,vx[j],vy[k]);
ret2+=vs[j]*vt[k]%MOD*memo[vx[j]][vy[k]]%MOD;
if(ret2>=MOD) ret2-=MOD;
}
}
}
}
if(ret2%2==1) ret2+=MOD;
ret2/=2;
printf("%lld\n",(ret+ret2)%MOD);
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int x, y, z;
cin >> x >> y >> z;
if (x != y && x != z && y != z)
cout << "NO\n";
else {
int mn = min({x, y, z}), mx = max({x, y, z});
int cnt = 0;
cnt += (x == mn) + (y == mn) + (z == mn);
if (cnt > 1 && mn != mx)
cout << "NO\n";
else {
cout << "YES\n";
cout << mn << " " << mn << " " << mx << "\n";
}
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool deleted[110];
int cnt[110], cnt2[20];
void parse(string s, int b, int e) {
memset(cnt, 0, sizeof cnt);
memset(cnt2, 0, sizeof cnt2);
memset(deleted, false, sizeof deleted);
int i = b, dir = 1;
while (i >= b && i < e) {
bool changedDir = false;
if (s[i] == '<') {
dir = -1;
changedDir = true;
} else if (s[i] == '>') {
dir = 1;
changedDir = true;
} else {
cnt2[s[i] - cnt[i] - '0']++;
cnt[i]++;
if (s[i] - cnt[i] < '0') deleted[i] = true;
}
int nowi = i;
i += dir;
while (i < e && i >= b && deleted[i]) i += dir;
if (changedDir && i < e && i >= b && (s[i] == '<' || s[i] == '>'))
deleted[nowi] = true;
}
for (int i = 0; i < 10; i++) cout << cnt2[i] << " ";
cout << endl;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
parse(s, l - 1, r);
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 5;
int main() {
cin.tie(0), cin.sync_with_stdio(0);
long long n, k, m, d;
cin >> n >> k >> m >> d;
long long ans = -1;
for (int i = 1; i <= d; i++) {
long long times = n / k;
if (times < i - 1) break;
long long hi = n / (k * (i - 1) + 1);
long long x = min(hi, m);
ans = max(ans, x * i);
}
cout << ans;
}
| 9 | CPP |
s=input()
se=set()
for i in range(1,len(s)-1,3):
se.add(s[i])
print(len(se))
| 7 | PYTHON3 |
def solve(a,n):
new = []
i = 0
while(i < n):
cnt = 0
if a[i] == 1:
while(i < n and a[i] == 1):
i += 1
cnt += 1
new.append(cnt)
else:
while(i<n and a[i]==2):
i += 1
cnt += 1
new.append(cnt)
mx = 0
#print('new',new)
for i in range(1,len(new)):
#print('new[i]:',new[i],"new[i-1]:",new[i-1],'i:',i)
mx = max(2*min(new[i],new[i-1]),mx)
return mx
n = int(input())
a = list(map(int,input().split()))
print(solve(a,n)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MAXN = 300001;
const long long INF = 1000000000ll;
const long long LLINF = 1000000000000000000ll;
const int MOD = 1000000007;
int a[MAXN];
int mx[MAXN];
int l[MAXN];
int r[MAXN];
int pr[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
int t;
cin >> t;
for (int tt = 0; tt < (int)(t); tt++) {
int n;
cin >> n;
for (int i = 0; i < (int)(n); i++) {
l[i] = r[i] = -1;
}
int cnt = 0;
for (int i = 0; i < (int)(n); i++) {
cin >> a[i];
a[i]--;
if (l[a[i]] == -1) {
l[a[i]] = i;
cnt++;
}
r[a[i]] = i;
}
int prev = -1;
for (int i = 0; i < (int)(n); i++) {
if (l[i] != -1) {
pr[i] = prev;
prev = i;
}
}
int res = 0;
for (int i = 0; i < (int)(n); i++) {
if (l[a[i]] == i) {
mx[i] = 1;
if (pr[a[i]] != -1 && r[pr[a[i]]] < i) {
mx[i] = 1 + mx[l[pr[a[i]]]];
}
res = max(res, mx[i]);
}
}
cout << cnt - res << "\n";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000050;
vector<vector<int>> v(N), s(N);
set<int> u;
void dfs(int i, int j) {
if (i > j) {
if (u.count(i) && u.count(j) == 1) {
printf("No\n");
exit(0);
}
u.insert(i);
for (int k : v[i]) dfs(k, i);
} else {
if (u.count(i) == 0 && u.count(j) == 1) {
u.insert(i);
for (int k : v[i]) dfs(k, i);
}
}
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
int l;
scanf("%d", &l);
for (int j = 0; j < l; j++) {
int in;
scanf("%d", &in);
s[i].push_back(in);
}
}
for (int i = 0; i + 1 < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
if (j == s[i + 1].size()) {
printf("No\n");
return 0;
}
if (s[i][j] != s[i + 1][j]) {
v[s[i + 1][j]].push_back(s[i][j]);
break;
}
}
}
for (int i = 1; i <= m; i++) {
for (int j : v[i]) {
dfs(j, i);
}
}
for (int i = 0; i + 1 < n; i++) {
for (int j = 0; j < s[i].size(); j++) {
if (j == s[i + 1].size()) {
printf("No\n");
return 0;
}
if (s[i][j] == s[i + 1][j]) {
continue;
}
if (s[i][j] > s[i + 1][j]) {
if (!(u.count(s[i][j]) == 1 and u.count(s[i + 1][j]) == 0)) {
printf("No\n");
return 0;
}
} else {
if (u.count(s[i][j]) == 0 and u.count(s[i + 1][j]) == 1) {
return printf("No\n"), 0;
}
}
break;
}
}
printf("Yes\n%d\n", u.size());
for (int next : u) {
printf("%d ", next);
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
void Freopen() {
freopen(
"CF1292D Chaotic V."
".in",
"r", stdin);
freopen(
"CF1292D Chaotic V."
".out",
"w", stdout);
}
int read() {
int g = 0, f = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
g = g * 10 + ch - '0';
ch = getchar();
}
return g * f;
}
const int N = 5e3 + 5;
const int maxn = 5e3;
int n, nu[N], f[N][N], p[N], s[N];
long long ans, now;
signed main() {
n = read();
for (int i = (1); i <= (n); i++) {
int x = read();
nu[x]++;
}
for (int i = (2); i <= (maxn); i++) {
memcpy(f[i], f[i - 1], sizeof(f[i]));
int x = i;
for (int j = (2); j <= (x); j++)
while (x % j == 0) f[i][j]++, x /= j;
}
for (int i = (1); i <= (maxn); i++) {
if (!nu[i])
p[i] = 1;
else
for (int j = (1); j <= (i); j++)
if (f[i][j]) p[i] = j, now += 1ll * f[i][j] * nu[i];
}
ans = now;
while (*max_element(p + 1, p + maxn + 1) > 1) {
memset(s, 0, sizeof(s));
for (int i = (0); i <= (maxn); i++) s[p[i]] += nu[i];
int x = max_element(s + 1, s + maxn + 1) - s, w = s[x];
if (w * 2 <= n || x == 1) break;
ans = min(ans, now -= w * 2 - n);
for (int i = (0); i <= (maxn); i++) {
if (p[i] != x) p[i] = 1;
if (p[i] == 1) continue;
f[i][p[i]]--;
while (p[i] > 1 && !f[i][p[i]]) p[i]--;
}
}
cout << ans;
return signed();
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MXN = 1e3, MXM = 1e3;
const int M = 1e9 + 7;
int n, m, k;
long long tab[MXN + 5][MXM + 5];
int main() {
cin >> n >> m >> k;
tab[0][0] = 1;
for (int i = 1; i <= max(n - 1, m - 1); i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
tab[i][j] = 1;
else
tab[i][j] = (tab[i - 1][j] + tab[i - 1][j - 1]) % M;
}
}
cout << ((long long)tab[n - 1][2 * k] * tab[m - 1][2 * k]) % M << "\n";
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> g;
const int maxn = 100005;
vector<bool> mark(maxn);
vector<bool> tree(4 * maxn);
int N;
void query(int pos, int i, int j, int l, int r) {
int esq = 2 * pos;
int dir = 2 * pos + 1;
int mid = (i + j) / 2;
int dl = 0;
int u;
if (i > r || j < l)
return;
else if (i >= l && j <= r) {
if (i == j && tree[pos] == false) {
tree[pos] = true;
mark[i] = true;
u = i;
for (auto v : g[u]) {
if (v - 1 >= dl) query(1, 0, N - 1, dl, v - 1);
dl = v + 1;
}
if (N - 1 >= dl) query(1, 0, N - 1, dl, N - 1);
} else if (i < j) {
if (tree[esq] == false) query(esq, i, mid, l, r);
if (tree[dir] == false) query(dir, mid + 1, j, l, r);
tree[pos] = tree[esq] & (tree[dir]);
}
} else {
if (tree[esq] == false) query(esq, i, mid, l, r);
if (tree[dir] == false) query(dir, mid + 1, j, l, r);
tree[pos] = tree[esq] & (tree[dir]);
}
}
int solve(int n) {
int cont = 0;
for (int i = 0; i < n; i++) {
if (mark[i] == false) {
cont++;
query(1, 0, n - 1, i, i);
}
}
return cont;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
g.resize(n + 3);
N = n;
while (m--) {
int u, v;
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
g[v].push_back(u);
}
for (int i = 0; i < n; i++) sort(g[i].begin(), g[i].end());
cout << solve(n) - 1 << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const double EPS = 1e-10;
const double PI = acos(-1);
vector<int> EulerianPath(int s, vector<list<int>>& g) {
function<void(int, vector<int>&)> dfs = [&](int u, vector<int>& path) {
while (not g[u].empty()) {
int v = g[u].back();
g[u].pop_back();
auto itr = g[v].begin();
while (*itr != u) ++itr;
g[v].erase(itr);
dfs(v, path);
}
path.push_back(u);
};
vector<int> path;
dfs(s, path);
reverse(path.begin(), path.end());
return path;
}
class ENekoAndFlashback {
public:
vector<int> A;
vector<list<int>> G;
int get(int x) const {
return lower_bound((A).begin(), (A).end(), x) - A.begin();
}
void solve(std::istream& in, std::ostream& out) {
ios_base::sync_with_stdio(false);
in.tie(nullptr), out.tie(nullptr);
int N;
in >> N;
A.resize(2 * N - 2);
vector<int> B(N - 1), C(N - 1);
for (int i = (0); i < (N - 1); ++i) {
in >> B[i];
A[i] = B[i];
}
for (int i = (0); i < (N - 1); ++i) {
in >> C[i];
A[N - 1 + i] = C[i];
}
sort((A).begin(), (A).end());
A.erase(unique((A).begin(), (A).end()), A.end());
int nn = (int)(A).size();
G.resize(nn);
for (int i = (0); i < (N - 1); ++i) {
if (B[i] > C[i]) {
out << "-1\n";
return;
}
int u = get(B[i]), v = get(C[i]);
G[u].push_back(v), G[v].push_back(u);
}
int s = -1, t = -1;
for (int i = (0); i < (nn); ++i) {
if ((int)(G[i]).size() & 1) {
if (s == -1)
s = i;
else if (t == -1)
t = i;
else {
out << "-1\n";
return;
}
}
}
if (s == -1) s = 0;
vector<int> P = EulerianPath(s, G);
if ((int)(P).size() != N)
out << "-1\n";
else {
for (auto p : P) out << A[p] << ' ';
out << '\n';
}
}
};
int main() {
ENekoAndFlashback solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
int N, M;
vector<int> adj[MAXN + 10];
bool vis[MAXN + 10];
void dfs(int now) {
vis[now] = true;
for (int nxt : adj[now]) {
if (vis[nxt]) continue;
dfs(nxt);
}
}
int main() {
int i, j;
scanf("%d%d", &N, &M);
for (i = 1; i <= M; i++) {
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
int cnt = 0;
for (i = 1; i <= N; i++) {
if (vis[i]) continue;
cnt++;
dfs(i);
}
printf("%d", M - N + cnt);
}
| 10 | CPP |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n,m,c;
cin>>n>>m>>c;
vector<int> v(c);
rep(i,c)cin>>v[i];
priority_queue<pii> pq;
rep(i,n){
int c,w;
cin>>c>>w;
c--;
pq.push(pii(w,c));
}
int used = 0;
int ans = 0;
while(used<m && pq.size()){
int c,w;
tie(w,c) = pq.top();
pq.pop();
if(v[c]>0){
ans += w;
v[c]--;
used++;
}
}
cout<<ans<<endl;
}
| 0 | CPP |
s=list(input())
if s == ['R', 'S', 'R']:
print(1)
exit()
print(s.count('R')) | 0 | PYTHON3 |
for _ in range(int(input())):
n,m=map(int,input().split())
print(min(min(n,m),(n+m)//3)) | 7 | PYTHON3 |
import math
def greatest_divider(a, b):
a = int(a)
b = int(b)
if a > b:
return math.factorial(b)
else:
return math.factorial(a)
def main():
a, b = input().split()
c = greatest_divider(a, b)
print(c)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int maxi = (int)1e5 + 7;
long dp[maxi];
int main() {
ios::sync_with_stdio(0);
int n, k;
cin >> n >> k;
for (int i = 1; i < k; ++i) dp[i] = 1;
dp[k] = 2;
for (int i = k + 1; i < maxi; ++i) {
dp[i] = dp[i - 1] + dp[i - k];
dp[i] %= mod;
}
for (int i = 1; i < maxi; ++i) {
dp[i] += dp[i - 1];
dp[i] %= mod;
}
for (int t = 0; t < n; ++t) {
int a, b;
cin >> a >> b;
cout << (mod + dp[b] - dp[a - 1]) % mod << "\n";
}
return 0;
}
| 10 | CPP |
#!/usr/bin/env python
# coding: utf-8
# In[16]:
def method1(a, b, c, d):
found = False
for i in range(a, b + 1):
if found:
break
for j in range(b, c + 1):
if found:
break
k = i + j
if k > c:
print(i, j, k)
found = True
if not found:
print('Not Found!')
# In[18]:
def method2(a, b, c, d):
print(b, c, c)
# In[ ]:
def main():
test_case_count = int(input())
for i in range(test_case_count):
abcd = input()
a, b, c, d = map(int, abcd.split())
method2(a, b, c, d)
main()
# In[ ]:
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
const double pi = acos(-1.0);
int main() {
std::ios_base::sync_with_stdio(false);
int n, s;
while (cin >> n >> s) {
long long int ans = -1;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x < s) {
if (y != 0)
ans = ((ans) > (100 - y) ? (ans) : (100 - y));
else
ans = ((ans) > (0) ? (ans) : (0));
} else if (x == s && y == 0) {
ans = ((ans) > (0) ? (ans) : (0));
}
}
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
m,n=[int(j) for j in input().split()]
lst=list(map(int,input().strip().split()))[:n]
count=0
lst.insert(0,1)
for i in range(0,len(lst)-1):
if lst[i+1]>=lst[i]:
count=count+lst[i+1]-lst[i]
else:
count=count+m-lst[i]+lst[i+1]
print(count) | 8 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int t;
scanf("%d", &t);
for (int i = 0; i < t; i++) {
char b[100];
scanf("%s", b);
char a[100];
int l = strlen(b);
if (l == 2) {
printf("%s\n", b);
} else {
a[0] = b[0];
int j = 1;
for (int i = 1; i <= l - 2; i += 2) {
a[j++] = b[i];
}
a[j] = b[l - 1];
a[j + 1] = '\0';
printf("%s\n", a);
}
}
return 0;
}
| 7 | CPP |
# cook your dish here
n=int(input())
list1=[]
for i in range(n):
list2=[int(x) for x in input().split()]
list1.append(list2)
c=0
d=0
e=0
for i in range(n):
c=list1[i][0]+c
for i in range(n):
d=list1[i][1]+d
for i in range(n):
e=list1[i][2]+e
if c==0 and d==0 and e==0:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
for _ in range(int(input())):
line = input()
if len(line) <= 10:
print(line)
else:
print(line[0], len(line)-2, line[-1], sep='') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
const int logn = 17;
const int inf = (int)1e9;
const long long mod = (int)1e9 + 7;
const long long l_inf = (long long)4e18;
const long double pi = acosl(-1.0);
const long double eps = 1e-9;
struct Event {
int tp, t, x, c;
bool operator<(const Event &e) const { return t < e.t; }
};
int n, m, k;
int h[maxn][2], w[maxn][2];
int a[maxn][maxn];
vector<Event> e;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
srand(566);
cin >> n >> m >> k;
for (int i = 0; i < k; i++) {
int x, y, z;
cin >> x >> y >> z;
if (x == 1) {
h[y][0] = z;
h[y][1] = i + 1;
} else {
w[y][0] = z;
w[y][1] = i + 1;
}
}
for (int i = 1; i <= n; i++)
if (h[i][0] != 0) e.push_back({1, h[i][1], i, h[i][0]});
for (int i = 1; i <= m; i++)
if (w[i][0] != 0) e.push_back({2, w[i][1], i, w[i][0]});
sort(e.begin(), e.end());
for (Event x : e) {
if (x.tp == 1) {
for (int i = 1; i <= m; i++) a[x.x][i] = x.c;
} else {
for (int i = 1; i <= n; i++) a[i][x.x] = x.c;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cout << a[i][j] << ' ';
cout << '\n';
}
return 0;
}
| 8 | CPP |
import re
a,b,c=map(int, re.split("[ .]",input()))
print(a*(b*100+c)//100) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int k, en, a[30];
long long S, ans, f[30];
map<long long, int> mp[30];
void dfs1(int st, int op, long long sum) {
if (sum > S || op > k) return;
if (st == en) {
mp[op][sum]++;
return;
}
dfs1(st + 1, op, sum);
dfs1(st + 1, op, sum + a[st]);
if (a[st] < 20) dfs1(st + 1, op + 1, sum + f[a[st]]);
}
void dfs2(int st, int op, long long sum) {
int i;
if (sum > S || op > k) return;
if (st == en) {
for (i = 0; i <= k - op; i++)
if (mp[i].count(S - sum)) ans += mp[i][S - sum];
return;
}
dfs2(st + 1, op, sum);
dfs2(st + 1, op, sum + a[st]);
if (a[st] < 20) dfs2(st + 1, op + 1, sum + f[a[st]]);
}
int main() {
int i, j, n;
f[0] = 1;
for (i = 1; i <= 20; i++) f[i] = f[i - 1] * i;
scanf("%d%d%I64d", &n, &k, &S);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
en = n / 2, ans = 0;
dfs1(0, 0, 0);
en = n;
dfs2(n / 2, 0, 0);
printf("%I64d\n", ans);
return 0;
}
| 11 | CPP |
line = input()
cons = ['q', 'w', 'r', 't', 'y', 'p', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'm']
vow = ['a', 'e', 'i', 'o', 'u']
ans = 'YES'
if line[len(line) - 1] in cons:
ans = 'NO'
else:
for i in range(len(line)):
if line[i] not in cons + vow + ['n']:
ans = 'NO'
break
elif line[i] in cons and i != len(line) - 1:
if line[i + 1] not in vow:
ans = 'NO'
break
print(ans)
| 7 | PYTHON3 |
#!/usr/bin/env python3
import sys
def get_ints():
return map(int, sys.stdin.readline().strip().split())
k, n, w = get_ints()
cost = 0
for x in range(w):
cost += (x+1)*k
print(max(0,cost-n))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, a[100000], b[100000], i;
long long joy = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n; i++) scanf("%d", &b[i]);
for (i = 0; i < n; i++) {
if (2 * a[i] < b[i] || b[i] == 1)
joy += -1;
else {
if (b[i] % 2 == 0)
joy += (long long)(b[i] / 2) * (long long)(b[i] / 2);
else
joy += (long long)(b[i] / 2) * (long long)(b[i] / 2 + 1);
}
}
printf("%lld", joy);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const string nl = "\n";
const long long MOD = 1000000007;
const long long ARR_MAX = 1e5 + 1;
void solve() {
int r, c;
cin >> r >> c;
string s[r];
bool hasA = false, hasP = false;
for (int i = 0; i < r; i++) {
cin >> s[i];
for (int j = 0; j < c; j++) {
if (s[i][j] == 'P') {
hasP = true;
} else {
hasA = true;
}
}
}
if (!hasA) {
cout << "MORTAL" << nl;
return;
}
if (!hasP) {
cout << 0 << nl;
return;
}
int flag = 0;
int dx[4] = {0, 0, 1, 1}, dy[4] = {1, 1, 0, 0}, ix[4] = {0, r - 1, 0, 0},
iy[4] = {0, 0, 0, c - 1}, lim[4] = {c, c, r, r};
for (int i = 0; i < 4; i++) {
int x = ix[i], y = iy[i];
flag = 1;
for (int j = 0; j < lim[i]; j++) {
x = ix[i] + j * dx[i];
y = iy[i] + j * dy[i];
if (s[x][y] == 'P') {
flag = 0;
break;
}
}
if (flag == 1) {
cout << 1 << nl;
return;
}
}
if (s[0][0] == 'A' || s[0][c - 1] == 'A' || s[r - 1][0] == 'A' ||
s[r - 1][c - 1] == 'A') {
cout << 2 << nl;
return;
}
for (int i = 0; i < r; i++) {
int flag = 1;
for (int j = 0; j < c; j++) {
if (s[i][j] == 'P') flag = 0;
}
if (flag) {
cout << 2 << nl;
return;
}
}
for (int j = 0; j < c; j++) {
int flag = 1;
for (int i = 0; i < r; i++) {
if (s[i][j] == 'P') flag = 0;
}
if (flag) {
cout << 2 << nl;
return;
}
}
for (int i = 0; i < r; i++) {
if (s[i][0] == 'A' || s[i][c - 1] == 'A') {
cout << 3 << nl;
return;
}
}
for (int i = 0; i < c; i++) {
if (s[0][i] == 'A' || s[r - 1][i] == 'A') {
cout << 3 << nl;
return;
}
}
cout << 4 << nl;
}
int main() {
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const long long INF = 1e18;
template <typename T>
void chkmax(T &x, T y) {
x = max(x, y);
}
template <typename T>
void chkmin(T &x, T y) {
x = min(x, y);
}
template <typename T>
void read(T &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
int n, ans, tot, x[MAXN], y[MAXN];
int l, r, q[MAXN * 2], d[MAXN];
bool vis[MAXN];
vector<int> a[MAXN], rem;
pair<int, int> v[MAXN];
void work(int pos) {
vis[pos] = true;
v[++tot] = make_pair(x[pos], y[pos]);
if (pos == rem[1]) return;
for (auto x : a[pos])
if (!vis[x]) work(x);
}
long long calc(int pos) {
static pair<int, int> home[MAXN];
int cnt = 0;
for (int i = 1; i <= tot; i++)
if (i != pos) {
home[v[i].first].first = ++cnt;
home[v[i].second].second = cnt;
}
int x = 0, y = 0;
for (int i = 1; i <= n; i++)
if (home[i].first) {
int tx = abs(home[i].first - home[i].second), ty = cnt - tx;
if (x + y == 0)
x = tx, y = ty;
else if (x != tx && y != tx)
return INF;
}
return 1ll * min(x, y) * tot;
}
int main() {
read(n);
for (int i = 1; i <= n; i++) read(x[i]);
for (int i = 1; i <= n; i++) read(y[i]);
for (int i = 1; i <= n - 1; i++) {
int x, y;
read(x), read(y);
a[x].push_back(y);
a[y].push_back(x);
}
l = 1, r = 0;
for (int i = 1; i <= n; i++) {
d[i] = a[i].size();
if (d[i] == 1) q[++r] = i;
}
while (l <= r) {
int pos = q[l++];
if (x[pos] == y[pos] && x[pos] != 0) {
vis[pos] = true;
for (auto v : a[pos])
if (!vis[v] && --d[v] == 1) q[++r] = v;
} else {
int fa = 0;
for (auto v : a[pos])
if (!vis[v]) fa = v;
if (fa == 0) {
assert(l > r);
printf("%d %d\n", 0, ans);
return 0;
} else if (x[pos] == 0 && y[pos] == x[fa]) {
swap(x[pos], x[fa]), ans++;
vis[pos] = true;
if (--d[fa] == 1) q[++r] = fa;
} else if (y[pos] == 0 && x[pos] == y[fa]) {
swap(y[pos], y[fa]), ans++;
vis[pos] = true;
if (--d[fa] == 1) q[++r] = fa;
} else if (x[pos] == y[pos] && x[pos] == 0 && x[fa] == y[fa]) {
if (rem.size() >= 2 || l > r) {
swap(x[pos], x[fa]), ans++;
swap(y[pos], y[fa]), ans++;
vis[pos] = true;
if (--d[fa] == 1) q[++r] = fa;
} else
q[++r] = pos;
} else
rem.push_back(pos);
}
}
if (rem.size() >= 3) {
puts("-1");
return 0;
}
assert(rem.size() == 2);
if (rem[0] > rem[1]) swap(rem[0], rem[1]);
long long res = INF;
work(rem[0]);
int x = 0, y = 0;
for (int i = 1; i <= tot; i++) {
if (v[i].first == 0) x = i;
if (v[i].second == 0) y = i;
}
if (x > y) {
swap(x, y);
for (int i = 1; i <= tot; i++) swap(v[i].first, v[i].second);
}
for (int i = x + 1; i <= y; i++) swap(v[i].first, v[i - 1].first);
chkmin(res, y - x + calc(y));
for (int i = y; i >= x + 1; i--) swap(v[i].first, v[i - 1].first);
for (int i = x; i >= 2; i--) swap(v[i].first, v[i - 1].first);
swap(v[1].first, v[tot].first);
for (int i = tot; i >= y + 1; i--) swap(v[i].first, v[i - 1].first);
chkmin(res, tot - (y - x) + calc(y));
if (res < INF)
printf("%d %d %lld\n", rem[0], rem[1], res + ans);
else
puts("-1");
return 0;
}
| 12 | CPP |
# ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import *
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from sys import stdin
from sys import maxsize
from operator import * # d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter # d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)
'''
'''
def solve(l):
n = len(l)
T = int(input())
for _ in range(T):
a = input()
b = input()
c = input()
f = 1
for i in range(len(a)):
if(a[i] == c[i] or b[i] == c[i]):
x = 1
else:
f = 0
if(f):
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
t=int(input())
x0=0
y0=0
z0=0
for i in range(t):
x,y,z=input().split()
x=int(x)
y=int(y)
z=int(z)
x0+=x
y0+=y
z0+=z
if(x0==0 and z0==0 and y0==0):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
char ent[1000100];
int main() {
scanf("%s", ent);
int n = strlen(ent);
int pqp = 0, resp = 0;
for (int i = n - 1; i >= 0; i--) {
if (ent[i] == 'F')
pqp++;
else if (pqp)
resp = max(resp + 1, pqp);
}
printf("%d\n", resp);
return 0;
}
| 10 | CPP |
#include <iostream>
using namespace std;
int x, a;
int main(){
cin >> x >> a;
cout << (x>=a)*10;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e6 + 3;
int n, m, a[2005];
long long dp[2005][2005];
char s[2005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s + 1;
n = strlen(s + 1);
if (!isdigit(s[n])) {
cout << "0\n";
return 0;
}
int prv = 0;
for (int i = 1; i <= n; i++) {
if (!isdigit(s[i])) {
if (prv) {
a[++m] = 1;
prv = 0;
} else if (s[i] != '*' && s[i] != '/')
++m;
else {
cout << "0\n";
return 0;
}
} else
prv = 1;
}
dp[m + 1][m] = 1;
for (int i = m; i >= 1; i--) {
dp[i][i] = dp[i][i - 1] = 1;
for (int j = i + 1; j <= m; j++) {
dp[i][j] += dp[i + 1 - a[i]][j];
for (int k = i; k <= j; k++) {
if (a[k]) dp[i][j] += dp[i][k - 1] * dp[k + 1][j];
}
dp[i][j] %= mod;
}
}
cout << dp[1][m] << endl;
return 0;
}
| 10 | CPP |
text = input()
if text[0] != text[0].upper() and text[1:] == text[1:].upper():
print (text.title())
elif text == text.upper():
print (text.lower())
else:
print (text)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Point {
double x, y;
Point() { x = y = 0.0; }
Point(double a, double b) : x(a), y(b) {}
Point operator-(const Point &pepe) { return Point(x - pepe.x, y - pepe.y); }
Point operator+(const Point &pepe) { return Point(x + pepe.x, y + pepe.y); }
double operator^(const Point &pepe) { return x * pepe.y - y * pepe.x; }
double operator*(Point pepe) { return x * pepe.x + y * pepe.y; }
};
vector<Point> uno;
vector<Point> dos;
double angle(Point a, Point o, Point b) {
Point oa = a - o;
Point ob = b - o;
return acos((oa * ob) / sqrt((oa * oa) * (ob * ob)));
}
int cross(Point A, Point B, Point C) {
double a = (B - A) ^ (C - A);
if (fabs(a) < 1e-7) return 0;
return (a < 0.0) ? -1 : 1;
}
bool onSegment(Point p1, Point p2, Point q1) {
return (q1.x <= max(p1.x, p2.x) and q1.x >= min(p1.x, p2.x) and
q1.y <= max(p1.y, p2.y) and q1.y >= min(p1.y, p2.y));
}
bool inteserct(Point p1, Point p2, Point q1, Point q2) {
int o1, o2, o3, o4;
o1 = cross(p1, p2, q1);
o2 = cross(p1, p2, q2);
o3 = cross(q1, q2, p1);
o4 = cross(q1, q2, p2);
if (o1 != o2 and o3 != o4) return true;
if (o1 == 0 and onSegment(p1, p2, q1)) return true;
if (o2 == 0 and onSegment(p1, p2, q2)) return true;
if (o3 == 0 and onSegment(q1, q2, p1)) return true;
if (o4 == 0 and onSegment(q1, q2, p2)) return true;
return false;
}
bool inPolygon(Point p, int which) {
double sum = 0.0;
if (which == 1) {
for (int i = 0; i < uno.size() - 1; i++) {
if (cross(p, uno[i], uno[i + 1]) == 1)
sum += angle(uno[i], p, uno[i + 1]);
else
sum -= angle(uno[i], p, uno[i + 1]);
}
return fabs(fabs(sum) - 2 * acos(-1)) < 1e-7;
} else {
for (int i = 0; i < dos.size() - 1; i++) {
if (cross(p, dos[i], dos[i + 1]) == 1)
sum += angle(dos[i], p, dos[i + 1]);
else
sum -= angle(dos[i], p, dos[i + 1]);
}
return fabs(fabs(sum) - 2 * acos(-1)) < 1e-7;
}
}
bool check() {
bool res;
for (int i = 0; i < uno.size() - 1; i++) {
for (int j = 0; j < dos.size() - 1; j++) {
if (inteserct(uno[i], uno[i + 1], dos[j], dos[j + 1])) return true;
}
}
return (inPolygon(uno[0], 2) or inPolygon(dos[0], 1));
}
int main() {
int a, b;
uno.resize(4);
dos.resize(4);
for (int i = 0; i < 4; i++) cin >> uno[i].x >> uno[i].y;
uno.push_back(uno[0]);
for (int i = 0; i < 4; i++) cin >> dos[i].x >> dos[i].y;
dos.push_back(dos[0]);
if (check())
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
mt19937 rnd(time(nullptr));
const long long INF = 1e18;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, m;
cin >> n >> m;
vector<vector<long long>> a(n, vector<long long>(m)),
b(n, vector<long long>(m));
vector<multiset<long long>> st1(n + m), st2(n + m);
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) {
cin >> a[i][j];
st1[i + j].insert(a[i][j]);
}
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) {
cin >> b[i][j];
st2[i + j].insert(b[i][j]);
}
for (long long i = 0; i < n + m; i++)
if (st1[i] != st2[i]) {
cout << "NO";
return 0;
}
cout << "YES";
return 0;
}
| 9 | CPP |
Subsets and Splits