code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#include<list>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) {rep(_,v.size())cout<<" "<<v[_];cout<<endl;}
#define show2d(v) {rep(__,v.size())show1d(v[__]);}
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vt>vvt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const long double EPS=1e-9;
int inf = sizeof(int) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vi out;
out.pb(6);
out.pb(10);
out.pb(15);
loop(i,16,10001){
if(out.size()==n)break;
if(i%6==0||i%10==0||i%15==0)out.pb(i);
}
rep(i,n)rep(j,i)if(gcd(out[i],out[j])==1)assert(0);
show1d(out);
}
| #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int n; cin >> n;
cout << n-1 << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=513;
ll a[maxn][maxn];
ll ansa[maxn],ansb[maxn];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
scanf("%lld",&a[i][j]);
}
}
for(int i=2;i<=n;i++){
int yes=1,ms=a[i][1]-a[i-1][1];
for(int j=2;j<=n;j++){
if(a[i][j]-a[i-1][j]!=ms){
yes=0;
break;
}
}
if(!yes){
return printf("No"),0;
}
}
ll mn=1e18;
int pos=0;
for(int i=1;i<=n;i++){
if(a[i][1]<mn) mn=a[i][1],pos=i;
}
for(int i=1;i<=n;i++) ansa[i]=a[pos][i];
for(int i=1;i<=n;i++) ansb[i]=a[i][1]-a[pos][1];
printf("Yes\n");
for(int i=1;i<=n;i++) printf("%lld ",ansb[i]);
puts("");
for(int i=1;i<=n;i++) printf("%lld ",ansa[i]);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=a;i>=n;i--)
#define pb push_back
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
ll gcd(ll a,ll b){if(b==0)return a;else return gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const int maxn=500;
ll a[maxn+5][maxn+5];
int main()
{
int n;
cin>>n;
rep(i,0,n)
{
rep(j,0,n)
cin>>a[i][j];
}
bool flag=1;
ll dif[n];
rep(i,0,n)
{
dif[i]=a[i][0]-a[(i+1)%n][0];
}
rep(i,0,n)
{
rep(j,0,n)
{
ll tmp=a[i][j]-a[(i+1)%n][j];
if(tmp!=dif[i])
{
cout<<"No"<<endl;
return 0;
}
}
}
rep(i,0,n)
{
dif[i]=a[0][i]-a[0][(i+1)%n];
}
rep(i,0,n)
{
rep(j,0,n)
{
ll tmp=a[j][i]-a[j][(i+1)%n];
if(tmp!=dif[i])
{
cout<<"No"<<endl;
return 0;
}
}
}
cout<<"Yes"<<endl;
ll min=0x3f3f3f3f3f3f3f3f;
int minum=0;
ll ans1[maxn+5];
ll ans2[maxn+5];
rep(i,0,n)
{
if(a[i][0]<min)
{
minum=i;
min=a[i][0];
}
}
rep(i,0,n)
{
ans2[i]=a[minum][i];
}
rep(i,0,n)
{
ans1[i]=a[i][0]-ans2[0];
}
rep(i,0,n)
{
cout<<ans1[i]<<" ";
}
cout<<endl;
rep(i,0,n)
{
cout<<ans2[i]<<" ";
}
cout<<endl;
return 0;
} |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
// using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds; //Policy Based Data Structure
// #define gc getchar_unlocked
// #define pqb priority_queue<int>
// #define pqs priority_queue<int, vi, greater<int> >
// #define mk(arr,n,type) type *arr = new type[n]
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define int long long
#define endl '\n'
#define w(t) int t; cin>>t; while(t--)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x,y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it,a) for(auto it = a.begin(); it != a.end(); it++)
#define ps(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define PI 3.1415926535897932384626
#define inf 1e18
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //Random Shuffler
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<int, int> mii;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
// const int N = 3e5, M = N;
// vi g[N];
//=======================
void sol()
{
int n, i;
cin >> n;
std::vector<int> v;
v.pb(1);
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
v.pb(i);
if (i * i != n)
v.pb(n / i);
}
}
if (n != 1)
v.pb(n);
int k = v.size();
sort(v.begin(), v.end());
for (i = 0; i < k; i++)
cout << v[i] << '\n';
}
int32_t main() {
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
sol();
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return result;
}
// void ipgraph(int n, int m){
// int i, u, v;
// while(m--){
// cin>>u>>v;
// g[u-1].pb(v-1);
// g[v-1].pb(u-1);
// }
// }
//
// void dfs(int u, int par){
// for(int v:g[u]){
// if (v == par) continue;
// dfs(v, u);
// }
// } | #include <bits/stdc++.h>
#define loop(n) for(ll i=0;i<n;i++)
#define loopj(n) for(ll j=0;j<n;j++)
#define loopR(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define rng(i,a,b,c) for(ll i = a; i<b;i+=c)
#define loop2(i,a,b) for(long long i = a; i>=b;i--)
#define loop3(j,a,b) for(int j = a; j<b;j++)
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define ld long double
#define SET set<ll>
#define pb push_back
#define mp make_pair
#define gc getchar_unlocked
#define in ll n;cin>>n;
ll mod=pow(10,9)+7;
using namespace std;
//--------------------------\\
//code once think twice
ll gcd(ll a,ll b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
void go()
{
ll n,w;
cin>>n;
ll a[n];
ll post=0;
loop(n)
{
cin>>a[i];
post+=a[i];
}
sort(a,a+n);
ll ans=0;
loop(n)
{
post-=a[i];
ans+=abs(post-(a[i]*(n-(i+1))));
}
cout<<ans;
}
int main()
{
int t;
fast;
//cin>>t;
//loop(t)
go();
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>
constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;
//constexpr ll mod = 998244353;
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
void pt(T val) {
cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v) {
ll vs = v.size();
rep(i, vs) {
cout << v[i];
if (i == vs - 1)
cout << "\n";
else
cout << " ";
}
}
ll mypow(ll a, ll n) {
ll ret = 1;
if(n==0) return 1;
if(a==0) return 0;
rep(i, n) {
if (ret > (ll)(9e18 + 10) / a) return -1;
ret *= a;
}
return ret;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long 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 digsum(ll n) {
ll res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
struct UnionFind {
vector<ll> par,size;
UnionFind(ll N) : par(N) { //最初はすべてが根であるとして初期化
size.resize(N,1);
for(ll i=0;i<N;i++) par[i] = i;
}
ll root(ll x){ //データxの木の根を再帰で得る
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y){ //xとyの木を併合
ll rx = root(x);
ll ry = root(y);
if(rx == ry) return; //同じ木にあるときはそのまま
if(size[rx]>size[ry]){
par[ry]=rx;
size[rx] += size[ry];
}else{
par[rx] = ry;
size[ry] += size[rx];
}
return;
}
bool same(ll x, ll y){ //2つのデータx,yが属する木が同じならtrue
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll treesize(ll x){return size[root(x)];}
};
int main() {
ll a,b,c,n,m,t=0,x,y,q,k,ans=0;
cin>>a>>b>>c;
if(a*a+b*b<c*c) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
//cout<<ans<<endl;
} | #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>;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a*a+b*b<c*c)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
string N;
getline(cin, N);
string Nr = N;
reverse(Nr.begin(), Nr.end());
//cout << N << " "<< Nr << "\n";
int i = 0;
while (Nr[i] == '0') {
i++;
}
//cout << i;
int chk = 1;
for (int j = 0; i < Nr.length(); i++, j++) {
if (Nr[i] != N[j]) {
chk = 0;
break;
}
}
if (chk) cout << "Yes";
else cout << "No";
}
| #include<iostream>
using namespace std;
int main(){
long long N, NN;
cin>>N;
NN = N;
int n[11] = {0, 0,0,0,0,0,0,0,0,0,0}, a = 10;
for(int i=0;i<=10;i++){
n[i] = N%10;
N /= 10;
if(N<=0){
a = i;
break;
}
}
if(n[0]==0){
n[a+1] = 0;
a++;
}
long long rN = 0, x = 1;
for(int i=a;i>=0;i--){
rN += n[i] * x;
x *= 10;
}
for(int i=0;i<10;i++){
if(NN == rN){
cout<< "Yes";
return 0;
}
rN *= 10;
if(rN>1000000000)break;
}
cout<< "No";
return 0;
}
|
#include<stdio.h>
int n,x,mx; long long s,t;
int main() {
scanf("%d",&n);
for (int i=1; i<=n; ++i)
scanf("%d",&x),s+=x,t+=s,mx<x&&(mx=x),
printf("%lld\n",t+1ll*i*mx);
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <numeric>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0 ; i<(n) ; ++i)
typedef long long ll;
typedef pair<int,int> p;
const int INF = 1001001001;
int main(){
ll N;
cin >> N;
ll A[N];
rep(i,N) cin >> A[i];
//最大値をiに足したら、次はそのiが最大値になる
//答えはk*a1+(k-1)*a2+...a_k + k*a_max。
//dpと、dpの和を記録していく
ll dp[N],sum[N],MAX;
dp[0] = A[0];
sum[0] = dp[0];
MAX = A[0];
cout << sum[0]*2 << endl;
for(int i=1 ; i<N ; ++i){
MAX = max(MAX,A[i]);
dp[i] = dp[i-1] + A[i];
sum[i] = sum[i-1] + dp[i];
cout << sum[i] + (i+1)*MAX << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;
while(y){
if(y&1)
res=res*x%mod;
x=x*x%mod;
y>>=1;
}
return res;
}
ll fact(ll n){
ll res=1;
for(ll i=2;i<=n;++i)
(res*=i)%=mod;
return res;
}
bool isprime(ll n){
if(n<=1) return 0;
for(ll i=2;i*i<=n;++i)
if(n%i==0) return 0;
return 1;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
ll k,n,m;
cin>>k>>n>>m;
vector<ll>v(k);
for(int i=0;i<k;++i) cin>>v[i];
using ld=long double;
ld l=0,r=1;
for(int _=1;_<=150;++_){
ld mid=(l+r)/2;
ll up=0,dn=0;
for(int i=0;i<k;++i){
ll mx=0,mn=0;
mx=(ll)((((ld)(m*v[i]))/n+(mid*(ld)m)));
mn=(ll)(ceil(((ld)(m*v[i]))/n-(mid*(ld)m)));
if(mn<0) mn=0;
if(mx<0) mx=-mod;
up+=mx;
dn+=mn;
}
if(up>=m&&dn<=m) r=mid;
else l=mid;
}
vector<ll>ans(k);
ll req=m;
for(int i=0;i<k;++i){
ll mx=0,mn=0;
mx=(ll)((((ld)(m*v[i]))/n+r*(ld)m));
mn=(ll)(ceil(((ld)(m*v[i]))/n-r*(ld)m));
if(mn<0) mn=0;
req-=mn;
ans[i]=mn;
}
for(int i=0;i<k;++i){
ll mx=0,mn=0;
mx=(ll)((((ld)(m*v[i]))/n+r*(ld)m));
mn=(ll)(ceil(((ld)(m*v[i]))/n-r*(ld)m));
if(mn<0) mn=0;
ll p=min(req,mx-ans[i]);
ans[i]+=p;
req-=p;
}
for(auto c:ans) cout<<c<<" ";
return 0;
}
| //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FIX(d) fixed << setprecision(d)
using P = pair<int, int>;
using LP = pair<ll, ll>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1e9;
const ll LINF = (1LL<<60);
const double EPS = 1e-10;
unsigned int xor128(){
static unsigned int x=123456789,y=362436069,z=521288629,w=88675123;
unsigned int t = (x^(x<<11));
x=y; y=z; z=w;
return( w=(w^(w>>19))^(t^(t>>8)) );
}
int n;
int cx[200], cy[200], r[200];
int a[200], b[200], c[200], d[200];
ll score(){
double sc = 0.0;
REP(i,n){
int area = (c[i]-a[i]) * (d[i]-b[i]);
double tmp = 1.0 - (double)min(area,r[i])/max(area,r[i]);
sc += 1.0 - tmp*tmp;
}
sc *= 1e9;
sc /= n;
return (ll)round(sc);
}
void init(){
REP(i,n){
a[i] = cx[i];
b[i] = cy[i];
c[i] = cx[i]+1;
d[i] = cy[i]+1;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
REP(i,n) cin >> cx[i] >> cy[i] >> r[i];
int ti = clock();
init();
ll mx = score();
//cout << mx << endl;
vector<bool> full(n, false);
while(clock() - ti < 495 * CLOCKS_PER_SEC / 100){
REP(loop, 300){
int ind = xor128() % n;
if(full[ind]) continue;
int xy = xor128() % 2;
bool minus = false, plus = false;
if(xy==0){
REP(i,n){
if(i==ind) continue;
if(max(a[i],a[ind]-1)<min(c[i],c[ind]) && max(b[i],b[ind])<min(d[i],d[ind])){
minus = true;
}
if(max(a[i],a[ind])<min(c[i],c[ind]+1) && max(b[i],b[ind])<min(d[i],d[ind])){
plus = true;
}
}
if(c[ind]<10000 && !plus){
c[ind]++;
if(!chmax(mx, score())) c[ind]--;
}else if(a[ind]>0 && !minus){
a[ind]--;
if(!chmax(mx, score())) a[ind]++;
}
}else{
REP(i,n){
if(i==ind) continue;
if(max(a[i],a[ind])<min(c[i],c[ind]) && max(b[i],b[ind]-1)<min(d[i],d[ind])){
minus = true;
}
if(max(a[i],a[ind])<min(c[i],c[ind]) && max(b[i],b[ind])<min(d[i],d[ind]+1)){
plus = true;
}
}
if(d[ind]<10000 && !plus){
d[ind]++;
if(!chmax(mx, score())) d[ind]--;
}else if(b[ind]>0 && !minus){
b[ind]--;
if(!chmax(mx, score())) b[ind]++;
}
}
bool xp = false, xm = false;
bool yp = false, ym = false;
REP(i,n){
if(i==ind) continue;
if(max(a[i],a[ind]-1)<min(c[i],c[ind]) && max(b[i],b[ind])<min(d[i],d[ind])){
xm = true;
}
if(max(a[i],a[ind])<min(c[i],c[ind]+1) && max(b[i],b[ind])<min(d[i],d[ind])){
xp = true;
}
if(max(a[i],a[ind])<min(c[i],c[ind]) && max(b[i],b[ind]-1)<min(d[i],d[ind])){
ym = true;
}
if(max(a[i],a[ind])<min(c[i],c[ind]) && max(b[i],b[ind])<min(d[i],d[ind]+1)){
yp = true;
}
}
if(xp&xm&yp&ym) full[ind] = true;
}
//cout << mx << endl;
}
//cout << mx << endl;
REP(i,n) cout << a[i] << " " << b[i] << " " << c[i] << " " << d[i] << '\n';
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const double pi=acos(-1.0);
const double eps=1e-8;
const int INF=0x3f3f3f3f;
const int MAXN=1e6+10;
const int mod=1e9+7;
int quickPower(int a, int b)
{
int ans = 1;
while(b)
{
if(b & 1)
{
ans = ans*a;
}
a=a*a;
b >>= 1;
}
return ans;
}
void solve()
{
int n;
cin>>n;
int ans=0;
for(int i=1;i<=MAXN;++i)
{
int tmp=i;
int sum=0;
while(tmp)
{
sum++;
tmp/=10;
}
int flag=i*quickPower(10,sum)+i;
if(flag<=n) ans++;
else break;
/*cout<<flag<<endl;*/
}
cout<<ans;
}
signed main()
{
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int _=1;
/*cin>>_;*/
for(int i=1; i<=_; ++i)
{
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define irep(n) for (int i=0; i < (n); ++i)
#define irepf1(n) for (int i=1; i <= (n); ++i)
#define jrep(n) for (int j=0; j < (n); ++j)
#define jrepf1(n) for (int j=1; j <= (n); ++j)
#define krep(n) for (int k=0; k < (n); ++k)
#define krepf1(n) for (int k=1; k <= (n); ++k)
#define PI 3.14159265358979323846264338327950288
#define mod 1000000007
//fixed << setprecision(10) <<
int main() {
int N;
cin >>N;
vector<ll> VA(N);
vector<ll> VMax(N);
vector<ll> VB(N);
ll A;
cin >>A;
VA[0]=A,VMax[0]=A;
irep (N-1) {
cin >>VA[i+1];
VMax[i+1]=max(VMax[i],VA[i+1]);
}
irep (N) cin >>VB[i];
ll Max=0;
irep (N) {
Max=max(Max,VMax[i]*VB[i]);
cout<<Max<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr << "[" << #__VA_ARGS__ << "]: [", dbg_out(__VA_ARGS__)
/****************************** CODE IS HERE ***********************************/
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, m; cin >> n >> m;
vector <int> A(n*m);
for (int &i: A) cin >> i;
int mn = *min_element(all(A));
ll ans = 0;
for (int i: A) {
ans += i - mn;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
#define pqi priority_queue<int>
#define test int tcase; cin>>tcase; for(int tc = 1; tc <= tcase; tc++)
#define inp(a,n,f) int a[n+f];for(int hh=f;hh<n+f;hh++)cin>>a[hh];
#define printdecimal(k) cout<<fixed<<setprecision(k);
#define mem(a,k) memset(a,k,sizeof(a))
#define ub upper_bound
#define lb lower_bound
#define mii map<int,int>
#define all(v) v.begin(),v.end()
#define mod (int)(1e9+7)
#define inf LLONG_MAX
int exp(int x,int y){int res=1;x=x%mod;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int modinv(int x){return exp(x,mod-2);}
int add(int a,int b){a%=mod,b%=mod;a=((a+b)%mod+mod)%mod;return a;}
int sub(int a,int b){a=((a-b)%mod+mod)%mod;return a;}
int mul(int a,int b){a%=mod,b%=mod;a=((a*b)%mod+mod)%mod;return a;}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
int mn=inf;
int a[n][m];
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
cin>>a[i][j],mn=min(mn,a[i][j]);
int ans=0;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
ans+=a[i][j]-mn;
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int) x.size()
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define FOR(i, a, b) for(auto i=(a); i<(b); i++)
#define ROF(i, a, b) for(auto i=(b)-1; i>=(a); i--)
#define F0R(i, n) FOR(i, 0, n)
#define R0F(i, n) ROF(i, 0, n)
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using pll=pair<ll, ll>;
using vi=vector<int>;
using vl=vector<ll>;
using vpii=vector<pii>;
template<class T> bool ckmin(T&a, const T&b) {return b<a?a=b,1:0;}
template<class T> bool ckmax(T&a, const T&b) {return b>a?a=b,1:0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN=1001;
const int MOD=998244353;
const ll infLL=1e18;
const ld eps=1e-6;
template<int mod> struct mint {
int v; explicit operator int() const{return v;}
mint() {v=0;}
mint(ll _v) { v =int((-mod< _v&&_v<mod)?_v:_v%mod);
if(v < 0) v+=mod;}
friend bool operator==(const mint& a, const mint& b){
return a.v==b.v;}
friend bool operator!=(const mint& a, const mint& b){
return !(a==b);}
friend bool operator<(const mint& a, const mint& b){
return a.v<b.v;}
mint& operator+=(const mint& m) {
if((v+=m.v)>=mod) v-=mod;
return *this;}
mint& operator-=(const mint& m) {
if((v-=m.v)<0) v+=mod;
return *this;}
mint& operator*=(const mint& m){
v=int((ll)v*m.v%mod); return *this;}
mint& operator/=(const mint& m) {return (*this)*=inv(m);}
friend mint pow(mint a, ll p) {
mint ans = 1; assert(p >= 0);
for (;p;p/=2,a*=a) if(p&1) ans*=a;
return ans;}
friend mint inv(const mint& a){assert(a.v!=0);
return pow(a,mod-2);}
mint operator-() const{return mint(-v);}
friend mint operator+(mint a, const mint& b) {return a+=b;}
friend mint operator-(mint a, const mint& b) {return a-=b;}
friend mint operator*(mint a, const mint& b) {return a*=b;}
friend mint operator/(mint a, const mint& b) {return a/=b;}
};
using mi=mint<MOD>;
vector<mi> invs, fac, ifac;
void genFac(int SZ=mxN) {
invs.resize(SZ), fac.resize(SZ), ifac.resize(SZ); vi Invs(SZ);
Invs[1]=1; invs[1]=fac[0]=ifac[0]=1;
FOR(i,2,SZ) Invs[i] = int(MOD-(ll)MOD/i*Invs[MOD%i]%MOD), invs[i]=mi(Invs[i]);
FOR(i,1,SZ) {
fac[i]=fac[i-1]*i;
ifac[i]=ifac[i-1]*invs[i];
}
}
mi choose(int n, int k){
if(k>n) return 0;
return fac[n]*ifac[n-k]*ifac[k];
}
int n, m;
string a[mxN];
vpii dist[mxN];
mi ans=1;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
F0R(i, n) cin >> a[i];
F0R(i, n){
F0R(j, m){
dist[i+j].pb({i, j});
}
}
F0R(i, n+m-1){
int cntA=0, cntB=0, M=siz(dist[i]);
for(auto [x, y]:dist[i]){
cntA+=a[x][y]=='B';
cntB+=a[x][y]=='R';
}
if(cntA>0&&cntB>0){
cout << "0\n"; return 0;
}
if(cntA==0&&cntB==0){
ans*=2;
}
}
cout << ans.v << "\n";
return 0;
}
| #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
using namespace std;
unsigned long long g2(unsigned long long N) {
int* ar = new int[(int)log10(N)+1];
unsigned long long a = 0;
for (int i = 0; i <= (int)log10(N); i++) {
ar[i] = (int)(N / pow(10, i)) % 10;
}
sort(ar, ar + (int)log10(N) + 1, greater<>());
for (int i = 0; i < (int)log10(N) + 1; i++) {
a += ar[i] * pow(10, i);
}
return a;
}
unsigned long long g1(unsigned long long N) {
int* ar = new int[(int)log10(N) + 1];
unsigned long long a = 0;
for (int i = 0; i <= (int)log10(N); i++) {
ar[i] = (int)(N / pow(10, i)) % 10;
}
sort(ar, ar + (int)log10(N) + 1);
for (int i = 0; i < (int)log10(N) + 1; i++) {
a += ar[i] * pow(10, i);
}
return a;
}
int main() {
unsigned long long N, K,a;
cin >> N >> K;
a = N;
for (int i = 0; i < K; i++) {
//cout << g1(a) << " " << g2(a) << endl;
if (!a) break;
a = g1(a) - g2(a);
}
cout << a;
return 0;
}
|
#include <map>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const ll lim=1000000000LL*1000000000LL;
map<ll,pii> mp;
int n,m;
ll a[100],b[100];
int main()
{
a[n=0]=b[m=0]=1;
while(a[n]*3<=lim)
{
++n;
a[n]=a[n-1]*3;
}
while(b[m]*5<=lim)
{
++m;
b[m]=b[m-1]*5;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
mp[a[i]+b[j]]=pii(i,j);
ll x;
scanf("%lld",&x);
if(mp.find(x)!=mp.end())
printf("%d %d",mp[x].first,mp[x].second);
else
printf("-1");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
double ans = 0;
for(int i = 1; i < n; i++){
ans += 1.0/i;
}
ans *= n;
cout << fixed << setprecision(10) << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define MP make_pair
#define MT make_tuple
typedef int64_t ll;
#define PA pair<ll,ll>
#define TU tuple<ll,ll,ll>
#define vi vector<ll>
#define vii vector<vector<ll> >
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define rep2(i,m,n) for(ll (i)=(m); (i)<(ll)(n); (i)++)
const ll INF = 1ll<<60;
const ll INF2 = 1ll<<32;
const ll MOD = 998244353;
void cycle(vi &v,ll state, vector<bool> &b,ll &pts) {
ll ser = state;
set<ll> s;
while(!b.at(ser)) {
s.insert(ser);
b.at(ser) = true;
ser = v.at(ser);
}
if(s.count(ser)) pts++;
}
int main() {
ll n;
cin >>n;
vi v(n);
rep(i,n) {
cin >>v.at(i);
v.at(i)--;
}
vector<bool> b(n,false);
ll pts =0;
rep(i,n) {
cycle(v,i,b,pts);
}
ll ans =1;
rep(i,pts) {
ans *= 2;
ans %= MOD;
}
ans--;
ans %= MOD;
cout <<ans <<endl;
} | using namespace std;
#include <bits/stdc++.h>
const int N=105,mo=998244353;
typedef long long ll;
int n,sum;
int w[N];
int f[N*N][N];
ll fac[N];
int main(){
scanf("%d",&n);
for (int i=1;i<=n;++i)
scanf("%d",&w[i]),sum+=w[i];
if (sum&1){
printf("0\n");
return 0;
}
sum/=2;
f[0][0]=1;
for (int i=1;i<=n;++i)
for (int s=sum;s>=w[i];--s)
for (int c=1;c<=i;++c)
(f[s][c]+=f[s-w[i]][c-1])%=mo;
fac[0]=1;
for (int i=1;i<=n;++i)
fac[i]=fac[i-1]*i%mo;
ll ans=0;
for (int c=0;c<=n;++c)
ans=(ans+f[sum][c]*fac[c]%mo*fac[n-c])%mo;
printf("%lld\n",ans);
return 0;
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n =0 , m = 0;
cin >> n >> m ;
if(min(m , n ) + 3 > max(m,n ) ){
cout <<"Yes" <<endl;}
else
cout << "No" <<endl;
return 0;}
| #include <iostream>
#include <algorithm>
#include <vector>
//#include <string>
//#include <set>
#include <map>
//#include <math.h>
//#include <queue>
//#include <tuple>
//#include <iomanip>
//#include <numeric>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
//const ll INF = numeric_limits<ll>::max()/4;
int main () {
map<int, vector<int>> pos;
int N, M;
cin >> N >> M;
rep(i,N) {
int a;
cin >> a;
pos[a].push_back(i);
}
rep(i,N+1) {
int l = -1;
for(auto r: pos[i]) {
if (r-l-1 >= M) {cout << i << endl; return 0;}
l = r;
}
if (N-l-1 >= M) {cout << i << endl; return 0;}
}
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef unsigned long long int ull ;
const int MOD=1e9+7;
const char nl = '\n';
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n ;
ull ans = 0 ;
cin >> n ;
while(n--){
ull a , b ;
cin >> a >> b ;
ans += ( (b*(b+1) - a*(a+1 ) ) / 2 + a ) ;
}
cout << ans ;
return 0;
} | /**
* Author: dhruv_gheewala
* Problem: C - Swappable
* Date: 19.06.2021
* Time: 17:37:56
**/
#include "bits/stdc++.h"
using namespace std;
#ifndef DEBUG
#define fundri 108
#define debug(...) 1729
#define endl '\n'
#endif
#define int int64_t
typedef pair<int, int> pii;
typedef vector<int> vi;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int rnd(int l = 0, int r = INT_MAX) {return uniform_int_distribution<int>(l, r)(rng);}
bool in_range(int x, int l, int r) {return l <= x && x <= r;}
template<typename H, typename ...T>void inp(H &head) {cin >> head;}
template<typename H, typename ...T>void inp(H &head, T &...tail) {cin >> head;inp(tail...);}
template<typename T>inline istream &operator >>(istream &in, vector<T> &a) {for(T &x : a)in >> x; return in;}
template<typename T, typename U>inline istream &operator >>(istream &in, pair<T, U> &a) {in >> a.first >> a.second; return in;}
// Multi-Dimension Vector
// Usage: vec<n, data-type> dp(dimention-1, dimention-2, ..., dimention-n, default = data-type())
template<int D, typename T> struct vec : public vector<vec<D - 1, T>> {
static_assert(D >= 1, "Vector dimensions must be greater than zero !!");
template<typename... Args>
vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)){}
};
template<typename T> struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val){}};
const int inf = 1e15;
const bool testcases = false;
const bool ready = []() -> bool {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#ifdef DHRUV_GHEEWALA
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
return true;
}();
void solve(int tc);
int32_t main(int32_t argc, char **argv) {
int TC = 1;
if(testcases) cin >> TC;
// Pre-Processing goes here...
for(int tc = 1; tc <= TC; ++tc) {
solve(tc);
fundri;
}
exit(0);
}
void solve(int tc) {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
int ans = 0;
map<int, int> mp;
for(int i = 0; i < n; i++) {
mp[a[i]]++;
ans += (i + 1 - mp[a[i]]);
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int j,n;
cin >> n;
set<int>ans;
ans.insert(10);
ans.insert(15);
for(j=6; j<=1e4 && (int)ans.size() < n; j+=6)ans.insert(j);
for(j=10; j<=1e4 && (int)ans.size() < n; j+=10)ans.insert(j);
for(j=15; j<=1e4 && (int)ans.size() < n; j+=15)ans.insert(j);
for(int it : ans)cout << it << ' ';
return 0;
} | #include<iostream>
using namespace std;
int main(){
int L;
cin >> L;
L--;
int64_t ans=1;
for(int i=1;i<=11;i++){
ans=ans*(L-i+1);
ans=ans/i;
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
template <typename Monoid>
struct SegTree {
using F = function<Monoid(Monoid, Monoid)>;
const F f;
const Monoid unit;
int n;
vector<Monoid> dat;
SegTree(int n_, const F f_, const Monoid unit_) : f(f_), unit(unit_) {
n = 1;
while (n < n_) n *= 2;
// 1-indexed
dat.assign(2 * n, unit);
}
void set(int i, const Monoid &x) {
dat[i + n] = x;
}
void build() {
for (int i = n - 1; i >= 0; --i) {
dat[i] = f(dat[2 * i], dat[2 * i + 1]);
}
}
void update(int i, const Monoid &x){
i += n;
dat[i] = x;
while (i >>= 1){
dat[i] = f(dat[2 * i], dat[2 * i + 1]);
}
}
// [a, b) 非再帰
Monoid query(int a, int b) {
Monoid l = unit, r = unit;
for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
if (a & 1) l = f(l, dat[a++]);
if (b & 1) r = f(dat[--b], r);
}
return f(l, r);
}
inline Monoid operator[] (int i){
return dat[i + n];
}
};
// set(i, v)した後にbuild()でO(n)
// 区間和 : SegTree<int> seg(n, [](int a, int b){ return a + b; }, 0);
// 区間min : SegTree<int> seg(n, [](int a, int b) {return min(a, b); }, INF);
int main(){
int n, m, k;
cin >> n >> m >> k;
vector<int> a(k);
int modoru[100010] = {};
for (int i = 0; i < k; ++i) {
cin >> a[i];
modoru[a[i]] = 1;
}
int cnt = 0;
for (int i = 0; i <= n; ++i) {
if (modoru[i]) cnt++;
else cnt = 0;
if (cnt >= m) {
cout << -1 << endl;
return 0;
}
}
SegTree<double> seg(n + m + 10, [](double a, double b){ return a + b; }, 0);
SegTree<double> seg2(n + m + 10, [](double a, double b){ return a + b; }, 0);
for (int i = n-1; i >= 0; --i) {
double a = seg.query(i + 1, i + m + 1) / m + 1.0;
double b = seg2.query(i + 1, i + m + 1) / m;
if (modoru[i]) {
seg2.update(i, 1.0);
} else {
seg.update(i, a);
seg2.update(i, b);
}
}
// x = seg[0] + seg2[0] * x
cout << fixed << setprecision(15) << seg[0] / (1 - seg2[0]) << endl;
} | //#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define DEBUG
#define INF 0x3f3f3f3f3f3f3f3f
#define mod 1000000007
#define PI 3.14159265358979323846
#define Base 23333333
//#define set unordered_set
//#define map unordered_map
#define int long long
#define LL long long
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define Yes cout<<"Yes"<<endl
#define mst(x) memset(x,0,sizeof(x))
#define debug(x) cout<<"DEBUG "<<#x<<" : "<<x<<endl
#define _up(x) ceil(x)
#define _down(x) floor(x)
#define range(x,y) 1
//#define int unsigned long long
using namespace std;
//#define scanf scanf_s
//#define max(a,b) ((a) > (b) ? (a) : (b))
//#define min(a,b) ((a) < (b) ? (a) : (b))
inline int gcd(int a, int b) { return b > 0 ? gcd(b, a%b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
inline int qpow(int a, int n) { int ans = 1; while (n) { if (n & 1) { ans *= a; }a *= a; n >>= 1; }return ans; }
inline int _qpow(int a, int n) { int ans = 1; while (n) { if (n & 1) { ans *= a % mod; ans %= mod; }a *= a; a %= mod; n >>= 1; }return ans % mod; }
/*
#define read() _read()
#define cout fout
#define cin fin
ifstream fin("in.txt");fstream fout("out.txt");
int _read() { int tmp; fin >> tmp; return tmp;}
*/
inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch<'0' || ch>'9') { if (ch == '-') { f = -1; } ch = getchar(); } while (ch >= '0'&&ch <= '9') { x = 10 * x + ch - '0'; ch = getchar(); } return x * f; }
signed main()
{
int v = read(), t = read(), s = read(), d = read();
int st = v * t, ed = v * s;
if (d > ed || d < st)Yes;
else No;
return 0;
}
|
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define ll long long
#define repi(i,a,b) for(ll i=a;i<b;++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
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 vvv = vector<vector<vector<ll>>>;
using vv = vector<vector<ll>>;
using vec = vector<ll>;
using P = pair<ll, ll>;
int main(void){
ll n; cin >> n;
vec al(n), bl(n), cl(n);
rep(i, n) cin >> al[i];
rep(i, n) cin >> bl[i];
rep(i, n) cin >> cl[i];
map<ll, ll> amp;
map<ll, ll> bmp;
rep(i, n){
amp[al[i]]++;
}
rep(i, n){
bmp[bl[cl[i] - 1]]++;
}
ll ans = 0;
for(auto item : amp){
ans += bmp[item.first] * item.second;
}
cout << ans << endl;
}
| #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 indexed_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//find_by_order = returns pointer to element at that pos
//order_of_key = returns pos of the given element
#define indexed_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(x) (x).begin(),(x).end()
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define int long long
#define endl "\n"
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define rep(i,a,b) for (int i = a; i <b; i++)
#define MOD 1000000007
#define boost
#define debug1(x) cout<<#x<<" "<<x<<endl;
#define debug2(x,y) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<endl;
#define debug3(x,y,z) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<" "<<#z<<" "<<z<<endl;
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.F>>a.S;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.F<<" "<<a.S;return out;}
template<class _T>inline void read(_T &_a)
{
bool f=0; char _c=getchar(); _a=0;
while(_c<'0'||_c>'9'){ if(_c=='-') f=1; _c=getchar(); }
while(_c>='0'&&_c<='9'){ _a=(_a<<3)+(_a<<1)-'0'+_c; _c=getchar(); }
if(f) _a=-_a;
}
int pw(int a,int b,int p){
if(b==0)return 1;
int t=pw(a,b/2,p);
if(b%2)return (((a*t)%p)*t)%p;
else return ((t*t)%p);
}
const long long INF=1e18;
int T=1;
int n;
vi a;
bool good(int x)
{
rep(i,0,n)
{
if(__gcd(x,a[i])==1)
return false;
}
return true;
}
vector<int> pdivs;
void solve2(int x) {
for(int i=2; i*i <= x; i++) {
if(x % i == 0) {
pdivs.push_back(i);
while(x % i==0) x /= i;
}
}
if(x > 1) pdivs.push_back(x);
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/* cin>>T; */
while(T--)
{
cin>>n;
a.resize(n);
int ans=INF;
rep(i,0,n)
cin>>a[i];
vi primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
rep(i,0,1LL<<15)
{
int x=1;
rep(j,0,15)
{
if(i&(1LL<<j))
x=x*primes[j];
}
bool res = good(x);
if(res)
{
ans=min(ans,x);
}
}
cout<<ans<<endl;
}
// you should actually read the stuff at the bottom
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
return 0;
} |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
int power(int x, int y, int p)
{
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
res = (res*x) % p;
// y must be even now
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
signed main(){
int n , m;
cin>>n>>m;
int ans = (power(10 , n , m*m ) - power(10 , n , m ) +m*m )%(m*m );
ans/= m;
cout<<ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int C = A + B;
if(C >= 15 && B >= 8){
cout << "1" << endl;
}
else if(C >=10 && B >= 3){
cout << "2" << endl;
}
else if(C >= 3){
cout << "3" << endl;
}
else{
cout << "4" << endl;
}
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
char IO;
int rd(){
int num=0;bool f=0;
while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
do num=(num<<1)+(num<<3)+(IO^48);
while(IO=getchar(),IO>=48&&IO<=57);
return f?-num:num;
}
ll A,B,C,D;
int main(){
A=rd(),B=rd(),C=rd(),D=rd();
if(C*D<=B){cout<<-1;return 0;}
cout<<(A-1)/(C*D-B)+1;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,tp;
char s[N],st[N];
int main() {
#ifdef LOCAL
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
#endif
ios::sync_with_stdio(0);cin.tie(0);
cin>>n>>(s+1);
for(int i=1;i<=n;i++) {
st[++tp]=s[i];
if(st[tp-2]=='f'&&st[tp-1]=='o'&&st[tp]=='x') tp-=3;
}
cout<<tp;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int32_t main(){
IOS
string s,t;
cin>>s>>t;
if(s[0]=='Y'){
t[0] = t[0]-'a'+'A';
}
cout<<t[0]<<endl;
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 ar array
#define ll long long
const int MAX_N = 2e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int n, m, a[MAX_N], mx[MAX_N];
vector<int> adj[MAX_N];
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
}
int ans = -INF;
for (int u = n; u > 0; u--) {
if (adj[u].empty()) {
mx[u] = a[u];
continue;
}
for (int v : adj[u]) mx[u] = max(mx[u], mx[v]);
ans = max(ans, mx[u] - a[u]);
mx[u] = max(mx[u], a[u]);
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int tc = 1;
// cin >> tc;
for (int t = 1; t <= tc; t++) {
// cout << "Case #" << t << ": ";
solve();
}
} | #include"bits/stdc++.h"
using namespace std;
#define ll long long
#define ul unsigned long long
#define ui unsigned int
#define ri register int
#define pb push_back
#define mp make_pair
char p[30]={'0','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
inline ll rd(){
ll x=0,flag=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') flag=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+(ch^48);ch=getchar();}
return x*flag;
}
#define N 100010
int wl,x,y,head[N],a[22][22],dp[132010][19],dis[N],c[22],vis[N],k,n,m,q[N],l,r;
struct node{
int nxt,to;
}star[N<<1];
inline void add(int from,int to){
wl++;
star[wl].to=to;
star[wl].nxt=head[from];
head[from]=wl;
}
inline void bfs(int x){
dis[x]=0;l=1,r=0;
q[++r]=x;
while(l<=r){
int u=q[l++];
for(ri i=head[u];i;i=star[i].nxt){
int v=star[i].to;
if(dis[v]!=0x3f3f3f3f) continue;
dis[v]=dis[u]+1;q[++r]=v;
}
}
}
int main()
{
n=rd(),m=rd();
for(ri i=1;i<=m;++i) x=rd(),y=rd(),add(x,y),add(y,x);
k=rd();
for(ri i=1;i<=k;++i) c[i]=rd();
for(ri i=1;i<=k;++i){
memset(dis,0x3f,sizeof(dis));bfs(c[i]);
for(ri j=i+1;j<=k;++j) a[i][j]=a[j][i]=dis[c[j]];
}
memset(dp,0x3f,sizeof(dp));
for(ri i=1;i<=k;++i) dp[(1<<(i-1))][i]=1;
for(ri s=0;s<(1<<k);++s){
for(ri i=1;i<=k;++i){
if((s&(1<<(i-1)))==0) continue;
for(ri j=1;j<=k;++j){
if(s&(1<<(j-1))) continue;
dp[s^(1<<(j-1))][j]=min(dp[s^(1<<(j-1))][j],dp[s][i]+a[i][j]);
}
}
}
int ans=0x3f3f3f3f;
for(ri i=1;i<=k;++i) ans=min(ans,dp[(1<<k)-1][i]);
if(ans==0x3f3f3f3f) puts("-1");
else
cout<<ans;
return 0;
} |
/*
我的心脏怦怦跳，监管者就在附近
name:
Algorithm:
writer:Lxs(cdx)
place:
nothing is impossible
*/
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#include<string>
#include<iostream>
#include<cmath>
#include<set>
#include<stack>
#include<queue>
#include<unistd.h>
#include<stdio.h>
#include<cstring>
#define random(a,b) (rand()%(b-a+1)+a)
using namespace std;
bool prime(int x){
int i;
if(x<2) return 0;
for(i=2;i*i<=x;i++){
if(x%i==0){return 0;}
}
return 1;
}
bool flag[19999990];
int _prime[19999990];
void get_prime(int maxn)
{
int i,j;
for(i=2;i<=maxn;i++)
if(!flag[i])
{
_prime[++_prime[0]]=i;
for(j=i*i;j<=maxn;j+=i)
flag[j]=true;
}
}
long long _do[400001],n_do[400001];
long long aoki[1000000],ta[1000000];
int main()
{
long long n;
cin>>n;
long long i;
long long ao=0;
for(i=0;i<n;i++){
cin>>aoki[i]>>ta[i];
_do[i]=aoki[i]+ta[i];
n_do[i]=aoki[i];
ao-=n_do[i];
_do[i]=_do[i]+n_do[i];
}
sort(_do+0,_do+n);
long long g=0;
for(i=n-1;i>=0;i--){
if(ao<=0){
ao+=_do[i];
g++;
}
else{
break;
}
}
if(ao>0) cout<<g<<endl;
return 0;
}
| // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define F first
#define S second
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define cf ll testcases;cin>>testcases;while(testcases--)
#define prn(x) if(x) cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define minel(x) (*min_element(all(x)))
#define maxel(x) (*max_element(all(x)))
#define cou dbg=1;cout
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<ld> vd;
typedef vector<pi> vp;
ll dbg=0;
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p);
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p);
template<typename A> istream& operator>>(istream& cin, vector<A> &v);
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void solve(){
ll n;
cin>>n;
vp arr(n);
ll sum=0;
for(ll i=0;i<n;i++){
ll a,b;
cin>>a>>b;
arr[i]={2*a+b,a};
sum+=a;
}
sort(all(arr),greater<pair<ll,ll>>());
ll ans=0;
ll sum2=0;
for(auto i:arr){
if(sum2>sum) break;
sum2+=i.F-i.S;
sum-=i.S;
ans++;
}
cout<<ans<<endl;
}
int main(){
IO;
// cf
solve();
return 0;
}
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) {
if(dbg){dbg=0;
return cout << "(" << p.F << ", " << p.S << ")";
}else{
return cout<<p.F<<' '<<p.S;
}
}
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
if(dbg){dbg=0;
cout << "["; for(ll i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}else{
for(ll i=0;i<v.size()-1;i++) cout<<v[i]<<' ';
return cout<<v[v.size()-1];
}
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
template<typename A> istream& operator>>(istream& cin, vector<A> &v) {
for(ll i=0;i<v.size()-1;i++) cin>>v[i];
return cin >> v[v.size()-1];
} |
#include <bits/stdc++.h>
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5, lim = 1e6;
int l, r, tot;
int pri[maxn], v[maxn], cnt[maxn];
vector<int> fac[maxn], s[maxn];
int getint()
{
char ch;
int res = 0, p;
while (!isdigit(ch = getchar()) && ch != '-');
p = ch == '-'? ch = getchar(), -1 : 1;
while (isdigit(ch))
res = res * 10 + ch - '0', ch = getchar();
return res * p;
}
int cal(int x)
{
int sz = s[x].size(), allset = (1 << sz) - 1;
int res = 0;
fo(i, 1, allset)
{
int p = 1, ss = 0;
fo(j, 0, sz - 1)
if ((i >> j) & 1) p *= s[x][j], ss++;
if (ss & 1) res += cnt[p];
else res -= cnt[p];
}
return res;
}
void upd(int x)
{
int sz = s[x].size(), allset = (1 << sz) - 1;
fo(i, 1, allset)
{
int p = 1;
fo(j, 0, sz - 1)
if ((i >> j) & 1) p *= s[x][j];
cnt[p]++;
}
}
int main()
{
//int st = clock();
//freopen("t.in", "r", stdin);
fo(i, 1, lim)
fo(j, 1, lim / i)
fac[i * j].push_back(i);
fo(i, 2, lim)
{
if (!v[i]) v[i] = i, s[i].push_back(i), pri[++tot] = i;
fo(j, 1, tot)
{
if (pri[j] > v[i] || pri[j] > lim / i) break;
v[i * pri[j]] = pri[j];
s[i * pri[j]] = s[i];
if (pri[j] != v[i]) s[i * pri[j]].push_back(pri[j]);
}
}
/*fo(i, 2, lim)
{
int x = i;
while (x > 1)
{
int t = v[x];
s[i].push_back(t);
while (x > 1 && !(x % t)) x /= t;
}
}*/
cin >> l >> r;
if (l == 1) l++;
ll ans = 0;
fo(i, l, r)
{
upd(i);
ans += cal(i);
int cnt = fac[i].end() - lower_bound(fac[i].begin(), fac[i].end(), l);
ans -= cnt;
}
ans <<= 1;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <ostream>
#include <list>
#include <map>
#include <algorithm>
#include <climits>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <bitset>
#include <cstring>
#include <deque>
#include <set>
#include <stack>
#include <queue>
#include <chrono>
#include <deque>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define mod 1000000007
#define cbit __builtin_popcountll
#define pl pair<long, long>
#define pqp priority_queue<pl>
#define mkp make_pair
#define vl vector<ll>
#define vvl vector<vl >
#define pb push_back
#define inf 10000000
#define all(v) v.begin(), v.end()
long long gcd(long long int a, long long int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
long long lcm(ll a, ll b)
{
return (a / gcd(a, b)) * b;
}
ll mod_power(ll a,ll b)
{
if(b==0)
{
return 1;
}
ll temp=mod_power(a,b/2);
temp%=mod;
temp*=temp;
temp%=mod;
if(b%2==1)
{
temp*=a;
temp%=mod;
}
return temp;
}
struct compare {
bool operator()(const pair<ll,ll > &a,const pair<ll,ll > &b)
{
return a.first>b.first;
}
};
bool comp(const pair<ll,ll > &a,const pair<ll,ll > &b)
{
if(a.first==b.first)
{
return a.second<b.second;
}
return a.first<b.first;
}
vl mb(1e6+5,0);
ll calmb(ll n,vl& div)
{
ll cnt=0;
while(n>1)
{
ll k=0;
ll d=div[n];
while(n%d==0)
{
n/=d;
k++;
if(k>1)
{
return 0;
}
}
cnt++;
}
if(cnt%2)
{
return -1;
}
return 1;
}
void seive()
{
mb[1]=0;
vl div(1e6+5,0);
for(ll i=2;i<1e6+5;i++)
{
if(div[i]==0)
{
for(ll j=i;j<1e6+5;j+=i)
{
if(div[j]==0)
{
div[j]=i;
}
}
}
mb[i]=calmb(i,div);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t = 1;
// cin >> t;
seive();
while (t--)
{
ll l,r;
cin>>l>>r;
if(l==1)
{
l++;
}
ll ans=0;
for(ll i=1;i<=r;i++)
{
ll cnt=r/i-(l-1)/i;
ans-=mb[i]*cnt*cnt;
}
for(ll i=l;i<=r;i++){
for(ll j=i;j<=r;j+=i)
{
ans--;
if(i != j) ans--;
}
}
cout<<ans<<"\n";
}
return 0;
} |
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
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); }
#define zt(a,b) (max((a),(b))-min((a),(b)))
int main(){
ll i,j,r[2],c[2],res=0;
for(i=0;i<2;i++){
cin >> r[i] >> c[i];
}
if(r[0]==r[1] && c[0]==c[1]){
res = 0;
}else if(r[0]+c[0]==r[1]+c[1] || r[0]-c[0]==r[1]-c[1] || abs(r[0]-r[1])+abs(c[0]-c[1])<=3){
res = 1;
}else if(abs(r[0]-r[1])+abs(c[0]-c[1])<=6 || zt(r[0]+c[0],r[1]+c[1])<=3 || zt(r[0]-c[0],r[1]-c[1])<=3){
res = 2;
}else if((r[0]+c[0])%2==(r[1]+c[1])%2){
res = 2;
}else{
res = 3;
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a,b;
scanf("%d%d%d%d",&n,&m,&a,&b);
if(n==a&&m==b){
printf("0\n");
}
else if(n+m==a+b||n-m==a-b||abs(n-a)+abs(m-b)<=3){
printf("1\n");
}
else{
if((abs(n+m)+abs(a+b))%2==0){
printf("2\n");
}
else {
for(int i=n-3;i<=n+3;i++){
for(int j=m-3;j<=m+3;j++){
if(abs(i-n)+abs(j-m)>3)continue;
else if(i+j==a+b||i-j==a-b||abs(i-a)+abs(j-b)<=3){
printf("2\n");
return 0;
}
}
}
printf("3\n");
}
}
return 0;
} |
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
#include <cmath>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
using namespace std;
int main(){
int n;
cin >> n;
vector<int> type(2*n, 0);
vector<vector<int>> p(2*n, vector<int>(2*n, 0));
bool check = true;
rep(i, n){
int a, b;
cin >> a >> b;
if (a != -1){
a--;
if (type[a] != 0){
check = false;
break;
}
type[a] = -1;
}
if (b != -1){
b--;
if (type[b] != 0){
check = false;
break;
}
type[b] = 1;
}
if (a != -1 && b != -1){
rep(j, 2*n){
p[a][j] = -1;
p[j][a] = -1;
p[b][j] = -1;
p[j][b] = -1;
}
p[a][b] = 1;
}
}
vector<bool> dp(n+1, false);
dp[0] = true;
rep2(i, 1, n+1){
if (!check) break;
rep(j, i){
if (!dp[j]) continue;
ll dist = i - j;
bool flag = true;
rep(k, dist){
if (p[j*2+k][j*2+k+dist] == -1 ||
(p[j*2+k][j*2+k+dist] == 0 && type[j*2+k] != 0 && type[j*2+k+dist] != 0) ||
type[j*2+k] == 1 || type[j*2+k+dist] == -1){
flag = false;
break;
}
}
if (flag){
dp[i] = true;
break;
}
}
}
if (dp[n]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll a, ll b) {
return a*b/__gcd(a,b);
}
ll power(ll a, ll n, ll mod) {
ll res = 1;
while(n > 0) {
if(n&1) {
res = (res*a)%mod;
}
a = (a*a)%mod;
n = n/2;
}
return res;
}
ll sum(int arr[], int n) {
ll res = 0;
f(i,n) {
res += arr[i];
}
return res;
}
void seive() {
prime[1] = 0;
for(int i=2; i<=100000; i++) {
prime[i] = 1;
}
for(ll i=2; i<=100000; i++) {
if(prime[i]) {
for(ll j=i*i; j<=100000; j+=i) {
prime[j] = 0;
}
}
}
}
bool check(string s) {
f(i,s.length()) {
if(s[i] == '0') return false;
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while(t--){
ll n,m;
cin>>n>>m;
ll a[m],b[m];
f(i,m) {
cin>>a[i]>>b[i];
}
ll k;
cin>>k;
ll c[k],d[k];
f(i,k) {
cin>>c[i]>>d[i];
}
string s = "";
f(i,k) s += "0";
int ans = 0;
while(true) {
if(check(s)) break;
ll temp[n+1] = {0};
f(i,k) {
if(s[i] == '0') {
temp[c[i]]++;
} else {
temp[d[i]]++;
}
}
int res = 0;
f(i,m) {
if(temp[a[i]] and temp[b[i]]) {
res++;
}
}
ans = max(ans,res);
f(i,k) {
if(s[i] == '0') {
s[i] = '1';
break;
}
else {
s[i] = '0';
}
}
}
cout<<ans;
}
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
using ll = long long;
using ld = long double;
using namespace std;
map<ll, int> m;
ll n;
int main() {
scanf ("%lld", &n);
ll three = 3, cnt = 1;
while (three <= n) {
m[three] = cnt;
three *= 3;
cnt++;
}
ll five = 5;
cnt = 1;
while (five <= n) {
if (m[n - five]) return !printf ("%d %lld\n", m[n - five], cnt);
five *= 5;
cnt++;
}
printf ("-1\n");
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = max(a, b)
#define amin(a, b) a = min(a, b)
using ll = long long;
int pow5(ll x) {
int cnt = 0;
while (x % 5 == 0) {
x /= 5;
cnt++;
}
return (x == 1 ? cnt : 0);
}
int main() {
ll n;
std::cin >> n;
for (ll p3 = 3, a = 1; p3 < n; p3 *= 3, a++) {
if (int b = pow5(n - p3); b > 0) {
std::cout << a << ' ' << b << '\n';
return 0;
}
}
std::cout << -1 << '\n';
return 0;
} |
/*
|\ /| || 00 00
| \ / | || 0 0 0 0
| \/ | ====== || 0 0 0 0
| | ====== || 0 0 0 0
| | || 0 0 0 0
| | || 00 00
*/
#include "bits/stdc++.h"
#define ll long long
#define chl_jldi ios_base::sync_with_stdio(false); cin.tie(0)
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define ff first
#define ss second
#define null NULL
#define sz(xss) (xss.size())
#define uset unordered_set
#define nl "\n"
#define spc " "
#define pnl cout<<"\n"
#define odd(xz2) (xz2&1)
#define umap unordered_map
using namespace std;
void solve(){
int a,b;
cin>>a>>b;
if(a>=b){
ll sum=0;
for(int i=1;i<=a;i++) cout<<i<<spc,sum+=i;
for(int i=1;i<b;i++) cout<<(-1)*i<<spc,sum-=i;
cout<<(-1*sum);
}
else{
ll sum=0;
for(int i=1;i<=b;i++) cout<<(-1)*i<<spc,sum+=i;
for(int i=1;i<a;i++) cout<<i<<spc,sum-=i;
cout<<(sum);
}
pnl;
}
int main(){
chl_jldi;
#ifndef ONLINE_JUDGE
freopen("error.txt","w",stderr);
#endif
ll test=1;
// ++++++++++++++++++++++++++++++++++++++++++ //
//cin>>test;
// ++++++++++++++++++++++++++++++++++++++++++ //
while(test--){
solve();
}return 0;} | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);
ll mod_pow(ll x, ll n, ll m = mod) {
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
void solve() {
char s, t; cin >> s >> t;
if (s == 'Y')t += 'A' - 'a';
cout << t << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(15);
//init_f();
//init();
//expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
int i=0;
int cnt=0;
while(i<9)
{
if(s[i] == 'Z')
{
if((s[i+1] == 'O') && (s[i+2] == 'N') && (s[i+3] == 'e'))
{
i+=4;
cnt++;
}
else
i++;
}
else
i++;
}
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int t = 0;
for (int i = 0; i <= s.size() - 4; i++)
if (s.substr(i, 4) == "ZONe") t++;
cout << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
vector<string> C(vector<string> s) {
ll n=s.size();
rep(i,n)REP(j,i+1,n) swap(s[i][j],s[j][i]);
return s;
}
ll n,m;
string s[1000];
ll calc(vector<string> t) {
ll cnt=0;
rep(k,m) {
ll f=0;
rep(l,2) {
rep(i,n) {
rep(j,n) {
if(t[i].substr(0,s[k].size())==s[k]) f=1;
rotate(t[i].begin(),t[i].begin()+1,t[i].end());
}
}
t=C(t);
}
cnt+=f;
}
return cnt;
}
vector<string> ans;
ll MM;
void solve(vector<string> t) {
ll d=calc(t);
if(MM<d) {
MM=d;
ans=t;
}
rep(k,5) {
random_shuffle(all(t));
rep(i,n) rotate(t[i].begin(),t[i].begin()+rand()%n,t[i].end());
ll d=calc(t);
if(MM<d) {
MM=d;
ans=t;
}
}
}
void Main() {
srand((unsigned)time(NULL));
cin >> n >> m;
rep(i,m) R s[i];
vector<string> v[15];
rep(i,m) v[s[i].size()].pb(s[i]);
rep(e,30) {
vector<string> t(n);
rrep(i,15) {
random_shuffle(all(v[i]));
rep(j,v[i].size()) {
ll M=MAX,x=0;
string rr;
rep(k,n) {
rep(l,t[k].size()+1) {
string r1=t[k].substr(l);
if(r1.size()<=v[i][j].size()) {
string r2=v[i][j].substr(0,r1.size());
if(r1==r2) {
ll d=t[k].size()+v[i][j].size()-r1.size();
if(d<=n&&M>d) {
M=d;
x=k;
rr=t[k]+v[i][j].substr(r1.size());
}
}
}
}
}
if(rand()%8==0) M=MAX;
if(M!=MAX) t[x]=rr;
}
}
rep(i,n) {
while(t[i].size()<n) {
//t[i]+='.';
t[i]+=(char)(rand()%8+'A');
}
}
solve(t);
}
rep(i,n) pr(ans[i]);
}
int main(){Main();return 0;}
| // author: immortal3
// github: github.com/immortal3
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.fr>>a.sc;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.fr<<" "<<a.sc;return out;}
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;
const int MOD = 1e9 + 7;
const long long MOD2 = static_cast<long long>(MOD) * MOD;
void read_vector(vector<int> &a, int n)
{
rep(i, 0, n)
cin >> a[i];
}
int s(int a)
{
int total = 0;
while(a)
{
total += a % 10;
a = a / 10;
}
return total;
}
void solve()
{
int a, b;
cin >> a >> b;
cout << max(s(a), s(b)) << "\n";
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;
// cin >> t;
t = 1;
while (t--)
{
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using V = vector<ll>;
int main()
{
ll n;
cin >> n;
vector<P> town(n);
V taka(n);
ll takahashi = 0;
ll aoki = 0;
for (int i = 0; i < n; i++)
cin >> town[i].first >> town[i].second;
for (int i = 0; i < n; i++)
{
aoki += town[i].first;
taka[i] = town[i].first * 2 + town[i].second;
}
sort(taka.begin(), taka.end(), greater<>());
for (int i = 0; i < n; i++)
{
takahashi += taka[i];
if (takahashi > aoki)
{
cout << i + 1 << endl;
return 0;
}
}
}
| #define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define MAXN 1000005
#define MOD 1000000007
#define INF 1000000000000000000
#define eps (1e-9)
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
#ifdef wiwihorz
#define print(a...) out("[" + string(#a) +"] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void out() {cerr << endl;}
template<class T1, class ... T2> void out(T1 a, T2 ... e) {cerr << a <<" ", out(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
int n, s, A, B;
vector<int> a;
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n, s = 0;
rep(i, 1, n) {
cin >> A >> B;
s += A;
a.push_back(2 * A + B);
}
sort(all(a)), reverse(all(a));
// vprint(all(a)), print(s);
int ans = 0;
rep(i, 0, n - 1) {
s -= a[i];
if(s < 0) {
ans = i + 1;
break;
}
}
cout << ans << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int N, Q;
int A[300005];
bool fenwick[35][300005];
void update_bit(int idx, int bit) {
for (int i = idx; i <= N; i += (i & -i)) {
fenwick[bit][i] ^= 1;
}
}
void update(int idx, int y) {
A[idx] ^= y;
for (int i = 0; i < 30; i++) {
if (y & (1 << i)) {
update_bit(idx, i);
}
}
}
int get_bit(int pos, int bit) {
bool res = 0;
for (int i = pos; i > 0; i -= (i & -i)) {
res ^= fenwick[bit][i];
}
return res;
}
void query(int l, int r) {
int ans = 0;
for (int i = 0; i < 30; i++) {
if (get_bit(l - 1, i) ^ get_bit(r, i)) {
ans = ans | (1 << i);
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> Q;
int x, y;
for (int i = 1; i <= N; i++) {
cin >> y;
update(i, y);
}
int ty;
while (Q--) {
cin >> ty >> x >> y;
if (ty == 1) {
update(x, y);
}else {
query(x, y);
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
//定数
#define INF 1001001001 //10^9:極めて大きい値,∞
//略記
#define PB push_back //vectorヘの挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
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;};
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1,0) {}
void init(int nn) {
n=nn;
d.resize(nn+1);
for(int i=0;i<nn+1;i++) d[i]=0;
}
void add(int i, T w=1) {
for (int x = i; x <= n; x += x & -x) d[x] += w;
}
T sum(int i) { // [1,x]
T ret = 0;
for (int x = i; x > 0; x -= x & -x) ret += d[x];
return ret;
}
T sum(int l, int r) { // [l,r)
return sum(r-1) - sum(l-1);
}
};
// BIT配列の宣言 N:配列数, n:各要素数;
// BIT<int> bit[N];
// rep(i,N) bit[i].init(n);
int main(){
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
int n=30;
BIT<int> bit[n];
rep(i, n) bit[i].init(N);
rep(i, N){
int a;
cin >> a;
rep(j, n){
if(a&(1<<j)) bit[j].add(i+1, 1);
}
}
rep(i, Q){
int t, x, y;
cin >> t >> x >> y;
if(t==1){
rep(j, n){
if(y&(1<<j)) bit[j].add(x, 1);
}
}
else{
int ans=0;
int mul=1;
rep(j,n){
if(bit[j].sum(x,y+1)%2==1) ans+=mul;
mul*=2;
}
cout << ans << endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef int int_;
#define int long long
const int mod=998244353;
int qpow(int a,int b){
int ret=1;
while(b){
if(b&1ll)ret=(ret*a)%mod;
a=(a*a)%mod;
b>>=1ll;
}
return ret%mod;
}
int_ main(){
int a,b,k;scanf("%lld%lld%lld",&a,&b,&k);
int ans=0;
if(a==1){
printf("%lld\n",qpow(k,b));
return 0;
}
if(b==1){
printf("%lld\n",qpow(k,a));
return 0;
}
for(int i=1;i<=k;i++){
// cout<<((qpow(i,a)-qpow(i-1,a))%mod+mod)%mod<<" "<<qpow(k-i+1,b)<<endl;
ans=(ans+((qpow(i,a)-qpow(i-1,a))%mod+mod)%mod*qpow(k-i+1,b)%mod)%mod;
}
printf("%lld",ans%mod);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;
#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
// const ll MOD = 1e9 + 7;
const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
ll modpow(ll a, ll n, ll mod_) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod_;
a = a * a % mod_;
n >>= 1;
}
return res;
}
const ll MAX_SIZE = 200005;
array<ll, MAX_SIZE> fac, inv, finv;
struct finit{
finit(){
// combination init
fac[0] = 1;
for (ll i = 1; i < MAX_SIZE; i++) fac[i] = fac[i - 1] * i % MOD;
finv[MAX_SIZE - 1] = modpow(fac[MAX_SIZE - 1], MOD - 2, MOD);
for(ll i = MAX_SIZE - 1; i > 0; i--) finv[i - 1] = finv[i] * i % MOD;
//inv init
repe(i, 1, MAX_SIZE) inv[i] = modpow(i, MOD - 2, MOD);
}
} finit_;
ll perm(ll a, ll b) { return fac[a] * finv[a - b] % MOD; }
ll comb(ll a, ll b) { return fac[a] * finv[b] % MOD * finv[a - b] % MOD; }
int main() {
ll N, M, K;
cin >> N >> M >> K;
if(N == 1){
ll ans = 0;
repe(k, 1, K + 1) {
(ans += modpow(K - k + 1, M, MOD) - modpow(K - k, M, MOD)) %= MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
}else if(M == 1){
ll ans = 0;
repe(k, 1, K + 1){
(ans += modpow(k, N, MOD) - modpow(k - 1, N, MOD)) %= MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
}
ll ans = 0;
repe(k, 1, K + 1){
(ans += (modpow(k, N, MOD) - modpow(k - 1, N, MOD)) * modpow(K - k + 1, M, MOD) % MOD) %= MOD;
}
cout << (ans + MOD) % MOD << endl;
} |
#pragma GCC optimize("Ofast")
#if 1
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
constexpr char newl = '\n';
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define show(x) cerr << #x << " = " << (x) << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo(x) cout<<((x)?"Yes":"No")<<newl;
#define YESNO(x) cout<<((x)?"YES":"NO")<<newl;
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
template<class A, class B> using umap = unordered_map<A, B>;
template<class A> using uset = unordered_set<A>;
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const pair<T, T>& v) {
o << "(" << v.first << "," << v.second << ")";
return o;
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T> ostream& operator<<(ostream& o, const set<T>& v) {
for (auto e : v) {
o << e << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
constexpr double eps = 1e-5;
int N;
struct Pt {
db x, y;
db ata() const {
return atan2(y, x);
}
friend ostream& operator<<(ostream& os, const Pt& p) {
return os << '(' << p.x << ',' << p.y << ')';
}
};
v(Pt) read() {
v(Pt) as(N);
db cx = 0, cy = 0;
{
vpii ab(N);
F0R(i, N) {
cin >> ab[i];
cx += ab[i].first; cy += ab[i].second;
}
cx /= N; cy /= N;
F0R(i, N) {
as[i] = { ab[i].first - cx,ab[i].second - cy };
}
}
return as;
}
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N;
auto as = read();
auto bs = read();
//show(as);
//show(bs);
if (N == 1) {
cout << "Yes"; return 0;
}
int s = 0;
if (as[0].x == 0 && as[0].y == 0) s++;
F0R(j, N) {
//show(j);
db r = as[s].ata();
//show(as[0]); show(r);
db r2 = bs[j].ata();
//show(bs[j]); show(r2);
db rot = r2 - r;
uset<int> us;
F0R(i, N) {
// iを回転
db x = cos(rot) * as[i].x - sin(rot) * as[i].y;
db y = sin(rot) * as[i].x + cos(rot) * as[i].y;
// 一致する頂点kを探す
F0R(k, N) {
if (abs(x - bs[k].x) < eps && abs(y - bs[k].y) < eps) {
//if (i==0) show(k);
us.insert(k); break;
}
}
}
if (sz(us) == N) {
cout << "Yes"; return 0;
}
}
cout << "No";
}
#endif
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rrep(i, n) for(int i = (int)(n) - 1; i >= 0; i --)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define sll set<ll>
#define spll set<pll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod2 998244353
#define inf 1000000000000000000
#define pi acos(-1)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rsort(a) sort(a.rbegin(), a.rend())
#define print(x) for(auto i : (x)) cout << i << " "; cout << 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; }
const ll dx[] = {-1,0,1,0,-1,-1,1,1};
const ll dy[] = {0,-1,0,1,-1,1,-1,1};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(15) << fixed;
ll a, b, c, d;
vll v(4);
cin >> v[0] >> v[1] >> v[2] >> v[3];
rep(i, pow(2, 4)) {
ll x = 0, y = 0;
rep(j, 4) {
if ((i >> j) & 1) x += v[j];
else y += v[j];
}
if (x == y) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
string S, T;
vector<int> ones;
main() {
cin >> N >> S >> T;
int j = 0;
int cost = 0;
for (int i = 0; i < N; i++) if (S[i] == '1') ones.push_back(i);
int M = ones.size();
for (int i = 0; i < N; i++) {
if (T[i] == '0') continue;
while (j+1 < M && ones[j] < i) {
cost += ones[j+1] - ones[j];
j += 2;
}
if (j >= M || ones[j] < i) {
cout << "-1\n";
return 0;
}
cost += ones[j] - i;
j++;
}
while (j+1 < M) {
cost += ones[j+1] - ones[j];
j += 2;
}
//cout << j << "nm";
if (j != M) {
cout << "-1\n";
return 0;
}
cout << cost << "\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long double LD;
typedef long long LL;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#ifdef LOCAL
#define DEBUG(x) { cerr << "# " << #x << ": " << x << endl;}
#else
#define DEBUG(x)
#endif
mt19937_64 mt(time(0));
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
const int MAXN = 62;
LL dp[MAXN][MAXN];
LL combine(int n, int k) {
assert(n >= k);
if (n-k < k) return combine(n, n-k);
if (dp[n][k] != 0) return dp[n][k];
if (k == 0) return dp[n][k] = 1;
if (k == 1) return dp[n][k] = n;
if (k == 2) return dp[n][k] = n * (n-1) / 2;
return dp[n][k] = combine(n-1, k-1) + combine(n-1, k);
}
string solve(int a, int b, LL k) {
if (k == 1) {
string s(a, 'a');
s += string(b, 'b');
return s;
}
assert (a > 0 && b > 0);
LL tmp = combine(a+b-1, a-1);
if (tmp >= k) return "a" + solve(a-1, b, k);
return "b" + solve(a, b-1, k-tmp);
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cout.precision(10); cout << fixed;
#ifdef LOCAL
freopen("../test.txt", "r", stdin);
// freopen("../output.txt", "w", stdout);
#endif
int a, b;
LL k;
cin >> a >> b >> k;
cout << solve(a, b, k) << endl;
/*---------------------------------------Coding Space End------------------------------------------*/
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s." << endl;
#endif
return 0;
}
/* author: txingml */
/* picture is from hamayanhamayan(CF handle) */
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
void P(int x) {cout << x << endl;}
void P(long x) {cout << x << endl;}
void P(double x) {cout << x << endl;}
void P(ll x) {cout << x << endl;}
void P(string x) {cout << x << endl;}
void P(char x) {cout << x << endl;}
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define drep(i, n) for(int i = n - 1; i >= 0; i--)
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
int main() {
double n, x;
cin >> n >> x;
x = x * 100;
int ans = 0;
int flag = 0;
double sum = 0;
rep (i, n) {
double v, p;
cin >> v >> p;
sum += v * p;
if (flag == 0 && sum > x) {
ans = i + 1;
flag = 1;
}
}
if (flag == 0) P(-1);
else P(ans);
return 0;
} | /*
--------------------------------------------------
------------ ------------
.Code by sonjaewon.
------------ ------------
--------------------------------------------------
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0); cout.tie(0);
ios_base::sync_with_stdio(false);
int n, k; cin >> n >> k;
k *= 100;
int water = 0, cnt = 0;
for(int i = 0; i < n; i++)
{
int a, b; cin >> a >> b;
water += a * b;
cnt++;
if(water > k)
{
cout << cnt;
return 0;
}
}
cout << -1;
}
|
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef unsigned long long ll;
string X; ll M;
ll INF = 1ll << 61;
bool isBigger(ll base) {
int n = X.size();
if (log(X[0] - '0') + (n - 1) * log(base) > log(INF)) { return true; }
ll c = 1;
for (int i = 1; i < n && c <= M; i++) { c *= base; }
if (c > M) { return true; }
ll cur = 0;
for (int i = 0; i < X.size(); i++) {
cur += c * (X[i] - '0');
c /= base;
if (cur > M) { return true; }
}
return false;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> X >> M;
int d = *max_element(X.begin(), X.end()) - '0';
if (X.size() == 1) {
if (X[0] - '0' <= M) { cout << 1 << '\n'; }
else { cout << 0 << '\n'; }
return 0;
}
ll l = d, r = INF;
while (l < r) {
ll mid = (l + r + 1) >> 1;
if (isBigger(mid)) { r = mid - 1; }
else { l = mid; }
}
if (r < l) { cout << 0 << '\n'; return 0; }
cout << (l - d) << '\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define piii pair<int, pair<int, int> >
#define pdi pair<double,int>
#define vi vector<int>
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define ms(x,val_add) memset(x, val_add, sizeof(x))
#define pb(x) push_back(x)
#define make_unique(x) sort(ALL(x)) ; x.erase( unique(ALL(x)), x.end()) ;
#define dbg(x) do { cout << #x << " = " << x << endl; } while(0)
#define mp(x, y) make_pair(x, y)
#define minimize(x, y) x = min(x, y)
#define maximize(x, y) x = max(x, y)
/*** IMPLEMENTATION ***/
bool exitInput = false;
int ntest = 1, itest = 1 ;
const int dx[4] =
{
-1, 0, 1, 0
};
const int dy[4] =
{
0, 1, 0, -1
};
// const int dx[8] = {-2, -1, -1, +0, +0, +1, +1, +2};
// const int dy[8] = {+0, -1, +1, -2, +2, -1, +1, +0};
/** Knight Move **/
// const int dx[8] = {+1, +2, +2, +1, -1, -2, -2, -1};
// const int dy[8] = {+2, +1, -1, -2, -2, -1, +1, +2};
const ll Mod = 1000000007LL;
const int maxn = 500 + 5;
const int maxv = 500 + 5;
const int maxe = 10000 + 5;
ll addMod( ll &x, ll y )
{
x = ( x + y ) % Mod;
}
int main()
{
#ifdef HOME
freopen( "input.txt", "r", stdin );
freopen( "output.txt", "w", stdout );
#endif // HOME
ios_base::sync_with_stdio( false );
cin.tie( NULL );
cout << setprecision( 10 );
cout << fixed;
int A, B;
cin >> A >> B;
A = A + B;
if(A >= 15 && B >= 8)
cout << 1;
else if(A >= 10 && B >= 3)
cout << 2;
else if(A >= 3)
cout << 3;
else
cout << 4;
return 0;
}
|
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.txt","w",stdout)
#define pr2 freopen("C:\\acm\\Cproj\\std.txt","w",stdout)
#define pii pair<int,int>
#define Please return
#define AC 0
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long LL;
template <class T>
void read(T &val) { T x = 0; T bz = 1; char c; for (c = getchar(); (c<'0' || c>'9') && c != '-'; c = getchar()); if (c == '-') { bz = -1; c = getchar(); }for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48; val = x * bz; }
const int mod=998244353;
const int maxn = 1e6+10;
int n,l,a[maxn],q,t,b[maxn];
char s[maxn];
vector<pii>g[maxn];
int main(){
// op;
read(n);read(l);
unordered_map<int,int>lef,rig;
fo(i,1,n) {
read(a[i]);
}
fo(i,1,n) read(b[i]);
lef[0]=0;rig[l-n]=n+1;
LL ans = 0;
fo(i,1,n){//往左的
if(b[i]>a[i]) continue;
if(a[i]!=b[i]&&!lef.count(b[i]-i)) {
puts("-1");return 0;
}
int tar = lef[b[i]-i];
lef[a[i]-i]=i;
if(a[i]==b[i]) continue;
lef[b[i]-i]=i;
g[i].push_back({tar,abs(i-tar)});//表示i小于tar，也就是i在tar之前就得要行动
ans+=abs(i-tar);
}
fod(i,n,1){
if(b[i]<a[i]) continue;
if(a[i]!=b[i]&&!rig.count(b[i]-i)) {
puts("-1");return 0;
}
int tar = rig[b[i]-i];
rig[a[i]-i]=i;
if(a[i]==b[i]) continue;
rig[b[i]-i]=i;
g[i].push_back({tar,abs(i-tar)});
ans+=abs(i-tar);
}
printf("%lld\n",ans);
Please AC;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
const ll mod = 1e9 + 7;
ll power(ll a, ll b) { //a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {res = (res * a) % MOD; b--;}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll gcd(ll a, ll b) {return (b == 0) ? a : gcd(b, a % b);}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, w;
cin >> h >> w;
vector <string> v(h);
for (int i = 0; i < h; i++)
cin >> v[i];
ll ans = 0;
vector <vl> prer(h, vl(w, -1));
vector <vl> suffr(h, vl(w, h));
vector <vl> prec(h, vl(w, -1));
vector <vl> suffc(h, vl(w, w));
//cout << prec[0] << " " << prec[1] << "\n";
ll c = 0;
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
if (v[i][j] == '#')
prec[i][j] = j;
else
c++;
if (j)
prec[i][j] = max(prec[i][j], prec[i][j - 1]);
//cout << j << " " << prec[j] << "\n";
}
for (ll j = w - 1; j >= 0; j--) {
if (v[i][j] == '#')
suffc[i][j] = j;
if (j + 1 < w)
suffc[i][j] = min(suffc[i][j], suffc[i][j + 1]);
}
}
//cout << prec[0] << " " << prec[1] << "f\n";
for (ll j = 0; j < w; j++) {
for (ll i = 0; i < h; i++) {
if (v[i][j] == '#')
prer[i][j] = i;
if (i)
prer[i][j] = max(prer[i][j], prer[i - 1][j]);
}
for (ll i = h - 1; i >= 0; i--) {
if (v[i][j] == '#')
suffr[i][j] = i;
if (i + 1 < h)
suffr[i][j] = min(suffr[i][j], suffr[i + 1][j]);
}
}
//cout << prec[0] << " " << prec[1] << "\n";
ll tot = power(2, c);
//cout << tot << "\n";
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
//cnt = 0;
if (v[i][j] == '#')
continue;
ll cnt = 0;
if (i)
cnt += i - 1 - prer[i - 1][j];
if (i + 1 < h)
cnt += suffr[i + 1][j] - (i + 1);
if (j)
cnt += j - 1 - prec[i][j - 1];
if (j + 1 < w)
cnt += suffc[i][j + 1] - (j + 1);
cnt++;
//cout << cnt << " " << i << " " << j << "\n";
ll no = tot - power(2, c - cnt);
no = (no + mod) % mod;
//cout << no << "\n";
ans = (ans + no) % mod;
}
}
cout << ans << "\n";
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
#define yes {puts("Yes");}
#define no {puts("No");}
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
while(c>='0'&&c<='9')a=a*10+c-48,c=getchar();
return a*b;
}
int v[31][31],h[31][31],n=30;
char p[1005];int cnt;
struct node{
int x,y;ll w;int ty;
};
bool operator<(node a,node b){return a.w>b.w;}
ll dis[31][31];
int vis[31][31];
priority_queue<node>q;
namespace test{
int v[31][31],h[31][31];
int clac(int sx,int sy,int ex,int ey,char *p,int ct){
int ans=0;
for(int i=1;i<=ct;i++){
if(p[i]=='U')ans+=v[sx-1][sy],sx--;
else if(p[i]=='D')ans+=v[sx][sy],sx++;
else if(p[i]=='L')ans+=h[sx][sy-1],sy--;
else if(p[i]=='R')ans+=h[sx][sy],sy++;
else exit(1);
if(sx>=30||sx<0||sy>=30||sy<0)exit(2);
}
return ans;
}
}
int main(){
/* freopen("0000.txt","r",stdin);
freopen("test.out","w",stdout);
for(int i=0;i<30;i++){
for(int j=0;j<29;j++){
cin>>test::h[i][j];
}
}
for(int i=0;i<29;i++){
for(int j=0;j<30;j++){
cin>>test::v[i][j];
}
}*/
for(int i=0;i<=30;i++){
for(int j=0;j<=30;j++){
v[i][j]=h[i][j]=4000;
}
}
for(int i=1;i<=1000;i++){
int sx,sy,ex,ey;
cin>>sx>>sy>>ex>>ey;
memset(dis,0x3f,sizeof dis);
memset(vis,0,sizeof vis);
dis[sx][sy]=0;
q.push(node{sx,sy,0,-1});
while(!q.empty()){
node t=q.top();q.pop();
if(vis[t.x][t.y])continue;
vis[t.x][t.y]=t.ty;
//if(t.x==ex&&t.y==ey)break;
int o=dis[t.x][t.y],x=t.x,y=t.y;
if(x+1<30&&dis[x+1][y]>o+h[x][y]){
dis[x+1][y]=o+h[x][y];
if(!vis[x+1][y])q.push(node{x+1,y,dis[x+1][y],2});//D
}
if(y+1<30&&dis[x][y+1]>o+v[x][y]){
dis[x][y+1]=o+v[x][y];
if(!vis[x][y+1])q.push(node{x,y+1,dis[x][y+1],3});//R
}
if(x-1>=0&&dis[x-1][y]>o+h[x-1][y]){
dis[x-1][y]=o+h[x-1][y];
if(!vis[x-1][y])q.push(node{x-1,y,dis[x-1][y],1});//U
}
if(y-1>=0&&dis[x][y-1]>o+v[x][y-1]){
dis[x][y-1]=o+v[x][y-1];
if(!vis[x][y-1])q.push(node{x,y-1,dis[x][y-1],4});//L
}
}
while(!q.empty())q.pop();
cnt=0;
for(int x=ex,y=ey;vis[x][y]!=-1&&vis[x][y];){
if(vis[x][y]==1)p[++cnt]='U',x++;
else if(vis[x][y]==2)p[++cnt]='D',x--;
else if(vis[x][y]==3)p[++cnt]='R',y--;
else if(vis[x][y]==4)p[++cnt]='L',y++;
}
reverse(p+1,p+1+cnt);
for(int i=1;i<=cnt;i++)cout<<p[i];
cout<<endl;
fflush(stdout);
/*for(int i=0;i<30;i++){
for(int j=0;j<30;j++){
cout<<dis[i][j]<<' ';
}
puts("");
}
for(int i=0;i<30;i++){
for(int j=0;j<30;j++){
cout<<h[i][j]<<' ';
}
puts("");
}for(int i=0;i<30;i++){
for(int j=0;j<30;j++){
cout<<v[i][j]<<' ';
}
puts("");
}*/
int b;
//int aa;double ee;cin>>aa>>ee;
//b=test::clac(sx,sy,ex,ey,p,cnt)*ee;
cin>>b;
int cg=(b-dis[ex][ey])/cnt;
for(int x=ex,y=ey;vis[x][y]!=-1&&vis[x][y];){
if(vis[x][y]==1)h[x][y]+=cg,x++;
else if(vis[x][y]==2)h[x-1][y]+=cg,x--;
else if(vis[x][y]==3)v[x][y-1]+=cg,y--;
else if(vis[x][y]==4)v[x][y]+=cg,y++;
}
}
return 0;
}
| #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define setprec cout << fixed << showpoint << setprecision(20);
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int power (int a, int b = mod - 2)
{
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
int n, tim = 0;
vi adj[N];
vpi query[N];
int cnt[N], siz[N], heavy[N], dep[N], euler[N], tin[N], tout[N], ans[N];
void dfs1 (int cur, int prev)
{
tin[cur] = ++tim;
euler[tim] = cur;
dep[cur] = dep[prev] + 1;
siz[cur] = 1;
pi mx = {0, 0};
for (int i: adj[cur])
if (i != prev)
{
dfs1(i, cur);
siz[cur] += siz[i];
mx = max(mx, {siz[i], i});
}
heavy[cur] = mx.se;
tout[cur] = tim;
}
void dfs (int cur, int prev, bool keep)
{
for (int i: adj[cur])
if (i != prev && i != heavy[cur])
dfs(i, cur, 0);
if (heavy[cur]) dfs(heavy[cur], cur, 1);
cnt[dep[cur]]++;
for (int i: adj[cur])
if (i != prev && i != heavy[cur])
FOR (j, tin[i], tout[i]) cnt[dep[euler[j]]]++;
for (pi i: query[cur]) ans[i.se] = cnt[i.fi + 1];
if (!keep)
{
FOR (i, dep[cur], n)
{
if (!cnt[i]) break;
cnt[i] = 0;
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
readarr(p, n - 1);
FOR (i, 2, n) adj[i].pb(p[i - 1]), adj[p[i - 1]].pb(i);
read(q);
FOR (i, 1, q)
{
readb(a, b);
query[a].pb({b, i});
}
dfs1(1, 0);
dfs(1, 0, 1);
FOR (i, 1, q) cout << ans[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,t,f[110][110],q[110];bool b[110];
struct BAG
{
int w,v;
}a[61];
bool cmp(BAG x,BAG y)
{
return x.v>y.v;
}
struct BOX
{
int num,pos;
}x[110];
bool cmp1(BOX x,BOX y)
{
return x.num<y.num;
}
int main()
{
scanf("%d %d %d",&n,&m,&t);
for(int i=1;i<=n;i++)
scanf("%d %d",&a[i].w,&a[i].v);
sort(a+1,a+n+1,cmp);
for(int i=1;i<=m;i++)
scanf("%d",&x[i].num),x[i].pos=i;
sort(x+1,x+m+1,cmp1);
while(t--)
{
memset(f,0,sizeof(f));
memset(b,0,sizeof(b));
int l,r,ans=0,cnt=0;
scanf("%d %d",&l,&r);
for(int i=1;i<=m;i++)
if(!(x[i].pos<=r&&x[i].pos>=l))
q[++cnt]=x[i].num;
sort(q+1,q+cnt+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=cnt;j++)
if(!b[j]&&a[i].w<=q[j])
{
b[j]=true,ans+=a[i].v;
break;
}
printf("%d\n",ans);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<int> w(n), v(n);
rep(i, n) cin >> w[i] >> v[i];
vector<int> x(m);
rep(i, m) cin >> x[i];
rep(qi, q) {
int l, r;
cin >> l >> r;
--l; --r;
vector<int> as;
rep(i, m) if (i < l || r < i) as.push_back(x[i]);
sort(as.begin(), as.end());
vector<bool> used(n);
int ans = 0;
for (int a : as) {
P best(-1, -1);
rep(i, n) {
if (used[i]) continue;
if (w[i] > a) continue;
best = max(best, P(v[i], i));
}
int i = best.second;
if (i == -1) continue;
used[i] = true;
ans += v[i];
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100][100];
constexpr int MOD = 998244353;
int fact(int n) {
int s = 1;
for (int i = 1; i <= n; i++) {
s = 1ll * s* i % MOD;
}
return s;
}
int solve(vector<pair<int, int>> a, int n) {
vector<vector<int>> ed(n + 1);
vector<int> used(n + 1);
for (auto e : a) {
ed[e.first].emplace_back(e.second);
ed[e.second].emplace_back(e.first);
}
int ans = 1;
for (int i = 1; i <= n; i++) {
if (used[i]) {
continue;
}
int sz = 0;
function<void(int)> dfs = [&](int v) {
sz++;
used[v] = 1;
for (auto to : ed[v]) {
if (used[to]) {
continue;
}
dfs(to);
}
};
dfs(i);
ans = 1ll * ans * fact(sz) % MOD;
}
return ans;
}
int go(bool tr) {
vector<pair<int, int>> ed;
if (tr) {
for (int x = 1; x <= n; x++) {
for (int y = x + 1; y <= n; y++) {
bool bad = false;
for (int i = 1; i <= n; i++) {
if (a[x][i] + a[y][i] > k) {
bad = true;
}
}
if (!bad) {
ed.emplace_back(x, y);
}
}
}
} else {
for (int x = 1; x <= n; x++) {
for (int y = x + 1; y <= n; y++) {
bool bad = false;
for (int i = 1; i <= n; i++) {
if (a[i][x] + a[i][y] > k) {
bad = true;
}
}
if (!bad) {
ed.emplace_back(x, y);
}
}
}
}
return solve(ed, n);
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
cout << 1ll *go(0) * go(1) % MOD << "\n";
return 0;
} | #include <cstdio>
#include <vector>
/*
A(x) = A(x^2) C(x^2)
*/
using u32 = unsigned int;
using u64 = unsigned long long;
template <u32 MOD>
struct Mint {
u32 n;
constexpr Mint(u32 n = 0): n(n) {}
constexpr Mint operator-() const { return Mint(n ? MOD - n: 0); }
constexpr Mint &operator+=(const Mint &rhs){ n += rhs.n; if(n >= MOD) n -= MOD; return *this; }
constexpr Mint &operator-=(const Mint &rhs){ if(rhs.n > n) n += MOD; n -= rhs.n; return *this; }
constexpr Mint &operator*=(const Mint &rhs){ n = (u64) n * rhs.n % MOD; return *this; }
friend constexpr Mint operator+(const Mint &lhs, const Mint &rhs){ return Mint(lhs) += rhs; }
friend constexpr Mint operator-(const Mint &lhs, const Mint &rhs){ return Mint(lhs) -= rhs; }
friend constexpr Mint operator*(const Mint &lhs, const Mint &rhs){ return Mint(lhs) *= rhs; }
friend constexpr bool operator==(const Mint &lhs, const Mint &rhs){ return lhs.n == rhs.n; }
friend constexpr bool operator!=(const Mint &lhs, const Mint &rhs){ return lhs.n != rhs.n; }
};
template <class T>
T modpow(T x, int n){
T r(1);
for(; n; n >>= 1){
if(n&1) r *= x;
x *= x;
}
return r;
}
template <u32 MOD>
Mint<MOD> inv(Mint<MOD> n){
return modpow(n, MOD-2);
}
constexpr u32 mod = 998244353;
using mint = Mint<mod>;
int main(){
int n, m;
scanf("%d%d", &n, &m);
std::vector<mint> C;
C.push_back(1);
for(int i = 1; i <= n/2; i++){
C.push_back(C.back() * mint(n+2-2*i) * mint(n+1-2*i) * inv(mint(2*i * (2*i-1))));
}
std::vector<mint> D(n+1);
D[0] = 1;
for(; m; m >>= 1){
std::vector<mint> E(n/2+1);
for(int i = m&1; i <= n; i+=2){
E[i/2] = D[i];
}
for(int i = 0; i <= n; i++) D[i] = 0;
for(int i = 0; i <= n/2; i++){
for(int j = 0; j <= n/2; j++){
D[i+j] += C[i] * E[j];
}
}
}
printf("%d\n", D[0].n);
return 0;
}
|
#include<bits/stdc++.h>
#define mz 1000000007
using namespace std;
int len;
long long dp[200005][20][20];
char s[200006];
long long ans=0;
bool life[20];
void go(int l,bool f,int k,int now)
{
int ff;
if(now>k)
return ;
if(f==1)
ff=s[len-l];
else
ff=15;
if(l==1)
{
int tt=0;
if(k==now)
{
for(int i=0;i<=ff;i++)
if(life[i])
tt++;
}
else if(now==k-1)
{
for(int i=(now==0);i<=ff;i++)
if(!life[i])
tt++;
}
ans=(ans+tt)%mz;
return ;
}
if(f==1)
{
for(int i=0;i<ff;i++)
{
if(life[i] || (i==0 && now==0))
go(l-1,0,k,now);
else
{
life[i]=1;
go(l-1,0,k,now+1);
life[i]=0;
}
}
if(life[ff]==0)
now++;
life[ff]=1;
go(l-1,1,k,now);
}
else
{
if(now==0)
{
go(l-1,0,k,0);
ans=(ans+15*dp[l-1][k][1])%mz;
}
else
{
ans=(ans+dp[l][k][now])%mz;
}
}
}
int main()
{
for(int i=1;i<=16;i++)
dp[0][i][i]=1;
for(int i=1;i<=200001;i++)
for(int j=1;j<=16;j++)
for(int k=1;k<=j;k++)
dp[i][j][k]=(dp[i-1][j][k]*j+dp[i-1][j-1][k]*(17-j))%mz;
scanf("%s",s);
int k;
scanf("%d",&k);
len=strlen(s);
for(int i=0;i<len;i++)
{
if(s[i]<='9' && s[i]>='0')
s[i]-='0';
else
s[i]-='A'-10;
}
go(len,1,k,0);
printf("%lld\n",ans);
return 0;
} | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
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
ll dp[18];
char S[200200];
int suuji(char c) {
if (c < 'A') return c - '0';
else return c - ('A' - 10);
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
fread(S, 1, 200200, stdin);
int K = 0;
int N = 200200 - 1;
while (S[N] != ' ') N--;
int tmp = N + 1;
while (S[tmp] >= '0') K = K * 10 + S[tmp++] - '0';
const int mod = 1e9 + 7;
int k = suuji(S[0]);
dp[1] = k - 1;
int kazu = 1 << 15 - k;
rep1(i, N - 1) {
if (!(i & 7)) for (int j = 2; j <= 16; j++) dp[j] %= mod;
for (int j = 16; j >= 1; j--) {
dp[j + 1] += (16 - j) * dp[j];
dp[j] = j * dp[j];
}
dp[1] += 15;
int k = suuji(S[i]);
int k1 = __builtin_popcount(kazu >> 16 - k);
int kazu0 = __builtin_popcount(kazu);
dp[kazu0] += k1;
dp[kazu0 + 1] += k - k1;
kazu |= 1 << 15 - k;
}
ll kotae = dp[K];
kotae += (__builtin_popcount(kazu) == K);
printf("%lld", kotae % mod);
Would you please return 0;
} |
// author :: enigma74
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vec(v) v.begin(),v.end()
#define MOD (1e9+7)
void FASTIO(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void solve_logic(){
ll n;
cin>>n;
ld arr[n],sum=0,ans=0;
for(ll i=0;i<n;i++){
cin>>arr[i];
sum+=arr[i];
}
ans+=sum;
sort(arr,arr+n);
ld x=0;
if(n%2!=0){
x=arr[((n+1)/2)-1]/2;
}else{
x=(arr[n/2-1]+arr[(n/2)])/4;
}
ans+=n*x;
ld temp=0;
for(ll i=0;i<n;i++){
temp+=min(arr[i],2*x);
}
ans-=temp;
ans/=n;
cout.precision(20);
cout<<fixed<<ans;
}
int main(){
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
FASTIO();
// ll T;
// cin>>T;
// while(T--){
// solve_logic();
// }
solve_logic();
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long int
#define umap unordered_map
#define mod 1000000007ll
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MN(a,b,c) min(a,min(b,c))
#define MX(a,b,c) max(a,max(b,c))
#define pr1 pair<ll,ll>
#define F first
#define S second
#define mP make_pair
#define f(i,n) for(ll i=0;i<n;i++)
#define f1(i,x,y) for(ll i=x;i<=y;i++)
#define f2(i,x,y) for(ll i=x;i>=y;i--)
#define yes cout<<"YES"<<"\n"
#define no cout<<"NO"<<"\n"
#define modsum(a,b) ((a%mod)+(b%mod))%mod
#define modpro(a,b) ((a%mod)*(b%mod))%mod
#define moddif(a,b) ((a%mod)-(b%mod)+mod)%mod
#define modsumt(a,b,c) modsum(a,modsum(b,c))
//__builtin_popcount(x)
//__builtin_parity(x) =(number of set bits)%2
//__builtin_clz(x) to count the number of leading zeroes
//__builtin_ctz(x) to count the number of trailing zeroes
//__gcd(a,b)
// Binary Search
// TO AVOID GETTING INFINITE LOOP
// mid = (l+r)/2 l=mid+1 r=mid
// mid = (l+r+1)/2 l=mid r=mid-1
using namespace std;
ll fac[200005];
/*void calc_pow2()
{
pow2[0]=1;
for(ll i=1;i<63;i++) pow2[i]=2*pow2[i-1];
}*/
ll modularExponentiation(ll x,ll n,ll M)
{
ll result=1;
while(n>0)
{
if(n % 2 ==1)
result=modpro(result,x);
x=modpro(x,x);
n=n/2;
}
return result;
}
ll binaryExponentiation(ll x,ll n)
{
ll result=1;
while(n>0)
{
if(n % 2 ==1)
result=result * x;
x=x*x;
n=n/2;
}
return result;
}
ll pow1(ll x,ll y)
{
ll z=1;
while(y--){z=z*x;}
return z;
}
/*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 (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}*/
// Returns n^(-1) mod p
ll modInverse(ll n, ll p)
{
return modularExponentiation(n, p - 2, p);
}
// Returns nCr % p using Fermat's little
// theorem.
unsigned long long nCrModPFermat(unsigned long long n,
ll r, ll p)
{
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;
}
ll check(ll x,ll y)
{
ll z=1;
ll ans=0;
while(z<x){ans++;z*=y;}
return ans;
}
ll countbits(ll n)
{
ll x=0;
while(n>0)
{
x++;
n=(n&(n-1));
}
return x;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;cin>>n;
vector <ll> a(n);
ll sum=0;
f(i,n) {cin>>a[i];sum+=a[i];}
sort(all(a));
double ans;
if(n%2)
{
double x = (a[n/2]*1.0)/2;
double s=0;
f(i,n) s+=min((double)a[i],2*x);
ans=sum+(n*x)-s;
}
else
{
double x1 = (a[n/2]*1.0)/2;
double x2= (a[(n+1)/2]*1.0)/2;
double s1=0,s2=0;
f(i,n) {s1+=min((double)a[i],2*x1);s2+=min((double)a[i],2*x2);}
ans=sum+min(n*x1-s1,n*x2-s2);
}
ans=ans/(1.0*n);
std::cout << std::fixed; std::cout << std::setprecision(10); std::cout << ans;
} |
//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
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;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
vi w(n);
cin >> w;
sort(all(w));
int mx = *max_element(all(w));
vp cond;
rep(_, m) {
int l, v;
cin >> l >> v;
if (v < mx) {
cout << -1 << endl;
return 0;
}
cond.eb(v, l);
}
sort(all(cond));
rep(i, m - 1) chmax(cond[i + 1].second, cond[i].second);
int ans = inf;
// 40320
do {
vi pos(n, 0);
rep2(i, 1, n) {
pos[i] = pos[i - 1];
int sum = w[i];
rrep(j, i) {
sum += w[j];
auto it = lower_bound(all(cond), make_pair(sum, 0));
if (it == cond.begin()) continue;
it--;
int nd = it->second;
chmax(pos[i], pos[j] + nd);
}
}
chmin(ans, pos[n - 1]);
} while (next_permutation(all(w)));
assert(ans != inf);
cout << ans << endl;
} | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip>
#include <stdio.h>
//end of libraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <int,int>
#define tpii pair <int, pii>
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
const int max_n = 900155;
using namespace std;
int n , m , k;
int dp[max_n][30];
int p[max_n] , siz[max_n] , f[max_n];
int table[30][30];
vector <int> c , vc[max_n];
int getp(int x) { return p[x] == x ? x : getp(p[x]); }
void mku(int x, int y) {
int A = getp(x) , B = getp(y);
if(A == B) return;
if(siz[A] > siz[B]) {
siz[A] += siz[B];
p[B] = A;
return;
}
siz[B] += siz[A];
p[A] = B;
}
int find(int x,int need){
queue <pii> q;
vector <int> usd;
usd.resize(max_n,0);
q.push({0,x});
while(sz(q)) {
pii point = q.front();
int value = point.fi , hm = point.se;
q.pop();
usd[hm] = 1;
for(auto &y : vc[hm]) {
if(y == need) {
return value + 1;
}
if(usd[y]==0) q.push({value + 1 , y});
}
}
}
int main(){
fcin;
rep(i,max_n-4) p[i]=i,siz[i]=1;
cin >> n >> m;
rep(i,m){
int u,v;
cin >> u >> v;
u--,v--;
mku(u,v);
vc[u].pb(v);
vc[v].pb(u);
}
cin >> k;
c.resize(k,0);
rep(i,k) {
cin >> c[i];
c[i]--;
}
rep(i,k) {
rep(j,k) {
if(getp(c[i])!=getp(c[j])) {
cout << "-1\n"; return 0;
}
}
}
rep(i,k) {
rep(j,k) {
if(i==j) continue;
table[i][j] = find(c[i],c[j]);
}
}
int mxmxmx = pow(2,k);
rep(msk,mxmxmx) {
rep(i,k) dp[msk][i] = inf;
}
rep(i,k) {
dp[(1<<i)][i] = 1;
}
rep(msk,mxmxmx) {
rep(i,k) {
if(msk&(1<<i)) continue;
rep(f,k) {
if(i==f or dp[msk][f] == inf) continue;
int nx = msk|(1<<i);
dp[nx][i] = min(dp[nx][i] ,
dp[msk][f] + table[i][f]
);
}
}
}
int ans = inf;
rep(i,k) {
ans = min(ans,dp[mxmxmx-1][i]);
}
cout << ans << '\n';
/*
*/
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
#define pragi(a,b) for(ll i = a;i<b;i++)
#define pragj(a,b) for(ll j = a;j<b;j++)
#define pragk(a,b) for(ll k = a;k>=b;k--)
#define all(v) (v.begin(),v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
#define KAKA ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef long double ld;
typedef pair<int, int> pii;
//typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef pair<ll, ll> pll;
int main()
{
KAKA
ll n;
cin>>n;
ld tax = (ld)(1.08) * n;
ll val = (ll)(tax);
if(val < 206)
{
cout<<"Yay!"<<"\n";
}
else if(val == 206)
{
cout<<"so-so"<<"\n";
}
else
{
cout<<":("<<"\n";
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i <=(int)(n); i++)
using namespace std;
int main() {
int N,e;
cin >> N;
e = N * 1.08;
if (e < 206) cout << "Yay!" << endl;
if (e > 206) cout << ":(" << endl;
if (e == 206) cout << "so-so" << endl;
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vi vector<int>
#define vl vector<long long>
#define vd vector<long double>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_lr(i, f, n) for (int i = f; i < (int)(n); i++)
#define sum(v) accumulate(v.begin(),v.end(),0)
#define sumll(v) accumulate(v.begin(),v.end(),0LL)
#define counte(v,arg) count(v.begin(),v.end(),arg)
#define maxe(v) *max_element(v.begin(),v.end())
#define mine(v) *min_element(v.begin(),v.end())
#define sorts(v) sort(v.begin(),v.end())
#define sortg(v) sort(v.begin(),v.end(),greater<int>)
using namespace std;
string replace_all(string &s, string from, string to) {
ll pos = s.find(from);
while(true){
pos = s.find(from, pos);
if(pos==-1) break;
s.replace(pos, from.length(), to);
pos += to.length();
}
return s;
}
int combination(int n, int r) {
if(r < n) return 0;
if(r*2 > n) r = n-r;
int nume = 1;
int deno = 1;
rep_lr(i, 1, r+1) {
nume *= (n-i+1);
deno *= i;
}
return nume / deno;
}
int ceil(int nume, int deno){
return (nume+deno-1)/deno;
}
template<typename T>
void vinp(int n, T v){
rep(i,n){
cin >> v.at(i);
}
}
template<typename T>
bool isParall(vector<T> v1, vector<T> v2){
return v1.at(0)*v2.at(1) - v1.at(1)*v2.at(0) == 0;
}
template<typename T>
bool isRightangle(vector<T> v1, vector<T> v2){
return v1.at(0)*v2.at(0) + v1.at(1)*v2.at(1) == 0;
}
void solve(){
int a, b, c, d;
cin>> a >> b;
cin>> c >> d;
cout << a*d - b*c << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
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;
// MACROS
#define int long long
#define pb push_back
#define MAX 1e17
#define MIN -1e17
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define eps 1e-9
#define set(x) memset(x, 0, sizeof(x))
#define clr(x) memset(x, -1, sizeof(x))
#define ff first
#define ss second
#define rep(i,a,b) for(int i=a;i<b;i++)
#define sz(x) x.size()
#define endl "\n"
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
#define lb(a,x) lower_bound(all(a),x)
#define ub(a,x) upper_bound(all(a),x)
typedef priority_queue<int> maxHeap;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
template<typename T, typename T1>T amax(T &a, T1 b) {if (b > a)a = b; return a;}
template<typename T, typename T1>T amin(T &a, T1 b) {if (b < a)a = b; return a;}
// typedef long int ld;
// typedef unsigned long int lu;
// typedef long long int ll;
// typedef unsigned long long int llu;
// cout << fixed << setprecision(9) <<
int mpow(int base, int exp);
const int T2 = 105; const int T3 = 1005; const int T4 = 10005; const int T5 = 100005;
const int N = 3e5 + 5;
int arr[N];
void solve() {
int n;
cin >> n;
rep(i, 0, n) cin >> arr[i];
pbds st;
int ans = 0;
for (int i = 0; i < n; i++) {
st.insert(arr[i]);
int tmp = st.order_of_key(arr[i]) + 1;
ans += st.size() - tmp;
}
cout << ans << endl;
for (int i = 0; i < n - 1; i++) {
ans -= arr[i] ;
ans += n - arr[i] - 1;
cout << ans << endl;
}
}
/* TIPS
1. for interactive prob remove fastio and endl
2. for vector pass as reference
3.
*/
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((int)result * base) % mod;
base = ((int)base * base) % mod;
exp >>= 1;
}
return result;
}
|
/**
* author: mahfuzz
* created: 14.01.2020
**/
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << #x << ':' << x << endl;
typedef long long ll;
int main(int argc, char* argv[]){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m, t;
cin >> n >> m >> t;
int x1 = 0, y1 = 0, flag = 0, init = n;
for(int i = 0; i < m; i++){
int x, y; cin >> x >> y;
n -= abs(y1 - x);
if(n <= 0)
flag = true;
n = min(init, n + (y - x));
x1 = x, y1 = y;
}
if(n - (t - y1) <= 0 || flag)
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N,S,D;
cin>>N>>S>>D;
for(int i=0;i<N;i++){
int X,Y;
cin>>X>>Y;
if(X<S&&Y>D){
puts("Yes");
return 0;
}
}
puts("No");
} |
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
long long left = 0, right = 2000000010;
while(right - left > 1){
long long mid = (left + right) / 2;
if(mid * (mid + 1) / 2 <= n + 1){
left = mid;
}else{
right = mid;
}
}
cout << n - left + 1 << endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
#define pii pair<int,int>
int spf[100002]; // smallest prime factor
int n=100001;
int num[100001];
void sieve(){ //埃氏篩法 預處理 O(nloglogn)
spf[1]=1;
for (int i=2;i<=n;i++ ) spf[i]=i;
for (int i=4; i<n; i+=2) spf[i] = 2;
for (int i=3;i*i<=n;i++){ // (i is prime) 只需要找到 小於等於 sqrt(n) 的質數
if (spf[i]==i) { // if i is prime
for (int j=i*i;j<=n;j+=i){ // j 可以從i^2 開始，因為 i*k (k<i) 都已經被mark過了
if(spf[j]==j) spf[j]=i;
}
}
}
}
vector<int> prfc(int x){
//set<pii> ans;
//vector<int> now;
vector<int> ans;
int y=x;
while(y!=1){
int pr=spf[y];
//auto it=find(now.begin(),now.end(),pr);
//if (if!=now.end()){
//}
ans.push_back(pr);
y/=pr;
}
return ans;
}
int main(){
int k;cin>>k;
sieve();
num[1]=1;
int maxn=0;
for (int i=2;i<=k;i++) if (spf[i]==i) num[i]=2;
for (int i=4;i<=k;i++){
num[i]=num[i/spf[i]]+1;
if (num[i]>maxn) maxn=num[i];
}
for (int i=1;i<=k;i++) cout<<num[i]<<" ";
//cout<<maxn<<endl;
} |
#include <algorithm>
// #include <atcoder/all>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
constexpr double PI = 3.141592653589793;
constexpr int INF = 1e9 + 10;
constexpr ll INFL = 1e18 + 10;
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;
}
template <typename T>
void dump(const std::vector<T> &ar) {
for (T e : ar) {
std::cout << e << "\n";
}
}
template <typename T>
void dump(const std::set<T> &s) {
for (T e : s) {
std::cout << e << " ";
}
std::cout << "\n";
}
using namespace std;
// using namespace atcoder;
// cout << setprecision(20) << ans << "\n";
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
cin >> n;
vector<int> x(n), y(n);
REP(i, n) { cin >> x[i] >> y[i]; }
REP(i, n) {
REP(j, n) {
if (i == j) {
continue;
}
REP(k, n) {
if (i == j || j == k || k == i) {
continue;
}
int dx1 = x[i] - x[j];
int dx2 = x[i] - x[k];
int dy1 = y[i] - y[j];
int dy2 = y[i] - y[k];
int dx3 = x[j] - x[k];
int dy3 = y[j] - y[k];
int dis1 = dx1 * dx1 + dy1 * dy1;
int dis2 = dx2 * dx2 + dy2 * dy2;
int dis3 = dx3 * dx3 + dy3 * dy3;
// if (dis1 + dis2 == dis3 || dis1 + dis3 == dis2 || dis2 + dis3 ==
// dis1) {
// if (dis1 != 0 && &dis2 != 0 && dis3 != 0) {
if (dx1 * dy2 == dx2 * dy1) {
cout << "Yes"
<< "\n";
return 0;
}
// }
// }
}
}
}
cout << "No"
<< "\n";
return 0;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
int a,b,suma = 0,sumb = 0;
string as,bs;
cin >> a >> b;
while(a != 0 && b != 0){
suma += a%10;
a /= 10;
sumb += b%10;
b /= 10;
}
if(suma == sumb){
cout << suma;
return 0;
}
suma > sumb ? cout << suma : cout << sumb;
return 0;
}
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
//#include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, y) \
distance(v.begin(), lower_bound(v.begin(), v.end(), y))
#define Upper_bound(v, y) \
distance(v.begin(), upper_bound(v.begin(), v.end(), y))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll y; // typedef long long ll;
mint(ll y = 0) : y((y % mod + mod) % mod) {}
mint operator-() const { return mint(-y); }
mint& operator+=(const mint a) {
if ((y += a.y) >= mod) y -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((y += mod - a.y) >= mod) y -= mod;
return *this;
}
mint& operator*=(const mint a) {
(y *= a.y) %= 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, mint& a) { return is >> a.y; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.y; }
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 200005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--) invfact[i - 1] = invfact[i] * i;
}
mint pow(mint y, ll n) { return y.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
ll x;
map<ll, ll> memo;
ll dp(ll y){
if(memo.count(y) != 0) return memo[y];
memo[y] = abs(y-x);
if(y % 2 == 0) chmin(memo[y], dp(y/2) + 1);
else {
chmin(memo[y], dp(y+1) + 1);
chmin(memo[y], dp(y-1) + 1);
}
return memo[y];
}
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll y;
cin >> x >> y;
ll ans = dp(y);
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
#define deb(x) cout << #x << " = "<< x << "\n";
int x, y;
map<int, int> ans;
int solve(int x, int y) {
if(x >= y) {
return x - y;
}
if(ans.count(y))
return ans[y];
if(y & 1) {
ans[y] = 2 + min(solve(x, (y - 1) / 2), solve(x, (y + 1) / 2));
} else {
ans[y] = 1 + solve(x, y / 2);
}
ans[y] = min(ans[y], y - x);
return ans[y];
}
void test_case() {
cin >> x >> y;
cout << solve(x, y);
}
signed main() {
//freopen("in.txt", "r",stdin);
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
//cin >> t;
while(t--) test_case();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
int MOD = 998244353;
inline int add(const int a, const int b, const int mod = MOD) { return (a + b >= mod) ? (a + b - mod) : (a + b); }
inline void _add(int &a, const int b, const int mod = MOD) { a = add(a, b, mod); }
inline int sub(const int a, const int b, const int mod = MOD) { return (a - b < 0) ? (a - b + mod) : (a - b); }
inline void _sub(int &a, const int b, const int mod = MOD) { a = sub(a, b, mod); }
inline int negate(const int a, const int mod = MOD) { return mod - a; }
inline int mul(const int a, const int b, const int mod = MOD) { return (a * 1ll * b) % mod; }
inline void _mul(int &a, const int b, const int mod = MOD) { a = mul(a, b, mod); }
int binPow(int b, lli p, const int mod = MOD) {
int r = 1;
while (p) {
if (p & 1) r = mul(r, b, mod);
b = mul(b, b, mod);
p >>= 1;
}
return r;
}
int gcdex(int a, int b, int &x, int &y) {
if (!b) return x = 1, y = 0, a;
int px, py, res = gcdex(b, a % b, px, py);
return x = py, y = px - a / b * py, res;
}
int inv(const int a, const int mod = MOD) { // a and mod must be coprime
int x, y;
int g = gcdex(a, mod, x, y);
assert(g == 1);
x = (x % mod + mod) % mod;
return x;
}
inline int dvd(const int a, const int b, const int mod = MOD) { // b and mod must be coprime
int rev = inv(b, mod);
return mul(a, inv(b, mod), mod);
} // b != 0
inline void _dvd(int &a, const int b, const int mod = MOD) { a = dvd(a, b, mod); } // b and mod must be coprime
inline int convert(int x, const int mod = MOD) {
int tx = x % mod + mod;
return tx >= mod ? tx - mod : tx;
};
int main () {
int n;
int i2 = inv(2);
while (scanf("%d", &n) == 1) {
vector<int> a(n);
for (auto &x : a) scanf("%d", &x);
sort(a.begin(), a.end());
int pol = 0;
for (int i = 0; i < n; i++) pol = add(mul(pol, 2), a[i]);
int res = 0;
for (int i = n - 1; i >= 0; i--) {
_sub(pol, a[i]);
_mul(pol, i2);
_add(res, mul(a[i], add(pol, a[i])));
}
printf("%d\n\n", res);
}
}
| #include<bits/stdc++.h>
using namespace std;
namespace IO
{
const int buf_size=1<<20;
char buf[buf_size],*S,*T;
inline char read_char()
{
if(S==T)
T=(S=buf)+fread(buf,1,buf_size,stdin);
return S!=T?*(S++):EOF;
}
bool flag_EOF;
inline int read_int()
{
char c=read_char();
bool neg=false;
while(c<'0'||c>'9')
{
if(c==EOF)
{
flag_EOF=true;
return 0;
}
neg=(c=='-');
c=read_char();
}
int x=0;
while(c>='0'&&c<='9')
{
x=x*10+(c^48);
c=read_char();
}
return neg?-x:x;
}
inline void read_string(char *s)
{
char c=read_char();
while(c<'a'||c>'z')
{
if(c==EOF)
{
flag_EOF=true;
return;
}
c=read_char();
}
while(c>='a'&&c<='z')
{
*(s++)=c;
c=read_char();
}
*s='\0';
}
inline double read_double()
{
char c=read_char();
bool neg=false;
while(c<'0'||c>'9')
{
if(c==EOF)
{
flag_EOF=true;
return 0;
}
neg=(c=='-');
c=read_char();
}
double x=0;
while(c>='0'&&c<='9')
{
x=x*10+(c^48);
c=read_char();
}
if(c=='.')
{
c=read_char();
double eps=1;
while(c>='0'&&c<='9')
{
eps*=0.1;
x+=eps*(c^48);
c=read_char();
}
}
return neg?-x:x;
}
char fw[buf_size];
int pw;
inline void flush()
{
fwrite(fw,1,pw,stdout);
pw=0;
}
inline void write_char(char x)
{
if(pw==buf_size)
flush();
fw[pw++]=x;
}
char st[26];
int top;
inline void write_int(int x)
{
if(!x)
{
write_char('0');
return;
}
if(x<0)
{
write_char('-');
x=-x;
}
while(x)
{
st[++top]=x%10^48;
x/=10;
}
while(top>0)
write_char(st[top--]);
}
inline void write_string(const char *s)
{
for(int i=0;s[i];++i)
write_char(s[i]);
}
inline void write_double(double x,int cnt_digits,bool mark=true)
{
if(x<0)
{
write_char('-');
x=-x;
}
if(mark)
x+=5*pow(0.1,cnt_digits+1);
write_int(int(x));
if(cnt_digits>0)
{
write_char('.');
for(int i=1;i<=cnt_digits;++i)
{
x-=int(x),x*=10;
write_char(int(x)^48);
}
}
}
}
const int max_N=2e5+5;
int A[max_N];
const int mod=998244353;
const int inv2=(mod+1)>>1;
int pow2[max_N],pow_inv2[max_N];
int main()
{
int N;
scanf("%d",&N);
for(int i=1;i<=N;++i)
scanf("%d",A+i);
sort(A+1,A+N+1);
pow2[0]=pow_inv2[0]=1;
for(int i=1;i<=N;++i)
{
pow2[i]=2ll*pow2[i-1]%mod;
pow_inv2[i]=1ll*inv2*pow_inv2[i-1]%mod;
}
int ans=0,sum=0;
for(int i=1;i<=N;++i)
{
ans=(ans+1ll*sum*A[i]%mod*pow2[i-1])%mod;
ans=(ans+1ll*A[i]*A[i])%mod;
sum=(sum+1ll*A[i]*pow_inv2[i])%mod;
}
printf("%d\n",ans);
IO::flush();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
ll dmod(ll x){
return ((x+mod)%mod);
}
ll modular_power(ll x,ll y){
ll ans=1;
while(y){
if(y&1)ans=dmod(ans*x);
y/=2;
x=dmod(x*x);
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
int P[n+1];
for(int i=1;i<=n;i++)cin>>P[i];
set <int> st;
for(int i=1;i<n;i++)st.insert(i);
set <int> q;
for(int i=1;i<n;i++)if(P[i]>i && P[i+1]<i+1)q.insert(i);
vector <int> ans;
while(!q.empty()){
int x=*(q.begin());
st.erase(x);
swap(P[x],P[x+1]);
q.erase(x);
ans.push_back(x);
if(x-1>0 && P[x-1]>x-1 && P[x]<x && st.count(x-1))q.insert(x-1);
else if(q.count(x-1))q.erase(x-1);
if(x+1<n && P[x+1]>x+1 && P[x+2]<x+2 && st.count(x+1))q.insert(x+1);
else if(q.count(x+1))q.erase(x+1);
}
bool flag=true;
for(int i=1;i<=n;i++)if(P[i]!=i)flag=false;
if(flag && st.size()==0)for(auto it:ans)cout<<it<<endl;
else cout<<-1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
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; }
const ll mod = 1e9 + 7;
const ll inf = 1e18;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n;
cin >> n;
vll p(n), a(n);
REP(i, n) {
cin >> p[i];
p[i]--;
a[i] = i - p[i];
}
vector<P> pos;
ll sum = 0;
REP(i, n) {
if (a[i] > 0) {
pos.push_back(P{i, a[i]});
sum += a[i];
}
}
if (sum != n - 1) {
cout << -1 << endl;
return 0;
}
vll res;
vll used(n);
for (auto x : pos) {
ll tmp = x.first - 1;
REP(i, x.second) {
if (tmp == -1) {
cout << -1 << endl;
return 0;
}
if (used[tmp]) {
cout << -1 << endl;
return 0;
}
used[tmp] = 1;
res.push_back(tmp);
tmp--;
}
}
vll ideal(n);
iota(ALL(ideal), 0);
REP(i, n - 1) {
swap(p[res[i]], p[res[i] + 1]);
}
if (p == ideal) {
REP(i, n - 1) cout << res[i] + 1 << endl;
}
else {
cout << -1 << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
int main(){
int a,b,c;cin>>a>>b>>c;
if(a!=b){
puts(a>b?"Takahashi":"Aoki");
}
else {
puts(c==0?"Aoki":"Takahashi");
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <complex>
#include <vector>
#include <limits>
#include <iomanip>
#include <cassert>
#include <numeric>
#include <chrono>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << #x << " = " << (x) << endl;
#define debug_pii(x) cerr << "(" << x.first << "," << x.second << ")";
#define rep(i, n) for(int i = 0;i < n;i++)
#define pb push_back
#define F first
#define S second
// template<typename _Ty1, typename _Ty2>
// ostream& operator<<(ostream& _os, const pair<_Ty1, _Ty2>& _p) {
// _os << '(' <<_p.first << ',' << _p.second << ')';
// return _os;
// }
//
// template<typename _Ty1, typename _Ty2>
// istream& operator>>(istream& _is, pair<_Ty1, _Ty2>& _p) {
// _is >> _p.first >> _p.second;
// return _is;
// }
ll pwr(ll b, ll c, ll mod) {
if(c == 0) return 1;
ll x = pwr(b,c/2,mod);
if(c%2==0) return x*x%mod;
return x*x%mod*b%mod;
}
void solve() {
vector<vector<int>> d(10);
d[0] = vector<int>{0};
d[1] = vector<int>{1};
d[2] = vector<int>{2,4,8,6};
d[3] = vector<int>{3,9,7,1};
// 1 2 3 0
d[4] = vector<int>{4,6};
d[5] = vector<int>{5};
d[6] = vector<int>{6};
d[7] = vector<int>{7,9,3,1};
d[8] = vector<int>{8,4,2,6};
d[9] = vector<int>{9,1};
ll a,b,c;
cin>>a>>b>>c;
a = a % 10;
ll x = pwr(b%d[a].size(),c,d[a].size());
cout<<d[a][(d[a].size()-1+x)%d[a].size()]<<endl;
}
// d+1, d+2, d+3, ..., d' ,... , M
// 0 [1]
// 1 [1]
// 2 [2,4,8,6,2]
// 3 [3,9,7,1,3]
// 4 [4,6,4]
// 5 [1]
// 6 [1]
// 7 [7,9,3,1,7]
// 8 [8,4,2,6,8]
// 9 [9,1,9]
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
// cout << fixed << setprecision(15);2000000000
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// prime_factors();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(pow(2,N));
for (int i = 0; i < pow(2,N); i++) {
cin >> A.at(i);
}
vector<int> B(pow(2,N)); //勝ち残った選手のベクトル
for (int i = 0; i < pow(2,N); i++){
B.at(i) = i;
} // 初期値はすべての選手
for (int i = 0; i < N-1; i++){ // 決勝手前まで
for (int j = 0; j < pow(2 , (N-i-1)); j++)
if (A.at(B.at(2*j)) > A.at(B.at(2*j+1))){
B.at(j) = B.at(2*j);
}
else {
B.at(j) = B.at(2*j+1);
}
}
// 決勝で負ける方を出力 ただし1ずらす
if (A.at(B.at(0)) > A.at(B.at(1))){
cout << B.at(1) + 1 << endl;
}
else {
cout << B.at(0) + 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define p push
#define pp pop
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define maxe *max_element
#define mine *min_element
#define B begin()
#define E end()
#define rB rbegin()
#define rE rend()
#define L size()
#define C count()
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
typedef long long int ll;
#define V(type) vector<type>
#define PQ(type) priority_queue<type>
#define pll pair<ll, ll>
#define F first
#define S second
#define repl(i, a, b) for(ll i=a;i<b;i++)
#define forrl(i, n) for(ll i=0;i<n;i++)
#define coll(v, n) for(int i = 0; i < n;i++){cin>>v[i];}
#define INF 9223372036854775807
const double delta = 0.0000000001;
const double pi = 3.1415926535;
void FAST() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ll powM(ll x, ll y, ll m) { //returns (a^b)%m ( ^ is exponent )
ll ans = 1, r = 1;
x %= m;
while (r > 0 && r <= y)
{
if (r & y)
{
ans *= x;
ans %= m;
}
r <<= 1;
x *= x;
x %= m;
}
return ans;
}
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b)
{
ll x = gcd(a, b);
ll ans = (a*b)/x;
return ans;
}
bool IsPrime(long long int n){ // Returns if the passed number is prime or not.
if (n <= 1) return false;
if (n <= 3) return true;
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;
}
pair<ll,ll> intersection(pair<ll,ll>x, pair<ll,ll>y)
{
pair<ll,ll> ans;
if(x.first<=y.first)
{
if(x.second<y.first){
ans=make_pair(-1,-1);//case of no intesection
return ans;
}
else{
ans.first=max(x.first,y.first);
ans.second=min(x.second,y.second);
return ans;
}
}
else{
if(y.second<x.first){
ans=make_pair(-1,-1);//case of no intersection
return ans;
}
else{
ans.first=max(x.first,y.first);
ans.second=min(x.second,y.second);
return ans;
}
}
}
ll pal(string str)
{
string temp = str;
reverse(temp.begin(), temp.end());
if(temp == str)
return 1;
return 0;
}
int main(){
ll n;cin>>n;
ll num = powM(2,n,LLONG_MAX);
ll arr[num];
ll max =-1;
pair<ll,ll> m1,m2;
for(ll i=0;i<num;i++)cin>>arr[i];
for(ll i=0;i<num/2;i++){
if(arr[i]>max){
max=arr[i];
m1.first=max;
m1.second=i+1;
}
}
max=-1;
for(ll i=num/2;i<num;i++){
if(arr[i]>max){
max=arr[i];
m2.first=max;
m2.second=i+1;
}
}
if(m1.first<m2.first)
cout<<m1.second;
else
cout<<m2.second;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
inline int popcount(unsigned int x){
x-=(x>>1)&0x55555555;
x=(x&0x33333333)+((x>>2)&0x33333333);
return ((x+(x>>4)&0x0f0f0f0f)*0x01010101)>>24;
}
int main(){
int n; scanf("%d",&n);
printf("%d\n",(1<<n)-1);
for(int i=1;i<(1<<n);i++){
rep(j,1<<n) putchar(popcount(i&j)%2==0?'A':'B');
puts("");
}
return 0;
}
| #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <numeric>
#include <deque>
#include <cstring>
#include <iterator>
#include <map>
#include <cstdlib>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <complex>
#include <bitset>
#include <chrono>
#include <random>
#include <assert.h>
#include <array>
using namespace std;
template<typename M, typename N>
istream& operator>>(istream&is, pair<M,N> & p){is >> p.first >> p.second; return is;}
template<typename M>
istream& operator>>(istream&is, vector<M> & v){for(auto &it:v) is >> it; return is; }
template<typename M>
istream& operator>>(istream&is, vector<vector<M>> & v){for(auto &it:v) is >> it; return is; }
template<typename M, typename N>
ostream& operator<<(ostream&os, const pair<M,N> &p){os << p.first << ' ' << p.second << '\n';return os;}
template<typename M>
ostream& operator<<(ostream&os, const vector<M> &v){for(auto it: v)os << it << ' ';cout << '\n';return os;}
template<typename M>
ostream& operator<<(ostream&os, const vector<vector<M>> &v){for(auto it: v)os << it;return os;}
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mn(x) *min_element((x).begin(),(x).end())
#define mx(x) *max_element((x).begin(),(x).end())
#define acc(x) accumulate((x).begin(),(x).end(),0ll)
#define unique(x) sort(all(x)); x.erase(unique(all(x)),x.end());
#define eb emplace_back
#define el '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef complex<long double> cd;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<string> vs;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ld eps=1e-7;
const ld pi=acos(-1);
const ll inf=(ll)1e9+10;
//const int mod=1000000007;
const int mod=998244353;
int n, m, k;
const int N=5e3+10;
vector<string> solve(int k){
if(k==1){
return {"AB"};
}
auto v =solve(k-1);
string s;
for(int i=0; i<1<<(k-1); i++){
s+='A';
}
for(int i=0; i<1<<(k-1); i++){
s+='B';
}
int sz=(int)v.size();
for(int i=0, n=(1<<(k-1)); i<sz; i++){
string t=v[i];
v[i]+=v[i];
for(int j=0; j<n; j++){
t+=v[i][j]=='A'?'B':'A';
}
v.pb(t);
}
v.pb(s);
return v;
}
int main()
{ ios_base::sync_with_stdio(false);cin.tie(NULL);
int k;
cin >> k;
auto v = solve(k);
cout << v.size() << el;
for(auto s: v){
cout << s << el;
}
return 0;
}
|
#include <iostream>
#include<math.h>
#include<vector>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main() {
int a = 0, b = 0, c = 0;
cin >> a;
cin >> b;
cin >> c;
int numa = 7 - a;
int numb = 7 - b;
int numc = 7 - c;
int y = 0;
y = numa + numb + numc;
cout << y;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define rfor(i, b, a) for(ll i = b; i >= a; i--)
#define X first
#define Y second
#define pb push_back
#define play {ios_base::sync_with_stdio(false);}
#define tennis {cin.tie(NULL); cout.tie(NULL);}
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define vsz(x) ((long long) x.size())
#define arrout(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define arrin(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define debug(x) cout << '>' << #x << ':' << x << endl;
//const ll mod = 1e9 + 7;
//dont stop trying :)
template <typename T1, typename T2>
inline std::ostream& operator << (std::ostream& os, const std::pair<T1, T2>& p)
{
return os << "(" << p.first << ", " << p.second << ")";
}
template<typename T>
inline std::ostream &operator << (std::ostream & os,const std::vector<T>& v)
{
bool first = true;
os << "[";
for(unsigned int i = 0; i < v.size(); i++)
{
if(!first)
os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
ll n, m, k;
const ll template_size_array = 1e6 + 1393;
ll a[template_size_array];
ll b[template_size_array];
ll c[template_size_array];
string s, t;
void solve(int tc = 0) {
int a, b, c;
cin >> a >> b >> c;
cout << 21 - (a + b + c);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
play tennis;
cout << setprecision(12) << fixed;
int tc = 1;
// cin >> tc;
for (int tt = 0; tt < tc; tt++) solve(tt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef map<ll, ll> ml;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {return (a % b + b) % b;}
ll quo(ll a, ll b) {return (a - mod(a, b)) / b;}
template <typename T, typename U> bool chmin(T &a, const U b) {if(a > b) {a = b; return 1;} return 0;}
template <typename T, typename U> bool chmax(T &a, const U b) {if(a < b) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 3;
//const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
struct mint{
ll val;
mint() {}
mint(ll x) {val = mod(x, MOD);}
mint operator-() {return mint(-this->val);}
bool operator==(mint a) {return this->val == a.val;}
bool operator<(mint a) {return this->val < a.val;}
bool operator!=(mint a) {return this->val != a.val;}
mint operator+(mint a) {return mint(this->val + a.val);}
mint operator-(mint a) {return mint(this->val - a.val);}
mint operator*(mint a) {return mint(this->val * a.val);}
mint operator/(mint a) {return mint(this->val * a.inv().val);}
mint &operator+=(mint a) {return *this = *this + a;}
mint &operator-=(mint a) {return *this = *this - a;}
mint &operator*=(mint a) {return *this = *this * a;}
mint &operator/=(mint a) {return *this = *this / a;}
friend istream &operator>>(istream &is, mint &m) {
is >> m.val;
return is;
}
friend ostream &operator<<(ostream &os, mint &m) {
os << m.val;
return os;
}
mint pow(ll n) {
if(n == 0) return 1;
if(n & 1) return pow(n-1) * *this;
mint ret = pow(n/2);
return ret * ret;
}
vector<mint> powv(ll n) {
vector<mint> vec(n+1, 1);
rep2(i, 1, n) vec[i] = vec[i-1] * *this;
return vec;
}
mint inv() {return pow(MOD-2);}
vector<mint> invv(ll n) {
vector<mint> vec(n+1, 1);
rep2(i, 2, n) vec[i] = -vec[MOD%i] * (MOD/i);
return vec;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m, ans = 1;
cin >> n >> m;
vl a(m), b(m);
vb used(n, 0);
vvl G(n);
rep(i, m) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
vl parent(n, -1), root(n, -1);
rep(i, n) {
if(used[i]) continue;
used[i] = 1;
ql q;
q.push(i);
vl vec;
while(!q.empty()) {
ll v = q.front();
q.pop();
root[v] = i;
for(ll u: G[v]) {
if(used[u]) continue;
used[u] = 1;
q.push(u);
vec.push_back(u);
parent[u] = v;
}
}
ll vs = vec.size(), tmp = 0;
if(vs == 0) {ans *= 3; continue;}
rep(bit, 1 << vs) {
vector<mint> c(n, 0);
c[vec[0]] = (bit & 1) + 1;
rep2(j, 1, vs-1) c[vec[j]] = c[parent[vec[j]]] + ((bit >> j) & 1) + 1;
bool ok = 1;
rep(j, m) if(root[a[j]] == i && c[a[j]] == c[b[j]]) ok = 0;
if(ok) tmp++;
}
ans *= tmp*3;
}
cout << ans << newl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt1, cnt2, m;
cin >> n >> m;
cnt1 = cnt2 = 0;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int cnt = 0;
for (auto p : s) p == '1' ? cnt++ : 0;
cnt & 1 ? cnt1++ : cnt2++;
}
cout << 1ll * cnt1 * cnt2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, w;
cin >> n >> w;
int ans = 0;
int a = n;
while (a >= w) {
a -= w;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define bits(x) __builtin_popcountll(x)
#define ld long double
#define test() ll test; cin>>test; while(test--)
#define fi first
#define se second
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(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
inline ll GCD(ll x, ll y) {
if(x<y) swap(x,y);
if(x==0) return y;
if(y==0) return x;
return GCD(x%y,y);
}
ll phi(ll n) {
ll result = n;
for (ll i = 2; i * i <= n; i++) {
if(n % i == 0) {
while(n % i == 0)
n /= i;
result -= result / i;
}
}
if(n > 1)
result -= result / n;
return result;
}
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while(n) {
if(n&1) {
res = ((res*x)%mod+mod)%mod;
}
x = ((x*x)%mod+mod)%mod;
n>>=1;
}
return res;
}
const int MOD = 1e9+7;
inline ll add(ll x, ll y) {
x %= MOD;
y %= MOD;
ll ans = (x+y)%MOD;
return ans;
}
inline ll mul(ll x,ll y) {
x %= MOD;
y %= MOD;
ll ans = ((x*y)%MOD+MOD)%MOD;
return ans;
}
int main() {
fastio;
ll N,W;
cin>>N>>W;
ll ans = N/W;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(x) x.begin() , x.end()
#define ld long double
const long long inf = 1e18 + 1LL;
const int mod = 1e9 + 7LL;
void solve();
void ITO();
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ITO();
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}
const int N = (1e6 + 5);
void solve()
{
int n; cin >> n;
int arr[n]; for (auto &x : arr) cin >> x;
ll res = 0;
stack<int>s;
int ind[n]; ind[0] = 0 ; s.push(0);
for (int i = 1; i < n ; ++i)
{
while (!s.empty() and arr[s.top()] >= arr[i]) s.pop();
ind[i] = (s.empty() ? 0 : s.top() + 1);
s.push(i);
}
while (!s.empty()) s.pop();
for (int i = n - 1 ; i >= 0 ; --i)
{
while (!s.empty() and arr[s.top()] >= arr[i]) s.pop();
int j = (s.empty() ? n - 1 : s.top() - 1);
s.push(i);
res = max(res , (j - ind[i] + 1) * arr[i]);
}
cout << res;
cout << "\n";
return ;
}
void ITO()
{
#ifndef ONLINE_JUDGE
freopen("inputf.in", "r", stdin);
freopen("outputf1.in", "w", stdout);
#endif
}
// 🙃 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007 // 998244353
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
__attribute__((constructor))
void init(){ std::ios::sync_with_stdio(0); std::cin.tie(0); std::cout<<std::fixed<<std::setprecision(15); }
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 namespace std;
int main(){
ll n, m;
cin >> n >> m;
vi h(n), w(m);
rep(i, n) cin >> h[i];
rep(i, m) cin >> w[i];
sort(all(h));
sort(all(w));
// 先頭を含むもの、末尾を含むものの2ペア
vi sum_s, sum_e;
rep(i, (n-1)/2){
sum_s.emplace_back(abs(h[2*i]-h[2*i+1]));
sum_e.emplace_back(abs(h[2*i+1]-h[2*i+2]));
}
// 累積和
vi imos_s((n-1)/2+1), imos_e((n-1)/2+1);
imos_s[0] = 0, imos_e[0] = 0;
rep(i, (n-1)/2){
imos_s[i+1] = imos_s[i] + sum_s[i];
imos_e[i+1] = imos_e[i] + sum_e[i];
}
imos_s.emplace_back(0);
imos_e.emplace_back(0);
// 取り除く対象（i番目）をを全探索
ll ans = INFLL;
rep(i, n){
ll total = 0;
if(i%2 == 0){
total = imos_s[(i/2)] + imos_e[(n-1)/2] - imos_e[(i/2)];
auto it = lower_bound(all(w), h[i]);
ll num = abs(h[i]-(*it));
if(it != w.begin()){
it--;
chmin(num, abs(h[i]-(*it)));
}
chmin(ans, total+num);
}
else{
total += imos_s[(i/2)] + + imos_e[(n-1)/2] - imos_e[(ll)(ceil(i/2.0))] + abs(h[i-1] - h[i+1]);
auto it = lower_bound(all(w), h[i]);
ll num = abs(h[i]-(*it));
if(it != w.begin()){
it--;
chmin(num, abs(h[i]-(*it)));
}
chmin(ans, total+num);
}
}
cout << ans << endl;
} |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
class BManyOranges {
public:
void solve(std::istream& cin, std::ostream& cout) {
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int num = 1;
int mina = INF;
int maxa = -INF;
while (num * A <= W) {
if (W <= num * B) {
mina = min(num, mina);
maxa = max(num, maxa);
}
num++;
}
if (mina == INF) {
cout << "UNSATISFIABLE" << endl;
return;
}
cout << mina << " " << maxa << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream& in(std::cin);
std::ostream& out(std::cout);
BManyOranges solver;
solver.solve(in, out);
return 0;
}
| #pragma GCC optimize("Ofast")
//#ifndef ONLINE_JUDGE
//#define _GLIBCXX_DEBUG
//#endif
#ifdef ONLINE_JUDGE
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <math.h>
#include <complex>
using namespace std;
#ifdef ONLINE_JUDGE
using namespace atcoder;
#endif
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
#ifdef ONLINE_JUDGE
//using mint = modint998244353;
//using mint = modint;
using mint = modint1000000007;
#endif
const ll MOD=1000000007;
//const ll MOD=998244353;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
int dx[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
int dy[9] = {0, 1, 0, -1, 1, -1, -1, 1, 0};
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()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(15);
ll N; cin>>N;
vector<ll> A(N),B(N);
rep(i,N) cin>>A[i]>>B[i];
ll ans=INF;
rep(i,N) rep(j,N) {
if(i==j) chmin(ans,A[i]+B[j]);
else chmin(ans,max(A[i],B[j]));
}
cout<<ans<<'\n';
return 0;
} |
#include <bits/stdc++.h>
#define MN 1001000
using namespace std;
typedef long long ll;
#define MOD 998244353
ll n, w[110], dp[102][10010][102], fat[110], sum;
ll solve(int i, int sum, int rem) {
if(rem < 0 || sum < 0) return 0;
if(i == n) return (sum == 0 && rem == 0);
ll &x = dp[i][sum][rem];
if(x != -1) return x;
x = solve(i + 1, sum - w[i], rem - 1) + solve(i + 1, sum, rem);
if(x >= MOD) x -= MOD;
return x;
}
int main() {
fat[0] = 1;
for(ll i = 1; i <= 101; i++)
fat[i] = fat[i-1] * i % MOD;
scanf("%lld", &n);
for(int i = 0; i < n; i++) {
scanf("%lld", &w[i]);
sum += w[i];
}
if(sum % 2) puts("0");
else {
ll ans = 0;
memset(dp, -1, sizeof dp);
for(int i = 1; i < n; i++) {
ans += solve(0, sum / 2, i) * fat[i] % MOD * fat[n-i] % MOD;
if(ans >= MOD) ans -= MOD;
}
printf("%lld\n", ans);
}
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
void test(){
ll n;
cin>>n;
ll c[n][n];
f(i,n)f(j,n)cin>>c[i][j];
if(n==1){
cout<<"Yes\n";
cout<<c[0][0]<<"\n";
cout<<"0\n";
return ;
}
ll p[n][n-1];
f(i,n){
for(int j=1;j<n;j++){
p[i][j-1] = c[i][j] - c[i][j-1];
}
}
ll q[n-1][n];
f(i,n){
for(int j=1;j<n;j++){
q[j-1][i] = c[j][i] - c[j-1][i];
}
}
f(col,n-1){
for(int row=1;row<n;row++){
if(p[row][col]!=p[row-1][col]){
cout<<"No\n";
return ;
}
}
}
f(row,n-1){
for(int col=1;col<n;col++){
if(q[row][col]!=q[row][col-1]){
cout<<"No\n";
return ;
}
}
}
ll a[n], b[n];
// a[0] = 0, b[0] = c[0][0];
ll n1 = 0, n2 = 0;
ll m1 = 0, m2 = 0;
for(int i=1;i<n;i++){
n1 = n1 + p[0][i-1];
m1 = min(m1,n1);
n2 = n2 + q[i-1][0];
m2 = min(m2,n2);
}
ll val1 = max(0LL,-1LL*m1) + max(0LL,-1LL*m2);
if(c[0][0]<(val1)){
cout<<"No\n";
return ;
}
cout<<"Yes\n";
a[0] = max(0LL,-1LL*m1);
b[0] = c[0][0] - a[0];
for(int i=1;i<n;i++){
a[i] = a[i-1] + p[0][i-1];
b[i] = b[i-1] + q[i-1][0];
}
f(i,n)cout<<b[i]<<" ";cout<<"\n";
f(i,n)cout<<a[i]<<" ";cout<<"\n";
}
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tests=1;
// cin>>tests;
while(tests--){
test();
}
}
|
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
x = 0;
string s;
is >> s;
int n = int(s.size()), it = 0;
if (s[0] == '-') it++;
for (; it < n; it++) x = (x * 10 + s[it] - '0');
if (s[0] == '-') x = -x;
return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
deque<int> deq;
while (x) deq.emplace_front(x % 10), x /= 10;
for (int e : deq) os << e;
return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (int i = 0; i < int(v.size()); i++) {
if (i) os << ", ";
os << v[i];
}
return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
for (int i = 0; i < int(v.size()); i++) {
if (i) cout << " ";
cout << v[i];
}
print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
cout << x << " ";
print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
cerr << " " << x;
debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
void No() {
cout << "No" << ln;
exit(0);
}
int main() {
ll N,M,T; cin >> N >> M >> T;
ll A = N;
ll cur = 0;
rep(i,M) {
ll a,b; cin >> a >> b;
A -= (a-cur);
if (A <= 0) No();
A += (b-a);
chmin(A,N);
cur = b;
}
A -= (T-cur);
if (A <= 0) No();
cout << "Yes" << ln;
} | #define TO_BE_SUBMITTED
#include <bits/stdc++.h>
// #include <atcoder/fenwicktree>
// #include <atcoder/segtree>
// #include <atcoder/lazysegtree>
// #include <atcoder/string>
// #include <atcoder/math>
// #include <atcoder/convolution>
// #include <atcoder/modint>
// #include <atcoder/dsu>
// #include <atcoder/maxflow>
// #include <atcoder/mincostflow>
// #include <atcoder/scc>
// #include <atcoder/twosat>
namespace atcoder{};
using namespace atcoder;
using namespace std;
#define fr first
#define sc second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (n); i >= 1; --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 uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vlp = vector<LP>;
inline int getInt()
{
int x;
scanf("%d", &x);
return x;
}
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
const ll INF = INT64_MAX;
ll N, M;
struct E{
ll to;
ll cost;
ll rash;
};
vector<vector<E>> edges;
vector<ll> dp;
void input(){
cin >> N >> M;
edges = vector<vector<E>>(N);
rep(i, M){
ll a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
edges[a].pb(E{b, c, d});
edges[b].pb(E{a, c, d});
}
}
ll calcRash(ll d, ll t){
return d / (t + 1LL);
}
ll calcBestTime(ll now, ll d){
if(now >= d){
return now;
}
ll sqrtD = floor(sqrt(d));
ll t1 = max(sqrtD - 1, now);
ll t2 = max(sqrtD, now);
if(now + calcRash(d, now) > t1 + calcRash(d, t1)){
now = t1;
}
if(now + calcRash(d, now) > t2 + calcRash(d, t2)){
now = t2;
}
return now;
}
void solve()
{
input();
dp = vl(N, INF);
PQ(LP) pq;
dp[0] = 0;
pq.push(LP(0, 0));
while(!pq.empty()){
LP lp = pq.top();
pq.pop();
ll dist = lp.fr;
ll from = lp.sc;
if(dp[from] < dist){
continue;
}
for(auto edge : edges[from]){
ll to = edge.to;
ll cost = edge.cost;
ll rash = edge.rash;
ll departureTime = calcBestTime(dist, rash);
if(chmin(dp[to], departureTime + cost + calcRash(rash, departureTime))){
pq.push(LP(dp[to], to));
}
}
}
ll ans = dp[N-1];
if(ans == INF){
ans = -1LL;
}
cout << ans << "\n";
}
int main()
{
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include<atcoder/all>
// using namespace atcoder;
#endif
#define int long long
#define rep(i, n) for(int i = 0;i<(int)(n);i++)
#define all(v) (v).begin(),(v).end()
using lint = long long;
using ll = long long;
using P = std::pair<int,int>;
constexpr int inf = 2e18;
bool chmin(int &a,const int b) {
if(a>b) {
a=b;
return true;
}
return false;
}
struct UnionFind {
vector<int> par, size;
UnionFind(int x) {
par.resize(x);
size.resize(x, 1);
for(int i = 0; i < x; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
bool same(int x, int y) {
return find(x) == find(y);
}
int consize(int x) {
return size[find(x)];
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return false;
if (size[x] < size[y]) {
par[x] = y;
size[y] += size[x];
}
else {
par[y] = x;
size[x] += size[y];
}
return true;
}
};
int n,m;
std::vector<int> G[100010];
int dp[300030][20];
int dis[20][20];
std::vector<int> BFS(int s) {
std::vector<int> dist(n,inf);
dist[s] = 0;
std::queue<int> que;
que.push(s);
while(!que.empty()) {
int v = que.front();que.pop();
for(auto &to:G[v]) if(chmin(dist[to],dist[v]+1)) que.push(to);
}
return dist;
}
signed main() {
std::cin >> n >> m;
UnionFind uf(n);
rep(i, m) {
int a,b;
std::cin >> a >> b;
a--,b--;
uf.unite(a,b);
G[a].push_back(b);
G[b].push_back(a);
}
int k;
std::cin >> k;
std::vector<int> v(k);
rep(i, k) std::cin >> v[i],v[i]--;
std::set<int> st;
for(auto p:v) st.insert(uf.find(p));
if(st.size()!=1) return !printf("-1\n");
rep(i, k) {
auto vec = BFS(v[i]);
rep(j, k) dis[i][j] = vec[v[j]];
}
// rep(i, k) dis[k][i]=1;
rep(i, 300030) rep(j, 20) dp[i][j]=inf;
// dp[1<<k][k] = 0;
// rep(i, k) rep(j, k) std::cout << dis[i][j] << " \n"[j==k-1];
rep(i, k) dp[1<<i][i] = 1;
rep(bit, (1<<(k+1))) {
rep(i, k) {
if((~bit)&(1<<i)) continue;
// printf("OK\n");
rep(j, k) {
if(bit&(1<<j)) continue;
chmin(dp[bit|(1<<j)][j],dp[bit][i]+dis[i][j]);
// std::cout << bitset<3>(bit) << ' ' << i << ' ' << j << ' ' << std::endl;
}
}
}
// rep(i, 7) rep(j, 3) std::cout << dp[i][j] << " \n"[j==2];
int mi = inf;
rep(i, k) chmin(mi,dp[(1<<k)-1][i]);
std::cout << mi << std::endl;
return 0;
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
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; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
ll dp[17][100005];
int n;
V<V<int>> g;
void d(int s,int st){
for(int i=0;i<n;i++){
dp[s][i]=inf;
}
dp[s][st]=0;
queue<int> q;
q.emplace(st);
while(q.size()){
int cur=q.front();
q.pop();
for(int v:g[cur]){
if(chmin(dp[s][v],dp[s][cur]+1)){
q.emplace(v);
}
}
}
}
int main(){
int m;
cin>>n>>m;
g=V<V<int>>(n);
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
g[--a].emplace_back(--b);
g[b].emplace_back(a);
}
int k;
cin>>k;
V<int> c(k);
for(int i=0;i<k;i++){
cin>>c[i];
c[i]--;
d(i,c[i]);
//for(int j=0;j<n;j++)cout<<dp[i][j]<<" ";
//cout<<"\n";
}
V<V<ll>> res((1<<k)+5,V<ll>(k+1,inf));
for(int i=0;i<k;i++)res[(1<<i)][i]=1;
for(int s=0;s<(1<<k);s++){
for(int i=0;i<k;i++){
if(~s&(1<<i))continue;
for(int j=0;j<k;j++){
if(s&(1<<j))continue;
chmin(res[s|(1<<j)][j],res[s][i]+dp[i][c[j]]);
}
}
}
ll ans=inf;
for(int i=0;i<k;i++)chmin(ans,res[(1<<k)-1][i]);
cout<<(ans>=inf?-1:ans)<<"\n";
} |
#include<bits/stdc++.h>
using namespace std;
const int N=1e8;
int h,w,x,y;
char s[110][110];
int main()
{
int sum=1;
cin>>h>>w>>x>>y;
y--;
for(int i=1;i<=h;i++)
cin>>s[i];
for(int i=x+1;i<=h;i++)
if(s[i][y]=='.')
sum++;
else break;
for(int i=x-1;i>=1;i--)
if(s[i][y]=='.')
sum++;
else break;
for(int i=y+1;i<w;i++)
if(s[x][i]=='.')
sum++;
else break;
for(int i=y-1;i>=0;i--)
if(s[x][i]=='.')
sum++;
else break;
cout<<sum;
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : " << x.second << ")" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "["; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "]"; return o;}
ostream &operator<<(ostream &o, const string &obj) {o << "\""; o << obj.c_str(); o << "\""; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "(" << obj.first << ", " << obj.second << ")"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print_sim_py(void) {cout << endl;}
template <class Head> void print_sim_py(Head&& head) {cout << head;print_sim_py();}
template <class Head, class... Tail> void print_sim_py(Head&& head, Tail&&... tail) {cout << head << " ";print_sim_py(forward<Tail>(tail)...);}
#define print(...) print_sim_py(__VA_ARGS__);
#else
#define print(...);
#endif
template <typename... Ts>
std::istream& IN(Ts&... xs){ return (std::cin >> ... >> xs); }
#define repr(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) for (ll i = 0; i < n; i++)
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll h,w,x,y;
IN(h,w,x,y);
x--; y--;
vector<vector<ll>> m(h,vector<ll>(w,0));
rep(i,h){
string s;
cin >> s;
rep(j,w){
m[i][j] = (s[j] == '#');
}
}
print(m, x,y)
auto count_ok = [&](ll step_x, ll step_y){
ll i,j;
i = y+step_y; j=x+step_x;
ll res = 0;
print(i,j)
while(0 <= j && j < h &&
0 <= i && i < w){
if(m[j][i] != 0){
break;
}
print(i,j,res)
res++;
i += step_y;
j += step_x;
}
return res;
};
ll ans = (m[x][y] == 0);
ans += count_ok(1,0);
ans += count_ok(0,1);
ans += count_ok(-1,0);
ans += count_ok(0,-1);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
void solve() {
std::string s;
std::cin >> s;
int n = s.length();
std::vector<int> cnt(10, 0);
for (auto c : s) ++cnt[c - '0'];
for (int i = 0; i < 10; ++i) {
if (cnt[i] == 0 && (i != 0 || n != 0)) continue;
--cnt[i];
--n;
for (int j = 0; j < 10; ++j) {
if (cnt[j] == 0 && (j != 0 || n != 0)) continue;
--cnt[j];
--n;
for (int k = 0; k < 10; ++k) {
if (cnt[k] == 0 && (k != 0 || n != 0)) continue;
--cnt[k];
--n;
int x = k * 100 + j * 10 + i;
if (x % 8 == 0) {
std::cout << "Yes\n";
return;
}
++cnt[k];
++n;
}
++cnt[j];
++n;
}
++cnt[i];
++n;
}
std::cout << "No\n";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
#include <assert.h>
// #include <prettyprint.hpp>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(ll i=0;i<n;++i)
#define repinvi(i,n) for(int i=n-1;i>=0;--i)
#define sll(n) scanf("%lld", &n);
#define sii(n) scanf("%d", &n);
#define slf(n) scanf("%lf", &n);
#define pll pair<ll,ll>
#define pii pair<int,int>
#define psi pair<si,si>
#define v(t) vector<t>
#define vv(t) vector<vector<t>>
#define vvv(t) vector<vector<vector<t>>>
typedef long long ll;
typedef double lf;
typedef short int si;
void Main(){
string S;
cin >> S;
map<char, ll> counter;
rep(i, S.size()){
counter[S[i]] ++;
}
// rep(i, 10){
// if(counter.find(i+1) == counter.end()){
// counter['1'+i] = 0;
// }
// }
v(string) string_list;
string base;
if(S.size() == 1){
base = "0";
}else if(S.size() == 2){
base = "00";
}else{
base = "000";
}
rep(i, 1001){
if(i==1000)break;
if(i % 8==0){
string new_b = base;
new_b[0] += i % 10;
if(S.size() >= 2){
new_b[1] += (i % 100) / 10;
}
if(S.size()>=3){
new_b[2] += i / 100;
}
string new_b2 = "";
rep(i, new_b.size()){
new_b2 += new_b[new_b.size()-i-1];
}
string_list.push_back(new_b2);
}
// if(S.size()<=3){
// ll n = stoi(S);
// if(i>=n) break;
// }
}
bool ok;
// cout << string_list <<endl;
for(auto s:string_list){
map<char, ll> s_count;
bool has_zero = false;
for(auto c:s){
if(c=='0'){
has_zero = true;
}
s_count[c]++;
}
if(has_zero){
continue;
}
bool this_ok = true;
// cout << s <<endl;
// cout << s_count <<endl;
for(auto p:s_count){
// cout << p <<endl;
if(counter[p.first]<p.second){
this_ok = false;
break;
}
}
ok = this_ok;
if(this_ok){
break;
}
}
if(ok){
cout << "Yes" <<endl;
}else{
cout << "No" <<endl;
}
}
int main(){
Main();
} |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i=0;i<n;i++)
#define INF 1000000001
#define lINF 1000000000000001
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using vs = vector<string>;
using vc = vector<char>;
using P = pair<ll, ll>;
using si = stack<int>;
using ss = stack<string>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
//1e9<int型の最大値<1e10
//1e18<long型の最大値<1e19
//配列直入れ↓
//g++ -std=c++17 -Wshadow -Wall -D_GLIBCXX_DEBUG -o a b.cpp && ./a
//bit全探索
//2のk乗は"1<<k"で書ける
int main(){
double n,D,H;
cin>>n>>D>>H;
vector<double> d(n);
vector<double> h(n);
double ans=INF;
double tans =0;
rep(i,n){
double now;
cin>>d[i]>>h[i];
now=(H-h[i])/(D-d[i]);
if(now<ans){
ans=now;
tans=H-ans*D;
}
}
if(tans<0) cout<<0.0<<endl;
else cout<<setprecision(10)<<tans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000005 /*10^9+5*/
#define mod 1000000007 /*10^9+7*/
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i) /*0からn-1までのrepeat*/
#define rrep(i,n) for(int i = 1; i <= (n); ++i) /*1からnまでのrepeat*/
#define drep(i,n) for(int i = (n)-1; i >= 0; --i) /*n-1から0までのrepeat*/
#define srep(i,s,t) for (int i = s; i < t; ++i) /*sからt-1までのrepeat*/
#define isin(x,l,r) ((l) <= (x) && (x) < (r)) /*l以上r未満のx*/
#define each(a,b) for(auto& (a): (b)) /*よくわかんない☆*/
#define pct __builtin_popcountll /*1bitの数*/
#define all(a) a.begin(),a.end() /*ぜーんぶ*/
#define sz(v) (int)(v).size() /*大きさ*/
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end()) /*重複削除*/
#define cmx(x,y) x=max(x,y) /*最大*/
#define cmn(x,y) x=min(x,y) /*最小*/
#define rev(v) reverse((v).begin(),(v).end()); /*逆順*/
#define so(v) sort((v).begin(), (v).end()); /*ソート*/
#define yn {puts("Yes");}else{puts("No");} /*はいかいいえか*/
#define YN {puts("YES");}else{puts("NO");} /*大文字-はいかいいえか*/
#define dame { puts("-1"); return 0;}/*だめ*/
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define vipls vector<int> pls; /*@_vipls*/
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vp = vector<P>;
using vt = vector<T>;
using vs = vector<string>;
using vc = vector<char>;
int main() {
ll a,b,n,ct;
ct = 0;
cin >> n;
rep(i, n) {
cin >> a >> b;
a = (b - a + 1) * (b + a) / 2;
ct = ct + a;
}
cout << ct << endl;
return 0;
} |
/*
[arc104] D - Multiset Mean
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 100;
const int MAX_K = 100;
const int MAX_S = MAX_N * MAX_N * MAX_K;
int N, K, MOD;
class gf {
public:
int n;
gf() : n(0) {}
gf(int n) : n(n < 0 ? n % MOD + MOD : n % MOD) {}
gf operator+(gf x) { return gf((n + x.n) % MOD); }
gf operator-(gf x) { return gf((n - x.n + MOD) % MOD); }
gf operator*(gf x) { return gf((1LL * n * x.n) % MOD); }
gf& operator+=(gf x) { return *this = (*this + x); }
gf& operator-=(gf x) { return *this = (*this - x); }
gf& operator*=(gf x) { return *this = (*this * x); }
};
gf dp[MAX_N + 1][MAX_S + 1];
void solve() {
int sz = 0;
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
sz += i;
gf ps[MAX_N + 1];
for (int j = 0; j <= sz * K; j++) {
int m = j % i;
ps[m] += dp[i - 1][j];
int lj = j - i * (K + 1);
if (lj >= 0) {
ps[m] -= dp[i - 1][lj];
}
dp[i][j] = ps[m];
}
}
for (int i = 1; i <= N; i++) {
gf ans = 0;
for (int j = 0; j <= sz * K; j++) {
ans += dp[i - 1][j] * dp[N - i][j];
}
ans = ans * (K + 1) - 1;
cout << ans.n << endl;
}
}
int main() {
cin >> N >> K >> MOD;
solve();
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define int long long
typedef long long LL;
typedef long long ll;
const int INF = 0x3f3f3f3f;
//const int inf = 1e18;
//const int mod = 998244353;
const int mod = 1e9 + 7;
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
const int maxn = 1e6 + 10;
const int N = 6e6 + 100;
int a[maxn];
void solve() {
int r,x,y;
cin>>r>>x>>y;
double R=sqrt(x*x+y*y);
if (R<r) cout<<2<<"\n";
else
cout<<ceil(R/(r*1.0))<<"\n";
}
signed main() {
//ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int _ = 1;
// cin >> _;
while (_--) {
solve();//cout<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
double a ,b;
cin >> a >> b;
double ans = a*b;
cout << ans/100 << endl;
} | #include<bits/stdc++.h>
using namespace std;
//My typenames
typedef long long l1;
typedef vector<int> vi;
typedef vector<l1> vl;
typedef pair<int,int> pi;
typedef map<int,int> mp;
//My Macros
#define F first
#define S second
#define pushb push_back
#define popb pop_back
#define fli(i,a,b) for(int i=a;i<b;i++)
#define fld(i,a,b) for(int i=a;i>b;i--)
void solve(){
float a,b;
cin>>a>>b;
cout<<(float)(b/100.0)*a<<"\n";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("in","r",stdin);
//freopen("out","w",stdout);
//Getting test cases
solve();
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector< vector<int> > T;
vector<int> C;
vector<int> ans;
vector<int> color_check;
void dfs(int now, int p){
if(color_check[ C[now] ] == 0){
ans.emplace_back(now);
}
color_check[ C[now] ]++;
for(int i = 0; i < T[now].size(); i++){
if(T[now][i] == p){
continue;
}else{
dfs(T[now][i],now);
}
}
color_check[ C[now] ]--;
return;
}
int main(){
//N頂点n-1辺の木の作成(木という名の無向グラフ)
//頂点Aから頂点Bへの辺には頂点Aと頂点Bの色の情報も入れる。
int N = 0;
cin >> N;
C.resize(N, 0);
for(int i = 0; i < C.size(); i++){
cin >> C[i];
}
T.resize(N);
for(int i = 0; i < N-1; i++){
int A = 0, B = 0;
cin >> A >> B;
T[A-1].emplace_back(B-1);
T[B-1].emplace_back(A-1);
}
//深さ優先探索で探索
//ちなみに頂点1は絶対によい頂点なので答えは1つ以上存在する。
color_check.resize(100001, false);
dfs(0,-1);
sort(ans.begin(), ans.end());
for(int i = 0; i < ans.size(); i++){
cout << ans[i]+1 << endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
const int maxn=2e5+5;
int a[maxn],b[maxn],p[maxn],ip[maxn];
void solve(){
int n;
cin>>n;
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];
ip[p[i]]=i;
}
priority_queue<pair<int,int>> pq;
for(int i=1;i<=n;i++){
pq.push(make_pair(b[i],i));
}
for(int i=1;i<=n;i++){
if(a[i]<=b[p[i]] && p[i]!=i){
cout<<"-1\n";
return;
}
}
vector<pair<int,int>> ops;
for(int i=1;i<=n;i++){
auto cur=pq.top();
pq.pop();
if(p[cur.second]==cur.second){
continue;
}
int fst=cur.second,scnd=ip[cur.second];
ops.emplace_back(fst,scnd);
swap(ip[p[fst]],ip[p[scnd]]);
swap(p[fst],p[scnd]);
}
cout<<(int)ops.size()<<'\n';
for(auto i:ops){
cout<<i.first<<' '<<i.second<<'\n';
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin>>h>>w;
map<int,int>mp;
vector<int>v;
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
int temp;
cin>>temp;
v.push_back(temp);
mp[temp]++;
}
}
int low = *min_element(v.begin(),v.end());
int ans =0;
for(auto &it:mp)
{
if(it.first!=low)
{
ans+=(it.first-low)*it.second;
}
}
cout<<ans<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
const ll inf = 1e9 + 9;
const ll maxn = 1e5+100;
const ll mod = 1e9+7;
const ld eps = 1e-6;
//-------------------------------------------------------------------------
int n, m, mn, sum;
void solve() {
cin >> n >> m;
mn = 110;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
sum += x;
mn = min(mn, x);
}
}
cout << sum - mn * n * m << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b;
cin>>a>>b;
double ans=(double)a*b;
ans=(double)ans/100;
cout<<setprecision(10)<<ans<<"\n";
}
| // PIGMEISTER™ //
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define sidha(i,x,n) for(ll i=(ll)(x);i<(ll)(n);++i)
#define ulta(i,x,n) for(ll i=(ll)(x);i>=(ll)(n);--i)
#define sab(a) a.begin(),a.end()
#define bas(a) a.rbegin(),a.rend()
#define test ll _;cin>>_;while(_--)
#define jaldi ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
//#define MAX 100005
#define PI (ld)3.141592653589793238
#define MOD LLONG_MAX
//#define MOD (ll)1000000007
//#define MOD (ll)998244353
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
jaldi;
ld a, b;
cin >> a >> b;
cout << b * (ld)(a / (ld)100);
return 0;
}
|
//#include<bits/stdc++.h>
#include<map>
#include<queue>
#include<time.h>
#include<limits.h>
#include<cmath>
#include<ostream>
#include<iterator>
#include<set>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define endl '\n'
#define rep_1(i,m,n) for(int i=m;i<=n;i++)
#define mem(st) memset(st,0,sizeof st)
//namespace first_space
//{
// int a=10;
// void func()
// {
// cout << "Inside first_space" << endl;
// }
//}
int read()
{
int res=0,ch,flag=0;
if((ch=getchar())=='-') //判断正负
flag=1;
else if(ch>='0'&&ch<='9') //得到完整的数
res=ch-'0';
while((ch=getchar())>='0'&&ch<='9')
res=res*10+ch-'0';
return flag?-res:res;
}
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef pair<double,double> pdd;
const int inf = 0x3f3f3f3f;
void solve()
{
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b<c*c)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
signed main()
{
int t=1;
while(t--)
solve();
return 0;
}
| #pragma region
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t; // long long と int64_t は同じ
const int INF = 0x3fffffff; // 10^9 より少し大きい
#pragma endregion
ll point (map<ll, ll> f)
{
ll a = 0;
for (auto x : f) a += x.first * pow(10, x.second);
return a;
}
int main() {
ll K;
string S, T;
cin >> K >> S >> T;
map<ll, ll> s;
map<ll, ll> t;
map<ll, ll> remain;
for (int i = 1; i <= 9; i++) {
s[i] = 0, t[i] = 0, remain[i] = K;
}
for (int i = 0; i <= 3; i++) {
int a = S[i] - '0';
s[a]++;
remain[a]--;
a = T[i] - '0';
t[a]++;
remain[a]--;
}
ll win = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (i == j) {
map<ll, ll> s_ = s, t_ = t;
s_[i]++, t_[i]++;
if (point(s_) > point(t_)) {
ll p = point(s_), q = point(t_);
win += remain[i] * (remain[i] - 1);
}
}
if (i != j) {
map<ll, ll> s_ = s, t_ = t;
s_[i]++, t_[j]++;
if (point(s_) > point(t_)) {
ll p = point(s_), q = point(t_);
win += remain[i] * remain[j];
}
}
}
}
const ll total = 9 * K - 8;
// double p = double(win) / total / (total - 1);
cout << double(win) / total / (total - 1) << endl;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;
void array_show(int *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
string sa;
string s="RSP";
int t[222][222];
int main(){
int n,m;
int i,j,k;
int a,b,c;
cin>>n>>m;
cin>>sa;
for(i=0;i<n;i++){
if(sa[i]=='R')t[0][i]=0;
if(sa[i]=='S')t[0][i]=1;
if(sa[i]=='P')t[0][i]=2;
}
for(i=0,a=1;i<m;i++,a*=2){
a%=n;
for(j=0;j<n;j++){
b=t[i][j],c=t[i][(j+a)%n];
if((b+1)%3==c)t[i+1][j]=b;
else t[i+1][j]=c;
}
}
cout<<s[t[m][0]]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 3;
#define block 555
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define lb lower_bound
#define ub upper_bound
#define fact(n) rep(i, 1, n+1)ft.pb((ft[i-1]*i)%mod);
#define mod_in(a) exp(a, mod-2)
#define ncr(n, r) ((ft[n]*mod_in((ft[r]*ft[(n)-(r)])%mod))%mod)
#define deb(x) cout << #x << " " << x << endl;
#define flash ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
ll prime[100002];
ll exp(ll a,ll b);
void sieve(ll n);
ll gcd(ll a ,ll b);
ll countdigit(ll n);
ll check(string str);
vector<ll>ft;
void solve(){
ll n,a,b;
cin >> n >> a >> b;
cout << n -a + b <<endl;
}
int main()
{
flash;
ll t=1;
//ft.pb(1);
//fact(10000001);
//cin >> t;
while(t--) {
solve();
}
}
//
//
//
//
//
// IMPORTANT FUNCTIONS
ll exp(ll a, ll b) {
int res=1;
while(b) {
if(b&1)
res=(res*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return res%mod;
}
ll gcd(ll a,ll b){
if(a==0)return b;
return gcd(b%a,a);
}
void sieve(ll n) {
for(ll i=0;i<=n;i++) {
prime[i]=1;
}
prime[0]=0;prime[1]=0;
for(ll i=2;i<=n;i++) {
if(prime[i]==1) {
for(ll j=2;i*j<=n;j++) {
prime[i*j]=0;
}
}
}
}
ll countdigit(ll n)
{
return floor(log10(n) + 1);
}
ll check(string str)
{
ll l = 0;
ll h = str.size() - 1;
while (h > l)
{
if (str[l++] != str[h--])
{
return 0;
}
}
return 1;
} |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}
constexpr int MOD = 998244353;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
#define all(a) (a).begin(), (a).end()
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
struct mint{
ll x;
constexpr mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
constexpr mint operator-() const{
return mint(-x);
}
constexpr mint& operator+=(const mint& a){
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
constexpr mint& operator-=(const mint& a){
if ((x += MOD - a.x) >= MOD) x -= MOD;
return *this;
}
constexpr mint& operator*=(const mint& a){
(x *= a.x) %= MOD;
return *this;
}
constexpr mint operator+(const mint& a) const{
mint res(*this);
return res += a;
}
constexpr mint operator-(const mint& a) const{
mint res(*this);
return res -= a;
}
constexpr mint operator*(const mint& a) const{
mint res(*this);
return res *= a;
}
constexpr 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
constexpr mint inv() const{
return pow(MOD - 2);
}
constexpr mint& operator/=(const mint& a){
return (*this) *= a.inv();
}
constexpr mint operator/(const mint& a) const{
mint res(*this);
return res /= a;
}
};
istream& operator>>(istream& is, mint& a) {return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) {return os << a.x;}
mint modpow(mint a, ll b){
if(b == 0) return 1;
else if(b % 2 == 0){
mint d = modpow(a, b / 2);
return d * d;
}
else{
return a * modpow(a, b - 1);
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h, w; cin>>h>>w;
vector<string> s(h);
for(int i=0; i<h; i++) cin>>s[i];
vector<set<char>> color(h + w - 1);
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
color[i + j].emplace(s[i][j]);
}
}
mint ans = 1;
for(int i=0; i<h+w-1; i++){
if(color[i].size() == 1 && color[i].count('.')) ans *= 2;
if(color[i].count('R') && color[i].count('B')) ans *= 0;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(int i=0;i < (n);i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
// aよりもbが大きいならばaをbで更新する
// (更新されたならばtrueを返す)
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b; // aをbで更新
return true;
}
return false;
}
// aよりもbが小さいならばaをbで更新する
// (更新されたならばtrueを返す)
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b; // aをbで更新
return true;
}
return false;
}
int inputValue(){
int a;
cin >> a;
return a;
};
void inputArray(int * p, int a){
for(int i=0;i<a;i++){
cin >> p[i];
}
};
void inputVector(vector<int> * p, int a){
for(int i=0;i<a;i++){
int input;
cin >> input;
p -> push_back(input);
}
}
ll fact[MAX], fact_inv[MAX];
ll power(ll a, ll b){
ll res=1;
while(b>0){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
// nCr
ll comb(ll n, ll r){
ll t=1000000;
fact[0]=1;
for(int i=0;i<t;i++){ fact[i+1]=fact[i]*(i+1)%MOD;}
fact_inv[t]=power(fact[t], MOD-2);
for(int i=0;i<t;i++){ fact_inv[i]=fact_inv[i+1]*(i+1)%MOD;}
return (fact[n]*fact_inv[r])%MOD*fact_inv[n-r]%MOD;
}
ll i,j,k,tmp;
ll ans = 0;
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
ll N,S,D; cin >> N >> S >> D;
rep(i,N){
ll X,Y; cin >> X >> Y;
if(X < S && Y > D){cout << "Yes" << endl; return 0;}
}
cout << "No" << endl;
return 0;
}
|
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <utility>
#include <vector>
#include <stack>
using namespace std;
using ll = long long int;
// fast IO
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
////////// Template structure for debugging
#define tr(...) trace(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void trace(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void trace(const char* names, Arg1&& arg1, Args&&... args){
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
trace(comma + 1, args...);
}
#define print(...) pr(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void pr(const char* name, Arg1&& arg1){
cout << arg1 << endl;
}
template <typename Arg1, typename... Args>
void pr(const char* names, Arg1&& arg1, Args&&... args){
const char *comma = strchr(names + 1, ',');
cout << arg1 << " ";
pr(comma + 1, args...);
}
void printV(vector<int> &arr)
{
cout << "Vector : ";
for(int i=0;i<arr.size();i++)
cout << arr[i] << " \n"[ i == arr.size()-1 ];
}
void printV(vector<long long> &arr)
{
cout << "Vector : ";
for(int i=0;i<arr.size();i++)
cout << arr[i] << " \n"[ i == arr.size()-1 ];
}
void printA(int arr[], int n) {
cout << "Array : ";
for (int i = 0; i < n; i++)
cout << arr[i] << " \n"[i == n - 1];
}
/////////////////////////////////////////////////////////////////////////////
////////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
/////////////////////////////////////////////////////////////////////////////
ll x, y;
map<ll, ll> m;
ll ans = 1e18;
ll find(ll target, ll curr){
if(curr == target)return 0;
if(m.count(curr)) return m[curr];
m[curr] = abs(curr - target);
ll &ans = m[curr];
if(curr == 1)return ans;
if(curr % 2 == 0)ans = min(1 + find(target, curr/2), ans);
else ans = min(ans,1 + min(find(target, curr + 1), find(target, curr - 1)));
return ans;
}
void solve(int tc = 1){
cin >> x >> y;
cout << find(x, y) << endl;
}
int main(){
IOS;
int tt = 1;
//cin >> tt;
while(tt--)solve();
}
| #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-12;
//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
if (N >= M) {
cout << N - M << endl;
return 0;
}
long long int ans = MOD*MOD;
for (int i = 0; i <= 62; i++) {
if ((N << i) > 4e18)break;
long long int dif = abs((N << i) - M);
long long int cnt = i + dif / (1LL << i);
dif %= (1LL << i);
vector<vector<int>>dp(i + 2, vector<int>(3, MOD));
dp[0][1] = 0;
for (int j = 0; j <= i; j++) {
for (int k = 0; k < 3; k++) {
long long int b = dif >> j & 1;
long long int st = b + k - 1;
if (st == -1) {
dp[j + 1][0] = min(dp[j + 1][0], dp[j][k] + 1);
dp[j + 1][1] = min(dp[j + 1][1], dp[j][k] + 1);
}
else if (st == 0) {
dp[j + 1][1] = min(dp[j + 1][1], dp[j][k]);
}
else if (st == 1) {
dp[j + 1][1] = min(dp[j + 1][1], dp[j][k] + 1);
dp[j + 1][2] = min(dp[j + 1][2], dp[j][k] + 1);
}
else if (st == 2) {
dp[j + 1][2] = min(dp[j + 1][2], dp[j][k]);
}
}
}
ans = min(ans, cnt + dp[i + 1][1]);
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int N = 51;
ll dp[N][2], vis[N][2];
ll repx[N], a[N];
ll n, x;
// question is we have to find number A such that (x+A) has no common coin with A
// i represent ith type of coin and f represent we have carry or not from previous
ll fun(int i, int f) {
// if f == 1 then we get carry for i-1 to ith bit
// if f == 0 then we don't get any carry for ith from back
if(i == n-1) return 1;
// if we already know ans for current state then we return that directly
if(vis[i][f] == 1) return dp[i][f];
vis[i][f] = 1;
// cur-1 represent in any representation maximum number of coin, we can take of that type
int cur = a[i+1]/a[i];
// repx[i] + f == cur it means all the coin of ith type change
// in (i+1)th type we genrate a carry for i+1 th bit
if(cur == repx[i] + f) {
// We can't put any bit here in A think why
dp[i][f] = fun(i+1, 1);
}
else {
// if there is some coin of ith type or we get any carry from previous in (x+A)
// then there is two way to take coin of ith type in A
// 1st we take as much coin such that in (x+A) there are total number of coin of ith type
// becomes equal to cur so that we can change ith type of coin in (x+A) to (i+1)th type coin
// this is same that we get carry from previous
if(repx[i] + f > 0) {
dp[i][f] = fun(i+1, 1);
}
//2nd we don't put any coin of ith type in A
dp[i][f] += fun(i+1, 0);
}
return dp[i][f];
}
void solve() {
cin >> n >> x;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = n-1; i >= 0; i--) {
repx[i] = x/a[i];
x %= a[i];
}
// at 0 there is no previous carry
cout << fun(0, 0) << endl;
}
int main()
{
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
ll nextLong() { ll x; scanf("%lld", &x); return x;}
ll dp[1005][1005];
ll A[1005], B[1005];
int main2() {
int N = nextLong();
int M = nextLong();
REP(i, N) A[i] = nextLong();
REP(i, M) B[i] = nextLong();
const ll INF = 1LL << 61;
REP(i, N+1) REP(j, M+1) dp[i][j] = INF;
dp[0][0] = 0;
REP(i, N+1) {
REP(j, M+1) {
chmin(dp[i+1][j], dp[i][j] + 1);
chmin(dp[i][j+1], dp[i][j] + 1);
chmin(dp[i+1][j+1], dp[i][j] + (A[i] == B[j] ? 0 : 1));
}
}
ll ans = dp[N][M];
cout << ans << endl;
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
} |
#include <iostream> // cout, endl, cin
#include <vector> // vector
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
}
int K;
cin >> K;
vector<int> C(K), D(K);
for (int i = 0; i < K; i++) {
cin >> C.at(i) >> D.at(i);
}
int K2 = 1 << K;
int ans = 0;
for (int s = 0; s < K2; s++) {
vector<int> dish(N + 1);
for (int i = 0; i < K; i++) {
if ((s >> i) & 1) {
dish.at(D.at(i))++;
}
else {
dish.at(C.at(i))++;
}
}
int cnt = 0;
for (int i = 0; i < M; i++) {
if (dish.at(A.at(i)) == 0) {
continue;
}
if (dish.at(B.at(i)) == 0) {
continue;
}
cnt++;
}
ans = max(ans, cnt);
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
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(b<a){ a=b; return 1; } return 0; }
int solve(){
cin.tie(0), ios::sync_with_stdio(false);
int n,m; cin >> n >> m;
vi a(m),b(m); rep(i,m) cin >> a[i] >> b[i];
int k; cin >> k;
vi c(k),d(k); rep(i,k) cin >> c[i] >> d[i];
int ans = 0;
rep(bit,1<<k){
vi table(n+1);
rep(i,k){
if(bit>>i&1){
table[c[i]]++;
}else{
table[d[i]]++;
}
}
int res = 0;
rep(i,m) if(table[a[i]] && table[b[i]]) res++;
chmax(ans,res);
}
return ans;
}
int main(){
cout << solve() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define MAXN 100005
#define INF (ll)1e18
#define mod 1000000007
//#define mod 998244353
#define endl '\n'
#define level 20
ll cc=0;
void boost()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector <pair<ll,pair<ll,ll>>> V[MAXN];
ll dis[MAXN],vis[MAXN];
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
int main()
{
boost();
ll i,j,k,n,t,c=0,l,r,x,y,n1,mask;
ll ans,h,z,m,u,v,q,mm,w,mx,d,mid;
ld f;
cin>>n>>m>>l>>r;
for(i=0;i<=n;i++)
{
dis[i]=INF;
vis[i]=0;
}
for(i=1;i<=m;i++)
{
cin>>x>>y>>z>>k;
V[x].pb(make_pair(y,make_pair(z,k)));
V[y].pb(make_pair(x,make_pair(z,k)));
}
dis[l]=0;
pq.push(make_pair(dis[l],l));
while(!pq.empty())
{
u=pq.top().second;
pq.pop();
if(vis[u]==0)
{
vis[u]++;
for(auto p: V[u])
{
v=p.first;
k=p.second.first;
z=p.second.second;
w=(dis[u]%z);
if(w!=0)
{
w=z-w;
}
k+=w;
if((dis[v]>(dis[u]+k))&&(vis[v]==0))
{
dis[v]=dis[u]+k;
pq.push(make_pair(dis[v],v));
}
}
}
}
if(vis[r]==0)
{
cout<<-1<<endl;
}
else
{
cout<<dis[r]<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void chmax(ll &x, ll y) {x = max(x,y);}
void chmin(ll &x, ll y) {x = min(x,y);}
void Yes() {cout << "Yes" << endl; exit(0);}
void No() {cout << "No" << endl; exit(0);}
template<class in_Cout> void Cout(in_Cout x) {cout << x << endl; exit(0);}
const ll inf = 1e18;
const ll mod = 1e9 + 7;
struct edge {ll to, cost, k;};
ll N, M, X, Y;
ll dijkstra(ll st, ll en, vector<vector<edge>> G) {
vector<ll> dist(N,inf);
dist[st] = 0LL;
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> que;
que.push({0,st});
while (que.size()) {
pair<ll,ll> p = que.top();
que.pop();
ll now = p.second, d = p.first;
if (dist[now]<d) continue;
for (auto e : G[now]) {
ll to = e.to, cost = e.cost, k = e.k;
ll dt = (k-(dist[now]%k))%k;
ll nd = dist[now] + dt + cost;
if (dist[to]<=nd) continue;
dist[to] = nd;
que.push({nd,to});
}
}
ll res = dist[en];
if (res==inf) res = -1LL;
return res;
}
int main() {
cin >> N >> M >> X >> Y;
X--; Y--;
vector<vector<edge>> G(N);
rep(i,M) {
ll a, b, t, k; cin >> a >> b >> t >> k;
a--; b--;
G[a].push_back({b,t,k});
G[b].push_back({a,t,k});
}
ll ans = dijkstra(X,Y,G);
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
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 dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
ll N;
cin >> N;
vector<string> ans;
ans.push_back("AB");
rep(i, N-1) {
vector<string> n_ans;
for(string s: ans) {
n_ans.push_back(s + s);
}
for(string s: ans) {
string rev = "";
for(char ch: s) {
if(ch == 'A') {
rev += "B";
} else {
rev += "A";
}
}
n_ans.push_back(s + rev);
}
string s = "";
rep(i, n_ans[0].size()/2) s += "A";
rep(i, n_ans[0].size()/2) s += "B";
n_ans.push_back(s);
swap(ans, n_ans);
}
cout << ans.size() << endl;
for(auto s: ans) cout << s << endl;
}
| #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main()
{
int n;
cin >> n;
vector<bool> b(2);
b[0] = true, b[1] = false;
set<vector<bool>> st0;
st0.insert(b);
for(int c = 2; c <= n; c++){
set<vector<bool>> st1;
int l = (1 << (c - 1));
for(auto itr = st0.begin(); itr != st0.end(); itr++){
vector<bool> b = *itr;
b.resize(l * 2);
for(int i = l - 1; i >= 0; i--){
b[i * 2 + 1] = b[i * 2] = b[i];
}
st1.insert(b);
if(b[1] == b[2]) continue;
for(int i = 0; i < l / 2; i++){
swap(b[i * 4 + 1], b[i * 4 + 2]);
}
st1.insert(b);
for(int i = 0; i < l / 2; i++){
swap(b[i * 4 + 2], b[i * 4 + 3]);
}
st1.insert(b);
}
swap(st0, st1);
}
cout << (int)st0.size() << endl;
for(auto itr = st0.begin(); itr != st0.end(); itr++){
for(bool e : *itr){
if(e) cout << 'A';
else cout << 'B';
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define setbits(x) __builtin_popcountll(x)
#define md (ll)1e9 + 7
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define f(i, j, n) for (ll i = j; i < n; i++)
#define r(i, j, n) for (ll i = n - 1; i >= j; i--)
void solve()
{
ll n,x;
cin>>n>>x;
string s;
cin>>s;
for(auto i : s){
i=='o'?x++:x--,x=max(0ll,x);
}
cout<<x;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inpput.txt", "r", stdin); //freopen("op.txt", "w", stdout);
#endif
ll test_cases = 1;
//cin >> test_cases;
for (ll t = 1; t <= test_cases; t++)
solve(),cout<<"\n";
//cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 9, M = 1e6 + 9, OO = 0x3f3f3f3f;
ll llOO = 0x3f3f3f3f3f3f3f3f;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, x; cin >> n >> x;
string s; cin >> s;
for(int i = 0;i < n;i++){
if(s[i] == 'o') x++;
else x = max(x - 1, 0);
}
cout << x;
} |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MAXN 300010
long long n;
long long a[MAXN];
map<long long, long long> qt;
int main() {
scanf("%lld", &n);
long long i, j;
for (i=1; i<=n; i++) {
scanf("%lld", &a[i]);
}
long long ans = 0;
for (i=1; i<=n; i++) {
map<long long, long long>::iterator iter;
for (iter=qt.begin(); iter!=qt.end(); iter++) {
ans += (a[i]-iter->first)*(a[i]-iter->first)*iter->second;
}
qt[a[i]]++;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define INF LLONG_MAX
#define MINF LLONG_MIN
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define mii map<int, int>
#define si set<int>
int pow(int x, int y, int mod) {
int temp;
if (y == 0)
return 1;
temp = (pow(x, y / 2, mod)) % mod;
if (y % 2 == 0)
return (temp * temp) % mod;
else
return (((x * temp) % mod) * temp) % mod;
}
void solve(int tno) {
int n; cin >> n;
int prev = 0;
int ans = 0;
for(int i = 0; i < n; i ++) {
int a; cin >> a;
ans += (n - 1) * a * a;
ans -= 2 * a * prev;
prev += a;
}
cout << ans << endl;
}
int32_t main() {
FASTIO
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
// cin >> t;
t = 1;
for (int i = 1; i <= t; i ++)
solve(i);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define int int64_t
#define rep(n) for(ll i=0;i<n;i++)
#define rrep(n) for(ll i=n-1;i>=0;i--)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define coutArray(a,n) for(int i = 0; i < n; i++){cout << a[i] << " ";};cout << endl;
#define ld long double
#define PI 3.141592653589793238
#define srt(v) sort(v.begin(),v.end())
#define all(v) v.begin(), v.end()
int32_t main(){
FAST
int t=1;
//cin >> t;
while(t--){
int n,m; cin >> n >> m;
int a[n][m];
int x = 1e9;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin >> a[i][j];
x=min(x,a[i][j]);
}
}
int sum=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
sum+=abs(a[i][j]-x);
}
}
cout << sum << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w ;
cin >> h >> w;
vector<int> a(h*w);
int m = 1000;
for(int i =0; i<(h*w); i++)
{
cin >> a[i];
if(m > a[i])
m=a[i];
}
int t = 0;
for(int i =0; i<(h*w); i++)
{
t+= a[i]-m;
}
cout << t << endl;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include<string>
using namespace std;
#define boost ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
long long n,m;
string s,st;
std::vector<pair<long long,long long>> a,b;
void get_values()
{
long long x,y;
std::cin >> n;
for(int i=0;i<n;i++)
{
std::cin >> x >> y;
a.push_back({x,i+1});
b.push_back({y,i+1});
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
//std::cin >> s;
//n=s.length();
}
void solve()
{
long long i,j,t,ans=0,x,y,xp,yp;
x=a[0].first;y=b[0].first;
xp=a[0].second;yp=b[0].second;
if(xp!=yp)
std::cout << max(y,x) << std::endl;
else
{
long long x1,y1;
x1=a[1].first;y1=b[1].first;
ans=x+y;
ans=min(ans,max(x1,y));
ans=min(ans,max(x,y1));
std::cout << ans << std::endl;
}
}
int main() {
boost;
get_values();
solve();
return 0;
} | /*
ID: Λινδα
LANG: C++
TASK: abc194a
*/
#include <stdio.h>
#include <algorithm>
using namespace::std;
int read(){char c=getchar();int t=0,f=1;while(c<'0'||c>'9'){if(c=='-'){f=-1;}c=getchar();}while(c>='0'&&c<='9'){t=(t<<1)+(t<<3)+(c^48);c=getchar();}return t*f;}
void write(int x){char ch[50];int l=0;if(x<0){putchar('-');x=-x;}do{ch[l++]=x%10+'0';x=x/10;}while(x);while(l){putchar(ch[--l]);}}
struct wrkr
{
int id,tm;
};
bool cmpr(wrkr x,wrkr y)
{
return x.tm<y.tm;
}
int main()
{
// freopen("main.in","r",stdin);
// freopen("main.out","w",stdout);
// freopen("main.err","w",stderr);
int i,n=read();
wrkr a[1004],b[1004];
for(i=0;i!=n;++i)
{
a[i].tm=read();
a[i].id=i;
b[i].tm=read();
b[i].id=i;
}
sort(a,a+n,cmpr);
sort(b,b+n,cmpr);
if(a[0].id==b[0].id)
{
write(min(a[0].tm+b[0].tm,min(max(a[0].tm,b[1].tm),max(a[1].tm,b[0].tm))));
}
else
{
write(max(a[0].tm,b[0].tm));
}
putchar('\n');
// fclose(stdin);
// fclose(stdout);
// fclose(stderr);
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
cout << (n + 100) / 100 * 100 - n << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
// AtCoder
// #include <atcoder/all>
// using namespace atcoder;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...)
#endif
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (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 (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;
int main (void)
{
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
int a = 0;
rep (i, s.size() - 3) {
if (s.substr(i, 4) == "ZONe") ++a;
}
cout << a << "\n";
return 0;
} |
#include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boost ios_base::sync_with_stdio(0)
#define forp(i,a,b) for(ll i=a;i<=b;i++)
#define rep(i,n) for(ll i=0;i<n;++i)
#define ren(i,n) for(ll i=n-1;i>=0;i--)
#define forn(i,a,b) for(ll i=a;i>=b;i--)
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(); i != (c).end();
#define sc(x) scanf("%lld",&x)
#define clr(x,val) memset(x,val,sizeof(x))
#define pr(x) printf("%lld\n",x)
#define pdd pair<dd,dd>
#define read_arr(a,n) for(ll i=1;i<=n;i++)cin>>a[i];
#define init_arr(a,n) for(ll i=1;i<=n;i++)a[i]=n-i+1;
#define prec(x) cout<<fixed<<setprecision(x)
#define fre freopen("input.txt","r",stdin),freopen("output.txt","w",stdout)
#define arr array
using namespace std;
void solve(){
string s;
cin>>s;
for(ll i=1;i<=3;i++){
cout<<s[i%3];
}
}
int main(){
boost;
ll t=1;
while(t--){
solve();
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define all(c) begin(c), end(c)
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a >= b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
#define debug(v) cout<<#v<<": ",prt(v);
template <typename A,typename B>
inline void prt(pair<A,B> p){cout<<"("<<p.first<<", "<<p.second<<")\n";}
template <typename A,typename B,typename C>
inline void prt(tuple<A,B,C> p){cout<<"("<<get<0>(p)<<", "<<get<1>(p)<<", "<<get<2>(p)<<")\n";}
inline void prt(bool p){if(p)cout<<"True"<<'\n';else cout<<"False"<<'\n';}
template <typename T>
inline void prt(vector<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template<typename T>
inline void prt(vector<vector<T> >& vv){ for(const auto& v : vv){ prt(v); } }
template <typename T>
inline void prt(deque<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(unordered_map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(set<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(multiset<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
/*
1 indexの分引く
2 Bを番号ごとqueueに入れてマッチングする
3 転倒数を求める
*/
template<typename T> class BIT {
private:
int n;
vector<T> bit;
public:
// 0_indexed で i 番目の要素に x を加える
void add(int i, T x){
i++;
while(i < n){
bit[i] += x, i += i & -i;
}
}
// 0_indexed で [0,i] の要素の和(両閉区間！！)
T sum(int i){
i++;
T s = 0;
while(i > 0){
s += bit[i], i -= i & -i;
}
return s;
}
BIT(){}
//初期値がすべて0の場合
BIT(int sz) : n(sz+1), bit(n, 0){}
BIT(const vector<T>& v) : n((int)v.size()+1), bit(n, 0){
for(int i = 0; i < n-1; i++){
add(i,v[i]);
}
}
void print(){
for(int i = 0; i < n-1; i++){
cout << sum(i) - sum(i-1) << " ";
}
cout << "\n";
}
//-1スタート
void print_sum(){
for(int i = 0; i < n; i++){
cout << sum(i-1) << " ";
}
cout << "\n";
}
};
// u を昇順にソートするのに必要な交換回数(転倒数) (u は {0,..., n-1} からなる重複を許した長さ n の数列)
long long inv_count(const vector<ll>& u)
{
int n = (ll)u.size();
BIT<ll> bt(n);
long long ans = 0;
for(int i = 0; i < n; i++){
ans += i - bt.sum(u[i]);
bt.add(u[i], 1);
}
return ans;
}
int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n;
cin >> n;
vector<ll>a(n),b(n);
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
vector<ll>newb(n);
map<ll,queue<ll> >mp;
rep(i,n){
newb[i]=b[i]-(n-1-i);
ll newa = a[i]-(n-1-i);
mp[newa].push(i);
}
vector<ll>tento(n);
rep(i,n){
if(mp[newb[i]].empty()){
cout << -1 << endl;
return 0;
}
tento[i]=mp[newb[i]].front();mp[newb[i]].pop();
}
ll ans = inv_count(tento);
cout << ans << endl;
return 0;
} |
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#define all(v) begin(v), end(v)
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
using namespace std;
template <class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return true; } return false; }
template <class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return true; } return false; }
template <class S> using pqg = priority_queue<S, vector<S>, greater<S>>;
template <class S> using pq = priority_queue<S>;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pi = pair<int,int>;
using pl = pair<ll, ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvpi = vector<vpi>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MAX = 500000;
const ll INF = 1000000000;
const ll INFLL = 1000000000000000000;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator+=(const mint& a) {
x += a.x;
if (x >= MOD) x -= MOD;
return *this;
}
mint operator-=(const mint& a) {
if (x < a.x) x += MOD;
x -= a.x;
return *this;
}
mint operator*=(const mint& a) {
x = x * a.x % MOD;
return *this;
}
mint operator/=(const mint& a) { return *this *= a.inv(); }
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 operator/(const mint& a) const { return mint(*this) /= a; }
mint inv(void) const { return pow(MOD - 2); }
mint pow(ll a) const {
if (!a) return 1;
mint t = pow(a >> 1);
t *= t;
if (a & 1) t *= (*this);
return t;
}
friend ostream& operator<<(ostream& os, const mint& a) {
os << a.x;
return os;
}
};
struct UnionFind {
vector<int> parent, siz;
UnionFind(int n) : parent(n), siz(n, 1) {
for (int i = 0; i < n; ++i) parent[i] = i;
}
int root(int x) {
if (parent[x] == x) return x;
return parent[x] = root(parent[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] > siz[y]) swap(x, y);
siz[y] += siz[x];
parent[x] = y;
return true;
}
int size(int x) {
return siz[root(x)];
}
bool same(int x, int y) {
return root(x) == root(y);
}
};
int main(void) {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
int ans = 0;
UnionFind uf(MAX);
rep(i, n / 2) {
if (uf.same(a[i], a[n-i-1]))
continue;
uf.unite(a[i], a[n-i-1]);
++ans;
}
cout << ans << endl;
return (0);
}
| #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
typedef long long ll;
using namespace std;
using P=pair<int,int>;
struct unionfind {
vector<int> d;
unionfind(int n=0): d(n,-1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x,y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return find(x) == find(y);}
int size(int x) { return -d[find(x)];}
};
int main()
{
int n;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
int m=200000;
unionfind d(m);
rep(i,n/2+1) d.unite(a[i],a[n-1-i]);
int ans=0;
rep(i,m){
if(d.find(i)!=i) continue;
ans+=d.size(i)-1;
}
cout<<ans<<endl;
return 0;
} |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <tuple>
#include <queue>
#include <vector>
// 距離、x座標、y座標
using vertex = std::tuple<int, int, int>;
std::pair<std::string, int> dijkstra(int, int, int, int);
void interact(int);
void modify_distance(const std::string &, int, int, int, int);
int rev(char);
const int dx[]{1, 0, -1, 0}, dy[]{0, 1, 0, -1};
const char dir[]{'D', 'R', 'U', 'L'};
constexpr int INVALID = -1;
// 道の長さ
int d_road[30][30][4];
// 文字を方向のインデックスに変換
int rev(char c)
{
switch (c)
{
case 'D':
return 0;
case 'R':
return 1;
case 'U':
return 2;
case 'L':
return 3;
}
abort();
}
// ダイクストラ法で最短経路を求める
std::pair<std::string, int> dijkstra(int si, int sj, int ti, int tj)
{
// 距離の初期化
int distance[30][30];
for (int i = 0; i < 30; i++)
{
for (int j = 0; j < 30; j++)
{
distance[i][j] = 1e9;
}
}
// ダイクストラ法
std::priority_queue<vertex, std::vector<vertex>, std::greater<vertex>> q;
q.emplace(0, si, sj);
while (not q.empty())
{
auto [d0, x, y] = q.top();
q.pop();
if (d0 >= distance[x][y])
{
continue;
}
distance[x][y] = d0;
if (x == ti and y == tj)
{
break;
}
for (int i = 0; i < 4; i++)
{
int d = d_road[x][y][i], x_next = x + dx[i], y_next = y + dy[i];
if (d == INVALID or d0 + d >= distance[x_next][y_next])
{
continue;
}
q.emplace(d0 + d, x_next, y_next);
}
}
// 経路復元
std::string res;
int x = ti, y = tj;
while (x != si or y != sj)
{
for (int i = 0; i < 4; i++)
{
int d = d_road[x][y][i], x_prev = x + dx[i], y_prev = y + dy[i];
if (d == INVALID)
{
continue;
}
if (distance[x][y] == distance[x_prev][y_prev] + d)
{
res.push_back(dir[(i + 2) % 4]);
x = x_prev;
y = y_prev;
break;
}
assert(i != 3);
}
}
std::reverse(res.begin(), res.end());
return {res, distance[ti][tj]};
}
// 道の長さの補正
void modify_distance(const std::string &route, int error, int si, int sj, int query)
{
const int n = route.size();
error *= pow(0.9996, query) / n;
int x = si, y = sj;
for (int i = 0; i < n; i++)
{
int k = rev(route[i]);
d_road[x][y][k] += error;
if (d_road[x][y][k] <= 0)
{
d_road[x][y][k] = 1;
}
x += dx[k];
y += dy[k];
k = (k + 2) % 4;
d_road[x][y][k] += error;
if (d_road[x][y][k] <= 0)
{
d_road[x][y][k] = 1;
}
}
}
// クエリに応答
void interact(int query)
{
int si, sj, ti, tj;
std::cin >> si >> sj >> ti >> tj;
auto [route, estimate] = dijkstra(si, sj, ti, tj);
std::cout << route << std::endl;
int response;
std::cin >> response;
modify_distance(route, response - estimate, si, sj, query);
}
int main()
{
// 道路の長さの初期値
for (int i = 0; i < 30; i++)
{
for (int j = 0; j < 30; j++)
{
for (int k = 0; k < 4; k++)
{
int i_next = i + dx[k], j_next = j + dy[k];
if (i_next < 0 or 30 <= i_next or j_next < 0 or 30 <= j_next)
{
d_road[i][j][k] = INVALID;
}
else
{
d_road[i][j][k] = 1;
}
}
}
}
// クエリに応答
for (int query = 0; query < 1000; query++)
{
interact(query);
}
return 0;
}
| #pragma warning(disable:6385)
#define _USE_MATH_DEFINES
#include <cassert>
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <chrono>
#include <fstream>
#include <array>
#include <set>
#include <map>
using namespace std;
using namespace chrono;
using ll = long long;
using uint = unsigned int;
#ifdef LOCAL
#define ASSERT_DEBUG
#endif
#ifdef ASSERT_DEBUG
void ASSERT(bool b)
{
if (!b)
{
__debugbreak();
}
assert(b);
}
#else
void ASSERT(bool b) {}
#endif
class Point
{
public:
int x;
int y;
Point() { x = 0; y = 0; }
Point(int x, int y) { this->x = x; this->y = y; }
Point operator + (const Point& pt) const
{
return Point(x + pt.x, y + pt.y);
}
Point operator - (const Point& pt) const
{
return Point(x - pt.x, y - pt.y);
}
bool Equals(const Point& pt) const
{
return x == pt.x && y == pt.y;
}
bool Equals(int x, int y) const
{
return this->x == x && this->y == y;
}
};
unsigned int xorshift32()
{
static int s = 7;
s ^= (s << 13);
s ^= (s >> 17);
s ^= (s << 15);
return s;
}
int main()
{
for (int i = 0; i < 1000; i++)
{
int sx, sy, tx, ty;
cin >> sy >> sx >> ty >> tx;
if (sx < tx)
{
for (int j = 0; j < tx - sx; j++)
{
cout << "R";
}
}
else if (sx > tx)
{
for (int j = 0; j < sx - tx; j++)
{
cout << "L";
}
}
if (sy < ty)
{
for (int j = 0; j < ty - sy; j++)
{
cout << "D";
}
}
else if (sy > ty)
{
for (int j = 0; j < sy - ty; j++)
{
cout << "U";
}
}
cout << endl;
cout.flush();
int length;
cin >> length;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep0(i, n) for (ll i = 0; i <= (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define rrep0(i, n) for (ll i = (n); i >= 0; --i)
#define srep(i, s, t) for (ll 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 uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cerr << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
constexpr ll MAX = 200000;
int main()
{
ll n, ans = 0;
ll sum = 1e10;
string k;
cin >> n >> k;
if (n == 1)
{
if (k.at(0) == '0')
ans = sum;
else
ans = 2 * sum;
}
else
{
if (k.at(0) == '1' && k.at(1) == '1')
{
bool ok = true;
rep(i, n)
{
if (i % 3 == 0)
if (k.at(i) != '1')
ok = false;
if (i % 3 == 1)
if (k.at(i) != '1')
ok = false;
if (i % 3 == 2)
if (k.at(i) != '0')
ok = false;
}
if (ok)
ans = sum - (n + 2) / 3 + 1;
}
else if (k.at(0) == '1' && k.at(1) == '0')
{
bool ok = true;
rep(i, n)
{
if (i % 3 == 0)
if (k.at(i) != '1')
ok = false;
if (i % 3 == 1)
if (k.at(i) != '0')
ok = false;
if (i % 3 == 2)
if (k.at(i) != '1')
ok = false;
}
if (ok)
ans = sum - (n + 3) / 3 + 1;
}
else if (k.at(0) == '0' && k.at(1) == '1')
{
bool ok = true;
rep(i, n)
{
if (i % 3 == 0)
if (k.at(i) != '0')
ok = false;
if (i % 3 == 1)
if (k.at(i) != '1')
ok = false;
if (i % 3 == 2)
if (k.at(i) != '1')
ok = false;
}
if (ok)
ans = sum - (n + 4) / 3 + 1;
}
else
ans = 0;
}
cout << ans << endl;
} | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#define pf push_front
#define pb push_back
#define pop_f pop_front
#define pop_b pop_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()
#ifdef DEBUG
#else
#define cerr if (false) cerr
#endif
template <typename T> istream& operator>>(istream& in, vector <T>& a) {for (auto& i : a) in >> i; return in;}
template <typename T> ostream& operator<<(ostream& out, vector <T>& a) {for (auto& i : a) out << i << " "; return out;}
template <typename T, typename U> void chkmin(T& a, U b) {if (a > b) a = b;}
template <typename T, typename U> void chkmax(T& a, U b) {if (a < b) a = b;}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
cin >> a;
map<int, int> mp;
forn (i, 0, n) {
mp[a[i]]++;
}
vector<vector<int>> boxes(k);
for (auto [val, cnt] : mp) {
int lst = 0;
forn (i, 0, cnt) {
boxes[lst].pb(val);
lst = (lst + 1) % k;
}
}
long long ans = 0;
forn (i, 0, k) {
vector<bool> used(boxes[i].size() + 1);
for (int j : boxes[i])
if (j < used.size())
used[j] = true;
forn (j, 0, sz(used)) {
if (!used[j]) {
ans += j;
break;
}
}
}
cout << ans << "\n";
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
string s;
cin>>s;
ll i;
ll pref[s.length()+1]={0};
ll j;
for(i=0;i<s.length();i++)
{
if(s[i]=='A')
{
pref[i+1]=pref[i]+6000;
}
else if(s[i]=='T')
{
pref[i+1]=pref[i]-6000;
}
else if(s[i]=='C')
{
pref[i+1]=pref[i]+1;
}
else
{
pref[i+1]=pref[i]-1;
}
}
ll ans=0;
for(i=0;i<=s.length();i++)
{
for(j=i+1;j<=s.length();j++)
{
if(pref[j]-pref[i]==0)
{
ans++;
}
}
}
cout<<ans<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return result;
}
int gcd(int a,int b)
{
if(b==0)
{
return a;
}
return gcd(b,a%b);
}
void sieve()
{
memset(isPrime,1,sizeof(isPrime));
isPrime[0] = isPrime[1] = 0;
for(int i=2;i*i<=1000000;i++)
{
if(isPrime[i])
{
for(int j=i*i;j<=1000000;j+=i)
{
isPrime[j] = 0;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
int t,n;
t = 1;
for(int i=0;i<t;i++)
{
int n;
string s;
cin>>n>>s;
ll ans = 0;
unordered_map <char,ll> mp;
mp['A'] = 100000000000000;
mp['T'] = -100000000000000;
mp['C'] = 20000000000;
mp['G'] = -20000000000;
unordered_map <int,int> mpp;
mpp[0] = 1;
ll sum = 0;
for(int i=0;i<n;i++)
{
sum+=mp[s[i]];
mpp[sum]++;;
}
for(auto i = mpp.begin();i!=mpp.end();i++)
{
ans+=((i->second)*(i->second-1))/2;
}
cout<<ans;
}
return 0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
const int MOD = 1e9 + 7;
char a[2005][2005];
int hc[2005][2005];
int wc[2005][2005];
int two[4000005];
int main()
{
int h, w;
scanf("%d%d", &h, &w);
for (int i = 0; i < h; i++) {
scanf("%s", a[i]);
}
int tidy = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == '.') {
tidy++;
if (i - 1 >= 0) {
hc[i][j] = hc[i - 1][j] + 1;
} else {
hc[i][j] = 1;
}
if (j - 1 >= 0) {
wc[i][j] = wc[i][j - 1] + 1;
} else {
wc[i][j] = 1;
}
}
}
}
for (int i = h - 1; i >= 0; i--) {
for (int j = w - 1; j >= 0; j--) {
if (a[i][j] == '#') continue;
if (i + 1 <= h - 1) hc[i][j] = max(hc[i][j], hc[i + 1][j]);
if (j + 1 <= w - 1) wc[i][j] = max(wc[i][j], wc[i][j + 1]);
}
}
two[0] = 1;
for (int i = 1; i < 4000005; i++) {
two[i] = two[i - 1] * 2 % MOD;
}
long long ans = two[tidy];
ans = ans * tidy % MOD;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == '#') continue;
long long tmp = tidy - (hc[i][j] + wc[i][j] - 1);
ans -= two[tmp];
if (ans < 0) ans += MOD;
}
}
printf("%lld\n", ans);
return 0;
}
| #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%d",&x,&y)
#define P(x) printf("%d\n",x)
#define all(v) v.begin(),v.end()
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
typedef long long int LL;
typedef pair<int, int > pii;
typedef vector<int > vi;
const int N = 2001;
const int INF = 100000000;
int n,m;
string s[N];
int dp[N][N][2];
int getval(int x, int y) {
if(s[x][y] == '+') return 1;
return -1;
}
int solve(int x, int y, int p) {
if(x == n - 1 && y == m - 1) {
return 0;
}
int &res = dp[x][y][p];
if(res != INF) {
return res;
}
if(p == 0) {
res = -N * N;
} else {
res = N * N;
}
if(x + 1 < n) {
if(p == 0) {
res = max(res, getval(x + 1, y) + solve(x + 1, y, p ^ 1));
} else {
res = min(res, -getval(x + 1, y) + solve(x + 1, y, p ^ 1));
}
}
if(y + 1 < m) {
if(p == 0) {
res = max(res, getval(x, y + 1) + solve(x, y + 1, p ^ 1));
} else {
res = min(res, -getval(x, y + 1) + solve(x, y + 1, p ^ 1));
}
}
return res;
}
int main() {
S2(n,m);
rep(i,0,n) {
cin >> s[i];
}
rep(i,0,N) rep(j,0,N) {
dp[i][j][0] = dp[i][j][1] = INF;
}
int x = solve(0, 0, 0);
if(x > 0) printf("Takahashi\n");
else if(x < 0) printf("Aoki\n");
else printf("Draw\n");
return 0;
}
|
#include"bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())
#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)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int LARGE_INT = 1e9+100;
const int INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const int MOD = 1e9+7;
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
LL modpow(LL a, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
void Main()
{
LL n;cin>>n;
string s;cin>>s;
s = "X"+s;
VL a(n+1);
VL t(n+1);
VL c(n+1);
VL g(n+1);
FOR(i,1,n+1){
if(s[i] == 'A'){
a[i]=1;
}
if(s[i] == 'T'){
t[i]=1;
}
if(s[i] == 'C'){
c[i]=1;
}
if(s[i] == 'G'){
g[i]=1;
}
a[i] += a[i-1];
t[i] += t[i-1];
c[i] += c[i-1];
g[i] += g[i-1];
}
LL result = 0;
FOR(i,0,n){
FOR(j,i+1,n+1){
LL na = a[j]-a[i];
LL nt = t[j]-t[i];
LL nc = c[j]-c[i];
LL ng = g[j]-g[i];
if(na==nt && nc==ng){
result ++;
//cerr<<i<<" "<<j<<endl;
}
}
}
cout<<result<<endl;
return;
}
int main()
{
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i < N; ++i) {
int c1 = 0, c2 = 0;
for (int j = i; j < N; ++j) {
if (S[j] == 'A')
c1++;
else if (S[j] == 'T')
c1--;
else if (S[j] == 'C')
c2++;
else
c2--;
if (c1 == 0 && c2 == 0) ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=0;
bool flag=1;
char s[100005];
char head,tail;
cin>>n>>s;
if(n==2)
{
if(s[0]==s[1])
ans=-1;
else
ans=1;
}
else if(n==3)
{
if(s[0]!=s[2])
ans=1;
else
ans=-1;
}
else//n>3
{
if(s[0]!=s[n-1])
ans=1;
else
{
for(int i=2;i<=n-2;i++)
{
if(s[n-1-i]!=s[0] && s[n-i]!=s[0])
{
ans=2;
flag=0;
break;
}
}
if(flag)
ans=-1;
}
}
cout<<ans<<endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
#define rprintf(fmt, begin, end) do { const auto end_rp = (end); auto it_rp = (begin); for (bool sp_rp=0; it_rp!=end_rp; ++it_rp) { if (sp_rp) putchar(' '); else sp_rp = true; printf(fmt, *it_rp); } putchar('\n'); } while(0)
int N;
int A[200011];
int B[200011];
int U[400011];
int V[400011];
int E[400011];
int root(int x) {
return x == U[x]? x: U[x] = root(U[x]);
}
void MAIN() {
scanf("%d", &N);
REP (i, 400011) {
U[i] = i;
V[i] = 1;
}
REP (i, N) {
int a, b;
scanf("%d%d", &a, &b);
a = root(a);
b = root(b);
if (a != b) {
U[b] = a;
V[a] += V[b];
E[a] += E[b];
}
E[a]++;
}
int ans = 0;
REP (i, 400011) if (U[i] == i) {
ans += min(V[i], E[i]);
}
printf("%d\n", ans);
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}
else{
return par[a]=find(par[a]);
}
}
bool same(ll a,ll b){
return (find(a)==find(b));
}
ll size(ll a){
return -par[find(a)];
}
void unite(ll a,ll b){
ll c=find(a),d=find(b);
if(c==d)
return;
if(size(c)<size(d)){
swap(c,d);
}
par[c]+=par[d];
par[d]=c;
}
};
ll euclidean_gcd(ll a, ll b) {
if(a < b) return euclidean_gcd(b, a);
ll r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
ll euclidean_lcm(ll a, ll b) {
return a/euclidean_gcd(a,b)*b;
}
int main(void){
ll k,s=0;
cin >> k;
rep(i,k){
rep(j,k){
if((i+1)*(j+1)>k)break;
s+=k/((i+1)*(j+1));
}
}
cout << s << endl;
} | /***** In the name of Allah, the Most Gracious, the Most Merciful *****/
#include<bits/stdc++.h>
using namespace std;
#define Allahu_Akbar ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
int main()
{
Allahu_Akbar
//freopen("input.txt", "r", stdin);
int k;
cin >> k;
long long int total = 0;
for(int i = 1; i<=k; i++)
{
for(int j = 1; i * j<=k; j++)
{
for(int l = 1; i * j * l<=k; l++)
{
if((i * j * l) <= k) total++;
}
}
}
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
vector<vector<ll>> near8={{-1,1},{0,1},{1,1},{-1,0},{1,0},{-1,-1},{0,-1},{1,-1}};
vector<vector<ll>> near4={{0,1},{-1,0},{1,0},{0,-1}};
bool ll_sqrt(ll x, ll& lower_bound, ll& upper_bound)
{
constexpr ll ll_max = numeric_limits<ll>::max();
bool first_boost = true;
lower_bound = 0;
upper_bound = x;
while (upper_bound - lower_bound > 1)
{
if (first_boost)
{
ll guess = (ll)sqrt((double)x);
lower_bound = max(guess - 1, (ll)0);
upper_bound = lower_bound + 3;
first_boost = false;
}
ll newval = (lower_bound + upper_bound) / 2;
if ((newval != 0) && (newval > ll_max / newval)) // newval*newval becomes overflow
upper_bound = newval; // because overflow means newval is too big
else
{
ll newval_sqr = newval * newval;
if (newval_sqr < x)
lower_bound = newval;
else
upper_bound = newval;
}
}
if ((upper_bound != 0) && (upper_bound > ll_max / upper_bound))
{
if (lower_bound * lower_bound == x)
upper_bound = lower_bound;
}
else
{
if (lower_bound * lower_bound == x)
upper_bound = lower_bound;
else if (upper_bound * upper_bound == x)
lower_bound = upper_bound;
}
bool is_exact = (lower_bound == upper_bound);
return is_exact;
}
ll ll_ceil(ll x, int digit);
ll ll_floor(ll x, int digit);
ll ll_floor(ll x, int digit)
{
if (x < 0)
return -ll_ceil(-x, digit);
ll div = 1;
while (digit != 0)
{
div *= 10;
digit--;
}
ll modval = x % div;
ll ans = x - modval;
return ans;
}
ll ll_ceil(ll x, int digit)
{
if (x < 0)
return -ll_floor(-x, digit);
ll div = 1;
while (digit != 0)
{
div *= 10;
digit--;
}
ll modval = x % div;
ll ans = x - modval;
if (modval != 0)
ans += div;
return ans;
}
ll H,W;
vector<vector<char>> map1(501, vector<char>(501,'#'));
bool solve(ll h, ll w){
ll nexth=0;
ll nextw=0;
for(vector<ll> to:near4){
nexth = h+to[0];
nextw = w+to[1];
if(nexth < 0 || nexth >=H || nextw < 0 || nextw >=W || map1[nexth][nextw] == '#'){
continue;
}
if(map1[nexth][nextw] =='g'){
return true;
}
map1[nexth][nextw]='#';
if(solve(nexth, nextw)){
return true;
};
}
return false;
}
int main() {
ll N;
cin >> N;
N--;
ll ans = N/100 +1;
cout << ans << endl;
return 0;
} | #include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const double eps = 1e-7;
const int MAXN = 1e5 + 5;
double a[MAXN];
double ans;
int n;
double calc(double now) {
double res = 0;
for(int i = 1; i <= n; i++) {
res += (now + a[i] - min(a[i], 2 * now)) / n;
}
return res;
}
double Thr_Div() {
double l = 0, r = 1e9;
while(r - l >= eps) {
double midl = l + (r - l) / 3;
double midr = r - (r - l) / 3;
if(calc(midl) < calc(midr))
r = midr;
else
l = midl;
}
return calc(l);
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%lf", &a[i]);
printf("%.6lf", Thr_Div());
return 0;
} |
/*Rabbi Zidni Ilma*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld %lld",&n,&m)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define mod 1000000007
#define read freopen("input.txt","r",stdin)
#define write freopen("output.txt","w",stdout)
int main()
{
ll n,i,sum=0;
cin >> n;
for(i=1;i<=n;i++)
{
sum+=i;
if(sum>=n+1)
break;
}
if(sum==n+1)
printf("%lld\n",n+1-i);
else
printf("%lld\n",n+2-i);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define double long double
#define x first
#define y second
#define vi vector <int>
#define L nod<<1
#define R ((nod<<1)|1)
#define int ll
#define pi pair<int, int>
#define PI 3.1415926
const ll mod=998244353;
int n, ans;
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
cin >> n;
ans = n;
int cur = 1;
while(n+1 >= cur){
n -= cur;
// cout << cur << " " << n+1 << endl;
cur++;
}
cur--;
ans -= (cur-1);
cout << ans;
}
|
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long int
#define ld long double
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define removeDuplicates(a) a.resize(unique(all(a))-a.begin())
#define endl '\n'
#define setbits(x) (__builtin_popcount(x))
int mod=1000000007;
int INF64=mod*mod+1;
void solve(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
int curr=0,pref=0,maxpref=0,ans=0;
for(int i=0;i<n-1;i++){
pref+=a[i];
curr+=pref;
ans=max(ans,curr+maxpref);
maxpref=max(maxpref,pref);
}
ans=max(ans,curr+pref+a[n-1]);
cout<<ans<<endl;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int T=1;
// cin>>T;
for(int i=1;i<=T;i++){
// cout<<"Case #"<<i<<": ";
solve();
}
cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
} | #include <bits/stdc++.h>
using namespace std;
int n;
int main(){
int i,all = 1;
cin >> n;
while (all < n) all <<= 1;
all -= 1;
for (i = 0; i < n; ++i){
int lc = all&(i<<1),rc = all&(i<<1|1);
if (lc >= n) lc -= (all+1)>>1;
if (rc >= n) rc -= (all+1)>>1;
++lc,++rc;
cout << lc << ' ' << rc << '\n';
}
return 0;
} |
// execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// use set_function + find_by_order(select itr-num)
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
template<class T>inline bool chmax(T &a, T b) {if(a < b) {a = b;return true;}return false;}
template<class T>inline bool chmin(T &a, T b) {if(a > b) {a = b;return true;}return false;}
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
char Alpha[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
//cout << std::fixed << std::setprecision(15) << y << endl; //小数表示
const ll MAX = 3000000; //テーブルの数
const ll MOD = 1e9+7; //mod宣言
long long fac[MAX], finv[MAX], inv[MAX];
// finv ->階乗割り算
// fac ->階乗掛け算
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return (fac[n] * (finv[k] * finv[n - k] % MOD)) % MOD;
}
int main(){
COMinit();
ll n, m, k; cin >> n >> m >> k;
if(n > m + k){
cout << 0 << endl;
return 0;
}
ll mid = 0;
cout << (COM(n+m, n) + MOD - COM(n+m, m+k+1)) % MOD << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<ll>;
using istack = stack<int>;
using iqueue = queue<int>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
vector<iPair> dir = {{1,0}, {-1,0}, {0,1}, {0,-1}};
#define dump(x) cout << #x << " = " << (x) << endl
#define ALL(x) begin(x),end(x)
#define rep(i,s,e) for(ll i=(ll)(s), i_stop=(ll)(e); i<i_stop; ++i)
#define range(i,s,n) for(ll i=(ll)(s), i_stop=(ll)((s)+(n)); i<i_stop; ++i)
#define foreach(x,container) for(auto &&x:container)
template<typename S, typename T> bool chmax(T& a, S b) {b = (T)b; if(a<b) {a=b;return true;} return false;}
template<typename S, typename T> bool chmin(T& a, S b) {b = (T)b; if(a>b) {a=b;return true;} return false;}
template<typename T> void printArr(vector<T> &arr){
for(auto &x:arr) {cout << x << " ";} cout << endl;
}
// =====================================================>
void solve() {
ll a,b,c,d; cin>>a>>b>>c>>d;
if(b >= d*c) cout<<-1<<endl;
else {
ll x = d*c-b;
if(a%x) cout<<(a/x+1)<<endl;
else cout<<a/x<<endl;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} |
#include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(10)
#define elif else if
// #define input(type,n) type n;cin>>n
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//最大公約数
template<typename T>
T gcd(T a, T b) {
if (a % b == 0) {
return(b);
}
else {
return(gcd(b, a % b));
}
}
//最小公倍数
template<typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
bool isLarger(string s,string t){
/*SのほうがTより大きければtrue*/
rep(i,min(s.length(),t.length())){
if(s[i]>t[i]){
return true;
}
if(s[i]<t[i]){
return false;
}
}
if(s.length()>t.length()){
return true;
}
else{
return false;
}
}
ll f(ll k){
string s=to_string(k);
ll ans=0;
rep(i,s.length()){
ll j=s[i]-'0';
ans+=pow(k,s.length()-i-1)*j;
}
return ans;
}
int main(void){
string a,b;
cin>>a>>b;
ll a_=0;
ll b_=0;
for(char c:a){
a_+=c-'0';
}
for(char c:b){
b_+=c-'0';
}
cout<<max(a_,b_);
}
/*
*/
| //#include<bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <string.h>
#include <vector>
#include <utility>
#include <map>
//#pragma GCC optimize "trapv"
//#define int long long
#define For(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define F first
#define S second
#define dracarys ios_base::sync_with_stdio(false);cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define TEST_CASE int t;cin>>t;while(t--)
#define debug(...) cout<<#__VA_ARGS__<<" = "; print(__VA_ARGS__);
using namespace std;
const int MOD = 1e9 + 7;
void print() { cout<<endl; }
void printArray() { return; }
void read() { return; }
template<typename T , typename... Args> void print(T a , Args... arg) { cout << a << " " ; print(arg...); }
template<typename T , typename... Args> void read(T &a , Args&... arg) { cin >> a; read(arg...); }
template<typename T,typename... Args> void read(vector<T>&v , Args&... arg) { for(auto &i : v) cin>>i; read(arg...); }
template<typename T,typename... Args> void printArray(vector<T>&v, Args&... arg) { for(auto i : v) cout<<i<<" "; cout<<endl; printArray(arg...); }
int power(int a,int b) { int res=1; while(b) { if(b&1LL) res=res*a; b>>=1LL; a=a*a; } return res; }
int modPower(int a,int b) { int res=1; while(b) { if(b&1L) res=(res%MOD*a%MOD)%MOD; b>>=1; a=(a%MOD*a%MOD)%MOD; } return res; }
int gcdExtended(int a,int b,int *x,int *y){ if(a==0) { *x=0,*y=1; return b; } int x1,y1; int gcd=gcdExtended(b%a,a,&x1,&y1); *x=y1-(b/a)*x1; *y = x1; return gcd; }
int modInverse(int b,int m) {int x,y; int g=gcdExtended(b,m,&x,&y); if (g != 1) return -1; return (x%m + m) % m; }
int modDivide(int a,int b,int m=MOD) { a=a%m; int inv=modInverse(b,m); if(inv==-1) return -1; else return (inv*a)%m; }
void runCase_()
{
string a,b; read(a,b);
int s1 = 0,s2 = 0;
for(char c : a) s1 += (c - '0');
for(char c : b) s2 += (c - '0');
if(s1 > s2) print(s1);
else print(s2);
}
signed main()
{
dracarys;
// TEST_CASE
runCase_();
return 0;
}
/** TEST CASES HERE **/
/*
*/
|
#include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x); rd(args...); }
#define fi first
#define se second
#define mkp std::make_pair
typedef long long ll;
typedef double ff;
typedef std::pair <int, int> pii;
const int kN = 3000 + 5, kInf = 0x3f3f3f3f;
const ll kMod = 998244353, kInfLL = 0x3f3f3f3f3f3f3f3fLL;
int n, k, A[kN][kN], fa[kN], siz[kN]; ll fac[kN];
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
void Merge(int x, int y) {
//printf("%d %d\n", x, y);
int f_x = Find(x), f_y = Find(y);
if(f_x == f_y) return;
fa[f_x] = f_y; siz[f_y] += siz[f_x];
}
void Init() {
fac[0] = 1;
for(int i = 1; i <= n * 2; ++i) {
fa[i] = i, siz[i] = 1;
fac[i] = fac[i - 1] * i % kMod;
}
}
int GetIdx(pii x) { return (x.fi - 1) * n + x.se; }
void Solve() {
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
bool flag = true;
for(int p = 1; p <= n; ++p)
if(A[i][p] + A[j][p] > k) flag = false;
//printf("%d\n", );
if(flag) Merge(i, j);
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
bool flag = true;
for(int p = 1; p <= n; ++p)
if(A[p][i] + A[p][j] > k) flag = false;
if(flag) Merge(i + n, j + n);
}
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("a.in", "r", stdin);
freopen("a.out", "w", stdout);
#endif
int T = 1; //rd(T);
while(T--) {
rd(n, k); Init();
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j) {
rd(A[i][j]);
//idx[(i - 1) * n + j] = mkp(i, j);
}
Solve();
ll ans = 1;
for(int i = 1; i <= n * n; ++i) if(fa[i] == i) {
ans = ans * fac[siz[i]] % kMod;
}
printf("%lld\n", ans);
} return 0;
} | #include "bits/stdc++.h"
using namespace std;
using str = string;
using db = double;
#define pf push_front
#define pb push_back
#define ef emplace_front
#define eb emplace_back
#define ist insert
#define ers erase
#define ppf pop_front()
#define ppb pop_back()
#define ft front()
#define bk back()
#define ety empty()
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define srt(v) sort(all(v));
#define rev(v) reverse(all(v));
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
#define fire(i, a, b) for (int (i) = (b) - 1; (i) >= (a); --(i))
template <class T>
inline int sz(T container) {
return int(container.size());
}
template <class T>
bool ckmin(T& a, const T& b) { // a = min(a, b)
return a > b ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) { // a = max(a, b)
return a < b ? a = b, 1 : 0;
}
template <class T>
void show(vector<T> v) {
for (auto a : v) { cout << a << ' '; } cout << '\n';
}
template <class T>
void show2d(vector<vector<T>> v) {
for (auto b : v) { for (auto a : b) { cout << a << ' '; } cout << '\n'; }
}
template <class T, class U>
void showPair(vector<pair<T, U>> v) {
for (auto a : v) { cout << a.F << ' ' << a.S << '\n'; }
}
const long long MOD[3] = {1000000007, 998244353, 9223372036854775807};
template <class T>
T modpow(T base, T exp, T mod) {
if (exp == 0) return 1 % mod;
T ans = modpow(base, exp / 2, mod);
ans *= ans; ans %= mod;
if (exp & 1) { ans *= base; ans %= mod; }
return ans;
}
vector<vector<tuple<int, long long, long long>>> adj(100000);
vector<long long> dis(100000, MOD[2]);
vector<bool> done(100000);
priority_queue<pair<long long, int>> q;
void solve() {
int n, m; cin >> n >> m;
ice (i, 0, m) {
int a, b, c, d; cin >> a >> b >> c >> d; --a, --b;
adj[a].eb(b, c, d); adj[b].eb(a, c, d);
}
dis[0] = 0;
q.emplace(0, 0);
while (!q.ety) {
int cur = q.top().S; q.pop();
if (done[cur]) continue;
done[cur] = true;
for (auto nxt : adj[cur]) {
int to; long long C, D; tie(to, C, D) = nxt;
auto until = (long long) floor(sqrt(double(D)));
if (dis[cur] < until) {
if (until + C + D / (until + 1) < dis[to]) {
dis[to] = until + C + D / (until + 1);
q.emplace(-dis[to], to);
}
} else {
if (dis[cur] + C + D / (dis[cur] + 1) < dis[to]) {
dis[to] = dis[cur] + C + D / (dis[cur] + 1);
q.emplace(-dis[to], to);
}
}
}
}
cout << (dis[n - 1] == MOD[2] ? -1 : dis[n - 1]);
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(17);
int tc = 1;
// cin >> tc;
while (tc--) {
solve();
}
} |
#define ll long long
#define dd long double
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
#define tri tuple<ll ,ll ,ll>
#define tll tuple<ll ,ll , ll , ll>
#define pll pair<ll ,ll>
#include<bits/stdc++.h>
/*#include<iomanip>
#include<cmath>
#include<cstdio>
#include<utility>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<bitset>*/
dd pi = acos(-1) ;
ll z = 1000000007 ;
ll inf = 100000000000000000 ;
ll p1 = 37 ;
ll p2 = 53 ;
ll mod1 = 202976689 ;
ll mod2 = 203034253 ;
ll fact[1000005] ;
ll gdp(ll a , ll b){return (a - (a%b)) ;}
ll ld(ll a , ll b){if(a < 0) return -1*gdp(abs(a) , b) ; if(a%b == 0) return a ; return (a + (b - a%b)) ;} // least number >=a divisible by b
ll gd(ll a , ll b){if(a < 0) return(-1 * ld(abs(a) , b)) ; return (a - (a%b)) ;} // greatest number <= a divisible by b
ll gcd(ll a , ll b){ if(b > a) return gcd(b , a) ; if(b == 0) return a ; return gcd(b , a%b) ;}
ll e_gcd(ll a , ll b , ll &x , ll &y){ if(b > a) return e_gcd(b , a , y , x) ; if(b == 0){x = 1 ; y = 0 ; return a ;}
ll x1 , y1 , g; g = e_gcd(b , a%b , x1 , y1) ; x = y1 ; y = (x1 - ((a/b) * y1)) ; return g ;}
ll power(ll a ,ll b , ll p){if(b == 0) return 1 ; ll c = power(a , b/2 , p) ; if(b%2 == 0) return ((c*c)%p) ; else return ((((c*c)%p)*a)%p) ;}
ll inverse(ll a ,ll n){return power(a , n-2 , n) ;}
ll max(ll a , ll b){if(a > b) return a ; return b ;}
ll min(ll a , ll b){if(a < b) return a ; return b ;}
ll left(ll i){return ((2*i)+1) ;}
ll right(ll i){return ((2*i) + 2) ;}
ll ncr(ll n , ll r){if(n < r|| (n < 0) || (r < 0)) return 0 ; return ((((fact[n] * inverse(fact[r] , z)) % z) * inverse(fact[n-r] , z)) % z);}
void swap(ll&a , ll&b){ll c = a ; a = b ; b = c ; return ;}
//ios_base::sync_with_stdio(0);
//cin.tie(0); cout.tie(0);
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>
// ordered_set s ; s.order_of_key(val) no. of elements strictly less than val
// s.find_by_order(i) itertor to ith element (0 indexed)
//__builtin_popcount(n) -> returns number of set bits in n
ll seed;
mt19937 rnd(seed=chrono::steady_clock::now().time_since_epoch().count()); // include bits
void solve()
{
ll n , m ;
cin >> n >> m ;
string str ;
ll even = 0 , odd = 0 ;
fo(i , n)
{
cin >> str ;
ll cnt = 0 ;
fo(j , m)
if(str[j] == '1')
cnt++ ;
if(cnt%2 == 0)
even++ ;
else
odd++ ;
}
cout << even*odd << '\n' ;
return ;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("inputf.txt" , "r" , stdin) ;
freopen("outputf.txt" , "w" , stdout) ;
freopen("errorf.txt" , "w" , stderr) ;
#endif*/
ll c ;
//cin >> c ;
c = 1 ;
for(ll x = 1 ; x <= c ; x++)
{
solve() ;
}
//cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
return 0;
} | // Created by ...
#include <bits/stdc++.h>
#define vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define sz(x) (int)(x).size()
#define rep(i,a,b) for(ll i = a; i <= b; ++i)
#define per(i,a,b) for(ll i = a; i >= b; --i)
#define pii pair<ll,ll>
#define vec(a) vector<a >
#define all(a) (a).begin(),(a).end()
#define EACH(x, a) for (auto& x:a)
#define se second
#define fi first
#define inf 0xffffffff
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
using ll = long long;
ll md=MD;
ll exp(ll a,ll b){ll r=1ll;while(b>0){if(b&1){r=r*(a%md);r=(r+md)%md;}b>>=1;a=(a%md)*(a%md);a=(a+md)%md;}return (r+md)%md;}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
template<class T> T Min(T a,T b){if(a<b)return a; return b;}
template<class T> T Max(T a,T b){if(a>b)return a; return b;}
string x,mstr;
int m,n;
string Add(string s,string t)
{
vll ans(Max(s.size(),t.size())+5,0);
reverse(all(s)); reverse(all(t));
rep(i,0,Max(s.size(),t.size())-1)
{
int x=0;
if(i<s.size())x+=(s[i]-'0');
if(i<t.size())x+=(t[i]-'0');
ans[i]=x;
}
rep(i,0,ans.size()-2)
{
int x=ans[i]/10;
ans[i+1]+=x;
ans[i]%=10;
}
int val;
reverse(all(ans));
rep(i,0,ans.size()-1)if(ans[i]!=0){val=i;break;}
string re="";
rep(i,val,ans.size()-1)re+=(ans[i]+'0');
return re;
}
string multiply(string s,int n){
if(n==0 || s.empty())return "0";
reverse(all(s));
string ans;
int carry=0;
for(char c:s){
int x=carry+(c-'0')*n;
ans+=(x%10+'0');
carry=x/10;
}
while(carry){
ans+=(carry%10+'0');
carry/=10;
}
reverse(all(ans));
return ans;
}
bool check(int base){
if(base==0)return true;
string val;
rep(i,0,n-1){
val=Add(multiply(val,base),string(1,x[i]));
}
//cout<<val<<":"<<base<<endl;
if(val.size()==mstr.size()){
rep(i,0,sz(val)-1){
if(val[i]!=mstr[i])
return val[i]<mstr[i];
}
return true;
}
return val.size()<mstr.size();
}
int32_t main() {
IOS;
cin>>x>>m;
n=sz(x);
if(n==1){
if(x[0]-'0'<=m)cout<<"1";
else cout<<"0";
return 0;
}
int d=x[0]-'0';
for(auto c:x){
int cc=c-'0';
d=Max(d,cc);
}
int temp=m;
while(temp){
mstr+=(temp%10+'0');
temp/=10;
}
reverse(all(mstr));
//cout<<mstr<<endl;
int low=0,high=1e18,ans=low,mid;
while(low<=high){
mid=(low+high)>>1;
//cout<<mid<<endl;
if(check(mid)){
ans=mid;
low=mid+1;
}
else high=mid-1;
}
cout<<Max(0LL,ans-d);
cout<<'\n';
return 0;
} |
#include<iostream>
#include<queue>
using namespace std;
priority_queue<long long , vector<long long>,greater<long long> >q;
long long n,v[400015];
int main()
{
cin>>n;
long long sum=0;
for(int i=1;i<=2*n;i++)
{
cin>>v[i];
sum+=v[i];
}
long long l=n;
long long r=n+1;
while(l>=1)
{
q.push(v[l--]);
q.push(v[r++]);
sum-=q.top();
q.pop();
}
cout<<sum<<endl;
return 0;
} |
// Parasparopagraho Jīvānām
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_pbds ;
using namespace __gnu_cxx ;
using namespace std ;
typedef long long ll ;
typedef long double ldb ;
typedef pair<int, int> pii ;
typedef pair<int, ll> pil ;
typedef pair<ll,ll> pll ;
typedef vector<int> vi ;
typedef vector<ll> vll ;
typedef vector<pii> vpi ;
typedef vector<pll> vpl ;
typedef vector<pair<ll,int> > vpli ;
typedef vector<int,pil> edges ;
typedef vector<vi> matrix ;
typedef priority_queue<int> pqu ;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define per(i,b,a) for (int i = (b); i >= (a); i--)
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define ins insert
#define bk back
#define con continue
#define lbd lower_bound
#define ubd upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define pr cout << // I don't like this but my laptop's 'O' key is not functioning well
/* Careful when using long long
__builtin_clz(int x) {} //: the number of zeros at the beginning of the number
__builtin_ctz(int x) {} //: the number of zeros at the end of the number
__builtin_popcount(int x) {} //: the number of ones in the number
__builtin_parity(int x) {} //: the parity (even or odd) of the number of ones */
const int mod1 = 1000000007 ;
const int mod2 = 998244353 ;
const ll infl = 4e18 ;
const int infi = 2e9 ;
const int maxn = 5e5 + 5 ;
const int block = 500 ;
const int logn = 60 ;
const int alpha = 27 ;
const ldb pi = acos(-1) ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
int rng_lr(int a, int b)
{
int ret ;
ret = uniform_int_distribution<int>(a, b)(rng) ;
return ret ;
// For shuffling use shuffle(all, rng) ;
}
ll modpow(ll a, ll b, int MOD) { ll res = 1 ; while(b) { if(b&1) { res = res*a ; res %= MOD ; } a *= a ; a %= MOD ; b >>= 1 ; } return res%MOD ; }
void upmin(int &a, int b) { if(a < b) { a = b ; } }
void relax(int &a, int b) { if(a > b) { a = b ; } }
ll add(ll a, ll b, int MOD) { a += b ; if(a >= MOD) { a -= MOD ; } return a ; }
ll sub(ll a, ll b, int MOD) { a -= b ; if(a < 0) { a += MOD ; } return a ; }
ll mul(ll a, ll b, int MOD) { b %= MOD ; a *= b ; a %= MOD ; return a ; }
ll inverse(ll a, ll MOD) { a = modpow(a, MOD - 2, MOD) ; return a ; }
ll lcm(ll a, ll b) { ll ret ; ll g = __gcd(a, b) ; ret = a/g ; ret = ret*b ; return ret ; }
int icast(char ch) { return int(ch-'a') ; }
void hyn(int a, int b) { if(a == b) cout << "YES\n" ; else cout << "NO\n" ; }
void pyd(int a, int b) { if(a == b) cout << "First\n" ; else cout << "Second\n" ; }
// Check constraints + overflows + types in typedef
int main()
{
ios::sync_with_stdio(false) ;
cin.tie(NULL) ;
int n ;
cin >> n ;
vi a(2*n) ;
rep(i,0,2*n-1) {
cin >> a[i] ;
}
ll res = 0 ;
int l = n-1, r = n ;
multiset<int> s ;
//s.insert(max(a[l], a[r])) ;
while(l >= 0) {
s.insert(max(a[l], a[r])) ;
if(*s.begin() < min(a[l], a[r])) {
s.erase(s.begin()) ;
s.insert(min(a[l], a[r])) ;
}
l-- ;
r++ ;
}
for(multiset<int>::iterator itr = s.begin() ; itr != s.end() ; itr++) {
res += *itr ;
}
pr res << "\n" ;
return 0 ;
} |
Subsets and Splits