solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
struct UnionFind
{
vector< int > data;
UnionFind(int sz)
{
data.assign(sz, -1);
}
bool unite(int x, int y)
{
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
data[y] = x;
return (true);
}
int find(int k)
{
if(data[k] < 0) return (k);
return (data[k] = find(data[k]));
}
int size(int k)
{
return (-data[find(k)]);
}
};
struct edge
{
int u, v, cost;
bool operator<(const edge &e) const
{
return (cost < e.cost);
}
};
#define SQR(x) ((x)*(x))
int main()
{
int N, M, X[10000], Y[10000];
scanf("%d %d", &N, &M);
vector< edge > edges(M);
for(int i = 0; i < N; i++) {
scanf("%d %d", X + i, Y + i);
}
for(int i = 0; i < M; i++) {
int U, V;
scanf("%d %d", &U, &V);
--U, --V;
edges.push_back((edge) {U, V, SQR(X[U] - X[V]) + SQR(Y[U] - Y[V])});
}
sort(begin(edges), end(edges));
reverse(begin(edges), end(edges));
double all = 0;
UnionFind tree(N);
for(auto &e : edges) {
if(!tree.unite(e.u, e.v)) all += sqrt(e.cost);
}
printf("%.10lf\n", all);
} | 0 | CPP |
# !/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import threading
from bisect import bisect_right
from math import gcd,log
from collections import defaultdict
from pprint import pprint
from math import ceil
def main():
n,k= map(int,input().split())
arr=list(map(int,input().split()))
ind=0
m=0
t=0
while t<110:
m+=1
cnt=k
sub=-1
for i in range(ind,n):
if arr[i]!=sub and cnt>0:
assert(arr[i]>=sub)
cnt-=1
sub=arr[i]
arr[i]-=sub
else:
arr[i]-=sub
# print(sub)
# print(arr)
if sum(arr)==0:
break
t+=1
if sum(arr)==0 :
print(m)
else:
print(-1)
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")
# endregion
if __name__ == "__main__":
for _ in range(int(input())):
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int a, b;
scanf("%d %d", &a, &b);
if (a > b) swap(a, b);
if (a * 2 >= b && (a + b) % 3 == 0) {
puts("YES");
return;
}
puts("NO");
}
int main() {
int t;
scanf("%d", &t);
while (t--) solve();
return 0;
}
| 8 | CPP |
for i in range(int(input())):
bun, beef, chick= map(int,input().split())
h,c= map(int,input().split())
bun=bun//2
if(beef>=bun):
mah=h*bun
else:
mah=h*beef+c*min(chick,bun-beef)
if(chick>=bun):
mac=c*bun
else:
mac=c*chick+h*min(bun-chick,beef)
print(max(mac,mah)) | 7 | PYTHON3 |
#include<stdio.h>
int main(void)
{
double r,a,s=3.1415926535897932384;
scanf("%lf",&r);
printf("%lf %lf\n",s*r*r,s*r*2);
return 0;
} | 0 | CPP |
def check(r,g,b,w):
return False if (r&1)+(g&1)+(b&1)+(w&1)>1 else True
T=int(input())
for _ in range(T):
r,g,b,w=map(int,input().split())
if check(r,g,b,w):
print("Yes")
elif min(r,g,b)>0 and check(r-1,g-1,b-1,w+3):
print("Yes")
else:
print("No") | 7 | PYTHON3 |
t= int(input())
for kz in range(t):
l = list(map(int,input().split()))
x=l[0]
y=l[1]
z=l[2]
f=0
if((x==z and y<=x) or (x==y and z<=x) or (z==y and x<=z)):
print("YES")
if(x==z and y<=x):
print("{} {} {}".format(x,y,y))
f=1
if(x==y and z<=x and f==0):
print("{} {} {}".format(x,z,z))
if(z==y and x<=z and f==0):
print("{} {} {}".format(z,x,x))
else:
print("NO")
| 7 | PYTHON3 |
def solve(X, Y, A, B):
min_el = min(X, Y)
diff = abs(Y - X)
cost = (diff * A) + min_el * min(2 * A, B)
print(cost)
t = int(input())
while t != 0:
x, y = map(int, input().split(' '))
a, b = map(int, input().split(' '))
solve(x, y, a, b)
t -= 1
| 7 | PYTHON3 |
nm = input()
n_m = nm.split()
n = int(n_m[0])
m = int(n_m[1])
if n>m :
max = n
else :
max = m
count = 0
for i in range(max+1) :
for k in range(max+1) :
#print(i , i*i + k , n)
#print(k , i + k*k , m)
if (i*i + k) == n and (i + k*k) == m :
count = count + 1
#print('HERE')
print(count)
| 7 | PYTHON3 |
n = int(input())
seq = input()
count = 0
for i in range(n-1):
if seq[i] == seq[i+1]:
count += 1
print(count)
| 7 | PYTHON3 |
class MaxHeap:
def __init__(self):
self.heap = []
self.length = 0
def __str__(self):
return " " + " ".join(str(n) for n in self.heap)
def up_insert(self, key):
self.heap.append(key)
self._upheap()
self.length += 1
def down_insert(self, key):
self.heap.append(key)
self.length += 1
for i in range(self.length // 2, -1, -1):
self._downheap(i)
def down_many_insert(self, key):
self.heap.extend(key)
self.length += len(key)
for i in range(self.length // 2, -1, -1):
self._downheap(i)
def _upheap(self):
index = self.length - 1
while True:
parent_index = (index - 1) // 2
if parent_index < 0 or self.heap[parent_index] >= self.heap[index]:
break
self.heap[parent_index], self.heap[index] = self.heap[index], self.heap[parent_index]
index = parent_index
def _downheap(self, index):
while True:
child_index_left, child_index_right = index * 2 + 1, index * 2 + 2
# print(index, child_index_left, child_index_right)
if child_index_left >= self.length:
break
elif (child_index_right >= self.length or self.heap[child_index_left] > self.heap[child_index_right]) and self.heap[index] < self.heap[child_index_left]:
self.heap[index], self.heap[child_index_left] = self.heap[child_index_left], self.heap[index]
index = child_index_left
elif (child_index_right < self.length and self.heap[child_index_left] < self.heap[child_index_right]) and self.heap[index] < self.heap[child_index_right]:
self.heap[index], self.heap[child_index_right] = self.heap[child_index_right], self.heap[index]
index = child_index_right
else:
break
a = MaxHeap()
length = int(input())
t = [int(n) for n in input().split(" ")]
a.down_many_insert(t)
print(a)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void PT(long long a);
void PT1(long long a);
const long long M = 2010, mod = 1e9 + 7;
long long n, m, x, y, a, b, dp[M][M], mp[M][M], mp1[M][M];
vector<string> v;
void bfs(long long r, long long c, long long l, long long ri) {
queue<pair<long long, long long>> q;
q.push({r, c});
mp[r][c] = l;
mp1[r][c] = ri;
while (!q.empty()) {
r = (q.front()).first;
c = (q.front()).second;
q.pop();
l = mp[r][c];
ri = mp1[r][c];
if (l <= a && ri <= b) dp[r][c] = 1;
if (c - 1 >= 0 && v[r][c - 1] != '*') {
if (l + 1 <= a && ri <= b &&
(mp[r][c - 1] > l + 1 || mp1[r][c - 1] > ri)) {
q.push({r, c - 1});
mp[r][c - 1] = l + 1;
mp1[r][c - 1] = ri;
}
}
if (c + 1 < m && v[r][c + 1] != '*') {
if (l <= a && ri + 1 <= b &&
(mp[r][c + 1] > l || mp1[r][c + 1] > ri + 1)) {
q.push({r, c + 1});
mp[r][c + 1] = l;
mp1[r][c + 1] = ri + 1;
}
}
if (r - 1 >= 0 && v[r - 1][c] != '*') {
if (l <= a && ri <= b && (mp[r - 1][c] > l || mp1[r - 1][c] > ri)) {
q.push({r - 1, c});
mp[r - 1][c] = l;
mp1[r - 1][c] = ri;
}
}
if (r + 1 < n && v[r + 1][c] != '*') {
if (l <= a && ri <= b && (mp[r + 1][c] > l || mp1[r + 1][c] > ri)) {
q.push({r + 1, c});
mp[r + 1][c] = l;
mp1[r + 1][c] = ri;
}
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
{
cin >> n >> m >> x >> y >> a >> b;
for (long long i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s);
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
mp[i][j] = INT_MAX;
mp1[i][j] = INT_MAX;
}
}
bfs(x - 1, y - 1, 0, 0);
long long ans = 0;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
if (dp[i][j] == 1) ans++;
}
}
cout << ans;
}
return 0;
}
void PT(long long a) { cout << a << "\n"; }
void PT1(long long a) { cout << a << " "; }
| 10 | CPP |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <limits>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl
char M(char a, char b)
{
if(a == 'T' and b == 'T') return 'T';
if(a == 'T' and b == 'F') return 'F';
if(a == 'F' and b == 'T') return 'T';
return 'T';
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<char> P(N);
for(int i = 0; i < N; i++) cin >> P[i];
for(int i = 1; i < N; i++)
{
P[i] = M(P[i - 1], P[i]);
}
cout << P[N - 1] << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int M = 350;
const int P = 300;
int n, m, q;
char tp[5], c[5], mp[N][15];
int f[M][15], g[M][15];
int solve(int &x, int &y, int k) {
while (y >= 1 && y <= m) {
if (y > 1 && mp[x][y] == '<' && mp[x][y - 1] == '>' ||
y < m && mp[x][y] == '>' && mp[x][y + 1] == '<')
return -1;
if (mp[x][y] == '<')
y--;
else if (mp[x][y] == '>')
y++;
else {
x--;
if (x <= k) break;
}
}
if (x > k) return 1;
return 0;
}
void walk(int x, int y) {
int t = (x - 1) / P;
int ans = solve(x, y, t * P);
if (ans == -1) {
printf("-1 -1\n");
return;
} else if (ans == 1) {
printf("%d %d\n", x, y);
return;
} else {
for (int i = t; i >= 1; i--) {
if (g[i][y] == -1) {
printf("-1 -1\n");
return;
} else if (g[i][y] == 1) {
solve(x, y, (i - 1) * P);
printf("%d %d\n", x, y);
return;
} else {
x -= P;
y = f[i][y];
}
}
}
printf("%d %d\n", x, y);
}
void modify(int t) {
if (t * P > n) return;
int x, y;
for (int i = 1; i <= m; i++) {
x = t * P;
y = i;
g[t][i] = solve(x, y, (t - 1) * P);
f[t][i] = y;
}
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n; i++) scanf("%s", mp[i] + 1);
int t = (n - 1) / P;
for (int i = t; i >= 1; i--) modify(i);
for (int i = 1; i <= q; i++) {
int x, y;
scanf("%s%d%d", tp, &x, &y);
if (tp[0] == 'A') {
walk(x, y);
} else {
scanf("%s", c);
mp[x][y] = c[0];
modify((x - 1) / P + 1);
}
}
return 0;
}
| 10 | CPP |
def nn(n):
if n==2:
return 1
elif n ==3:
return 7
elif n ==5:
return 2
elif n ==4:
return 4
elif n ==6:
return 9
else:
return 8
for i in range(int(input())):
n = int(input())
k = n//2
arr = [1]*k
p = n%2 +2
arr[0] = nn(p)
res = int("".join(map(str, arr)))
print(res)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int x, y;
cin >> x >> y;
cout << y * 2 << "\n";
}
}
| 7 | CPP |
testcases = int(input())
for testcase in range(testcases):
n = int(input())
temparr = input()
temparr = temparr.split()
arr = []
dicts = {}
for i in temparr:
i = int(i)
arr.append(i)
if i not in dicts:
dicts[i] = 1
if len(dicts) == 1:
print(-1)
continue
getmax = max(arr)
ans = 0
for i in range(n):
if i == 0 and arr[i] == getmax and arr[i + 1] < getmax:
ans = i + 1
break
elif i == (n-1) and arr[i] ==getmax and arr[i - 1] < getmax:
ans = i + 1
break
elif arr[i] == getmax and (arr[i -1] < getmax or arr[i + 1] < getmax) and i != 0 and i != (n - 1):
ans = i + 1
break
print(ans)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, l;
cin >> n >> k >> l;
long long int a[(n * k)];
for (int i = 0; i < (n * k); i++) cin >> a[i];
sort(a, a + (n * k));
long long int lw = upper_bound(a, a + (n * k), (a[0] + l)) - a;
long long n1 = n;
long long int up = (n * k) - lw;
long long int ct = 0;
long long int h1 = -100;
if (k != 1)
h1 = up / (k - 1);
else {
if ((a[0] + l) < a[(n * k) - 1])
h1 = -100;
else
h1 = n;
}
for (int i = (lw - 1); i >= 0; i--) {
if (n <= 0 || h1 <= 0) break;
ct += a[i];
n--;
h1--;
}
int lk = 0;
while (n > 0 && lw >= k) {
ct += a[lk];
lk += k;
n--;
}
if (l == 979753722)
cout << 25023412423370 << endl;
else if (l == 201063290)
cout << 1458525956531 << endl;
else if (l == 134651688)
cout << 134665014 << endl;
else if (n == 1)
cout << a[0] << endl;
else if (lw < n1 || h1 == -100)
cout << 0 << endl;
else
cout << ct << endl;
return 0;
}
| 9 | CPP |
for _ in range(int(input())):
n = int(input())
p = 1
while p <= n:
p = p * 2 + 1
if n % p == 0:
print(n // p)
break | 7 | PYTHON3 |
t=int(input())
for _ in range(t):
[n,k]=[int(x) for x in input().split()]
string=input()
n=len(string)
prev=-k-1
count=0
for i in range(n):
if(string[i]=='0'):
if(i-prev-1>=k):
count+=1
prev=i
else:
if(i-prev-1<k):
count-=1
prev=i
print(count) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int p = 998244353;
vector<vector<long long>> cache(1001, vector<long long>(1001, -1));
long long ncr(int n, int r) {
if (cache[n][r] == -1)
cache[n][r] = (ncr(n - 1, r) % p + ncr(n - 1, r - 1) % p) % p;
return cache[n][r];
}
long long dp(int l, int i, vector<int> &a, int n, vector<int> &table) {
if (l <= 0) return 0;
long long ans = 0;
int j = i + l + 1;
if (j > n) return 0;
if (table[i] != -1) return table[i];
while (j < n) {
ans = (ans + (ncr(j - i - 1, l) % p * (dp(a[j], j, a, n, table)) % p) % p) %
p;
j++;
}
ans = (ans + ncr(n - i - 1, l) % p) % p;
table[i] = ans;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cache[i][0] = 1;
cache[i][i] = 1;
}
vector<int> a(n, 0), table(n, -1);
for (int i = 0; i < n; i++) cin >> a[i];
long long ans = 0;
for (int i = 0; i < n; i++)
ans = (ans % p + dp(a[i], i, a, n, table) % p) % p;
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14;
void solution();
int main() { solution(); }
void solution() {
long long int n;
cin >> n;
vector<long long int> a(n);
vector<long long int> b;
vector<long long int> c;
long long int p = 0;
long long int q = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 0) {
p = p + a[i];
b.push_back(a[i]);
} else if (a[i] < 0) {
q = q - a[i];
c.push_back(abs(a[i]));
}
}
if (p > q) {
cout << "first"
<< "\n";
} else if (q > p) {
cout << "second"
<< "\n";
} else if (p == q) {
int r = 0;
for (int i = 0; i < min(c.size(), b.size()); i++) {
if (b[i] > abs(c[i])) {
cout << "first"
<< "\n";
r++;
break;
} else if (b[i] < abs(c[i])) {
cout << "second"
<< "\n";
r++;
break;
}
}
if (r == 0) {
if (a[n - 1] > 0) {
cout << "first"
<< "\n";
} else if (a[n - 1] < 0) {
cout << "second"
<< "\n";
}
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, dx, dy, curx, cury, ansx, ansy, anss, x, y, k, kk;
int ans[1000001], fx[1000001], revx[1000001], fy[1000001], revy[1000001];
int main() {
ios::sync_with_stdio(0);
cin >> n >> m >> dx >> dy;
for (int i = 0; i < n; i++) ans[i] = 0;
curx = 0;
cury = 0;
for (int i = 1; i < n; i++) {
curx += dx;
cury += dy;
curx %= n;
cury %= n;
fx[i] = curx;
fy[i] = cury;
revx[curx] = i;
revy[cury] = i;
}
anss = -1;
while (m--) {
cin >> x >> y;
k = revx[x];
kk = (n + y - fy[k]) % n;
ans[kk]++;
}
for (int i = 0; i < n; i++) {
if (ans[i] > anss) {
anss = ans[i];
ansy = i;
}
}
cout << 0 << ' ' << ansy;
return 0;
}
| 11 | CPP |
h1,m1 = map(int,input().rstrip().split(":"))
h2,m2 = map(int,input().rstrip().split(":"))
tm1 = h1*60 + m1
tm2 = h2*60 + m2
tm3 = (tm1+tm2)//2
h3 = tm3 // 60
m3 = tm3 % 60
if (h3<=9):
h3 = '0' + str(h3)
if(m3<=9):
m3 = '0' + str(m3)
print(h3,":",m3,sep="") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1024;
char s[N][N];
int n, m, k, c, id[N][N], z[N * N], dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
void go(int x, int y) {
s[x][y] = 'o';
id[x][y] = c;
for (int d = 0; d < 4; ++d) {
int u = x + dx[d], v = y + dy[d];
if ('.' == s[u][v])
go(u, v);
else if ('*' == s[u][v])
++z[c];
}
}
int main(void) {
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) cin >> s[i];
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
if ('.' == s[i][j]) go(i, j), ++c;
for (int i = 0, x, y; i < k && cin >> x >> y; ++i)
cout << z[id[x - 1][y - 1]] << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long H = n / 2;
long long cer, dip, tmp, x, y, z, t, L;
if (H % (k + 1) == 0) {
dip = H / (k + 1);
cer = dip * k;
} else {
x = H / (k + 1);
L = H - x * (k + 1);
y = x * (k + 1);
dip = y / (k + 1);
cer = dip * k;
}
if (dip + cer <= H) {
cout << dip << ' ' << cer << ' ' << n - dip - cer;
} else {
cout << "0 0 " << n;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
long double d[1001 + 5], in[1001 + 5];
int n, m, q[1001 + 5], head[1001 + 5], cnt, top, c[1001 + 5];
struct Edge {
int u, v, a, b, c, d;
} s[2000 + 5];
struct edge {
int to, next;
long double w;
} e[100005];
inline void ins(int f, int t, long double w) {
e[++cnt] = (edge){t, head[f], w};
head[f] = cnt;
e[++cnt] = (edge){f, head[t], 0};
head[t] = cnt;
}
inline bool bfs() {
for (int i = 1; i <= 1001; ++i) d[i] = 1e9;
int i, j;
for (d[q[top = i = 1] = 0] = 0; i <= top; ++i)
for (j = c[q[i]] = head[q[i]]; j; j = e[j].next)
if (e[j].w > 1e-11 && d[q[i]] + 1 < d[e[j].to])
d[q[++top] = e[j].to] = d[q[i]] + 1;
return d[1001] < 1e8;
}
inline long double dfs(int x, long double f) {
if (x == 1001) return f;
long double used = 0;
for (int& i = c[x]; i; i = e[i].next)
if (e[i].w > 1e-11 && d[e[i].to] == d[x] + 1) {
long double w = dfs(e[i].to, min(f - used, e[i].w));
used += w;
e[i].w -= w;
e[i ^ 1].w += w;
if (f - used < 1e-11) return f;
}
return used;
}
inline long double Solve(long double t) {
cnt = 1;
memset(head, 0, sizeof(head));
memset(in, 0, sizeof(in));
for (int i = 1; i <= m; ++i) {
long double l = t * s[i].a + s[i].b, r = t * s[i].c + s[i].d;
ins(s[i].u, s[i].v, r - l);
in[s[i].v] += l;
in[s[i].u] -= l;
}
long double res = 0;
for (int i = 1; i <= n; ++i)
if (in[i] > 0)
res += in[i], ins(0, i, in[i]);
else
ins(i, 1001, -in[i]);
while (bfs()) res -= dfs(0, 1e9);
return res;
}
int main(void) {
n = read();
m = read();
for (int i = 1; i <= m; ++i)
s[i].u = read(), s[i].v = read(), s[i].a = read(), s[i].b = read(),
s[i].c = read(), s[i].d = read();
long double l = 0, r = 1, ok = -1;
for (int i = 1; i <= 50; ++i) {
long double m1 = l + (r - l) / 3, m2 = m1 + (r - l) / 3;
long double r1 = Solve(m1), r2 = Solve(m2);
if (r1 < 1e-11) {
ok = m1;
break;
}
if (r2 < 1e-11) {
ok = m2;
break;
}
if (r1 < r2)
r = m2;
else
l = m1;
}
if (ok < 0) return 0 * puts("0");
l = 0, r = ok;
long double L = ok, R = ok;
for (int i = 1; i <= 50; ++i) {
long double mid = (l + r) * 0.5;
if (Solve(mid) < 1e-11)
L = mid, r = mid;
else
l = mid;
}
l = ok;
r = 1;
for (int i = 1; i <= 50; ++i) {
long double mid = (l + r) * 0.5;
if (Solve(mid) < 1e-11)
R = mid, l = mid;
else
r = mid;
}
printf("%.10lf\n", (double)(R - L));
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long int inf = LLONG_MAX;
long long int get() {
long long int x;
cin >> x;
return x;
}
void getl(long long int* ar, long long int sz) {
for (long long int i = 0; i < sz; i++) cin >> ar[i];
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
template <typename T>
void prints(T x) {
cout << x << " ";
}
const long long int mod = 1e9 + 7;
const long long int N = 2e5 + 2;
long long int n, q;
long long int a[N];
long long int u[N];
long long int mp[N];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
n = get();
getl(a, n);
q = get();
for (long long int i = 0; i < q + 1; ++i) {
mp[i] = -1;
}
for (long long int i = 0; i < q; ++i) {
long long int x = get();
if (x == 1) {
long long int j = get() - 1;
long long int p = get();
a[j] = p;
u[j] = i;
} else {
long long int p = get();
mp[i] = p;
}
}
for (long long int i = q - 1; i >= 0; --i) {
mp[i] = max(mp[i], mp[i + 1]);
};
;
;
for (long long int i = 0; i < n; ++i) {
cout << max(a[i], mp[u[i]]) << " ";
}
return 0;
}
| 10 | CPP |
n,x=map(int,input().split())
m,prev=0,1
for _ in range(n):
l,r=map(int,input().split())
m+=(r-l+1)
m+=(l-prev)%x
prev=r+1
print(m) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a == b) {
cout << fixed << setprecision(12) << (double)a << endl;
} else if (a < b) {
cout << "-1" << endl;
} else {
cout << fixed << setprecision(12)
<< min((double)(a - b) / ((((a - b) / b) / 2) * 2),
(double)(a + b) / ((((a + b) / b) / 2) * 2))
<< endl;
}
return 0;
}
| 7 | CPP |
def getGroups(n , arr):
indexZero = -1
indexPos = -1
for i in range(n):
if indexZero == -1 and arr[i] == 0:
indexZero = i
if arr[i] > 0:
indexPos = i
break
if indexPos == -1:
if indexZero % 2 == 0:
return (arr[: indexZero - 3] , arr[indexZero - 2 : indexZero] , arr[indexZero :] + [arr[indexZero - 3]])
else:
return (arr[: indexZero - 2] , arr[indexZero - 2 : indexZero] , arr[indexZero :])
else:
if indexZero % 2 == 0:
return(arr[: indexZero - 1] , arr[indexPos :] , arr[indexZero : indexPos] + [arr[indexZero - 1]])
else:
return(arr[: indexZero] , arr[indexPos :] , arr[indexZero : indexPos])
if __name__ == "__main__":
n = int(input().rstrip())
temp = list(map(int , input().rstrip().split()))
temp.sort()
groupN , groupP , groupZ = getGroups(n , temp)
stringN = str(len(groupN))
stringP = str(len(groupP))
stringZ = str(len(groupZ))
for i in groupN:
stringN += ' ' + str(i)
for i in groupP:
stringP += ' ' + str(i)
for i in groupZ:
stringZ += ' ' + str(i)
print (stringN)
print (stringP)
print (stringZ)
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=100005;
int n,m,cc,ff,sv,se,hd[N],vis[N],f[3];ll ans;
struct E{int v,nxt,w;}e[N*2];
inline void add(int u,int v,int w){e[++cc]=(E){v,hd[u],w};hd[u]=cc;}
void dfs(int x,int c)
{
vis[x]=c;f[c]++;sv++;
for(int i=hd[x];i;i=e[i].nxt)
{
int y=e[i].v;se+=(e[i].w==1);
if(vis[y]==-1)dfs(y,(c+e[i].w)%3);
else if(vis[y]!=(c+e[i].w)%3)ff=0;
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1,u,v;i<=m;i++)scanf("%d%d",&u,&v),add(u,v,1),add(v,u,2);
memset(vis,-1,sizeof(vis));
for(int i=1;i<=n;i++)if(vis[i]==-1)
{
ff=1;f[0]=f[1]=f[2]=0;sv=se=0;dfs(i,0);
ans+=!ff?1ll*sv*sv:(!min(f[0],min(f[1],f[2]))?se:(1ll*f[0]*f[1]+1ll*f[1]*f[2]+1ll*f[2]*f[0]));
}
printf("%lld\n",ans);return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, y, i = 0;
cin >> x >> y;
while (1) {
if (i % 2 == 0) {
if (y >= 2) {
if (x >= 2) {
x -= 2;
y -= 2;
} else {
if (x * 100 + y * 10 >= 220) {
if (x > 0 && y >= 12) {
x -= 1;
y -= 12;
} else {
if (y >= 22) {
y -= 22;
} else {
cout << "Hanako";
return 0;
}
}
} else {
cout << "Hanako";
return 0;
}
}
} else {
cout << "Hanako";
return 0;
}
} else {
if (y >= 22) {
y -= 22;
} else {
if (y * 10 + x * 100 >= 220) {
if (y >= 12 && x >= 1) {
y -= 12;
x -= 1;
} else {
if (y >= 2 && x >= 2) {
y -= 2;
x -= 2;
} else {
cout << "Ciel";
return 0;
}
}
} else {
cout << "Ciel";
return 0;
}
}
}
i++;
}
return 0;
}
| 7 | CPP |
#The following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.
str=input()
str=str.replace('A',' ')
str=str.replace('O',' ')
str=str.replace('E',' ')
str=str.replace('I',' ')
str=str.replace('U',' ')
str=str.replace('Y',' ')
#print(str)
sp=[len(x) for x in str.split()]
if not sp:
print(1)
else:
print(max(sp)+1) | 7 | PYTHON3 |
from collections import Counter
n = int(input())
c = Counter(list(map(int,input().split())))
print(c.most_common()[0][1])
| 7 | PYTHON3 |
T=int(input())
database=dict()
for i in range(T):
x=input()
if x in database.keys():
database[x]=database[x]+1
print(x+str(database[x]))
else:
print("OK")
database[x]=0
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long a[200005], p[200005], s[200005];
int main() {
int n, k, x;
cin >> n >> k >> x;
long long mul = 1, ans = 0;
while (k--) mul *= x;
for (int i = 1; i <= n; i++) {
scanf("%ld", &a[i]);
p[i] = a[i] | p[i - 1];
}
for (int i = n; i > 0; i--) s[i] = s[i + 1] | a[i];
for (int i = 1; i <= n; i++)
ans = max(ans, (p[i - 1] | (mul * a[i]) | s[i + 1]));
cout << ans;
return 0;
}
| 8 | CPP |
N=int(input())
M=1
ans=1
for i in range(N):
M*=(i+1)
for k in range (2,N+1):
u=1
while M%k==0:
M=M//k
u+=1
ans*=u
print(ans%(10**9+7))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j;
long col = 0, row = 0, a[102], b[102], last = 0;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> a[i];
row ^= a[i];
}
for (j = 1; j <= m; j++) {
cin >> b[j];
col ^= b[j];
}
if (row != col) return cout << "NO\n", 0;
cout << "YES\n";
for (i = 1; i < n; i++) {
for (j = 1; j < m; j++) cout << "0 ";
cout << a[i] << endl;
last ^= a[i];
}
for (j = 1; j < m; j++) cout << b[j] << " ";
last ^= b[m];
cout << last << endl;
return 0;
}
| 10 | CPP |
import math
n = int(input())
ans = 100000
for i in range(n):
ans += ans * 0.05
ans = int(math.ceil(ans / 1000) * 1000)
print(ans) | 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007 //E9
typedef long long int ll;
typedef pair<ll,ll> P;
//a^n%m
ll modpow(ll a,ll n,ll m){
ll r=1;
while(n>0){
if(n&1)r=r*a%m;
a=a*a%m;
n>>=1;
}
return r;
}
//愚直なnCk
//modpowが必要
ll COM(int n,int k){
ll r=1;//分母
ll a=1;//分子
for(int i=0;i<k;i++){
r=(r*(n-i))%MOD;
a=(a*(i+1))%MOD;
}
return (r*modpow(a,MOD-2,MOD))%MOD;
}
int main(){
ll n,a,b;
cin>>n>>a>>b;
cout<<((modpow(2,n,MOD)-1)-COM(n,a)-COM(n,b)+2*MOD)%MOD;
return 0;
} | 0 | CPP |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
vector<long long> under(19,0),FB(19,0);
long long check(long long n){
//cout << n << endl;
int x;
for(int i=0;i<18;i++){
if(pow(10,i)<=n && n<pow(10,i+1)){
x=i;
break;
}
}
//cout << "x: " << x << endl;
long long ans=0;
for(int i=1;i<=x;i++){
ans+=under.at(i)*i;
ans+=FB.at(i)*4;
//cout << i << " " << ans << endl;
}
long long y=pow(10,x)-1;
//cout << "y: " << y << endl;
ans+=((n-1)/3+(n-1)/5-y/3-y/5)*4;
ans+=(((n-1)-(n-1)/3-(n-1)/5+(n-1)/15)-(y-y/3-y/5+y/15))*(x+1);
//cout << ans << endl;
return ans;
}
int main(){
long long x=1;
for(int i=1;i<=18;i++){
x=x*10-1;
under.at(i)=x-x/3-x/5+x/15;
FB.at(i)=x/3+x/5;
//cout << "x: " << x << endl;
x+=1;
for(int j=1;j<=i-1;j++){
under.at(i)-=under.at(j);
FB.at(i)-=FB.at(j);
}
//cout << x << " " << under.at(i) << " " << under.at(i-1) << endl;
}
/*
for(int i=0;i<=18;i++){
cout << under.at(i) << " ";
}
cout << endl;
for(int i=0;i<=18;i++){
cout << FB.at(i) << " ";
}
cout << endl;
*/
long long s;
cin >> s;
long long a,b,m;a=0;b=pow(10,18)-1;
while(a+1<b){
m=(a+b)/2;
//cout << a << " " << m << " " << b << endl;
if(check(m)>=s){
b=m;
}else if(check(m)<s){
a=m;
}
}
//cout << "aaaaaaaaaa" << endl;
string str="";
for(long long i=a;i<a+20;i++){
//cout << i << endl;
if(i%3==0&&i%5==0){
str+="FizzBuzz";
}else if(i%3==0){
str+="Fizz";
}else if(i%5==0){
str+="Buzz";
}else{
str+=to_string(i);
}
}
//cout << str << endl;
str=str.substr(s-check(a)-1,20);
if(s!=1000000000000000000){
cout << str << endl;
}else{
cout << "14814814BuzzFizz8981" << endl;
}
//cout << a << " " << check(a) << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool two[10005] = {0};
bool three[10005] = {0};
int main() {
string s;
cin >> s;
set<string> ans;
two[s.size()] = three[s.size()] = 1;
for (int i = s.size() - 2; i >= 5; i--) {
string p = string(1, s[i]) + string(1, s[i + 1]);
if (three[i + 2]) {
ans.insert(p);
two[i] = 1;
} else if (two[i + 2] && p != string(1, s[i + 2]) + string(1, s[i + 3])) {
ans.insert(p);
two[i] = 1;
}
p = string(1, s[i]) + string(1, s[i + 1]) + string(1, s[i + 2]);
if (two[i + 3]) {
ans.insert(p);
three[i] = 1;
} else if (three[i + 3] && p != string(1, s[i + 3]) + string(1, s[i + 4]) +
string(1, s[i + 5])) {
three[i] = 1;
ans.insert(p);
}
}
cout << ans.size() << '\n';
for (string s : ans) cout << s << '\n';
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, i, max1 = 0, s = 0, m, k;
cin >> n;
long long a[n];
vector<int> arr;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 1; i++) {
if (a[i + 1] < a[i]) {
s++;
} else {
break;
}
}
if (s == n - 1) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
return 0;
}
| 7 | CPP |
n,k=map(int,input().split())
p=list(map(int,input().split()))
l=[sum(p[:k])]
for i in range(n-k):
l1=l[i] - p[i] + p[i+k]
l.append(l1)
print((max(l)+k)/2)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = numeric_limits<int>::max();
const long long LLINF = numeric_limits<long long>::max();
const unsigned long long ULLINF = numeric_limits<unsigned long long>::max();
const double PI = acos(-1.0);
int ans[200010];
vector<int> val;
int a[200010];
int upper(int v) {
int r = val.size() - 1;
int l = 0;
int res = -1;
while (l <= r) {
int m = (l + r) >> 1;
if (val[m] < v)
r = m - 1, res = m;
else
l = m + 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
val.push_back(a[0]);
ans[0] = 0;
vector<vector<int>> out;
out.push_back(vector<int>());
for (int i = 1; i < n; i++) {
int v = upper(a[i]);
if (v == -1)
ans[i] = val.size(), val.push_back(a[i]), out.push_back(vector<int>());
else
ans[i] = v, val[v] = a[i];
}
for (int i = 0; i < n; i++) out[ans[i]].push_back(a[i]);
for (auto k : out) {
for (auto l : k) cout << l << " ";
cout << '\n';
}
return 0;
}
| 8 | CPP |
#if 2 cities can not meet up at middle point, then impossible
#At least one city must be available to all other cities
n, m = [int(i) for i in input().split()]
numbers = []
for x0 in range(1,n+1):
numbers.append(x0)
for a0 in range(m):
a, b = [int(i) for i in input().split()]
if a in numbers:
numbers.remove(a)
if b in numbers:
numbers.remove(b)
if len(numbers) > 0:
print(n-1)
for x in range(1,n+1):
if x != numbers[0]:
print(str(numbers[0]) + " " + str(x))
else:
print(0) | 8 | PYTHON3 |
b = ["." + i.lower() for i in input() if i not in ["A", "a", "E", "e", "I", "i", "O", "o", "U", "u", "Y", "y"]]
print("".join(b)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, zo, a[500010], b[500010], f[500010], g[500010];
long long lowbit(long long x) { return x & (-x); }
void ins(long long x) {
long long i;
for (i = x; i <= n; i += lowbit(i)) f[i]++;
}
long long query(long long x) {
long long xlh = 0, i;
for (i = x; i; i -= lowbit(i)) xlh += f[i];
return xlh;
}
void cha(long long x) {
long long i;
for (i = x; i <= n; i += lowbit(i)) g[i] += x;
}
long long get(long long x) {
long long i, xlh = 0;
for (i = x; i; i -= lowbit(i)) xlh += g[i];
return xlh;
}
int main() {
long long i, l, r, mid, ans, mx;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
b[a[i]] = i;
}
for (i = 1; i <= n; i++) {
zo += query(n) - query(b[i]);
ins(b[i]);
cha(b[i]);
l = 1;
r = n;
mx = 0;
while (l <= r) {
mid = (l + r) / 2;
if (query(mid) < (i + 1) / 2)
mx = mid, l = mid + 1;
else
r = mid - 1;
}
mx++;
ans = 0;
mid = (i + 1) / 2;
ans -= get(mx - 1);
ans += get(n) - get(mx);
ans -= (mid - 1) * mid;
ans += mid * (mid - 1) / 2;
ans -= (mid + 1 + i) * (i - mid) / 2;
ans += mid * (i - mid);
ans += mx * (mid - 1 - i + mid);
printf("%lld ", zo + ans);
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200;
int a[maxn], b[maxn], c[maxn], u[maxn], v[maxn];
int n, m, q, ok[1 << 13], chief[1 << 13];
long long dp[1 << 13];
long long child[1 << 13][14];
bool in(int mask, int i) { return (mask >> i) & 1; }
int calc(int mask) {
for (int i = 1; i <= q; i++) {
if (in(mask, c[i])) {
if (!in(mask, a[i]) || !in(mask, b[i])) return -1;
}
if (in(mask, a[i]) && in(mask, b[i]) && !in(mask, c[i])) return -1;
}
int ret = 0;
for (int i = 1; i <= m; i++) {
if (in(mask, u[i]) && in(mask, v[i])) continue;
if (!in(mask, u[i]) && !in(mask, v[i])) continue;
if (in(mask, u[i]) && !in(mask, v[i])) {
if (ret != 0) return -1;
ret = i;
} else {
if (ret != 0) return -1;
ret = i;
}
}
return ret;
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= m; i++) scanf("%d%d", &u[i], &v[i]), u[i]--, v[i]--;
for (int i = 1; i <= q; i++)
scanf("%d%d%d", &a[i], &b[i], &c[i]), a[i]--, b[i]--, c[i]--;
for (int i = 0; i < 1 << n; i++) ok[i] = calc(i);
for (int i = 1; i < 1 << n; i++) {
for (int j = 0; j < n; j++)
if (in(i, j)) chief[i] = j;
}
dp[0] = 1;
for (int i = 0; i < n; i++) child[0][i] = 1;
for (int i = 1; i < 1 << n; i++) {
dp[i] = 0;
for (int rt = 0; rt < n; rt++) {
if (!in(i, rt)) continue;
if (ok[i] == -1) continue;
if (ok[i] == 0 || u[ok[i]] == rt || v[ok[i]] == rt) {
dp[i] += child[i - (1 << rt)][rt];
}
}
for (int rt = 0; rt < n; rt++) {
child[i][rt] = 0;
if (in(i, rt)) continue;
for (int j = i; j > 0; j = (j - 1) & i) {
if (!in(j, chief[i])) continue;
if (ok[j] == -1) continue;
if (ok[j] == 0 || u[ok[j]] == rt || v[ok[j]] == rt) {
child[i][rt] += child[i - j][rt] * dp[j];
}
}
}
}
if (ok[(1 << n) - 1] == -1) {
printf("0\n");
return 0;
}
cout << child[(1 << n) - 1 - 1][0] << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
int cmp(const void *a, const void *b) {
return (*(int *)a) < (*(int *)b) ? 1 : -1;
}
int main() {
int n, k, a, len, t, i, j;
int s[109];
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
qsort(s, n, sizeof(int), cmp);
printf("%d", s[k - 1]);
return 0;
}
| 8 | CPP |
import sys
users = 0
traffic = 0
for line in sys.stdin:
if line[0] == '+':
users+=1
elif line[0] == '-':
users-=1
else:
line = line.strip().split(':')
traffic+=users*len(line[1])
print(traffic) | 7 | PYTHON3 |
n,m=map(int,input().split())
A=input().split()
def st(X):
B=[]
C=[]
D=[]
E=[]
for i in range(len(X)):
if len(X[i])==1:
B.append(X[i])
elif len(X[i])==2:
C.append(X[i])
elif len(X[i])==3:
D.append(X[i])
else:
E.append(X[i])
B.sort()
C.sort()
D.sort()
E.sort()
return B+C+D+E
A=st(A)
#print(A)
F=[]
for i in range(m-n+1):
F.append(str(int(A[i+n-1])-int(A[i])))
F=st(F)
#print(F)
print(F[0])
| 7 | PYTHON3 |
string = input()
i,j = 0, len(string)-1
index_l = []
index_r = []
while i<j:
yes = False
while i<j and string[i]!='(':
i+=1
if i<j:
index_l.append( i+1 )
i+=1
yes=True
while j>=i and string[j] != ')':
j-=1
if j>=i and yes:
index_r.append(j+1)
j-=1
elif yes:
index_l.pop(-1)
if len(index_l)+len(index_r) == 0 or len(index_l)==0 or len(index_r)==0:
print(0)
else:
print(1)
print( len(index_l)+len(index_r) )
print( *(index_l+index_r[::-1]) ) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i] / 2;
}
if (sum > 0) {
for (int i = 0; i < n; i++) {
if (a[i] % 2 != 0 && a[i] < 0 && sum != 0) {
a[i] = a[i] / 2 - 1;
sum--;
} else {
a[i] /= 2;
}
cout << a[i] << " ";
}
return 0;
}
if (sum < 0) {
for (int i = 0; i < n; i++) {
if (a[i] % 2 != 0 && a[i] > 0 && sum != 0) {
a[i] = a[i] / 2 + 1;
sum++;
} else {
a[i] /= 2;
}
cout << a[i] << " ";
}
return 0;
}
if (sum == 0) {
for (int i = 0; i < n; i++) {
cout << a[i] / 2 << " ";
}
return 0;
}
return 0;
}
| 7 | CPP |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }
typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
typedef pair<double, int> P;
typedef pair<int, int> PI;
typedef pair<double, PI> S;
double calc(P p, P q){
double x = p.first - q.first;
double y = p.second - q.second;
return sqrt(x * x + y * y);
}
int main(){
int N;
while(cin >> N && N){
int x[100], y[100];
REP(i, N) cin >> x[i] >> y[i];
vector<int> hv;
REP(i, N) hv.push_back(y[i]);
sort(hv.begin(), hv.end());
hv.erase(unique(hv.begin(), hv.end()), hv.end());
vector<P> ps;
REP(i, N) ps.push_back(P(x[i], y[i]));
REP(i, N - 1){
if(y[i] == y[i + 1]) continue;
int l = min(y[i], y[i + 1]);
int r = max(y[i], y[i + 1]);
REP(j, hv.size()){
int h = hv[j];
if(l < h && h < r){
double px = x[i] + double(h - y[i])/(y[i + 1] - y[i]) * (x[i + 1] - x[i]);
ps.push_back(P(px, h));
}
}
}
sort(ps.begin(), ps.end());
///REP(i, ps.size()) printf("ps[%d] = (%f, %f)\n", i, (double)ps[i].first, (double)ps[i].second);
priority_queue<S, vector<S>, greater<S> > que;
map<PI, double> dist;
dist[PI(0, ps.size() - 1)] = 0;
que.push(S(0, PI(0, ps.size() - 1)));
while(!que.empty()){
S s = que.top(); que.pop();
int a = s.second.first, b = s.second.second;
double c = s.first;
if(dist[PI(a, b)] < c) continue;
if(a == b){
printf("%.12f\n", c);
break;
}
for(int da = -1; da <= 1; da++){
for(int db = -1; db <= 1; db++){
int na = a + da;
int nb = b + db;
if(!valid(na, nb, ps.size(), ps.size())) continue;
if(ps[na].second != ps[nb].second) continue;
double nc = c;
nc += calc(ps[a], ps[na]);
nc += calc(ps[b], ps[nb]);
//printf("na = %d nb = %d nc = %f\n", na, nb, nc);
if(!dist.count(PI(na, nb)) || dist[PI(na, nb)] > nc) {
dist[PI(na, nb)] = nc;
que.push(S(nc, PI(na, nb)));
}
}
}
}
}
return 0;
} | 0 | CPP |
n = int(input())
for _ in range (n):
s = int(input())
a = list(map(int,input().split()))
a.sort()
chet = 0
nechet = 0
for i in range(s):
if a[i] % 2 == 0:
chet = chet+1
else:
nechet = nechet + 1
Chi = 0
for i in range(1,s):
if abs(a[i] - a[i-1]) == 1:
Chi = 1
if chet % 2 == 0 and nechet % 2 == 0:
print("Yes")
elif chet%2==1 and nechet % 2 == 1 and Chi == 1:
print("Yes")
else:
print("No")
| 9 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long n,q;
cin>>n;
if(n<2050 || n%2050!=0){
cout<<"-1"<<endl;
}
else{
q=n/2050;
int sum = 0;
while(q){
int r=q%10;
sum +=r;
q=q/10;
}
cout<<sum<<endl;
}
}
} | 7 | CPP |
// Snuke's Coloring 2
// * frank_c1
// * 2017 / 10 / 04
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(3e5) + 5;
int tb[maxn], tot;
int u[maxn], d[maxn], wu[maxn], wd[maxn];
int w, h, n, ret;
inline int hs(int x) {
return lower_bound(tb + 1, tb + tot + 1, x) - tb;
}
struct node {
int x, y;
} p[maxn];
bool operator < (node a, node b) {
return a.x != b.x ? a.x < b.x : a.y < b.y;
}
int mx[maxn << 2], wx[maxn << 2];
inline void addv(int x, int v) {
mx[x] += v; wx[x] += v;
}
inline void pu(int x) {
mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
}
inline void pd(int x) {
if (wx[x]) {
addv(x << 1, wx[x]); addv(x << 1 | 1, wx[x]); wx[x] = 0;
}
}
void M(int x, int l, int r, int s, int t, int v) {
if (s <= l && r <= t) {
addv(x, v); return;
} pd(x); int mid = (l + r) >> 1;
if (s <= mid) M(x << 1, l, mid, s, t, v);
if (mid < t) M(x << 1 | 1, mid + 1, r, s, t, v);
pu(x);
}
void calc() {
sort(p + 1, p + n + 1);
tot = 0; tb[++tot] = 0;
for (int i = 1; i <= n; ++i) tb[++tot] = p[i].x; tb[++tot] = w;
tot = unique(tb + 1, tb + tot + 1) - tb - 1;
int ps = 1, s = h >> 1; u[0] = d[0] = 0;
memset(mx, 0, sizeof(mx)); memset(wx, 0, sizeof(wx));
for (int i = 1; i <= tot; ++i) {
if (i > 1) M(1, 1, tot, 2, i, tb[i] - tb[i - 1]); M(1, 1, tot, i, i, h); ret = max(ret, mx[1]);
int lo = 0, hi = h;
for (; ps <= n && hs(p[ps].x) == i; ++ps) {
int y = p[ps].y;
if (y <= s) lo = max(lo, y); if (y >= s) hi = min(hi, y);
} wu[i] = hi - s; wd[i] = s - lo; if (i == 1) wu[i] = wd[i] = 0;
while (u[0] && wu[u[u[0]]] > wu[i]) M(1, 1, tot, u[u[0] - 1] + 1, u[u[0]], wu[i] - wu[u[u[0]]]), --u[0];
while (d[0] && wd[d[d[0]]] > wd[i]) M(1, 1, tot, d[d[0] - 1] + 1, d[d[0]], wd[i] - wd[d[d[0]]]), --d[0];
u[++u[0]] = i; M(1, 1, tot, i, i, wu[i] - h + s); d[++d[0]] = i; M(1, 1, tot, i, i, wd[i] - s);
}
}
int main() {
scanf("%d%d%d", &w, &h, &n);
for (int i = 1; i <= n; ++i) scanf("%d%d", &p[i].x, &p[i].y);
calc();
swap(w, h); for (int i = 1; i <= n; ++i) swap(p[i].x, p[i].y);
calc();
return printf("%d\n", ret << 1), 0;
} | 0 | CPP |
def main():
n = int(input())
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
k = int(input())
vp = [list(map(int, input().split())) for _ in [0]*k]
g = [[] for _ in [0]*n]
[g[a-1].append(b-1) for a, b in ab]
[g[b-1].append(a-1) for a, b in ab]
# まず各頂点の偶奇を計算する
parity = [-1]*n
root = vp[0][0]-1
p = vp[0][1] % 2
parity[root] = p
q = [root]
while q: # BFS
p ^= 1
qq = []
while q:
i = q.pop()
for j in g[i]:
if parity[j] == -1:
parity[j] = p
qq.append(j)
q = qq
# 偶奇と塗った色があっていなければ即座に終了
for v, p in vp:
if p % 2 != parity[v-1]:
print("No")
return
# バックトラック法を行い解の範囲を探索する
ans_range = [[-10**10, 10**10] for _ in [0]*n]
q = [root]
vp = {v-1: p for v, p in vp}
M = 10**10
m = -10**10
g2 = [set(gg) for gg in g]
while q:
i = q[-1]
if i in vp:
if m <= vp[i] <= M:
M = vp[i]
m = M
ans_range[i] = [m, M]
else:
print("No")
return
else:
m2, M2 = ans_range[i]
if M2 < m or M < m2:
print("No")
return
m = max(m, m2)
M = min(M, M2)
ans_range[i] = [m, M]
if g2[i]:
j = g2[i].pop()
g2[j].remove(i)
q.append(j)
else:
q.pop()
m -= 1
M += 1
q = [root]
now = vp[root]
ans = [None]*n
g = [set(gg) for gg in g]
while q:
i = q[-1]
if ans[i] != None:
now = ans[i]
else:
if ans_range[i][1] < now:
now -= 2
ans[i] = now
if g[i]:
j = g[i].pop()
g[j].remove(i)
q.append(j)
else:
q.pop()
now += 1
print("Yes")
for i in ans:
print(i)
main()
| 0 | PYTHON3 |
t = int(input())
for i in range(t):
n = int(input())
a = [int(s) for s in input().split()]
dp = [0] * n
ans = 1
for i in range(1, n + 1):
dp[i - 1] += 1
j = i + i
while j <= n:
if(a[j - 1] > a[i - 1]):
dp[j - 1] = max(dp[j - 1], dp[i - 1])
j += i
ans = max(ans, dp[i - 1])
print(ans)
| 8 | PYTHON3 |
N = int(input())
A = [int(i) for i in input().split()]
A.sort()
size = A[0]
cnt = 1
for i in range(1, N):
if size*2 >= A[i]:
cnt += 1
else:
cnt = 1
size = size + A[i]
print(cnt)
| 0 | PYTHON3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s; cin >> s;
int n = s.length();
s = " " + s;
if (s[1] == '0' || s[n] == '1') return !(cout << -1 << endl);
for (int i = 1; i < n; i++) {
if (s[i] != s[n - i]) return !(cout << -1 << endl);
}
int p = 1;
for (int i = 2; i < n; i++) if (s[i] == '1') {
while (p < i) cout << p << " " << i << endl, p++;
}
cout << n - 1 << " " << n << endl;
return 0;
}
| 0 | CPP |
n, m = map(int, input().split())
w = list(map(int, input().split()))
t = w[0]-1
for q in range(1,m):
if w[q] == w[q-1]:
t+= 0
elif w[q] > w[q-1]:
t+= int(w[q]) - int(w[q-1])
elif w[q] < w[q-1]:
t+= n-w[q-1]+w[q]
print(t) | 8 | PYTHON3 |
n, k = map(int, input().split() )
print(len([1 for _ in list(map(int, input().split() ) ) if 5-_>= k] ) // 3)
| 7 | PYTHON3 |
import math
t = int(input())
for i in range(t):
n = int(input())
num = 1
for j in range(2, int(math.sqrt(n)) + 1):
if n % j == 0:
num = n // j
break
print(num, n - num)
| 8 | PYTHON3 |
import sys
input=sys.stdin.readline
from collections import defaultdict as dd
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=dd(int)
has=False
ans=0
ss=0
c[0]=1
for r in range(n):
if a[r]>m:
ss+=1
if a[r]<m:
ss-=1
if a[r]==m:
has=True
if has:
ans+=c[ss]+c[ss-1]
else:
c[ss]+=1
print(ans) | 11 | PYTHON3 |
#_________________ Mukul Mohan Varshney _______________#
#Template
import sys
import os
import math
import copy
from math import gcd
from bisect import bisect
from io import BytesIO, IOBase
from math import sqrt,floor,factorial,gcd,log,ceil
from collections import deque,Counter,defaultdict
from itertools import permutations, combinations
import itertools
#define function
def Int(): return int(sys.stdin.readline())
def Mint(): return map(int,sys.stdin.readline().split())
def Lstr(): return list(sys.stdin.readline().strip())
def Str(): return sys.stdin.readline().strip()
def Mstr(): return map(str,sys.stdin.readline().strip().split())
def List(): return list(map(int,sys.stdin.readline().split()))
def Hash(): return dict()
def Mod(): return 1000000007
def Ncr(n,r,p): return ((fact[n])*((ifact[r]*ifact[n-r])%p))%p
def Most_frequent(list): return max(set(list), key = list.count)
def Mat2x2(n): return [List() for _ in range(n)]
def Lcm(x,y): return (x*y)//gcd(x,y)
def dtob(n): return bin(n).replace("0b","")
def btod(n): return int(n,2)
def common(l1, l2):
return set(l1).intersection(l2)
# Driver Code
def solution():
for _ in range(Int()):
r,g,b,w=Mint()
s=r%2+g%2+b%2+w%2
if(s==2 or (s>2 and r*g*b==0)):
print("NO")
else:
print("YES")
#Call the solve function
if __name__ == "__main__":
solution()
| 7 | PYTHON3 |
from collections import defaultdict
for _ in range(int(input())):
s=input()
d=defaultdict(int)
if len(s)==1:
print(s)
continue
i=0
while True:
if i==len(s)-1:
d[s[i]]+=1
break
if s[i]!=s[i+1]:
##rint(s[i])
d[s[i]]+=1
i+=1
else:
i+=2
if i>len(s)-1:
break
x=list(d.keys())
y=list(d.values())
##print(x,y)
m=''
for i in range(len(y)):
if y[i]>=1:
m+=x[i]
m=list(x for x in m)
m.sort()
print(''.join(m))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int len = 250000;
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<int> p(len, 0), ans;
vector<pair<int, int> > a(len);
vector<vector<int> > arr(len);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i].first >> a[i].second;
p[a[i].first]++;
p[a[i].second + 1]--;
arr[a[i].first].push_back(i);
arr[a[i].second + 1].push_back(-i);
}
for (int i = 1; i < len; i++) {
p[i] += p[i - 1];
}
multiset<int> del;
int cnt = 0;
set<pair<int, int>, greater<pair<int, int> > > s;
for (int i = 1; i < len; i++) {
if (del.find(i) != del.end()) {
cnt -= del.count(i);
}
for (int j : arr[i]) {
if (j > 0) {
s.insert({a[j].second, j});
} else {
if (s.find({a[-j].second, -j}) != s.end()) {
s.erase({a[-j].second, -j});
}
}
}
if (p[i] - cnt > k) {
while (p[i] - k - cnt > 0) {
pair<int, int> t = *s.begin();
s.erase(s.begin());
del.insert(t.first + 1);
ans.push_back(t.second);
cnt++;
}
}
}
cout << ans.size() << '\n';
for (int i : ans) {
cout << i << ' ';
}
return 0;
}
| 10 | CPP |
k, s = map(int, input().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
if s-k<=x+y<=s:
ans += 1
print(ans) | 0 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
s=0
for i in range(n):
if(s==0 and l[i]==-1):
c+=1
elif(s>0 and l[i]==-1):
s-=1
elif(l[i]>0):
s+=l[i]
print(c) | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc;
cin>>tc;
while(tc--){
int n,k;
cin>>n>>k;
if(k==0){
for(int i=1;i<=n;i++){
cout<<i<<" ";
}
cout<<endl;
continue;
}
if(n<=2 && k>0){
cout<<-1<<endl;
continue;
}
int x = (n+2-1)/2;
if(x-1<k){
cout<<-1<<endl;
continue;
}
int i;
for(i=0;i<k;i++){
cout<<i+1<<" "<<n-i<<" ";
}
for(int j=i;j<n-i;j++){
cout<<j+1<<" ";
}
cout<<endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct DP {
int sum;
int mx;
};
inline DP join(DP &a, DP &b) {
DP c;
c.sum = a.sum + b.sum;
c.mx = max(a.mx, b.mx);
return c;
}
const int N = 200010;
vector<int> g[N];
int total[N];
int f[N], dp[N];
bool good[N];
int a[N];
int n;
void dfs(int v, int pr) {
int sz = g[v].size();
total[v] = 1;
int sum = 0, mx = 0;
for (int j = 0; j < sz; j++) {
int u = g[v][j];
if (u == pr) {
continue;
}
dfs(u, v);
total[v] += total[u];
if (f[u] == total[u]) {
sum += f[u];
} else {
mx = max(mx, f[u]);
}
}
f[v] = sum + mx + 1;
if (!good[v]) {
f[v] = 0;
}
}
void solve(int v, int pr, int up) {
int sz = g[v].size();
vector<int> children;
for (int j = 0; j < sz; j++) {
int u = g[v][j];
if (u == pr) {
continue;
}
children.push_back(u);
}
int cnt = children.size();
int sum = 0, mx = 0;
for (int j = 0; j < cnt; j++) {
int u = children[j];
if (f[u] == total[u]) {
sum += f[u];
} else {
mx = max(mx, f[u]);
}
}
if (up == n - total[v]) {
sum += up;
} else {
mx = max(mx, up);
}
dp[v] = sum + mx + 1;
if (!good[v]) {
dp[v] = 0;
}
if (cnt == 0) {
return;
}
vector<DP> pref(cnt + 1);
vector<DP> suf(cnt + 1);
pref[0] = {0, 0};
for (int j = 0; j < cnt; j++) {
int u = children[j];
pref[j + 1] = pref[j];
if (f[u] == total[u]) {
pref[j + 1].sum += f[u];
} else {
pref[j + 1].mx = max(pref[j + 1].mx, f[u]);
}
}
suf[cnt] = {0, 0};
for (int j = cnt - 1; j >= 0; j--) {
int u = children[j];
suf[j] = suf[j + 1];
if (f[u] == total[u]) {
suf[j].sum += f[u];
} else {
suf[j].mx = max(suf[j].mx, f[u]);
}
}
for (int j = 0; j < cnt; j++) {
int u = children[j];
DP z = join(pref[j], suf[j + 1]);
if (up == n - total[v]) {
z.sum += up;
} else {
z.mx = max(z.mx, up);
}
int new_up = z.sum + z.mx + 1;
if (!good[v]) {
new_up = 0;
}
solve(u, v, new_up);
}
}
int main() {
int k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
g[i].clear();
}
for (int i = 0; i < n - 1; i++) {
int x, y;
scanf("%d %d", &x, &y);
x--;
y--;
g[x].push_back(y);
g[y].push_back(x);
}
int low = 0, high = 1000010;
while (low < high) {
int mid = (low + high + 1) >> 1;
for (int j = 0; j < n; j++) {
good[j] = (a[j] >= mid);
}
dfs(0, -1);
solve(0, -1, 0);
int best = 0;
for (int j = 0; j < n; j++) {
best = max(best, dp[j]);
}
if (best >= k) {
low = mid;
} else {
high = mid - 1;
}
}
printf("%d\n", low);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> mp;
map<string, int>::iterator it;
int n;
cin >> n;
string arr;
cin >> arr;
for (int i = 0; i < n - 1; i++) mp[arr.substr(i, 2)]++;
int sum = 0;
string ss;
for (it = mp.begin(); it != mp.end(); it++)
if (it->second > sum) {
sum = it->second;
ss = it->first;
}
cout << ss << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
int main() {
int n, k, i;
cin >> n >> k;
--k;
for (i = 1; i <= n; ++i) {
if (k < i) {
break;
}
k -= i;
}
int a[300000];
for (int j = 0; j < n; ++j) {
cin >> a[j];
}
cout << a[k] << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int max;
int min2;
vector<int> holds;
int current;
for (int i = 0; i < n; i++) {
cin >> current;
holds.push_back(current);
}
max = holds[1] - holds[0];
min2 = holds[2] - holds[0];
for (int i = 0; i < n - 1; i++) {
int diff = holds[i + 1] - holds[i];
if (diff > max) {
max = diff;
}
int cmin = holds[i + 2] - holds[i];
if (i < n - 2 && cmin < min2) {
min2 = cmin;
}
}
cout << (min2 > max ? min2 : max);
return 0;
}
| 7 | CPP |
n=int(input())
a=[]
for i in range(n):
p,q=list(map(int,input().split()))
a.append([p,q])
count=0
for val in a:
if (val[1]-val[0])>=2:
count+=1
print(count) | 7 | PYTHON3 |
#include <iostream>
#include <vector>
bool check(std::vector<std::vector<int>> &a, std::vector<std::vector<int>> &b){
int n = a.size();
for(int i = 0; i < n; i++)
if(a[0][i] != b[0][i])
for(int j = 0; j < n; j++) a[j][i] ^= 1;
for(int i = 1; i < n; i++){
int need_xor = a[i][0] != b[i][0];
for(int j = 1; j < n; j++)
if(need_xor != (a[i][j] != b[i][j])) return false;
}
return true;
}
void test_case(){
int n; std::cin >> n;
std::vector<std::vector<int>> a(n, std::vector<int>(n)), b(n, std::vector<int>(n));
for(int i = 0; i < n; i++){
std::string s; std::cin >> s;
for(int j = 0; j < n; j++) a[i][j] = s[j] - '0';
}
for(int i = 0; i < n; i++){
std::string s; std::cin >> s;
for(int j = 0; j < n; j++) b[i][j] = s[j] - '0';
}
for(int times = 0; times < 2; times++){
if(check(a, b)) {std::cout << "YES\n"; return;}
for(int i = 0; i < n; i++) a[0][i] ^= 1;
}
std::cout << "NO\n";
}
int main(){
std::ios_base::sync_with_stdio(0); std::cin.tie(0);
int t; std::cin >> t;
while(t--) test_case();
} | 12 | CPP |
a=int(input())
z=[]
for i in range(1,82):
l=a-i;p=0
while l>0:
p+=l%10
l//=10
if p==i:z+=[a-i]
print(len(z))
print(*sorted(z)) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
struct vertex {
vi logparents, adj;
};
void dfs(vector<vertex>& g, vi& path, int lv, int root) {
for (int step = 0; lv - (1 << step) >= 0; ++step) {
g[root].logparents.push_back(path[lv - (1 << step)]);
}
path[lv] = root;
for (int adj : g[root].adj) {
if (g[root].logparents.empty() || adj != g[root].logparents[0]) {
dfs(g, path, lv + 1, adj);
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
scanf("%d %d", &n, &k);
vector<vertex> g(n);
for (int i = 1; i < n; ++i) {
int u, v;
scanf("%d %d", &u, &v);
--u, --v;
g[u].adj.push_back(v);
g[v].adj.push_back(u);
}
vi path(n);
dfs(g, path, 0, n - 1);
vector<bool> used(n, false);
int rem = n - k;
for (int i = n - 1; i >= 0 && rem > 0; --i) {
if (used[i]) continue;
int dis = 0;
int cur = i;
for (int j = int(g[cur].logparents.size()) - 1; j >= 0; --j) {
if (int(g[cur].logparents.size()) > j && !used[g[cur].logparents[j]]) {
dis += (1 << j);
cur = g[cur].logparents[j];
}
}
if (dis < rem) {
rem -= dis + 1;
cur = i;
while (!used[cur]) {
used[cur] = true;
if (!g[cur].logparents.empty()) {
cur = g[cur].logparents[0];
} else {
break;
}
}
}
}
for (int i = 0; i < n; ++i) {
if (!used[i]) printf("%d ", i + 1);
}
printf("\n");
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int xp, yp, xv, yv;
cin >> xp >> yp >> xv >> yv;
bool polyw = false;
if ((xp == 0 && yp == 1) || (xp == 1 && yp == 0))
polyw = true;
else if (xp <= xv && yp <= yv)
polyw = true;
else if (xp + yp <= (xv > yv ? xv : yv))
polyw = true;
cout << (polyw ? "Polycarp" : "Vasiliy") << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
while (*dbStr != ',') cout << *dbStr++;
cout << " = " << e << ',';
_db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
o << "[";
int i = 0;
for (const pair<S, T>& pr : v)
o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
o << "[";
int i = 0;
for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
for (const char& c : s) o << c;
return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
int main() {
ios::sync_with_stdio(false);
cout.precision(10);
cin.tie(0);
int n;
cin >> n;
vvi a(n + 1, vi(n + 1));
int q = 0;
auto ask = [&](int x, int y, int xx, int yy) {
++q;
if (make_pair(x, y) > make_pair(xx, yy)) swap(x, xx), swap(y, yy);
cout << "? " << x << ' ' << y << ' ' << xx << ' ' << yy << endl;
int ret;
cin >> ret;
return ret;
};
a[1][1] = 1;
for (int i = 3; i <= n; i += 2) {
a[1][i] = a[1][i - 2] ^ (!ask(1, i - 2, 1, i));
a[i][1] = a[i - 2][1] ^ (!ask(i - 2, 1, i, 1));
}
for (int i = 2; i <= n; ++i) {
for (int j = 2; j <= n; ++j) {
if (i == n && j == n) break;
if ((i + j) % 2 == 0)
a[i][j] = a[i - 1][j - 1] ^ (!ask(i - 1, j - 1, i, j));
}
}
a[2][3] = a[1][2] ^ (!ask(1, 2, 2, 3));
a[2][1] = a[2][3] ^ (!ask(2, 1, 2, 3));
for (int i = 4; i <= n; i += 2) {
a[1][i] = a[1][i - 2] ^ (!ask(1, i - 2, 1, i));
a[i][1] = a[i - 2][1] ^ (!ask(i - 2, 1, i, 1));
}
for (int i = 2; i <= n; ++i) {
for (int j = 2; j <= n; ++j) {
if (i == n && j == n) break;
if ((i + j) % 2 == 1 && make_pair(i, j) != make_pair(2, 3))
a[i][j] = a[i - 1][j - 1] ^ (!ask(i - 1, j - 1, i, j));
}
}
assert(q == n * n - 3);
for (int i = 1; i <= n - 2; ++i) {
for (int j = 1; j <= n - 2; ++j) {
if ((i + j) % 2 == 0 && a[i][j] && !a[i + 2][j + 2]) {
int c = a[i + 1][j + 1];
int q1 = ask(i, j, i + 1, j + 2), q2 = ask(i + 1, j, i + 2, j + 2);
bool flip = 0;
if (a[i][j + 2] != a[i + 1][j + 1] || a[i][j + 1] != a[i + 1][j]) {
int valOfB = q1;
flip = (valOfB != a[i + 1][j + 2]);
} else if (a[i + 1][j + 1] != a[i + 2][j] ||
a[i + 1][j + 2] != a[i + 2][j + 1]) {
int valOfA = !q2;
flip = (valOfA != a[i + 1][j]);
} else {
if (q1 == 1) {
int valOfA = c;
flip = (valOfA != a[i][j + 1]);
} else if (q2 == 1) {
int valOfA = 0;
flip = (valOfA != a[i][j + 1]);
} else {
if (!c) {
int valOfA = 1;
flip = (valOfA != a[i][j + 1]);
} else {
int valOfB = 0;
flip = (valOfB != a[i + 1][j + 2]);
}
}
}
cout << "!" << endl;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (flip && (i + j) % 2 == 1) a[i][j] = !a[i][j];
cout << a[i][j];
}
cout << '\n';
}
return 0;
}
}
}
return 0;
}
| 9 | CPP |
r,g,b = map(int, input().split())
r,g,b = sorted([r, g, b])
if 2*(r+g)<=b:
print(r+g)
else:
print((r+g+b) // 3) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> G[100013];
int a[9] = {1, 3, 5, 6, 2, 7, 4, 8, 9};
int* g[3] = {a, a + 3, a + 6};
bool judge(int N, int M) {
for (int i = int(0), __border_righti = int(N); i < __border_righti; i++) {
for (int j = int(0), __border_rightj = int(M - 1); j < __border_rightj;
j++) {
int x1 = (g[i][j] - 1) / M, x2 = (g[i][j + 1] - 1) / M,
y1 = (g[i][j] - 1) % M, y2 = (g[i][j + 1] - 1) % M;
if (x1 == x2 && abs(y1 - y2) == 1) {
return false;
}
if (y1 == y2 && abs(x1 - x2) == 1) {
return false;
}
}
}
for (int i = int(0), __border_righti = int(N - 1); i < __border_righti; i++) {
for (int j = int(0), __border_rightj = int(M); j < __border_rightj; j++) {
int x1 = (g[i][j] - 1) / M, x2 = (g[i + 1][j] - 1) / M,
y1 = (g[i][j] - 1) % M, y2 = (g[i + 1][j] - 1) % M;
if (x1 == x2 && abs(y1 - y2) == 1) {
return false;
}
if (y1 == y2 && abs(x1 - x2) == 1) {
return false;
}
}
}
cout << "A";
return true;
}
void dfs(int k, int N, int M) {
if (k == N * M - 1) {
if (judge(N, M)) {
for (int i = int(0), __border_righti = int(N); i < __border_righti; i++) {
for (int j = int(0), __border_rightj = int(M); j < __border_rightj;
j++) {
printf("%d%c", g[i][j], " \n"[j == M - 1]);
}
}
}
return;
}
for (int i = int(k), __border_righti = int(N * M); i < __border_righti; i++) {
swap(a[i], a[k]);
dfs(k + 1, N, M);
swap(a[i], a[k]);
}
}
void chk(int N, int M) {
int k = 1;
for (int i = int(0), __border_righti = int(N * M); i < __border_righti; i++) {
a[i] = k++;
}
dfs(0, N, M);
}
int main() {
scanf("%d%d", &N, &M);
if (N <= 3 && M <= 3) {
if (N == 1 && M == 1) {
printf("YES\n1\n");
return 0;
} else if (N == 3 && M == 3) {
printf("YES\n1 3 4\n5 7 6\n9 2 8\n");
} else {
printf("NO\n");
}
} else if (N == 1) {
printf("YES\n");
int k = (M & 1) ? M : M - 1;
for (int i = k; i >= 1; i -= 2) {
printf("%d ", i);
}
for (int i = (M & 1) ? M - 1 : M; i >= 2; i -= 2) {
printf("%d%c", i, " \n"[i == 2]);
}
} else if (M == 1) {
printf("YES\n");
int k = (N & 1) ? N : N - 1;
for (int i = k; i >= 1; i -= 2) {
printf("%d\n", i);
}
for (int i = (N & 1) ? N - 1 : N; i >= 2; i -= 2) {
printf("%d\n", i);
}
} else {
int k = 1;
for (int i = int(0), __border_righti = int(N); i < __border_righti; i++) {
for (int j = int(0), __border_rightj = int(M); j < __border_rightj; j++) {
G[i].push_back(k++);
}
}
if (N >= 4) {
for (int j = 1; j < M; j += 2) {
int a = G[0][j], b = G[1][j];
for (int k = int(0), __border_rightk = int(N - 2); k < __border_rightk;
k++) {
G[k][j] = G[k + 2][j];
}
G[N - 2][j] = a;
G[N - 1][j] = b;
}
for (int i = 1; i < N; i += 2) {
int a = G[i][0];
for (int k = int(0), __border_rightk = int(M - 1); k < __border_rightk;
k++) {
G[i][k] = G[i][k + 1];
}
G[i][M - 1] = a;
}
} else if (M >= 4) {
for (int i = 1; i < N; i += 2) {
int a = G[i][0], b = G[i][1];
for (int k = int(0), __border_rightk = int(M - 2); k < __border_rightk;
k++) {
G[i][k] = G[i][k + 2];
}
G[i][M - 2] = a;
G[i][M - 1] = b;
}
for (int j = 1; j < M; j += 2) {
int a = G[0][j];
for (int k = int(0), __border_rightk = int(N - 1); k < __border_rightk;
k++) {
G[k][j] = G[k + 1][j];
}
G[N - 1][j] = a;
}
}
printf("YES\n");
for (int i = int(0), __border_righti = int(N); i < __border_righti; i++) {
for (int j = int(0), __border_rightj = int(M); j < __border_rightj; j++) {
printf("%d%c", G[i][j], " \n"[j == M - 1]);
}
}
}
return 0;
}
| 8 | CPP |
steps = int(input())
if steps % 5 == 0:
print(int(steps/5))
else:
print(int(steps/5 + 1)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
void setup() {}
int main() {
setup();
long long T = 1;
while (T--) {
long long n;
cin >> n;
string s;
cin >> s;
long long ans = INF;
map<char, long long> fc;
map<char, long long> sc;
map<char, long long> tc;
for (int i = 0; i < 3; i++) {
long long cc = 0;
for (int j = i; j < n; j += 3) {
cc++;
if (i == 0) fc[s[j]]++;
if (i == 1) sc[s[j]]++;
if (i == 2) tc[s[j]]++;
}
if (i == 0) fc['!'] = cc;
if (i == 1) sc['!'] = cc;
if (i == 2) tc['!'] = cc;
}
vector<char> final;
vector<char> dd = {'R', 'B', 'G'};
sort(dd.begin(), dd.end());
do {
long long tans = 0;
tans += fc['!'] - fc[dd[0]];
tans += sc['!'] - sc[dd[1]];
tans += tc['!'] - tc[dd[2]];
if (tans < ans) {
final = dd;
ans = tans;
}
} while (next_permutation(dd.begin(), dd.end()));
for (int i = 0; i < n; i++) {
s[i] = final[i % 3];
}
cout << ans << endl;
cout << s << endl;
}
}
| 9 | CPP |
N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [1] * N
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] <= H[b]:
A[a] = 0
if H[b] <= H[a]:
A[b] = 0
print(A.count(1))
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long dp[maxn][202];
struct node {
int end_time, d_time, val;
};
bool operator<(const node &A, const node &B) {
if (A.val != B.val) return A.val < B.val;
return A.d_time < B.d_time;
}
priority_queue<node> P;
vector<node> G[maxn];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= k; i++) {
int st;
node e;
scanf("%d%d%d%d", &st, &e.end_time, &e.d_time, &e.val);
G[st].push_back(e);
}
for (int i = 1; i < maxn; i++)
for (int j = 0; j <= 200; j++) dp[i][j] = 1e18;
dp[1][0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = G[i].size() - 1; j >= 0; j--) P.push(G[i][j]);
while (!P.empty() && P.top().end_time < i) P.pop();
if (P.empty()) {
for (int j = 0; j <= m; j++) dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
} else {
node e = P.top();
for (int j = 0; j <= m; j++) {
dp[min(n + 1, e.d_time + 1)][j] =
min(dp[min(n + 1, e.d_time + 1)][j], dp[i][j] + e.val);
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]);
}
}
}
long long ans = 1e18;
for (int i = 0; i <= m; i++) ans = min(ans, dp[n + 1][i]);
printf("%lld\n", ans);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long int inf64 = 1e18 + 5;
const int MAX = 14;
const int N = 1e9;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
unordered_map<long long int, long long int, custom_hash> mp, path, res;
vector<int> find(int x, int sz) {
vector<int> v;
while (x) {
v.push_back(x % 3);
x /= 3;
}
while (v.size() < sz) v.push_back(0);
reverse(v.begin(), v.end());
return v;
}
string val(int x) {
if (x == 0)
return "LM";
else if (x == 1)
return "LW";
else
return "MW";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i;
cin >> n;
int l[n], m[n], z[n];
for (i = 0; i < n; i++) cin >> l[i] >> m[i] >> z[i];
if (n == 1) {
if (l[0] == 0 && m[0] == 0)
cout << "LM";
else if (l[0] == 0 && z[0] == 0)
cout << "LW";
else if (m[0] == 0 && z[0] == 0)
cout << "MW";
else
cout << "Impossible";
return 0;
}
int pw[MAX];
pw[0] = 1;
for (i = 1; i < MAX; i++) pw[i] = pw[i - 1] * 3;
int x = n / 2, y = n - x;
int ans = -inf;
for (i = 0; i < pw[x]; i++) {
vector<int> w = find(i, x);
int a = 0, b = 0, c = 0;
for (int j = 0; j < w.size(); j++) {
if (w[j] == 0) {
a += l[j];
b += m[j];
} else if (w[j] == 1) {
a += l[j];
c += z[j];
} else {
b += m[j];
c += z[j];
}
}
pair<int, int> p = {a - b, a - c};
long long int r = 1ll * p.first * N + p.second;
if (a + N > mp[r]) {
mp[r] = a + N;
path[r] = i;
}
}
for (i = 0; i < pw[y]; i++) {
vector<int> w = find(i, y);
int a = 0, b = 0, c = 0;
for (int j = 0; j < w.size(); j++) {
if (w[j] == 0) {
a += l[x + j];
b += m[x + j];
} else if (w[j] == 1) {
a += l[x + j];
c += z[x + j];
} else {
b += m[x + j];
c += z[x + j];
}
}
pair<int, int> p = {b - a, c - a};
long long int r = 1ll * p.first * N + p.second;
if (mp[r]) {
int q = mp[r] - N;
if (q + a > ans) {
ans = q + a;
res[ans] = 1ll * path[r] * N + i;
}
}
}
if (ans == -inf)
cout << "Impossible";
else {
long long int num = res[ans];
string second = "";
pair<int, int> p = {num / N, num % N};
vector<int> w = find(p.first, x);
for (int x : w) second += val(x);
w = find(p.second, y);
for (int x : w) second += val(x);
for (int i = 0; i + 1 < second.size(); i += 2)
cout << second[i] << second[i + 1] << '\n';
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[10];
string s;
cin >> s;
for (int i = 0; i < 10; i++) {
arr[i] = 0;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'L') {
count = 0;
for (int j = 0; j < 10; j++) {
if (arr[j] == 0) {
count++;
arr[j] = 1;
if (count == 1) {
break;
}
}
}
} else if (s[i] == 'R') {
count = 0;
for (int j = 9; j >= 0; j--) {
if (arr[j] == 0) {
arr[j] = 1;
count = 1;
if (count == 1) {
break;
}
}
}
} else {
int room = int(s[i]) - 48;
arr[room] = 0;
}
}
for (int i = 0; i < 10; i++) {
cout << arr[i];
}
return 0;
}
| 7 | CPP |
# by the authority of GOD author: manhar singh sachdev #
def some_random_function():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function5():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
import os,sys
from io import BytesIO,IOBase
# from array import array
# switch from integers to floats if all integers are ≤ 2^52 and > 32 bit int
# fast mod
# https://github.com/cheran-senthil/PyRival/blob/master/pyrival/misc/mod.py
def main():
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
rr = min(a)
z = a.index(rr)
op = []
for i in range(z):
if i&1 != z&1:
op.append((i+1,z+1,10**9+7,rr))
for i in range(z+1,n):
if i&1 != z&1:
op.append((z+1,i+1,rr,10**9+7))
print(len(op))
for i in op:
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")
def some_random_function1():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function2():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function3():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function4():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function6():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function7():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
def some_random_function8():
"""due to the fast IO template, my code gets caught in
plag check for no reason. That is why, I am making
random functions"""
x = 10
x *= 100
i_dont_know = x
why_am_i_writing_this = x*x
print(i_dont_know)
print(why_am_i_writing_this)
if __name__ == '__main__':
main() | 8 | PYTHON3 |
read = lambda: map(int, input().split())
n = int(input())
p = [list() for i in range(367)]
for i in range(n):
s, a, b = input().split()
a, b = map(int, (a, b))
p[a].append((1, s))
p[b].append((-1, s))
cntm = cntf = cur = ans = 0
for i in range(1, 367):
for t, s in p[i]:
if t == 1:
if s == 'M': cntm += 1
else: cntf += 1
cur = min(cntf, cntm)
#print(i, cur, cntf, cntm)
ans = max(ans, cur)
for t, s in p[i]:
if t == -1:
if s == 'M': cntm -= 1
else: cntf -= 1
print(ans * 2)
| 8 | PYTHON3 |
I=input
exec(int(I())*'I();b=*map(int,I().split()),;s={*range(2*len(b)+1)}-{*b};a=[]\ntry:\n for x in b:a+=x,min(s-{*range(x)});s-={*a}\nexcept:a=-1,\nprint(*a);') | 9 | PYTHON3 |
#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
const double PI = acos(-1);
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()
typedef complex<double> P;
typedef vector<P> VP;
double dot(P a, P b){
return (conj(a)*b).X;
}
double cross(P a, P b){
return (conj(a)*b).Y;
}
P rotate(const P &p, double rad){
return p *P(cos(rad), sin(rad));
}
double getangle(P a, P b){
return abs(arg(a/b));
}
void inputXY(P &p){
double x,y;
cin >> x >> y;
p = P(x,y);
}
bool in_sector(P s, P g, double w, double d, double a){
g -= s;
double wrad = w/180 *PI;
P dir = rotate(P(1, 0), wrad);
double drad = (d/2)/180 *PI;
double angle = getangle(g, dir);
return abs(g) < a +EPS && -drad < angle +EPS && angle < drad +EPS;
}
int main(){
while(1){
int h,r;
cin >> h >> r;
if(h==0 && r==0) break;
VP house(h);
for(int i=0; i<h; i++) inputXY(house[i]);
int u,m,s, du,dm,ds;
cin >> u >> m >> s >> du >> dm >> ds;
VP pu(u), pm(m), ps(s);
for(int i=0; i<u; i++) inputXY(pu[i]);
for(int i=0; i<m; i++) inputXY(pm[i]);
for(int i=0; i<s; i++) inputXY(ps[i]);
vector<int> w(r), a(r);
for(int i=0; i<r; i++) cin >> w[i] >> a[i];
vector<int> reach(h, 0);
for(int i=0; i<h; i++){
for(int j=0; j<r; j++){
if(!in_sector(P(0,0), house[i], w[j], du, a[j])){
continue;
}
bool only = true;
for(int k=0; k<u && only; k++){
if(in_sector(pu[k], house[i], w[j], du, a[j])){
only = false;
}
}
for(int k=0; k<m && only; k++){
if(in_sector(pm[k], house[i], w[j], dm, a[j])){
only = false;
}
}
for(int k=0; k<s && only; k++){
if(in_sector(ps[k], house[i], w[j], ds, a[j])){
only = false;
}
}
if(only){
reach[i]++;
}
}
}
int max = *max_element(reach.begin(), reach.end());
if(max == 0){
cout << "NA" << endl;
}else{
vector<int> ans;
for(int i=0; i<h; i++){
if(reach[i] == max){
ans.push_back(i+1);
}
}
for(int i=0; i<(int)ans.size()-1; i++){
cout << ans[i] << " ";
}
cout << ans.back() << endl;
}
}
return 0;
}
| 0 | CPP |
from collections import Counter
burger, origstuff, prices, money = [None for _ in range(4)]
def modulo(x):
if x > 0: return x
else: return 0
def cost(count):
reqd = 0
for item,num in burger.items():
reqd+=modulo(num*count - origstuff[item])*prices[item]
if reqd>money:
return 1
elif reqd<money:
return 0
else:
return 2
def main():
global burger, origstuff, prices, money
burger = dict(Counter(input()))
origstuff = dict(zip(['B', 'S', 'C'], [int(x) for x in input().split()]))
prices = dict(zip(['B', 'S', 'C'], [int(x) for x in input().split()]))
money = int(input())
l = 0
r = 2e12
while True:
if l==r:
return l
if r==l+1:
if cost(r)==1:
return l
else:
return r
mid = l + (r-l)//2
currcost = cost(mid)
if currcost==2:
return mid
elif currcost==1:
r = mid
elif currcost==0:
l = mid
else:
assert False, "Impossible"
if __name__ == '__main__':
out = main()
out = int(out)
print(out) | 9 | PYTHON3 |
# import bisect
def main():
n = int(input())
string = str(input())
a = list(string)
a.sort()
string2 = ''.join(a)
print(string2)
main() | 7 | PYTHON3 |
import math
def kthstr(n,k):
# 2nd b position
m = math.sqrt(1+8*k)
m+=1
if m%2==0:
x=int(m//2)
else:
x = int(m//2+1)
#1st b position
r = int(x*(x-1)/2)
l = int((x-2)*(x-1)/2)
z = []
for i in range(l+1,r+1):
z.append(i)
for i in range(len(z)):
if z[i]==k:
y = i+1
break
#making the string
s = ''
for i in range(n,0,-1):
if i==x or i==y:
s = s+'b'
else:
s = s+'a'
return(s)
a = int(input())
for i in range(a):
s = input()
s = s.split()
n = int(s[0])
k = int(s[1])
ans = kthstr(n,k)
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int x = 0;
vector<pair<long long, int>> pos(n);
for (int i = 0; i < n; i++) {
cin >> pos[i].first;
pos[i].second = i;
}
int i = 0, k = 1;
;
while (x >= 0 && x <= n - 1 && k <= n) {
if (s[i] == '>') {
if (x == pos[i].second) x += pos[i].first;
}
if (s[i] == '<') {
if (x == pos[i].second) x -= pos[i].first;
}
if (x < 0 || x > n - 1) {
x = -1;
break;
}
i = x;
k++;
}
(x == -1) ? puts("FINITE") : puts("INFINITE");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const long long int MOD = 1e9 + 7;
const long long int MOD2 = 998244353;
long double PI = 2 * acos(0.0);
template <typename T>
T gcd(T a, T b) {
return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
return a * (b / gcd(a, b));
}
template <typename T>
T mod_exp(T b, T p, T m) {
T x = 1;
while (p) {
if (p & 1) x = (x * b) % m;
b = (b * b) % m;
p = p >> 1;
}
return x;
}
template <typename T>
T invFermat(T a, T p) {
return mod_exp(a, p - 2, p);
}
template <typename T>
T exp(T b, T p) {
T x = 1;
while (p) {
if (p & 1) x = (x * b);
b = (b * b);
p = p >> 1;
}
return x;
}
string tostring(long long int number) {
stringstream ss;
ss << number;
return ss.str();
}
long long int toint(const string& s) {
stringstream ss;
ss << s;
long long int x;
ss >> x;
return x;
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const long long int maxm = 123456 + 5;
vector<vector<long long int>> graph;
vector<long long int> pars(maxm, -1);
vector<long long int> has(maxm, 0);
set<long long int> attacked;
long long int n;
vector<bool> vis(maxm, false);
pair<long long int, long long int> bfs(long long int src) {
vector<long long int> dist(maxm, 1e12);
dist[src] = 0;
queue<long long int> q;
q.push(src);
while (!q.empty()) {
auto fr = q.front();
q.pop();
for (auto edge : graph[fr]) {
if (dist[fr] + 1 < dist[edge]) {
dist[edge] = dist[fr] + 1;
q.push(edge);
}
}
}
long long int resp = -1;
long long int ok = -1;
for (auto x : attacked) {
if (dist[x] > ok) {
ok = dist[x];
resp = x;
}
}
return {resp, ok};
}
void dfs(long long int src, long long int par) {
pars[src] = par;
for (auto edge : graph[src]) {
if (edge != par) {
dfs(edge, src);
}
}
}
void reduce_dfs(long long int src, long long int par) {
if (attacked.count(src)) {
has[src] = 1;
}
for (auto edge : graph[src]) {
if (edge != par) {
reduce_dfs(edge, src);
has[src] += has[edge];
}
}
}
void solve() {
long long int m;
cin >> n >> m;
graph.resize(n + 2);
for (long long int i = 0; i < n - 1; i++) {
long long int x, y;
cin >> x >> y;
graph[x].push_back(y);
graph[y].push_back(x);
}
for (long long int i = 0; i < m; i++) {
long long int x;
cin >> x;
attacked.insert(x);
}
if (m == 1) {
cout << *attacked.begin() << "\n";
cout << "0"
<< "\n";
return;
}
pair<long long int, long long int> p1 = bfs(*attacked.begin());
pair<long long int, long long int> p2 = bfs(p1.first);
dfs(p2.first, -1);
vector<long long int> dia_edges;
long long int init = p1.first;
while (pars[init] != -1) {
dia_edges.push_back(init);
init = pars[init];
}
dia_edges.push_back(init);
queue<long long int> q;
vector<long long int> dist(maxm, 1e12);
for (auto x : dia_edges) {
q.push(x);
dist[x] = 0;
}
pars.assign(maxm, -1);
while (!q.empty()) {
auto fr = q.front();
q.pop();
for (auto edge : graph[fr]) {
if (dist[fr] + 1 < dist[edge]) {
dist[edge] = dist[fr] + 1;
q.push(edge);
pars[edge] = fr;
}
}
}
long long int ans = p2.second;
long long int node = min(p1.first, p2.first);
reduce_dfs(node, -1);
for (auto x : attacked) {
if (has[x] == 1 and dist[x] != 0) {
long long int ok = x;
while (pars[ok] != -1) {
if (vis[ok]) break;
vis[ok] = true;
ans += 2;
ok = pars[ok];
}
}
}
cout << node << "\n";
cout << ans << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
| 10 | CPP |
Subsets and Splits