code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1e18+7;
ll ceildiv(ll a, ll b) { return (a+b-1)/b; } // 切り上げ
ll floordiv(ll a, ll b) { return a/b; } // 切り下げ
int show_matrix(vector<vector<int>> &dp) {
loop(0, dp.size(), i) {
loop(0, dp[i].size(), j) {
cout << dp[i][j] << " ";
}
cout << endl;
}
return 0;
}
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
vector<ll> A(N);
vector<ll> C(N);
ll prev = -1;
ll last = 0;
loop(0, N, i) {
ll a, b;
cin >> a;
b = a - (i+1);
A[i] = a;
C[i] = b;
}
loop(0, Q, i) {
ll K;
cin >> K;
ll pos = lower_bound(C.begin(), C.end(), K) - C.begin();
// print(pos
// posまでに出現
ll idx;
ll v;
if (pos == 0) {
idx = 0;
v = 0;
} else{
idx = C[pos -1];
v = A[pos-1];
}
print(v + K - idx);
}
}
| #include<bits/stdc++.h>
using namespace std;
long long n,a;
int main()
{
cin>>n>>a;
for(int i=1;i<=a;i++)
{
if(n%200==0)
n=n/200;
else n=n*1000+200;
}
cout<<n;
} |
#include <bits/stdc++.h>
#define speedup \
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr), \
cout.precision(12)
using namespace std;
#ifndef ONLINE_JUDGE
#define eprintf(...) fprintf(stderr,__VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) void(0)
#endif
using ll = long long;
int main() {
speedup;
int v,t,s,d;
cin>>v>>t>>s>>d;
if(d<v*t||v*s<d) cout<<"Yes\n";
else cout<<"No\n";
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define intarr(arr, n) ll arr[n]; for (ll i = 0; i < n; i++) cin >> arr[i]
#define inpvec(v,n) for(ll i=0;i<n;i++){ll var;cin>>var;v.push_back(var);}
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair
#define vec vector<ll>
#define pi pair<ll,ll>
#define changeline cout<<endl
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define rev(i,a,b) for(ll i=a;i>=b;i--)
#define all(v) v.begin(),v.end()
#define NO cout << "NO" <<endl
#define YES cout << "YES" <<endl
#define mem(arr,val) memset(arr,val,sizeof(arr));
const ll mod = 1e9+7;
#define mod2 998244353
#define piii 3.14159265358979323846264338327950
#define print(a, n, m) for (ll i = n; i < m; i++) { cout << a[i] << " "; } // cout << endl
#define con continue
bool prime(ll n)
{
if (n <= 1) return false;
if (n <= 3) return 1;
if (n%2 == 0 || n%3 == 0) return false;
for (ll i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return 1;
}
bool isPerfectSquare(ll x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
bool isPowerOfTwo(ll n) {
return n > 0 && !(n&(n-1));
}
bool subsequence_checker(string str1, string str2, ll m, ll n)
{
if (m == 0) return 1;
if (n == 0) return false;
if (str1[m-1] == str2[n-1])
return subsequence_checker(str1, str2, m-1, n-1);
return subsequence_checker(str1, str2, m, n-1);
}
bool cmp(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
if(a.ff == b.ff)
return a.ss < b.ss;
return (a.ff > b.ff);
}
ll gcd(ll p, ll q){
if(p % q == 0)return q;
return gcd(q, p % q);
}
ll countDigit(ll n)
{
return floor(log10(n) + 1);
}
ll power(ll a,ll n)
{
if(n==0)
return 1;
if(n%2)
return (a*power((a*a)%mod,n/2))%mod;
return power((a*a)%mod,n/2);
}
ll fast_pow(ll a, ll p) {
ll res = 1;
while (p) {
if (p % 2 == 0) {
a = (a * a) % mod;
p /= 2;
} else {
res = (res * a) % mod;
p--;
}
}
return res;
}
ll setBitNumber(ll n)
{
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n = n + 1;
return (n >> 1);
}
ll ncr(ll n , ll r)
{
if(n<r) return 0;
if(r==1) return n;
if(r==2) return (n*(n-1))/2;
return (n*(n-1)*(n-2))/6;
}
ll countDivisors(ll n) {
ll count =0 ;
for (ll i = 1; i*i < n; i++)
if (n % i == 0)
count++;
for (ll i = sqrt(n); i >= 1; i--)
if (n % i == 0)
count++;
return count;
}
vector<ll> printDivisors(ll n){
vector<ll> d ;
for (ll i = 1; i*i < n; i++)
if (n % i == 0){
d.push_back(i);
//cout<<i<<" ";
}
for (ll i = sqrt(n); i >= 1; i--)
if (n % i == 0){
d.push_back(n/i);
//cout<<n/i<<" ";
}
return d;
}
///////////////////////////////////Lets Do It///////////////////////////////////
void solve()
{
ld v,t,s,d;
cin>>v>>t>>s>>d;
ld time = d/v;
if(time>s || time < t )
{
cout<<"Yes";
}
else{
cout<<"No";
}
return;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
ll t;
//cin>>t;
t=1;
while(t--){
solve();
cout<<endl;
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
} |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
//typedef long long int ll;
typedef unsigned long long int ll;
//typedef pair<ll, ll> pd;
const int mod = 1e9 + 7;
//#define int long long
int gcd(int a, int b){
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
set<int> s;
for(auto x: a){
s.insert(x);
}
int num = 1;
for(auto x: s){
if(x!=num){
cout<<"No\n";
return;
}
num++;
}
if(num==n)cout<<"No\n";
else cout<<"Yes\n";
}
int32_t main(){
//#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
//cin>>t;
for(int i=1;i<=t;i++){
solve();
}
return 0;
} | #include <iostream>
#include <deque>
#include <climits>
int search(int lhs, const std::deque<int>& rhs) {
if (rhs.size() == 0) {
return lhs;
}
int min = INT_MAX;
for (int i = 1; i <= rhs.size(); i++) {
int n = 0;
auto copied = rhs;
for (int j = 0; j < i; j++) {
n |= copied[0];
copied.pop_front();
}
const int branch_result = search(lhs ^ n, copied);
if (branch_result < min) {
min = branch_result;
}
}
return min;
}
int main() {
int N;
std::deque<int> A;
std::cin >> N;
for (int i = 0; i < N; i++) {
int n;
std::cin >> n;
A.push_back(n);
}
// std::cout << N << std::endl;
// for (int i = 0; i < A.size(); i++) {
// std::cout << i << std::endl;
// }
const int result = search(0, A);
std::cout << result << std::endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
typedef long long LL;
const LL inf = 2e18;
using namespace std;
int T, x, y, p, q;
LL ans;
LL gcd(LL a, LL b) {
if (!b)
return a;
return gcd(b, a % b);
}
LL exgcd(LL a, LL b, LL &x, LL &y) {
LL g = a;
if (!b)
x = 1, y = 0;
else {
g = exgcd(b, a % b, y, x);
y -= a / b * x;
}
return g;
}
LL calc(LL a, LL b, LL A, LL B) {
LL c = A - B;
if (c % gcd(a, b) != 0)
return inf;
LL x = 0, y = 0;
LL g = exgcd(a, b, x, y);
x *= c / g;
y *= c / g;
LL ans = inf;
LL p = ceil(1.0 * -B / a), q = ceil(1.0 * A / b);
LL bb = b / g;
LL t1 = ceil(1.0 * (p - x) / bb);
x += t1 * bb;
return x * a + B;
}
void dfs(int k)
{
if(!k)return;
int x=1;
x++;
dfs(k-1);
}
int main() {
cin >> T;
int ccc = 0;
for (int i = 1;i <= T;i++)
ccc++;
while (T--) {
cin >> x >> y >> p >> q;
ans = inf;
for (LL a = p; a < p + q; a++)
for (LL b = x; b < x + y; b++) {
ans = min(calc(2 * (x + y), (p + q), a, b), ans);
}
if (ans == inf)
cout << "infinity" << endl;
else
cout << ans << endl;
}
dfs(1000);
return 0;
}
| #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
class UnionFind {
int cnt;
vector<int> par, rank, size;
public:
UnionFind() {}
UnionFind(int _n) :cnt(_n), par(_n), rank(_n), size(_n, 1) {
for (int i = 0; i<_n; ++i) par[i] = i;
}
int find(int k) {
return (k == par[k]) ? k : (par[k] = find(par[k]));
}
int operator[](int k) {
return find(k);
}
int getSize(int k) {
return size[find(k)];
}
void unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return;
--cnt;
if (rank[x] < rank[y]) {
par[x] = y;
size[y] += size[x];
} else {
par[y] = x;
size[x] += size[y];
if (rank[y] == rank[x]) ++rank[x];
}
}
int count() {
return cnt;
}
};
void solve() {
int N;
cin >> N;
vi X(N), Y(N);
rep(i, N) cin >> X[i] >> Y[i];
double ng = 100, ok = 0;
rep(ITER, 60) {
UnionFind uf(N + 2);
double r = (ng + ok) / 2;
rep(i, N) {
if (100 - Y[i] < 2 * r)uf.unite(i, N);
if (Y[i] + 100 < 2 * r)uf.unite(i, N + 1);
rep(j, i) {
if (hypot(X[i] - X[j], Y[i] - Y[j]) < 2 * r) {
uf.unite(i, j);
}
}
}
(uf[N] == uf[N + 1] ? ng : ok) = r;
}
cout << ok << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
#define all(x) (x).begin(), (x).end()
#define each(x, a) for (auto& x : a)
#define rep(i, b, e) for (int i=(b); i<(e); ++i)
#define repi(i, b, e, c) for (int i=(b); (c)>0?i<(e):i>(e); i+=(c))
#define vt vector
#define sz(x) (int)(x).size()
void solve() {
int n, q, t, a, b;
string s;
cin >> n >> s >> q;
bool f = false;
rep(i, 0, q) {
cin >> t >> a >> b;
if (t == 1) {
--a;
--b;
if (f) {
a = (a+n)%(2*n);
b = (b+n)%(2*n);
}
swap(s[a], s[b]);
}
if (t == 2) f = !f;
}
if (f) {
s = s.substr(n) + s.substr(0, n);
}
cout << s << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define LL long long
#define LD long double
#define y1 ___y1
#define next ___next
#define left ___left
#define right ___right
#define pii pair<int, int>
#define pll pair<LL, LL>
#define vi vector<int>
#define vl vector<LL>
#define vii vector<pii>
#define vll vector<pll>
#define PQ priority_queue
#define ffo fflush(stdout)
#define gch getchar()
#define e (int)(1e9 + 7)
#define ri(X) scanf("%d", &(X))
#define rii(X, Y) scanf("%d%d", &(X), &(Y))
#define riii(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define rl(X) scanf("%lld", &(X))
#define rll(X, Y) scanf("%lld%lld", &(X), &(Y))
#define rlll(X, Y, Z) scanf("%lld%lld%lld", &(X), &(Y), &(Z))
#define printi(X) printf("%d", (int)(X))
#define printii(X, Y) printf("%d %d", (int)(X), (int)(Y))
#define printiii(X, Y, Z) printf("%d %d %d", (int)(X), (int)(Y), (int)(Z))
#define printl(X) printf("%lld", (LL)(X))
#define printll(X, Y) printf("%lld %lld", (LL)(X), (LL)(Y))
#define printlll(X, Y, Z) printf("%lld %lld %lld", (LL)(X), (LL)(Y), (LL)(Z))
#define enter printf("\n")
#define space printf(" ")
struct node {
int x, y;
bool operator < (const node &T) const {
return x < T.x;
}
};
LL power(LL a, LL p) {
if (p == 0) return 1;
if (p == 1) return a;
LL tmp = power(a, p / 2);
if (p % 2) tmp = tmp * tmp % e * a;
else tmp *= tmp;
return tmp % e;
}
int hp, heap[1005];
void heap_push(int x) {
heap[++hp] = x;
int p = hp;
while (p > 1 && heap[p / 2] > x) {
heap[p] = heap[p / 2];
heap[p / 2] = x;
p /= 2;
}
return;
}
int heap_top() {
if (hp == 0) return -1;
return heap[1];
}
int heap_pop() {
if (hp == 0) return -1;
int re = heap[1];
heap[1] = heap[hp];
hp--;
int p = 1, tmp;
while (1) {
if (p * 2 > hp) break;
if (p * 2 == hp) {
if (heap[p * 2] < heap[p]) {
tmp = heap[p * 2];
heap[p * 2] = heap[p];
heap[p] = tmp;
}
break;
}
if (heap[p] > heap[p * 2] && heap[p * 2 + 1] >= heap[p * 2]) {
tmp = heap[p * 2];
heap[p * 2] = heap[p];
heap[p] = tmp;
p *= 2;
}
else if (heap[p] > heap[p * 2 + 1] && heap[p * 2] >= heap[p * 2 + 1]) {
tmp = heap[p * 2 + 1];
heap[p * 2 + 1] = heap[p];
heap[p] = tmp;
p = p * 2 + 1;
}
else break;
}
return re;
}
int T;
char s[500005];
int bb;
void solve() {
int n, q, t, a, b;
bb = 0;
scanf("%d\n%s", &n, s + 1);
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
scanf("%d%d%d", &t, &a, &b);
if (t == 1) {
if (bb) {
if (a <= n) a += n;
else a -= n;
if (b <= n) b += n;
else b -= n;
char c = s[a];
s[a] = s[b];
s[b] = c;
}
else {
char c = s[a];
s[a] = s[b];
s[b] = c;
}
}
else {
bb = 1 - bb;
}
}
if (bb) {
for (int i = n + 1; i <= 2 * n; i++) {
printf("%c", s[i]);
}
for (int i = 1; i <= n; i++) {
printf("%c", s[i]);
}
}
else {
for (int i = 1; i <= n; i++) {
printf("%c", s[i]);
}
for (int i = n + 1; i <= 2 * n; i++) {
printf("%c", s[i]);
}
}
enter;
return;
}
int main() {
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
typedef pair<int,int> pii;
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
#define x first
#define y second
const int N = 105,MOD = 1e9+7;
pii edges[N * N];
int deg[N];
struct Mat
{
int c[N][N];
Mat()
{
memset(c,0,sizeof c);
}
Mat operator*(const Mat& r) const
{
Mat res;
forn(i,1,N - 1) forn(j,1,N - 1) forn(k,1,N - 1) res.c[i][j] = (res.c[i][j] + 1ll*c[i][k] * r.c[k][j] % MOD) % MOD;
return res;
}
void operator*(int r)
{
forn(i,1,N - 1) forn(j,1,N - 1) c[i][j] = 1ll*c[i][j] * r % MOD;
}
};
Mat qpow(Mat a,int b,int MOD)
{
Mat res;forn(i,1,N - 1) res.c[i][i] = 1;
while(b)
{
if(b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int qpow(int a,int b,int MOD)
{
int res = 1;
while(b)
{
if(b & 1) res = 1ll * res * a % MOD;
a = 1ll * a * a % MOD;
b >>= 1;
}
return res;
}
int main()
{
// freopen("D://OJCodes//TTT//in.txt","r",stdin);
// freopen("D://OJCodes//TTT//out.txt","w",stdout);
int n,m,k;scanf("%d%d%d",&n,&m,&k);
Mat f,B;forn(i,1,n) scanf("%d",&f.c[1][i]);
forn(i,1,m)
{
int u,v;scanf("%d%d",&u,&v);
++deg[u];++deg[v];
edges[i] = {u,v};
}
int m_2fact = qpow(m * 2,MOD - 2,MOD);
forn(i,1,m)
{
int u = edges[i].x,v = edges[i].y;
B.c[u][v] = m_2fact;
B.c[v][u] = m_2fact;
}
forn(i,1,n) B.c[i][i] = (2 * m - deg[i]) * 1ll * m_2fact % MOD;
B = qpow(B,k,MOD);
f = f * B;
forn(i,1,n) printf("%d\n",f.c[1][i]);
// fclose(stdin);
// fclose(stdout);
return 0;
}
| #include <iostream>
#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define vi vector<int>
#define vii vector<pair<int,int>>
#define pb push_back
using namespace std;
using ll = long long;
const ll mod = 1e9+7;
ll fac[1000001];
void pre(){
fac[0]=fac[1]=1;
for(int i=2;i<=1000001;i++)
{
fac[i]=(fac[i-1]*1LL*i)%mod;
}
}
ll binpower(ll a,ll n){
ll res=1;
while(n){
if(n%2)
res = (res*1LL*a)%mod;
n/=2;
a=(a*1LL*a)%mod;
}
return res;
}
ll nCrmod(ll n,ll r){
ll res= fac[n];
res = (res*1LL*binpower(fac[r],mod-2))%mod;
res= (res*1LL*binpower(fac[n-r],mod-2))%mod;
return res;
}
long long ncr(int n, int r) {
if(r > n - r) r = n - r; // because C(n, r) == C(n, n - r)
long long ans = 1;
int i;
for(i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
}
return ans;
}
ll modexp(ll a,ll b,ll m){
if(b==0)return 1;
if(b%2==0){
ll y = modexp(a,b/2,m);
return (y*y)%m;
}
else{
return ((a%m)*modexp(a,b-1,m))%m;
}
}
ll modinv(ll a,ll m){
return modexp(a,m-2,m);
//works only for prime m.
//else calculate phi(m)-1.
}
void SieveOfEratosthenes(ll n)
{
// Create a boolean array "prime[0..n]" and initialize
// all entries it as true. A value in prime[i] will
// finally be false if i is Not a prime, else true.
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (ll p=2; p*p<=n; p++)
{
// If prime[p] is not changed, then it is a prime
if (prime[p] == true)
{
// Update all multiples of p greater than or
// equal to the square of it
// numbers which are multiple of p and are
// less than p^2 are already been marked.
for (ll i=p*p; i<=n; i += p)
prime[i] = false;
}
}
// Print all prime numbers
for (ll p=2; p<=n; p++)
if (prime[p])
cout << p << " ";
}
vector<int> Centroid(vector<int>g[],int n) {
vector<int> centroid;
vector<int> sz(n+1);
function<void (int, int)> dfs = [&](int u, int prev) {
sz[u] = 1;
bool is_centroid = true;
for (auto v : g[u]) if (v != prev) {
dfs(v, u);
sz[u] += sz[v];
if (sz[v] > n / 2) is_centroid = false;
}
if (n - sz[u] > n / 2) is_centroid = false;
if (is_centroid) centroid.push_back(u);
};
dfs(1, 0);
return centroid;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll s=0;
ll n;
cin>>n;
for(int i=1;i>0;i++){
s+=i;
if(s>=n){
cout<<i;
break;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i;
cin>>n;
std::vector<ll> v1;
std::vector<ll> v2;
ll x;
for(i=0;i<n;i++)
{
cin>>x;
v1.push_back(x);
}
for(i=0;i<n;i++)
{
cin>>x;
v2.push_back(x);
}
ll sum=0;
for(i=0;i<n;i++)
{
sum=sum+v1[i]*v2[i];
}
if(sum==0)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
cout<<"\n";
}
// 0 1 2 3 4 5 6 7 8 9
// 11 12 13
/*case 1:
61523
3210
dth 3rd
2000-2999,12000-12999,22000-22999,32000-32999,42000-42999, 52000-52999
200-299,1200-1299
61523 round down 60000 roundup 70000
123 roudn down 100
case 2: if(value>2)
63326
2000-2999,12000-12999, 52000-52999,62000-62999
0-70000
case 3: if(value==2)
62326
2000-2999,12000-12999,22000-22999,32000-32999,42000-42999, 52000-52999, 62000-62326
10^d+1*/ | ///////////////////////////////
/// Let's Get AC!!! ///
///////////////////////////////
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int n,a[10000];
cin >> n;
int ans=0;
for(int i=0;i<n;i++){
cin >> a[i];
if(a[i]>10){
ans+=a[i]-10;
}
}
cout << ans << endl;
} |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <math.h>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
#include <time.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
#define INF 1000000000000000000
#define MAX 200001
#define PI 3.141592653589793
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
const ll MOD = 998244353;
/*clock_t start = clock();
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;
printf("%lf", time);*/
template <typename T > inline string toString(const T &a) {ostringstream oss; oss << a; return oss.str();};
int main(){
int N;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A[i];
int ans = 0;
int GCD = 0;
for(int i = 2; i <= 1000; i++){
int cnt = 0;
rep(j,N){
if(A[j] % i == 0){
cnt++;
}
}
if(GCD < cnt){
ans = i;
GCD = cnt;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll m,h;cin >> m >>h;
if(h%m)cout << "No" <<endl;
else cout << "Yes" <<endl;
} |
# include <cstdio>
namespace Main {
namespace Source {
typedef unsigned int uint;
static inline const uint qpow(uint b, uint e, const uint mod) {
uint r(1);
while (e) {
if (e bitand 1) r = 1ull * r * b % mod;
b = 1ull * b * b % mod, e >>= 1;
}
return r;
}
}
using namespace Source;
static const uint P(998244353);
static uint n, m, k;
static uint ans;
static inline const void main() {
scanf("%u%u%u", &n, &m, &k);
if (n == 1 and m == 1) return (const void)printf("%u\n", k);
if (n == 1) {
for (register uint i(1); i <= k; ++i)
ans =
(ans + (qpow(k - i + 1, m, P) + P - qpow(k - i, m, P))) % P;
goto end;
}
if (m == 1) {
for (register uint i(1); i <= k; ++i)
ans =
(ans + (qpow(i, n, P) + P - qpow(i - 1, n, P))) % P;
goto end;
}
for (register uint i(1); i <= k; ++i)
ans = (ans + 1ull * (qpow(i, n, P) + P - qpow(i - 1, n, P)) * qpow(k - i + 1, m, P)) % P;
end:printf("%u\n", ans);
}
}
signed int main() { Main::main(); return 0; } |
// Problem : D - Sky Reflector
// Contest : AtCoder - AtCoder Regular Contest 113
// URL : https://atcoder.jp/contests/arc113/tasks/arc113_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 998244353
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; i++)
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define w(x) int x; cin>>x; while(x--)
using namespace std;
const long long N=100005, INF=2000000000000000000;
int power(int a, int b, int p)
{
if(a==0)
return 0;
int res=1;
a%=p;
while(b>0)
{
if(b&1)
res=(res*a)%p;
b>>=1;
a=(a*a)%p;
}
return res;
}
vi prime;
bool isprime[N];
void pre()
{
for(int i=2;i<N;i++)
{
if(isprime[i])
{
for(int j=i*i;j<N;j+=i)
isprime[j]=false;
prime.pb(i);
}
}
return;
}
bool isPrime(int n)
{
// Corner cases
if (n <= 1)
return false;
if (n <= 3)
return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int spf[N+1];
void spfFun(){
for(int i=0;i<=N;i++) spf[i]=i;
for(int i=2;i*i<=N;i++){
if(spf[i]==i){
for(int j=i*i;j<=N;j+=i){
spf[j] = min(spf[j],i);
}
}
}
}
bool isPerfectSquare(long double x)
{
// Find floating point value of
// square root of x.
long double sr = sqrt(x);
// If square root is an integer
return ((sr - floor(sr)) == 0);
}
void print(bool n){
if(n){
cout<<"YES";
}else{
cout<<"NO";
}
}
int32_t main()
{
IOS;
// pre();
// fill(isprime,true);
int n,m,k;
cin>>n>>m>>k;
int ans=0;
for(int i=1;i<=k;i++){
int p = (power(i,n,mod)-power(i-1,n,mod)+mod)%mod;
int q;
if(m==1||n==1)
q = (power(k-i+1,m,mod)-power(k-i,m,mod)+mod)%mod;
else
q = power(k-i+1,m,mod);
ans+=(p*q)%mod;
ans%=mod;
}
cout<<ans;
} |
#include <iostream>
using namespace std;
int main(void)
{
int x, y;
cin >> x >> y;
int result = abs(x - y);
if (result < 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int fact(int a){
int b=1;
for(int i=2;i<=a;i++){
b*=i;
}
return b;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;
cin>>n>>m;
cout<<n/m<<endl;
return 0;
} |
/*
ALLAH IS ALMIGHTY ******BISMILLAHIR RAHMANIR RAHIM.****** ALLAH IS ALMIGHTY
```````````````````````````````
AUTHOR: ANISUR RAHAMAN
BSMRSTU(SHIICT)
ID:017
............LET's START OUR JOURNEY.............
*/
#include <bits/stdc++.h>
#define I_O ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//~~~~~~~~~~~~ Sort Form Of Long~~~~~~~~~~~//
#define ll long long int
#define lls int64_t
#define ld long double
#define db double
#define ull unsigned long long int
//~~~~~~~~~~~~~~Pair~~~~~~~~~~~~~~~~~~//
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<db,db>
#define psi pair<string,int>
#define vi vector<int>
#define vl vector<ll>
#define vd vector<db>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pi>
#define vpl vector<pl>
#define vpd vector<pd>
#define vpsi vector<psi>
//~~~~~~~~~~~~~~Vector~~~~~~~~~~~~~~~~~//
#define pb push_back
#define pf push_front
#define MP make_pair
#define in insert
#define ff first
#define ss second
#define al(v) v.begin(),v.end()
#define alr(v) v.rbegin(), v.rend()
#define srt(v) sort(al(v))
#define srtr(v) sort(al(v), greater<int>());
#define len(x) ((ll)(x).length())
#define sz(x) ((ll)(x).size())
#define rev(v) reverse(al(v))
#define btcnt(n) __builtin_popcount(n)
#define acl(v, n) accumulate(al(v), n)
#define eb emplace_back
#define lb(v, kk) lower_bound(al(v), kk)
#define ub(v, kk) upper_bound(al(v), kk)
#define tpu(str) transform(al(str), str.begin(), ::toupper)
#define tpl(str) transform(al(str), str.begin(), ::tolower)
#define cignr cin.ignore(numeric_limits<streamsize>::max(), '\n');
#define mxv(v) *max_element(al(v))
#define mnv(v) *min_element(al(v))
const int MOD = 1e9 + 7;
const ll INF = 2e18;
const int mxn = 2e9 + 9;
const int mxd = 2e5 + 5;
//~~~~~~~~~~~~~~~~~~Function~~~~~~~~~~~~~~~~~~~~//
lls gcd(lls a, lls b){
if(b == 0LL) return a;
return gcd(b, a % b);
}
lls lcm(lls a, lls b){
return (a / gcd(a, b) * b);
}
//~~~~~~~~~~~~~~~Loops and Short~~~~~~~~~~~~~~~~//
#define PI acos(-1)
#define C continue
#define B break
#define off return 0
#define N '\n'
#define WT(something) auto az = something; cout << az << N;
#define WTS(something) cout << something << N;
#define rep(i, n) for(lls i = 0; (lls)i < n; i++)
#define repn(i, a, b) for(lls i = (lls)(a); i < (lls)(b); i++)
#define repr(i, a, b) for(lls i = (lls)(a) - 1; i >= (lls)(b); i--)
#define test_case() int T; cin >> T; while(T--)
using namespace std;
void SoLuTioN()
{
lls l, r;
cin >> l >> r;
lls ka = (r - 2 * l + 1);
if (ka <= 0)
cout << "0" << N;
else cout << (lls)((ka * (ka + 1)) / 2) << N;
}
int main()
{
I_O
test_case()
{
SoLuTioN();
}
off;
}
| //#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
//#pra gma G CC opti mize(3)
using namespace std;
using std::bitset;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
template<class T>
inline void read(T &x) {
x=0;
bool fu=0;
char ch=0;
while(ch>'9'||ch<'0') {
ch=getchar();
if(ch=='-')fu=1;
}
while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
if(fu)x=-x;
}
inline int read() {
int x=0;
bool fu=0;
char ch=0;
while(ch>'9'||ch<'0') {
ch=getchar();
if(ch=='-')fu=1;
}
while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
return fu?-x:x;
}
char _n_u_m_[40];
template<class T>
inline void write(T x ) {
if(x==0) {
putchar('0');
return;
}
T tmp = x > 0 ? x : -x ;
if( x < 0 ) putchar('-') ;
register int cnt = 0 ;
while( tmp > 0 ) {
_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
tmp /= 10 ;
}
while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
}
template<class T>
inline void write(T x ,char ch) {
write(x);
putchar(ch);
}
}
using namespace fastIO;
bool ok[1<<18],ed[19][19];
int dp[1<<18],n;
int main() {
memset(dp,0x3f,sizeof(dp));
cin>>n;
F(i,1,read()) {
ri t1=read(),t2=read();
t1--,t2--;
ed[t1][t2]=ed[t2][t1]=1;
}
F(S,1,(1<<n)-1) {
F(i,0,n-1)if(S&(1<<i))F(j,i+1,n-1) if(S&(1<<j)){
if(!ed[i][j])goto fuckccf;
}
ok[S]=1;
n;
fuckccf:
n;
}dp[0]=0;
F(i,1,(1<<n)-1){
for(ri j=i;j;j=(j-1)&i){
if(ok[j])dp[i]=min(dp[i],dp[i^j]+1);
}
}cout<<dp[(1<<n)-1];
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <set>
#include <cstring>
#include <queue>
#include <map>
#include <cmath>
#define aldgebu return
#define ff first
#define sc second
#define pb push_back
#define pii pair <int,int>
#define ll long long int
#define pll pair<ll,ll>
#define plc pair<ll,char>
#define ull unsigned long long
using namespace std;
const int inf = 1e9;
const int mod = 1000000007;
void Dontfuckedup(){
string s;
cin >> s;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++){
if (s[i] == '0' || s[i] == '1' || s[i] == '8')continue;
if (s[i] == '6'){
s[i] = '9';
continue;
}
if (s[i] == '9')
s[i] = '6';
}
cout << s;
}
int32_t main () {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1; //cin>>T;
while (T--)Dontfuckedup();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
constexpr int N = 1e5 + 5;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
string s;
cin >> s;
cout << s[1] << s[2] << s[0] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vec;
using Graph = vector<vector<int>>;
const long long INF = 1LL<<60;
const long long MOD = 1000000007;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long double a,b;cin>>a>>b;
b=a-b;
long double ans=100*(b/a);
cout<<fixed<<setprecision(15)<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
double a,b;
cin>>a>>b;
cout<<(a-b)/a*100;
} |
using namespace std;
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define nl "\n"
#define forf(i,a,n) for(ll i=a;i<=n;i++)
#define forb(i,b,n) for(ll i=b;i>=n;i--)
#define pb push_back
#define vll vector<ll>
#define all(qw) qw.begin(),qw.end()
#define read(vec) ll qwe;cin>>qwe;vec.pb(qwe)
#define pll pair<ll,ll>
#define vpll vector<pll>
#define ff first
#define ss second
#define mp make_pair
#define sll set<ll>
#define inset(sett) ll qwer;cin>>qwer;sett.insert(qwer);
ll hcf(ll a, ll b)
{
if (b==0)return a;
return hcf(b, a % b);
}
ll lcm(ll a,ll b)
{
return (a*b)/hcf(a,b);
}
bool isprime(ll n) {
if(n==1) return false;
for (ll i=2;i*i<=n;++i){if(n%i==0) return false;}
return true;
}
void onlinejudge(){
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
//SOLVE
void solve(){
ll n;
cin>>n;
ll k;
cin>>k;
ll a=1000000000;
ll b=-1000000000;
forf(i,1,n){
if(i==n){
cout<<a<<" ";
break;
}
cout<<i<<" ";
a-=i;
}
forf(i,1,k){
if(i==k){
cout<<b<<" ";break;
}
cout<<-i<<" ";
b+=i;
}
cout<<nl;
}
int main(){ // Change the approach
//onlinejudge();
//fastio
ll ttt;ttt=1;
//cin>>ttt;
while(ttt--) solve();
return 0;
}
// CHECK FOR EXTREME CASES AND ZEROS;
| #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
int main(){
int a,b;
cin>>a>>b;
if(a==b){
for(int i=1;i<=a;i++) cout<<i<<" ";
for(int i=1;i<=a;i++) cout<<(-1)*i<<" ";
}
else {
if(a>b){
for(int i=1;i<=a;i++) cout<<i<<" ";
int remaining = 0;
for(int i=1;i<=a;i++) {
if(i>=b){
remaining += i;
}
else cout<<(-1)*i<<" ";
}
cout<<(-1)*remaining<<endl;
}
else{
if(a<b){
for(int i=1;i<=b;i++) cout<<(-1)*i<<" ";
int remaining = 0;
for(int i=1;i<=b;i++) {
if(i>=a){
remaining += i;
}
else cout<<i<<" ";
}
cout<<remaining<<endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, b); }
template <class T>
inline void chmax(T &a, const T &b) { a = max(a, b); }
template <class T>
inline bool kbit(const T &x, const int &k) { return ((x >> k) & 1LL); }
inline int popcount(const int &n) { return __builtin_popcount(n); }
inline ll popcountll(const ll &n) { return __builtin_popcountll(n); }
inline ll mask(const ll &k) { return (1LL << k) - 1LL; }
template <class T>
void zip(V<T> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
template <class T>
int lwb(V<T> &v, const T &x) { return lower_bound(all(v), x) - v.begin(); }
template <class T>
int upb(V<T> &v, const T &x) { return upper_bound(all(v), x) - v.begin(); }
void dump() {
cerr << '\n';
}
template <class Head, class... Tail>
void dump(Head &&head, Tail &&...tail) {
cerr << head << (sizeof...(Tail) == 0 ? " " : ", ");
dump(std::move(tail)...);
}
template <class T>
void print(const vector<T> &v) {
for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
template <class T>
void read(vector<T> &v) {
for (int i = 0; i < v.size(); i++) cin >> v[i];
}
constexpr char sp = ' ', newl = '\n';
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
constexpr ll INF = (1LL << 60) - 1LL;
constexpr ll MOD = 1e9 + 7;
//////////////////////////////////////////////INSERT ABOVE HERE
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
V<ll> p = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
V<int> c(b - a + 1);
for (ll i = a; i <= b; i++) {
for (int j = 0; j < p.size(); j++) {
if (i % p[j] == 0) {
c[i - a] |= (1 << j);
}
}
}
int n = b - a + 1;
V<V<ull>> dp(n + 1, V<ull>(1 << 20));
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << 20); j++) {
dp[i + 1][j] += dp[i][j];
if ((j & c[i]) == 0) {
dp[i + 1][j | c[i]] += dp[i][j];
}
}
}
ull res = 0;
for (int j = 0; j < (1 << 20); j++) {
res += dp[n][j];
}
cout << res << newl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int N, M, X;
cin >> N >> M;
vector<bool> A(1001, false), B(1001, false);
rep(i, N) {
cin >> X;
A[X] = true;
}
rep(i, M) {
cin >> X;
B[X] = true;
}
rep(i, 1001) {
if (A[i] ^ B[i]) cout << i << " ";
}
cout << "\n";
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1000000007;
int a[3005],s[3005],sum[3005][3005],dp[3005][3005];
signed main()
{
int n,i,j,ans=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
s[i]=s[i-1]+a[i];
}
for(i=1;i<=n;i++)
{
for(j=i;j>1;j--)
{
dp[i][j]=sum[j][s[i]%j];
sum[j+1][s[i]%(j+1)]=(sum[j+1][s[i]%(j+1)]+dp[i][j])%mod;
}
dp[i][1]=1;
sum[2][s[i]&1]++;
sum[2][s[i]&1]%=mod;
}
for(i=1;i<=n;i++)
ans=(ans+dp[n][i])%mod;
cout<<ans;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1001001001;
const long long LINF = 1001002003004005006;
const double PI = acos(-1);
int d4r[] = {1, 0, -1, 0};
int d4c[] = {0, 1, 0, -1};
int d8r[] = {1, 1, 0, -1, -1, -1, 0, 1};
int d8c[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n; cin >> n;
vector<int> to(n);
for(int i = 0;i < n;++i) {
cin >> to[i];
to[i]--;
}
vector<int> v(n, 0);
for(int i = 0;i < n;++i) {
if(v[i] != 0) {
continue;
}
vector<int> memo;
memo.push_back(i);
set<int> st;
st.insert(i);
int cnt = 1;
int nowv = i;
bool flag = true;
while(cnt == st.size()) {
nowv = to[nowv];
if(v[nowv] != 0) {
flag = false;
if(v[nowv] == -1) {
for(int j : memo) {
v[j] = -1;
}
}
else if(v[nowv] == 1 || v[nowv] == 2) {
for(int j : memo) {
v[j] = -1;
}
}
break;
}
st.insert(nowv);
memo.push_back(nowv);
// cout << 1 << '\n';
cnt++;
}
if(flag == false) {
continue;
}
int leader = INF;
for(int j : memo) {
leader = min(leader,j);
v[j] = 1;
}
v[leader] = 2;
}
int y = 0;
for(int i = 0; i < n;++i) {
if(v[i] == 2) {
y++;
}
}
long long ans = 1;
for(int i = 0;i < y;++i) {
ans *= 2;
ans %= 998244353;
}
ans--;
cout << ans % 998244353 << '\n';
return 0;
} |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>
#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
using ld = long double;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mod 1000000007
using namespace std;
void solve(){
string s;
cin >> s;
int n = s.size();
if(s > "atcoder"){
cout << "0\n";
return;
}
rep(i, n) if(s[i] != 'a'){
if(s[i] > 't') cout << max(i - 1, 0) << "\n";
else cout << i << "\n";
return;
}
cout << "-1\n";
}
int main(){
int t;
cin >> t;
rep(i, t) solve();
} | /// kazuki08
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long long ll;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
#define ar array
//#define inf 1000000000
#define mod 1000000007
#define dmp(x) cerr<<"line "<<__LINE__<<" "<<#x<<":"<<x<<endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define mt make_tuple
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
o<<"{";
for(const T& v:vc) o<<v<<",";
o<<"}";
return o;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
string s,t="atcoder";
int n;
int match(int x){
if(x==0){
int res = mod;
for(int j=0;j<s.size();j++){
if(s[j]>'a')return j;
}
return res;
}
int done[n+1]={0};
int res = 0;
for(int i=0;i<x;i++){
int cnt = 0;
bool f = false;
for(int j=0;j<s.size();j++){
if(done[j])continue;
if(s[j]==t[i]){
done[j]=1;
res+=cnt;
f = true;
break;
}
cnt++;
}
if(!f)return mod;
}
if(x<t.size()){
bool f = false;
int cnt = 0;
for(int j=0;j<s.size();j++){
if(done[j])continue;
if(t[x]<s[j]){
res+=cnt;
f = true;
break;
}
cnt++;
}
if(!f)return mod;
}
else {
if(s.size()>x)return res;
else return mod;
}
return res;
}
signed main(){
IOS;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int T;
cin >> T;
while(T--){
cin >> s;
n = s.size();
int ans = mod;
for(int i=0;i<=t.size();i++){
ans = min(ans,match(i));
// cerr << i << " " << ans << endl;
}
if(ans>=mod){
ans = -1;
}
cout << ans << endl;
}
return 0;
}
///....
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define all(a) (a).begin(),(a).end()
#define sz(x) (ll)x.size()
#define endl '\n'
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b)) / gcd((a),(b))
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define rep(i, begin, end) for (int i=begin;i<end;i++)
#define repd(i, begin, end) for (int i=end-1;i>=begin;i--)
#define ini(a,n,b) for(ll int i=0;i<n;i++) a[i]=0;
#define cset(a) __builtin_popcountll(a)
#define hell 1000000007
#define re resize
const int INF=1e18;
const int N=300005;
int powm(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
res=(res*a)%M;
a=(a*a)%M;
b>>=1;
}
return res;
}
int pow(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
res=(res*a);
a=(a*a);
b>>=1;
}
return res;
}
signed main(void)
{ios
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);freopen("answer.txt", "w", stdout);
#endif
int n,w;
cin>>n>>w;
vi a(2e5+5,0),b(2e5+5,0);
rep(i,1,n+1)
{
int x,y,c;
cin>>x>>y>>c;
a[x]+=c;
b[y]+=c;
}
int f=1;
rep(i,0,2e5+5)
{
if(i>0)
a[i]=a[i]+a[i-1];
}
rep(i,0,2e5+5)
{
if(i>0)
b[i]=b[i]+b[i-1];
}
rep(i,0,2e5+5)
{
int k=a[i]-b[i];
if(w<k) {f=0;break;}
}
if(f) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, w;
cin >> n >> w;
vector<ll> imos(2e5 + 10, 0);
for (int i = 0; i <n; i++) {
ll s, t, p;
cin >> s >> t >> p;
imos.at(s) += p;
imos.at(t) -= p;
}
for (int i = 1; i < 2e5 + 10; i++) imos.at(i) += imos.at(i - 1);
bool ok = true;
for (int i = 0; i < 2e5 + 10; i++) {
if (imos.at(i) > w) ok = false;
}
if (ok) cout << "Yes\n";
else cout << "No\n";
} |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b){
return a*b/gcd(a,b);
}
ll Solve(ll n){
ll ans = 1;
for (ll i=2;i<=n;++i){
ans = lcm(i,ans);
}return ans + (ll)1;
}
int main(){
ll n;scanf("%lld",&n);
printf("%lld\n",Solve(n));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S;
bool isReversed = false;
for(int i=0; i<S.size(); i++) {
if(S[i] == 'R') {
isReversed = !isReversed;
} else {
if(!isReversed) {
if(!T.empty() && T[T.size()-1] == S[i]) {
T.erase(T.size()-1);
} else {
T += S[i];
}
} else {
if(!T.empty() && T[0] == S[i]) {
T.erase(0, 1);
} else {
T = S[i] + T;
}
}
}
}
if(isReversed) reverse(T.begin(), T.end());
cout << T << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
#define DEBUG
#if defined DEBUG
#define TRACE( format, ... ) printf( "%d\t" format, __LINE__, __VA_ARGS__ )
#define TRACES( format, ... ) printf( "%d\t:" format, __LINE__)
#else
#define TRACE( format, ... )
#define TRACES( format, ... )
#endif
using namespace std;
using ll = long long;
const ll INF = 1e17;
int main()
{
int N, M;
cin >> N >> M;
vector<vector<pair<int, ll>>> edges(2*N);
for (int i=0; i<M; ++i) {
int A, B, C;
cin >> A >> B >> C;
--A, --B;
edges[A].emplace_back(B, C);
edges[A].emplace_back(B+N, C);
edges[A+N].emplace_back(B+N, C);
}
for (int i=0; i<N; ++i) {
// printf("------%d %d\n", i, N);
priority_queue<pair<ll, int>> pque;
vector<ll> costs(2*N, INF);
pque.emplace(0, i);
int ans = -1;
while (!pque.empty()) {
int now;
ll cost;
tie(cost, now) = pque.top();
pque.pop();
cost *= -1;
// printf("%lld %d\n", cost, now);
if (now == i+N) {
ans = cost;
break;
}
if (cost >= costs[now]) continue;
costs[now] = cost;
for (auto nxt: edges[now]) {
ll next_cost = nxt.second + cost;
if (costs[nxt.first] <= next_cost) continue;
pque.emplace(-next_cost, nxt.first);
}
}
printf("%d\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using ll = long long;
using P = pair<int,int>;
using edge = struct { int to; int cost; };
const int INF = 1e9;
int n,m;
vector<int> a,b,c;
vector<vector<edge>> g;
void solve(int s) {
vector<int> d(n+5, INF);
priority_queue<P, vector<P>, greater<P>> que;
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top(); que.pop();
int v = p.second;
if (d[v] < p.first) continue;
REP(i,g[v].size()) {
edge e = g[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
int ans = INF;
REP(i,n) {
if (d[i] == INF) continue;
for(auto x: g[i]) {
if (x.to == s) {
ans = min(ans, d[i] + x.cost);
}
}
}
cout << (ans == INF ? -1 : ans) << endl;
return;
}
int main() {
cin >> n >> m;
a.resize(m);
b.resize(m);
c.resize(m);
g.resize(n);
REP(i,m) {
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
edge e = { b[i], c[i] };
g[a[i]].emplace_back(e);
}
REP(i,n) solve(i);
return 0;
} |
#include <iostream>
#include <vector>
#include <tuple>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <string>
#include <iomanip>
#include <algorithm>
#define int long long
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
using namespace std;
const int INF = 1e18;
const int MOD = 1e9 + 7;
void fast()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
vector <vector <int>> dp, a;
int get(int i, int j)
{
return abs(a[i][0] - a[j][0]) + abs(a[i][1] - a[j][1]) + max(0ll, a[j][2] - a[i][2]);
}
signed main()
{
fast();
int n;
cin >> n;
a.resize(n, vector <int>(3));
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < 3; ++j)
cin >> a[i][j];
}
dp.resize(1 << n, vector <int>(n, INF));
for (int i = 1; i < n; ++i)
{
dp[1 << i][i] = get(0, i);
}
for (int mask = 0; mask < (1 << n); ++mask)
{
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (i == j)
continue;
dp[mask | (1 << j)][j] = min(dp[mask | (1 << j)][j],
dp[mask][i] + get(i, j));
}
}
}
cout << dp[(1 << n) - 1][0] << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
int dp[1<<17][17];
int x[20],y[20],z[20];
int dis[18][18];
int n;
signed main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++)
scanf("%lld%lld%lld",&x[i],&y[i],&z[i]);
for(int i=1;i<=n;i++){
dis[i][i]=0;
for(int j=1;j<=n;j++){
dis[i][j]=abs(x[j]-x[i])+abs(y[j]-y[i])+max(0LL,z[j]-z[i]);
}
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
}
}
}
memset(dp,0x3f,sizeof(dp));
dp[1][0]=0;
for(int i=1;i<1<<n;i++){
for(int j=0;j<n;j++){
if(!(i>>j&1)){
for(int k=0;k<n;k++){
if(i>>k&1){
dp[i|1<<j][j]=min(dp[i|1<<j][j],dp[i][k]+dis[k+1][j+1]);
}
}
}
}
}
int ans=0x3f3f3f3f;
for(int i=0;i<n;i++){
ans=min(ans,dp[(1<<n)-1][i]+dis[i+1][1]);
}
printf("%lld\n",ans);
return 0;
} |
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define T int t, q=0; scanf("%d", &t); while(q++<t)
#define ll long long
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll x,y,z,a=0,b=0,c=0,d=0,sum,ans,total,cnt,n,m,k,p,kase,i;
string s1,s2;
#define N 100001
#define MX 1000000001
vector <ll> v;
map<ll,ll> mp;
set<ll> s;
map<ll,ll> :: iterator itr1, ptr1;
set<ll> :: iterator itr, ptr;
ll tow(ll a, ll b) {
ll ans = 1;
for (int i = 0; i < b; i++) {
ans *= a;
}
return ans;
}
ll lcm(ll a, ll b) {
return (a * b) / __gcd(a, b);
}
//SET PRECIOSION cout << fixed ; cout << setprecision(n) << ans << endl;
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2 && c1 == c2) {
cout << 0;
} else if ((r1 + c1 == r2 + c2) || (r1 - c1 == r2 - c2) || abs(r1 - r2) + abs(c1 - c2) <= 3) {
cout << 1;
} else if (abs(r1 - c1 - r2 + c2) <= 3 || abs(r1 + c1 - r2 - c2) <= 3 || (abs(r1 - r2) + abs(c1 - c2)) % 2 == 0 || abs(r1 - r2) + abs(c1 - c2) <= 6) {
cout << 2;
} else cout << 3;
return 0;
}
// Happy Coding (:
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<ll> vl;
#define pb push_back
#define mk make_pair
#define mod (int)1e9+7
#define inf (ll)1e18
#define endl "\n"
#define vs vector<string>
#define ump unordered_map
#define mp map
#define pq_max priority_queue<ll>
#define pq_min priority_queue<ll,vi,greater<ll> >
#define ff first
#define ss second
#define mid(l, r) (l+(r-l)/2)
#define loop(i, a, b) for(int i = (a); i <= (b); i++)
#define looprev(i, a, b) for(int i = (a); i >= (b); i--)
#define print(arr, a, b) for(int i = (a); i <= (b); i++) cout << arr[i] << " ";
#define scan(arr, a, b) for(int i = (a); i <= (b); i++) cin >> arr[i];
void file_i_o() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main ()
{
file_i_o();
vector<int> v(3);
loop(i, 0, 2) {
cin >> v[i];
}
sort(v.begin(), v.end());
if (v[0] + v[2] == 2 * v[1]) cout << "Yes\n";
else cout << "No\n";
return 0;
} |
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////
int32_t main() {
boost; IO();
int N,M; cin>>N>>M;
vi bad(N,0);
int K; cin>>K;
FOR(i,0,K){
int x; cin>>x;
bad[x]=1;
}
int cnt=0;
FOR(i,0,N){
if(bad[i]) cnt++;
else cnt=0;
if(cnt>=M){
cout << -1 << endl;
return 0;
}
}
ld cur_a=0,cur_b=0; //for the last M elements
V<ld>a(N,0),b(N,0);
ROF(i,0,N){
if(bad[i]){
a[i]=1;
}
else{
a[i]=cur_a/M;
b[i]=cur_b/M+1;
}
cur_a+=a[i];
cur_b+=b[i];
if(i+M<N){
cur_a-=a[i+M];
cur_b-=b[i+M];
}
}
cout << fixed << setprecision(7) << -b[0]/(a[0]-1) << endl;
return 0;
}
//Change your approach | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define lowbit(x) ((x) & -(x))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr double eps = 1e-8;
constexpr int NINF = 0xc0c0c0c0;
constexpr int INF = 0x3f3f3f3f;
constexpr ll mod = 1e9 + 7;
constexpr ll N = 1e6 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll B, C;
cin >> B >> C;
if (B > 0) {
ll L = B - C / 2;
ll R = (C % 2 == 0 ? -(L + 1): -L);
ll l = -B - (C - 1) / 2;
ll r = C % 2 == 0 ? -l : -(l + 1);
r = max(r, B);
ll res = B - L + 1 + R - max(l, B + 1) + 1;
if (L <= 0) {
res = r - l + 1;
} else {
res = R - l + 1 + r - L + 1;
}
cout << res << '\n';
} else {
ll L = B - C / 2;
ll R = (C % 2 == 0 ? -(L + 1): -L);
ll l = max(-B - (C - 1) / 2, B + 1);
ll res = B - L + 1 + R - l + 1;
cout << res << '\n';
}
return 0;
} |
#include <bits/stdc++.h>
#include <vector>
#include <locale>
#include <string>
#include <stdio.h>
#include <math.h>
using namespace std;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
if(a3-a2 == a2-a1) cout << "Yes" << endl;
else if(a2-a3 == a3-a1) cout << "Yes" << endl;
else if(a3-a1 == a1-a2) cout << "Yes" << endl;
else if(a1-a3 == a3-a2) cout << "Yes" << endl;
else if(a2-a1 == a1-a3) cout << "Yes" << endl;
else if(a1-a2 == a2-a3) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define __hh__ ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define all(x) (x).begin(),(x).end()
#define vi vector<int>
#define vl vector<long long>
#define vs vector<string>
#define vd vector<double>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define vvs vector<vector<string>>
#define mii map<int,int>
#define msi map<string,int>
#define rep(i,n) for(int i=0; i<n; i++)
#define repr(i,s,n) for(int i=s; i<n ;i++)
#define repl(i,n) for(ll i=0; i<n; i++)
#define reprl(i,s,n) for(ll i=s; i<n ;i++)
const double PI=3.14159265358979323846;
const int INF=20e8;
const ll INFL=92e12;
int main() {
__hh__
vi v(3);
rep (i, 3) cin >> v[i];
sort(all(v));
bool ans = false;
if (v[1]-v[0]==v[2]-v[1]) ans = true;
cout << (ans ? "Yes" : "No") << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};
const ll INF = (1ll<<62);
// const ld EPS = 1e-10;
// const ld PI = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;
int main(){
ll N, C;
cin >> N >> C;
V<ll> a(N), b(N), c(N);
REP(i, N) cin >> a[i] >> b[i] >> c[i];
V<pll> event;
REP(i, N){
event.emplace_back(a[i], c[i]);
event.emplace_back(b[i]+1, -c[i]);
}
sort(ALL(event));
ll pre = -1, res = 0, now = 0;
for(auto [t, v]: event){
res += min(C, now) * (t - pre);
pre = t;
now += v;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N, C;
vector<pair<ll, ll>> imosu;
int main() {
cin >> N >> C;
imosu.push_back(make_pair(0, 0));
ll a, b, c;
for (int i = 0; i < N; ++i) {
cin >> a >> b >> c;
imosu.push_back(make_pair(a, c));
imosu.push_back(make_pair(b+1, -c));
}
sort(imosu.begin(), imosu.end());
ll answer = 0;
for (int i = 1; i < imosu.size(); ++i) {
answer += min(imosu[i-1].second, C) * (imosu[i].first - imosu[i-1].first);
imosu[i].second += imosu[i-1].second;
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define INF 9999999999999999
#define rep(i,m,n) for(ll i = m;i < n;i++)
#define rrep(i,m,n) for(ll i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define tint tuple<int, int, int>
#define paf(L,R) pair<L,R>
#define mod 1000000007
#define MAX 1000
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, X, res = 0;
cin >> N >> X;
vector<vector<ll>> A(N);
vector<map<ll, ll>> dp(N);
dp[0][X] = 1;
rep(i, 0, N) {
ll a;
cin >> a;
A[0].emplace_back(a);
}
rep(i, 1, N) rep(j, 1, A[i - 1].size()) A[i].emplace_back(A[i - 1][j] / A[i - 1][1]);
rep(i, 1, N) for(auto v : dp[i - 1]) {
if(v.first == 1) continue;
if(v.first % A[i - 1][1]) dp[i][v.first / A[i - 1][1] + 1] += v.second;
dp[i][v.first / A[i - 1][1]] += v.second;
}
rep(i, 0, N) if(dp[i].count(1)) res += dp[i][1] * A[i].size();
for(auto v : dp[N - 1]) if(v.first != 1) res += v.second;
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define endl "\n"
#define pb push_back
#define sq(a) ((a)*(a))
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(a) (a).rbegin(),(a).rend()
#define x first
#define y second
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugv(v) cerr<<#v<<" : "; for(auto x:v) cerr<<x<<' '; cerr<<endl;
#define output(x) cout<<(x ? "YES" : "NO")<<endl;
#define Output(x) cout<<(x ? "Yes" : "No")<<endl;
#define MOD (1000000007)
#define MOD2 (998244353)
#define PI acos(-1)
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll exp(ll x,ll n,ll mod)
{
ll result=1;
while(n)
{
if(n & 1)
result=(result * x)%mod;
x=(x*x)%mod;
n>>=1;
}
return result;
}
const int N = 1001;
ll a[N],b[N];
ll dp[N][N];
ll rec(int n,int m)
{
if(!n || !m)
return (n^m);
if(dp[n][m] != -1)
return dp[n][m];
return dp[n][m] = min({rec(n-1,m-1) + (a[n]!=b[m]), rec(n-1,m) + 1, rec(n,m-1) + 1});
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>b[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
dp[i][j]=-1;
cout<<rec(n,m)<<endl;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long> w(m);
for (int i = 0; i < m; i++) {
cin >> w[i];
}
sort(h.begin(), h.end());
vector<long long> p(n / 2 + 1, 0);
for (int i = 0; i < n - 1; i += 2) {
p[i / 2 + 1] = h[i + 1] - h[i];
p[i / 2 + 1] += p[i / 2];
}
vector<long long> q(n / 2 + 1, 0);
for (int i = 0; i < n - 1; i += 2) {
q[i / 2 + 1] = h[n - i - 1] - h[n - i - 2];
q[i / 2 + 1] += q[i / 2];
}
vector<long long> res(m);
for (int i = 0; i < m; i++) {
int j = distance(h.begin(), lower_bound(h.begin(), h.end(), w[i]));
res[i] = p[j / 2] + q[n / 2 - j / 2] + (j % 2 == 0 ? h[j] - w[i] : w[i] - h[j - 1]);
}
cout << *min_element(res.begin(), res.end()) << endl;
}
| /*
Three things which are very important --
Violence - Speed - Momentum
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define setbits(x) __builtin_popcountll(x)
#define leadzero(x) __builtin_clz(x)
#define trailzero(x) __builtin_ctz(x)
#define bitsparity(x) __builtin_parity(x)
#define mod 1000000007
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
//#define pre(y,x) fixed<<setprecision(y)<<x
#define dbg1(x) cerr << "|" << #x << ": " << (x) << "|\n";
#define dbg2(x,y) cerr << "|" << #x << ": " << (x) << "|" << #y << ": " << (y) << "|\n";
#define dbg3(x,y,z) cerr << "|" << #x << ": " << (x) << "|" << #y << ": " << (y) << "|" << #z << ": " << (z) << "|\n";
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define popb pop_back
#define endl '\n'
#define all(v) v.begin(), v.end()
#define sz(x) ((int)((x).size()))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
ll power(ll a, ll b) {
if(b<0) return 1;
ll res=1;
while(b) {
if(b&1)
res = (res*a)%mod;
a = (a*a)%mod;
b >>= 1;
}
return res;
}
bool ispoweroftwo(ll x){ return (x&&!(x&(x-1)));}
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
const int inf = 1e9;
//integer to char always remember (char+'0')
const double pi = acos(-1);
const ll INF = 1e18;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const int maxN = 2e5+9;
int main() {
FIO;
ll n, m;
cin >> n >> m;
vector<ll> h(n), w(m);
for(int i=0; i<n; ++i) {
cin >> h[i];
}
for(int i=0; i<m; ++i) {
cin >> w[i];
}
sort(all(h));
vector<ll> pre(n+1, 0), suf(n+1, 0);
for(int i=0; i+1<n; i+=2) {
pre[i] = (i==0?0:pre[i-1]) + abs(h[i+1]-h[i]);
pre[i+1] = pre[i];
}
for(int i=n-1; i-1>=0; i-=2) {
suf[i] = (i==n-1?0:suf[i+1]) + abs(h[i]-h[i-1]);
suf[i-1] = suf[i];
}
ll ans=INF;
for(ll i=0; i<m; ++i) {
auto it = lower_bound(all(h), w[i]);
if(it == h.begin()) {
ans = min(ans, suf[1] + abs(h[0]-w[i]));
}
else if(it == h.end()) {
ans = min(ans, pre[n-2] + abs(h[n-1]-w[i]));
}
else {
ll j = it-h.begin();
if(j%2==0) {
ans = min(ans, pre[j-1] + abs(h[j]-w[i]) + suf[j+2]);
}
else {
ans = min(ans, (j-2>=0?pre[j-2]:0) + abs(h[j-1]-w[i]) + suf[j+1]);
}
}
}
cout << ans;
return 0;
}
/*
*/ |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
std::ostream& operator << (std::ostream& dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value<0?-value:value;
char buffer[128];
char* d = std::end(buffer);
do {
-- d;
*d = "0123456789"[tmp%10];
tmp/=10;
}while(tmp!=0);
if(value<0) {
--d;
*d = '-';
}
int len = std::end(buffer)-d;
if (dest.rdbuf()->sputn(d,len)!=len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
void solve() {
ll i,j,k,l,m,n,o,p,q,r,t;
string s;
cin>>s;
l=s.length();
ll ops=0;
ll f[26]={0};
f[s[l-1]-'a']++;
for(i=l-2;i>=0;i--) {
f[s[i]-'a']++;
if(s[i]==s[i+1]) {
ops+=(l-i)-f[s[i]-'a'];
for(j=0;j<26;j++) {
f[j]=0;
}
f[s[i]-'a']=l-i;
}
}
cout<<ops<<endl;
}
int main() {
ll t=1;
while(t--) {
solve();
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
cout<<s[1]<<s[2]<<s[0]<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(false);cin.tie(0);
#define MOD 1000000007
#define ll_MAX 19223372036859
#define endl "\n"
ll fast_expo(ll x,ll p){
if(p==0) return 1;
else if(p%2==0){ ll t=fast_expo(x,p/2)%MOD;return (t*t)%MOD;}
else return (x*(fast_expo(x,p-1))%MOD)%MOD;}
ll invMod(ll num){
return fast_expo(num, MOD - 2)%MOD;
}
int main(){
fast
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t_c; t_c = 1;
// cin >> t_c;
for(ll t_i = 0; t_i < t_c; ++t_i){
ll n, cost; cin >> n >> cost;
vector<pair<pair<ll, ll>, ll>> arr(n);
vector<ll> c(n);
for(ll i = 0; i < n; ++i){
cin >> arr[i].ff.ff >> arr[i].ff.ss >> arr[i].ss;
}
sort(arr.begin(), arr.end());
ll tot = 0, curr = 0, last = 0;
set<pair<pair<ll, ll>, ll>> S;
vector<pair<pair<ll, ll>, ll>> vect;
for(ll i = 0; i < n; ++i){
vect.clear();
for(auto j: S){
if(j.ff.ff < arr[i].ff.ff){
tot += (j.ff.ff - last + 1)*(min(cost, curr));
curr -= j.ff.ss;
last = j.ff.ff + 1;
vect.pb({j});
} else break;
}
for(auto j: vect)
S.erase(j);
tot += (arr[i].ff.ff - last)*(min(cost, curr));
last = arr[i].ff.ff;
S.insert({{arr[i].ff.ss, arr[i].ss}, i});
curr += arr[i].ss;
}
for(auto j: S){
tot += (j.ff.ff - last + 1)*(min(cost, curr));
curr -= j.ff.ss;
last = j.ff.ff + 1;
}
cout << tot << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define gc() getchar()
#define pc(a) putchar(a)
#define int long long
inline int read()
{
int x=0,f=1;
char c=gc();
while(c>'9'||c<'0')
{
if(c=='-') f=-f;
c=gc();
}
while(c>='0'&&c<='9') x=x*10+c-'0',c=gc();
return x*f;
}
int nnu[25];
inline void write(long long x)
{
if(x==0)
{
pc('0');
return;
}
if(x<0) pc('-'),x=-x;
int tp=0;
while(x) nnu[++tp]=x%10,x/=10;
while(tp) pc(nnu[tp--]+'0');
return;
}
#define ma 5000005
int L[ma],R[ma],c[ma];
unordered_map<int,int> mp;
int book[ma],cnt;
inline void ins(int x)
{
if(!mp[x]) book[++cnt]=x,mp[x]=1;
return;
}
inline bool cmp(int x,int y)
{
return x<y;
}
inline int find(int x)
{
int l=1,r=cnt;
while(l<r)
{
int mid=(l+r)>>1;
if(book[mid]>=x) r=mid;
else l=mid+1;
}
return l;
}
int su[ma];
signed main()
{
int n=read(),C=read();
for(int i=1;i<=n;i++) L[i]=read(),R[i]=read(),c[i]=read(),ins(L[i]),ins(R[i]+1);
sort(book+1,book+cnt+1,cmp);
// for(int i=1;i<=n;i++) L[i]=find(L[i]),R[i]=find(R[i]);
for(int i=1;i<=n;i++) su[find(L[i])]+=c[i],su[find(R[i]+1)]-=c[i];
int ans=0;
for(int i=1;i<=cnt;i++) su[i]+=su[i-1];
// for(int i=1;i<=cnt;i++) if(su[i]>C) cout<<"okok\n";
// for(int i=1;i<=cnt;i++) cout<<su[i]<<' ';
// cout<<endl;
// book[0]=
for(int i=1;i<cnt;i++) ans+=min(su[i],C)*(book[i+1]-book[i]);
// for(int i=1;i<=cnt;i++) cout<<book[i]<<' ';
// cout<<endl;
write(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using cd = complex<ld>;
vector<int> primes({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71});
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
vector<ll> dp(1 << primes.size());
ll a, b;
cin >> a >> b;
dp[0] = 1;
for (; a <= b; a++) {
auto dp2 = dp;
int curMask = 0;
for (int i = 0; i < primes.size(); i++) {
if (a % primes[i] == 0) {
curMask |= 1 << i;
}
}
for (int mask = 0; mask < dp.size(); mask++) {
if ((curMask & mask) == 0) {
dp2[curMask | mask] += dp[mask];
}
}
dp = dp2;
}
cout << accumulate(dp.begin(), dp.end(), 0LL);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vector<int>
#define sz size()
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define mem(a, b) memset(a, (b), sizeof(a))
#define clr(a) memset(a, 0, sizeof(a))
#define sqr(x) ( (x) * (x) )
#define all(v) v.begin(), v.end()
typedef pair<int, int> pii;
typedef pair<int,pii> pip;
typedef pair<pii,int> ppi;
typedef pair<pii,pii> ppp;
void base(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ll primes[25] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
ll trans[1200020];
int bit[100];
void solve(){
ll a,b;
cin>>a>>b;
for(ll i=a;i<=b;i++){
for(ll j=0;j<20;j++){
if (i%primes[j] == 0) bit[i-a] |= (1<<j);
}
}
trans[0] = 1;
for(ll i=a;i<=b;i++){
for(ll j=(1<<20)-1; j>=0; j--){
if ((bit[i-a] & j)!= bit[i-a]) continue;
ll bt = j ^ bit[i-a];
trans[j] += trans[bt];
}
}
ll sum = 0;
rep(i,0,(1<<20)) sum+=trans[i];
cout<<sum<<"\n";
}
int main()
{
base();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long double x0,y0,r;
cin>>x0>>y0>>r;
//问题转换为，圆内的点，满足(x-X0)^2+(y-Y0)^2 <= R^2的解中，
// 整数解的个数
//可以固定x，求解y的有效数值
//x的范围：当y=y0时，[x0-r,x0+r];
int xmin = ceil( x0-r );
int xmax = floor( x0+r );
r += 1e-14;
//(y-y0)^2 <= R^2-(x-x0)^2
ll ans = 0;
for( long double x=xmin; x<=xmax; x+=1 )
{
long double tmp = sqrt(r*r-(x-x0)*(x-x0));
long double ymin = ceil(y0-tmp);
long double ymax = floor(y0+tmp);
ans += ymax>=ymin ? (ymax-ymin)+1: 0;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int to_int(string s){
bool f=false;
if(s[0]=='-'){
f=true;
s=s.substr(1);
}
int cnt=4;
int n=s.size();
for(int i=0;i<n;i++){
if(s[i]=='.'){
s=s.substr(0,i)+s.substr(i+1);
cnt-=(n-1-i);
break;
}
}
int res=stoi(s);
for(int i=0;i<cnt;i++){
res*=10;
}
if(f)res*=-1;
return res;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
ll x,y,r;
cin >> s; x=to_int(s);
cin >> s; y=to_int(s);
cin >> s; r=to_int(s);
ll res=0;
constexpr int N=10000;
auto uo=[](ll x)->ll{
if(x<=0){
x-=(N-1);
x+=abs(x)%N;
return x;
}
x-=abs(x)%N;
return x;
};
auto uoo=[](ll x)->ll{
if(x<=0){
x+=abs(x)%N;
return x;
}
x+=(N-1);
x-=abs(x)%N;
return x;
};
for(ll i=-r;i<=r;){
if(abs(y+i)%N!=0){
i++; continue;
}
ll L=0,R=2e9;
while(R-L>1){
ll mid=(L+R)/2;
if(mid*mid+i*i<=r*r){
L=mid;
}
else{
R=mid;
}
}
// cout << i << endl;
ll X=uo(x+L),XX=uoo(x-L);
if(X>=XX)res+=(X-XX)/N+1;
i+=N;
}
cout << res << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define MAX 1000000000
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define sp(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcount(x)
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// powermod(a,b,m) == powermod(a,b%(m-1),m) when m is prime fermat's theorem a^(p-1) %p=1 p is prime
int powermod(int a,int b,int c) // gives (a^b)%c
{
int ans = 1,tempans=a%c;
while(b>0)
{
if(b&1==1)
{
ans=(ans*tempans)%c;
}
tempans=(tempans*tempans)%c;
b=b>>1;
}
return ans;
}
int modinverse(int a,int m) // gives a inverse wrt m and m is prime
{
return powermod(a,m-2,m);
}
// my template m
// prime factorization pf
// ncr and factorials ncr
// matrix exponentiation of fibonacci series in log(n) matexpofib
void buildsegmenttree(int a[],int tree[],int start,int end,int treenode)
{
if(start==end)
{
tree[treenode]=a[start];
return;
}
int mid=(start+end)/2;
buildsegmenttree(a,tree,start,mid,2*treenode);
buildsegmenttree(a,tree,mid+1,end,2*treenode+1);
tree[treenode]=tree[2*treenode]^tree[2*treenode+1];
}
void updatesegmenttree(int a[],int tree[],int start,int end,int treenode,int index,int value)
{
if(start==end)
{
a[index]=value;
tree[treenode]=value;
return;
}
int mid=(start+end)/2;
if(index>mid)
{
updatesegmenttree(a,tree,mid+1,end,2*treenode+1,index,value);
}
else
{
updatesegmenttree(a,tree,start,mid,2*treenode,index,value);
}
tree[treenode]=tree[2*treenode]^tree[2*treenode+1];
}
int query(int tree[],int start,int end,int treenode,int left,int right){
//completely outside the given range
if(start>right||end<left) {
return 0;
}
//completely inside the given range
if(start>=left&&end<=right){
return tree[treenode];
}
//partially inside and partially outside
int mid=(start+end)/2;
int ans1=query(tree,start,mid,2*treenode,left,right);
int ans2=query(tree,mid+1,end,2*treenode+1,left,right);
return ans1^ans2;
}
int32_t main()
{
fast_in_out;
int n,q;cin>>n>>q;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
int tree[4*n]={0};
buildsegmenttree(a,tree,0,n-1,1);
while(q--)
{
int t,x,y;
cin>>t>>x>>y;
if(t==1)
{
updatesegmenttree(a,tree,0,n-1,1,x-1,a[x-1]^y);
}
else
{
int ans = query(tree,0,n-1,1,x-1,y-1);
cout<<ans<<endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937/*_64*/ rng(chrono::steady_clock::now().time_since_epoch().count());
#define printArr(arr, n) cerr << #arr << " = ["; for(int i=0; i<(n); i++){if (i) cerr << ", "; cerr << arr[i];} cerr << "]\n"
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
void _print() {cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll n,x;
cin >> n >> x;
ll a[n];
for (int q = 0; q < n; q++) cin >> a[q];
vector<map<ll,ll>> dp(n);
dp[n-1][x%a[n-1]] = 1;
dp[n-1][(x%a[n-1])-a[n-1]] = 1;
for (int q = n-2; q >= 0; q--)
{
auto it = dp[q+1].begin();
while (it != dp[q+1].end())
{
if (abs((it->first -(x%a[q]))/a[q]) < a[q+1]/a[q]) dp[q][x%a[q]]+=it->second;
if (abs((it->first-(x%a[q])+a[q])/a[q]) < a[q+1]/a[q]) dp[q][(x%a[q])-a[q]]+=it->second;
it++;
}
}
cout << dp[0][0] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
ll MOD=1000000007;
int main(){
ll a,b;
cin>>a>>b;
ll d=b-a;
ll ans=1;
rep2(i,1,d+1){
if(a%i==0&&i*(a/i+1)<=b&&i>ans) ans=i;
else if(a%i!=0&&a<=i*(a/i+1)&&i*(a/i+2)<=b&&i>ans) ans=i;
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define __hh__ ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define all(x) (x).begin(),(x).end()
#define vi vector<int>
#define vl vector<long long>
#define vs vector<string>
#define vd vector<double>
#define vb vector<bool>
#define vc vector<char>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define vvs vector<vector<string>>
#define vvc vector<vector<char>>
#define mii map<int,int>
#define msi map<string,int>
#define rep(i,n) for(int i=0; i<n; i++)
#define repr(i,s,n) for(int i=s; i<n ;i++)
#define repl(i,n) for(ll i=0; i<n; i++)
#define reprl(i,s,n) for(ll i=s; i<n ;i++)
#define print(x) cout << x << "\n"
const double PI=3.14159265358979323846;
const int INF=20e8;
const ll INFL=92e12;
int main() {
__hh__
int n, k;
cin >> n >> k;
int ans = 0;
repr (i, 1, n+1) repr (j, 1, k+1) ans += i*100+j;
cout << ans << "\n";
}
|
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n,m;
vector<ii> v;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>m;
int a,b;
rep(x,0,m){
cin>>a>>b;
v.pub(ii(a,b));
}
sort(all(v),[](ii i,ii j){
return i.fi>j.fi;
});
set<int> s={n};
while (!v.empty()){
set<int> remove;
set<int> add;
int curr=v.back().fi;
while (!v.empty() && v.back().fi==curr){
if (s.count(v.back().se-1) || s.count(v.back().se+1)) add.insert(v.back().se);
else remove.insert(v.back().se);
v.pob();
}
for (auto &it:remove) s.erase(it);
for (auto &it:add) s.insert(it);
//for (auto &it:s) cout<<it<<" "; cout<<endl;
}
cout<<sz(s)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define PI 3.14159265358979323846264338327950288419716939937510
#define mp make_pair
#define vvl vector<vector<ll>>
#define vll vector<ll>
#define vpll vector<pll>
#define vvpll vector<vpll>
typedef pair<string, string> pss;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll inf = 1e18;
ll mod = 1e9 + 7;
ld eps = 1e-9;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll pwr(ll x, ll y)
{
ll res = 1;
x = x ;
while (y > 0)
{
if (y & 1)
res = (res * x) ;
y = y >> 1;
x = (x * x) ;
}
return res;
}
ll modInverse(ll n, ll p)
{
return power(n, p - 2, p);
}
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("temp.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, y, x, z, g, key, h, a, b, c, j, q, n, d, k, l, r, m;
ll t2, t3, t4, t1, t5, t6;
string s, s2, s1;
ll tc;
//cin >> tc;
tc = 1;
while (tc--)
{
cin >> n >> m;
pll arr[m];
map<ll, set<ll>>ma;
for (i = 0; i < m; i++)
{
cin >> arr[i].fi >> arr[i].se;
ma[arr[i].fi].insert(arr[i].se);
}
ll cur = 0;
set<ll>ans;
ans.insert(n);
for (auto u : ma)
{
auto st = u.se;
set<ll>temp;
for (auto v : st)
{
if (ans.find(v - 1) != ans.end())
temp.insert(v);
if (ans.find(v + 1) != ans.end())
temp.insert(v);
}
for (auto v : st)
{
if (ans.find(v) != ans.end())
{
ans.erase(v);
}
}
for (auto v : temp)
ans.insert(v);
}
t1 = ans.size();
cout << t1;
}
return 0;
} |
#include<bits/stdc++.h>
#define x first
#define y second
#define PII pair<int,int>
#define LL long long
using namespace std;
const int N=2010;
int n,m;
int h[N],e[N],ne[N],idx;
int ans;
bool st[N];
void add(int a,int b){
e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
void dfs(int u) {
st[u]=true;
for (int i=h[u];~i;i=ne[i]){
if (!st[e[i]]) {
ans++;
dfs(e[i]);
}
}
}
int main(){
memset(h,-1,sizeof h);
scanf("%d%d",&n,&m);
if(m==0){
printf("%d\n",n);
return 0;
}
ans=n;
while(m--){
int a,b;
scanf("%d%d",&a,&b);
add(a,b);
}
for(int i=1;i<=n;i++){
memset(st,0,sizeof st);
dfs(i);
}
printf("%d\n",ans);
return 0;
} | #include<bits/stdc++.h>
// no of bits to store no 2e5 is 19
// 2e5 ka 5 times square root lene se 2 or 3 ke pass pahunch jate hai
using namespace std;
#define int long long
#define mod 1000000007
#define MOD 1000000007
#define MAX 1000000000
#define inf 2e18
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define mii map<int, int>
#define all(x) (x).begin(), (x).end()
#define fill(a,b) memset(a, b, sizeof(a))
#define sp(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcount(x)
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define endl '\n'
// powermod(a,b,m) == powermod(a,b%(m-1),m) when m is prime fermat's theorem a^(p-1) %p=1 p is prime
int powermod(int a,int b,int c) // gives (a^b)%c
{
int ans = 1,tempans=a%c;
while(b>0)
{
if((b&1)==1)
{
ans=(ans*tempans)%c;
}
tempans=(tempans*tempans)%c;
b=b>>1;
}
return ans;
}
int modinverse(int a,int m) // gives a inverse wrt m and m is prime
{
return powermod(a,m-2,m);
}
ll add(ll x, ll y) {
x += y;
if (x >= mod) return x - mod;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0) return x + mod;
return x;
}
ll mult(ll x, ll y) {
return (x * y) % mod;
}
ll inv(ll x)
{
return powermod(x, MOD - 2,mod);
}
ll divide(ll x, ll y)
{
return mult(x, inv(y));
}
// my template m
// prime factorization pf
// ncr and factorials ncr
// matrix exponentiation of fibonacci series in log(n) matexpofib
// cycles in a graph cycle
// prime factorization in log(n) spf
// disjoint set union dsu
vector<int> topo;int n,m;
vector<int> edges[2005];
int vis[2005];
int y=0;
void dfs(int i)
{
vis[i]=1;
y++;
for(auto ch:edges[i])
{
if(!vis[ch])
{
dfs(ch);
}
}
}
void solve()
{
cin>>n>>m;
while(m--)
{
int x,y;
cin>>x>>y;
edges[x-1].pb(y-1);
}
int ans =0;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
vis[j]=0;
y=0;
dfs(i);
//cout<<y<<endl;
ans+=(y);
}
cout<<ans;
}
int32_t main()
{
fast_in_out;
int t=1;//cin>>t;
int count=0;
while(t--)
{
count++;
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> pipii;
typedef priority_queue<pii, vector<pii>, greater<pii>> minpq;
typedef priority_queue<int> maxpq;
//const double PI = acos(-1);
const int mod = 1000000007;
// ----------------------DEBUG TEMPLATE--------------------------
void __print(int x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x)
{
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x)
{
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
// =========================DEBUG TEMPLATE============================
void tc()
{
int n,c;
cin>>n>>c;
vi a(n+1),b(n+1),cost(n+1);
map<int,int>m;
map<int,int>r;
vi arr;
fo(i,n){
cin>>a[i+1]>>b[i+1]>>cost[i+1];
arr.pb(a[i+1]);
arr.pb(b[i+1]);
arr.pb(b[i+1]+1);
}
sort(all(arr));
int id = 1;
fo(i,arr.size()){
m[arr[i]] = id;
r[id] = arr[i];
id++;
}
id--;
vi pref(id+1,0);
fo(i,n){
pref[m[a[i+1]]]+=cost[i+1];
if(m[b[i+1]] +1 <=id){
pref[m[b[i+1]] + 1] -= cost[i+1];
}
}
for(int i =1;i<=id;i++){
pref[i] += pref[i-1];
}
int ans = 0;
Fo(i,1,id){
int tod = r[i];
int nxt = r[i+1];
int dur = nxt - tod;
ans += min(pref[i],c)*dur;
}
ans += min(c,pref[id]);
cout<<ans<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--)
{
tc();
}
}
| #include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a; i > b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// using lll=boost::multiprecision::cpp_int;
// using
// Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
ll mypow(ll x, ll n, const ll &p = -1)
{ // x^nをmodで割った余り
if (p != -1)
{
x = (x % p + p) % p;
}
ll ret = 1;
while (n > 0)
{
if (n & 1)
{
if (p != -1)
ret = (ret * x) % p;
else
ret *= x;
}
if (p != -1)
x = (x * x) % p;
else
x *= x;
n >>= 1;
}
return ret;
}
struct myrand{
random_device seed;
mt19937 mt;
myrand():mt(seed()){}
int operator()(int a,int b){//[a,b)
uniform_int_distribution<int>dist(a,b-1);
return dist(mt);
}
};
// using namespace atcoder;
//------------------------
//------------------------
//------------------------
//------------------------
//------------------------
void solve()
{
int n;
cin>>n;
multiset<ll>r,g,b;
rep(i,n*2){
ll a;
char c;
cin>>a>>c;
if(c=='R')r.emplace(a);
else if(c=='B')b.emplace(a);
else g.emplace(a);
}
if(r.size()%2==0&&g.size()%2==0&&b.size()%2==0){
cout<<0<<"\n";
}else{
if(r.size()%2==1){
if(g.size()%2==0)swap(r,g);
else swap(r,b);
}
ll ans=INF;
ll G=INF,B=INF;
for(auto x:g){
auto itr=r.lower_bound(x);
if(itr!=r.end())chmin(G,*itr-x);
if(itr!=r.begin())chmin(G,x-*prev(itr));
}
for(auto x:b){
auto itr=r.lower_bound(x);
if(itr!=r.end())chmin(B,*itr-x);
if(itr!=r.begin())chmin(B,x-*prev(itr));
}
chmin(ans,G+B);
for(auto x:g){
auto itr=b.lower_bound(x);
if(itr!=b.end())chmin(ans,*itr-x);
if(itr!=b.begin())chmin(ans,x-*prev(itr));
}
cout<<ans<<"\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
return 0;
} |
// Problem: C - Swaps 2
// Contest: AtCoder - AtCoder Regular Contest 120
// URL: https://atcoder.jp/contests/arc120/tasks/arc120_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcc,abm,mmx,avx,avx2,tune=native")
#include <stdio.h>
#include <string.h>
#include <set>
#include <map>
#include <algorithm>
#include <queue>
#define od(x) printf("%d",x)
#define odb(x) printf("%d ",x)
#define odl(x) printf("%d\n",x)
#define odp(x,y) printf("%d %d\n",x,y)
#define ol(x) puts("")
#define old(x) printf("%lld",x)
#define oldb(x) printf("%lld ",x)
#define oldl(x) printf("%lld\n",x)
#define oldp(x,y) printf("%lld %lld\n",x,y)
#define int long long
inline int read()
{
int num=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>47&&c<58)num=num*10+(c^48),c=getchar();
return num*f;
}
inline int re1d()
{
char c=getchar();
while(c<48||c>49)c=getchar();
return c&1;
}
inline int min(int a,int b){return a>b?b:a;}
inline int max(int a,int b){return a<b?b:a;}
int n;std::map<int,int>m;std::set<int>x[200005],y[500005];
int a[200005],b[200005],c[200005];
namespace szsz{
int a[200005];
inline int lowbit(int x){return x&-x;}
inline void add(int x,int p){while(x<=n)a[x]+=p,x+=lowbit(x);}
inline int query(int x){int res=0;while(x)res+=a[x],x-=lowbit(x);return res;}
}using szsz::add;using szsz::query;
signed main()
{
n=read();
int A=0,B=0;
for(int i=1;i<=n;i++)A+=a[i]=read()+i;
for(int i=1;i<=n;i++)B+=b[i]=read()+i;
if(A!=B)return puts("-1")&0;
int cc=0;
for(int i=1;i<=n;i++)
{
if(m.count(a[i]));else m[a[i]]=++cc;
x[m[a[i]]].insert(i);
}
for(int i=1;i<=n;i++)
{
if(m.count(b[i]))y[m[b[i]]].insert(i);
else return puts("-1")&0;
}
int ans=0;
for(int i=1;i<=cc;i++)
{
if(x[i].size()==y[i].size())
{
std::set<int>::iterator A=x[i].begin(),B=y[i].begin();
for(;A!=x[i].end();A++,B++)c[*B]=*A;
}
else return puts("1")&0;
}
A=0;
for(int i=1;i<=n;i++)A+=(i-1)-query(c[i]),add(c[i],1);
oldl(A);
return 0;
} | /*
* C. ORXOR.cpp
* Created : 28/03/21 10.54.57
*/
#include <bits/stdc++.h>
using namespace std;
void run_case(){
int n;
cin >> n;
vector<long long> v(n);
for(long long &i : v){
cin >> i;
}
long long res = LLONG_MAX;
for(int i = 0; i < (1 << (n - 1)); i++){
long long Or = 0;
long long Xor = 0;
for(int j = 0; j < n; j++){
Or |= v[j];
if(i >> j & 1){
Xor ^= Or;
Or = 0;
}
}
Xor ^= Or;
res = min(res, Xor);
}
cout << res;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tt = 1;
// cin >> tt;
while(tt--){
run_case();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define tc int t;cin>>t;while(t--)
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define pb push_back
#define pi pair<int,int>
#define pll pair<lli,lli>
#define vi vector<int>
#define vll vector<lli>
#define vpi vector<pair<int,int> >
#define vpll vector<pair<lli,lli> >
#define vvi vector<vector<int> >
#define vvll vector<vector<lli> >
#define vvpi vector<vector<pair<int,int> > >
#define vvpll vector<vector<pair<lli,lli> > >
#define inf 1000000000
#define maxn 200005
lli mod=998244353;
vi par(maxn),sz(maxn);
int rep(int v) {
if (v == par[v])
return v;
return par[v] = rep(par[v]);
}
void unite(int a, int b) {
a = rep(a);
b = rep(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
par[b] = a;
sz[a] += sz[b];
}
}
void pre(int n){
for(int i=0;i<n;i++){
par[i]=i;
sz[i]=0;
}
}
int main(){
fastio;
int n;
cin>>n;
vll a(n);
pre(maxn);
map<pair<lli,lli> ,lli > mp;
lli ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n/2;i++){
if(a[i]!=a[n-1-i]){
mp[{min(a[i],a[n-1-i]),max(a[i],a[n-1-i])}]++;
}
}
for(auto it : mp){
if(rep(it.f.f)!=rep(it.f.s)){
ans++;
unite(it.f.f,it.f.s);
}
}
cout<<ans<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define pqueue priority_queue
#define umap unordered_map
#define uset unordered_set
#define bits(x) __builtin_popcount((x))
#define gcd(x, y) __gcd(x, y)
#define lcm(x, y) ((x) / gcd(x, y) * (y))
#define inf 4557430888798830399LL
#define mst(dp, val) memset(dp, val, sizeof(dp))
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define repd(i, a, b, d) for (int i = a; i <= b; i += d)
#define rep_(i, a, b) for (int i = a; i >= b; --i)
#define repd_(i, a, b) for (int i = a; i >= b; i -= d)
#define mxm(a, b) a = max(a, b)
#define mnm(a, b) a = min(a, b)
#define pb push_back
#define X first
#define Y second
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << "=" << x << endl
#define readArr(a, n) for (int i = 1; i <= n; i++) cin >> a[i];
#define printArr(a, n) for (int i = 1; i <= n; i++) cout << a[i] << " "; cout << endl;
#define mod 1000000007
#define Add(x, d) x = (x + (d)) % mod
#define print(e) cout << (e) << endl
// #define MULTI_CASES
// #define PRE
const int N = 2e5 + 5;
int a[N];
int f[N], sz[N];
int find(int x) {
return x == f[x] ? x : f[x] = find(f[x]);
}
void join(int x, int y) {
int fx = find(x), fy = find(y);
if (fx != fy) {
f[fx] = fy;
sz[fy] += sz[fx];
}
}
void solve() {
int n; cin >> n;
readArr(a, n);
rep(i, 1, N - 1) {
f[i] = i;
sz[i] = 1;
}
for (int i = 1, j = n; i < j; i++, j--) {
if (a[i] != a[j]) join(a[i], a[j]);
}
int res = 0;
int cnt = 0;
rep(i, 1, N - 1) {
if (find(i) == i) cnt += sz[i], res += sz[i] - 1;
}
print(res);
}
void solve5() {
int l, r;
cin >> l >> r;
//[1~lim]区间有多少个数具有因子f
auto cal = [&](int f, int lim, int y) {
int cnt = 0;
repd(x, f, lim, f) {
if (gcd(x, y) != x) cnt++;
}
return cnt;
};
int res = 0;
rep(y, l, r) {
//枚举y的因子
for (int f = 2; f * f <= y; f++) {
if (y % f) continue;
res += cal(f, y - 1, y) - cal(f, l-1, y);
if (y / f != f)
res += cal(y / f, y - 1, y) - cal(y / f, l-1, y);
}
}
print(2*res);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
#ifdef MULTI_CASES
#ifdef PRE
pre();
#endif
int t; cin >> t;
while (t--) solve();
#else
solve();
#endif
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define L long long
int main() {
int m; cin >> m;
static const int n = m;
vector<vector<L>> v(n);
rep(i, n) {
L x, c; cin >> x >> c;
c--;
v[c].push_back(x);
}
L p1 = 0, p2 = 0, t1 = 0, t2 = 0;
rep(i, n) {
if (v[i].size() == 0) continue;
sor(v[i]);
L xmin = v[i][0], xmax = v[i][v[i].size() - 1];
L d = xmax - xmin;
L t1_ = min(t1 + abs(xmax - p1) + d, t2 + abs(xmax - p2) + d);
L t2_ = min(t1 + abs(xmin - p1) + d, t2 + abs(xmin - p2) + d);
p1 = xmin;
p2 = xmax;
t1 = t1_; t2 = t2_;
}
L ans = min(t1 + abs(p1), t2 + abs(p2));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1.5e6;
int n, m, a[mxN], cnt[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i=0; i<n; ++i)
cin >> a[i];
for (int i=0; i<m; ++i)
++cnt[a[i]];
int cur=0;
while(cur<n&&cnt[cur])
++cur;
int ans=cur;
for (int i=m; i<n; ++i) {
++cnt[a[i]];
if (--cnt[a[i-m]]==0)
ans=min(ans, a[i-m]);
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool isPrime(ll n)
{
//Corner case:
if(n<=1)
return false;
if(n<=3)
return true;
//This optimizes the complexity:
if(n%2==0||n%3==0)
return false;
for(ll i=5;i*i<=n;i=i+6)
{
if(n%i==0||n%(i+2)==0)
return false;
}
return true;
}
int main()
{
ll n,m;
cin>>n>>m;
ll a[n],b[m];
for(ll i=0;i<n;i++)cin>>a[i];
for(ll i=0;i<m;i++)cin>>b[i];
sort(a,a+n);
sort(b,b+m);
ll i=0,j=0;
while(i<n&&j<m)
{
if(a[i]>b[j])
{
cout<<b[j]<<" ";
j++;
}
else if(a[i]<b[j])
{
cout<<a[i]<<" ";
i++;
}
else
{
i++;
j++;
}
}
while(i<n)
cout<<a[i++]<<" ";
while(j<m)
cout<<b[j++]<<" ";
cout<<endl;
}
| #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
//#define ll int
#define all(a) a.begin(),a.end()
#define rev(a) a.rbegin(),a.rend()
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; //less_equal for multiset
#define ar array
#define pb push_back
#define fi(a,b) for(int i=a;i<(b);i++)
#define fj(a,b) for(int j=a;j<(b);j++)
#define fk(a,b) for(int k=a;k<(b);k++)
const double pi=acosl(-1);
void solve()
{
int s,p;
cin>>s>>p;
for(int i=1;i*i<=p;i++)
{
if(p%i==0)
{
if(i+p/i==s)
{
cout<<"Yes\n";
return ;
}
}
}
cout<<"No\n";
}
signed main()
{
FAST;
//seive();
int tt=1;
// cin>>tt;
while(tt--)
{
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define mod 1000000007
#define mod1 998244353
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define range(a,b) substr(a,b-a+1)
#define w(x) int x; cin>>x; while(x--)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int gcd(int a, int b){if (b == 0)return a;return gcd(b, a % b);}
int lcm(int a, int b){return (a / gcd(a, b)) * b;}
int power(long long x, unsigned int y, int p){int res = 1;x = x % p;if (x == 0) return 0;while (y > 0){if (y & 1)res = (res*x) % p;y = y>>1;x = (x*x) % p;}return res;}
int mod_inverse(int a, int p){return power(a, p - 2, p);}
void swap(int &x, int &y) {int temp = x; x = y; y = temp;}
vector<int> sieve(int n) {int*arr = new int[n + 1](); vector<int> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}
int mod_add(int a, int b, int m) {a = a % m; b = b % m; return (((a + b) % m) + m) % m;}
int mod_mul(int a, int b, int m) {a = a % m; b = b % m; return (((a * b) % m) + m) % m;}
int mod_sub(int a, int b, int m) {a = a % m; b = b % m; return (((a - b) % m) + m) % m;}
int mod_div(int a, int b, int m) {a = a % m; b = b % m; return (mod_mul(a, mod_inverse(b,m), m) + m) % m;} //only for prime m
int modfact(int n, int p){if (p <= n)return 0;int res = (p - 1);for (int i = n + 1; i < p; i++)res = (res * mod_inverse(i, p)) % p;return res;}
int fact(int n){if (n == 0)return 1;return n * fact(n - 1);}
int32_t main(){
FIO;
int a,b,c;
cin>>a>>b>>c;
//a=mod_mul(a,a+1,mod1);
//b=mod_mul(b,b+1,mod1);
//c=mod_mul(c,c+1,mod1);
a*=a+1;
b*=b+1;
c*=c+1;
a/=2;
b/=2;
c/=2;
a=mod_mul(a,b,mod1);
a=mod_mul(a,c,mod1);
cout<<a<<endl;
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
long long a,b,c,mod=998244353;
cin>>a>>b>>c;
a=(a+1)*a/2%mod;
b=(b+1)*b/2%mod;
c=(c+1)*c/2%mod;
cout<<a*b%mod*c%mod;
return 0;
} |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define ll long long
using namespace std;
template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
using vv = vector<vector<ll>>;
using vec = vector<ll>;
using P = pair<ll, ll>;
int main()
{
string s; cin >> s;
map<char, ll> mp;
rep(i, s.size()) {
mp[s[i]] += 1;
}
ll now = 0;
string ansl = "No";
rep(i, 200) {
bool ok = true;
map<char, ll> copy = mp;
now += 8;
if (now >= 1000)
{
break;
}
string st = to_string(now);
if (s.size() >= 3 && st.size() <= 2) {
continue;
}
if (s.size() >= 2 && st.size() <= 1) {
continue;
}
rep(j, st.size()) {
if (copy[st[j]] >= 1) {
copy[st[j]]--;
}
else {
ok = false;
break;
}
}
if (ok)
{
ansl = "Yes";
break;
}
}
cout << ansl << endl;
system("Pause");
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main(){
string s;
cin >> s;
vvi eight(125, vi(10));
eight[0][0] = 3;
for(int i = 1; i<=124; i++){
int hyaku = i*8/100;
int ten = (i*8-hyaku*100)/10;
int one = i*8-hyaku*100-ten*10;
eight[i][hyaku] ++;
eight[i][ten] ++;
eight[i][one] ++;
}
vi sv(10);
if(s.size() == 1) sv[0] += 2;
else if (s.size() == 2) sv[0] ++;
rep(i,s.size()) {
int mozi = s[i] - '0';
sv[mozi] ++;
}
if(s.size() <= 2){
if(s.size() == 1){
if(stoi(s)%8 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
else{
if(stoi(s)%8 == 0) cout << "Yes" << endl;
else{
reverse(s.begin(),s.end());
if(stoi(s)%8 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
}
}
return 0;
}
bool ok = false;
rep(i,125){
bool tasika = true;
rep(j,10){
if(eight[i][j] <= sv[j]) continue;
else tasika = false;
}
if (tasika) ok = true;
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for (int i = 1; i <= n; i++)
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define lli long long int
#define INF 1000000000
#define endl '\n'
using namespace std;
typedef long long ll;
struct fhash {
ll operator() (ll x) const { return 7; }
};
ll fun(vector<ll> a,vector<ll> b){
int n=a.size();
int m=b.size();
ll mn=LLONG_MAX;
for(int i=0;i<n;i++){
int j = lower_bound(b.begin(), b.end(), a[i])- b.begin();
if(j<m){
mn=min(mn,abs(a[i]-b[j]));
}
if(j-1>=0){
mn=min(mn,abs(a[i]-b[j-1]));
}
if(j+1<m){
mn=min(mn,abs(a[i]-b[j+1]));
}
}
return mn;
}
int main(){
int n;
cin>>n;
vector<ll> r,g,b;
int r1=0,g1=0,b1=0;
for(int i=0;i<2*n;i++){
ll u;
char v;
cin>>u;
cin>>v;
if(v=='R'){
r1++;
r.pb(u);
}else if(v=='G'){
g1++;
g.pb(u);
}else{
b1++;
b.pb(u);
}
}
sort(r.begin(),r.end());
sort(g.begin(),g.end());
sort(b.begin(),b.end());
ll ans=LLONG_MAX;
if(r1%2==0&&g1%2==0){
ans=0;
}else if(r1%2==g1%2){
if(b1>0){
ans=fun(r,b)+fun(g,b);
}
ans=min(ans,fun(r,g));
}else if(r1%2==b1%2){
if(g1>0){
ans=fun(r,g)+fun(b,g);
}
ans=min(ans,fun(r,b));
}else{
if(r1>0){
ans=fun(b,r)+fun(g,r);
}
ans=min(ans,fun(b,g));
}
cout<<ans<<"\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
class UnionFind {
private:
int N;
vector<int> PS;
public:
UnionFind() : N(0) {}
UnionFind(int n) : N(n), PS(n, -1) {}
bool unite(int a, int b) {
int x = root(a), y = root(b);
if (x == y) return false;
if (-PS.at(x) < -PS.at(y)) swap(x, y);
PS.at(x) += PS.at(y);
PS.at(y) = x;
return true;
}
bool same(int a, int b) { return root(a) == root(b); }
int root(int a) {
if (PS.at(a) < 0) return a;
return PS.at(a) = root(PS.at(a));
}
int size(int a) { return -PS.at(root(a)); }
vector<vector<int>> groups() {
vector<int> B(N), S(N);
for (int i = 0; i < N; i++) {
B.at(i) = root(i);
S.at(B.at(i))++;
}
vector<vector<int>> ret(N);
for (int i = 0; i < N; i++) {
ret.at(i).reserve(S.at(i));
}
for (int i = 0; i < N; i++) {
ret.at(B.at(i)).push_back(i);
}
auto f = [&](const vector<int> &v) { return v.empty(); };
ret.erase(remove_if(ret.begin(), ret.end(), f), ret.end());
return ret;
}
};
int main() {
int N;
cin >> N;
vector<pair<int, int>> V(N);
for (int i = 0; i < N; i++) cin >> V.at(i).first >> V.at(i).second;
auto f = [&](double mid) {
UnionFind UF(N + 2);
for (int i = 0; i < N; i++) {
auto [a, b] = V.at(i);
if (100 - b < mid) UF.unite(i, N);
if (b - -100 < mid) UF.unite(i, N + 1);
for (int j = 0; j < i; j++) {
auto [c, d] = V.at(j);
if (hypot(a - c, b - d) < mid) UF.unite(i, j);
}
}
return (UF.same(N, N + 1)) ? false : true;
};
double ok = 0, ng = 200;
for (int cnt = 100; cnt; cnt--) {
double mid = (ok + ng) / 2;
(f(mid)) ? ok = mid : ng = mid;
}
cout << fixed << setprecision(4) << ok / 2 << "\n";
} |
#include<iostream>
#include<iterator>
#include<algorithm>
#include<climits>
#include<map>
#include<set>
#include<numeric>
#include<string>
#include<sstream>
#define ll long long
using namespace std;
int main()
{
int h, w;
cin >> h >> w;
multiset<int> s;
for (int i = 0; i < h*w; ++i){
int x;
cin >> x;
s.insert(x);
}
int min = *s.begin();
int sum = 0;
for (auto i = s.begin(); i != s.end(); ++i){
sum += *i - min;
}
cout << sum;
} | #include <bits/stdc++.h>
//#include <atcoder/all>
typedef long long ll;
using namespace std;
//using namespace atcoder;
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define _reps(i, s, n) for(ll i = (ll)(s); i < (ll)n; i++)
#define REP(...) _overload(__VA_ARGS__, _reps, _rep,)(__VA_ARGS__)
#define all(v) (v).begin(),(v).end()
#define UNIQUE(v) (v).erase( unique( all(v) ), (v).end() );
#define MOD 1000000007
int main(){
ll n, x;
cin >> n >> x;
x *= 100;
ll v[n], p[n];
REP(i, n){
cin >> v[i] >> p[i];
}
ll sum = 0;
REP(i, n){
sum += v[i] * p[i];
if( sum > x ){
cout << i+1 << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, b); }
template <class T>
inline void chmax(T &a, const T &b) { a = max(a, b); }
template <class T>
inline bool kbit(const T &x, const int &k) { return ((x >> k) & 1LL); }
inline int popcount(const int &n) { return __builtin_popcount(n); }
inline ll popcountll(const ll &n) { return __builtin_popcountll(n); }
inline ll mask(const ll &k) { return (1LL << k) - 1LL; }
template <class T>
void zip(V<T> &v) {
sort(all(v));
v.erase(unique(all(v)), v.end());
}
template <class T>
int lwb(V<T> &v, const T &x) { return lower_bound(all(v), x) - v.begin(); }
template <class T>
int upb(V<T> &v, const T &x) { return upper_bound(all(v), x) - v.begin(); }
void dump() {
cerr << '\n';
}
template <class Head, class... Tail>
void dump(Head &&head, Tail &&...tail) {
cerr << head << (sizeof...(Tail) == 0 ? " " : ", ");
dump(std::move(tail)...);
}
template <class T>
void print(const vector<T> &v) {
for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
template <class T>
void read(vector<T> &v) {
for (int i = 0; i < v.size(); i++) cin >> v[i];
}
constexpr char sp = ' ', newl = '\n';
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
constexpr ll INF = (1LL << 60) - 1LL;
constexpr ll MOD = 998244353LL;
//////////////////////////////////////////////INSERT ABOVE HERE
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
V<int> x(m), y(m), z(m);
for (int i = 0; i < m; i++) {
cin >> x[i] >> y[i] >> z[i];
}
V<ll> dp(1 << n);
dp[0] = 1;
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < m; j++) {
if (x[j] != popcount(i)) continue;
if (popcount(i & mask(y[j])) > z[j]) dp[i] = 0;
}
for (int j = 0; j < n; j++) {
if (kbit(i, j)) continue;
dp[i | (1 << j)] += dp[i];
}
// dump(i, dp[i]);
}
cout << dp[(1 << n) - 1] << newl;
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}
int main(){
INT(n,m);
vector<vector<pair<int,int>>> vec(n+1);
int x,y,z;
rep(i,m){
in(x,y,z);
vec[x].emplace_back(y,z);
}
vector<ll> dp(1<<n,0);
vector<int> mask(n+1,0);
dp[0]=1;
for(int i=1;i<n+1;i++)mask[i]=(1<<i)-1;
rep(i,1<<n){
x=popcount(i);
rep(j,vec[x].size()){
if(popcount(i&mask[vec[x][j].first])>vec[x][j].second){
dp[i]=0;
}
}
rep(j,n){
if(~i>>j&1){
dp[i|1<<j]+=dp[i];
}
}
}
out(dp.back());
} |
//https://atcoder.jp/contests/abc186/tasks/abc186_e
//E - Throne
#include <bits/stdc++.h>
using namespace std;
//如果提交到OJ，不要定义 __LOCAL
#define __LOCAL
typedef long long ll;
ll reduce(ll a, ll mod) {
return (a%=mod)<0?a+mod:a;
}
//finds x, y such that ax + by = gcd(a, b)
ll euclidEx(ll a, ll b, ll &x, ll &y) {
if (b) {
ll d=euclidEx(b, a%b, y, x);
y-=a/b*x;
return d;
} else {
x=1;
y=0;
return a;
}
}
int main() {
#ifndef __LOCAL
//这部分代码需要提交到OJ，本地调试不使用
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#endif
int t;
cin>>t;
while (t--) {
ll n,s,k;
cin>>n>>s>>k;
s=n-s;
ll g=__gcd(n, k);
if (0!=s%g) {
cout<<"-1\n";
continue;
}
//找到最小的正整数x，满足 kx=s mod n
ll x,y;
euclidEx(k, n, x, y);
//kx+ny=g
x *= (s/g);
y *= (s/g);
//ans is x%(n/g)
x = reduce(x, n/g);
cout<<x<<"\n";
}
#ifdef __LOCAL
//这部分代码不需要提交到OJ，本地调试使用
system("pause");
#endif
return 0;
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
int n,a[50],ans = 2147483645;
inline int read()
{
int s = 0,w = 1; char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-') w = -1; ch = getchar();}
while(ch >= '0' && ch <= '9'){s = s * 10 + ch - '0'; ch = getchar();}
return s * w;
}
void dfs(int x,int sum)
{
if(x == n+1)
{
ans = min(ans,sum);
return;
}
int res = 0;
for(int i = x; i <= n; i++)
{
res = res | a[i];
dfs(i+1,sum^res);
}
}
signed main()
{
n = read();
for(int i = 1; i <= n; i++) a[i] = read();
dfs(1,0);
printf("%d\n",ans);
return 0;
} |
#include <iostream>
int main()
{
int X, Y, Z;
std::cin >> X >> Y >> Z;
auto ans = (Z * Y - 1) / X;
std::cout << ans << std::endl;
return 0;
}
| #pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
template<typename T> using PQ = priority_queue<T>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007; // 998244353;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const ld PI = acos((ld)-1);
constexpr ll dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
inline void Yes() { cout << "Yes" << ENDL; }
inline void No() { cout << "No" << ENDL; }
inline void YES() { cout << "YES" << ENDL; }
inline void NO() { cout << "NO" << ENDL; }
template<typename T,typename Y> inline T mpow(T a, Y n) {
T res = 1;
for(;n;n>>=1) {
if (n & 1) res = res * a;
a = a * a;
}
return res;
}
template <typename T>
vector<T> finddivisor(T x) { //整数xの約数(xを含む)
vector<T> divisor;
for(T i = 1; (i * i) <= x; i++) {
if(x % i == 0) {
divisor.push_back(i);
if(i * i != x) { divisor.push_back(x / i);}
}
}
sort(divisor.begin(), divisor.end());
return divisor;
}
template <typename T> V<T> prefix_sum(const V<T>& v) {
int n = v.size();
V<T> ret(n + 1);
rep(i, 0, n) ret[i + 1] = ret[i] + v[i];
return ret;
}
template<typename T>
T rand(T l,T r){
static random_device rd;
static mt19937 g(rd());
return uniform_int_distribution<T>(l,r)(g);
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(auto&& x: vec) is >> x;
return is;
}
template<typename T,typename Y>
ostream& operator<<(ostream& os,const pair<T,Y>& p){
return os<<"{"<<p.fs<<","<<p.sc<<"}";
}
template<typename T> ostream& operator<<(ostream& os,const V<T>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<typename ...Args>
void debug(Args&... args){
for(auto const& x:{args...}){
cerr<<x<<' ';
}
cerr<<ENDL;
}
#pragma endregion templates
signed main(){
cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false);
cout<<fixed<<setprecision(20);
ll x,y,z;cin>>x>>y>>z;
cout<<(z*y-1)/x<<ENDL;
}
//(・_・)(・_・)(・_・)(・_・)
//CHECK overflow,what to output?
//any other simpler approach? |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
if( n%3==0 ){
cout << 0 << endl;
return 0;
}
vector<int> a;
do {
a.push_back(n%10);
n /= 10;
} while (n!=0);
if(a.size() == 1){
cout << -1 << endl;
return 0;
}
for(auto x : a){
if( (accumulate(a.begin(), a.end(),0) - x)%3==0 ){
cout << 1 << endl;
return 0;
}
}
if(a.size() < 3){
cout << -1 << endl;
return 0;
}
cout << 2 << endl;
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef unsigned long long ull;
typedef unsigned uint;
typedef long long ll;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
/*
const int mod=;
inline int upd(const int &x){return x+(x>>31&mod);}
inline void add(int &x,const int &y){x=upd(x+y-mod);}
inline void iadd(int &x,const int &y){x=upd(x-y);}
int qpow(int x,int y){
int res=1;
for (;y;y>>=1,x=1LL*x*x%mod)
if (y&1) res=1LL*res*x%mod;
return res;
}
*/
//typedef pair<int,int> P;
#define rep(i,l,r) for (int i(l);i<=int(r);i++)
#define per(i,l,r) for (int i(r);i>=int(l);i--)
#define all(x) (x).begin(),(x).end()
int n,w[64];
ll check(int c){
ll z=c;
rep(i,1,n){
if (__gcd(c,w[i])>1) continue;
int t=w[i]/__gcd(0LL+w[i],32LL*27*25*49);
if (t==1) return ll(1e18);
z*=t;
}
return z;
}
void solve(){
n=read();
rep(i,1,n) w[i]=read();
ll z=1e18;
int prm[8]={2,3,5,7};
rep(i,0,15){
int c=1;
rep(j,0,3) if (i>>j&1) c*=prm[j];
z=min(z,check(c));
}
printf("%lld\n",z);
}
int main()
{
for (int T=1;T--;) solve();
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
const ll MOD=1e9+7;
const ll INF=1e17;
//#######################################################################
vector<vector<ll>> input(ll N, ll width){
string str;
vector<vector<ll>> vec(N,vector<ll>(width));
for(ll i=0;i<N;++i){
cin>>str;
reverse(ALL(str));
for(ll j=0;j<width;++j){
vec[i][j]=str.back();
str.pop_back();
}
}
return vec;
}
void op(vector<ll> vec){
ll size=(ll)vec.size();
for(ll i=0;i<size-1;++i) cout<<vec[i]<<" ";
cout<<vec.back()<<endl;
}
void op(vector<vector<ll>> vec){
ll height=(ll)vec.size();
ll width=(ll)vec[0].size();
for(ll i=0;i<height;++i) {
for(ll j=0;j<width-1;++j) cout<<vec[i][j]<<" ";
cout<<vec[i].back()<<endl;
}
}
//########################################################################
struct position{
ll x;
ll y;
};
void solve(){
ll N;
cin>>N;
vector<position> cd(N);
vector<ld> slope(N);
rep(i,0,N) {
cin>>cd[i].x>>cd[i].y;
}
rep(i,0,N-2) rep(j,i+1,N-1) rep(k,j+1,N){
position a,b,c;
a=cd[i]; b=cd[j]; c=cd[k];
ll s1=(c.y-a.y)*(b.x-a.x);
ll s2=(b.y-a.y)*(c.x-a.x);
if(s1==s2) {
cout<<"Yes"<<endl;
return;
}
}
cout<<"No"<<endl;
}
int main(void){
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
solve();
}
| // 2020-10-17 20:19:18
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
using P = pair<int, int>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
// #include <atcoder/convolution>
// #include <atcoder/dsu>
// #include <atcoder/fenwicktree>
// #include <atcoder/lazysegtree>
// #include <atcoder/math>
// #include <atcoder/maxflow>
// #include <atcoder/mincostflow>
// #include <atcoder/modint>
// #include <atcoder/scc>
// #include <atcoder/segtree>
// #include <atcoder/string>
// #include <atcoder/twosat>
// #include <atcoder/all>
// using namespace atcoder;
// clang-format on
const ll inf = 1e18;
int n;
vector<ll> x, y, z;
vector<vector<ll> > dp;
ll dist(int i, int j) {
return abs(x[i] - x[j]) + abs(y[i] - y[j]) + max(0ll, z[j] - z[i]);
}
ll rec(int i, int S) {
if (dp[i][S] >= 0) return dp[i][S];
if (__builtin_popcount(S) == 1) {
return dp[i][S] = dist(0, i);
}
ll cur = inf;
int T = S & (~(1 << i));
rep(j, n) if (i != j && (S >> j) & 1) chmin(cur, rec(j, T) + dist(j, i));
return dp[i][S] = cur;
}
void answer() {
cin >> n;
x.resize(n);
y.resize(n);
z.resize(n);
rep(i, n) cin >> x[i] >> y[i] >> z[i];
dp.resize(n, vector<ll>(1 << n, -1));
rec(0, (1 << n) - 1);
cout << dp[0][(1 << n) - 1] << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define maxn 10006
using namespace std;
ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = -1;
for (; isdigit(ch); ch = getchar()) x = 10 * x + ch - '0';
return x * f;
}
void print(ll x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) print(x / 10);
putchar(x % 10 + '0');
}
string s;
int n;
int x[4][5010];
int main() {
cin >> n >> s;
s = "." + s;
memset(x, 0, sizeof(x));
for (int i = 1; i <= n; ++i) {
if (s[i] == 'A')
x[0][i]++;
else if (s[i] == 'T')
x[1][i]++;
else if (s[i] == 'G')
x[2][i]++;
else
x[3][i]++;
}
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < 4; ++j) {
x[j][i] += x[j][i - 1];
}
}
int res = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
int a = x[0][j] - x[0][i - 1];
int b = x[1][j] - x[1][i - 1];
int c = x[2][j] - x[2][i - 1];
int d = x[3][j] - x[3][i - 1];
if (a == b && c == d) res++;
}
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define tc int t;cin>>t;while(t--)
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define pb push_back
#define vi vector<int>
#define vll vector<lli>
#define vpi vector<pair<int,int> >
#define vpll vector<pair<lli,lli> >
#define vvi vector<vector<int> >
#define vvll vector<vector<lli> >
#define maxn 100005
int main(){
fastio;
int n;
string s;
cin>>n>>s;
int ans=0;
for(int i=0;i<n;i++)
{
int fra=0,frt=0,frc=0,frg=0;
for(int j=i;j<n;j++){
if(s[j]=='A') fra++;
if(s[j]=='T') frt++;
if(s[j]=='C') frc++;
if(s[j]=='G') frg++;
if(fra==frt and frc==frg)
ans++;
}
}
cout<<ans<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 2e9;
int main(){
int n;
cin >> n;
vector<bool> flag(n+1);
int num = 0;
rep(i,n){
int a;
cin >> a;
flag[a] = true;
while(true){
if(flag[num] == false){
cout << num << endl;
break;
}
else num++;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
int N;
cin >> N;
int ans;
ans = (N - 1) / 100 + 1;
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define ick cout << "ickbmi32.9\n"
using namespace std;
struct edge{
double w = 1;
int t = 0;
};
edge r[30][30], d[30][30];
int dx[]{0, 0, 1, -1};
int dy[]{1, -1, 0, 0};
char mv[]{'R', 'L', 'D', 'U'};
int getDist(int x, int y, int dir) {
if(min(x + dx[dir], y + dy[dir]) < 0) return -1;
if(max(x + dx[dir], y + dy[dir]) >= 30) return -1;
if(dir == 0) return d[x][y].w;
if(dir == 1) return d[x][y - 1].w;
if(dir == 2) return r[x][y].w;
if(dir == 3) return r[x - 1][y].w;
return -1;
}
pair<string, vector<pair<int, int>>> path(int x1, int y1, int x2, int y2) {
double dist[30][30];
for(int i = 0; i < 30; i++) for(int j = 0; j < 30; j++) dist[i][j] = -1;
priority_queue<pair<double, pair<int, int>>, vector<pair<double, pair<int, int>>>, greater<>>dij;
dij.push(mp(0, mp(x1, y1)));
while(!dij.empty()) {
pair<double, pair<int, int>> now = dij.top();
dij.pop();
if(abs(dist[now.se.fi][now.se.se] + 1) > 1e-5) continue;
dist[now.se.fi][now.se.se] = now.fi;
for(int i = 0; i < 4; i++) {
int di = getDist(now.se.fi, now.se.se, i);
if(di == -1) continue;
dij.push(mp(now.fi + di, mp(now.se.fi + dx[i], now.se.se + dy[i])));
}
}
pair<int, int> now = mp(x2, y2);
vector<pair<int, int>> pa;
string pam;
while(now != mp(x1, y1)) {
//cout << now.fi << ' ' << now.se << endl;
for(int i = 0; i < 4; i++) {
int di = getDist(now.fi, now.se, i);
if(di == -1) continue;
if(abs(dist[now.fi][now.se] - di - dist[now.fi + dx[i]][now.se + dy[i]]) < 1e-5) {
pam += mv[i ^ 1];
now.fi += dx[i];
now.se += dy[i];
break;
}
}
pa.pb(now);
}
reverse(pa.begin(), pa.end());
reverse(pam.begin(), pam.end());
return mp(pam, pa);
}
void upd(string ah, vector<pair<int, int>> ps, double avg) {
for(int i = 0; i < ah.length(); i++) {
if(ah[i] == 'R') {
d[ps[i].fi][ps[i].se].w = (d[ps[i].fi][ps[i].se].w * d[ps[i].fi][ps[i].se].t + avg) / (d[ps[i].fi][ps[i].se].t + 1);
d[ps[i].fi][ps[i].se].t++;
}
if(ah[i] == 'L') {
d[ps[i].fi][ps[i].se - 1].w = (d[ps[i].fi][ps[i].se - 1].w * d[ps[i].fi][ps[i].se - 1].t + avg) / (d[ps[i].fi][ps[i].se - 1].t + 1);
d[ps[i].fi][ps[i].se - 1].t++;
}
if(ah[i] == 'D') {
r[ps[i].fi][ps[i].se].w = (r[ps[i].fi][ps[i].se].w * r[ps[i].fi][ps[i].se].t + avg) / (r[ps[i].fi][ps[i].se].t + 1);
r[ps[i].fi][ps[i].se].t++;
}
if(ah[i] == 'U') {
r[ps[i].fi - 1][ps[i].se].w = (r[ps[i].fi - 1][ps[i].se].w * r[ps[i].fi - 1][ps[i].se].t + avg) / (r[ps[i].fi - 1][ps[i].se].t + 1);
r[ps[i].fi - 1][ps[i].se].t++;
}
}
}
void solve() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
pair<string, vector<pair<int, int>>> go = path(x1, y1, x2, y2);
double in;
cout << go.fi << '\n';
fflush(stdout);
cin >> in;
upd(go.fi, go.se, in / go.fi.length());
}
int main() {
for(int _ = 0; _ < 1000; _++) solve();
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
int main(){
lli k;
k = 1000;
//cin>>k;
lli si,sj,ti,tj;
REP(_,0,k){
cin>>si>>sj>>ti>>tj;
while(si < ti){
si++;
cout<<"D";
}
while(si > ti){
si--;
cout<<"U";
}
while(sj < tj){
sj++;
cout<<"R";
}
while(sj > tj){
sj--;
cout<<"L";
}
cout<<endl;
lli test;
cin>>test;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
template <typename T>
void rVec(vector<T> &vec, const int &n){
vec.resize(n);
T temp;
for(T &i: vec){
cin >> i;
}
}
template <typename T>
void printVec(vector<T> &vec){
for(T &i: vec){
cout << i << " ";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a,b,c;
cin >> a >> b >> c;
int m = min(a,b);
a = a-m;
b = b-m;
if(c==0){
if(a==0) cout << "Aoki";
else cout << "Takahashi";
}
if(c==1){
if(b==0) cout << "Takahashi";
else cout << "Aoki";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
int main()
{
ll A, B, C;
cin >> A >> B >> C;
ll ans;
vector<string> S = {"Takahashi", "Aoki"};
if (C == 0)
{
if (A > B)
ans = 0;
else
ans = 1;
}
else
{
if (A >= B)
ans = 0;
else
ans = 1;
}
cout << S.at(ans) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define REP(i, s, n) for (long long i = (s); i <= (n); i++)
#define repr(i, n) for (long long i = (n - 1); i >= 0; i--)
#define REPR(i, s, n) for (long long i = (s); i >= (n); i--)
#define all(v) (v).begin(), (v).end() //biginからendへ
#define rall(v) (v).rbegin(), (v).rend()
#define sumvec(v) accumulate(all(v), 0LL)
#define DOUBLE fixed << setprecision(15)
#define OK cerr << "OK\n"
#define OK1 cerr << "OK1\n"
#define OK2 cerr << "OK2\n"
#define sz(s) (long long)s.size()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vd> vvd;
typedef vector<vc> vvc;
typedef vector<vb> vvb;
typedef pair<ll, ll> P;
typedef vector<P> vP;
//vectorの末尾参照は .back()を使おう。
//if(chmax(ans, i))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
IN(__VA_ARGS__)
void scan(int &a)
{
cin >> a;
}
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail>
void IN(Head &head, Tail &...tail)
{
scan(head);
IN(tail...);
}
//INT(a,b)とか使う
void YES(bool b) { cout << ((b) ? "YES\n" : "NO\n"); }
void Yes(bool b) { cout << ((b) ? "Yes\n" : "No\n"); }
void yes(bool b) { cout << ((b) ? "yes\n" : "no\n"); }
void Yay(bool b) { cout << ((b) ? "Yay!\n" : ":(\n"); }
void posible(bool b) { cout << ((b) ? "posible\n" : "imposible\n"); }
void Posible(bool b) { cout << ((b) ? "Posible\n" : "Imposible\n"); }
void POsIBLE(bool b) { cout << ((b) ? "POsIBLE\n" : "IMPOsIBLE\n"); }
//出力の形式に合わせて関数をキャスとする
const int inf = 1001001001;
const long long INF = ((1LL << 62) - (1LL << 31));
const long double pi = acos(-1.0);
int main(){
LL(a,b,c,d);
// if(b > c){
// cout << -1;
// return 0;
// }
ll i = 1;
ll ans = 1;
while(1){
if(a + b * i <= d * (c * i)){
cout << ans;
return 0;
}
i++;
ans++;
if(i == 100000000){
cout << -1;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
ll llceil(ll a, ll b) { return (a + b - 1) / b; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; }
string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
static const double EPS = 1e-10;
static const double PI = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const ll INF = (1LL << 62) - 1; // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
ll N; cin >> N;
string S; cin >> S;
VLL A(N+1); REP(i,N+1) cin >> A[i];
ll K = INF;
REP(i,N) chmin(K, llabs(A[i] - A[i+1]));
assert(K > 0);
VVLL ans(K,VLL(N+1));
REP(i,N+1) {
ll q = A[i] / K;
ll r = A[i] % K;
REP(k,K) {
ans[k][i] = q;
if (r > 0 && K-r <= k) ans[k][i]++;
}
}
COUT(K);
REP(k,K) {
REP(i,N+1) {
if (i) cout << " ";
cout << ans[k][i];
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios_base::sync_with_stdio(false);
int n; cin >> n;
vector<vector<ll>> p(n, vector<ll>(5));
for (int i = 0; i < n; ++i) {
cin >> p[i][0];
cin >> p[i][1];
cin >> p[i][2];
cin >> p[i][3];
cin >> p[i][4];
}
ll ok = 1, ng = 1000000001;
while (ng - ok > 1) {
ll x = (ng + ok) / 2;
vector<bool> can(32, false);
for (int i = 0; i < n; ++i) {
int bit = 0;
for (int k = 0; k < 5; ++k) {
if (p[i][k] >= x) bit |= (1 << k);
}
for (int k = 0; k < 32; ++k) {
if ((bit & k) == k) can[k] = true;
}
}
bool flg = false;
for (int i = 0; i < n; ++i) {
for (int j = i+1; j < n; ++j) {
int bit = 0;
for (int k = 0; k < 5; ++k) {
if (p[i][k] >= x || p[j][k] >= x) bit |= (1 << k);
}
if (can[31 ^ bit] == true) {
flg = true;
break;
}
}
if (flg) break;
}
if (flg) ok = x;
else ng = x;
}
cout << ok << endl;
return 0;
} | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long int
#define pii pair<int,int>
#define pll pair<long long int,long long int>
#define pci pair<char,int
#define mii map<int,int>
#define mll map<long long int,long long int>
#define mci map<char,int>
#define umii unordered_map<int,int>
#define umll unordered_map<long long int,long long int>
#define umci unordered_map<char,int>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define mod 998244353
using namespace std;
bool isPrime(ll n)
{
// Corner cases
if (n <= 1)
return false;
if (n <= 3)
return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll power(ll x,ll n)
{ll x1=0;
ll result=1;
while(n>0)
{
if(n % 2 ==1)
result=(result * x);
// if(result>=1000000001) return 0;
x=(x*x);
// if(x>=1000000001) return 0;
n=n/2;
}
return result;
}
int main(){
IOS;
ll t;t=1;
while(t--){
ll n,s,d;
cin>>n>>s>>d;
ll ans=0;
for(ll i=0;i<n;i++){
ll a,b;cin>>a>>b;
if(a<s&&b>d) ans=1;
}
if(ans) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
} |
/*
* @Author: LetMeFly
* @Date: 2021-03-20 20:07:22
* @LastEditors: LetMeFly
* @LastEditTime: 2021-03-20 20:19:10
*/
#include <bits/stdc++.h>
using namespace std;
#define mem(a) memset(a, 0, sizeof(a))
#define dbg(x) cout << #x << " = " << x << endl
#define fi(i, l, r) for (int i = l; i < r; i++)
#define cd(a) scanf("%d", &a)
typedef long long ll;
ll ten[20];
int len(ll n)
{
int ans = 0;
while (n)
{
n /= 10;
ans++;
}
return ans;
}
int main()
{
for (int i = 0; i < 13; i++)
{
ten[i] = pow(10, i);
}
ll n;
cin >> n;
int l = len(n);
if (l % 2)
{
int s = l / 2;
if (!s)
putchar('0');
for (int i = 0; i < s; i++)
putchar('9');
puts("");
}
else
{
int s = l / 2;
ll hou = n % ten[s];
ll qian = n / ten[s];
// printf("%lld, %lld\n", qian, hou); //**********
if (qian > hou)
{
printf("%lld\n", qian - 1);
}
else
{
printf("%lld\n", qian);
}
}
return 0;
} | #pragma warning (disable:4996)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#define ll long long
#define REP(i, n) for(int i = 0; i < n; i++)
#define SET(a) ll a = 0; (void)scanf("%lld", &a);
#define NMAX 100000 //提出前に変更 100000
#define MMAX 20
//int countDifference(char*, char*, int);
bool judgeAns(char*, char*, int);
int main() {
SET(N); SET(M);
char S[NMAX][MMAX];
REP(i, N)(void)scanf("%s", S[i]);
/*
REP(i, N) {
(void)scanf("\n");
REP(j, M)(void)scanf("%c", &S[i][j]);
}
*/
//printf("Hello, world!");
//int ex = countDifference(S[0], S[1], M);
/*
int ans = 0;
REP(i, N) {
for (int j = i + 1; j < N; j++) {
int dif = countDifference(S[i], S[j], M);
if (dif % 2 == 1)ans++;
}
}
printf("%d", ans);
*/
/*
int ans = 0;
REP(i, N)for (int j = i + 1; j < N; j++)if (judgeAns(S[i], S[j], M))ans++;
printf("%d", ans);
*/
ll ans = 0;
for (int i = 1; i < N; i++)if (judgeAns(S[0], S[i], M))ans++;
printf("%lld", ans * (N - ans));
return 0;
}
/*
int countDifference(char* s, char* t, int m) {
int count = 0;
REP(i, m)if (s[i] != t[i])count++;
return count;
}
*/
bool judgeAns(char* s, char* t, int m) {
int count = 0;
REP(i, m)if (s[i] != t[i])count++;
return (count % 2);
} |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
int x[10000];
int main()
{
int n;
int cnt=1;
int i,j;
int lowest=1000000000;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
lowest=min(x[i],lowest);
}
unordered_map<int,int> memo;
for(i=0;i<n;i++)
{
for(j=1;j*j<=x[i]&&j<lowest;j++)
{
if(x[i]%j==0)
{
memo[j]=__gcd(x[i],memo[j]);
if(x[i]/j<lowest)
{
memo[x[i]/j]=__gcd(memo[x[i]/j],x[i]);
}
}
}
}
for(auto tmp:memo)
{
if(tmp.first==tmp.second)
{
cnt++;
}
}
printf("%d",cnt);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 400010
ll i, i1, j, k, k1, t, n, m, res, flag[10], a[maxn], b;
priority_queue<ll> pq;
void add(ll x) {
pq.push(-x); res += x;
}
ll rm() {
ll x = pq.top(); pq.pop(); res += x; return -x;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#if !ONLINE_JUDGE && !EVAL
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
cin >> n;
for (i = 1; i <= 2 * n; i++) {
cin >> a[i];
}
for (i = n; i >= 1; i--) {
add(max(a[i], a[2 * n - i + 1]));
add(max(rm(), min(a[i], a[2 * n - i + 1])));
// cout << res << nl;
}
cout << res << nl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VII;
typedef vector<ll> VL;
typedef vector<vector<ll>> VLL;
constexpr int mod = 1e9 + 7;
constexpr int KINF = 0x3f3f3f3f;
constexpr double eps = 1e-7;
int main(){
ios::sync_with_stdio(false); cin.tie(0);
int n, m;
cin >> n >> m;
VI a(m), b(m);
_rep(i, 0, m) cin >> a[i] >> b[i], -- a[i], -- b[i];
VI c(n);
_rep(i, 0, n) cin >> c[i];
VII edge(n, VI(n));
VII g(n);
_rep(i, 0, m){
if(c[a[i]] > c[b[i]])
edge[a[i]][b[i]] = 1;
else if(c[b[i]] > c[a[i]])
edge[b[i]][a[i]] = 1;
else{
g[a[i]].eb(b[i]);
g[b[i]].eb(a[i]);
}
}
VI vis(n), dfn(n);
int rk = 0;
function<void(int, int)> dfs = [&](int u, int fa){
dfn[u] = rk ++;
vis[u] = 1;
for(int& v : g[u]){
if(!vis[v]){
dfs(v, u);
edge[u][v] = 1;
}
else{
if(v == fa) continue;
if(dfn[v] < dfn[u]) edge[u][v] = 1;
}
}
};
_rep(i, 0, n)
if(!vis[i]) dfs(i, -1);
_rep(i, 0, m){
if(edge[a[i]][b[i]]) cout << "->" << endl;
else cout << "<-" << endl;
}
return 0;
}
// 注意int转long long会溢出
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i = (l); i <= (r); ++i)
typedef long long ll;
void fast() {
ios::sync_with_stdio (0);
cin.tie (0); cout.tie (0);
}
int a[2];
int main() {
fast();
cin >> a[0] >> a[1];
int c;
cin >> c; int p = c;
while (a[p] >= 0) {
--a[p];
p ^= 1;
}
cout << ((p == 0) ? ("Aoki") : ("Takahashi ")) << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,a[202020],b[202020],c[202020];
int tr[202020];
void gx(int x)
{
while(x<=n)
{
tr[x]++;
x+=(x&(-x));
}
}
int gt(int x)
{
int ans=0;
while(x>0)
{
ans+=tr[x];
x-=(x&(-x));
}
return ans;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
a[i]+=i;
}
for(int i=1;i<=n;i++)
{
cin>>b[i];
b[i]+=i;
}
vector<pair<int,int> >v1,v2;
for(int i=1;i<=n;i++)
{
v1.push_back(make_pair(a[i],i));
v2.push_back(make_pair(b[i],i));
}
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
bool ok=true;
long long ans=0;
for(int i=0;i<n;i++)
{
if(v1[i].first!=v2[i].first)
{
ok=false;
break;
}
}
if(!ok)
{
cout<<-1<<endl;
return 0;
}
for(int i=0;i<n;i++)
{
c[v2[i].second]=v1[i].second;
}
for(int i=1;i<=n;i++)
{
// cout<<c[i]<<endl;
gx(c[i]);
ans+=(i-gt(c[i]));
// cout<<gt(c[i])<<endl;
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a),(i##i)=(b);i<=(i##i);++i)
#define rep(i,n) for(int i=0,(i##i)=(n);i<(i##i);++i)
#define Fodn(i,a,b) for(int i=(a),(i##i)=(b);i>=(i##i);--i)
#define pln puts("")
#define il inline
#define pb push_back()
#define ff first
#define ss second
using LL=long long;
using U32=unsigned int;
using U64=unsigned LL;
using LD=long double;
template<typename T>
using pii=pair<T,T>;
template<typename T>
il bool read(T&x){
x=0;char c=getchar();int f=1;
while(!isdigit(c)&&(c!='-')&&(c!=EOF))c=getchar();
if(c==EOF)return 0;if(c=='-')f=-1,c=getchar();
while(isdigit(c)){x=(x<<1)+(x<<3)+(c&15);c=getchar();}
x*=f;return 1;
}
template<typename T,typename...Args>
il bool read(T&x,Args&...args){bool res=1;res&=read(x);res&=read(args...);return res;}
const double EPS=1e-6;
const int M=1000000007,INF=0x3f3f3f3f;
const LL INFLL=0x3f3f3f3f3f3f3f3fLL;
const int N=500010;
int fa[N],d[N],s[N];
int f(int x){
if(fa[x]==x)return x;
return fa[x]=f(fa[x]);
}
int n,a[N],b[N];
bool h[N];
il void init(){
read(n);For(i,1,n)read(a[i],b[i]);
For(i,1,400000)fa[i]=i,s[i]=1;
}
int ans;
il void solve(){
For(i,1,n){
int u=f(a[i]),v=f(b[i]);
if(u==v)++d[u];
else{
fa[u]=v;
d[v]+=d[u]+1;
s[v]+=s[u];
}
}
For(i,1,400000){
int u=f(i);
if(h[u])continue;
h[u]=1;
if(d[u]+1==s[u])ans+=d[u];else ans+=s[u];
}
printf("%d\n",ans);
}
signed main(){
init();solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e18+999999
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A.at(i);
vector<vector<ll>> acc(N+1, vector<ll>(N+1, 0));
rep(i, N){
rep2(j, 1, N+1){
acc.at(i+1).at(j) = (acc.at(i).at(j) + A.at(i)) % j;
}
}
vector<vector<mint>> dp(N+1, vector<mint>(N+1, 0));
//dp.at(i).at(j)はi番目までの部分列をj個に分割する方法の数
dp.at(0).at(0) = 1;
vector<vector<mint>> memo(N+1, vector<mint>(N+1, 0));
//memo.at(i).at(j)はacc.at(k).at(i)==jとなる全てのkにおけるdp.at(k).at(i-1)の総和;
memo.at(1).at(0) = 1;
rep(i, N){
rep2(j, 1, N+1){
dp.at(i+1).at(j) = memo.at(j).at(acc.at(i+1).at(j));
//右辺はacc.at(k).at(j)==acc.at(i+1).at(j)となる全てのkにおけるdp.at(k).at(j-1)の総和
//cout << i+1 << " " << j << " " << dp.at(i+1).at(j) << endl;
}
rep2(j, 2, N+1){
memo.at(j).at(acc.at(i+1).at(j)) += dp.at(i+1).at(j-1);
}
}
mint ans = 0;
rep(i, N){
ans += dp.at(N).at(i+1);
}
cout << ans << '\n';
} | #include<bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
os << p.first << " " << p.second;
return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
is >> p.first >> p.second;
return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
for(int i = 0; i < (int) v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
for(T &in : v) is >> in;
return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
FixPoint(F &&f) : F(forward< F >(f)) {}
template< typename... Args >
decltype(auto) operator()(Args &&... args) const {
return F::operator()(*this, forward< Args >(args)...);
}
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
return FixPoint< F >{forward< F >(f)};
}
int main() {
int N;
cin >> N;
vector< int64 > A(N), B(N);
cin >> A >> B;
vector< int64 > ans;
int64 x = 0, y = 0;
for(int i = 0; i < N; i++) {
chmax(x, A[i]);
chmax(y, x * B[i]);
cout << y << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define pob pop_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define pll pair<long long int,long long int>
/* unordered_map<int,int>mp; mp.reserve(1024); mp.max_load_factor(0.25); */
#define mod 1000000007
#define mod2 998244353
#define ll long long int
#define ld long double
#define pi 3.141592653589793238
#define Endl endl
#define endl "\n"
const int N = 1e6 + 15;
const ll inf = 1e18;
void solve()
{
ll l , r;
cin >> l >> r;
vll a(N);
for(ll i = 2 ; i <= 1e6 ; i++ )
{
ll k = (r/i) - (l-1)/i;
a[i] = (k*(k-1))/2;
}
for(ll i = 1e6 ; i >= 2 ; i-- )
{
for(ll j = 2*i ; j <= 1e6 ; j += i)
a[i] -= a[j];
}
ll ans = 0;
for(ll i = 2 ; i <= 1e6 ; i++ )
{
if(i >= l and i <= r)
{
a[i] -= ((r/i - (l-1)/i) - 1);
}
// if(i >= 2 and i <= 8)
// cout << i << " " << a[i] << endl;
}
for(ll i = 2 ; i <= 1e6 ; i++ )
ans += a[i];
cout << ans*2;
}
void debug(ll tt) {}
signed main()
{
FAST;
int t = 1;
// cin >> t;
while(t--)
{
solve();
}
}
// freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 998244353
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
// aのn乗を求める(modp)
int modPow(ll a, ll n, ll p) {
if (n == 0) return 1; // 0乗にも対応する場合
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
int main(){
ll n, m;
cin >> n >> m;
ll ans;
ans = modPow(10, n, m*m);
ans = ans / m;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <long long> vll;
typedef vector <pair<ll,ll>> vpll;
#define f(i,a,b) for(ll i=a ; i<b ; i++)
ll a[140000];
void arr(){
a[1]=1;
f(i,1,17){
ll l=(1L<<i),r=(1L<<(i+1));
f(j,l,r) a[j]=i+1;
}
}
int main(){
ll n; cin >> n;
arr();
f(i,1,n+1) cout << a[i] << " ";
return 0;
} | #include <iostream>
#include <vector>
#include <utility>
#include<algorithm>
#include <string>
#include <map>
#include <cmath>
#include <random>
#include <tuple>
#define ll long long
using namespace std;
int main(){
ll b;
cin >> b;
ll n = 100000;
vector<int> pri = {2};
for(int i = 3;i < 100000;i ++){
int j = 0;
bool jud = true;
while(pri[j]*pri[j] <= i){
if(i % pri[j] == 0){
jud = false;
break;
}
j ++;
}
if(jud){
pri.push_back(i);
}
}
vector<int> ans(n,0);
ans[1-1] = 1;
for(int i:pri){
ans[i-1] = 2;
}
for(int i = 1;i <= n;i ++){
if(ans[i-1] == 0){
int p = i;
int j = 0;
int nu = 0;
int need = 0;
while(p != 1){
if(p % pri[j] == 0){
p = p/pri[j];
need ++;
}else{
j ++;
}
}
ans[i-1] = need+1;
}
}
for(int i = 0;i < b;i ++){
cout << ans[i] << endl;
}
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return 0;}
template<typename T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return 0;}
int calcPow(int x, int y) {
int z = 1;
while (y > 0) {
if (y & 1) {
z = (z * x) % 7;;
}
x = (x * x) % 7;
y /= 2;
}
return z;
}
int memo(const string& S, const string& X, vector<vector<int>>& dp, int idx, int mod, int pow) {
if (idx == S.size()) {
return mod == 0;
}
if (dp[idx][mod] >= 0) {
return dp[idx][mod];
}
int nxt_pow = (pow * calcPow(10, 5)) % 7;
if (X[idx] == 'A') {
return dp[idx][mod] = memo(S, X, dp, idx + 1, (mod + (S[idx] - '0') * pow) % 7, nxt_pow) & memo(S, X, dp, idx + 1, mod, nxt_pow);
} else {
return dp[idx][mod] = memo(S, X, dp, idx + 1, (mod + (S[idx] - '0') * pow) % 7, nxt_pow) | memo(S, X, dp, idx + 1, mod, nxt_pow);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string S, X;
cin >> N >> S >> X;
int pow = 1;
rep(i, 0, N - 1) {
pow = (pow * 10) % 7;
}
vector<vector<int>> dp(N, vector<int>(7, -1));
if (memo(S, X, dp, 0, 0, pow)) {
cout << "Takahashi" << endl;
} else {
cout << "Aoki" << endl;
}
return 0;
} | //I still luve you Kashish <3
#include<bits/stdc++.h>
using namespace std ;
#define int long long
#define pb push_back
#define F first
#define S second
#define P push
#define nl "\n"
#define vvi vector<vector<int>>
#define vi vector<int>
#define vc vector<char>
#define pii vector<pair<int, int>>
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define sort(v) sort(all(v))
#define sortr(v) sort(v); reverse(all(v));
#define yes cout << "YES"
#define no cout << "NO"
#define PeeleMera ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
int binpow(int a, int b) { int res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res;}
const int N = 1e9 + 7 , N1 = 1e7 + 5 , N2 = 1e6 + 3, N3 = 1e5 + 3;
#define IM -1e18
#define IX 1e18
// int binpowmod(int n,int p,int c)
// {
// if (p==0)
// {
// return 1%c;
// }
// int m=binpowmod(n,p/2,c);
// m*=m;
// m%=c;
// if (p%2)
// {
// m*=n%c;
// m%=c;
// }
// return m;
// }
int binpowmod(int a, int b, int mod)
{
int res = 1;
while (b > 0)
{
if (b & 1) res = res * a , res = res % mod ;
a = a * a , a = a % mod ;
b >>= 1 ;
}
return res % mod;
}
void solve()
{
int a,b,c;
cin>>a>>b>>c;
a=a%10;
vi va;
set<int> ss;
for(int i=1;i<=4;i++)
{
int x=binpow(a,i);
if(ss.count(x%10)==1)
break;
va.pb(x%10);
ss.insert(x%10);
}
int mod=sz(va);
int x=binpowmod(b,c,mod);
if(x==0) x=sz(va);
cout<<binpow(a,x)%10;
}
signed main(){
PeeleMera;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
// cin>>t;
// cout<<fixed<<setprecision(9);
while(t--)
{
solve();
cout<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
vector<int> v;
vector<bool> vis;
cin >> n;
vis.assign(n , false);
v.assign(n, 0);
int input;
for(int i = 0; i < n; i++)
{
cin >> input;
v[i] = input;
}
long long int count = 0;
for(int i = 0; i < n; i++)
{
if(vis[i] == true){
continue;
}
vis[i] = true;
long long int temp = 1;
for(int j = i + 1; j < n; j++){
if(vis[j] == true){
continue;
}
int diff = abs(v[i] - v[j]);
if(diff % 200 == 0){
temp++;
vis[j] = true;
}
}
count += (temp * (temp - 1)) / 2;
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 0; i<N; i++) {
int A=0;
cin >> A;
if (A > 10) {
ans = ans + A - 10;
}
}
cout << ans << endl;
} |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define f first
#define s second
#define pb push_back
const char el = '\n';
// clang-format off
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T_vector>void output_vector(const T_vector &v, bool add_one = false, int start = -1, int end = -1) {if (start < 0) start = 0; if (end < 0) end = int(v.size()); for (int i = start; i < end; i++) cout << v[i] + (add_one ? 1 : 0) << (i < end - 1 ? ' ' : '\n');}
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << "(" << v.first << ":" << v.second << ")" << ","; os << "}"; return os; }
auto random_address = [] {char *p = new char; delete p;return uint64_t(p);};
const uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1);
mt19937_64 rng(SEED);
// clang-format on
ll max_pair(int N) {
ll a = 0, b = 0;
ll possible = 0;
for (int i = 2; i <= N; i++) {
a += b;
b += 1;
possible += b;
}
return possible;
}
ll max_pair2(ll N) { return (N * (N - 1)) / 2; }
void solve() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (auto &x : A) cin >> x;
rep(i, 0, N) B[i] = A[i] % 200;
sort(B.begin(), B.end());
ll mx = max_pair2(N);
ll ans = mx;
vector<int> freq(N + 1);
for (int i = 0; i < N - 1; i++) {
if (B[i] == B[i + 1]) {
freq[i + 1] = freq[i] + 1;
}
}
// cout << freq << endl;
for (int i = 0; i < sz(freq); i++) {
if (freq[i] > 0) {
mx -= freq[i];
}
}
cout << ans - mx << el;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// int tests;
// cin >> tests;
// while (tests-- > 0)
solve();
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=1e5;
const int inf=1e9;
int main(){
int N; cin>>N;
int a; long cnt[200] = {};
rep(i,0,N){
cin>>a;
cnt[a%200]++;
}
long ans = 0;
rep(i,0,200) ans += cnt[i] * (cnt[i] - 1) / 2;
cout<<ans<<endl;
} |
# include <iostream>
# include <utility>
# include <iterator>
# include <string>
# include <stdio.h>
# include <map>
# include <unordered_map>
# include <algorithm>
# include <queue>
# include <vector>
# include <climits>
# include <cstring>
# include <set>
# include <unordered_set>
# include <sstream>
# include <deque>
# include <bitset>
# include <functional>
# include <numeric>
# include <stack>
# include <limits>
# include <time.h>
# include <math.h>
# include <stdlib.h>
# include <assert.h>
using namespace std;
# define SAMRAT ios::sync_with_stdio(0);cin.tie(0);
# define LL long long
# define FOR(i,x,y) for(LL i=x;i<y;i++)
# define RFOR(i,x,y) for(LL i=x;i>=y;i--)
# define DEBUG_VAR(x) cout<<x<<endl;
# define DEBUG_1D(x,a,b) FOR(i,a,b){cout<<x[i]<<" ";}cout<<endl;
# define DEBUG_2D(x,a1,b1,a2,b2) FOR(i,a1,b1){FOR(j,a2,b2){cout<<x[i][j]<<" ";}cout<<endl;}
# define ALL(x) x.begin(), x.end()
# define MOD (LL)(1e9+7)
# define INF8 (LL)(1e17+5)
typedef vector<LL> VI;
typedef vector<string> VS;
typedef vector<vector<LL> > VVI;
typedef pair<LL, LL> PI;
typedef pair<LL, PI > PPI;
typedef vector<PI > VP;
typedef vector<PPI > VPP;
inline LL mod(LL x) {
return (x%MOD + MOD)%MOD;
}
LL POWER(LL x, LL y) {
LL res = 1;
x = x%MOD;
if (x == 0) return 0;
while (y > 0) {
if (y&1) res = mod(res * x);
y >>= 1; x = mod(x * x);
}
return res;
}
int main() {
SAMRAT
int t = 1;
// cin >> t;
while (t--) {
int n; cin >> n;
vector<pair<int, string> > arr;
FOR (i, 0, n) {
string s;
int x;
cin >> s >> x;
arr.push_back({x, s});
}
sort(ALL(arr));
cout << arr[n - 2].second << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
vector<int> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int ans = 1000000000000000000ll;
int N;
int arr[100];
void fun(int cur, int val) {
bool flag = true;
for( int i=0; i<N; i++ ) {
if( __gcd(arr[i], val ) == 1 ) {
flag = false;
break;
}
}
if( flag ) ans = min(ans, val);
if( cur == primes.size() ) return;
fun(cur + 1, val);
fun(cur + 1, val*primes[cur]);
}
void solve() {
cin >> N;
unordered_map<int,int> mark;
for( int i=0; i<N; i++ ) {
cin >> arr[i];
}
fun(0, 1);
cout << ans;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
//cin >> tc;
while( tc-- ) {
solve();
// brute();
}
}
// Tarun IIITA
// "2021-03-14T17:21:19.000-05:00" |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define St first
#define Nd second
#define Pb push_back
#define print_pair(p) "{" << (p).St << ", " << (p).Nd << "} "
#define list_format(i, n) (i!=n? " ":"\n")
#define endl "\n"
#define sz(a) (int)a.size()
#define REP(i,a,b) for(int i = a; i <= b; i++)
#define REV(i,a,b) for(int i = a; i >= b; i--)
#define AritSum(a,d,n) ((n)*(2*(a)+((n)-1)*(d)))/2
#define Log(base, num) log2(num)/log2(base)
#define MOD 1000000007
#define INF 1e9 + 7
// ******************** Add-on *****************************
// ******************** Add-on *****************************
// ************* MAIN *******************
ll modInverse(ll a, ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
ll q = a / m;
ll t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
ll gcd(ll a, ll b) {
if (a < b) return gcd(b, a);
if (b == 0) return a;
return gcd(b, a % b);
}
void solve() {
ll n, s, k; cin >> n >> s >> k;
ll d = gcd(n, gcd(s, k));
n /= d;
s /= d;
k /= d;
if (gcd(n, k) != 1) {
cout << -1 << endl;
return;
}
ll inv = modInverse(k, n);
cout << (inv * (n - s)) % n << endl;
}
/*
g++ -std=c++14 -Wall -Wextra -O2 Test.cpp -o Test
./Test < in.txt
*/
int main() {
int _=1;
cin>>_;
REP(t,1,_) {
// cout << "Case #" << t << ": ";
solve();
// cout << ((solve())? "YES" : "NO") << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fr(i,t) for(i=0;i<t;i++)
#define fr1(i,r,t) for(i=r;i<t;i++)
typedef long long int lli;
typedef unsigned long long int ulli;
#define inf LONG_MAX
#define ff first
#define ss second
double pie=3.14159265358979323846;
#define dbug(x) cout<<#x<<"="<<x<<endl;
#define dbug2(x,y)
// lli M=1e9+7;
lli M=998244353;
#define gg cout<<"Case #"<<i+1<<": "
#define exact(x) cout<<fixed<<setprecision(8)<<x<<endl
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli T,n,i,j,k=0,m,j1,co=0,check,mi,l,sum;
lli ans=0;
// cin>>T;
// fr(i,T)
// {
cin>>n>>m>>k;
ans=((k*(k+1))/2)%M;
ans=(ans*(((m*(m+1))/2)%M))%M;
ans=(ans*(((n*(n+1))/2)%M))%M;
cout<<ans<<endl;
// }
}
|
/**
* author: kuins_air
* created: 07.05.2021 22:26:12
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, r, n) for(int i = r; i < n; i++)
int H, W, A[101][101];
int main() {
cin >> H >> W;
rep(h, 0, H) rep(w, 0, W) cin >> A[h][w];
int m = 101;
rep(h, 0, H) rep(w, 0, W) {
m = min(m, A[h][w]);
}
int ans = 0;
rep(h, 0, H) rep(w, 0, W){
ans += A[h][w] - m;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int h, w;
cin >> h >> w;
vector<vector<int>> grid(h, vector<int>(w, 0));
vector<vector<int>> hor(h, vector<int>(w, 0));
vector<vector<int>> ver(h, vector<int>(w, 0));
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
a--; b--;
hor[a][b] = 1;
ver[a][b] = 1;
}
for (int i = 0; i < m; ++i) {
int c, d;
cin >> c >> d;
c--; d--;
grid[c][d] = 1;
}
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (j > 0 && ver[i][j - 1] && !grid[i][j]) ver[i][j] = 1;
}
for (int j = w - 2; j >= 0; --j) {
if (j + 1 < w && ver[i][j + 1] && !grid[i][j]) ver[i][j] = 1;
}
}
for (int j = 0; j < w; ++j) {
for (int i = 0; i < h; ++i) {
if (i > 0 && hor[i - 1][j] && !grid[i][j]) hor[i][j] = 1;
}
for (int i = h - 2; i >= 0; --i) {
if (i + 1 < h && hor[i + 1][j] && !grid[i][j]) hor[i][j] = 1;
}
}
int count = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
count += (ver[i][j] || hor[i][j]);
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<int,int,int>
using Graph = vector<vector<int>>;
int main(){
ll N; cin >> N;
ll v[2*N]; ll sum = 0,loss = 0;
rep(i,2*N){
cin >> v[i]; sum += v[i];
}
ll k1 = N-1; ll k2 = N;
multiset<ll> mean;
rep(i,N){
mean.insert(v[k1]); mean.insert(v[k2]);
auto itr = mean.begin();
loss += *itr; mean.erase(itr);
k1--; k2++;
}
cout << sum-loss << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
for (auto i : x) cout << i << ' ';\
cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
return o >> a.X >> a.Y;
}
const int mod = 1e9 + 7, abc = 864197532, N = 2008, logN = 17, K = 333;
lli myceil(lli a, lli b) {
if (a <= 0) {
return a / b;
} else {
return (a + b - 1) / b;
}
}
lli myfloor(lli a, lli b) {
if (a >= 0) {
return a / b;
} else {
return (a - b + 1) / b;
}
}
lli mysqrt(lli x) {
lli l = 0, r = 2000000000;
while (r - l > 1) {
lli mid = (l + r) / 2;
if (mid * mid <= x) l = mid;
else r = mid;
}
return l;
}
lli get(){
string t;
cin >> t;
string qq;
int cnt = 0;
bool tmp = false;
for(char i : t){
if(i == '.') tmp = true;
else{
qq += i;
if(tmp) cnt++;
}
}
for(int j = 0; j + cnt < 4; j++) qq += '0';
return stoll(qq);
}
int main () {
ios::sync_with_stdio(false);
cin.tie(0);
/*
* (a - x)^2 + (b - y)^2 <= r^2;
* b^2 - 2by <= r^2 - y^2 - x^2 - a^2 + 2ax
* b^2 + Bb + C <= 0
*/
lli x = get(), y = get(), r = get();
lli ans = 0;
for (lli a = -200000; a <= 200000; a++) {
if (x - r > a * 10000 || a * 10000 > x + r) continue;
lli val = r * r - (a * 10000 - x) * (a * 10000 - x);
if (val < 0) continue;
lli sq = mysqrt(val);
lli L = myceil(y - sq, 10000), R = myfloor(y + sq, 10000);
// cout << a << ' ' << L << ' ' << R << endl;
ans += R - L + 1;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};
const ll INF = (1ll<<62);
// const ld EPS = 1e-10;
// const ld PI = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;
int main(){
ll N, A, B;
cin >> N >> A >> B;
cout << N - A + B << endl;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define f(i,a,b) for(ll i = a; i < (ll) b ; i++ )
#define af(i,a,b) for(ll i = a; i >= (ll) b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < (ll) b ; i+= k )
#define arep(i,a,b,k) for(ll i = a; i >= (ll) b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define sz(a) (ll) a.size()
#define sor(a) sort( a.begin(), a.end() )
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ller ios::sync_with_stdio(false);cin.tie(0)
// policy-based
using namespace std;
typedef long long ll; // ll or ll
typedef long double ld;
typedef pair<ll,ll> ii ;
typedef vector<ll> vi ;
typedef vector<ii> vii ;
const ll MAX = 3e5 + 20;
const ll mod = 1e9 + 7;
const ll inf = 2e9;
ll a[MAX],b[MAX];
int main(){
fastio;
ll n,x,y;
cin >> n;
f(i,0,n){
cin >> a[i] >> b[i];
}
ll ans = inf;
f(i,0,n){
f(j,0,n){
if(i == j) continue;
ans = min(ans,max(a[i], b[j]) );
}
ans = min(ans,a[i] + b[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const ll mod = 1e9+7;
ll mul(ll a,ll b){return ((a%mod)*(b%mod))%mod;}
ll sum(ll a,ll b){return ((a%mod)+(b%mod))%mod;}
ll sub(ll a,ll b){return ((a%mod)-(b%mod))%mod;}
ll power(ll a,ll b){
ll res = 1;
while(b){
if(b&1)res = mul(res,a);
b >>= 1;
a = mul(a,a);
}
return res;
}
const int maxn = 1000+10;
ll fib[maxn];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
fib[2] = fib[3] = 1;
forn(i,4,maxn)fib[i] = sum(fib[i-1],fib[i-2]);
int N; cin >> N;
char aa,ab,ba,bb; cin >> aa >> ab >> ba >> bb;
if(N <= 3){
cout << 1 << '\n';
return 0;
}
ll res = 0;
if(ab == 'A'){
if(aa == 'A'){
res = 1;
}else{
if(ba == 'B'){
res = power(2,N-3);
}else{
res = fib[N];
}
}
}else{
if(bb == 'B'){
res = 1;
}else{
if(ba == 'A'){
res = power(2,N-3);
}else{
res = fib[N];
}
}
}
if(res < 0)res += mod;
cout << res << '\n';
return 0;
}
/*
__builtin_mul_overflow(x,y,&x)
-fsplit-stack
*/
| #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for(int i = (int)(n); i < (int)(m); i++)
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<vector<int>> Alc(N, vector<int>(2));
rep(i, N) cin >> Alc[i][0] >> Alc[i][1];
bool flag = false;
int ml = 0;
int ans;
rep(i, N) {
ml += Alc[i][0]*Alc[i][1];
cerr << i+1 << " " << ml << endl;
if (ml > X*100) {
ans = i+1;
flag = true;
break;
}
}
if (flag) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
} |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define _roverload(_a1, _a2, _a3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _roverload(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); --i)
#define rrep(...) _roverload(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bit(n) (1LL << (n))
template <class T>
inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print() { cout << '\n'; }
template <class T>
void print(const vector<T> &v) {
bool f = false;
for (const auto &e : v) {
if (f) cout << ' ';
cout << e;
f = true;
}
cout << '\n';
}
template <class... T>
void print(const T &...args) {
bool f = false;
for (const auto &e : {args...}) {
if (f) cout << ' ';
cout << e;
f = true;
}
cout << '\n';
}
const int INF = 1002003004;
const ll LINF = 1002003004005006007ll;
struct preprocess {
preprocess() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} ____;
#pragma endregion head
#pragma region library
#pragma endregion library
int main() {
int a, b, c;
cin >> a >> b >> c;
vi ls1 = {a % 10};
ll now = a % 10;
while (true) {
now *= a;
now %= 10;
if (ls1[0] != now) {
ls1.emplace_back(now);
} else {
break;
}
}
int len = ls1.size();
vi ls2 = {b % len};
ll now2 = b % len;
bool flag = false;
int cnt = 1;
while (true) {
cnt++;
now2 *= b;
now2 %= len;
if (now2 == 0) {
flag = true;
break;
} else if (ls2[0] != now2) {
ls2.emplace_back(now2);
} else {
break;
}
}
int s2 = ls2[(c - 1 + ls2.size()) % ls2.size()];
if (flag && cnt<=c) s2 = 0;
int s1 = ls1[(s2 - 1 + ls1.size()) % ls1.size()];
print(s1);
} | #include<bits/stdc++.h>
using namespace std;
int main () { int N ;cin>>N;
string s ;int y;cin>>y>>s; int i;
for(i=0;i< s.length();i++){
if(y!=0){if(s[i]=='o') {y=y+1;}
else if (s[i]=='x'){y=y-1;}}
else if(y==0){if(s[i]=='o') {y=y+1;}
else if (s[i]=='x'){y=y;}}}
cout<<y;
return 0; } |
#include<bits/stdc++.h>
using namespace std;
int k,fact[5];
long long sol;
int main()
{
scanf("%d",&k);
fact[1]=1;
fact[2]=3;
fact[3]=6;
for(int i=1;(i*i*i)<=k;i++)
{
for(int j=i;(j*j)<=k/i;j++) {
int lim = (k / i) / j;
for (int z = j; z <= lim; z++) {
set<int> S;
// printf("%d %d %d\n", i, j, z);
S.insert(i);
S.insert(j);
S.insert(z);
sol += fact[(int) S.size()];
}
}
}
printf("%lld\n",sol);
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int m,a=1,b=1,c=1,k=0;
cin >> m;
for(int a=1;a<=m;a++){
for(int b=1;a*b<=m;b++){
for(int c=1;a*b*c<=m;c++)
k++;
}
}
cout << k;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <int> vi;
typedef pair <int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const double EPSILON = 0.001;
const int N = 1e6+5;
ll inverse(ll a, ll b){
ll inv = -1;
ll q, r, r1 = a, r2 = b, t, t1 = 0, t2 = 1;
while (r2 > 0){
q = r1 / r2;
r = r1 - q * r2;
r1 = r2;
r2 = r;
t = t1 - q * t2;
t1 = t2;
t2 = t;
}
if (r1 == 1)
inv = t1;
if (inv < 0)
inv = inv + a;
return inv;
}
ll mmc(ll a, ll b){
return (1ll * a * b )/ (1ll * __gcd(a,b));
}
//https://cp-algorithms.com/algebra/linear_congruence_equation.html
int main(){
fastio;
int t;
cin >> t;
while(t--){
ll n,s,a;
cin >> n >> s >> a;
ll d = (ll)__gcd(a,n);
ll b = -s + n;
ll a1 = a/d;
ll b1 = b/d;
ll n1 = n/d;
ll x = (b1 * inverse(n1, a1)) % n1;
if(((s+x*a)%n) != 0)
cout << -1 << '\n';
else cout << x << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
long long ans = 0;
cin >> n;
vector<int> t(n);
vector<double> l(n);
vector<double> r(n);
for (int i = 0; i < n; i++)
{
cin >> t.at(i) >> l.at(i) >> r.at(i);
}
for (int i = 0; i < n; i++)
{
switch (t.at(i))
{
case 1:
break;
case 2:
r.at(i) -= 0.5;
break;
case 3:
l.at(i) += 0.5;
break;
case 4:
r.at(i) -= 0.5;
l.at(i) += 0.5;
break;
}
}
for (int i = 0; i < n - 1; i++)
{
if (r.at(i) < l.at(i))
{
continue;
}
for (int j = i + 1; j < n; j++)
{
if (r.at(j) < l.at(i) || l.at(j) > r.at(i) || r.at(j) < l.at(j))
{
//cout << i << ' ' << j << endl;
continue;
}
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define lll long long
#define mp make_pair
#define pb push_back
ll inf = 1000000000000000000;
#define deci(n) fixed << setprecision(n)
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define umll unordered_map<ll, ll>
#define mll map<ll, ll>
//#define f first
//#define s second
#define mt make_tuple
#define g(i, name) get<i>(name)
using namespace std;
struct custom_hash
{
static uint64_t splitmix64(uint64_t x)
{
// http://xorshift.di.unimi.it/splitmix64.c
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 = std::chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct hash_pair
{
template <class T1, class T2>
size_t operator()(const pair<T1, T2> &p) const
{
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
ll p = 1e9 + 7;
//*****************CODE STARTS **************************************
//#define f first
ll mingap(vector <ll> & r, ll x, vector <ll> & g, ll y){
if(x==0 || y==0)return inf;
ll minrg=inf;
ll j=0;
for(ll i=0; i<x; i++){
while(j!=y-1 && g[j+1]<=r[i])j++;
minrg = min(minrg, abs(r[i]-g[j]));
if(g[j]<=r[i] && j!=y-1)j++;
minrg = min(minrg, abs(r[i]-g[j]));
}
return minrg;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n; cin >> n; n*=2;
vector <ll> r, g, b;
for(ll i=0; i<n; i++){
ll x; cin >> x; char c; cin >> c;
if(c=='R')r.pb(x);
else if(c=='G')g.pb(x);
else b.pb(x);
}
sort(r.begin(), r.end());
sort(g.begin(), g.end());
sort(b.begin(), b.end());
if(r.size()%2==0 && g.size()%2==0)cout << 0;
else if(r.size()%2==0){
ll minrg=inf, mingb=inf, minbr=inf;
ll x =r.size(), y=g.size(), z=b.size();
minrg = mingap(r, x, g, y);
mingb = mingap(g, y, b, z);
minbr = mingap(b, z, r, x);
//cout << minrg << " " << mingb << " " << minbr <<"\n";
cout << min(mingb, minrg+minbr);
}
else{
if(g.size()%2==0)swap(r, g);
else swap(r, b);
ll minrg=inf, mingb=inf, minbr=inf;
ll x =r.size(), y=g.size(), z=b.size();
minrg = mingap(r, x, g, y);
mingb = mingap(g, y, b, z);
minbr = mingap(b, z, r, x);
//cout << minrg << " " << mingb << " " << minbr <<"\n";
cout << min(mingb, minrg+minbr);
}
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<ll> a[3];
bool comp(vector<ll> &x, vector<ll> &y){
return ((int)x.size()&1)<((int)y.size()&1);
}
int main(){
int n;
scanf("%d", &n);
for (int i=0;i<n*2;i++){
char col;
ll val;
scanf("%lld %c", &val, &col);
if (col=='R') a[0].push_back(val);
if (col=='G') a[1].push_back(val);
if (col=='B') a[2].push_back(val);
}
for (int i=0;i<3;i++) sort(a[i].begin(), a[i].end());
sort(a, a+3, comp);
if (!(a[2].size()&1)){
printf("0\n"); return 0;
}
ll ans1=1e18, ans2=1e18;
for (auto &x:a[1]){
auto iter = lower_bound(a[2].begin(), a[2].end(), x);
if (iter!=a[2].end()) ans1 = min(ans1, (*iter)-x);
if (iter!=a[2].begin()) ans1 = min(ans1, x-(*(--iter)));
}
if (a[0].empty()){
printf("%lld\n", ans1); return 0;
}
vector<pair<ll, ll>> tmp(a[0].size(), {1e18, 1e18});
for (int i=0;i<(int)a[0].size();i++){
auto x = a[0][i];
auto iter = lower_bound(a[1].begin(), a[1].end(), x);
if (iter!=a[1].end()) tmp[i].first = (*iter)-x;
if (iter!=a[1].begin()) tmp[i].first = min(tmp[i].first, x-(*(--iter)));
}
for (int i=0;i<(int)a[0].size();i++){
auto x = a[0][i];
auto iter = lower_bound(a[2].begin(), a[2].end(), x);
if (iter!=a[2].end()) tmp[i].second = (*iter)-x;
if (iter!=a[2].begin()) tmp[i].second = min(tmp[i].second, x-(*(--iter)));
}
int idx = 0, idx2 = 0;
for (int i=0;i<(int)a[0].size();i++){
if (ans2>min(tmp[i].first, tmp[i].second)){
ans2 = min(tmp[i].first, tmp[i].second), idx = i;
if (tmp[i].first<tmp[i].second) idx2 = 1;
else idx2 = 2;
}
}
ll tmp2 = 1e18;
for (int i=0;i<(int)a[0].size();i++) if (i!=idx){
if (idx2==1) tmp2 = min(tmp2, tmp[i].second);
if (idx2==2) tmp2 = min(tmp2, tmp[i].first);
}
ans2 += tmp2;
ll ans3;
if (idx2==1) ans3 = tmp[idx].second;
else ans3 = tmp[idx].first;
tmp2 = 1e18;
for (int i=0;i<(int)a[0].size();i++) if (i!=idx){
if (idx2==2) tmp2 = min(tmp2, tmp[i].second);
if (idx2==1) tmp2 = min(tmp2, tmp[i].first);
}
ans3 += tmp2;
printf("%lld\n", min(ans1, min(ans2, ans3)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a{},b{},c{};
cin>>a>>b>>c;
if (a > b){
cout<<"Takahashi"<<endl;
}
if (a < b){
cout<<"Aoki"<<endl;
}
if (a == b){
if (c == 0){
cout<<"Aoki"<<endl;
}else{
cout<<"Takahashi"<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define WIDTH 30
#define HEIGHT 30
#define Que 1000
#define rep(i, n) for(int i=0;i<(n);i++)
int main() {
vector<int> Si(1000), Sj(1000), Ti(1000), Tj(1000);
auto t1 = chrono::high_resolution_clock::now();
rep(j, Que) {
auto t2 = chrono::high_resolution_clock::now();
cin >> Si[j] >> Sj[j] >> Ti[j] >> Tj[j];
int UD = Ti[j] - Si[j];
int LR = Tj[j] - Sj[j];
if(UD>0) { rep(i, UD) cout << "D";}
else if(UD<0) { rep(i, -UD) cout << "U"; }
if(LR>0) { rep(i, LR) cout << "R"; }
else if(LR<0) { rep(i, -LR) cout << "L"; }
if (chrono::duration_cast<chrono::milliseconds>(t2-t1).count()>200)
break;
cout << "\n" << flush;
int Bk;
cin >> Bk;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
const ll INF = LLONG_MAX;
const int MOD = 1e9+7;
const int MX = 2e5+7;
const double PI = 3.1415926535897932384626;
template<class T> void dbg(T val) {
cout << val << endl;
}
template<class T> void dbgs(T val) {
cout << val << " ";
}
void solve() {
ll N; cin >> N;
ll x = 0;
ll sum = 0;
for (ll i = 1;;++i) {
if (sum >= N) break;
sum += i;
x++;
}
dbg(x);
}
void fastIO(string name = "") {
cin.tie(0)->sync_with_stdio(0);
if (sz(name)) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
int main() {
fastIO("");
int tc = 1; //cin >> tc;
while (tc--) solve();
return 0;
} | #include <iostream>
#include <cfenv>
#include <cmath>
using namespace std;
int main(){
int N;
int x;
cin >> N;
for(int i =0; i < N + 1; i++){
x += i;
if(x >= N ){
cout << i << endl;
break;
}
}
} |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LL unsigned long long
#define vec(x) vector<x>
#define emb(x) emplace_back(x)
#define fall(x) x.begin(),x.end()
#define rfall(x) x.rbegin(),x.rend()
#define fo(a,b) for(int i=a; i < b; i++)
#define fset(x) setprecision(x) << fixed
#define fast ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
/*
*---------------------------------------------
* --------------------------------------------
* --------------------------------------------
*
العمل الجاد يتفوق على الموهبة الكسولة
* 勤勉は怠惰な才能に勝る
*
* 努力打敗懶惰的人才
*
* कड़ी मेहनत आलसी प्रतिभा को हरा देती है
*
* тяжелая работа превосходит ленивый талант
*
* 勤勉は怠惰な才能に勝る
*
* 努力打敗懶惰的人才
*
* malfacila laboro superas maldiligentan talenton
*
* el trabajo duro supera al talento perezoso
*
* η σκληρή δουλειά κερδίζει τεμπέλης ταλέντο
*
* il duro lavoro batte il talento pigro
*
* munca grea bate talentul leneș
*
* kazi ngumu hupiga talanta ya uvivu
*
* piger ingenii labore verberat
*
* làm việc chăm chỉ đánh bại tài năng lười biếng
*
* trabalho duro vence talento preguiçoso
*
* працавітасць перамагае лянівы талент
*
* le travail acharné bat le talent paresseux
*
* --------------------------------------------------
* --------------------------------------------------
* --------------------------------------------------
*/
int main(){
fast
ll X,Y;
ll newX,newY;
cin>>newX>>newY;
X=0,Y=0;
X=(newX+newY)/2;
Y=X-newY;
cout << X << " "<<Y<<endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
void ABrick(std::istream& in, std::ostream& out) {
int n, w;
in >> n >> w;
out << n / w << "\n";
}
int main(int argc, char** argv) { ABrick(cin, cout); return 0; }
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 55
ll A[SIZE],maxi[SIZE];
ll dp[SIZE][2];
int main(){
ll N,price;
scanf("%lld %lld",&N,&price);
for(ll i = 1; i <= N; i++){
scanf("%lld",&A[i]);
}
maxi[N] = HUGE_NUM;
for(ll i = N-1; i >= 1; i--){
maxi[i] = A[i+1]/A[i]-1; //その硬貨を払える最大枚数
}
stack<ll> S;
ll tmp = price;
for(ll i = N; i >= 1; i--){
if(A[i] <= tmp){
ll work = tmp/A[i];
S.push(work);
tmp %= A[i];
}else{
S.push(0);
}
}
for(int digit = 0; digit <= N; digit++){
for(int is_up = 0; is_up <= 1; is_up++){
dp[digit][is_up] = 0;
}
}
dp[0][0] = 1; //dp[桁][繰り上がりの有無] := 場合の数
for(ll digit = 1; digit <= N; digit++){
ll x = S.top();
S.pop();
for(ll pre_up = 0; pre_up <= 1; pre_up++){
if(dp[digit-1][pre_up] == 0)continue;
/*おつりと支払いが両方0*/
if((pre_up == 0 && x == 0) || (pre_up == 1 && x+pre_up == maxi[digit]+1)){
if(pre_up == 0 && x == 0){
dp[digit][0] += dp[digit-1][pre_up];
}else{
dp[digit][1] += dp[digit-1][pre_up];
}
}
/*おつりが0で支払いが非0*/
if((pre_up+x > 0 && pre_up+x != maxi[digit]+1)){
dp[digit][0] += dp[digit-1][pre_up];
}
/*おつりが非0で支払いが0→必ず繰り上がり*/
if(pre_up+x > 0 && pre_up+x <= maxi[digit]){
dp[digit][1] += dp[digit-1][pre_up];
}
}
}
printf("%lld\n",dp[N][0]);
return 0;
}
| // Problem: Blocks on Grid
// Date:
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n,m;
int a[101][101];
cin >> n >> m;
int minn=101;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j){
cin >> a[i][j];
if (a[i][j] < minn)
minn=a[i][j];
}
int res=0;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(a[i][j] > minn)
res+=a[i][j] - minn;
cout << res;
return 0;
} |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
template<class t> using vc=vector<t>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
a+=b;
if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
int n, m, a[105], b[105], k, c[16], d[16];
void solve(){
cin >> n >> m;
rep(i, m) cin >> a[i] >> b[i];
cin >> k;
rep(i, k) cin >> c[i] >> d[i];
int ans = 0;
rep(mask, (1<<k)){
bool ex[105] = {};
rep(i, k){
if(((mask>>i)&1)) ex[c[i]] = 1;
else ex[d[i]] = 1;
}
int tmp = 0;
rep(i, m){
tmp += ex[a[i]] && ex[b[i]];
}
chmax(ans, tmp);
}
cout << ans << endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
int t; t = 1; //cin >> t;
while(t--) solve();
}
| #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int N;
int to[400001], ne[400001], he[200001];
int Q[200001], vis[200001], p, q;
ll are[200001];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep1(i, N * 2 - 2) {
int a, b;
cin >> a >> b;
to[i] = b;
ne[i] = he[a];
he[a] = i++;
to[i] = a;
ne[i] = he[b];
he[b] = i;
}
Q[q++] = 1;
while (p < q) {
int u = Q[p++];
vis[u] = -1;
for (int i = he[u]; i; i = ne[i]) {
if (vis[to[i]] == 0) {
Q[q++] = to[i];
}
}
}
int tmp = Q[N - 1];
p = 0;
q = 0;
Q[q++] = tmp;
vis[tmp] = 0;
while (p < q) {
int u = Q[p++];
for (int i = he[u]; i; i = ne[i]) {
if (vis[to[i]] < 0) {
vis[to[i]] = u;
Q[q++] = to[i];
}
}
}
ll m = (1ll << 20) - 1, m0 = ~m, m1 = 1ll << 20;
for (int i = N - 1; i >= 0; i--) {
int u = Q[i];
ll kari = (are[u] & m0) + m1 + u;
if (are[vis[u]] < kari) are[vis[u]] = kari;
}
int k = 0;
q = 0;
Q[q++] = tmp;
while (q) {
k++;
int u = Q[q - 1];
if (u < 0) q--;
else {
vis[u] = -k;
Q[q - 1] = -u;
int nanika = are[u] & m;
if(nanika) Q[q++] = nanika;
for (int i = he[u]; i; i = ne[i]) {
int v = to[i];
if (vis[v] >= 0 && v != nanika) {
Q[q++] = v;
}
}
}
}
rep1(i, N) cosp(-vis[i]);
Would you please return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
#define LLINF (1LL<<60)
template<class T,class C> T max(T a,C b){ return std::max(a, (T)b); }
template<class T,class C> T min(T a,C b){ return std::min(a, (T)b); }
//TSPここから
struct TSP{//n<=17
int n;
vector<vector<ll> > dist;
vector<vector<ll> > dp;
TSP() : n(17){
init();
}
TSP(int n_){
n = n_;
init();
}
void init(){//全体初期化
ll i;
dist.resize(n);
for(i=0;i<dist.size();i++){
dist[i].assign(n,LLINF);
}
dp_init();
}
void dp_init(){//dpのみ初期化
ll i;
dp.resize(1<<n);
for(i=0;i<dp.size();i++){
dp[i].assign(n,LLINF);
}
}
void create_edge(ll s,ll t,ll d){//有向辺生成
//s!=t,0<=s,t<n,d>=1
dist[s][t] = min(dist[s][t],d);
}
void create_edge_each(ll a,ll b,ll d){//無向辺生成
create_edge(a,b,d);
create_edge(b,a,d);
}
void delete_edge(ll s,ll t){//辺の削除
dist[s][t] = LLINF;
}
ll find_shortest_path(ll s){//最短距離(巡回)取得 O(N^2 2^N)
//0<=s<n,-1=notfound
ll i,j,k;
dp_init();
dp[0][s] = 0;
for(i=0;i<(1<<n);i++){
for(j=0;j<n;j++){
for(k=0;k<n;k++){
dp[i|1<<k][k] = min(dp[i|1<<k][k], dp[i][j]+dist[j][k]);
}
}
}
ll res = dp[(1<<n)-1][s];
return (res>=LLINF ? -1 : res);
}
ll find_shortest_path_2(){//最短距離(パス,始点任意)取得 O(N^2 2^N)
//0<=s<n,-1=notfound
ll i,j,k;
dp_init();
for(ll s=0;s<n;s++) dp[1<<s][s] = 0;
for(i=0;i<(1<<n);i++){
for(j=0;j<n;j++){
for(k=0;k<n;k++){
dp[i|1<<k][k] = min(dp[i|1<<k][k], dp[i][j]+dist[j][k]);
}
}
}
ll res = dp[(1<<n)-1][0];
for(i=1;i<n;i++){
res = min(res, dp[(1<<n)-1][i]);
}
return (res>=LLINF ? -1 : res);
}
ll find_shortest_path_2(ll s){//最短距離(パス,始点固定)取得 O(N^2 2^N)
//0<=s<n,-1=notfound
ll i,j,k;
dp_init();
dp[1<<s][s] = 0;
for(i=0;i<(1<<n);i++){
for(j=0;j<n;j++){
for(k=0;k<n;k++){
dp[i|1<<k][k] = min(dp[i|1<<k][k], dp[i][j]+dist[j][k]);
}
}
}
ll res = dp[(1<<n)-1][0];
for(i=1;i<n;i++){
res = min(res, dp[(1<<n)-1][i]);
}
return (res>=LLINF ? -1 : res);
}
};
//TSPここまで
vector<ll> edgeA[100010];
ll edgeB[20][20]={};
ll getEdge(ll s,ll t){
return edgeB[s][t];
}
ll dist[100010]={};
int main(){
ll i,j,n,m,a,b,k,c[20];
queue<ll> que;
cin >> n >> m;
for(i=0;i<m;i++){
//a=i+1;b=i+2;
cin >> a >> b;
a--;b--;
edgeA[a].push_back(b);
edgeA[b].push_back(a);
}
cin >> k;
for(i=0;i<k;i++){
//if(i==k-1) c[i]=n;
//else c[i]=i+1;
cin >> c[i];
c[i]--;
}
for(i=0;i<k;i++){
ll tmp = c[i];
que.push(tmp);
for(j=0;j<n;j++){
dist[j]=LLINF;
}
dist[tmp]=0;
while(!que.empty()){
auto p = que.front();
que.pop();
//cout << p << endl;
for(auto q :edgeA[p]){
if(dist[q]==LLINF){
dist[q] = dist[p]+1;
que.push(q);
}
}
}
for(j=0;j<k;j++){
ll tmp2 = c[j];
if(i==j) continue;
edgeB[i][j] = dist[tmp2];
}
}
TSP tsp(k);
for(i=0;i<k;i++){
for(j=0;j<k;j++){
if(i==j) continue;
tsp.create_edge(i,j,getEdge(i,j));
}
}
ll res = tsp.find_shortest_path_2();
cout << (res==-1 ? -1 : res+1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> adj_list(n);
vector<vector<bool>> adj_matrix(n, vector<bool>(n, 0));
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
--u;
--v;
adj_list[u].push_back(v);
adj_list[v].push_back(u);
adj_matrix[u][v] = true;
adj_matrix[v][u] = true;
}
vector<bool> is_complete(1 << n, false);
is_complete[0] = true;
for (int mask = 1; mask < (1 << n); ++mask) {
int i = 0;
while (!(mask & (1 << i))) {
++i;
}
if (!is_complete[mask ^ (1 << i)]) {
continue;
}
is_complete[mask] = true;
for (int j = i + 1; j < n; ++j) {
if ((mask & (1 << j)) && !adj_matrix[i][j]) {
is_complete[mask] = false;
}
}
}
vector<int> components(1 << n, 2 * n + 1);
components[0] = 0;
for (int mask = 1; mask < (1 << n); ++mask) {
if (is_complete[mask]) {
components[mask] = 1;
continue;
}
int i = 0;
while (!((1 << i) & mask)) {
++i;
}
int smaller_mask = mask ^ (1 << i);
for (int lower_mask = smaller_mask; lower_mask != 0; lower_mask = (lower_mask - 1) & smaller_mask) {
if (is_complete[mask ^ lower_mask]) {
components[mask] = min(components[mask], 1 + components[lower_mask]);
}
}
}
cout << components[(1 << n) - 1] << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void fail(){
cout << -1 << '\n';
exit(0);
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n, l;
cin >> n >> l;
long long ans = 0;
vector<int> a(n+2), b(n+2);
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) cin >> b[i];
a[0] = b[0] = 0;
a[n+1] = b[n+1] = l+1;
for(int i = 1; i <= n+1; i++){
a[i] -= i; b[i] -= i;
}
l -= n;
for(int i = 1; i + 1 <= n; i++){
if(a[i] < b[i] && b[i+1] < a[i+1]){
fail();
}
}
for(int j = 0; j < 2; j++){
int cur = n-1;
for(int i = n; i >= 1; i--){
if(a[i] > b[i]){
if(b[i] == b[i-1]){
ans++;
} else {
while(cur >= 0 && a[cur] > b[i]){
cur--;
}
if(cur < 0 || a[cur] != b[i]) fail();
ans += i - cur;
}
}
}
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for(int& x : a) x = l - x;
for(int& x : b) x = l - x;
}
cout << ans << '\n';
} | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n,l;
int arr[100005];
int brr[100005];
map<int,int> mx;
map<int,int> mn;
void rage(){
cout<<"-1"<<endl;
exit(0);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>l;
rep(x,0,n) cin>>arr[x];
rep(x,0,n) cin>>brr[x];
rep(x,0,n) if (!mx.count(arr[x]-x)) mx[arr[x]-x]=x;
if (!mx.count(l-n+1)) mx[l-n+1]=n;
rep(x,n,0) if (!mn.count(arr[x]-x)) mn[arr[x]-x]=x;
if (!mn.count(1)) mn[1]=-1;
//for (auto &it:mn) cout<<it.fi<<"_"<<it.se<<" "; cout<<endl;
//for (auto &it:mx) cout<<it.fi<<"_"<<it.se<<" "; cout<<endl;
ll ans=0;
rep(x,0,n){
if (arr[x]==brr[x]) continue;
if (arr[x]>brr[x]){ //move stuff left
if (x!=0 && brr[x-1]==brr[x]-1) ans++;
else{
//cout<<"mn: "<<brr[x]-x<<" "<<x<<endl;
if (!mn.count(brr[x]-x)) rage();
ans+=x-mn[brr[x]-x];
}
}
else{
if (x!=n-1 && brr[x]+1==brr[x+1]) ans++;
else{
//cout<<"mx: "<<brr[x]-x<<" "<<x<<endl;
if (!mx.count(brr[x]-x)) rage();
ans+=mx[brr[x]-x]-x;
}
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,in,fn) for(int i=in;i<=fn;i++)
#define debug(x) cerr << #x << ": " << x << endl
int main(){
int a;
cin >> a;
int b = 100 - a % 100;
cout << b << endl;
}
// puts(ans ? "Yes" : "No"); // 1 or 0
// if (ans == 1) cout << "Yes" << endl;
// else cout << "No" << endl;
| #include <bits/stdc++.h>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pow power
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define siz(a) int((a).size())
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
#define endl "\n"
#define pi 3.14159265
const ll mod = 1000 * 1000 * 1000 + 7;
const ll mod1 = 998244353;
const ll INF = 1ll*1000*1000*1000*1000*1000*1000 + 7;
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//typedef tree<pair<ll, ll>,null_type,less<pair<ll, ll>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
using namespace std;
ll power(ll x, ll y)
{
ll res = 1;
while (y > 0)
{
if (y & 1)
res = (long long)(res*x);
y = y>>1;
x = (long long)(x*x);
//cout<<x<<'\n';
}
return res;
}
// Stolen Templates
template <typename T>
T MIN(T first) { return first; }
template <typename T, typename... Args>
T MIN(T first, Args... args) { return min(first, MIN(args...)); }
template <typename T>
T MAX(T first) { return first; }
template <typename T, typename... Args>
T MAX(T first, Args... args) { return max(first, MAX(args...)); }
// Stolen Templates end here
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fastio();
ll n;
cin>>n;
ll q =n/100;
cout<<(q+1)*100-n;
return 0;
}
// check all product based operations for integer overflow
// careful of renamed variables especially in loops
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long double lb = 0;
long double rb = 2e9 + 9;
long double p = 1.0 / (long double) n;
auto f = [&](long double x) {
long double E = 0.0;
for (int i = 0; i < n; i++) {
long double v = x + a[i] - min((long double) a[i], 2.0 * x);
E += p * v;
}
return E;
};
for (int i = 0; i < 300; i++) {
long double g = lb + (rb - lb) / 3.0;
long double h = lb + 2.0 * (rb - lb) / 3.0;
if (f(g) < f(h)) {
rb = h;
} else {
lb = g;
}
}
cout << setprecision(8) << fixed << f(lb) << '\n';
return 0;
}
// B
| #pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#define vvll vector <vll>
#define vpll vector <pll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define mll map <ll, ll>
#define fastmap gp_hash_table
#define cd complex <double>
#define vcd vector <cd>
#define PI 3.14159265358979
#define ordered_set tree <ll, null_type, less <ll>, rb_tree_tag, tree_order_statistics_node_update>
#pragma 03
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(){
ll n; cin >> n;
string s1, s2, s3; cin >> s1 >> s2 >> s3;
string ans; ans.resize(2 * n + 1);
ans[0] = '1';
for (ll i = 1; i <= n; i++) ans[i] = '0';
for (ll i = n + 1; i <= 2 * n; i++) ans[i] = '1';
cout << ans << "\n";
}
int main(){
fastio;
ll t; cin >> t;
while (t--) solve();
} |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9;
const ll inf64 = 1e18;
int main() {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1), p(n + 1), f(n + 1), pp;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++)
cin >> p[i];
pp = p;
set<pii> q;
for (int i = 1; i <= n; i++)
f[p[i]] = i;
for (int i = 1; i <= n; i++) {
if (i == p[i])
continue;
q.insert({b[i], i});
if (a[i] <= b[p[i]]) {
cout << "-1\n";
return 0;
}
}
vector<pii> res;
while (!q.empty()) {
int i = (--q.end())->second;
q.erase(--q.end());
if (p[i] == i)
continue;
int j = f[i], k = p[i];
res.emplace_back(i, j);
p[i] = i;
f[i] = i;
p[j] = k;
f[k] = j;
}
p = pp;
cout << (int) res.size() << "\n";
for (auto [i, j] : res) {
assert(a[i] > b[p[i]]);
assert(a[j] > b[p[j]]);
cout << i << " " << j << "\n";
swap(p[i], p[j]);
}
for (int i = 1; i <= n; i++)
assert(p[i] == i);
return 0;
}
| #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) x.begin(),x.end()
#define SZ(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#define V vector
#define P pair<int,int>
#define F first
#define S second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using ld = long double;
using namespace std;
const int INF =1001001001;
const int MAX = 2e6+1;
int main() {
int a,b;cin>>a>>b;
int w;cin>>w;
w*=1000;
int ans1=0,ans2=INF;
rep(i,1,1e+7){
double x = (double)w/i;
if(a<=x&&x<=b){
chmax(ans1,i);
chmin(ans2,i);
}
}
if(ans2==INF){
cout<<"UNSATISFIABLE"<<endl;
return 0;
}
cout<<ans2<<" "<<ans1<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int main() {
ll n;
cin >> n;
ll x = 1000;
ll ans = 0;
while(n-x+1 >= 1) {
ans += n-x+1;
x*=1000;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> oset;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
#define ar array
clock_t time_req = clock()*1.0/CLOCKS_PER_SEC;
bool slope(pair<int,int> a , pair<int,int> b , pair<int,int> c){
return (b.second-a.second)*(c.first-b.first) == (c.second-b.second)*(b.first-a.first);
}
#define int ll
void test_case() {
int n;
cin >> n;
if(n <= 999){
cout<<"0\n";
return;
}
// int ans2 = 0;
// for(int i = 999 ; i <= n ; i++){
// if(i > 999 && i < 1000000)
// ans2++;
// if(i >= 1000000 && i < 1000000000)
// ans2+=2;
// }
// cout<<ans2<<"\n";
if(n >= 999 && n < 1000000){
cout<<n-999<<"\n";
return;
}
if(n >= 1000000 && n < 1000000000){
int ans = (n-999999)*2 + (999999-999);
cout<<ans<<"\n";
return;
}
if(n >= 1000000000 && n < 1000000000000){
int ans = (n-999999999)*3+(999999999-999999)*2+(999999-999);
cout<<ans<<"\n";
return;
}
if(n >= 1000000000000 && n < 1000000000000000){
int ans = (n-999999999999)*4+(999999999999-999999999)*3+(999999999-999999)*2+(999999-999);
cout<<ans<<"\n";
return;
}
else{
// int ans = (n-999999999999)*4+(999999999999-999999999)*3+(999999999-999999)*2+(999999-999);
cout<<3998998998999005<<"\n";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(10);
int T = 1;
// cin >> T;
while(T--){
test_case();
}
}
// dont take stress
// remember the i , j index in double loop
// typing slow but dont make mistake while thinking and typing
//(x,y) , (x1,y1) , (x2,y2)
// (y1-y)/(x1-x) == (y2-y1)/(x2-x1)
// (y1-y)*(x2-x1) == ()s
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#define ll long long
#define rep(i, a, b) for (int i = a; i <= (int)b; i ++)
#define per(i, a, b) for (int i = (int)a; i >= b; i --)
template < typename T > void read(T & x) {
x = 0; int flag = 1; char c = getchar();
for(; !isdigit(c); c = getchar()) if(c == '-') flag = -1;
for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= flag;
}
using namespace std;
const int maxn = 5010, mod = 998244353;
int n, m, k, a[maxn][maxn], f[maxn][maxn][3], b[maxn][maxn], c[maxn][maxn], power[maxn];
void upd(int & x, int y) { x += y; if(x >= mod) x -= mod; }
int main()
{
memset(a, -1, sizeof(a));
scanf("%d %d %d", &n, &m, &k);
rep(i, 1, k) {
int x, y; char ch;
scanf("%d %d", &x, &y); cin >> ch;
if(ch == 'X') a[x][y] = 0;
else if(ch == 'R') a[x][y] = 1;
else a[x][y] = 2;
}
rep(i, 1, n) rep(j, 1, m)
b[i][j] = b[i - 1][j] + (a[i][j] == -1 ? 1 : 0),
c[i][j] = c[i][j - 1] + (a[i][j] == -1 ? 1 : 0);
if(a[1][1] == -1) f[1][1][0] = f[1][1][1] = f[1][1][2] = 1;
else f[1][1][a[1][1]] = 1;
power[0] = 1;
rep(i, 1, max(n, m)) power[i] = 1ll * power[i - 1] * 3 % mod;
rep(i, 1, n) rep(j, 1, m) {
int tmp1 = power[b[i - 1][j + 1]], tmp2 = power[c[i + 1][j - 1]];
//rep(k, 0, 2) f[i][j][k] = 1ll * f[i][j][k] * tmp % mod;
if(a[i][j] != -1) {
if(a[i][j] == 1) {
rep(k, 0, 2) upd(f[i][j + 1][k], 1ll * tmp1 * f[i][j][1] % mod);
}
else if(a[i][j] == 2) {
rep(k, 0, 2) upd(f[i + 1][j][k], 1ll * tmp2 * f[i][j][2] % mod);
}
else {
rep(k, 0, 2) upd(f[i + 1][j][k], 1ll * tmp2 * f[i][j][0] % mod), upd(f[i][j + 1][k], 1ll * tmp1 * f[i][j][0]%mod);
}
continue;
}
rep(k, 0, 2) {
upd(f[i + 1][j][k], 1ll * tmp2 * f[i][j][0]% mod), upd(f[i][j + 1][k], 1ll * tmp1 * f[i][j][0]%mod);
upd(f[i][j + 1][k], 1ll * tmp1 * f[i][j][1]%mod);
upd(f[i + 1][j][k], 1ll * tmp2 * f[i][j][2]%mod);
}
}
if(a[n][m] == -1) upd(f[n][m][0], f[n][m][1]), upd(f[n][m][0], f[n][m][2]), printf("%d\n", f[n][m][0]);
else printf("%d\n", f[n][m][a[n][m]]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,k;
cin >> H >> W >> k;
int h[k],w[k];
char c[k];
char masu[H + 1][W + 1];
for(int i = 0 ; i < H ; i++){
for(int j = 0 ; j < W ; j++){
masu[i][j] = '-';
}
}
for(int i = 0 ; i < k ; i++){
cin >> h[i] >> w[i] >> c[i];
h[i]--; w[i]--;
masu[h[i]][w[i]] = c[i];
}
long long beki[10100];
beki[0] = 1;
for(int i = 1; i<=10000 ;i++){
beki[i] = beki[i-1]*3;
beki[i] %= 998244353;
}
int yoko[H];
int tate[W];
long long dp[H + 1][W + 1];
dp[H - 1][W - 1] = 1;
for(int i = 0 ; i < H ; i++){
yoko[i] = 0;
dp[i][W] = 0;
}
for(int i = 0 ; i < W ; i++){
tate[i] = 0;
dp[H][i] = 0;
}
for(int i = H - 1 ; i >= 0 ; i--){
for(int j = W - 1 ; j >= 0 ; j--){
if(i == H - 1 && j == W - 1){
if(masu[i][j] == '-'){
dp[i][j] = 3;
yoko[i] += 1;
tate[j] += 1;
}
if(masu[i][j] != '-')dp[i][j] = 1;
continue;
}
dp[i][j] = 0;
if(masu[i][j] == 'R'){
dp[i][j] += beki[tate[j]] * dp[i][j + 1];
dp[i][j] %= 998244353;
}
if(masu[i][j] == 'D'){
dp[i][j] += beki[yoko[i]] * dp[i + 1][j];
dp[i][j] %= 998244353;
}
if(masu[i][j] == 'X'){
dp[i][j] += beki[yoko[i]] * dp[i + 1][j];
dp[i][j] %= 998244353;
dp[i][j] += beki[tate[j]] * dp[i][j + 1];
dp[i][j] %= 998244353;
}
if(masu[i][j] == '-'){
dp[i][j] += beki[yoko[i]] * dp[i + 1][j];
dp[i][j] %= 998244353;
dp[i][j] += beki[tate[j]] * dp[i][j + 1];
dp[i][j] %= 998244353;
dp[i][j] *= 2;
dp[i][j] %= 998244353;
}
dp[i][j] %= 998244353;
if(masu[i][j] == '-'){
yoko[i] += 1;
tate[j] += 1;
}
}
}
cout << dp[0][0];
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using ll = long long;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
const int mod = 1e9 + 7;
void solve()
{
int n;
cin >> n;
vector<pair<int, int>> x, y;
for (int i = 0; i < n; i++)
{
int a, b;
cin >> a >> b;
x.push_back({a, i});
y.push_back({b, i});
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
vector<pair<int, pair<int, int>>> ans;
ans.push_back({abs(x[0].first - x[n - 1].first), {min(x[0].second, x[n - 1].second), max(x[0].second, x[n - 1].second)}});
ans.push_back({abs(x[0].first - x[n - 2].first), {min(x[0].second, x[n - 2].second), max(x[0].second, x[n - 2].second)}});
ans.push_back({abs(x[1].first - x[n - 1].first), {min(x[1].second, x[n - 1].second), max(x[1].second, x[n - 1].second)}});
ans.push_back({abs(y[0].first - y[n - 1].first), {min(y[0].second, y[n - 1].second), max(y[0].second, y[n - 1].second)}});
ans.push_back({abs(y[0].first - y[n - 2].first), {min(y[0].second, y[n - 2].second), max(y[0].second, y[n - 2].second)}});
ans.push_back({abs(y[1].first - y[n - 1].first), {min(y[1].second, y[n - 1].second), max(y[1].second, y[n - 1].second)}});
sort(ans.begin(), ans.end());
for (int i = 4; i >= 0; i--)
{
if (ans[5].second != ans[i].second)
{
cout << ans[i].first << endl;
return;
}
}
}
int main()
{
fast;
int t = 1;
//cin >> t;
while (t--)
{
solve();
}
return 0;
} | #define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
const int DIV = 998244353;
void solve(int test, std::istream &in) {
int n, m, k;
in >> n >> m;
vector<char> dish(n, 0);
vector<int> a(m), b(m);
for (int i = 0; i < m; i++) {
in >> a[i] >> b[i];
a[i]--;
b[i]--;
}
in >> k;
vector<int> c(k), d(k);
for (int i = 0; i < k; i++) {
in >> c[i] >> d[i];
c[i]--;
d[i]--;
}
int answer = 0;
int maxMask = 1 << k;
for (int mask = 0; mask < maxMask; mask++) {
int tmp = mask;
for (int i = 0; i < k; i++) {
int x = (tmp & 1) ? c[i] : d[i];
dish[x]++;
tmp >>= 1;
}
int cur = 0;
for (int i = 0; i < m; i++) {
if (dish[a[i]] > 0 && dish[b[i]] > 0)
cur++;
}
if (cur > answer)
answer = cur;
tmp = mask;
for (int i = 0; i < k; i++) {
int x = (tmp & 1) ? c[i] : d[i];
dish[x]--;
tmp >>= 1;
}
}
printf("%d\n", answer);
}
int main(int argc, char *argv[]) {
#ifdef VLAD_LOCAL
ifstream in("in.txt");
auto start = std::chrono::steady_clock::now();
#else
istream &in = cin;
#endif
solve(0, in);
#ifdef VLAD_LOCAL
auto end = std::chrono::steady_clock::now();
double seconds = (double)std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count() / 1000;
printf("%.3lf seconds\n", seconds);
#endif
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
ll t,N; cin>>t>>N;
ll ct=N/t;
ll gen = 100*ct;
// gen--;
ct *=t;
ll l=gen+1 + ((gen+1)*t)/100, r=gen+((gen*t)/100);
cerr << ct << endl;
cerr << gen << endl;
// int k=5;
while(1){
if(ct==N){
cout << r-1 << endl;
return 0;
}
l=gen+1 + ((gen+1)*t)/100;
r=gen+((gen*t)/100);
// cerr << l <<" " << r << endl;
if(l-r>=2){
ct++;
if(ct==N) break;
}
gen++;
}
cout << r+1 << endl;
// for(int i=1; 1<=100; i++){
// if()
// }
// ll en=1;
// while((en+1)*t<100){
// en++;
// }
// ll ret = en;
// // cerr << en << endl;
// en *= N;
// while(N>0){
// N /=100;
// en += N*ret;
// }
// // cerr << en << endl;
// // int k=5;
// while(1){
// // ll l=((100+t)*en/100;
// // cerr << l << endl;
// ll l=en+1 + ((en+1)*t)/100;
// ll r=en+((en*t)/100);
// cerr << en+1 + ((en+1)*t)/100 << " " << en+((en*t)/100) << endl;
// if(l-r>=2){
// break;
// }
// en++;
// }
// cout << en+((en*t)/100) + 1<< endl;
}
| #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
ll t,n;
cin>>t>>n;
//take A = 100/t *n
ll ans = 100*n;
ans=(ans+t-1)/t;
ans+=n-1;
cout<<ans<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
long long n,q,a[200005],t[200005],z;
struct name
{
long long x,i;
}f[200005];
int cmp1(struct name f1,struct name f2)
{return f1.x < f2.x;}
int cmp2(struct name f1,struct name f2)
{return f1.i < f2.i;}
int main ()
{
scanf ("%lld",&n);
for (int i = 1;i <= n;++i)
scanf ("%lld %lld",a+i,t+i);
scanf ("%lld",&q);
for (int i = 1;i <= q;++i)
scanf ("%lld",&f[i].x),f[i].i = i;
sort(f+1,f+q+1,cmp1);
for (int i = 1;i <= n;++i)
{
if (t[i] == 1) z += a[i];
else if (t[i] == 2)
for (int j = 1;j <= q && f[j].x+z < a[i];++j)
f[j].x = a[i]-z;
else
for (int j = q;j >= 1 && f[j].x+z > a[i];--j)
f[j].x = a[i]-z;
}
sort(f+1,f+1+q,cmp2);
for (int i = 1;i <= q;++i)
printf ("%lld\n",f[i].x+z);
return 0;
} | #include<ctime>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define le(p) ((p)<<1)
#define ri(p) ((p)<<1|1)
#define ll long long
using namespace std;
const ll N=1e6+7;
const ll ninf=-5e18;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
struct que{
ll x,i;
que(ll a=0,ll b=0){
x=a;
i=b;
}
friend bool operator <(que a,que b){
return a.x<b.x;
}
};
que s[N];
ll n,q,a[N],t[N],ans[N];
ll L[N],R[N],S[N],Z[N],mx[N],mn[N],add[N];
void up(ll p){
mx[p]=max(mx[le(p)],mx[ri(p)]);
mn[p]=min(mn[le(p)],mn[ri(p)]);
}
void down(ll p){
if(S[p]^ninf){
S[le(p)]=S[p];
S[ri(p)]=S[p];
mx[le(p)]=S[p];
mn[le(p)]=S[p];
mx[ri(p)]=S[p];
mn[ri(p)]=S[p];
S[p]=ninf;
}
if(Z[p]){
Z[le(p)]=1;
Z[ri(p)]=1;
add[le(p)]=0;
add[ri(p)]=0;
Z[p]=0;
}
mx[le(p)]+=add[p];
mn[le(p)]+=add[p];
mx[ri(p)]+=add[p];
mn[ri(p)]+=add[p];
add[le(p)]+=add[p];
add[ri(p)]+=add[p];
add[p]=0;
}
void build(ll p,ll l,ll r){
L[p]=l;
R[p]=r;
if(l==r){
S[p]=s[l].x;
mx[p]=s[l].x;
mn[p]=s[l].x;
return;
}
ll m=(l+r)>>1;
build(le(p),l,m);
build(ri(p),m+1,r);
S[p]=ninf;
up(p);
}
void tomin(ll p,ll l,ll r,ll k){
if(mx[p]<k)
return;
if(mn[p]>=k){
S[p]=k;
mx[p]=k;
mn[p]=k;
add[p]=0;
Z[p]=1;
return;
}
down(p);
tomin(le(p),l,r,k);
tomin(ri(p),l,r,k);
up(p);
}
void tomax(ll p,ll l,ll r,ll k){
if(mn[p]>k)
return;
if(mx[p]<=k){
S[p]=k;
mx[p]=k;
mn[p]=k;
add[p]=0;
Z[p]=1;
return;
}
down(p);
tomax(le(p),l,r,k);
tomax(ri(p),l,r,k);
up(p);
}
ll query(ll p,ll x){
if(L[p]==R[p])
return mx[p];
down(p);
ll m=(L[p]+R[p])>>1;
if(x<=m)
return query(le(p),x);
return query(ri(p),x);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("E.in","r",stdin);
freopen("E.out","w",stdout);
#endif
clock_t t1=clock();
//--------
n=read();
for(ll i=1;i<=n;++i){
a[i]=read();
t[i]=read();
}
q=read();
for(ll i=1;i<=q;++i)
s[i]=que(read(),i);
sort(s+1,s+q+1);
build(1,1,q);
for(ll i=1;i<=n;++i){
switch(t[i]){
case 1:
mx[1]+=a[i];
mn[1]+=a[i];
add[1]+=a[i];
break;
case 2:
tomax(1,1,n,a[i]);
break;
case 3:
tomin(1,1,n,a[i]);
break;
}
}
for(ll i=1;i<=q;++i)
ans[s[i].i]=query(1,i);
for(ll i=1;i<=q;++i)
printf("%lld\n",ans[i]);
//--------
clock_t t2=clock();
fprintf(stderr,"time:%0.3lfs",1.0*(t2-t1)/CLOCKS_PER_SEC);
return 0;
} |
#pragma warning(disable:4996)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
int main() {
//freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
ll n;
while (cin >> n)
{
int a[18] = { 0 };
int top = -1, sum = 0;
int ans = INT_MAX;
bool flag = true;
ll tempn = n;
while (tempn) {
a[++top] = tempn % 10;
sum += tempn % 10;
tempn /= 10;
}
for (int i = 0; i <= (1 << 18); i += 1) {
tempn = n;
int state = i, pos = 0, num = 0;
while (state) {
if (state & 1) tempn -= a[pos], ++num;
++pos;
state >>= 1;
}
if (num > top) break;
if (tempn % 3 == 0) ans = min(ans, num), flag = false;
}
if (flag) cout << "-1" << endl;
else cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define setIO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int) (x).size()
#define lc(i) 2*i
#define rc(i) 2*i+1
//#define int long long
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vii = vector<ii>;
using vi = vector<int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vvb = vector<vb>;
const int N = 1e5 + 5, MOD = 1e9 + 7, INF = 1e9 + 5;
signed main() {
FAST_IO;
#ifdef arujbansal_local
setIO("input.txt", "output.txt");
#endif
string s;
cin >> s;
int n = sz(s);
vi a(n);
for (int i = 0; i < n; i++) a[i] = s[i] - '0';
int mn = n;
for (int mask = 1; mask < (1 << n); mask++) {
int num = 0, sum = 0;
for (int i = 0; i < n; i++) {
if (mask & (1 << i)) {
sum += a[n - i - 1];
num++;
}
}
if (sum % 3 == 0)
mn = min(mn, n - num);
}
cout << (mn == n ? -1 : mn);
} |
/*---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
// #define kyoa_a
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define rrep(a, b, c) for(int a = (b); a > c; --a)
#define each(a, b) for(auto& a : b)
#define sz(x) (int)(x).size()
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define dbg(x) cout << #x << " = " << x << endl;
#define vt vector
#define ar array
#define pii pair<int, int>
#define vi vector<int>
#define pll pair<ll, ll>
#define pct(x) __builtin_popcount(x)
#define fbo(x) find_by_order(x)
#define ook(x) order_of_key(x)
#define rsz resize
constexpr int log2(int x) { return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x))
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> bool umin(T& a, const T& b){
return b<a?a=b, 1:0;
}
template <class T> bool umax(T& a, const T& b){
return a<b?a=b, 1:0;
}
using ll = long long;
using ld = long double;
using str = string;
const int inf = (int)1e9 + 5;
const ll infl = (ll)1e18 + 5;
const int mod = 1e9 + 7;
const int N = 55;
const int A = 911382323;
const int B = 972663749;
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
/*---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---XXX---*/
vt<int> p;
vt<ll> al;
int n, a[N], fi;
void solve(){
rep(i, 2, 51){
bool ok = 1;
for(int j = 2; j*j <= i; ++j){
if(i%j == 0){
ok = 0;
break;
}
}
if(ok) p.eb(i);
}
fi = 1<<sz(p);
rep(i, 1, fi){
ll ans = 1;
rep(j, 0, sz(p)){
if(i&(1<<j)) ans *= p[j];
}
al.eb(ans);
}
sort(all(al));
cin >> n;
rep(i, 0, n) cin >> a[i];
each(x, al){
bool ok = 1;
rep(i, 0, n){
if(__gcd(x, (ll)a[i]) == 1){
ok = 0;
break;
}
}
if(ok){
cout << x << '\n';
return;
}
}
}
int main(){
#ifdef kyoa_a
auto begin = std::chrono::high_resolution_clock::now();
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
#ifdef kyoa_a
auto end = std::chrono::high_resolution_clock::now();
cout << setprecision(3) << fixed;
cout << "Execution time: " << std::chrono::duration_cast<std::chrono::duration<double>>(end - begin).count() << " seconds" << endl;
#endif
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=5005,mod=998244353;
int dp[15][nax],f[nax],invf[nax],pw[30];
int mul(int x,int y)
{
return x*y%mod;
}
int nck(int n,int r)
{
if(r<0 || r>n)
return 0;
return (f[n]*invf[n-r]%mod*invf[r]%mod);
}
int expo(int a,int b)
{
int res=1;
while(b>0)
{
if(b%2==1)
res=mul(res,a);
a=mul(a,a);
b>>=1;
}
return res;
}
int inv(int x)
{
return expo(x,mod-2);
}
void init()
{
f[0]=1;
for(int i=1;i<nax;i++)
f[i]=(f[i-1]*i)%mod;
invf[nax-1]=inv(f[nax-1]);
for(int i=nax-2;i>=0;i--)
invf[i]=(invf[i+1]*(i+1))%mod;
}
int n;
int dfs(int pos,int val)
{
if(val&pw[pos])
return 0;
if(~dp[pos][val])
return dp[pos][val];
if(pos==13)
{
if(val)
return 0;
return 1;
}
int res=0;
for(int i=0;pw[pos]*i<=val;i+=2)
res=(res+mul(nck(n,i),dfs(pos+1,val-pw[pos]*i)))%mod;
return dp[pos][val]=res;
}
int32_t main()
{
init();
memset(dp,-1,sizeof(dp));
int m;
cin>>n>>m;
pw[0]=1;
for(int i=1;i<30;i++)
pw[i]=mul(pw[i-1],2LL);
cout<<dfs(0,m);
return 0;
} |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 998244353;
long long modpow(long long x, long long n){
long long res = 1;
long long mul = x;
while(n){
if(n % 2) res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
struct Combination
{
int maxn;
std::vector<long long> fact;
std::vector<long long> ifact;
Combination(int maxn) : maxn(maxn){
fact.resize(maxn + 1);
ifact.resize(maxn + 1);
fact[0] = 1;
for(int i = 1; i <= maxn; i++) fact[i] = fact[i - 1] * i % MOD;
ifact[maxn] = modpow(fact[maxn], MOD - 2);
for(int i = maxn - 1; i >= 0; i--) ifact[i] = ifact[i + 1] * (i + 1) % MOD;
}
long long com(int n, int k){
if(k > n || k < 0) return 0;
if(k == n || k == 0) return 1;
return (fact[n] * ifact[k] % MOD) * ifact[n - k] % MOD;
}
};
struct PrimeDecomposition
{
int n;
vector<bool> p;
vector<int> prime;
vector<int> d;
PrimeDecomposition(int n) : n(n){
p.resize(n + 1);
d.resize(n + 1);
d[1] = 1;
for(int i = 2; i <= n; i++){
if(!p[i]){
prime.push_back(i);
for(int j = i; j <= n; j += i){
if(!p[j]) d[j] = i;
p[j] = true;
}
}
}
}
vector<int> decomposition(int x){
vector<int> res;
while(x > 1){
res.push_back(d[x]);
x /= d[x];
}
return res;
}
};
int main()
{
int n, m;
cin >> n >> m;
PrimeDecomposition dec(m);
Combination com(n * 2 + m);
ll ans = 1;
for(int i = 2; i <= m; i++){
vector<int> v = dec.decomposition(i);
int l = v.size();
ll s = 1;
int c = 1;
for(int i = 1; i <= l; i++){
if(i == l || v[i] != v[i - 1]){
s = s * com.com(n + c - 1, c) % MOD;
c = 1;
}
else c++;
if(i == l) break;
}
ans = (ans + s) % MOD;
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, c;
cin >> r >> c;
vector<string> g(r);
vector<vector<pair<int,int>>> occ(26);
pair<int,int> start;
pair<int,int> goal;
for(int i = 0; i < r; i++) {
cin >> g[i];
for(int j = 0; j < c; j++) {
if(g[i][j] == 'S') {
start = mp(i, j);
} else if(g[i][j] == 'G') {
goal = mp(i, j);
} else if(isalpha(g[i][j])) {
occ[g[i][j] - 'a'].pb(mp(i, j));
}
}
}
queue<pair<int,int>> q;
vector<vector<bool>> vis(r, vector<bool>(c));
vector<bool> visColor(26);
q.push(start);
vector<vector<int>> dist(r, vector<int>(c, 1 << 30));
dist[start.first][start.second] = 0;
int dx[4] = {-1,1,0,0};
int dy[4] = {0,0,1,-1};
while(!q.empty()) {
pii p = q.front();
q.pop();
int i = p.first;
int j = p.second;
if(isalpha(g[i][j]) && g[i][j] != 'S' && g[i][j] != 'G' && !visColor[g[i][j] - 'a']) {
trav(e, occ[g[i][j] - 'a']) {
int nr = e.first;
int nc = e.second;
if(!vis[nr][nc] && g[nr][nc] != '#') {
dist[nr][nc] = 1 + dist[i][j];
vis[nr][nc] = true;
q.push(mp(nr, nc));
}
}
visColor[g[i][j] - 'a'] = true;
}
for(int x = 0; x < 4; x++) {
int nr = i + dx[x];
int nc = j + dy[x];
if(nr >= 0 && nr < r && nc < c && nc >= 0) {
if(!vis[nr][nc] && g[nr][nc] != '#') {
dist[nr][nc] = 1 + dist[i][j];
q.push(mp(nr, nc));
vis[nr][nc] = true;
}
}
}
}
cout << (dist[goal.first][goal.second] == 1 << 30 ? -1 : dist[goal.first][goal.second]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 200005;
int n;
int pos[N][2], ans[2];
int32_t main(int32_t argc, char const *argv[])
{
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int x, c;
cin >> x >> c;
if (!pos[c][0])
pos[c][0] = pos[c][1] = x;
else
{
pos[c][0] = min(pos[c][0], x);
pos[c][1] = max(pos[c][1], x);
}
}
int pv = -1;
for (int i = 1; i <= n; ++i)
{
if (!pos[i][0])
continue;
//cout << pos[i][0] << ' ' << pos[i][1] << '\n';
if (pv == -1)
{
ans[0] += abs(pos[i][0]);
ans[1] += abs(pos[i][1]);
ans[0] += pos[i][1] - pos[i][0];
ans[1] += pos[i][1] - pos[i][0];
pv = i;
}
else
{
int x = ans[0];
int y = ans[1];
ans[0] = min(x + abs(pos[i][0] - pos[pv][1]), y + abs(pos[i][0] - pos[pv][0]));
ans[1] = min(x + abs(pos[i][1] - pos[pv][1]), y + abs(pos[i][1] - pos[pv][0]));
ans[0] += pos[i][1] - pos[i][0];
ans[1] += pos[i][1] - pos[i][0];
pv = i;
}
}
cout << min(ans[0] + abs(pos[pv][1]), ans[1] + abs(pos[pv][0])) << '\n';
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order(k): It returns to an iterator to the kth element (counting from zero) in the set
// order_of_key(k) : It returns to the number of items that are strictly smaller than our item k
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define f first
#define s second
#define F(i,a,b) for(i=a;i<b;i++)
#define nl "\n"
#define sp " "
#define all(c) (c).begin(),(c).end()
#define rev(i,b,a) for(int i=b;i>=a;i--)
#define iota cout<<-1<<nl
#define cty cout<<"YES"<<nl
#define ctn cout<<"NO"<<nl
#define lmax LLONG_MAX
#define lmin LLONG_MIN
#define sz(v) (v).size()
#define deci(n) fixed<<setprecision(n)
#define c(x) cout<<(x)
#define csp(x) cout<<(x)<<" "
#define c1(x) cout<<(x)<<nl
#define c2(x,y) cout<<(x)<<" "<<(y)<<nl
#define c3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<nl
#define c4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<nl
#define c5(a,b,c,d,e) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<" "<<(e)<<nl
#define c6(a,b,c,d,e,f) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<" "<<(e)<<" "<<(f)<<nl
typedef long double ld;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
const int mod=998244353;
const double pi=3.14159265358979323846264338327950288419716939937510582097494459230;
// priority_queue<t>
ll poww(ll a, ll b) { ll res=1; while(b) { if(b&1) res=(res*a); a=(a*a); b>>=1; } return res; }
ll modI(ll a, ll m=mod) { ll m0=m,y=0,x=1; if(m==1) return 0; while(a>1) { ll q=a/m; ll t=m; m=a%m; a=t; t=y; y=x-q*y; x=t; } if(x<0) x+=m0; return x;}
ll powm(ll a, ll b,ll m=mod) {ll res=1; while(b) { if(b&1) res=(res*a)%m; a=(a*a)%m; b>>=1; } return res;}
//*******************************************************************************************************************************************//
void iamzeus()
{ ll i,j,x=0,y,ans=0,n,m,d,cnt=0,z,c=2,k;
cin>>n;
vll v[n+1];
for(i=0;i<n;i++){
cin>>x>>y;
v[y].pb(x);
}
pll dp[n+1];
dp[0].f=0,dp[0].s=0;
x=0,y=0;
for(i=1;i<=n;i++)
sort(all(v[i]));
for(i=1;i<=n;i++)
{
if(v[i].size()==0){
dp[i].f=dp[i-1].f,dp[i].s=dp[i-1].s;
continue;
}
ll x1=v[i][0],y1=v[i].back();
dp[i].f=min(dp[i-1].f+2*max((ll)0,y1-x)+x-x1,dp[i-1].s+2*max((ll)0,y1-y)+y-x1);
dp[i].s=min(dp[i-1].f+2*max((ll)0,x-x1)+y1-x,dp[i-1].s+2*max((ll)0,y-x1)+y1-y);
x=x1,y=y1;
// c2(dp[i].f,dp[i].s);
}
dp[n].f+=abs(x),dp[n].s+=abs(y);
c1(min(dp[n].f,dp[n].s));
};
int main()
{fast;
int t;
t=1;
//cin >>t;
while(t--)
iamzeus();
}
|
#line 1 "main.cpp"
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<vector<int>> graph(n);
for (int i = n - 1; i--;) {
int u, v;
cin >> u >> v;
--u, --v;
graph[u].push_back(v);
graph[v].push_back(u);
}
// 伝達時刻で二分探索
int ok = n, ng = 0;
while (ok - ng > 1) {
int mid = (ok + ng) / 2;
int cnt = 0; // 連絡先の個数
// 部分木が全て被覆されている: -(連絡先の最小距離+1)
// そうでない : 被覆されていない子の最大距離
auto dfs = [&](auto&& f, int v, int p) -> int {
int uncovered_max = -1, center_min = n;
for (auto u : graph[v]) {
if (u == p) continue;
auto d = f(f, u, v);
if (d >= 0) {
uncovered_max = max(uncovered_max, d + 1);
} else {
center_min = min(center_min, -d);
}
}
// 葉の場合
if (graph[v].size() <= 1) uncovered_max = 0;
// 被覆されていない頂点を全て被覆できる場合
if (uncovered_max + center_min <= mid) uncovered_max = -1;
// 連絡先が既に無効の場合
if (center_min > mid) uncovered_max = max(uncovered_max, 0);
if (uncovered_max == mid) {
++cnt; // vを連絡先にする
uncovered_max = -1, center_min = 0;
}
return uncovered_max != -1 ? uncovered_max : -(center_min + 1);
};
// 根が被覆されていない場合は根を連絡先にする
if (dfs(dfs, 0, -1) >= 0) ++cnt;
if (cnt <= k) {
ok = mid;
} else {
ng = mid;
}
}
cout << ok << "\n";
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
//#define puts sdf
using std::vector;
//using std::cout;
//using std::endl;
using std::sort;
using std::swap;
using std::min;
using std::max;
int read(){//int 无负数
int h=0;char c=getchar();
while(c<'0'||c>'9')c=getchar();
while(c>='0'&&c<='9')h=(h<<1)+(h<<3)+c-'0',c=getchar();
return h;
}
const int MAXN=200100;
int K,n;
struct Edge{
int to;
int nxt;
}edge[MAXN<<1];
int frm[MAXN];
int cnt_e;
void insert_e(int u,int v){
cnt_e++;
edge[cnt_e].to=v;
edge[cnt_e].nxt=frm[u];
frm[u]=cnt_e;
}
int Fa[MAXN];
int Rt,mns,S;
int siz[MAXN];
bool vis[MAXN];
void get_rt(int x,int ff){
siz[x]=1;int mxs=0;
for(int i=frm[x];i;i=edge[i].nxt){
int v=edge[i].to;if(v==ff||vis[v])continue;
get_rt(v,x);
siz[x]+=siz[v];
mxs=max(mxs,siz[v]);
}
mxs=max(mxs,S-siz[x]);
if(mxs<mns)Rt=x,mns=mxs;
}
int Dt[MAXN];//点分树上的深度
int dis[MAXN][21]; //x到点分树上深度为D的那个祖先的距离
int mndis[MAXN];//距离他最近的点
void get_dis1(int U,int x,int ff,int dep,int D){
dis[x][D]=dep;
for(int i=frm[x];i;i=edge[i].nxt){
int v=edge[i].to;if(v==ff||vis[v])continue;
get_dis1(U,v,x,dep+1,D);
}
}
void divide(int x,int D){//D是点分树上的深度
vis[x]=true;
Dt[x]=D;
get_dis1(x,x,x,0,D);
for(int i=frm[x];i;i=edge[i].nxt){
int v=edge[i].to;if(vis[v])continue;
S=siz[v],mns=siz[v],get_rt(v,v);
Fa[Rt]=x;divide(Rt,D+1);
}
}
void Modify(int x){
int rt=x;
for(;rt;rt=Fa[rt]){
mndis[rt]=min(mndis[rt],dis[x][Dt[rt]]);
// cout<<"MODIFY"<<x<<" "<<rt<<" "<<mndis[rt]<<endl;
}
}
bool Query(int x,int mid){
int rt=x;
for(;rt;rt=Fa[rt]){
// cout<<"QUERY "<<x<<' '<<rt<<" "<<mndis[rt]<<' '<<dis[x][Dt[rt]]<<endl;
if(mndis[rt]+dis[x][Dt[rt]]<=mid)return true;
}
return false;
}
int fa[MAXN][19];
int dep[MAXN];
int qwq[MAXN];//按深度排序
bool cmp(int x,int y){
return dep[x]>dep[y];
}
void pre_dfs(int x,int ff){
fa[x][0]=ff;dep[x]=dep[ff]+1;
for(int i=1;i<=18;i++)fa[x][i]=fa[fa[x][i-1]][i-1];
for(int i=frm[x];i;i=edge[i].nxt){
int v=edge[i].to;if(v==ff)continue;
pre_dfs(v,x);
}
}
int get_fa(int x,int k){
int nw=x;
for(int i=0;i<=18;i++){
if(k&(1<<i))nw=fa[nw][i];
}
return nw;
}
bool ch_ck(int mid){
// cout<<"MID"<<':'<<mid<<endl;
memset(mndis,0x3f,sizeof(mndis));
// for(int i=1;i<=n;i++)mndis[i]=-0x3f3f3f3f;
int cnt=0;
for(int i=1;i<=n;i++){
int x=qwq[i];
if(Query(x,mid))continue;
int fk=get_fa(x,mid);
cnt++;Modify(fk);
// cout<<"WORK"<<x<<" "<<fk<<endl;
if(cnt>K)return false;
}
return true;
}
int get_ans(){
int l=0,r=n;
while(l+1<r){
int mid=(l+r)>>1;
if(ch_ck(mid)){
r=mid;
}
else l=mid+1;
}
if(l==r)return r;
if(ch_ck(l))return l;
return r;
}
int main(){
n=read(),K=read();
for(int i=1;i<=n-1;i++){
int u=read(),v=read();
insert_e(u,v),insert_e(v,u);
}
S=n,mns=n,get_rt(1,1);
divide(Rt,0);
pre_dfs(1,1);
for(int i=1;i<=n;i++)qwq[i]=i;sort(qwq+1,qwq+n+1,cmp);
// for(int i=1;i<=n;i++)cout<<qwq[i]<<" ";puts("");
// for(int i=1;i<=n;i++){
// for(int j=0;j<=18;j++)cout<<fa[i][j]<<" ";puts("");
// }
printf("%d\n",get_ans());
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
//const int MOD = (int) 1e9 + 7;
const int MOD = 119 << 23 | 1;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
inline int mrand(int k) {return abs((int) mt()) % k;}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";
void chemthan() {
int n; cin >> n;
vector<string> res;
res.pb("AB");
FOR(i, 1, n) {
vector<string> nres;
for (auto s : res) {
nres.pb(s + s);
string ss = s;
for (char c : s) {
if (c == 'A') {
ss += 'B';
}
else {
ss += 'A';
}
}
nres.pb(ss);
}
string s;
FOR(j, 0, 1 << i) {
s += "A";
}
FOR(j, 0, 1 << i) {
s += "B";
}
nres.pb(s);
res = nres;
}
cout << sz(res) << "\n";
for (auto s : res) {
cout << s << "\n";
}
}
int32_t main(int32_t argc, char* argv[]) {
ios_base::sync_with_stdio(0), cin.tie(0);
if (argc > 1) {
assert(freopen(argv[1], "r", stdin));
}
if (argc > 2) {
assert(freopen(argv[2], "wb", stdout));
}
chemthan();
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
cout<<(1<<n)-1<<endl;
for(int i=1;i<1<<n;i++){
for(int j=0;j<1<<n;j++){
if(__builtin_popcount(j&i)&1) cout<<'B';
else cout<<'A';
}
cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> to(n);
for(int i = 1; i < n; i++){
int p;
cin >> p;
p--;
to[p].push_back(i);
}
struct state {
int change, first, second;
};
function<state(int)> dfs = [&](int u){
if(to[u].size() == 0){
state now;
now.change = 1;
now.first = 1;
now.second = 0;
return now;
}
int f = 1, s = 0;
vector<state> unchanged, changed;
for(auto v : to[u]){
state nxt = dfs(v);
if(!nxt.change){
if(nxt.second >= nxt.first){
f += nxt.first;
s += nxt.second;
} else {
unchanged.push_back(nxt);
}
} else {
changed.push_back(nxt);
}
}
if(changed.size() & 1){
for(auto nxt : unchanged){
f += nxt.second;
s += nxt.first;
}
} else {
for(auto nxt : unchanged){
s += nxt.second;
f += nxt.first;
}
}
sort(changed.begin(), changed.end(), [&](state a, state b){
return a.first - a.second > b.first - b.second;
});
reverse(changed.begin(), changed.end());
int len = changed.size();
for(int i = 0; i < len; i++){
if(i % 2 == 1){
s += changed[i].first;
f += changed[i].second;
} else {
s += changed[i].second;
f += changed[i].first;
}
}
state now;
now.change = (changed.size() + 1) & 1;
now.first = f;
now.second = s;
return now;
};
cout << dfs(0).first << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define bn(x) ((1<<(x))-1)
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T> >;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int,int>;
using T3 = tuple<int,int,int>;
using vi = vc<int>;
using vvi = vv<int>;
using vl = vc<ll>;
using vp = vc<P>;
using vt = vc<T3>;
int getInt(){int x;scanf("%d",&x);return x;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vc<T>&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
vc<string> split(const string& s,char d=' '){vc<string> r(1);for(char c:s)if(c==d)r.pb("");else r.back()+=c;return r;}
string operator*(const string& s,int t){return join(vc<string>(t,s));}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>T dup(T x, T y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>void uni(vc<T>& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
// linear sieve
vi ps, pf;
void sieve(int mx) {
pf = vi(mx+1);
rep(i,mx+1) pf[i] = i;
for (int i = 2; i <= mx; ++i) {
if (pf[i] == i) ps.pb(i);
for (int j = 0; j < sz(ps) && ps[j] <= pf[i]; ++j) {
int x = ps[j]*i;
if (x > mx) break;
pf[x] = ps[j];
}
}
}
inline bool isp(int x) { return pf[x] == x && x >= 2;}
vp factor(int x) { // asc
if (x == 1) return {};
vp res(1, P(pf[x], 0));
while (x != 1) {
if (res.back().fi == pf[x]) res.back().se++;
else res.pb(P(pf[x],1));
x /= pf[x];
}
return res;
}
//
struct Solver {
void solve() {
int n;
scanf("%d",&n);
vi a(n+1,1);
sieve(n);
for (int p : ps) {
ll x = p;
while (x <= n) {
for (int i = x; i <= n; i += x) a[i]++;
x *= p;
}
}
a.erase(a.begin());
cout<<a<<endl;
}
};
int main() {
int ts = 1;
// scanf("%d",&ts);
rrep(ti,ts) {
Solver solver;
solver.solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using i64 = int64_t;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::vector<int> s;
int n;
std::cin >> n;
++n;
for (int i = 1; i < n; ++i) {
std::string foo;
std::cin >> foo;
s.push_back(foo == "AND" ? 1 : 0);
}
std::vector<std::array<i64, 2>> dp(n);
dp[0][0] = 1;
dp[0][1] = 1;
for (int i = 0; i < n - 1; ++i) {
if (s[i] == 1) {
dp[i + 1][1] += dp[i][1];
dp[i + 1][0] += dp[i][0] + dp[i][1] + dp[i][0];
} else {
dp[i + 1][1] += dp[i][0] + dp[i][1] + dp[i][1];
dp[i + 1][0] += dp[i][0];
}
}
std::cout << dp[n - 1][1] << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a;
long long ans = 1;
for(long long i = 1; i <= n; ++i){
string s; cin >> s;
if(s == "OR"){ans += (long long)pow(2, i);}
}
cout << ans << endl;
}
|
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//~ while (clock()<=69*CLOCKS_PER_SEC)
#define ll long long
#define ld long double
#define pi pair<int,int>
#define pd pair<ld,ld>
#define ft first
#define sd second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define FOR(i,a,b) for(int i=(a); i<=(b);i++)
#define F(i,a,b) FOR(i,(a),(b)-1)
#define REV(i,a,b) for(int i=(a); i>=(b);i--)
#define VI vector<int>
#define VPI vector<pi>
#define VPD vector<pd>
#define PI 3.14159265
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)((a).size())
#define int long long
template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long K = 1000;
const long long KK = K*K;
const long long MIL = KK*K;
const long long INF = MIL*MIL;
const long long MOD = 1e9 + 7;
const long long N = 1e3 + 10, M=10;
bool wins(char a, char b) {
if (b == 'R' && a == 'S')
return false;
if (b == 'S' && a == 'P')
return false;
if (b == 'P' && a == 'R')
return false;
return true;
}
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
F(i, 0, k) {
if (sz(s) % 2)
s += s;
string s1;
for (int j = 0; j < sz(s); j += 2) {
if (wins(s[j], s[j + 1])) {
s1 += s[j];
} else {
s1 += s[j + 1];
}
}
s = s1;
}
cout << s[0] << "\n";
}
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
// cout.tie(0);
cerr.tie(0);
cout << setprecision(9) << fixed;
cerr << setprecision(6) << fixed;
int test = 1, f;
// cin >> test;
F(_test, 0, test) {
//cout<<"Case #"<<_test + 1<<": ";
solve();
// if(_test == 1)
// return 0;
}
}
/*
2 1 3
1 1 <= 3
2 1 <= 5
1 1 >= 4
2 2 4
1 1 <= 3
2 1 <= 4
1 2 >= 5
2 2 >= 7
0 0 0
*/ | #pragma GCC optimize ("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include <x86intrin.h>
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//gp_hash_table<key, int, chash> table;
#define PI 3.141592653589793L
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); srand(time(NULL));
// Use for file I/O;
#define FIN string _fname = "input"; \
string _is = _fname + ".in", _os = _fname + ".out"; \
freopen(_is.c_str(), "r", stdin); \
freopen(_os.c_str(), "w", stdout);
#define FIN2 freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define gsize(x) (int)((x).size())
using namespace std;
using namespace __gnu_pbds;
const char nl = '\n';
typedef long long ll;
typedef long double ld;
// typedef unsigned int uint;
typedef unsigned long long ull;
const ll inf = 1e9 + 10;
const ll inf2 = 1e18 + 99LL;
const ld inf3 = 1e14;
const __int128 mod = 1e9 + 7;
const ld eps = 5e-10;
const int logn = 10, maxn = 105, maxm = 8000001, K = 3;
ll n, k;
map<int, char> ttm[maxn];
int tk[maxn];
string s;
char solve(int si, int ck) {
if (ck == 0) {
// cout << si << ' ' << s[si] << endl;
return s[si];
} else {
if (!ttm[ck].count(si)) {
char r1 = solve(si, ck - 1), r2 = solve((si + tk[ck - 1]) % n, ck - 1);
if (r1 == r2) {
ttm[ck][si] = r1;
} else {
if (r1 == 'R') {
if (r2 == 'S') {
ttm[ck][si] = r1;
} else {
ttm[ck][si] = r2;
}
} else if (r1 == 'S') {
if (r2 == 'P') ttm[ck][si] = r1;
else ttm[ck][si] = r2;
} else {
if (r2 == 'S') ttm[ck][si] = r2;
else ttm[ck][si] = r1;
}
}
// cout << "HI" << endl;
}
// cout << si << ' ' << ck << ' ' << ttm[si][ck] << endl;
return ttm[ck][si];
}
}
int main() {
FAST;
cin >> n >> k;
cin >> s;
tk[0] = 1;
for (int i = 1; i <= k; i++) {
tk[i] = (tk[i - 1] * 2) % n;
}
cout << solve(0, k);
} |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
char cn[1200010];
char *ci = cn, ct;
char tc[200002], *di = tc + 100000, *di2 = tc + 200000;
const char d[2] = "0";
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
rep(i, 100000) tc[i] = '0';
rep(i, 100000) di[i] = '1';
di2[0] = '0';
di2[1] = '\n';
fread(cn, 1, 1200010, stdin);
int T = 0;
while ((ct = *ci++) >= '0') T = T * 10 + ct - '0';
rep(t, T) {
int N = 0;
while ((ct = *ci++) >= '0') N = N * 10 + ct - '0';
fwrite(di - N, 1, N, stdout);
fwrite(di2 - N, 1, N + 2, stdout);
ci += 6 * N + 3;
}
Would you please return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <unordered_map>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
#define pb(x) push_back(x)
#define INF 1e18
using namespace std;
typedef pair<int, int> pi;
const int MAX = 1e6 + 1;
// typedef vector<vector<ll>> matrix;
const ll PRIME = 1e9 + 7;
typedef pair<int,pair<int,int> > ppi;
// const ll MAX = 1e6 + 1;
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int a[MAX];
int b[MAX];
vector<int>graph[MAX];
vector<bool>vis(MAX,0);
// vector<bool> connected(MAX,0);
pi dfs(int src)
{
vis[src]=1;
pi temp;
temp.first+=a[src];
temp.second+=b[src];
for(int i: graph[src])
{
if(!vis[i])
{
pi tmp2=dfs(i);
temp.first+=tmp2.first;
temp.second+=tmp2.second;
}
}
return temp;
}
void solve()
{
int n,m;
cin>>n>>m;
// int a[n],b[n];
int sum1=0,sum2=0;
fr(i,n)
{
cin>>a[i];
sum1+=a[i];
}
// int st;
bool flag=0;
fr(i,n)
{
cin>>b[i];
sum2+=b[i];
if(a[i]!=b[i])
{ flag=1;
}
}
int u,v;
while(m--)
{
cin>>u>>v;
u--,v--;
graph[u].pb(v);
graph[v].pb(u);
}
if(sum1!=sum2)
{
cout<<"No\n";
return;
}
if(flag==0)
{cout<<"Yes\n";return;}
// cout<<st;
fr(i,n)
{
if(!vis[i])
{
pi temp=dfs(i);
if(temp.first!=temp.second)
{
cout<<"No\n";
return;
}
}
}
cout<<"Yes\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
t = 1;
// cin >> t;
// int k=1;
while (t--)
{
// cout << "Case " << k++ << ":\n";
solve();
}
} |
Subsets and Splits