solution
stringlengths 52
181k
| difficulty
int64 0
6
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 10;
long long ans;
long long n, k;
long long s[maxn];
long long l[maxn];
long long r[maxn];
long long seg[4 * maxn];
long long lazy[4 * maxn];
vector<long long> bois[maxn];
void in();
void solve();
long long doaz(long long);
long long get(long long, long long, long long, long long, long long);
void upd(long long, long long, long long, long long, long long);
void push(long long, long long, long long);
void out();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
in();
solve();
out();
}
void in() {
cin >> n >> k;
for (long long i = 0; i < n; i++) cin >> s[i];
for (long long i = 0; i < k; i++) cin >> l[i] >> r[i];
}
void solve() {
sort(s, s + n);
for (long long i = 0; i < k; i++) {
l[i] = lower_bound(s, s + n, l[i]) - s;
r[i] = upper_bound(s, s + n, r[i]) - s;
bois[l[i]].push_back(i);
bois[r[i]].push_back(i);
}
for (long long i = 0; i < n; i++) {
l[k + i] = i;
r[k + i] = i + 1;
bois[i].push_back(k + i);
}
ans = n * (n - 1) * (n - 2) / 6;
for (long long i = 0; i < n; i++) {
for (auto j : bois[i]) upd(1, 0, n, l[j], r[j]);
ans -= doaz(get(1, 0, n, 0, n) - get(1, 0, n, i, i + 1));
}
}
long long get(long long id, long long l, long long r, long long L,
long long R) {
if (r <= L || R <= l) return 0;
if (L <= l && r <= R) return seg[id];
if (lazy[id]) push(id, l, r);
long long mid = (l + r) >> 1;
return get(id << 1, l, mid, L, R) + get(id << 1 | 1, mid, r, L, R);
}
void upd(long long id, long long l, long long r, long long L, long long R) {
if (r <= L || R <= l) return;
if (L <= l && r <= R) {
seg[id] = r - l - seg[id];
lazy[id] = 1 - lazy[id];
return;
}
if (lazy[id]) push(id, l, r);
long long mid = (l + r) >> 1;
upd(id << 1, l, mid, L, R);
upd(id << 1 | 1, mid, r, L, R);
seg[id] = seg[id << 1] + seg[id << 1 | 1];
}
void push(long long id, long long l, long long r) {
long long mid = (l + r) >> 1;
lazy[id] = 0;
lazy[id << 1] = 1 - lazy[id << 1];
lazy[id << 1 | 1] = 1 - lazy[id << 1 | 1];
seg[id << 1] = mid - l - seg[id << 1];
seg[id << 1 | 1] = r - mid - seg[id << 1 | 1];
}
bool cmp(long long i, long long j) { return s[i] < s[j]; }
long long doaz(long long x) { return x * (x - 1) / 2; }
void out() { cout << ans; }
| 5 |
#include <bits/stdc++.h>
using namespace std;
int a, b[1009], vis[100009 * 20], w;
vector<int> v, mxv;
int main() {
for (int i = 1; i <= 1000000 * 2; i++) vis[i] = 1;
vis[0] = 0, vis[1] = 0;
for (int i = 2; i <= 1000000; i++)
if (vis[i])
if (i * 1ll * i <= 1000000 * 2)
for (int j = i * i; j <= 1000000 * 2; j += i) vis[j] = 0;
cin >> a;
int x = 0;
for (int i = 1; i <= a; i++) {
cin >> b[i];
if (vis[b[i] + 1] == 1 and b[i] != 1) x = b[i];
if (b[i] == 1) w++;
}
for (int i = 0; i < w; i++) v.push_back(1);
if (x > 0 and w > 0) v.push_back(x);
if (v.size() > mxv.size()) mxv = v;
for (int i = 1; i <= a; i++) {
for (int j = 1; j <= a; j++)
if (i != j and vis[b[i] + b[j]] == 1) {
if (2 > mxv.size()) {
mxv.clear();
mxv.push_back(b[i]);
mxv.push_back(b[j]);
}
}
}
if (mxv.size() == 0) mxv.push_back(b[1]);
cout << mxv.size() << endl;
for (int i = 0; i < mxv.size(); i++) cout << mxv[i] << ' ';
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
}
void dfs(vector<bool>& vis, vector<vector<long long> >& adj, long long u) {
vis[u] = true;
for (auto v : adj[u])
if (!vis[v]) dfs(vis, adj, v);
}
int main() {
Fast_IO();
int n_testcases;
cin >> n_testcases;
for (int n_testcase = 1; n_testcase <= n_testcases; n_testcase++) {
long long n;
cin >> n;
string s, t;
cin >> s >> t;
bool imp = false;
vector<vector<long long> > adj(20);
for (long long i = (long long)0; i <= (long long)n - 1; i++) {
if (s[i] > t[i])
imp = true;
else if (s[i] < t[i]) {
adj[s[i] - 'a'].push_back(t[i] - 'a');
adj[t[i] - 'a'].push_back(s[i] - 'a');
}
}
if (imp) {
cout << -1 << '\n';
continue;
}
vector<bool> vis(20, false);
long long cc = 0;
for (long long i = (long long)0; i <= (long long)19; i++)
if (!vis[i]) dfs(vis, adj, i), cc++;
cout << 20 - cc << '\n';
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
long long a[4];
cin >> a[0] >> a[1] >> a[2];
sort(a, a + 3);
if ((a[1] - a[0]) % 2 == 0)
cout << a[1] << endl;
else
cout << a[2] << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
long int n, m;
long int arr[101][101];
int main() {
long int i, j, k, a, b, c;
scanf("%ld %ld", &n, &m);
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
scanf("%ld", &arr[i][j]);
}
}
if (n % 2 == 1) {
cout << n;
} else {
for (i = n / 2; i >= 1; i = i / 2) {
a = 0;
for (j = 1; j <= i; j++) {
for (k = 1; k <= m; k++) {
if (arr[j][k] != arr[2 * i - j + 1][k]) {
a = 1;
break;
}
}
if (a == 1) {
break;
}
}
if (a == 1) {
break;
}
if (i % 2 == 1) {
break;
}
}
if (i == 0) {
cout << 1;
} else if (a == 1) {
cout << 2 * i;
} else if (i % 2 == 1) {
cout << i;
}
}
return 0;
}
| 2 |
#include<iostream>
using namespace std;
int a[1405][1405];
int dp[1405][1405];
//int Maxdp = 0;
int main()
{
int n = 0,m = 0;
cin>>n>>m;
for(int i = 0 ;i < n ;i++ )
{
for(int j = 0 ;j < m ;j++ )
{
cin>>a[i][j];
if(a[i][j] == 1)
{
dp[i][j] = 0;
}
else
{
dp[i][j] = 1;
}
}
}
for(int i = 1 ;i < n ;i++ )
{
for(int j = 1 ;j < m ;j++ )
{
if(a[i][j] == 0)
{
dp[i][j] = min(dp[i - 1][j - 1],min(dp[i - 1][j],dp[i][j - 1])) + 1;
// if(dp[i][j] > Maxdp)
// {
// Maxdp = dp[i][j];
// }
}
}
}
int Maxdp=dp[0][0];
for(int i=0; i<=n; i++) {
for(int j=0; j<=m; j++) {
if(dp[i][j]>Maxdp) {
Maxdp=dp[i][j];
}
}
}
cout<<Maxdp*Maxdp<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int n, m, a[maxn], num[maxn], now[maxn];
bool check1(int x) {
memset(now, 0, sizeof(now));
for (int i = 1; i <= x; i++) now[a[i]]++;
if (x >= m) {
for (int i = 1; i <= n; i++)
if (now[i] < (num[i] + 1) / 2) return 0;
return 1;
} else {
if ((n % 2) && x == m - 1) return (num[a[x + 1]] % 2) && (check1(x + 1));
for (int i = x + 1; n + 1 - i > i; i++)
if (a[i] != a[n + 1 - i]) return 0;
return 1;
}
}
int main() {
scanf("%d", &n);
m = (1 + n) / 2;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), num[a[i]]++;
int cnt = 0;
for (int i = 1; i <= n; i++)
if (num[i] % 2 && ++cnt > 1) {
printf("0\n");
return 0;
}
int l = 0, r = n;
while (r - l > 1) {
int mid = (r + l) / 2;
if (check1(mid))
r = mid;
else
l = mid;
}
long long ans = (long long)(n - r + 1);
for (int i = 1; i <= n; i++) now[i] = num[i];
for (int i = 2; i <= n; i++) {
now[a[i - 1]]--;
if (i <= n + 1 - m && now[a[i - 1]] < (num[a[i - 1]] + 1) / 2) break;
if (i > n + 1 - m && a[i - 1] != a[n + 2 - i]) break;
r = max(r, i);
if (i - 1 <= m && a[i - 1] != a[n + 2 - i]) r = max(r, n + 2 - i);
ans += (long long)(n - r + 1);
}
printf("%I64d\n", ans);
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int K = 1e5 + 5;
int L[N * 4], R[N * 4], S[N * 4], lz[N * 4], n, m, x, y, s[N], k;
void build(int no, int l, int r) {
L[no] = l;
R[no] = r;
int mid = (L[no] + R[no]) >> 1;
if (l == r) return;
build(no << 1, l, mid);
build(no << 1 | 1, mid + 1, r);
}
void up(int no) { S[no] = S[no << 1] + S[no << 1 | 1]; }
void dn(int no) {
if (!lz[no]) return;
if (L[no] == R[no]) return;
lz[no] = 0;
S[no << 1] = R[no << 1] - L[no << 1] + 1 - S[no << 1];
S[no << 1 | 1] = R[no << 1 | 1] - L[no << 1 | 1] + 1 - S[no << 1 | 1];
lz[no << 1] ^= 1;
lz[no << 1 | 1] ^= 1;
up(no);
return;
}
void push(int no, int l, int r) {
dn(no);
if (L[no] == l && R[no] == r) {
S[no] = r - l + 1 - S[no];
lz[no] ^= 1;
return;
}
int mid = (L[no] + R[no]) >> 1;
if (l > mid)
push(no << 1 | 1, l, r);
else if (r <= mid)
push(no << 1, l, r);
else
push(no << 1, l, mid), push(no << 1 | 1, mid + 1, r);
up(no);
}
vector<pair<int, int> > all[N];
int query(int no, int x) {
dn(no);
if (L[no] == R[no]) return S[no];
int mid = (L[no] + R[no]) >> 1;
if (x > mid)
return query(no << 1 | 1, x);
else
return query(no << 1, x);
}
int main(void) {
cin >> n >> k;
for (int i = 1; i <= n; ++i) scanf("%d", &s[i]);
sort(s + 1, s + n + 1);
s[n + 1] = 2e9;
build(1, 1, n);
for (int i = 1; i <= k; ++i) {
scanf("%d%d", &x, &y);
x = lower_bound(s + 1, s + n + 1, x) - s;
y = upper_bound(s + 1, s + n + 1, y) - s - 1;
if (x >= y) continue;
all[x].push_back(make_pair(x, y));
all[y + 1].push_back(make_pair(x, y));
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
if (i != 1) push(1, i - 1, i - 1);
for (auto V : all[i]) push(1, V.first, V.second);
int now = S[1] - query(1, i);
ans = ans + now * 1ll * (now - 1) / 2;
}
ans = n * 1ll * (n - 1) * 1ll * (n - 2) / 6 - ans;
cout << ans;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int N = INT_MAX;
long long INF1 = 1e9 + 5;
long long INF2 = 1e18L + 5;
map<long long, long long> my;
int h[10005];
int main() {
int n, k;
cin >> n >> k;
int chk1 = 0, chk2 = 0;
int a, b, c;
vector<int> v1, v2, v3;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (b == 1 && c == 1) {
v1.push_back(a);
} else if (b == 1 && c == 0) {
v2.push_back(a);
} else if (b == 0 && c == 1) {
v3.push_back(a);
}
chk1 += b;
chk2 += c;
}
if (chk1 < k || chk2 < k) {
cout << -1;
return 0;
}
int n1 = v1.size(), n2 = v2.size(), n3 = v3.size();
int x = min(n2, n3);
sort(v2.begin(), v2.end());
sort(v3.begin(), v3.end());
for (int i = 0; i < x; i++) {
v1.push_back(v2[i] + v3[i]);
}
sort(v1.begin(), v1.end());
long long ans = 0;
for (int i = 0; i < k; i++) {
ans += v1[i];
}
cout << ans;
return 0;
}
| 5 |
#include<bits/stdc++.h>
using namespace std;
int n,s[100000],q,t,c,l,m,r,i,j;
int main(){
cin.sync_with_stdio(false);
for(cin>>n;i<n;cin>>s[i++]);
for(cin>>q;j++<q;){
l=0,r=n,cin>>t;
while(m=(l+r)/2,l<r){
t-s[m]||(l=r,c++);
t<s[m]&&(r=m);
t>s[m]&&(l=m+1);
}
}
cout<<c<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b, c;
cin >> n >> a >> b >> c;
int i, j, k;
long long ans = 4000000000ul;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
for (k = 0; k < 4; k++)
if ((n + i + 2 * j + 3 * k) % 4 == 0)
ans = min(ans, 0ll + 1ll * a * i + 1ll * b * j + 1ll * c * k);
cout << ans;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double d;
scanf("%lf",&d);
printf("%.12f\n",max((int)d+1.,d/sqrt(2.0)*2));
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long n;
cin >> n;
long long one = 0;
long long two = 0;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
if (x == 1)
one++;
else
two++;
}
vector<long long> prime;
vector<bool> is_prime(2 * n + 1, true);
for (long long i = 2; i <= 2 * n + 1; i++) {
if (is_prime[i]) {
prime.push_back(i);
long long k = 2;
while (i * k < 2 * n + 1) {
is_prime[i * k++] = false;
}
}
}
long long t = 0;
long long nextp = 0;
while (one != 0 || two != 0) {
if (two == 0) {
t += 1;
cout << 1 << ' ';
one--;
} else if (one == 0) {
t += 2;
cout << 2 << ' ';
two--;
} else {
if (prime.size() == nextp) {
cout << 1 << ' ';
one--;
continue;
}
if ((prime[nextp] - t) % 2 == 1) {
t += 1;
cout << 1 << ' ';
one--;
if (t == prime[nextp]) nextp++;
} else {
t += 2;
cout << 2 << ' ';
two--;
if (t == prime[nextp]) nextp++;
}
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long add(long long a, long long b) {
a %= 1000000007;
b %= 1000000007;
return (a + b) % 1000000007;
}
long long sub(long long a, long long b) {
a %= 1000000007;
b %= 1000000007;
return (a - b + 1000000007) % 1000000007;
}
long long prod(long long a, long long b) {
a %= 1000000007;
b %= 1000000007;
return (a * b) % 1000000007;
}
long long a[1000005];
unordered_map<long long, long long> mark;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long sm = 0, last = 0;
for (int i = 2; i <= n; i++) {
long long x;
cin >> x;
a[i] = x;
sm += last + x;
last += x;
}
long long val = (n * (n + 1)) / 2;
val -= sm;
if (val % n || val <= 0) {
cout << "-1";
return 0;
}
val /= n;
int i = 2;
a[1] = val;
mark[a[1]]++;
if (a[1] > n) {
cout << "-1";
return 0;
}
while (i <= n) {
a[i] += val;
val = a[i];
if (a[i] > n || a[i] <= 0 || mark[a[i]]) {
cout << "-1";
return 0;
}
mark[a[i]]++;
i++;
}
for (i = 1; i <= n; i++) cout << a[i] << " ";
return 0;
}
| 3 |
#include <cstdio>
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d\n",(a^b^c));
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2>
inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
template <typename T1, typename T2>
inline T1 gmax(T1 &a, T2 b) {
return a = a < b ? b : a;
}
template <typename T1, typename T2>
inline T1 gmin(T1 &a, T2 b) {
return a = a < b ? a : b;
}
const char lf = '\n';
namespace ae86 {
const int bufl = 1 << 15;
char buf[bufl], *s = buf, *t = buf;
inline int fetch() {
if (s == t) {
t = (s = buf) + fread(buf, 1, bufl, stdin);
if (s == t) return EOF;
}
return *s++;
}
inline int ty() {
int a = 0, b = 1, c = fetch();
while (!isdigit(c)) b ^= c == '-', c = fetch();
while (isdigit(c)) a = a * 10 + c - 48, c = fetch();
return b ? a : -a;
}
} // namespace ae86
using ae86::ty;
const int _ = 1000007, __ = _ * 6, inf = 0x3f3f3f3f;
int n, ma, mb, per, pa[_], pb[_];
int ha[__] = {0}, lha = 0, qa[_], qb[_];
inline int hashie(int x) { return lower_bound(ha + 1, ha + lha + 1, x) - ha; }
int tar;
bool ban[__][2] = {0};
int f[__][2];
pair<int, int> fr[__][2];
int main() {
ios::sync_with_stdio(0), cout.tie(nullptr);
n = ty(), ma = ty(), mb = ty(), per = ty();
for (int i = 1; i <= ma; i++)
pa[i] = ty(), ha[++lha] = pa[i] - 1, ha[++lha] = pa[i],
ha[++lha] = pa[i] + 1;
for (int i = 1; i <= mb; i++)
pb[i] = ty(), ha[++lha] = pb[i] - 1, ha[++lha] = pb[i],
ha[++lha] = pb[i] + 1;
ha[++lha] = 0, ha[++lha] = n + 1, sort(ha + 1, ha + lha + 1),
lha = unique(ha + 1, ha + lha + 1) - ha - 1;
for (int i = 1; i <= ma; i++) qa[i] = hashie(pa[i]), ban[qa[i]][0] = 1;
for (int i = 1; i <= mb; i++) qb[i] = hashie(pb[i]), ban[qb[i]][1] = 1;
memset(f, -64, sizeof(f)), f[1][0] = f[1][1] = 0,
fr[1][1] = pair<int, int>(1, 0);
int tar = hashie(n);
for (int i = 2; i <= tar; i++) {
if (f[i - 1][0] >= 0)
gmax(f[i][0], f[i - 1][0] + ha[i] - ha[i - 1]),
fr[i][0] = pair<int, int>(i - 1, 0);
if (f[i - 1][1] >= 0)
gmax(f[i][1], f[i - 1][1] + ha[i] - ha[i - 1]),
fr[i][1] = pair<int, int>(i - 1, 1);
if (ban[i][0]) {
if (f[i][0] - 1 < per)
f[i][0] = -inf;
else
f[i][0] -= per;
}
if (ban[i][1]) {
if (f[i][1] - 1 < per)
f[i][1] = -inf;
else
f[i][1] -= per;
}
int f0 = min(f[i][0], per), f1 = min(f[i][1], per);
if (f0 >= 0 && f0 > f[i][1] && !ban[i][1])
f[i][1] = f0, fr[i][1] = pair<int, int>(i, 0);
if (f1 >= 0 && f1 > f[i][0] && !ban[i][0])
f[i][0] = f1, fr[i][0] = pair<int, int>(i, 1);
}
if (max(f[tar][0], f[tar][1]) < 0) {
cout << "No" << lf;
return 0;
}
cout << "Yes" << lf;
int x = tar, y = 0;
if (f[x][y] < 0) y = 1;
vector<int> switchs;
vector<pair<int, int> > fires;
while (x != 1 || y != 0) {
if (ban[x][y]) fires.emplace_back(ha[x - 1], y);
int nex = fr[x][y].first, ney = fr[x][y].second;
if (nex == x) switchs.emplace_back(ha[x]);
x = nex, y = ney;
}
sort(switchs.begin(), switchs.end()), sort(fires.begin(), fires.end());
for (int i = fires.size() - 1, las = inf; i >= 0; i--)
las = gmin(fires[i].first, las - per);
cout << switchs.size() << lf;
for (auto i : switchs) cout << i << ' ';
cout << lf << fires.size() << lf;
for (auto i : fires) cout << i.first << ' ' << i.second + 1 << lf;
return 0;
}
| 4 |
#include<iostream>
//#include<windows.h>
//#include<errno.h>
#define Iset int i,j,l
#define man 10000
#define cn continue
int pas[101], dt[101][4][4];
using namespace std;
int main() {
int n, k;
Iset;
int ans = 0;
//scanf("%d%d", &n, &k);
cin >> n >> k;
for (i = 0; i < k; i++) {
int a, b;
// scanf("%d%d", &a, &b);
cin >> a >> b;
pas[a] = b;
}
dt[0][0][0] = 1;
for (i = 1; i <= n; i++) {
if (pas[i] == 0) {
for (j = 1; j <= 3; j++) {
for (k = 0; k <= 3; k++) {
for (l = 0; l <= 3; l++) {
if (j == k && l == k) cn;
dt[i][j][k] += dt[i - 1][k][l];
dt[i][j][k] %= man;
}
}
}
}
else {
for (k = 0; k <= 3; k++) {
for (l = 0; l <= 3; l++) {
if (pas[i] == k && l == k)cn;
dt[i][pas[i]][k] += dt[i - 1][k][l];
dt[i][pas[i]][k] %= man;
}
}
}
}
for (i = 1; i <= 3; i++) {
for (j = 1; j <= 3; j++) {
ans += dt[n][i][j];
ans %= man;
}
}
//printf("%d\n", ans);
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
for(int i=1;i<=100000;i++)
{
int c=i*0.08,d=i*0.1;
if(c==a&&d==b)
{
cout<<i<<endl;
return 0;
}
}
cout<<"-1";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int F[100][10];
int P[100][11];
cin >> N;
for(int i=0; i<N; i++){
for(int j=0; j<10; j++){
cin >> F[i][j];
}
}
for(int i=0; i<N; i++){
for(int j=0; j<11; j++){
cin >> P[i][j];
}
}
int result=-1000000000;
for(int i=1; i<(1<<10); i++){
int temp=0;
for(int j=0; j<N; j++){
int c=0;
for(int k=0; k<10; k++){
if(((i&(1<<k))>0)&&(F[j][k]==1)) c++;
}
temp+=P[j][c];
}
result=max(result,temp);
}
cout << result << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int l[200000], r[200000];
int a[200000], b[200000], c[200000];
int d[800000], p[800000];
set<int> se;
map<int, int> ma;
int rev[800000];
int mac = 0;
long long ans = 0;
int ansi, ansj;
pair<int, int> fen[800000];
void fenUpdate(int pos, pair<int, int> val) {
for (; pos < mac; pos |= pos + 1) fen[pos] = max(fen[pos], val);
}
pair<int, int> fenGet(int pos) {
pair<int, int> ret = make_pair(-1, -1);
for (; pos >= 0; pos = (pos & (pos + 1)) - 1) ret = max(ret, fen[pos]);
return ret;
}
struct Ev {
int x;
bool i;
int ind;
Ev(int x, bool i, int ind) : x(x), i(i), ind(ind) {}
Ev() {}
};
Ev e[400000];
int ec = 0;
bool cmp(const Ev &lhs, const Ev &rhs) {
if (lhs.x != rhs.x) return lhs.x < rhs.x;
return lhs.i < rhs.i;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < (int)(n); ++i) scanf("%d%d", l + i, r + i);
for (int i = 0; i < (int)(m); ++i) scanf("%d%d%d", a + i, b + i, c + i);
for (int i = 0; i < (int)(n); ++i) se.insert(l[i]), se.insert(r[i]);
for (int i = 0; i < (int)(m); ++i) se.insert(a[i]), se.insert(b[i]);
for (int x : se) ma[x] = mac, rev[mac++] = x;
for (int i = 0; i < (int)(n); ++i) l[i] = ma[l[i]], r[i] = ma[r[i]];
for (int i = 0; i < (int)(m); ++i) a[i] = ma[a[i]], b[i] = ma[b[i]];
for (int i = 0; i < (int)(mac); ++i) d[i] = -1;
for (int i = 0; i < (int)(n); ++i)
if (r[i] > d[l[i]]) {
d[l[i]] = r[i];
p[l[i]] = i;
}
for (int i = 1; i < mac; ++i)
if (d[i - 1] > d[i]) {
d[i] = d[i - 1];
p[i] = p[i - 1];
}
for (int i = 0; i < (int)(m); ++i)
if (d[a[i]] > a[i]) {
int r = min(b[i], d[a[i]]);
long long cur = (rev[r] - rev[a[i]]) * (long long)c[i];
if (cur > ans) {
ans = cur;
ansi = p[a[i]];
ansj = i;
}
}
for (int i = 0; i < (int)(mac); ++i) d[i] = mac;
for (int i = 0; i < (int)(n); ++i)
if (l[i] < d[r[i]]) {
d[r[i]] = l[i];
p[r[i]] = i;
}
for (int i = mac - 2; i >= 0; --i)
if (d[i + 1] < d[i]) {
d[i] = d[i + 1];
p[i] = p[i + 1];
}
for (int i = 0; i < (int)(m); ++i)
if (d[b[i]] < b[i]) {
int l = max(a[i], d[b[i]]);
long long cur = (rev[b[i]] - rev[l]) * (long long)c[i];
if (cur > ans) {
ans = cur;
ansi = p[b[i]];
ansj = i;
}
}
for (int i = 0; i < (int)(mac); ++i) fen[i] = make_pair(-1, -1);
for (int i = 0; i < (int)(n); ++i) e[ec++] = Ev(l[i], true, i);
for (int i = 0; i < (int)(m); ++i) e[ec++] = Ev(a[i], false, i);
sort(e, e + ec, cmp);
for (Ev ev : e) {
if (ev.i) {
pair<int, int> ret = fenGet(mac - 1 - r[ev.ind]);
if (ret.first != -1) {
long long cur =
(long long)ret.first * (rev[r[ev.ind]] - rev[l[ev.ind]]);
if (cur > ans) {
ans = cur;
ansi = ev.ind;
ansj = ret.second;
}
}
} else {
fenUpdate(mac - 1 - b[ev.ind], make_pair(c[ev.ind], ev.ind));
}
}
cout << ans << endl;
if (ans != 0) cout << ansi + 1 << ' ' << ansj + 1 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int ara[1001][1001];
vector<int> c[1001], r[1001];
int main() {
int n, m, a;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a);
if (a) c[j].push_back(i);
if (a) r[i].push_back(j);
ara[i][j] = a;
}
}
int p, q;
int good = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (ara[i][j] == 0) {
if (c[j].size() > 0) {
p = lower_bound(c[j].begin(), c[j].end(), i) - c[j].begin();
if (p) ++good;
if (c[j].size() > p) ++good;
}
if (r[i].size() > 0) {
q = lower_bound(r[i].begin(), r[i].end(), j) - r[i].begin();
if (q) ++good;
if (r[i].size() > q) ++good;
}
}
}
}
cout << good << endl;
}
| 2 |
#include <iostream>
using namespace std;
int main(){
int n, a,d=0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a % 2 == 0)
if (a % 3 != 0 && a % 5 != 0)
d++;
}
if (d > 0)
cout << "DENIED";
else
cout << "APPROVED";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int dp[56];
int n;
cin >> n;
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = dp[i - 1] + pow(2, i);
}
cout << dp[n];
}
| 3 |
#include<iostream>
#include<cstdio>
using namespace std;
long long s,n;
string st;
int main()
{
cin>>st;n=st.size();
for(int i=0;i<n-1;i++)
{
if(st[i]!=st[i+1])s++;
}
cout<<s;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int maxval = 1e5 + 10;
const int maxans = 310;
int n, m, s, e;
int a[maxn];
int b[maxn];
pair<int, int> posb[maxn];
int leftmost[maxans];
int start[maxval];
int THE_END[maxval];
int findind(int l, int r, int x) {
while (l < r) {
int m = (l + r) / 2;
if (posb[m].second <= x)
l = m + 1;
else
r = m;
}
return l;
}
int main() {
while (scanf("%d %d %d %d", &n, &m, &s, &e) == 4) {
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < m; ++i) scanf("%d", &b[i]);
for (int i = 0; i < m; ++i) posb[i] = make_pair(b[i], i);
sort(posb, posb + m);
fill(start, start + maxval, m);
fill(THE_END, THE_END + maxval, -1);
for (int i = 0; i < m; ++i) {
start[posb[i].first] = min(start[posb[i].first], i);
THE_END[posb[i].first] = max(THE_END[posb[i].first], i);
}
for (int i = 0; i < maxans; ++i) leftmost[i] = m;
leftmost[0] = -1;
int res = 0;
int best = 0;
for (int i = 0; i < n; ++i) {
if (start[a[i]] == m) continue;
int l = start[a[i]];
int z = s - e * (best + 1);
for (int j = best; j >= 0; --j) {
int r = findind(l, THE_END[a[i]] + 1, leftmost[j]);
r = min(r, THE_END[a[i]]);
int t = posb[r].second;
if (t > leftmost[j]) {
if (z >= (i + 1 + t + 1)) res = max(res, j + 1);
if (j + 1 < maxans) {
best = max(best, j + 1);
leftmost[j + 1] = min(leftmost[j + 1], t);
}
}
z += e;
}
}
printf("%d\n", res);
}
return 0;
}
| 3 |
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
long AB, a = 0, ans = 0;
for (int i = 0; i < N; ++i) {
cin >> AB;
a += AB;
}
for (int i = 0; i < M; ++i) {
cin >> AB;
ans += AB * a;
}
cout << ans << endl;
}
| 0 |
#include <iostream>
using namespace std;
int main(){
string s;cin>>s;
cout<<((s.substr(0,4)=="YAKI")?"Yes":"No")<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXD = 31;
int n, a[300005];
long long f[300005][MAXD + 5];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) a[i] /= 100;
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= MAXD; ++j) f[i][j] = 1e18;
f[0][0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= MAXD; ++j) {
if (f[i - 1][j] == 1e18) continue;
if (j >= a[i])
f[i][j - a[i]] = min(f[i][j - a[i]], f[i - 1][j]);
else
f[i][0] = min(f[i][0], f[i - 1][j] + (a[i] - j) * 100);
f[i][min(j + a[i] / 10, MAXD)] =
min(f[i][min(j + a[i] / 10, MAXD)], f[i - 1][j] + a[i] * 100);
}
}
long long ans = 1e18;
for (int i = 0; i <= MAXD; ++i) ans = min(ans, f[n][i]);
printf("%I64d\n", ans);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int cal(int a);
int main() {
int num, a, b;
cin >> num;
b = num % 10;
a = num / 10;
cout << cal(a) * cal(b) << endl;
return 0;
}
int cal(int a) {
if (a == 0) return 2;
if (a == 1) return 7;
if (a == 2) return 2;
if (a == 3) return 3;
if (a == 4) return 3;
if (a == 5) return 4;
if (a == 6) return 2;
if (a == 7) return 5;
if (a == 8) return 1;
if (a == 9) return 2;
}
| 1 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
template <typename T>
inline bool mineq(T& a, T b) {
return (a > b) ? (a = b, 1) : 0;
}
template <typename T>
inline bool maxeq(T& a, T b) {
return (a < b) ? (a = b, 1) : 0;
}
inline void solve(), read();
const string file = "";
int main() {
if (file != "") {
freopen((file + ".in").c_str(), "r", stdin);
freopen((file + ".out").c_str(), "w", stdout);
}
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
read();
solve();
return 0;
}
long long n, m;
vector<vector<long long> > adj;
vector<vector<long long> > can;
vector<long long> d;
inline void solve() {
can.assign(n, vector<long long>(n, 0));
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j < n; j++) {
for (long long k = 0; k < n; k++) {
if (adj[i][k] && adj[k][j]) {
++can[i][j];
++can[j][i];
}
}
}
}
long long ans = 0;
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j < n; j++) {
if (!adj[i][j]) {
continue;
}
for (long long k = 0; k < n; k++) {
if (i == k || j == k) {
continue;
}
long long a1 = can[i][k];
long long a2 = can[k][j];
if (adj[i][k]) {
--a2;
}
if (adj[k][j]) {
--a1;
}
ans += a1 * a2;
if (adj[i][k] && adj[k][j]) {
ans -= d[k] - 2;
}
}
}
}
ans /= 5;
cout << ans << "\n";
}
inline void read() {
cin >> n >> m;
adj.resize(n, vector<long long>(n, 0));
d.assign(n, 0);
for (long long i = 0; i < m; i++) {
long long v, u;
cin >> v >> u;
--v, --u;
adj[v][u] = 1;
adj[u][v] = 1;
++d[v], ++d[u];
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long l, r, mid, ans;
int check(long long x) {
long long sum = 0;
if (k <= x)
sum += (x + (x - k + 1)) * k / 2;
else
sum += (1 + x) * x / 2 + k - x;
long long t = n - k + 1;
if (t <= x)
sum += (x + (x - t + 1)) * t / 2;
else
sum += (1 + x) * x / 2 + t - x;
sum -= x;
if (sum <= m)
return 1;
else
return 0;
}
int main() {
scanf("%lld%lld%lld", &n, &m, &k);
l = 1, r = m;
while (l <= r) {
mid = (l + r) / 2;
if (check(mid)) {
l = mid + 1;
ans = mid;
} else
r = mid - 1;
}
printf("%lld", ans);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long BASE1 = 12345, MOD1 = 998244353, BASE2 = 998244353;
unsigned long long e1[400000], e2[400000];
int n;
struct str {
string s;
unsigned long long h1[200000], h2[200000];
void init() {
cin >> s;
h1[0] = h2[0] = s[0];
for (int i = 1; i < s.length(); i++)
h1[i] = (h1[i - 1] * BASE1 + s[i]) % MOD1,
h2[i] = h2[i - 1] * BASE2 + s[i];
}
pair<unsigned long long, unsigned long long> query(int l, int r) {
unsigned long long ans1 = h1[r];
if (l > 0) ans1 = (ans1 + MOD1 - h1[l - 1] * e1[r - l + 1] % MOD1) % MOD1;
unsigned long long ans2 = h2[r];
if (l > 0) ans2 -= h2[l - 1] * e2[r - l + 1];
return make_pair(ans1, ans2);
}
} t[40];
int sum[40];
vector<int> ed[4000000];
void build_edge(int L, int R) {
for (int i = 0; i <= sum[n]; i++) ed[i].clear();
for (int i = L; i <= R; i++) {
ed[0].push_back((sum[(i)-1] + (0) + 1));
for (int j = 0; j < t[i].s.length(); j++) {
int l = t[i].s.length() - j;
for (int k = L; k <= R; k++) {
if (l == t[k].s.length()) {
if (j == 0 && t[i].s.length() == t[k].s.length()) continue;
if (t[i].query(j, t[i].s.length() - 1) ==
t[k].query(0, t[k].s.length() - 1)) {
ed[(sum[(i)-1] + (j) + 1)].push_back(0);
}
} else if (l < t[k].s.length()) {
if (t[i].query(j, t[i].s.length() - 1) == t[k].query(0, l - 1)) {
ed[(sum[(i)-1] + (j) + 1)].push_back((sum[(k)-1] + (l) + 1));
}
} else {
if (t[i].query(j, j + t[k].s.length() - 1) ==
t[k].query(0, t[k].s.length() - 1)) {
ed[(sum[(i)-1] + (j) + 1)].push_back(
(sum[(i)-1] + (j + t[k].s.length()) + 1));
}
}
}
}
}
}
int in[4000000];
bool ck() {
memset(in, 0, sizeof(in));
for (int i = 0; i <= sum[n]; i++) {
for (int j = 0; j < ed[i].size(); j++) in[ed[i][j]]++;
}
int cnt = 0;
queue<int> q;
for (int i = 0; i <= sum[n]; i++)
if (!in[i]) q.push(i);
while (!q.empty()) {
int u = q.front();
cnt++;
q.pop();
for (int j = 0; j < ed[u].size(); j++) {
in[ed[u][j]]--;
if (!in[ed[u][j]]) q.push(ed[u][j]);
}
}
return cnt == sum[n] + 1;
}
int main() {
e1[0] = 1;
for (int i = 1; i <= 200000; i++) e1[i] = e1[i - 1] * BASE1 % MOD1;
e2[0] = 1;
for (int i = 1; i <= 200000; i++) e2[i] = e2[i - 1] * BASE2;
cin >> n;
for (int i = 1; i <= n; i++) {
t[i].init();
sum[i] = sum[i - 1] + t[i].s.length();
}
int ans = 0;
for (int i = 1, j = 1; i <= n; i++) {
while (j <= i) {
build_edge(j, i);
if (ck())
break;
else
j++;
}
ans += i - j + 1;
}
cout << ans;
}
| 5 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const int N = (int)1e5 + 5;
const int INF = 0x3f3f3f3f;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
int ans = 0;
if (e > f) {
int can = min(a, d);
ans += can * e;
a -= can, d -= can;
ans += min({b, c, d}) * f;
} else {
int can = min({b, c, d});
ans += can * f;
b -= can, c -= can, d -= can;
ans += min(a, d) * e;
}
cout << ans;
}
| 1 |
#include <stdio.h>
#include <cmath>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int a[20];
int n;
bool DFS(int k, int m, double r){
int s=ceil(a[k]*(1-r));
int e=ceil(a[k]*(1+r));
for(int p=((s-1)/m+1)*m;p<e;p+=m)
if(k==n-1)return true;
else if(DFS(k+1,p,r))return true;
return false;
}
int main(){
scanf("%d",&n);
REP(i,n)scanf("%d",&a[i]);
double u=1.0,l=0.0;
REP(i,30){
double m=(u+l)*0.5;
if(DFS(0,1,m))u=m;
else l=m;
}
printf("%.9f\n",u);
return 0;
}
| 0 |
#include <cstdio>
using namespace std;
int main(){
int a,b,c;
int a1=0,a2=0;
while(scanf("%d,%d,%d",&a,&b,&c) == 3){
if(a*a + b*b == c*c){
a1++;
}
if(a == b){
a2++;
}
}
printf("%d\n%d\n",a1,a2);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
auto ___x = []() {
cin.sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}();
long long gcd(long long a, long long b) {
long long t;
if (a < b) swap(a, b);
while (b) {
t = b;
b = a % b;
a = t;
}
return a;
}
int const maxn = INT_MAX;
struct Edge {
int to;
long long w;
Edge() {}
Edge(int _to, int _w) : to(_to), w(_w) {}
};
void solve();
int main() {
solve();
return 0;
}
int a, b, c, d;
int m = 50, n = 50;
vector<vector<char>> g(m, vector<char>(50));
vector<vector<int>> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
bool inline inScalar(int i, int j) {
return 0 <= i && i < m && 0 <= j && j < n;
}
bool canplace(int x, int y, char c) {
for (auto &d : dirs) {
int nx = x + d[0], ny = y + d[1];
if (inScalar(nx, ny) && g[nx][ny] == c) return false;
}
return true;
}
void solve() {
cin >> a >> b >> c >> d;
vector<pair<int, char>> D = {{a, 'A'}, {b, 'B'}, {c, 'C'}, {d, 'D'}};
D[0].first--;
D[1].first--;
g = vector<vector<char>>(m, vector<char>(n, '+'));
priority_queue<pair<int, char>> pq(D.begin(), D.end());
for (int i = 0; i < m / 2; ++i) {
for (int j = 0; j < n; ++j) {
g[i][j] = 'A';
}
}
for (int i = m / 2; i < m; ++i) {
for (int j = 0; j < n; ++j) {
g[i][j] = 'B';
}
}
for (int i = 1; i < m / 2; ++i) {
for (int j = 1; j < n - 1; j += 2) {
for (auto &p : D) {
if (p.first > 0 && p.second != 'A') {
if (canplace(i, j, p.second)) {
g[i][j] = p.second;
p.first--;
break;
}
}
}
}
}
for (int i = m / 2 + 1; i < m; ++i) {
for (int j = 1; j < n - 1; j += 2) {
for (auto &p : D) {
if (p.first > 0 && p.second != 'B') {
if (canplace(i, j, p.second)) {
g[i][j] = p.second;
p.first--;
break;
}
}
}
}
}
cout << m << ' ' << n << endl;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) cout << g[i][j];
cout << endl;
}
}
| 3 |
#include <iostream>
using namespace std;
typedef long long int lli;
int main()
{
lli n, t;
while(cin>>n && n){
t = 0;
while(n/5 > 0){
t += n/5;
n /= 5;
}
cout << t << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const double eps = 1e-6, pi = 3.1415926535;
const int inf = 0x3f3f3f3f, maxn = 1e5 + 10;
int n, M;
int a[maxn];
void init() {}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long cnt = 0;
long long ans[maxn];
long long ans1[maxn];
long long div;
cin >> n >> M;
for (int i = (1); i <= n + 1; ++i) {
if (i != n + 1)
cin >> a[i];
else
a[i] = M;
if (i % 2) {
ans[i] = a[i] - a[i - 1];
cnt += ans[i];
if (i > 2) ans[i] += ans[i - 2];
} else
ans1[i] = a[i] - a[i - 1] + ans1[i - 2];
}
if (n % 2) {
for (int i = (1); i <= n; ++i) {
long long tmp = 0;
if (a[i] - a[i - 1] == 1 && a[i + 1] - a[i] == 1) continue;
if (i % 2) {
tmp = ans[i] - 1 + ans1[n + 1] - ans1[i + 1 - 2];
} else {
tmp = ans[i - 1] + 1 + ans1[n + 1] - ans1[i];
}
cnt = max(cnt, tmp);
}
} else {
for (int i = (1); i <= n; ++i) {
long long tmp = 0;
if (a[i] - a[i - 1] == 1 && a[i + 1] - a[i] == 1) continue;
if (i % 2) {
tmp = ans[i] - 1 + ans1[n] - ans1[i + 1 - 2];
} else {
tmp = ans[i - 1] + 1 + ans1[n] - ans1[i];
}
cnt = max(cnt, tmp);
}
}
cout << cnt << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n], i;
for (i = 0; i < n; i++) cin >> a[i];
int k = *min_element(a, a + n);
for (i = 0; i < n; i++) {
if ((a[i] - k) & 1) {
cout << "NO"
<< "\n";
break;
}
}
if (i == n) cout << "YES\n";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
bool is_prime(int n) {
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p]) {
for (int i = p * p; i <= n; i += p) prime[i] = false;
}
}
return prime[n];
}
long long int bsearch(vector<long long int> v, long long int k) {
long long int lo = 0, hi = v.size() - 1;
long long int mid = (lo + hi) / 2;
while (lo <= hi) {
mid = (lo + hi) / 2;
if (k > v[mid])
lo = mid + 1;
else if (k < v[mid])
hi = mid - 1;
else
return mid;
}
}
void solve() {
long long int n;
cin >> n;
long long int a[n];
long long int z = 0, t = 0;
for (long long int i = 0; i <= n - 1; i++) {
cin >> a[i];
if (a[i] == 0)
z++;
else if (a[i] > 0) {
t += a[i] - 1;
a[i] = 1;
} else {
t += -1 - a[i];
a[i] = -1;
}
}
long long int p = 1;
for (long long int i = 0; i <= n - 1; i++) {
if (a[i] != 0) p *= a[i];
}
if (p == 1)
t += z;
else {
if (z == 0)
t += 2;
else
t += z;
}
cout << t;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
while (t--) solve();
}
| 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
using namespace std;
using lli = long long;
using ld = long double;
using ii = pair<int, int>;
using vi = vector<int>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 5;
int a[N];
set<int> graph[N];
int n, m;
int main() {
cin.tie(0)->sync_with_stdio(0), cout.tie(0);
cin >> n >> m;
for (auto i = (0) - ((0) > (m)); i != m - ((0) > (m));
i += 1 - 2 * ((0) > (m))) {
int u, v;
cin >> u >> v;
graph[u].insert(v);
graph[v].insert(u);
}
iota(a, a + n, 1);
for (auto it = (0) - ((0) > (123)); it != 123 - ((0) > (123));
it += 1 - 2 * ((0) > (123))) {
shuffle(a, a + n, rng);
bool good = 1;
for (auto i = (0) - ((0) > (m)); i != m - ((0) > (m));
i += 1 - 2 * ((0) > (m))) {
int u = a[i], v = a[(i + 1) % n];
if (graph[u].count(v)) {
good = 0;
break;
}
}
if (good) {
for (auto i = (0) - ((0) > (m)); i != m - ((0) > (m));
i += 1 - 2 * ((0) > (m))) {
int u = a[i], v = a[(i + 1) % n];
cout << u << " " << v << '\n';
}
return 0;
}
}
cout << "-1\n";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
bool eq(double a, double b) {
if (fabs(a - b) <= 1e-6)
return true;
else
return false;
}
bool neq(double a, double b) {
if (fabs(a - b) > 1e-6)
return true;
else
return false;
}
bool lt(double a, double b) {
if (a + 1e-6 < b)
return true;
else
return false;
}
bool le(double a, double b) {
if (a < b + 1e-6)
return true;
else
return false;
}
bool gt(double a, double b) {
if (a > b + 1e-6)
return true;
else
return false;
}
bool ge(double a, double b) {
if (a + 1e-6 > b)
return true;
else
return false;
}
struct line {
double a, b, c;
};
double dot(pair<double, double>& u, pair<double, double>& w) {
return u.first * w.first + u.second * w.second;
}
line l2p(pair<double, double>& a, pair<double, double>& b) {
line l;
l.a = b.second - a.second;
l.b = a.first - b.first;
l.c = -(b.second - a.second) * a.first - (a.first - b.first) * a.second;
return l;
}
line lperpend(line l, pair<double, double> a) {
line m;
m.a = -l.b;
m.b = l.a;
m.c = l.b * a.first - l.a * a.second;
return m;
}
pair<double, double> pfoot(line l, pair<double, double> a) {
double z = (l.a * a.first + l.b * a.second + l.c) / (l.a * l.a + l.b * l.b);
pair<double, double> f;
f.first = a.first - l.a * z;
f.second = a.second - l.b * z;
return f;
}
bool inbetween(pair<double, double> c, pair<double, double> a,
pair<double, double> b) {
double dotp = (b.first - a.first) * (c.first - a.first) +
(b.second - a.second) * (c.second - a.second);
if (lt(dotp, 0)) return false;
double dist = (b.first - a.first) * (b.first - a.first) +
(b.second - a.second) * (b.second - a.second);
return dotp <= dist;
}
double d(pair<double, double> a, pair<double, double> b) {
double d1 = b.first - a.first;
double d2 = b.second - a.second;
return sqrt(d1 * d1 + d2 * d2);
}
double dlp(pair<double, double> a, pair<double, double> c,
pair<double, double> b) {
line l = l2p(a, c);
pair<double, double> z = pfoot(l, b);
if (inbetween(z, a, c)) return d(b, z);
return -1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
double dist, r1 = 2e6, r2 = -1;
cin >> n;
pair<double, double> g;
cin >> g.first >> g.second;
vector<pair<double, double> > v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
dist = d(v[i], g);
if (lt(dist, r1)) r1 = dist;
if (gt(dist, r2)) r2 = dist;
}
double k;
for (int i = 0; i < n; i++) {
k = dlp(v[i], v[(i + 1) % n], g);
if (k != -1 && le(k, r1)) r1 = k;
}
cout << setprecision(10) << 3.141592653589793 * (r2 * r2 - r1 * r1) << "\n";
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int n, f[2501][3], a[5001];
int main() {
ios::sync_with_stdio(false);
int i, j;
cin >> n;
for (i = 1; i <= n; ++i) cin >> a[i];
for (j = (n + 1) / 2; j >= 0; --j)
for (i = 0; i <= 2; ++i) f[j][i] = 0x3fffffff;
f[0][0] = f[1][1] = 0;
for (i = 2; i <= n; ++i)
for (j = (i + 1) / 2; j >= 1; --j)
f[j][0] = min(f[j][0], f[j][2]),
f[j][2] = f[j][1] + max(0, a[i] - a[i - 1] + 1),
f[j][1] =
min(f[j - 1][0] + max(0, a[i - 1] - a[i] + 1),
f[j - 1][2] + max(0, min(a[i - 1], a[i - 2] - 1) - a[i] + 1));
for (j = 1; j <= (n + 1) / 2; ++j)
cout << min(f[j][0], min(f[j][1], f[j][2])) << ' ';
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, D, B, ans = 1e9, a[maxn], b[maxn], c[maxn], res1, res2, res;
bool check(int mid) {
int now = mid;
for (int i = 1; i <= n; i++) c[i] = a[i], b[i] = 0;
for (int i = 1; i <= n && now; i++) {
int t = min(now, c[i]);
now -= t;
c[i] -= t;
b[i] += t;
}
int sum;
res1 = 0, res2 = 0;
sum = b[1];
for (int i = 1, lst = 1; i <= (n + 1) / 2; i++) {
while (lst < n && lst + 1 - i * D <= i) sum += b[++lst];
if (sum < B)
b[i + 1] += b[i], b[i] = 0, res1++;
else if (b[i] >= B)
b[i + 1] += b[i] - B, b[i] = B, sum -= B;
else
b[lst] += b[i] - B, b[i] = B, sum -= B;
}
sum = c[n];
for (int i = n, lst = n; i >= (n + 1) / 2 + 1; i--) {
while (lst > 1 && lst - 1 + (n - i + 1) * D >= i) sum += c[--lst];
if (sum < B)
c[i - 1] += c[i], c[i] = 0, res2++;
else if (c[i] >= B)
c[i - 1] += c[i] - B, c[i] = B, sum -= B;
else
c[lst] += c[i] - B, c[i] = B, sum -= B;
}
ans = min(ans, max(res1, res2));
return res1 >= res2;
}
int main() {
scanf("%d%d%d", &n, &D, &B);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
if (n == 100000 && D == 1 && B == 13) {
for (int i = 250; i < 500; i++) cout << a[i] << ' ';
cout << endl;
}
int L = 0, R = n * B;
while (L <= R) {
int mid = (L + R) >> 1;
if (check(mid))
res = mid, L = mid + 1;
else
R = mid - 1;
}
if (res < n * B) check(res + 1);
printf("%d\n", ans);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
using Ip = pair<int, int>;
using Pqip = priority_queue<Ip>;
using Vi = vector<int>;
using V2i = vector<Vi>;
int q, n, x, y;
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cin >> q;
for (int i = 1; i <= q; ++i) {
cin >> n >> x >> y;
Pqip PQ;
V2i Indices(n + 1);
Vi Ans(n, -1), Arr(n);
for (int i = 0, color; i < n; ++i)
cin >> color, Arr[i] = color, --color, Indices[color].emplace_back(i);
if (x == n) {
cout << "YES\n";
for (const auto& it : Arr) cout << it << " ";
cout << "\n";
continue;
}
int null = 0;
for (int i = 0; i <= n; ++i)
if (!Indices[i].empty())
PQ.push(make_pair((int)Indices[i].size(), i));
else
null = i;
int operations = 0;
for (int i = 0; i < x; ++i) {
int curr = PQ.top().second, link = Indices[curr].back();
PQ.pop(), Indices[curr].pop_back();
Ans[link] = curr, ++operations;
if (!Indices[curr].empty())
PQ.push(make_pair((int)Indices[curr].size(), curr));
}
int jmek = PQ.top().second, prev = jmek;
PQ.pop();
while (!PQ.empty()) {
int curr = PQ.top().second, link = Indices[prev].back();
PQ.pop(), Indices[prev].pop_back();
Ans[link] = (operations < y ? curr : null), ++operations;
if (!Indices[prev].empty())
PQ.push(make_pair((int)Indices[prev].size() + (jmek == prev), prev));
prev = curr;
}
if (prev != jmek) {
int link = Indices[prev].back();
Indices[prev].pop_back();
Ans[link] = (operations < y ? jmek : null), ++operations;
}
if (operations >= y) {
for (const auto& link : Indices[prev]) Ans[link] = null;
cout << "YES\n";
for (const auto& it : Ans) cout << it + 1 << " ";
cout << "\n";
} else
cout << "NO\n";
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long n, s;
bool check(long long num) {
long long sum = 0;
long long temp = num;
while (temp) {
sum += temp % 10;
temp /= 10;
}
return abs(num - sum) >= s;
}
int main() {
cin >> n >> s;
long long l = 1;
long long r = n;
long long mid = (l + r) >> 1;
while (l <= r) {
if (check(mid))
r = mid - 1;
else
l = mid + 1;
mid = (l + r) >> 1;
}
cout << n - l + 1 << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string zbor1, zbor2;
cin >> zbor1;
int n, i, j;
n = zbor1.length();
if (n < 10) {
cout << "NO";
return 0;
}
for (i = n - 1; i >= n - 10; i--) {
zbor2 = zbor2 + zbor1[i];
}
if (zbor2 == "SECROFEDOC") {
cout << "YES";
return 0;
}
zbor2.clear();
for (i = 0; i < 10; i++) {
zbor2 = zbor2 + zbor1[i];
}
if (zbor2 == "CODEFORCES") {
cout << "YES";
return 0;
}
for (i = 0; i < 10; i++) {
zbor2.clear();
for (j = 0; j <= i; j++) {
zbor2 = zbor2 + zbor1[j];
}
for (j = n - 9 + i; j < n; j++) {
zbor2 = zbor2 + zbor1[j];
}
if (zbor2 == "CODEFORCES") {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int it[4 * 3002], l[4 * 3002], h[4 * 3002];
int a[3002], r[3002];
void Build(int x, int low, int high) {
l[x] = low;
h[x] = high;
it[x] = 0;
if (low == high) return;
int mid = (low + high) / 2;
Build(2 * x, low, mid);
Build(2 * x + 1, mid + 1, high);
}
void add(int x, int pos) {
if (pos > h[x] || pos < l[x]) return;
it[x]++;
add(2 * x, pos);
add(2 * x + 1, pos);
}
int query(int x, int low, int high) {
if (low > h[x] || high < l[x]) return 0;
if (low <= l[x] && h[x] <= high) return it[x];
return query(2 * x, low, high) + query(2 * x + 1, low, high);
}
int main() {
int permute = 0;
int n;
cin >> n;
Build(1, 1, n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
r[a[i]] = i;
}
for (int i = n; i >= 1; i--) {
add(1, r[i]);
permute += query(1, 1, r[i] - 1);
}
cout << (permute / 2) * 4 + (permute % 2 == 0 ? 0 : 1);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1, inf = 1111111111;
const int max_p = 1111111;
int used[max_p];
vector<int> pw;
bool is_prime(int x) {
if (x <= 1) {
return false;
}
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
return false;
}
}
return true;
}
void get_all_primes() {
used[0] = 1;
used[1] = 1;
for (int i = 2; i < max_p; ++i) {
if (used[i] == 0) {
pw.push_back(i);
if ((long long)i * i < (long long)max_p) {
for (int j = i * i; j < max_p; j += i) {
used[j] = 1;
}
}
}
}
}
int n;
int main() {
get_all_primes();
cin >> n;
if (is_prime(n)) {
cout << 1 << endl;
cout << n << endl;
return 0;
}
for (int i = 4;; ++i) {
for (int j = 0; pw[j] <= i; ++j) {
if (used[i - pw[j]] == 0) {
if (i == n) {
cout << 2 << endl;
cout << pw[j] << " " << i - pw[j] << endl;
return 0;
}
if (is_prime(n - i)) {
cout << 3 << endl;
cout << pw[j] << " " << i - pw[j] << " " << n - i << endl;
return 0;
}
}
}
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, play, mx = 0;
long long sum = 0, ans;
int main(void) {
ios ::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> play;
sum += play;
mx = max(mx, play);
}
ans = sum / (n - 1);
if (sum % (n - 1)) {
++ans;
}
cout << max(ans, mx * 1LL) << "\n";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long n;
int q;
int a[200008];
char s[200008];
void work() {
long long x;
scanf("%I64d", &x);
int tmp = n;
for (int i = 1; i <= n; i++) a[i] = 0;
while (x) {
a[tmp--] = x % 2;
x /= 2;
}
tmp = n;
while (a[tmp] == 0) tmp--;
scanf("%s", s + 1);
for (int i = 1; i <= strlen(s + 1); i++) {
if (s[i] == 'L') {
if (tmp != n) {
a[tmp] = 0;
a[++tmp] = 1;
}
}
if (s[i] == 'R') {
if (tmp != n) {
a[tmp] = 1;
a[++tmp] = 1;
}
}
if (s[i] == 'U') {
if (tmp != 1) {
a[tmp] = 0;
a[--tmp] = 1;
}
}
}
long long ans = 0;
for (int i = 1; i <= n; i++) ans = ans * 2 + a[i];
cout << ans << endl;
}
int main() {
scanf("%I64d%d", &n, &q);
long long x = 1, tmp = 1;
while (x != n) x = x * 2 + 1, tmp++;
n = tmp;
while (q--) work();
}
| 4 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define SZ(x) ((int)x.size())
using namespace std;
inline LL read()
{
LL f=1,x=0;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;
}
int stack[20];
template<typename T>inline void write(T x)
{
if(x<0){putchar('-');x=-x;}
if(!x){putchar('0');return;}
int top=0;
while(x)stack[++top]=x%10,x/=10;
while(top)putchar(stack[top--]+'0');
}
template<typename T>inline void pr1(T x){write(x);putchar(' ');}
template<typename T>inline void pr2(T x){write(x);putchar('\n');}
template<typename T>inline void chkmin(T &x,T y){x=x<y?x:y;}
template<typename T>inline void chkmax(T &x,T y){x=x>y?x:y;}
const int MAXN=55;
const int mod=1e9+7;
int C[MAXN][MAXN],f[MAXN][MAXN],n;
void ad(int &x,int y){x+=y;if(x>=mod)x-=mod;}
int main()
{
for(int i=0;i<MAXN;i++)
{
C[i][0]=1;
for(int j=1;j<=i;j++)C[i][j]=C[i-1][j],ad(C[i][j],C[i-1][j-1]);
}
n=read();
f[1][0]=f[1][1]=1;
for(int i=1;i<n;i++)for(int j=0;j<=i;j++)if(f[i][j])
for(int x=0;x+i<=n;x++)for(int y=0;x+y+i<=n;y++)if((x+y)&&(x+y>=j)&!((x+y-j)&1))
ad(f[i+x+y][abs((x+y-j)/2+j-x)],1LL*f[i][j]*C[x+y+i][x+y]%mod*C[x+y][x]%mod);
pr2(f[n][0]);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
long double v1, v2, l;
const long double eps = 1e-13;
bool check(long double m) {
long double pos = 0;
int left = n;
while (left > 0 && fabs(pos - l) > eps) {
long double dist = l - pos;
if (fabs(dist - m * v1) <= eps) return 1;
if (dist < m * v1) return 1;
if (m <= eps) return 0;
long double s = 0, e = m, res = -1;
for (int i = 0; i < 60; i++) {
long double mid = (s + e) / 2.0;
long double x1 = pos + (v1 * mid);
long double x2 = (v2 * (m - mid));
if (fabs((x2 + x1) - l) < eps)
s = mid, res = m - mid;
else if ((x2 + x1) > l)
s = mid, res = m - mid;
else
e = mid;
}
if (res < eps) return 0;
long double f = pos + res * v2;
pos += (res * v1);
m -= res;
if (m <= 0) return 0;
left -= k;
if (left <= 0) return 1;
s = 0, e = m, res = -1;
for (int i = 0; i < 40; i++) {
long double mid = (s + e) / 2.0;
long double x1 = pos + (v1 * mid);
long double x2 = f - (v2 * mid);
if (x2 - x1 > eps)
s = mid;
else
e = mid, res = mid;
}
if (res <= eps) return 0;
pos += (v1 * res);
m -= res;
if (m <= 0) return 0;
}
return 1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> l >> v1 >> v2 >> k;
long double s = 0, e = l, ans = 0;
long double mid;
for (int i = 0; i < 60; i++) {
mid = (s + e) / 2.0;
if (check(mid) == 1)
e = mid, ans = mid;
else
s = mid;
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
char a[1001];
char b[2010];
int main() {
scanf("%s", &a);
int l = strlen(a);
for (int i = 0; i < l; i++) {
b[i] = a[i];
b[2 * l - 1 - i] = a[i];
}
printf("%s\n", b);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long arr[505][505], infy = 1000000000000000LL, ans, cnt[505][505] = {0};
int brr[505][505] = {0}, crr[505][505];
int main() {
int n, m, i, j, k, a, b, c;
cin >> n >> m;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
arr[i][j] = infy;
crr[i][j] = infy;
}
}
for (i = 1; i <= m; i++) {
cin >> a >> b >> c;
arr[a][b] = c;
arr[b][a] = c;
crr[a][b] = c;
crr[b][a] = c;
}
for (i = 1; i <= n; i++) {
arr[i][i] = 0;
}
int l, x;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
for (k = 1; k <= n; k++) {
if ((arr[j][i] + arr[i][k]) < arr[j][k])
arr[j][k] = arr[j][i] + arr[i][k];
}
}
}
for (l = 1 + n; l <= n; l++) {
cout << "\n";
for (x = 1; x <= n; x++) {
cout << arr[l][x] << " ";
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
for (k = 1; k <= n; k++) {
if ((arr[j][k] == arr[j][i] + crr[i][k]) && (arr[j][k] != infy))
cnt[j][k]++;
}
}
}
for (l = 1; l <= n; l++) {
for (x = l + 1; x <= n; x++) {
ans = 0;
for (i = 1; i <= n; i++) {
if ((arr[l][x] == arr[l][i] + arr[i][x]) && (arr[l][x] != infy))
ans = ans + cnt[l][i];
}
cout << ans << " ";
}
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using std::cin;
using std::cout;
inline std::string make(long long a, long long b) {
if (!a && !b) return "";
if (a == b) return "fail";
if (a > b) {
return std::to_string(a / (b + 1)) + "A" + make(a % (1 + b), b);
} else {
return std::to_string(b / (a + 1)) + "B" + make(a, b % (1 + a));
}
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0);
long long a, b;
cin >> a >> b;
auto res = make(a - 1, b - 1);
if (res.size() && res.back() == 'l') {
cout << "Impossible" << '\n';
} else {
cout << res << '\n';
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
struct TEdge {
int to, d;
TEdge(int _to, int _d) : to(_to), d(_d) {}
};
int GCD(int a, int b) { return b == 0 ? a : GCD(b, a % b); }
int paintDfs(int x, vector<int> &paint, const vector<vector<TEdge> > &edges,
int minK, int cur) {
paint[x] = cur;
for (size_t i = 0; i < edges[x].size(); ++i) {
int pres = cur + edges[x][i].d;
int y = edges[x][i].to;
if (paint[y] != -1000000) {
minK = GCD(minK, abs(pres - paint[y]));
} else {
minK = paintDfs(y, paint, edges, minK, pres);
}
}
return minK;
}
int main() {
cout.precision(10);
cout << fixed;
int N, M;
cin >> N >> M;
vector<vector<TEdge> > edges(N);
for (int i = 0; i < M; ++i) {
int x, y;
cin >> x >> y;
--x;
--y;
edges[x].push_back(TEdge(y, 1));
edges[y].push_back(TEdge(x, -1));
}
vector<int> painted(N, -1000000);
int minK = 0;
for (size_t i = 0; i < N; ++i) {
if (painted[i] == -1000000) {
minK = paintDfs(i, painted, edges, minK, 0);
}
}
if (minK == 0) {
cout << N << '\n';
} else {
cout << minK << '\n';
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int stop[101];
for (int i = 0; i < 101; i++) stop[i] = 0;
for (int i = 0; i < n; i++) {
int r;
cin >> r;
for (int j = 0; j < r; j++) {
int z;
cin >> z;
stop[z]++;
}
}
for (int i = 0; i < 101; i++) {
if (stop[i] == n) {
cout << i << " ";
}
}
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll L,R,ans=2e9;
cin>>L>>R;
for(ll i=L;i<=R;i++){
for(ll j=i+1;j<=R;j++){
ans=min(ans,i*j%2019);
if(i*j%2019==0){
cout<<"0"<<endl;
return 0;
}
}
}
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, p[151][2], l = -1, ans, x;
char s;
int main() {
memset(p, -1, sizeof p);
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> s;
if (s == 'W') {
l = i;
p[i][1] = j;
if (p[i][0] == -1) p[i][0] = j;
}
}
ans += p[i][1] - p[i][0];
}
ans += max(0, l);
for (int i = 0; i <= l; i++) {
if (p[i][0] == -1) continue;
if (i % 2) {
ans += abs(x - p[i][1]);
x = p[i][0];
} else {
ans += abs(x - p[i][0]);
x = p[i][1];
}
}
cout << ans;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const double PI = 2 * asin(1);
const double EPS = 1e-8;
const int INF = 0x3fffffff;
const int MX = 10000 + 10;
int g_n;
vector<int> vi_prime;
vector<bool> vb_prime, vb_num;
map<int, set<int>> misti_ans;
bool input() {
cin >> g_n;
if (cin.eof()) return false;
vb_num.clear(), misti_ans.clear();
vb_num.resize(g_n + 1);
return true;
}
int get_prime(int n) {
int prime_num = 0;
vi_prime.clear();
vb_prime.clear();
vb_prime.resize(n + 1);
fill(vb_prime.begin(), vb_prime.end(), true);
vb_prime[0] = false, vb_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (vb_prime[i]) {
++prime_num;
vi_prime.push_back(i);
}
for (int j = 1; ((j <= prime_num) && (i * vi_prime[j - 1] <= n)); j++) {
vb_prime[i * vi_prime[j - 1]] = false;
if (i % vi_prime[j - 1] == 0) break;
}
}
return prime_num;
}
void solve() {
if (g_n <= 3) {
puts("0");
return;
}
int prime_num = get_prime(g_n);
int pi;
for (pi = prime_num - 1; pi >= 0; --pi) {
if (g_n / vi_prime[pi] >= 2) break;
}
for (int i = pi; i >= 0; --i) {
int k = vi_prime[i];
for (int j = 1; k * j <= g_n; ++j) {
if (!vb_num[k * j]) {
vb_num[k * j] = true;
misti_ans[k].emplace(k * j);
}
}
if (misti_ans[k].size() % 2 != 0) {
misti_ans[k].erase(k * 2);
misti_ans[2].emplace(2 * k);
}
}
if (misti_ans.find(2) != misti_ans.end() && misti_ans[2].size() % 2 != 0)
misti_ans[2].erase(2);
int ans = 0;
for (int i = pi; i >= 0; --i) ans += misti_ans[vi_prime[i]].size() / 2;
cout << ans << endl;
for (int i = pi; i >= 0; --i) {
int k = vi_prime[i];
for (auto it = misti_ans[k].begin(); it != misti_ans[k].end(); ++it)
printf("%d %d\n", *it, *(it++));
}
}
int main() {
while (input()) {
solve();
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[100];
cin >> a;
int i, temp;
int j = 0;
while (a[j] != '\0') {
i = 0;
while (a[i] != '\0') {
if (a[i + 1] != '\0') {
if (a[i] > a[i + 2]) {
temp = a[i];
a[i] = a[i + 2];
a[i + 2] = temp;
}
}
i += 2;
}
j += 2;
}
cout << a;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
int n, d;
while (cin >> n >> d, n != 0) {
vector< stack< int > > que(n, stack< int >());
vector< int > sum(n, 0);
for_(i,0,n) {
int m; cin >> m;
for_(j,0,m) {
int c; cin >> c;
que[i].push(c);
sum[i] += c;
}
}
bool end = false;
while (!end) {
end = true;
for_(i,0,n) {
if (que[i].empty()) continue;
sum[i] -= que[i].top();
if (*max_element(sum.begin(), sum.end()) - *min_element(sum.begin(), sum.end()) <= d) { que[i].pop(); end = false; }
else sum[i] += que[i].top();
}
}
cout << (*max_element(sum.begin(), sum.end()) == 0 ? "Yes" : "No") << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
signed main() {
long long n;
cin >> n;
set<long long> h;
vector<long long> root;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
if (h.find(a) == h.end()) root.push_back(abs(a));
h.insert(a);
}
root.push_back(INF);
sort(root.begin(), root.end());
long long answ = 0;
for (long long i = 0; i < root.size() - 1; i++)
answ += ((long long)(upper_bound(root.begin(), root.end(), 2 * root[i]) -
root.begin()) -
i - 1);
cout << answ;
return 0;
}
| 3 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "YES" << endl; \
} \
else \
{ \
cout << "NO" << endl; \
}
#define IFYes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "Yes" << endl; \
} \
else \
{ \
cout << "No" << endl; \
}
#define IFyes(TRUE_OR_FALSE) \
if (TRUE_OR_FALSE) \
{ \
cout << "yes" << endl; \
} \
else \
{ \
cout << "no" << endl; \
}
#define DEBUG_OUTPUT_ARRAY(XXX, ONE) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
}
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << "<<< i = " << i << " >>>" << endl; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
} \
}
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
for (int i = 0; i < (ONE); i++) \
{ \
cout << i << " "; \
for (int j = 0; j < (TWO); j++) \
{ \
cout << XXX[i][j] << " "; \
} \
cout << endl; \
}
typedef pair<long long int, long long int> pll;
const long long int mod = 1000000007;
const long long int INF = 99999999999999999;
long long int N,C[101][101],res=0;
int main()
{
cout << fixed << setprecision(18);
cin>>N;
for(long long int i = 0; i < N; i++){
for(long long int j = 0; j < N; j++){
cin>>C[i][j];
}
}
for(long long int i = 0; i < N; i++){
for(long long int j = i+1; j < N; j++){
res+=min(C[i][j],C[j][i]);
}
}
cout<<res<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 5;
const long long inf = 1e16;
long long n, m, x[N], c[N], p[N];
pair<long long, long long> pr[N];
long long dp[N];
void prep() {
sort(pr, pr + m);
for (int i = 0; i < m; i++) p[i] = pr[i].first, c[i] = pr[i].second;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> x[i];
sort(x, x + n);
int total = 0;
for (int i = 0; i < m; i++) {
cin >> pr[i].first >> pr[i].second;
total += pr[i].second;
}
if (total < n) return cout << -1 << "\n", 0;
prep();
for (int i = 1; i <= n; i++) dp[i] = inf;
for (int j = 0; j < m; j++) {
deque<pair<long long, long long> > dq;
long long sum = 0;
dq.push_back(make_pair(0, -1));
for (int i = 0; i < n; i++) {
sum += abs(x[i] - p[j]);
while (!dq.empty() && dq.back().first >= dp[i + 1] - sum) dq.pop_back();
dq.push_back(make_pair(dp[i + 1] - sum, i));
while (!dq.empty() && i - dq.front().second > c[j]) dq.pop_front();
if (dq.size()) dp[i + 1] = min(dp[i + 1], dq.front().first + sum);
}
}
cout << dp[n] << "\n";
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int vis[100010], n, x, y;
long long ans1, ans2;
vector<int> adj[100010];
void dfs(int i, int last = 1) {
vis[i] = last;
if (vis[i] == 1)
ans1++;
else
ans2++;
for (int j = 0; j < adj[i].size(); j++) {
if (!vis[adj[i][j]]) dfs(adj[i][j], 3 - last);
}
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
dfs(1);
cout << ans1 * ans2 - n + 1;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<int> pos_indicator[1000004];
int main() {
long long n, sum = 0;
cin >> n;
vector<long long> a(n), ans;
for (int i = 0; i < n; i++) {
cin >> a[i];
pos_indicator[a[i]].push_back(i + 1);
sum += a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (i + 1 != n && sum - a[i] - a[n - 1] == a[n - 1]) {
for (int j = 0; j < pos_indicator[a[i]].size(); j++)
ans.push_back(pos_indicator[a[i]][j]);
pos_indicator[a[i]].clear();
} else if (i == n - 1 && sum - a[i] - a[i - 1] == a[i - 1]) {
for (int j = 0; j < pos_indicator[a[i]].size(); j++)
ans.push_back(pos_indicator[a[i]][j]);
}
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i == ans.size() - 1];
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> c(n);
for (int &x : c) cin >> x;
auto cmp = [&](int i, int j) { return c[i] < c[j]; };
priority_queue<int, vector<int>, decltype(cmp)> pq(cmp);
for (int i = 0; i < k; ++i) pq.push(i);
long long cost = 0;
vector<int> ans(n);
for (int i = k; i < n + k; ++i) {
if (i < n) pq.push(i);
ans[pq.top()] = i + 1;
cost += (long long)(i - pq.top()) * c[pq.top()];
pq.pop();
}
cout << cost << '\n';
for (int t : ans) cout << t << " ";
cout << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int N, M, A, X, Y, RX, RY;
map<int, int> T, U;
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A, X += 3, T[A]++;
cin >> M;
for (int i = 0; i < M; i++) cin >> A, Y += 3, U[A]++, T[A];
RX = X, RY = Y;
for (map<int, int>::iterator it = T.begin(); it != T.end(); ++it) {
int p = it->first;
X -= T[p], Y -= U[p];
if (X - Y > RX - RY) RX = X, RY = Y;
}
cout << RX << ':' << RY << '\n';
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, m;
cin >> n >> m;
string x, y;
cin >> x >> y;
long long g = gcd(x.length(), y.length()),
l = 1ll * x.length() * y.length() / g, dist = l, c[g][26];
for (int i = 0; i < g; i++)
for (int j = 0; j < 26; j++) c[i][j] = 0;
for (int i = 0; i < x.length(); i++) c[i % g][x[i] - 'a']++;
for (int i = 0; i < y.length(); i++) dist -= c[i % g][y[i] - 'a'];
cout << dist * (x.length() * n / l) << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
const int INF = 2e9;
int n, m;
string s[N];
int check(int x) {
int ret = 0;
for (int i = 2; i <= n; i++) {
int cur = INF;
for (int k = 0; k < m; k++) {
bool flag = true;
for (int j = 0; j < m; j++) {
if (s[i][(j + k) % m] != s[1][(j + x) % m]) {
flag = false;
break;
}
}
if (flag) {
cur = k;
break;
}
}
if (cur == INF) return INF;
ret += cur;
}
return ret;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
m = s[1].length();
int ans = INF;
for (int x = 0; x < m; x++) {
ans = min(ans, x + check(x));
}
if (ans == INF) ans = -1;
cout << ans << '\n';
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi 3.14159265
#define mod 1000000007
#define pb push_back
const int N = 5e3+2;
const ll mxn =1e18;
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define FF fflush(stdout);
#define lcm(a,b) (a*b)/__gcd(a,b)
int main()
{
FAST
ll t;
cin >> t;
while(t--)
{
ll n,i,j,c=1,s;
cin >> n;
s=n*n;
if(n==2)cout << -1 << endl;
else
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cout << c << ' ';
c+=2;
if(c>s)c=2;
}
cout << endl;
}
}
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s;
cin >> s;
int x = s.size();
int arr[10];
int c0 = 0, c2 = 0, c4 = 0, c6 = 0, c8 = 0;
int sum = 0;
for (int i = 0; i < x; i++) {
sum += s[i] - '0';
if (s[i] == '0') ++c0;
if (s[i] == '2') ++c2;
if (s[i] == '4') ++c4;
if (s[i] == '6') ++c6;
if (s[i] == '8') ++c8;
}
if (sum % 3 == 0 && c0 >= 1 && (c2 >= 1 || c4 >= 1 || c6 >= 1 || c8 >= 1)) {
cout << "red" << endl;
} else if (sum % 3 == 0 && c0 >= 2) {
cout << "red" << endl;
} else
cout << "cyan" << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
long long ans;
const int MOD = int(1e9) + 7;
int cnt[121];
void rec(int i, bitset<120> by, long long w) {
if (i > m / 2) {
ans += w;
return;
}
rec(i + 1, by, w);
if (cnt[i] && !by[i])
rec(i + 1, by | by >> i | by << (m - i) | by >> (m - i) | by << i,
w * cnt[i] % MOD);
}
int main() {
cin >> n >> m;
int nF;
cin >> nF;
for (int i = 0; i < nF; ++i) {
int x;
cin >> x;
x %= m;
cnt[min(m - x, x)]++;
}
rec(0, bitset<120>(1), 1);
cout << ans % MOD << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void pv(T a, T b) {
for (T i = a; i != b; ++i) cout << *i << " ";
cout << endl;
}
long long pd[510][510];
long long pw2[510 * 510];
long long md(long long a) {
a %= 1000000007LL;
if (a < 0) return (a + 1000000007LL) % 1000000007LL;
return a;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
pw2[0] = 1;
for (int i = 1; i < 510 * 510; i++)
pw2[i] = (pw2[i - 1] * 2LL) % 1000000007LL;
long long rsp = 0;
for (int i = 1; i < k + 1; i++) {
for (int(j) = (0); (j) < (n); (j)++) {
pd[i][j] = 0;
if (i == 1) {
pd[i][j] = md(pw2[j + 1] - 1);
} else {
for (int(z) = (0); (z) < (j); (z)++) {
pd[i][j] = md(pd[i][j] + md(pd[i - 1][z] * (pw2[j - z] - 1)) *
pw2[(j - z) * (z + 1)]);
}
}
if (i == k) {
rsp = md(rsp + md(pd[i][j] * pw2[(n - 1 - j) * (j + 1)]));
}
}
}
if (k == 0) rsp++;
printf("%lld\n", rsp);
return 0;
}
| 5 |
#include<bits/stdc++.h>
using namespace std;
int a[111111];
int main() {
int n, l;
cin >> n >> l;
for(int i(1); i <= n; i++) {
cin >> a[i];
}
for(int i(1); i < n; i++) {
if(a[i] + a[i + 1] >= l) {
cout << "Possible" << endl;
for(int j(1); j < i; j++) {
cout << j << endl;
}
for(int j(n - 1); j >= i; j--) {
cout << j << endl;
}
return 0;
}
}
cout << "Impossible" << endl;
}
| 0 |
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
#define EPS 1e-9
double dist(int x, int y)
{
return sqrt(x * x + y * y);
}
double angle(int x, int y)
{
return atan2((double)(x), (double)(y));
}
int main()
{
int x0, x1, y0, y1, x2, y2, q;
cin >> x0 >> y0 >> x1 >> y1 >> q;
for (int i = 0; i < q; i++)
{
cin >> x2 >> y2;
int ax = x1 - x0;
int ay = y1 - y0;
int bx = x2 - x0;
int by = y2 - y0;
double br = dist(bx, by);
double cr = dist(bx, by);
double at = angle(ay, ax);
double bt = angle(by, bx);
double ct = bt - (bt - at) * 2;
double cx = x0 + cr * cos(ct);
double cy = y0 + cr * sin(ct);
if (cx < -EPS || EPS < cx)
{
cout << setprecision(15) << cx << ' ';
}
else
{
cout << 0 << ' ';
}
if (cy < -EPS || EPS < cy)
{
cout << setprecision(15) << cy << endl;
}
else
{
cout << 0 << endl;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int i;
int a,b,m,x,y,c,dis=100000000;
cin>>a>>b>>m;
vector<int>aa(a),bb(b);
int mn1=100000000,mn2=100000000;
for(i=0;i<a;i++){
cin>>aa[i];
mn1=min(aa[i],mn1);
}
for(i=0;i<b;i++){
cin>>bb[i];
mn2=min(bb[i],mn2);
}
for(i=0;i<m;i++){
cin>>x>>y>>c;
dis=min(dis,aa[x-1]+bb[y-1]-c);
}
dis=min(dis,mn1+mn2);
cout<<dis<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long city[n], tower[m + 2];
for (int i = 0; i < n; i++) cin >> city[i];
for (int i = 1; i <= m; i++) cin >> tower[i];
tower[0] = -pow(10, 10);
tower[m + 1] = pow(10, 10);
long long res = 0;
for (int i = 0; i < n; i++) {
int lb = (lower_bound(tower, tower + m + 2, city[i]) - tower) - 1;
int ub = (upper_bound(tower, tower + m + 2, city[i] - 1) - tower);
long long t1 = (city[i] - tower[lb]);
long long t2 = (tower[ub] - city[i]);
res = max(res, min(t1, t2));
}
cout << res;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, -1, 0};
int dy[] = {1, 0, 0, -1};
long long pw(long long b, long long p) {
if (!p) return 1;
long long sq = pw(b, p / 2);
sq *= sq;
if (p % 2) sq *= b;
return sq;
}
const int N = (2 * 1e5) + 10, M = N * 2;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int res = 0;
for (int i = 0; i < n; i++) {
int k, cnt;
cin >> k >> cnt;
int tmp = 0, need = 0;
while (cnt > tmp) {
if (!tmp)
tmp += 4;
else
tmp *= 4;
need++;
}
res = max(res, need + k);
}
cout << res;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void radixsort(long long a[], long long b[], long long n) {
long long temp1, temp2, I, K;
long long sor[n], k = 0, i, c[10], j, B[n];
for (K = 0; K < 10; K++) {
k++;
for (j = 0; j < 10; j++) c[j] = 0;
for (i = 0; i < n; i++) {
temp1 = a[i];
for (j = 0; j < k; j++) {
temp2 = temp1 % 10;
temp1 = temp1 / 10;
}
c[temp2]++;
}
for (I = 1; I < 10; I++) c[I] = c[I] + c[I - 1];
for (i = n - 1; i >= 0; i--) {
temp1 = a[i];
for (j = 0; j < k; j++) {
temp2 = temp1 % 10;
temp1 = temp1 / 10;
}
sor[c[temp2] - 1] = a[i];
B[c[temp2] - 1] = b[i];
c[temp2]--;
}
for (i = 0; i < n; i++) {
a[i] = sor[i];
b[i] = B[i];
}
}
}
int main() {
long long n, i;
cin >> n;
long long a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = i;
}
radixsort(a, b, n);
for (i = 0; i < n / 2; i++)
cout << b[i] + 1 << " " << b[n - i - 1] + 1 << endl;
}
| 1 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int key[102];
for (int i = 0;i < n;i++) {
cin >> key[i];
}
string h = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
string s;
cin >> s;
for (int i = 0;i < s.size();i++) {
if (s[i] >= 'a'&&s[i] <= 'z') {
int a = s[i]-'a';
a -= key[i%n];
a %= 52;
if (a < 0)a += 52;
s[i] = h[a];
}
else {
int a = s[i] - 'A' + 26;
a -= key[i%n];
a %= 52;
if (a < 0)a += 52;
s[i] = h[a];
}
}
cout << s << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
using namespace std;
long long n;
long long a[1010];
long long x[1010];
signed main() {
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
}
vector<long long> res;
for (long long k = 1; k <= n; k++) {
for (long long i = 0; i < k; i++) {
x[i] = a[i + 1] - a[i];
}
bool ok = 1;
for (long long i = k; i <= n; i++) {
if (a[i] != x[(i - 1) % k] + a[i - 1]) {
ok = 0;
}
}
if (ok) res.push_back(k);
}
cout << res.size() << endl;
for (long long i = 0; i < res.size(); i++) cout << res[i] << " ";
cout << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
int main() {
long long n, a[100100], u[100100] = {};
int kol = 0;
kol = 1;
a[0] = 1;
u[0] = 1;
for (int i = 2; i < 100100; i++) {
if (u[i] == 0) {
a[kol] = i;
kol++;
for (int j = i; j < 100100; j += i) {
u[j] = 1;
}
}
}
for (int i = 0; i < 100100; i++) u[i] = -1;
long long x[100100], y[100100];
scanf("%I64d", &n);
for (int i = 0; i < n; i++) {
scanf("%I64d%I64d", &x[i], &y[i]);
}
long long st;
for (int i = 0; i < n; i++) {
st = 0;
if (y[i] == 0) st++;
long long t = 0, t2 = 1, t3 = 0, p[100100], p2[100100];
p2[0] = 1;
for (int j = 1; j < kol && a[j] <= x[i]; j++) {
if (x[i] % a[j] == 0) {
p[t] = a[j];
t++;
x[i] /= a[j];
j--;
}
}
for (int j = 0; j < t; j++) {
t3 = t2;
if (u[p[j]] == -1) {
p2[t2] = p[j];
t2++;
}
for (int k = 0; k < t3; k++) {
int flag = 0;
p2[t2] = p2[k] * p[j];
if (u[p2[t2]] != i) flag = 1;
if (u[p2[t2]] + y[i] < i) st++;
u[p2[t2]] = i;
t2 += flag;
}
}
printf("%I64d\n", st);
}
return 0;
}
| 2 |
#include<bits/stdc++.h>
#define A 100010
#define X first
#define Y second
using namespace std;int n,q,z,m[A],u[A];vector<int> c[A];stack<pair<char,int> > Q;void D(int x,int g){u[x]=g;if(m[x])g=x;for(int i=0;i<c[x].size();i++)D(c[x][i],g);}int F(int x){if(m[x])return x;int t=F(u[x]);u[x]=t;return t;}int main(){while(cin>>n>>q&&n){for(int i=0;i<n;i++){c[i].clear();u[i]=0,m[i]=0;}for(int i=1;i<n;i++){cin>>z;z--;c[z].push_back(i);}m[0]++;for(int i=0;i<q;i++){pair<char,int> r;cin>>r.X>>r.Y;r.Y--;if(r.X=='M')m[r.Y]++;Q.push(r);}D(0,0);long long s=0;while(!Q.empty()){if(Q.top().X=='M')m[Q.top().Y]--;else s+=F(Q.top().Y)+1;Q.pop();}cout<<s<<endl;}return 0;}
| 0 |
#include <iostream>
using namespace std;
int main()
{
int h, w, i, j ,k;
string s ;
cin>>h>>w;
for(i=0; i<w+2 ; i++)
{
cout<<"#";
}
cout<<endl;
for(j=0; j<h; j++)
{
cin>>s;
cout << "#" << s << "#"<<endl;
}
for(k=0; k<w+2 ; k++)
{
cout<<"#";
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
set<long long> s;
s.insert(0);
s.insert(1);
for (long long i = 1; i * i <= n; ++i) {
s.insert(i);
s.insert(n / i);
}
cout << s.size() << endl;
for (auto i : s) cout << i << " ";
cout << endl;
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
void bye() {
cout << "NO";
exit(0);
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
vector<long long> A(n);
long long s = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
s += A[i];
}
long long m;
cin >> m;
vector<long long> B(m);
for (int i = 0; i < m; i++) {
cin >> B[i];
s -= B[i];
}
if (s != 0) {
cout << -1;
return 0;
}
long long i = 0, j = 0;
long long a = 0, b = 0;
long long c = 0;
while (i < n && j < m) {
c++;
a = A[i];
b = B[j];
i++;
j++;
while (a != b && (i < n && j < m)) {
if (a < b) {
a += A[i];
i++;
} else {
b += B[j];
j++;
}
}
}
cout << c;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int x[150005], cnt = 0, k;
pair<int, int> on[6];
void add(int indx) {
for (int i = 0; i < k; i++) {
if (x[indx] > on[i].first) {
on[i] = make_pair(x[indx], indx);
sort(on, on + k);
break;
}
}
}
bool ispres(int indx) {
for (int i = 0; i < k; i++)
if (on[i].second == indx) return true;
return false;
}
int main() {
int n, q, qs, a;
cin >> n >> k >> q;
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
for (int i = 0; i < q; i++) {
scanf("%d%d", &qs, &a);
if (qs == 1)
add(a);
else {
if (ispres(a))
puts("YES");
else
puts("NO");
}
}
return 0;
}
| 2 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> ar(n);
long long sum=0,x=0,mn=1000000000000000000LL;
for(int i=0;i<n;i++)
{
cin >> ar[i];
sum+=ar[i];
}
for(int i=0;i<n-1;i++)
{
x+=ar[i];
mn = min(mn, abs(sum-2*x));
}
cout << mn << endl;
}
| 0 |
#include<bits/stdc++.h>
#define N 1000005
using namespace std;
char s[N],t[N];int n;
int main(){
scanf("%d",&n);
scanf("%s%s",s+1,t+1);
if(s[1]!=t[1]){
for(int i=1;i<=n;i++)putchar('1');
putchar('\n');
return 0;
}
bool flag=1;
for(int i=1;i<=n;i++)flag&=s[i]==t[i];
if(flag){puts(t+1);return 0;}
s[n]++;
for(int i=n;i>=1;i--)if(s[i]-'0'>1)s[i]-=2,s[i-1]++;
flag=1;
for(int i=1;i<=n;i++)flag&=s[i]==t[i];
if(flag){puts(t+1);return 0;}
if(t[n]=='1')puts(t+1);
else t[n]++,puts(t+1);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
struct Point {
int x, y;
bool operator<(const Point &a) const { return x < a.x; }
} p[MAXN];
int n;
int preMIN[MAXN];
int preMAX[MAXN];
int sufMIN[MAXN];
int sufMAX[MAXN];
bool ok(long long lim) {
for (int i = 1, j = 1; i <= n; i++) {
while (j <= i && (-p[j].x > p[i].x ||
(long long)(p[i].x - p[j].x) * (p[i].x - p[j].x) > lim))
j++;
while (j - 1 >= 1 && -p[j - 1].x <= p[i].x &&
(long long)(p[i].x - p[j - 1].x) * (p[i].x - p[j - 1].x) <= lim)
j--;
int MN = min(preMIN[j - 1], sufMIN[i + 1]),
MX = max(preMAX[j - 1], sufMAX[i + 1]);
if (i - j + 1 == n ||
((long long)(MX - MN) * (MX - MN) <= lim &&
(j > i || max((long long)MN * MN, (long long)MX * MX) +
(long long)p[i].x * p[i].x <=
lim)))
return 1;
}
for (int i = n, j = n; i >= 1; i--) {
while (j >= i && (-p[j].x < p[i].x ||
(long long)(p[j].x - p[i].x) * (p[j].x - p[i].x) > lim))
j--;
while (j + 1 <= n && -p[j + 1].x >= p[i].x &&
(long long)(p[j + 1].x - p[i].x) * (p[j + 1].x - p[i].x) <= lim)
j++;
int MN = min(preMIN[i - 1], sufMIN[j + 1]),
MX = max(preMAX[i - 1], sufMAX[j + 1]);
if (j - i + 1 == n ||
((long long)(MX - MN) * (MX - MN) <= lim &&
(j < i || max((long long)MN * MN, (long long)MX * MX) +
(long long)p[i].x * p[i].x <=
lim)))
return 1;
}
return 0;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &p[i].x, &p[i].y);
sort(p + 1, p + n + 1);
preMIN[0] = sufMIN[n + 1] = 1e9;
preMAX[0] = sufMAX[n + 1] = -1e9;
for (int i = 1; i <= n; i++) {
preMIN[i] = min(preMIN[i - 1], p[i].y);
preMAX[i] = max(preMAX[i - 1], p[i].y);
}
for (int i = n; i >= 1; i--) {
sufMIN[i] = min(sufMIN[i + 1], p[i].y);
sufMAX[i] = max(sufMAX[i + 1], p[i].y);
}
long long low = 0, high = 1e18;
while (low < high) {
long long mid = low + high >> 1;
if (ok(mid))
high = mid;
else
low = mid + 1;
}
printf("%lld\n", low);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int T = 1;
while (T--) {
long long int n, k;
cin >> n >> k;
long long int i, a[n];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
i = n / 2;
long long int cnt = 1, ans = a[n / 2], v;
while (k > 0 && i + 1 < n) {
v = min(k / cnt, a[i + 1] - ans);
ans += v;
k = k - v * cnt;
cnt++;
i++;
}
if (k > 0) {
ans += k / cnt;
}
cout << ans;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long arr[n][3];
for (long long i = 0; i < 3; i++) {
for (long long j = 0; j < n; j++) cin >> arr[j][i];
}
vector<long long> v[n];
for (long long i = 0; i < n - 1; i++) {
long long a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
bool pos = 1;
long long ver = -1;
unordered_map<long long, long long> cnt;
for (long long i = 0; i < n; i++) {
if (v[i].size() == 1) ver = i;
cnt[v[i].size()]++;
}
if (!(cnt[1] == 2 && cnt[2] == n - 2)) {
cout << -1;
return 0;
}
vector<long long> hold;
hold.push_back(ver);
bool vis[n];
memset(vis, 0, sizeof(vis));
vis[ver] = 1;
queue<long long> q;
long long ans = LLONG_MAX;
q.push(ver);
while (q.size() > 0) {
long long temp = q.front();
q.pop();
for (auto it = v[temp].begin(); it != v[temp].end(); it++) {
if (vis[*it]) continue;
vis[*it] = 1;
hold.push_back(*it);
q.push(*it);
}
}
long long arr1[] = {0, 1, 2};
long long ind1 = 0;
long long st = 0;
long long vali[6][n];
memset(vali, 0, sizeof(vali));
do {
long long tempo = 0;
for (long long j = 0; j < n; j++) tempo += arr[hold[j]][arr1[j % 3]];
for (long long j = 0; j < n; j++) vali[st][hold[j]] = arr1[j % 3];
ans = min(ans, tempo);
if (ans == tempo) ind1 = st;
st++;
} while (next_permutation(arr1, arr1 + 3));
cout << ans << "\n";
for (long long j = 0; j < n; j++) cout << vali[ind1][j] + 1 << " ";
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ') {
while (!isdigit(ch = getchar()))
if (ch == '-') f = -1;
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f * x;
}
const int N = 5e5 + 5;
struct Edge {
int next, to, w;
Edge(int next = 0, int to = 0, int w = 0) : next(next), to(to), w(w){};
} edge[N << 1];
int tot, head[N];
void _add(int x, int y, int z) {
edge[++tot] = Edge(head[x], y, z), head[x] = tot;
}
void add(int x, int y, int z) { _add(x, y, z), _add(y, x, z); }
int q, n, k;
long long f[N], g[N];
void dfs(int x, int fa) {
f[x] = g[x] = 0;
vector<long long> s;
for (int i = head[x]; i; i = edge[i].next) {
int y = edge[i].to, z = edge[i].w;
if (y == fa) continue;
dfs(y, x), f[x] = g[x] += max(g[y], f[y]),
s.push_back(max(f[y], g[y]) - g[y] - z);
}
sort(s.begin(), s.end());
for (int i = 0; i < s.size() && i < k; ++i)
if (s[i] < 0)
f[x] -= s[i];
else
break;
for (int i = 0; i < s.size() && i < k - 1; ++i)
if (s[i] < 0)
g[x] -= s[i];
else
break;
}
int main() {
q = read();
while (q--) {
n = read(), k = read(), tot = 0, memset(head + 1, 0, sizeof(int) * n);
for (int i = 1; i < n; ++i) {
int x = read(), y = read(), z = read();
add(x, y, z);
}
dfs(1, 0), printf("%I64d\n", max(f[1], g[1]));
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 0.0000000001;
int main() {
cin.tie(0);
cout.tie(0);
std::ios_base::sync_with_stdio(0);
int n;
cin >> n;
string s;
cin >> s;
int c = n;
for (int x = 0; x < 1; x++) {
for (int y = x + 1; y < s.size(); y++) {
if ((n - y - 1) >= (1 + y - x)) {
int sz = y - x + 1;
bool p = 0;
for (int i = x; i <= y; i++) {
if (s[i] != s[i + sz]) {
p = 1;
break;
}
}
if (!p) {
c = min(c, n - sz + 1);
}
}
}
}
cout << c << endl;
}
| 2 |
#include <bits/stdc++.h>
int k, n, m;
long long ans, temp;
int p[3000000];
int a[3000000];
int main() {
scanf("%d %d %d", &n, &m, &k);
int pos;
for (int i = 1; i <= m; ++i) {
scanf("%d", &pos);
p[pos] = -1;
}
for (int i = 1; i <= k; ++i) scanf("%d", &a[i]);
pos = -1;
for (int i = 0; i <= n + k + 2; ++i) {
if (p[i] == 0) pos = i;
p[i] = pos;
}
ans = 1LL << 61;
for (int i = 1; i <= k; ++i) {
temp = 0;
pos = p[0];
temp = 0;
if (pos < 0) break;
while (pos < n) {
temp += a[i];
if (p[pos + i] <= pos) break;
pos = p[pos + i];
}
if (pos >= n && temp < ans) ans = temp;
}
if (ans > 1LL << 60) ans = -1;
printf("%I64d\n", ans);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long i, j = 0;
long long a[1001];
for (i = 0; i < n; i++) cin >> a[i];
long long cnt[70];
memset(cnt, 0, sizeof(cnt));
for (i = 0; i < n; i++) {
j = 0;
if (a[i] > 0) {
while (a[i] > 0) {
cnt[j] += (a[i] % k);
a[i] /= k;
j++;
}
}
}
long long f = 0;
for (i = 0; i < 70; i++) {
if (cnt[i] > 1) {
f = 1;
break;
}
}
if (f == 1)
cout << "NO\n";
else
cout << "YES\n";
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
for (long long test = 1; test <= t; test++) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
string s;
cin >> s;
map<int, int> a, b;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
b[v[i]] = 0;
else
a[v[i]] = 0;
}
int k = b.size();
map<int, int> st, mt;
for (int i = 1; i <= k; i++) st[i]++;
for (int i = k + 1; i <= n; i++) mt[i]++;
for (auto i = b.begin(); i != b.end(); i++) {
if (i->first > k) {
b[i->first] = st.begin()->first;
} else {
if (st.find(i->first) != st.end())
b[i->first] = i->first;
else
b[i->first] = st.begin()->first;
}
st.erase(b[i->first]);
}
for (auto i = a.begin(); i != a.end(); i++) {
if (i->first <= k) {
a[i->first] = mt.begin()->first;
} else {
if (mt.find(i->first) != mt.end())
a[i->first] = i->first;
else
a[i->first] = mt.begin()->first;
}
mt.erase(a[i->first]);
}
for (int i = 0; i < n; i++) {
if (s[i] == '0')
v[i] = b[v[i]];
else
v[i] = a[v[i]];
}
for (int i = 0; i < n; i++) cout << v[i] << " ";
cout << endl;
}
return 0;
}
| 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.