code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long;
int main(){
int h,w,x,y;
cin>>h>>w>>x>>y;
char a[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
}
}
x--;y--;
int ans=0;
if(a[x][y]=='#'){
ans=0;
}
else{
ans++;
for(int i=x-1;i>=0;i--){
if(a[i][y]=='#'){
break;
}
ans++;
}
for(int i=x+1;i<h;i++){
if(a[i][y]=='#'){
break;
}
ans++;
}
for(int i=y-1;i>=0;i--){
if(a[x][i]=='#'){
break;
}
ans++;
}
for(int i=y+1;i<w;i++){
if(a[x][i]=='#'){
break;
}
ans++;
}
cout<<ans<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)
void err() { std::cout << std::endl; }
template<typename T, typename...Args>
void err(T a, Args...args) { std::cout << a << ' '; err(args...); }
template <template<typename...> class T, typename t, typename... A>
void err(const T <t> &arg, const A&... args) {
for (auto &v : arg) std::cout << v << ' '; err(args...); }
#else
#define dbg(...)
#endif
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pint;
typedef pair<ll,ll> plint;
const int mod = 1000000007;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
const int N = 2e5 + 10;
int n, m;
vector<pint>g[N];
map<pint,int>st;
int col[N];
void dfs(int u, int fa){
for (int i = 0; i < g[u].size(); ++i) {
int v = g[u][i].fi, w = g[u][i].se;
if (col[v]) continue;
if (w == col[u]) {
col[v] = ((col[u] == n) ? 1 : col[u] + 1);
} else {
col[v] = w;
}
dfs(v, u);
}
}
int main()
{
cin >> n >> m;
rep(i,0,m) {
int u,v,w;
cin >> u >> v >> w;
if (st[{u,v}]) continue;
g[u].pb({v,w});
g[v].pb({u,w});
st[{u,v}] = st[{v,u}] = 1;
}
col[1] = 1;
dfs(1,0);
rep (i,1,n + 1) cout << col[i] << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e17
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool collision_detection(ll a, ll b, ll c, ll d, ll e, ll f, ll g, ll h){
pair<long double, long double> center1 = {(a+c)/2.0, (b+d)/2.0};
pair<long double, long double> center2 = {(e+g)/2.0, (f+h)/2.0};
long double x_dist = abs(center1.first - center2.first);
long double y_dist = abs(center1.second - center2.second);
if(x_dist >= (c-a)/2.0 + (g-e)/2.0){
return false;
}
if(y_dist >= (d-b)/2.0 + (h-f)/2.0){
return false;
}
return true;
}
vector<ll> enum_div(ll n){
vector<ll> ret;
for(ll i = 1 ; i*i <= n ; ++i){
if(n%i == 0){
ret.push_back(i);
if(i*i != n){
ret.push_back(n/i);
}
}
}
return ret;
}
int main()
{
random_device rd;
seed_seq seed = {rd()};
mt19937 engine(seed);
uniform_int_distribution<> dist(0, 9999);
ll n;
cin >> n;
vector<ll> x(n), y(n), r(n);
rep(i, n){
cin >> x.at(i) >> y.at(i) >> r.at(i);
}
vector<tuple<ll, ll, ll, ll>> ads(n);
rep(i, n){
rep(j, r.at(i)){
ll factor = 512;
vector<ll> divisors = enum_div((r.at(i)-j)/factor);
bool put = false;
for(ll div : divisors){
ll a = x.at(i);
ll b = y.at(i);
ll c = a + div;
ll d = b + ((r.at(i)-j)/factor)/div;
if(c > 10000 || d > 10000){
continue;
}
bool hit = false;
rep(k, i){
if(collision_detection(a, b, c, d, get<0>(ads.at(k)), get<1>(ads.at(k)), get<2>(ads.at(k)), get<3>(ads.at(k)))){
hit = true;
break;
}
}
if(hit){
continue;
}
ads.at(i) = {a, b, c, d};
put = true;
break;
}
if(put){
break;
}
if(j == r.at(i)-1){
bool make = false;
while(!make){
ll p = dist(engine);
ll q = dist(engine);
rep(k, i){
if(collision_detection(p, q, p+1, q+1, get<0>(ads.at(k)), get<1>(ads.at(k)), get<2>(ads.at(k)), get<3>(ads.at(k)))){
break;
}
if(k == i-1){
ads.at(i) = {p, q, p+1, q+1};
make = true;
break;
}
}
}
}
}
//cerr << i << endl;
}
rep(i, n){
cout << get<0>(ads.at(i)) << " " << get<1>(ads.at(i)) << " " << get<2>(ads.at(i)) << " " << get<3>(ads.at(i)) << '\n';
}
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long K, cnt = 0, wincnt = 0;
string S, T;
cin >> K >> S >> T;
map<long long, long long> p;
vector<long long> t(10), a(10);
for (long long i = 1; i <= 9; ++i) p[i] = K;
for (long long i = 0; i < 4; ++i) {
--p[(long long)S[i] - '0'];
++t[(long long)S[i] - '0'];
--p[(long long)T[i] - '0'];
++a[(long long)T[i] - '0'];
}
for (long long i = 1; i <= 9; ++i) {
++t[i];
for (long long j = 1; j <= 9; ++j) {
++a[j];
long long T = 0, A = 0;
for (long long I = 0; I < 10; ++I) T += I * pow(10, t[I]);
for (long long I = 0; I < 10; ++I) A += I * pow(10, a[I]);
if (i == j) {
if (T > A) {
//cout << i << " " << j << " " << p[i] * max(p[j] - 1, 0ll) << "\n";
wincnt += p[i] * max(p[j] - 1, 0ll);
}
cnt += p[i] * max(p[j] - 1, 0ll);
}
else {
if (T > A) {
//cout << i << " " << j << " " << p[i] * p[j] << "\n";
wincnt += p[i] * p[j];
}
cnt += p[i] * p[j];
}
--a[j];
}
--t[i];
}
//cout << wincnt << " " << cnt << "\n";
cout << fixed << setprecision(7) << (double)wincnt / (double)cnt << "\n";
} |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;ll ans=0;
cin>>n;
if(n-999>0)
ans+=n-999;
if(n-999999>0)
ans+=(n-999999);
if(n-999999999>0)
ans+=(n-999999999);
if(n-999999999999>0)
ans+=(n-999999999999);
if(n-999999999999999>0)
ans+=(n-999999999999999);
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
ll now = 10, cnt = 2;
while(now <= n){
ans += ((cnt-2)/3)*(now-now/10);
now *= 10;
cnt++;
}
ans += ((cnt-2)/3)*(n-now/10+1);
cout << ans << endl;
} |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
#define pii pair<int,int>
#define pll pair<long long,long long>
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int) (x).size())
#define rep(i,n) for (int i=1;i <=int(n);i++)
#define rrep(i,n) for (int i=int(n);i >= 1 ;i--)
#define ffor(i,n) for (int i=0;i <int(n);i++)
#define rfor(i,n) for (int i=int(n-1);i >= 0;i--)
#define all(x) x.begin(),x.end()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//use rng() for random
ll fac[4000002];
const ll MOD = 1e9 + 7;
ll power(ll x,ll y )
{
ll res = 1; // Initialize result
x = x % MOD; // Update x if it is more than or
// equal to p
if (x == 0) return 0; // In case x is divisible by p;
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
res = (res*x) % MOD;
// y must be even now
y = y>>1; // y = y/2
x = (x*x) % MOD;
}
return res;
}
ll invmul(ll a, ll b){
return a*power(b,MOD-2) % MOD;
};
ll nck ( ll n , ll k ){
// cout <<(invmul(fac[n],fac[k])%MOD+MOD)%MOD <<' ' << fac[n-k] << '\n';
if (k < 0 || n - k < 0) return 0;
ll res =fac[n];
res = invmul(res,fac[k]) % MOD;
res = invmul(res,fac[n-k]) % MOD;
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fac[0] = 1;
rep(i,4000000) fac[i] = (fac[i-1] * i ) % MOD;
ll n,m,k ; cin >> n >> m >> k ;
if ( n > m + k) {
cout << 0 << '\n'; return 0;
}
ll res = nck(n+m,n);
if ( n < k + 1 ){
cout << res << '\n'; return 0;
}
// cout << res << '\n';
ll bold = nck(n+m,n-k-1);
// cout << n+m << ' ' << n - k << '\n';
cout << ((res - bold)%MOD + MOD)%MOD << '\n';
return 0;
}
/*
5 7
3 4 6 8 11
1 2 3 4 5 6 7
*/
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define UNIQUE(a) sort(all(a));a.erase(unique(all(a)),a.end())
#define decimal cout<<fixed<<setprecision(10)
#define summon_tourist cin.tie(0);ios::sync_with_stdio(false)
using ll=long long;
using P=pair<ll,ll>;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
constexpr ll inf=1001001001001001;
constexpr int INF=1001001001;
constexpr int mod=998244353;
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;}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
void YesNo(bool b){if(b)out("Yes");else out("No");}
void yesno(bool b){if(b)out("yes");else out("no");}
void YESNO(bool b){if(b)out("YES");else out("NO");}
ll modpow(ll a,ll b){ll c=1;while(b>0){if(b&1){c=a*c%mod;}a=a*a%mod;b>>=1;}return c;}
vi calc(ll x){vi v;while(x>0){v.eb(x%10);x/=10;}reverse(all(v));return v;}
int h,w;
bool used[16][16];
int dfs(int i,int j,int a,int b){
if(a<0||b<0) return 0;
if(j==w){
i++; j=0;
}
if(i==h) return 1;
if(used[i][j]) return dfs(i,j+1,a,b);
used[i][j]=true;
int sum=0;
sum+=(dfs(i,j+1,a,b-1));
if(j<w-1&&!used[i][j+1]) sum+=dfs(i,j+2,a-1,b);
if(i<h-1){
used[i+1][j]=true;
sum+=dfs(i,j+1,a-1,b);
used[i+1][j]=false;
}
used[i][j]=false;
return sum;
}
int main(){
int a,b;
cin>>h>>w>>a>>b;
out(dfs(0,0,a,b));
} |
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define PI acos(-1.0)
#define No cout<<"No\n"
#define Yes cout<<"Yes\n"
#define no cout<<"no\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define YES cout<<"YES\n"
#define MOD (int)1000000007
#define int long long
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define sf(a) scanf("%lld", &a)
#define pf(a) printf("%lld ", a)
#define pfn(a) printf("%lld\n", a)
#define case(a) cout<<"Case "<<a<<": ";
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb push_back
#define mem(arr) memset(arr, 0, sizeof(arr))
#define mem1(arr) memset(arr, -1, sizeof(arr))
#define all(a) a.begin(),a.end()
#define f(i,a,b) for (int i = a; i<=b; i++)
#define fr(i,a,b) for (int i = a; i>=b; i--)
#define rr return 0
#define prec(n) fixed<<setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int> >
#define inf (int)(1e18)
#define vi vector<int>
#define vii vector<pii>
#define sz(s) s.size()
#define lcm(a,b) (a*(b/gcd(a,b)))
int gcd(int a, int b) {return __gcd(a,b);}
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p & 1LL) r = modMul(r, b); b = modMul(b, b); p >>= 1LL; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
inline bool checkBit(ll n, int i) { return n&(1LL<<i); }
inline ll setBit(ll n, int i) { return n or (1LL<<i);; }
inline ll resetBit(ll n, int i) { return n&(~(1LL<<i)); }
const double eps = 1e-9;
int dx[5] = {+1, +0, -1, -0};
int dy[5] = {+0, +1, -0, -1};
int XX[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int YY[] = { -1, 0, 1, -1, 1, -1, 0, 1 };
inline bool Equal(double x, double y) { return fabs(x-y)<eps; }
inline bool Greater(double x, double y){ return x-eps>y; }
inline bool Lesser(double x, double y){ return x+eps<y; }
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cerr << '\n'; }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << *it << " = " << a << " "; err(++it, args...); }
///Write what you need -->
/// nt, ft, kmp, tri, sufarr, ub_lb, lis
/// dsu, combi
///Template Ends Here////////////////////////////
signed main()
{
// root = new trinode();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
FASTIO
// int n;
// cin>>n;
//
// int a[n+1];
// f(i, 1, n){
// cin>>a[i];
// }
int x, y;
cin>>x>>y;
if(abs(x-y) < 3)
Yes;
else
{
No;
}
// tridel(root);
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <queue>
#define INF 1010101010LL
#define INFLL 1010101010101010101LL
using namespace std;
const int mod = 1000000007;
//const int mod = 998244353;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<int> ans;
for (int i = 0; i < n; i++) {
bool ok = true;
for (int j = 0; j < m; j++) {
if (a[i] == b[j]) {
ok = false;
break;
}
}
if (ok) {
ans.emplace_back(a[i]);
}
}
for (int i = 0; i < m; i++) {
bool ok = true;
for (int j = 0; j < n; j++) {
if (b[i] == a[j]) {
ok = false;
break;
}
}
if (ok) {
ans.emplace_back(b[i]);
}
}
sort(ans.begin(), ans.end());
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << (i + 1 == ans.size() ? "\n" : " ");
}
return 0;
} |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll N;
void input(void){ cin >> N; }
ll fix_b(int b){
ll pow2b = (1LL << b);
ll a_max = N / pow2b;
ll c = N - pow2b * a_max;
return (a_max + c + b);
}
int main(void){
input();
ll ans = (1LL << 60);
for (int b = 0; b <= 60; ++b)
ans = min(ans, fix_b(b));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "talltree"
#define pll pair<ll, ll>
#define pii pair<pll, pll>
#define fi first
#define se second
#define ull unsigned long long
using namespace std;
const ll mod = 998244353;
const ll N = 1e5+5;
ll n, m, t, ans, k, a[N][22], b[N], c[N], tong, cnt, q, d[N], dp[N];
struct point
{
ll x, id;
char s;
bool operator < (const point& q)
{
return x < q.x;
}
}p[N];
vector<pll> adj[N];
string s[N];
ll pw(ll k, ll n)
{
ll total = 1;
for(; n; n >>= 1)
{
if(n & 1)total = total * k % mod;
k = k * k % mod;
}
return total;
}
ll A(ll u, ll v)
{
if(u > v)return 0;
return b[v] * c[v-u] % mod;
}
void sol()
{
cin >> n;
ans = n;
while(n >= (1ll<<(t)))
{
ans = min(ans, n / (1ll<<t) + t + n % (1ll<<t));
++t;
}
cout << ans;
}
int main()
{
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ntest = 1;
//cin >> ntest;
while(ntest -- > 0)
sol();
}
/*
3 5
1 2 3 3 1
4 3 2 5 3
2 6 6 2 5
1 2 2 2
2 1 3 3
3 2 3 3
3 5 1 3
*/
|
#include<iostream>
using namespace std;
int main()
{
int n,a,b,miA,miB,ans,tmp;
cin>>n;
cin>>a>>b;
miA=a;miB=b;ans=a+b;
for(int i=1;i<n;i++)
{
cin>>a>>b;
ans=min(ans,a+b);
tmp=min((max(miA,b)),(max(miB,a)));
ans=min(ans,tmp);
miA=min(miA,a);
miB=min(miB,b);
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<it<<" "; cout<<endl;
#define getMax(x) max_element(x.begin(),x.end())
#define getMin(x) min_element(x.begin(),x.end())
#define endl "\n"
typedef vector<int> vi;
typedef vector< pair<int,int> > vii;
typedef vector<long long> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector< pair<ll,ll> > vll;
//int dx[]={1,0,-1,0};
//int dy[]={0,1,0,-1};
//int dx[]={-1,0,1,1,1,0,-1,-1};
//int dy[]={-1,-1,-1,0,1,1,1,0};
void nikal_pehli_fursat_mai(){
ll n;
cin>>n;
vl a(n), b(n);
ll ans = 1e18;
fi(0, n){
cin>>a[i]>>b[i];
}
fi(0, n){
fj(0, n){
if(i==j) {
ans = min(ans, a[i]+b[j]);
}
else {
// cout<<a[i]<<" "<<i<<" "<<b[j]<<" "<<j<<endl;
ans = min(ans, max(a[i], b[j]));
}
}
}
cout<<ans<<endl;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int tc=1;
// cin>>tc;
while(tc--){
nikal_pehli_fursat_mai();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long K;
cin >> K;
vector<long long> d(K + 5, 0);
for(long long a = 1; a <= K; ++a){
for(long long b = 1; a * b <= K; ++b){
long long c = K / (a * b);
d[a * b] += c;
}
}
long long answer = accumulate(d.begin(), d.begin() + K + 1, 0LL);
cout << answer;
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<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 = 31 ;
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 k ;
cin >> k ;
ll res = 0 ;
rep(a,1,k) {
int rb = k/a ;
rep(b,1,rb) {
int p = a*b ;
int rc = k/p ;
if(rc) {
res += (rc) ;
}
}
}
pr res << "\n" ;
return 0 ;
} |
# include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
using namespace std;
typedef long long lint;
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; }
void solve() {
string N;
cin >> N;
int ans = 1000;
for(int i=1;i<(1<<N.size());i++ ){
int tmp=0;
int cnt = 0;
for(int j=0;j<N.size();j++){
if(i&(1<<j)) tmp += N[j]-'0';
else cnt++;
}
if(tmp%3 == 0){
ans = min(ans, cnt);
}
}
if(ans==1000) cout << -1 << endl;
else cout << ans << endl;
}
signed main() {
solve();
return 0;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <string>
#include <bitset>
#include <set>
#include <cmath>
#define LL long long
#define ull unsigned long long
using namespace std;
const int MAXN = 25;
int n;
int ans = 25;
LL ret = 0;
LL vis[(int)3e5 + 5];
char s[MAXN];
void dfs (int dep) {
//++ret;
LL x = 0;
//if (dep > n) return ;
int q = 0;
for (int i=0; i<n; ++i)
if (s[i] != 'a') q |= (1 << i);
if (vis[q]) return ;
vis[q] = 1;
for (register int i = 0; i < n; ++i)
if (s[i] != 'a') x *= 10ll, x += s[i] - '0';
//cout << x << endl;
if (x - 3ll * (x / 3ll) == 0) {
//cout << x << endl;
ans = min (ans, dep);
return ;
}
for (register int i = n-1; ~i; --i)
if (s[i] ^ 'a') {
char c = s[i];
s[i] = 'a', dfs (dep + 1);
s[i] = c;
}
}
int main() {
#ifdef IN
freopen ("x.in", "r", stdin);
freopen ("x.out", "w", stdout);
#endif
int i,j,k;
int x;
scanf ("%s", s), n = strlen (s);
//cout << n << endl;
dfs (0);
if (ans < n) printf ("%d", ans);
else printf ("-1");
//cout << "\n" << ret;
return 0;
}
|
#pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
const int INF = INT_MAX;
const ll LLINF = LLONG_MAX;
#define all(x) x.begin(), x.end()
#define rep(i, s, e) for(ll i = s; i < e; ++i)
#define repr(i, s, e) for(ll i = s; i > e; --i)
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; }
void CIN() {}
template<class T, class ...Ts> void CIN(T &&t, Ts &&...ts){ cin >> t; CIN(ts...); }
void COUT() { cout << endl; }
template<class T, class ...Ts> void COUT(T &&t, Ts &&...ts){ cout << t << " "; COUT(ts...); }
#pragma endregion
int main()
{
cin.tie(nullptr);
string n; cin >> n;
int len_n = n.size(), max_step = n.size();
rep(step, 0, max_step) {
int same = 1;
rep(idx, 0, len_n / 2) {
if (n[idx] != n[len_n - idx - 1]) {
same = 0;
break;
}
}
if (same) {
cout << "Yes" << endl;
return 0;
} else {
n = '0' + n;
len_n ++;
continue;
}
}
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_set>
typedef int64_t ll;
typedef std::pair<int, int> Pii;
typedef std::pair<ll, ll> Pll;
typedef std::pair<double, double> Pdd;
#define rip(_i, _n, _s) for (int _i = (_s); _i < (int)(_n); _i++)
#define all(_l) _l.begin(), _l.end()
#define rall(_l) _l.rbegin(), _l.rend()
#define MM << " " <<
template<typename _T>
using MaxHeap = std::priority_queue<_T>;
template<typename _T>
using MinHeap = std::priority_queue<_T, std::vector<_T>, std::greater<_T>>;
template<typename _T>
inline bool chmax(_T &_l, const _T _b) {
if (_l < _b) {
_l = _b;
return true;
}
return false;
}
template<typename _T>
inline bool chmin(_T &_l, const _T _b) {
if (_l > _b) {
_l = _b;
return true;
}
return false;
}
template<typename _T>
void vdeb(const std::vector<_T> &bb) {
for (unsigned int i = 0;i < bb.size();i++) {
if (i == bb.size() - 1) std::cout << bb[i];
else std::cout << bb[i] << ' ';
}
std::cout << '\n';
}
template<typename _T>
void vdeb(const std::vector<std::vector<_T>> &bb) {
for (unsigned int i = 0;i < bb.size();i++) {
// std::cout << i << ' ';
vdeb(bb[i]);
}
std::cout << '\n';
}
using namespace std;
int conv(vector<int> &cnt) {
int ret = 0;
for(int i : cnt) {
ret <<= 1;
ret += (i ? 1: 0);
}
return ret;
}
int main() {
int r, c; cin >> r >> c;
vector<vector<int>> a(r, vector<int>(c-1));
vector<vector<int>> b(r-1, vector<int>(c));
rip(i,r,0) rip(j,c-1,0) cin >> a[i][j];
rip(i,r-1,0) rip(j,c,0) cin >> b[i][j];
vector<vector<Pii>> da(r*c*2, vector<Pii>(0));
rip(i,r,0) rip(j,c,0) {
int now = i*c+j;
if(j+1 < c) da[now].push_back({now+1 ,a[i][j]});
if(0 <= j-1) da[now].push_back({now-1 ,a[i][j-1]});
if(i+1 < r) da[now].push_back({now+c, b[i][j]});
da[now].push_back({now+r*c, 1});
da[now+r*c].push_back({now, 0});
if(0 <= i-1) da[now+r*c].push_back({now+r*c-c, 1});
}
MinHeap<Pii> pq;
pq.push({0, 0});
vector<int> used(r*c*2, -1);
while(!pq.empty()) {
Pii now = pq.top(); pq.pop();
if(used[now.second] != -1) continue;
used[now.second] = now.first;
for(auto &&i : da[now.second]) {
pq.push({now.first + i.second, i.first});
}
}
cout << used[r*c-1] << endl;
} |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
constexpr ll mod = 1000000007LL;
int N;
char caa, cab, cba, cbb;
void input(void){
cin >> N;
cin >> caa >> cab >> cba >> cbb;
}
ll modpow(ll a, ll b){
if (b == 0) return 1LL;
ll tmp = modpow(a, b / 2);
tmp = tmp * tmp % mod;
if (b % 2) tmp = tmp * a % mod;
return tmp;
}
ll solve(void){
if (N <= 3) return 1LL;
if (
(cab == 'A' && caa == 'A') ||
(cab == 'B' && cbb == 'B')
) return 1LL;
if (
(cab == 'A' && cba == 'A') ||
(cab == 'B' && cba == 'B')
){
ll tmpa = 1, tmpb = 0;
for (int i = 2; i <= N; ++i){
ll new_a = (tmpa + tmpb) % mod;
ll new_b = tmpa;
tmpa = new_a, tmpb = new_b;
}
return tmpb;
}
return modpow(2, N - 3);
}
int main(void){
input();
cout << solve() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main(void)
{
ll N;
cin >> N;
ll a=0, b=0, c=0;
ll nn = 1;
ll INF = 1001001001;
ll an=INF, bn=INF, cn=INF;
while(1)
{
a = N/nn;
c = N%nn;
if(an+bn+cn > a+b+c)
{
an = a;
bn = b;
cn = c;
}
if(nn*2 > N) break;
else
{
nn *= 2;
++b;
}
}
// cout << an << " " << bn << " " << cn << endl;
cout << an+bn+cn << endl;
return 0;
}
|
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define _roverload(_a1, _a2, _a3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _roverload(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); --i)
#define rrep(...) _roverload(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bit(n) (1LL << (n))
template <class T>
inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print() { cout << '\n'; }
template <class T>
void print(const vector<T> &v) {
bool f = false;
for (const auto &e : v) {
if (f) cout << ' ';
cout << e;
f = true;
}
cout << '\n';
}
template <class... T>
void print(const T &...args) {
bool f = false;
for (const auto &e : {args...}) {
if (f) cout << ' ';
cout << e;
f = true;
}
cout << '\n';
}
const int INF = 1002003004;
const ll LINF = 1002003004005006007ll;
struct preprocess {
preprocess() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} ____;
#pragma endregion head
#pragma region library
#pragma endregion library
int main() {
ll b, c;
cin >> b >> c;
ll mn0, mx0;
mn0 = b - c / 2;
mx0 = b + (c - 2) / 2;
ll mn1, mx1;
mn1 = -b - (c - 1) / 2;
mx1 = -b + (c - 1) / 2;
ll mn = max(mn0, mn1), mx = min(mx0, mx1);
ll ans = (mx0 - mn0 + 1) + (mx1 - mn1 + 1) - max(0ll, mx - mn + 1);
print(ans);
} | #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
namespace std{
template<class Fun>
class y_combinator_result{
Fun fun_;
public:
template<class T>
explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)){}
template<class ...Args>
decltype(auto) operator()(Args&&...args){
return fun_(std::ref(*this), std::forward<Args>(args)...);
}
};
template<class Fun>
decltype(auto) y_combinator(Fun && fun){
return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}
};
template<typename T>
bool umax(T& a, T b){
bool ret = a < b;
if(ret) a = b;
return ret;
}
template<typename T>
bool umin(T& a, T b){
bool ret = a > b;
if(ret) a = b;
return ret;
}
struct edge{
int to; ll cost;
int from;
edge(){ edge(0,0);}
edge(int to_, ll cost_) : to(to_), cost(cost_){}
edge(int to_, int from_, ll cost_) : to(to_), cost(cost_), from(from_){}
};
template<typename... T>
void read(T& ... a){
((cin >> a),...);
}
template<typename... T>
void write(T... a){
((cout << a),...);
}
template<typename T>
vector<T> read_array(int sz){
vector<T> ret(sz);
for(auto & x : ret) cin >> x;
return ret;
}
void solve(){
ll b, c;
read(b,c);
ll count = 1;
if( b == 0){
if( c > 1){
count++;
c -= 2;
count += c;
}
}else if( b < 0){
count += c;
if(c > 1){
c -= 1;
count += min( 2 * abs(b), c) - 1;
}
}else{
// b > 0
count += (c - 1);
if(c >= 2){
count += min( 2 * b, c ) - 1;
}else{
count++;
}
}
write(count, "\n");
}
int main()
{
//making data IO Fast
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
/****************************/
int T = 1;
// cin >> T;
while(T--)
solve();
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define V vector<int>
#define P pair<int,int>
#define INF 1000000007
#define MOD 10000
typedef long long LL;
#define SIZE 1000000
int BIT[SIZE];
void add(int i) {
if (i >= SIZE) return;
BIT[i]++;
add(i + (i & (-i)));
}
int sum(int i) {
if (i == 0) return 0;
return BIT[i] + sum(i - (i & (-i)));
}
int main() {
int N;
V A;
cin >> N;
REP(i, N) {
int a;
cin >> a;
A.push_back(a + 1);
}
LL inversions = 0;
REP(k, N) {
int a = A[k];
inversions += ((LL)k - (LL)sum(a));
add(a);
}
REP(k, N) {
cout << inversions << endl;
int cnt = (N - A[k]) - (A[k] - 1);
inversions += (LL)cnt;
}
} | #include<bits/stdc++.h>
using namespace std;
#define enviar {ios_base::sync_with_stdio(false);}
#define aiuda {cin.tie(NULL); cout.tie(NULL);}
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) ;F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
#define exacto(v) cout << setprecision(v) << fixed;
#define ll long long
#define eb emplace_back
#define em emplace
#define ef emplace_front
#define f first
#define s second
#define big greater<ll>()
#define ar(v) array<int,v>
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x).size()
#define meminf(v) memset(v, 0x7f , sizeof(v))
#define mem(v,x) memset(v , x , sizeof v);
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int n1, n2; cin >> n1 >> n2; n1--; n2--; list[n1].eb(n2); list[n2].eb(n1);}
template<class T> bool umin(T& a, const T& b) { return b<a?a=b, 1:0; }
template<class T> bool umax(T& a, const T& b) { return a<b?a=b, 1:0; }
string to_string(bool b) {return b?"true":"false"; }
string to_string(char c) { return string(1, c);}
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
template<class T> string to_string(T v) { bool f=1; string res; EACH(x, v) { if(!f) res+=' '; f=0; res+=to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if(sizeof...(t)) write(' '); print(t...); }
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<ll, ll> mll;
const ll mod = 1e9 + 7;
const ll maxsize = 3e5 + 10;
// const (size, caracter)
//ll n, m ,k , nc;
ll cnt[maxsize];
//ll a[maxsize], b[maxsize], p[maxsize];
//ll pre[maxsize];
struct FenwickTree {
vector<int> bit; // binary indexed tree
int n;
FenwickTree(int _n) {
this->n = _n;
bit.assign(n, 0);
}
FenwickTree(vector<int> a) : FenwickTree(a.size()) {
for (size_t i = 0; i < a.size(); i++)
add(i, a[i]);
}
int sum(int r) {
int ret = 0;
for (; r >= 0; r = (r & (r + 1)) - 1)
ret += bit[r];
return ret;
}
int sum(int l, int r) {
return sum(r) - sum(l - 1);
}
void add(int idx, int delta) {
for (; idx < n; idx = idx | (idx + 1))
bit[idx] += delta;
}
};
ll n, m ,k , nc;
ll a[maxsize];
void solve()
{
cin >> n;
FenwickTree f(n);
ll ans = 0;
FOR(i , n){
ll u ; cin >> u;
a[i] = u;
ll t = f.sum(u, n-1);
ans += t;
cnt[i] = t;
//print(u, f.sum(u), ans);
f.add(u, 1);
}
print(ans);
FOR(i , n - 1)
{
ans -= a[i];
ans += (n -1 )- a[i];
print(ans);
}
}
int main(){
enviar aiuda
int t = 1;
//cin >> t;
while(t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //降
#define d_sort_vll(v) sort((v).begin(), (v).end(), greater<long long>()); //降
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
#define say(t) cout << (t) << endl;
#define sum_vi(v) accumulate((v).begin(), (v).end(), 0);
#define sum_vll(v)accumulate((v).begin(), (v).end(), 0LL);
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;}
const int IINF=(1<<30);
const ll LLINF = 1LL<<60;
char BigAlphaToSmall(char a){
if (a >= 65 && a <= 90){
return a + 32;
}
return a;
}
char SmallAlphaToBig(char a){
if (a >= 97 && a <= 122){
return a - 32;
}
return a;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int t;
cin >> t;
rep_i(i, t)
{
int l, r;
cin >> l >> r;
if (2*l > r)
{
cout << 0 << endl;
continue;
}
ll hoge = r-(2*l)+2;
ll hoge2 = r-(2*l)+1;
ll ans = hoge*hoge2/2;
cout << ans << endl;
}
} | // acl1
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t;
cin>>t;
while(t--){
ll l,r;
cin>>l>>r;
ll n=r-l-l+1;
ll ans=((n)*(n+1))/2;
if(n>0)
cout<<ans<<endl;
else{
cout<<0<<endl;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
ll power(ll x, ll y){
x%=MOD;
ll ret=1;
while(y){
if(y&1) ret=ret*x%MOD;
x=x*x%MOD;
y>>=1;
}
return ret;
}
ll divid(ll x, ll y){
x%=MOD;
return x*power(y,MOD-2)%MOD;
}
const int MAX=510000;
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
}
ll 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();
int n, k; cin >> n >> k;
VI a(n); REP(i,n) cin >> a[i];
VVI p(k+1,VI(n,1));
VI sump(k+1,0);
REP(i,k){
REP(j,n){
p[i+1][j]=p[i][j]*a[j]%MOD;
sump[i+1]=(sump[i+1]+p[i+1][j])%MOD;
}
}
for(int i=1;i<=k;i++){
ll ans=0;
for(int j=0;j<=i/2;j++){
if(j==0){
ans=ans+sump[i]*(n-1)%MOD;
ans%=MOD;
}
else if(j*2!=i){
ans=(ans+sump[j]*sump[i-j]%MOD*COM(i,j)%MOD)%MOD;
if(j>0)
ans=(ans+MOD-sump[i]*COM(i,j)%MOD)%MOD;
}
else{
ans=(ans+divid((power(sump[j],2)-sump[i]+MOD)*COM(i,j),2))%MOD;
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int MOD = 1000000007;
int f[400001], g[400001];
/*
実行時Modint :
template <int& MOD = 1000000007>
static int MOD;
cin >> MOD;
*/
template <int MOD = 1000000007>
struct Mint {
int x;
Mint() : x(0) {}
Mint(long long t) : x(t >= 0 ? (t % MOD) : (MOD - (-t) % MOD) % MOD) {}
Mint pow(int n) {
Mint res(1), t(x);
while (n > 0) {
if (n & 1) res *= t;
t *= t;
n >>= 1;
}
return res;
}
Mint inv() const {
int a = x, b = MOD, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return Mint(u);
}
Mint &operator+=(Mint a) {
x += a.x;
if (x >= MOD) x -= MOD;
return *this;
}
Mint &operator-=(Mint a) {
x += MOD - a.x;
if (x >= MOD) x -= MOD;
return *this;
}
Mint &operator*=(Mint a) {
x = int(1LL * x * a.x % MOD);
return *this;
}
Mint &operator/=(Mint a) {
return (*this) *= a.inv();
}
Mint operator+(Mint a) const {
return Mint(x) += a;
}
Mint operator-(Mint a) const {
return Mint(x) -= a;
}
Mint operator*(Mint a) const {
return Mint(x) *= a;
}
Mint operator/(Mint a) const {
return Mint(x) /= a;
}
Mint operator-() const {
return Mint(-x);
}
bool operator==(const Mint a) {
return x == a.x;
}
bool operator!=(const Mint a) {
return x != a.x;
}
bool operator<(const Mint a) {
return x < a.x;
}
friend ostream &operator<<(ostream &os, const Mint &a) {
return os << a.x;
}
friend istream &operator>>(istream &is, Mint &a) {
int t;
is >> t;
a = Mint<MOD>(t);
return (is);
}
int mod() {
return MOD;
}
};
/*
MODint依存
nCk mod p (p < n)
*/
template <typename T>
struct SmallModCombination {
vector<int> f;
vector<T> g;
SmallModCombination(int sz) : f(sz + 1), g(sz + 1) {
for (int i = 1; i <= sz; i++) {
int pos = i;
while (pos % g[0].mod() == 0) {
pos /= g[0].mod();
f[i]++;
}
g[i] = T(pos);
}
g[0] = T(1);
for (int i = 1; i <= sz; i++) f[i] += f[i - 1];
for (int i = 1; i <= sz; i++) g[i] *= g[i - 1];
}
T C(int n, int k) {
if (f[n] > f[k] + f[n - k])
return T(0);
else
return g[n] / (g[k] * g[n - k]);
}
};
signed main() {
int n;
cin >> n;
string c;
cin >> c;
map<char, Mint<3>> mp;
mp['B'] = 0;
mp['W'] = 1;
mp['R'] = 2;
SmallModCombination<Mint<3>> C(400000);
Mint<3> ans = 0;
rep(i, n) {
ans += C.C(n - 1, i) * mp[c[i]];
}
if (n % 2 == 0) ans *= Mint<3>(-1);
if (ans == Mint<3>(0)) {
cout << "B" << endl;
} else if (ans == Mint<3>(1)) {
cout << "W" << endl;
} else {
cout << "R" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int N,S,D,ff=0;
vector<int> X,Y;
//vector<vector<vector<int>>> dp;
//long long amt=0;
//string s;
int ans=0;
cin >> N >> S >> D;
X = Y = vector<int>(N);
//A.at(0) = A.at(0) = 0;
for(int i=0; i<N; i++){
cin >> X.at(i) >> Y.at(i);
if(X.at(i)<S && Y.at(i)>D){
ff=1;
}
}
if(ff==1){
cout << "Yes";
}else{
cout << "No";
}
//cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define ll long long
#define PI 3.1415926535897932384626
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define br printf("\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 deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define deba(i, a, n) \
fo(i, n) { cout << a[i] << " "; }
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define trr(it, x) for (auto it = x.rbegin(); it != x.rend(); it +)
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
const int MOD = 1000000007;
const int INF = 1000000009;
const int N = 300050;
ll fpow(ll x, ll n) {
ll res = 1;
while (n) {
if (n & 1) {
res = res * x % MOD;
}
x = x * x % MOD;
n >>= 1;
}
return (res % MOD);
}
ll binomialCoeff(ll n, ll k) {
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++) {
for (j = 0; j <= min(i, k); j++) {
// Base Cases
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
}
}
return C[n][k];
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * (b / gcd(a, b));
}
void create_fac(int n) {
vector<int> fac(N), inv(N);
fac[0] = inv[0] = 1;
for (int i = 1; i <= n; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = fpow(fac[i], MOD - 2);
}
}
void sieve(int n) // linear sieve
{
vector<int> primes;
bool prime[N];
for (int i = 2; i < n; ++i) {
if (prime[i])
primes.push_back(i);
for (int j = 0; j < primes.size() && i * primes[j] < n; ++j) {
prime[i * primes[j]] = false;
if (i % primes[j] == 0)
break;
}
}
}
/* ========== YOUR CODE HERE ========= */
//void solution() {
string solution() {
ll n = 0, s = 0, d = 0;
cin >> n >> s >> d;
ll a[n], b[n];
for (ll i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (ll i = 0; i < n; i++) {
if (a[i] < s && b[i] > d)
return "Yes";
}
return "No";
}
/* ========== YOUR CODE HERE ========= */
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t = 1;
// cin >> t;
while (t--) {
cout << solution() << endl;
// solution();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >>n;
long long a,ans=0,cnt[205]={0};
for(int i=0;i<n;i++){
cin >>a;
cnt[a%200]+=1;
}
for(int i=0;i<200;i++){
if(cnt[i]>1){
ans+=(cnt[i]-1)*cnt[i]/2;
}
}
cout <<ans <<endl;
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("C:/Users/HP/OneDrive/Desktop/compi_prog/output.txt","w",stdout)
#define arr array
using namespace std;
void solve(ll tc){
ll n,e;
cin>>n;
vector<ll> cnt(200,0);
ll ans=0;
for(ll i=1;i<=n;i++){
cin>>e;
e%=200;
ans=ans+cnt[e];
cnt[e]++;
}
cout<<ans;
}
int main(){
boost;
ll t=1;
t=1;
ll tc=1;
while(t--){
solve(tc);
tc++;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rapid() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
int main(){
rapid();
int n;
cin>>n;
int n2=1<<n;
vector<int>a(n2);
map<int,int>mp;
for(int i=0;i<n2;i++){
cin>>a[i];
}
for(int i=0;i<n2;i++){
mp[a[i]]=i+1;
}
while(a.size()>2){
vector<int>na;
for(int i=0;i<a.size();i+=2){
na.push_back(max(a[i],a[i+1]));
}
swap(a,na);
}
int ans=min(a[0],a[1]);
cout<<mp[ans]<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define ll long long
#define boost ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)((x).size())
#define endl "\n"
////@Deepak404-------------------------------------------------------------------->
const ll mxN = 1e5;
const ll mod = 1e9 + 7;
void solve()
{
ll n;
cin >> n;
deque<int> dq;
int in;
n = pow((ll)2, n);
vector<int> a(n / 2);
vector<int> b(n / 2);
for (auto &&i : a)
{
cin >> i;
}
for (auto &&i : b)
{
cin >> i;
}
auto mxa = max_element(all(a));
auto mxb = max_element(all(b));
int ans;
if (*mxa < *mxb)
ans = (mxa - a.begin()) + 1;
else
ans = (mxb - b.begin()) + (n / 2) + 1;
cout << ans << "\n";
}
int main()
{
boost;
int tc = 1;
// cal();
// sieve();
// cin >> tc;
for (int i = 1; i <= tc; i++)
{
// cout << "Case #" << i << ": ";
solve();
}
#ifndef ONLINE_JUDGE
cerr << "Time: " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << " ms\n";
#endif
return 0;
}
|
//#include "pch.h"
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>
#include <time.h>
#include <numeric>
using namespace std;
//#define int long long
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define l1 list[index]
#define l2 list[index - 1]
#define l3 list[index + 1]
#define iif(i,j) ((i<0 && j<0) || (i>0 && j>0)) ? true : false
typedef long long ll;
typedef pair<int, int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
const double PI = 3.14159265359;
int ca[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };
signed main() {
int n, k, m;
cin >> n >> k >> m;
int sum = 0;
for (int i = 0; i < n - 1; i++) {
int num;
cin >> num;
sum += num;
}
for (int i = 0; i <= k; i++) {
if ((sum + i)/n >= m) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cstdlib>
#include <math.h>
using namespace std;
typedef long long ll;
int main(){
int n, k, m, sum=0, ans=0;
cin >> n >> k >> m;
vector<int>a(n);
for(int i=0; i<n-1; i++){
cin >> a.at(i);
sum += a.at(i);
}
ans = n*m-sum;
if(ans <= 0){
cout << "0";
}
else if(ans <= k){
cout << ans;
}
else{
cout << "-1";
}
}
|
// Problem: C - Keep Graph Connected
// Contest: AtCoder - AtCoder Regular Contest 108
// URL: https://atcoder.jp/contests/arc108/tasks/arc108_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
const int p=998244353;
int qp(int x,int y)
{
int res=1;
for(int t=x; y; y>>=1,t=t*t%p) if(y&1) res=res*t%p;
return res;
}
vector<pair<int,int> > v[100003];
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int a[1000003];
int n=read(),m=read();
void dfs(int x)
{
for(auto i:v[x]) if(!a[i.fi])
{
if(a[x]==i.se) if(a[x]==n)a[i.fi]=1;
else a[i.fi]=n;
else a[i.fi]=i.se;
dfs(i.fi);
}
return ;
}
signed main()
{
if(n==2)
{
puts("1");
puts("2");
return 0;
}
for(int i=1; i<=m; ++i)
{
int x=read(),y=read(),z=read();
v[x].pb(mp(y,z)),v[y].pb(mp(x,z));
}
a[1]=1;
dfs(1);
for(int i=1; i<=n; ++i) printf("%lld\n",a[i]);
return 0;
} | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORR(i,a,b) for(ll i=a;i>=b;i--)
#define vl vector<ll>
#define ld long double
#define vld vector<ld>
#define vvl vector<vector<long long>>
#define vvld vector<vector<ld>>
#define pll pair<long,long>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.14159265358979323846264338327950288419716939937510
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define mset(a,val) memset(a,val,sizeof(a));
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M = 1000000007;
const ll MM = 998244353;
#define endl "\n"
ll begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
template<typename T, typename F>
void chmax( T &a, F b) {
if (b > a)a = b;
}
template<typename T, typename F>
void chmin( T &a, F b) {
if (b < a)a = b;
}
ll powM(ll a, ll b, ll m) {
if (b < 0 || a <= 0)return 0;
a %= m;
ll ans = 1LL;
while (b) {
if (b & 1)ans = ans * a % m;
a = a * a % m;
b >>= 1;
}
return ans;
}
ll poww(ll a, ll b) {
if (b < 0 || a <= 0)return 0;
ll ans = 1LL;
while (b) {
if (b & 1)ans = ans * a;
a = a * a;
b >>= 1;
}
return ans;
}
const ll N = 2e5 + 5;
map<ll, map<ll, ll>>blah;
ll par[N];
ll find(ll x) {
if (x == par[x])return x;
return par[x] = find(par[x]);
}
ll ran[N];
void unio(ll a, ll b) {
a = find(a), b = find(b);
if (a == b)return;
if (ran[a] < ran[b])swap(a, b);
ran[a] += ran[b];
par[b] = a;
ran[b] = 0;
for (auto val : blah[b]) {
blah[a][val.ff] += val.ss;
}
}
int main() {
IOS;
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
ll n, q;
cin >> n >> q;
vl c(n + 1);
FOR(i, 1, n) {
cin >> c[i];
blah[i][c[i]]++;
par[i] = i, ran[i] = 1;
}
// cout << blah[3][1];
while (q--) {
ll type;
cin >> type;
ll a, b;
cin >> a >> b;
if (type == 1) {
unio(a, b);
} else {
ll papa = find(a);
ll ans = blah[papa][b];
cout << ans << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
#define rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const ll mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
int c=min(a, b), d=abs(a-b);
vi ans;
rep1(i, c-1){
ans.push_back(i);
ans.push_back(-i);
}
if(a<=b){
int sumb=0;
rep2(i, c, c+d){
ans.push_back(-i);
sumb+=-i;
}
if(sumb!=0)ans.push_back(-sumb);
}
else{
int suma=0;
rep2(i, c, c+d){
ans.push_back(i);
suma+=i;
}
if(suma!=0)ans.push_back(-suma);
}
rep(i, a+b){
if(i)cout << " ";
cout << ans[i];
}
cout << endl;
int cnta=0, cntb=0, sum=0;
rep(i, a+b){
if(ans[i]<0)cntb++;
if(ans[i]>0)cnta++;
sum+=ans[i];
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m;
ll ksm(ll x, ll y, ll mod) {
x = x % mod;
ll base = 1;
while (y) {
if (y & 1) {
base = base * x;
base = base % mod;
}
x = x * x % mod;
y = y / 2;
}
return base;
}
int main() {
cin >> n >> m;
ll ans = ksm(10, n, m * m);
ll cnt =ksm(10, n, m);
cout << (ans - cnt) / m << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll MOD=((1e9)+7);
bool sortcol( const vector<ll>& v1,const vector<ll>& v2 )
{
return v1[0] < v2[0];
}
int main()
{
ll n, su=0;
cin>>n;
set<ll> s;
for (ll i=1; i<=n; i++)
{
ll p;
cin>>p;
su+=p;
s.insert(p);
}
if (s.size()==n)
{
if (su==(n*(n+1))/2)
{
cout<<"Yes";
}
else cout<<"No";
}
else cout<<"No";
return 0;
}
| #include <bits/stdc++.h>
#define x first
#define y second
#define endll '\n'
#define pb push_back
#define mem(x,a) memset(x,a,sizeof(x))
using namespace std;
const int N=1e5+10,mod=19650827;
const int inf=0x3f3f3f3f;
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
int n,k,m;
inline int read(){
int x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
int a[111],b[111];
bool check(int x){
for(int i=1;i<=n;i++){
if(a[i]>x||b[i]<x)return false;
}
return true;
}
void work(){
n=read();
for(int i=1;i<=n;i++)a[i]=read();
for(int i=1;i<=n;i++)b[i]=read();
int res=0;
for(int i=1;i<=1000;i++){
if(check(i))res++;
}
cout<<res;
}
int main(){
//int T=read();
//while(T--)
work();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll my_gcd(ll a,ll b)
{
if (b == 0) return a;
return my_gcd(b,a%b);
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
int main()
{
int T;
cin >> T;
rep(i,T)
{
ll N,S,K;
cin >> N >> S >> K;
ll g = my_gcd(N,K);
if (S % g != 0)
{
cout << -1 << endl;
continue;
}
K = K % N;
ll x,y;
extGCD(K,N,x,y);
x *= -1 * (S/g);
ll l = N*K/g;
ll t = l/K;
//cout << x << endl;
//cout << t << endl;
if (x > 0 && x <= t)
{
cout << x << endl;
}
else
{
if (x < 0)
{
x += t * (-1) * (x/t-1);
}
else
{
x -= t * (x/t);
}
cout << x << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int t;
void exgys(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
} else {
exgys(b, a % b, y, x);
y -= a / b * x;
}
}
long long inv(long long a, long long Mod) {
long long x, y;
exgys(a, Mod, x, y);
return (x % Mod + Mod) % Mod;
}
long long gcd(long long a, long long b) {
return b ? gcd(b, a % b) : a;
}
int main() {
cin >> t;
while (t--) {
long long n, s, k;
cin >> n >> k >> s;
long long a = s;
long long b = (-k + n) % n, Mod = n;
long long gys = gcd(a, gcd(b, Mod));
a /= gys;
b /= gys;
Mod /= gys;
if (gcd(a, Mod) != 1)
cout << "-1" << endl;
else
cout << inv(a, Mod) * b % Mod << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,i,ans1,ans2,ans3,ans4,ans5;
cin >> n;
vector<pair<long long,long long>> x(n),y(n);
for(i=0; i<n; i++){
cin >> x[i].first >> x[i].second;
y[i].first=x[i].second; y[i].first=x[i].second;
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
ans1=x[n-1].first-x[0].first;
ans2=max(x[n-1].first-x[1].first,x[n-2].first-x[0].first);
ans3=y[n-1].first-y[0].first;
ans4=max(y[n-1].first-y[1].first,y[n-2].first-y[0].first);
ans5=abs(x[n-1].second-x[0].second);
if(ans5==ans3){
cout << max(ans2,ans4) << endl;
}else{
vector<long long> ans(4);
ans[0]=ans1; ans[1]=ans2; ans[2]=ans3,ans[3]=ans4;
sort(ans.begin(),ans.end());
cout << ans[2] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
void solve() {
string s;
cin >> s;
reverse(s.begin(), s.end());
for(auto& e : s) {
if(e == '6') {
e = '9';
} else if(e == '9') {
e = '6';
}
}
cout << s << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pi pair<int, int>
#define pf pair<float, int>
#define ps pair<string, int>
#define pii pair<int, pi>
#define mi map<int, int>
#define ml map<long long, int>
#define ms map<string, int>
#define mc map<char, int>
#define mpi map<pi, int>
#define F first
#define S second
#define vt vector
#define vi vector<int>
#define vd vector<double>
#define vf vector<float>
#define vl vector<long long>
#define vpi vector<pi>
#define vpf vector<pf>
#define vpii vector<pii>
#define st set
#define si set<int>
#define sd set<double>
#define sf set<float>
#define sl set<long long>
#define FOR(t, q) for(int q = 0; q < t; q++)
#define FORN(t, q, v) for(int q = v; q < t; q++)
#define sz(v) (int)(v.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define LOWER(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define UPPER(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define pb(s) push_back(s);
#define nl endl
#define TC int _t; cin >> _t; FOR(_t, _q)
using namespace std;
void solve() {
int a, b; cin >> a >> b;
int c = 2 * a + 100;
cout << c - b;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// TC
solve();
return 0;
}
| #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_REP(__VA_ARGS__, REP3, REP2) (__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2) (__VA_ARGS__)
#define IN(type, n) type n; cin >> n
#define INALL(type, v, s) vector<type> v(s); for (auto &e : v) { cin >> e; }
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
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; }
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
#pragma endregion
void print(vector<bool> &v) {
vector<int> ans;
REP(i, v.size()) {
if (v.at(i)) ans.emplace_back(i + 1);
}
cout << ans.size();
for (auto const &a : ans) {
cout << " " << a;
}
cout << endl;
}
void print(int idx) {
cout << "1 " << idx + 1 << endl;
}
int main() {
IN(int, N);
vector<vector<bool> > remain_elms(200, vector<bool>(N, false));
vector<bool> exist(200);
REP(i, N) {
IN(ll, A);
if (exist.at(A % 200)) {
yes();
print(ref(remain_elms.at(A % 200)));
print(i);
return 0;
}
remain_elms.at(A % 200).at(i) = true;
exist.at(A % 200) = true;
REP(j, 200) {
if (!exist.at(j)) continue;
if (remain_elms.at(j).at(i)) continue;
vector<bool> tmp = remain_elms.at(j);
tmp.at(i) = true;
if (exist.at((j + A) % 200)) {
bool is_ok = false;
REP(k, N) {
if (tmp.at(k) != remain_elms.at((j + A) % 200).at(k)) {
is_ok = true;
break;
}
}
if (is_ok) {
yes();
print(ref(remain_elms.at((j + A) % 200)));
print(ref(tmp));
return 0;
}
} else {
remain_elms.at((j + A) % 200) = tmp;
exist.at((j + A) % 200) = true;
}
}
}
no();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string S, T;
cin >> K >> S >> T;
double ans=0;
for(int i=1; i<=9; i++){
for(int j=1; j<=9; j++){
vector<int>TAKA(10);
vector<int>AO(10);
vector<int>WA(10);
for(int k=0; k<4; k++){
int n=int(S[k]-'0');
TAKA[n]++;
WA[n]++;
n=int(T[k]-'0');
AO[n]++;
WA[n]++;
}
TAKA[i]++;
AO[j]++;
int f=0;
for(int k=0; k<10; k++){
if(TAKA[k]+AO[k]>K)f=1;
}
// cout << f << ' ' << i << ' ' << j << endl;
if(f==1)continue;
int taka=0;
int aoki=0;
for(int k=0; k<10; k++){
taka+=k*pow(10, TAKA[k]);
aoki+=k*pow(10, AO[k]);
}
if(taka<=aoki)continue;
//cout << i << ' ' << j << endl;
double a, b, c, d;
if(i!=j){
a=(K-WA[i]);
b=(K-WA[j]);
}
else if(i==j){
a=(K-WA[i]);b=(K-WA[i]-1);
}
c=(9*K-8); d=(9*K-9);
ans+=a/c*b/d;
}
}
cout << std::fixed << std::setprecision(9);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
double N,D,H,d,h;
double notans = 1000.0, tmp, ans;
cin >> N >> D >> H;
for(int i=0; i<N; i++){
cin >> d >> h;
tmp = (H-h)/(D-d);
if(tmp<notans) notans = tmp;
}
ans = H-notans*D;
if(ans<0.0) ans = 0.0;
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
void Main(){
int n; cin >> n;
if(n % 2) cout << "Black" << endl;
else cout << "White" << 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;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 9 * 1000000000000000000 //9*10^18
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
int main()
{
ll T;
cin >> T;
rep(i, T){
ll N, S, K;
cin >> N >> S >> K;
ll d = gcd(N, K);
if(S % d != 0){
cout << -1 << endl;
continue;
}
ll x = 0;
ll y = 0;
d = extGCD(N, -K, x, y);
x *= S / d;
y *= S / d;
ll M = (-d * y) / N;
vector<ll> t = {M-3, M-2, M-1, M, M+1, M+2, M+3};
ll ans = INF;
for(auto p : t){
if(y + N/d * p >= 0){
chmin(ans, y + N/d * p);
}
}
cout << ans << endl;
}
} |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 100010
using namespace std;
ll n,m,req[N],ans[N];
vector<pair<ll,ll> > ed,vt[N];
bool vis[N];
void dfs(ll x)
{
vis[x]=true;
ll i;
for(i=0;i<vt[x].size();i++)
{
if(ans[vt[x][i].S]!=-1)
{
continue;
}
ans[vt[x][i].S]=(ed[vt[x][i].S].F!=x);
if(!vis[vt[x][i].F])
{
dfs(vt[x][i].F);
}
}
return;
}
int main(){
ll x,y,i;
scanf("%lld%lld",&n,&m);
for(i=0;i<m;i++)
{
scanf("%lld%lld",&x,&y);
x--;
y--;
ed.push_back(make_pair(x,y));
vt[x].push_back(make_pair(y,i));
vt[y].push_back(make_pair(x,i));
}
for(i=0;i<n;i++)
{
scanf("%lld",&req[i]);
}
memset(ans,-1,sizeof(ans));
for(i=0;i<ed.size();i++)
{
if(req[ed[i].F]<req[ed[i].S])
{
ans[i]=1;
}
else if(req[ed[i].F]>req[ed[i].S])
{
ans[i]=0;
}
}
for(i=0;i<n;i++)
{
if(!vis[i])
{
dfs(i);
}
}
for(i=0;i<ed.size();i++)
{
if(ans[i]==0)
{
puts("->");
}
else
{
puts("<-");
}
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <assert.h>
#include <stack>
#include <string>
#include <ctime>
#include <chrono>
#include <random>
using namespace std;
//author: Legendary Grandmaster mshiladityam
//a beautiful problem
const int MAX = 1000;
bool arr[MAX + 1][MAX + 1] = { false };
vector<int> adjC[MAX + 1], adjR[MAX + 1];
bool visC[MAX + 1] = { false }, visR[MAX + 1] = { false };
void DFS(int v, bool b)
{
if (b)
{
visC[v] = true;
for (auto u : adjC[v])
{
if (!visC[u]) DFS(u, b);
}
}
else
{
visR[v] = true;
for (auto u : adjR[v])
{
if (!visR[u]) DFS(u, b);
}
}
}
void solve()
{
int h, w;
cin >> h >> w;
for (int j = 1; j <= h; j++)
{
for (int i = 1; i <= w; i++)
{
char c;
cin >> c;
if (c == '#') arr[j][i] = true;
else arr[j][i] = false;
}
}
arr[1][1] = true;
arr[h][1] = true;
arr[1][w] = true;
arr[h][w] = true;
for (int j = 1; j <= h; j++)
{
bool f = false;
for (int i = 1; (i <= w) && (!f); i++)
{
if (arr[j][i])
{
f = true;
for (int q = i + 1; q <= w; q++)
{
if (arr[j][q])
{
adjC[i].push_back(q);
adjC[q].push_back(i);
}
}
}
}
}
for (int j = 1; j <= w; j++)
{
bool f = false;
for (int i = 1; i <= h; i++)
{
if (f) break;
if (arr[i][j])
{
f = true;
for (int q = i + 1; q <= h; q++)
{
if (arr[q][j])
{
adjR[i].push_back(q);
adjR[q].push_back(i);
}
}
}
}
}
int C = 0, R = 0;
for (int j = 1; j <= w; j++)
{
if (!visC[j])
{
DFS(j, true);
C++;
}
}
for (int j = 1; j <= h; j++)
{
if (!visR[j])
{
DFS(j, false);
R++;
}
}
cout << min(R, C) - 1 << "\n";
return;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(NULL); cout.tie(NULL);
int t;
//cin >> t;
t = 1;
while (t--)
{
solve();
}
return 0;
} |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int t;
map<int,int> A;
for(int i=0;i<N;i++){
cin>>t;
A[t]+=1;
}
vector<int> B;
for(int i=0;i<N;i++){
cin>>t;
B.push_back(t);
}
unsigned long long r=0;
for(int i=0;i<N;i++){
cin>>t;
r+=A[B[t-1]];
}
cout<<r<<endl;
} | #include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
char nums[10] = { '0','1','2','3','4','5','6','7','8','9' };
char alphsl[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' };
const int MOD = 1000000007;
char alphs[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' };
void solve() {
int n;
cin>>n;
vi v(n);
for(auto& x : v) cin>>x;
int ans=v[0];
for(int i=1; i<n; i++){
ans=__gcd(ans, v[i]);
}
cout<<ans<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool chk(string &s,string t){
int n=(int)(s.length());
for(int i=0;i<n;i++){
if(s[i]!=t[i%3]) return false;
}
return true;
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin>>n;
string s;
cin>>s;
int tot=1e10;
int tms=0;
if(n==1){
if(s[0]=='0') tms=tot;
else tms=2*tot;
}
else if(n==2){
if(s=="11"||s=="10") tms=tot;
else if(s=="01") tms=tot-1;
}
else{
if(s.substr(0,3)=="110"){
if(chk(s,"110")){
int toen=(n-1)/3;
tms=tot-toen;
}
}
else if(s.substr(0,3)=="101"||s.substr(0,3)=="011"){
if(chk(s,s.substr(0,3))){
int toadd=0;
if(s.substr(0,3)=="011") toadd=1;
int toen=(n+toadd)/3;
tms=tot-toen;
}
}
}
cout<<tms;
return 0;
} | #include <bits/stdc++.h>
#define se second
#define sz(x) (int)(x.size())
#define ll long long
#define rep(i,x,y) for(int i = x; i <= y; ++i)
#define repr(i,x,y) for(int i = x; i >= y; --i)
#define pb push_back
#define mp make_pair
#define fi first
#define ull unsigned ll
#define pi 3.14159265358979
using namespace std;
const int N = (int)(1e6) + 322;
const ll INF = 2e18 + 17;
const int inf = 2e9;
const int mod = 1000000007;
const double eps = 1e-9;
template<typename T>
void pop_front(vector<T>& vec)
{
assert(!vec.empty());
vec.erase(vec.begin());
}
int gcd(int a, int b) { return b ? gcd (b, a % b) : a; }
int nbr_bits(int a){
return log2(a)+1;
}
int fastpow(int a, int n, int mod) {
if(n==0)
return 1;
if(n%2==0){
int res = fastpow(a,n/2,mod);
res*=res;
res%=mod;
return res;
}
int res = (fastpow(a,n-1,mod)*a)%mod;
return res;
}
// ---------------------------------------------------
int p[N];
stack<string> answers;
int find(int u){
if(p[u]==u) return u;
return p[u] = find(p[u]);
}
bool bubleSort(vector<int> v, int n){
int ans = 0;
int m = (n * (n -1)) / 2;
rep(i, 0, n-1){
rep(j, 0, n-2){
if(v[j] > v[j + 1]){
swap(v[j], v[j + 1]);
ans++;
}
}
}
if(ans < m) return true;
else return false;
}
signed main()
{
// int t;
// cin >> t;
//
// while(t--){
//
int x, y;
cin >> x >> y;
int k = max(x,y);
int l = min(x,y);
int rest = k - l ;
if(rest >= 3) cout << "No" << endl;
else cout << "Yes" << endl;
// }
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin>>n>>m;
vector<string> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
// vector<ll> b(n);
ll e=0,o=0;
for(int i=0;i<n;i++){
int c=0;
for(int j=0;j<a[i].length();j++){
c+=a[i][j]-'0';
}
// b[i]=c;
if(c%2){
o++;
}else{
e++;
}
}
// sort(b.begin(),b.end());
ll ans=n*(n-1)/2;
// ll d=1;
// for(int i=1;i<n;i++){
// if(b[i]!=b[i-1]){
// ans-=d*(d-1)/2;
// d=1;
// }else{
// d++;
// }
// }
// ans-=d*(d-1)/2;
ans-=e*(e-1)/2;
ans-=o*(o-1)/2;
cout<<ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using Vec2 = vector<vector<T>>;
#define REP(i, m, n) for(ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for(ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for(ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
template <class T1, class T2>
bool chmax(T1 &a, const T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2>
bool chmin(T1 &a, const T2 b) { if (a > b) { a = b; return true; } return false; }
template <class T>
istream &operator>>(istream &is, vector<T> &v) { for (T &i : v) is >> i; return is; }
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) { for (const T &i : v) os << i << ' '; return os; }
void co() { cout << '\n'; }
template <class Head, class... Tail>
void co(Head&& head, Tail&&... tail) { cout << head << ' '; co(forward<Tail>(tail)...); }
void ce() { cerr << '\n'; }
template <class Head, class... Tail>
void ce(Head&& head, Tail&&... tail) { cerr << head << ' '; ce(forward<Tail>(tail)...); }
void sonic() { ios::sync_with_stdio(false); cin.tie(nullptr); }
void setp(const int n) { cout << fixed << setprecision(n); }
constexpr int64_t LINF = 1000000000000000001;
constexpr int64_t MOD = 1000000007;
constexpr int64_t MOD_N = 998244353;
constexpr long double EPS = 1e-11;
const double PI = acos(-1);
template <typename T>
struct BIT {
int64_t N;
vector<T> data;
BIT(int64_t n) {
init(n);
}
const T &operator[](const int64_t i) const {
return at(i);
}
T at(int64_t k) { return sum(k) - sum(k - 1); }
void init(int64_t n) {
N = 1;
while (N <= n) N <<= 1;
data.assign(N, 0);
}
void build(vector<T> v) {
init(N);
for (int i = 0; i < v.size(); ++i) {
add(i, v[i]);
}
}
void add(int64_t k, T x) {
++k;
while (k <= N) {
data[k] += x;
k += k & -k;
}
}
void update(int64_t k, T x) {
add(k, x - at(k));
}
T sum(int64_t k) {
T res = 0;
while (k) {
res += data[k];
k -= k & -k;
}
return res;
}
T sum(int64_t a, int64_t b) { return sum(b) - sum(a); }
T lower_bound(T k) {
int64_t l = 0, r = N;
while (r - l > 1) {
int64_t m = (l + r) / 2;
if (sum(m) >= k) r = m;
else l = m;
}
return r;
}
};
int main(void) {
ll h, w;
cin >> h >> w;
ll m;
cin >> m;
VecP ps(m);
rep(i, m) cin >> ps[i].first >> ps[i].second;
sort(all(ps));
Vec my(h + 1, w + 1);
rep(i, m) chmin(my[ps[i].first], ps[i].second);
repn(i, h) {
if (my[i - 1] == 1) my[i] = 1;
}
BIT<ll> bit(w + 10);
set<ll> st;
REPN(i, my[1], w) {
bit.add(i, 1);
st.insert(i);
}
ll ans = 0;
ll pos = 0;
repn(i, h) {
while (pos < m && ps[pos].first == i) {
if (st.find(ps[pos].second) == st.end()) {
bit.add(ps[pos].second, 1);
st.insert(ps[pos].second);
}
++pos;
}
ans += bit.sum(my[i], w + 1);
// ce(i, ans);
}
co(h * w - ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define ar array
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
string grid[h];
for (int i=0; i<h; i++) {
cin >> grid[i];
}
int c=0;
for (int i=1; i<h; i++) {
bool ok=0;
for (int j=0; j<w; j++) {
if (grid[i-1][j]=='.'&&grid[i][j]=='#') {
if (!ok) c++, ok=1;
} else ok=0;
}
}
for (int i=h-2; i>=0; i--) {
bool ok=0;
for (int j=0; j<w; j++) {
if (grid[i+1][j]=='.'&&grid[i][j]=='#') {
if (!ok) c++, ok=1;
} else ok=0;
}
}
for (int j=1; j<w; j++) {
bool ok=0;
for (int i=0; i<h; i++) {
if (grid[i][j-1]=='.'&&grid[i][j]=='#') {
if (!ok) c++, ok=1;
} else ok=0;
}
}
for (int j=w-2; j>=0; j--) {
bool ok=0;
for (int i=0; i<h; i++) {
if (grid[i][j+1]=='.'&&grid[i][j]=='#') {
if (!ok) c++, ok=1;
} else ok=0;
}
}
cout << c;
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 998244353;
const ll INF = 1e16;
int main() {
ll h, w;
cin >> h >> w;
vector<string> board(h);
rep(i, h) {
cin >> board[i];
}
ll ans = 1;
exrep(x, 0, h + w - 2) {
vl cnt(3);
rep(i, h) {
ll j = x - i;
if(j < 0 || w <= j) {
continue;
}
if(board[i][j] == 'R') {
cnt[1]++;
}
else if(board[i][j] == 'B') {
cnt[2]++;
}
else if(board[i][j] == '.') {
cnt[0]++;
}
}
if(cnt[1] > 0 && cnt[2] > 0) {
ans = 0;
}
else if(cnt[1] == 0 && cnt[2] == 0) {
ans = ans * 2LL % mod;
}
}
out(ans);
re0;
} |
#include<bits/stdc++.h>
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define pl pair<ll,ll>
#define mod 1000000007
#define INF 1000000001
#define forn(i,n) for(ll i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
typedef long long int ll;
ll gcd(ll a,ll b)
{
if(b==0) return a;
return gcd(b,a%b);
}
//////////////////////////////////// JAI SHREE RAM /////////////////////////////////////
const ll N=1e5;
void JAISHREERAM()
{
ll n,i,j,ans=0;
ll a,b;
cin>>a>>b;
ans=1;
vector<int> f(200001,0);
for(i=a;i<=b;i++)
{
for(j=1;j*j<=i;j++)
{
if(i%j==0)
{
f[i/j]++;
if(f[i/j]>1) ans=max(ans,i/j);
if(i/j!=j)
{
int x=i/j;
f[i/x]++;
if(f[i/x]>1) ans=max(ans,i/x);
}
}
}
}
cout<<ans;
}
int main()
{
fast;
int T=1;
// cin>>T;
for(int t=1;t<=T;t++)
{
// codejam
JAISHREERAM();
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int main(){
fastio ;
int a , b ;
cin >> a >> b ;
int num = b - a ;
for(int i = num ; i >= 1 ; i--){
int x = b/i;
if((x-1)*i >= a){
cout << i ;
break;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " << a << endl; }
#define endl '\n'
#define fi first
#define se second
using lint = long long;
using ld = long double;
using P = pair<int,int>;
using Pl = pair<lint,lint>;
template<class T> using V = vector<T>;
template<class T> using priq = priority_queue<T>;
template<class T> using priq_inv = priority_queue<T, vector<T>, greater<T>>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
template<class T> T ceil(const T &a, const T &b) { return ((a)+(b)-1)/b; }
template<class T> bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> void YesorNo(T x) { printf(x ? "Yes\n" : "No\n"); }
struct INF { template<class T> operator T() { return numeric_limits<T>::max() / 2; } } INF;
template<class T, class U> istream& operator>>(istream &in, pair<T,U> &p) {
return in >> p.first >> p.second;
}
template<class T, class U> ostream& operator<<(ostream &out, const pair<T,U> &p) {
return out << '{' << p.first << ',' << p.second << '}';
}
template<class T> istream& operator>>(istream &in, vector<T> &v) {
for(auto &&e : v) in >> e;
return in;
}
template<class T> ostream& operator<<(ostream &out, const vector<T> &v) {
for(const auto &e : v) out << e << ' ';
return out;
}
/*----------------------------------------------------------------------------------------------------*/
int main(){
int n;
cin >> n;
int idx = 1;
int now = 1;
V<int> ans(n); ans[0] = 1;
for(int i = 2; i <= n; i++) {
if(i % idx == 0) {
idx = i;
now++;
}
ans[i-1] = now;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "dfs"
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
#define ull unsigned long long
using namespace std;
const ll mod = 1e9+7;
const ll N = 1e6+55;
vector<ll> adj[N], dx[N], dy[N];
vector<ll> kq;
string s;
ll n, m, t, k, b[N], a[N], ans, tong, c[N], d[N], cnt;
pll p[N];
ll pw(ll k, ll n)
{
ll total = 1;
for(; n; n >>= 1)
{
if(n & 1)total = total * k % mod;
k = k * k % mod;
}
return total;
}
ll cs(ll x)
{
ll cnt = 0;
while(x > 0)
{
++cnt;
x /= 10;
}
return cnt;
}
void sol()
{
cin >> n;
m = cs(n);
k = 0;
t = 1;
for(int i = 1; i < m; i ++)
{
k = k *10 + 9;
ans += (k - t + 1) * ((i-1) / 3);
t *= 10;
}
cout << ans + ((m-1)/3) * (n - k);
}
int main()
{
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ntest = 1;
//cin >> ntest;
sol();
}
/*
4
2 3 6 5
1 2 8 8
4 7 4 5
2 5 1 2
https://codeforces.com/problemset/problem/1239/D
*/
|
#include <bits/stdc++.h>
using namespace std;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);
//int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe") >> 8), 0);
using Int = long long;
int main() {
int N; cin >> N;
for (int i = 1; i <= N; i++) {
cout << (2*i+0) % N + 1 << ' ' << (2*i+1) % N + 1 << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
//#include <atcoder/all>
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) LL((a).size())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define ROF(i,a,b) for(LL 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 LL LARGE_INT = 1e9+100;
const LL INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const LL 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()
{
string s;cin>>s;
LL n = SIZE(s);
map<LL,LL> mp;
REP(i,n){
mp[s[i]-'0']++;
}
if(n==1){
if(mp[8] == 0){
cout<<"No"<<endl;
return;
}
else{
cout<<"Yes"<<endl;
return;
}
}
else if(n==2){
for(LL i=16;i<1000;i+=8){
map<LL,LL> x;
LL t = i;
bool f = true;
while(t!=0){
if(t%10 == 0){
f = false;
}
x[t%10]++;
t/=10;
}
REP(i,10){
if(mp[i] < x[i]){
f = false;
break;
}
}
if(f){
cout<<"Yes"<<endl;
return;
}
}
cout<<"No"<<endl;
}
else {
for(LL i=104;i<1000;i+=8){
map<LL,LL> x;
LL t = i;
bool f = true;
while(t!=0){
if(t%10 == 0){
f = false;
}
x[t%10]++;
t/=10;
}
REP(i,10){
if(mp[i] < x[i]){
f = false;
break;
}
}
if(f){
cout<<"Yes"<<endl;
return;
}
}
cout<<"No"<<endl;
}
return;
}
int main()
{
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} |
// 解き直し.
// https://atcoder.jp/contests/keyence2021/editorial/564
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
const LL MOD = 998244353;
const LL DIV3 = 332748118;
const int MAX = 5050;
char board[MAX][MAX];
LL dp[MAX][MAX];
// Fermat's little theorem から, 大きな冪乗の計算を行う.
// @param a: べき乗したい正整数.
// @param b: 指数.
// @return: べき乗した計算結果(mod版).
LL mPow(LL a, LL b){
LL t = 1;
while(b){
if(b & 1) t = (t * a) % MOD;
a = a * a % MOD;
b >>= 1;
}
return t % MOD;
}
int main(){
// 1. 入力情報.
int H, W, K;
scanf("%d %d %d", &H, &W, &K);
rep(h, MAX) rep(w, MAX) board[h][w] = '.';
rep(i, K){
int h, w;
char c[11];
scanf("%d %d %s", &h, &w, c);
h--, w--;
board[h][w] = c[0];
}
// 2. dp更新.
dp[0][0] = 1;
rep(h, H){
rep(w, W){
// 2-1. 開始地点は, Skip.
if(h ==0 && w == 0) continue;
// 2-2. 行方向更新.
if(h){
// マス目(h - 1, w) の 値.
char op = board[h - 1][w];
LL cur = dp[h - 1][w];
// マス目(h - 1, w) が, 空欄 の 場合.
if(op == '.'){
cur *= 2LL;
cur %= MOD;
cur *= DIV3;
cur %= MOD;
}
// マス目(h - 1, w) が, 'X', 'D' の 場合(何もしない).
// if(op == 'X' || op == 'D'){}
// マス目(h - 1, w) が, 'R' の 場合.
if(op == 'R') cur = 0;
// マス目(h, w) を 更新.
dp[h][w] += cur;
dp[h][w] %= MOD;
}
// 2-3. 列方向更新.
if(w){
// マス目(h, w - 1) の 値.
char op = board[h][w - 1];
LL cur = dp[h][w - 1];
// マス目(h, w - 1) が, 空欄 の 場合.
if(op == '.'){
cur *= 2LL;
cur %= MOD;
cur *= DIV3;
cur %= MOD;
}
// マス目(h, w - 1) が, 'X', 'R' の 場合(何もしない).
// if(op == 'X' || op == 'R'){}
// マス目(h, w - 1) が, 'D' の 場合.
if(op == 'D') cur = 0;
// マス目(h, w) を 更新.
dp[h][w] += cur;
dp[h][w] %= MOD;
}
}
}
// 3. 3 の (H * W - K)乗.
LL ans = dp[H - 1][W - 1];
ans *= mPow(3LL, (LL)(H * W - K));
ans %= MOD;
// 4. 出力.
printf("%lld\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000030;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
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;
}
ll mod(ll val, ll M) {
val = val % M;
if(val < 0) {
val += M;
}
return val;
}
template<typename T>
T RS(T N, T P, T M){
if(P == 0) {
return 1;
}
if(P < 0) {
return 0;
}
if(P % 2 == 0){
ll t = RS(N, P/2, M);
if(M == -1) return t * t;
return t * t % M;
}
if(M == -1) {
return N * RS(N,P - 1,M);
}
return N * RS(N, P-1, M) % M;
}
ll dp[5050][5050];
int main() {
int H,W,K;
cin >> H >> W >> K;
vector<vector<int>> vec(H,vector<int>(W));
for(int i = 0;i < K;i++) {
int h,w;
char c;
cin >> h >> w >> c;
h--;
w--;
if(c == 'R') {
vec.at(h).at(w) = 1;
}
else if(c == 'D') {
vec.at(h).at(w) = 2;
}
else {
vec.at(h).at(w) = 3;
}
}
ll inv = RS((ll)3,MOD - 2,MOD);
for(int i = 0;i < 5050;i++) {
for(int j = 0;j < 5050;j++) {
dp[i][j] = 0;
}
}
dp[0][0] = RS((ll)3,(ll)H * W - K,MOD);
for(int i = 0;i < H;i++) {
for(int j = 0;j < W;j++) {
if(vec.at(i).at(j) == 1) {
dp[i][j + 1] += dp[i][j];
}
else if(vec.at(i).at(j) == 2) {
dp[i + 1][j] += dp[i][j];
}
else if(vec.at(i).at(j) == 3) {
dp[i][j + 1] += dp[i][j];
dp[i + 1][j] += dp[i][j];
}
else {
dp[i][j + 1] += dp[i][j] * 2 * inv % MOD;
dp[i + 1][j] += dp[i][j] * 2 * inv % MOD;
}
dp[i][j + 1] %= MOD;
dp[i + 1][j] %= MOD;
}
}
cout << dp[H - 1][W - 1] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define pra(i,k,n) for(i=k;i<n;i++)
#define all(a) a.begin(), b.begin()
int main() {
string s; cin >> s;
int i, n = s.size();
string t = "";
pra(i,0,n) {
if (s[i]=='.') break;
t += s[i];
}
cout << t << '\n';
return 0;
} | #include<iostream>
#include<vector>
#include<math.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
long long int mod = 1e9+7;
int main(){
long long int n;
cin>>n;
vector<long long int>a(1000000,0);
for (long long int i = 0;(i+1)*(i+1)<=n;i++){
if(n%(i+1)==0){
printf("%lld\n",i+1);
if((i+1)*(i+1)!=n){
a[i] = n/(i+1);
}
}
}
rep(i,1000000){
if(a[1000000-i-1]!=0){
printf("%lld\n",a[1000000-i-1]);
}
}
return 0;
} |
#include <bits/stdc++.h>
#define forn(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7,N=2e5+5;
void solve(){
int n;
string s[64];
cin>>n;
forn(i,1,n) {
cin>>s[i];
// cout<<s[i]<<endl;
}
ll dp[64][2]={0};
if(s[1]=="AND"){
dp[1][1]=1;
dp[1][0]=3;
} else if(s[1]=="OR"){
dp[1][1]=3;
dp[1][0]=1;
}
forn(i,2,n){
if(s[i]=="AND"){
dp[i][1]+=dp[i-1][1];
dp[i][0]+=2*dp[i-1][0]+dp[i-1][1];
} else if(s[i]=="OR"){
dp[i][1]+=2*dp[i-1][1]+dp[i-1][0];
dp[i][0]+=dp[i-1][0];
}
}
// forn(i,0,1){
// forn(j,1,n){
// cout<<dp[j][i]<<" ";
// }
// cout<<endl;
// }
cout<<dp[n][1]<<endl;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int t=1;
// cin>>t;
forn(i,1,t){
solve();
}
} | #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ll
#define ll long long
#define reg register
#define db double
#define il inline
#define gc getchar
#define pc putchar
#define HgS 1000000007
il ll rd()
{
reg ll res=0,lab=1;
reg char ch=gc();
while((ch<'0'||ch>'9')&&ch!=EOF)
{if(ch=='-')lab=-lab;ch=gc();}
while(ch>='0'&&ch<='9')
res=(res<<3)+(res<<1)+(ch&15),ch=gc();
return res*lab;
}
il void prt(ll x,char t='\n')
{
static char ch[70];int tp=0;
if(!x){fputs("0",stdout);if(t)pc(t);return;}
if(x<0)pc('-'),x=-x;
while(x)ch[++tp]=(x%10)^48,x/=10;
while(tp)pc(ch[tp--]);
if(t)pc(t);
}
il ll umax(ll a,ll b){return a>b?a:b;}
il ll umin(ll a,ll b){return a<b?a:b;}
ll n,k,f[4][3000005],s,s2;
int main()
{
n=rd();k=rd();f[2][2]=f[3][3]=1;
for(int i=1;i<=n;++i)f[1][i]=1;
for(int i=3;i<=2*n;++i)f[2][i]=i>n?2*n-i+1:i-1;
ll tmp=f[2][2];
for(int i=4;i<=3*n;++i)
{
if(i<=2*n+1)tmp+=f[2][i-1];
if(i>=n+2)tmp-=f[2][i-n-1];
f[3][i]=tmp;
}
for(int i=3;i<=3*n;++i)
{
if(k<=f[3][i]){s=i;break;}
k-=f[3][i];
}
for(int i=1;i<=n;++i)
{
if(s-i>2*n||s<=i)continue;
if(k<=f[2][s-i]){s2=i;break;}
k-=f[2][s-i];
}
//cerr<<s<<' '<<s2<<' '<<k<<endl;
prt(s2,' ');tmp=umax(0,s-s2-n-1)+k;
prt(tmp,' ');prt(s-s2-tmp);
return 0;
} |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
//typedef tree<int,null_type,less<int >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template<class T1, class T2>
ostream &operator <<(ostream &os, pair<T1,T2>&p);
template <class T>
ostream &operator <<(ostream &os, vector<T>&v);
template <class T>
ostream &operator <<(ostream &os, set<T>&v);
template <class T1, class T2>
ostream &operator <<(ostream &os, map<T1,T2>&v);
#ifdef APURBA
#define HERE cout<<"here - "<<__LINE__<<"\n";
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it)
{
cout<<endl;
}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cout << *it << " = " << a << " ";
err(++it, args...);
}
#else
#define HERE
#define debug(args...)
#endif
const int N = 400000 +5;
const ll mod = 1e9 + 7;
typedef pair<int,int> pii;
int mp[N];
vector<int>adj[N];
bool vis[N];
void dfs(int s, int &cnt, int &cnt2)
{
cnt+= adj[s].size();
cnt2++;
vis[s]=1;
for(int i:adj[s])
{
if(!vis[i])
dfs(i,cnt,cnt2);
}
}
void TEST_CASES(int cas)
{
int n;
cin>>n;
int now = 1;
for(int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
int u,v;
if(mp[x]==0)
{
mp[x]= now;
now++;
}
if(mp[y]==0)
{
mp[y] = now;
now++;
}
adj[mp[x]].push_back(mp[y]);
adj[mp[y]].push_back(mp[x]);
}
int ans = 0;
for(int i=1;i<now;i++)
{
if(vis[i]==0)
{
int cnt =0, cnt2 = 0;
dfs(i,cnt , cnt2);
assert(cnt%2==0);
cnt/=2;
if(cnt==cnt2-1)
{
ans+= cnt2-1;
}
else{
ans+= cnt2;
}
}
}
cout<<ans<<"\n";
}
/*
*/
int32_t main()
{
#ifndef APURBA
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#endif
//freopen("input.txt","r",stdin);
//freopen("out1.txt","w",stdout);
int t=1,cas=0;
//cin>>t;
while(t--)
{
TEST_CASES(++cas);
}
return 0;
}
template<class T1, class T2>
ostream &operator <<(ostream &os, pair<T1,T2>&p)
{
os<<"{"<<p.first<<", "<<p.second<<"} ";
return os;
}
template <class T>
ostream &operator <<(ostream &os, vector<T>&v)
{
os<<"[ ";
for(int i=0; i<v.size(); i++)
{
os<<v[i]<<" " ;
}
os<<" ]";
return os;
}
template <class T>
ostream &operator <<(ostream &os, set<T>&v)
{
os<<"[ ";
for(T i:v)
{
os<<i<<" ";
}
os<<" ]";
return os;
}
template <class T1, class T2>
ostream &operator <<(ostream &os, map<T1,T2>&v)
{
for(auto i:v)
{
os<<"Key : "<<i.first<<" , Value : "<<i.second<<endl;
}
return os;
}
| #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 ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep_a(i,a,n) for(int i=a;i<n;i++)
#define all(ds) ds.begin(), ds.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
typedef vector< long long > vi;
typedef pair<long long, long long> ii;
typedef priority_queue <ll> pq;
#define o_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
const ll mod = 1000000007;
const ll INF = (ll)1e18;
const ll MAXN = 200006;
ll po(ll x, ll n){
ll ans=1;
while(n>0){ if(n&1) ans=(ans*x)%mod; x=(x*x)%mod; n/=2;}
return ans;
}
int fen[MAXN];
void upd(int pos){
while(pos<MAXN){
fen[pos]++;
pos|=(pos+1);
}
}
ll qr(int pos){
ll ret = 0;
while(pos>=0){
ret+=fen[pos];
pos&=(pos+1);
pos--;
}
return ret;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
//cin >> T;
while(T--){
int n;
cin>>n;
ll a[n], b[n];
rep(i,n) cin>>a[i];
rep(i,n) cin>>b[i];
rep(i,n){
a[i]+=i;
b[i]+=i;
}
map<ll, vector<int> > m;
rev(i,n-1){
m[a[i]].pb(i);
}
int f=0;
int nap=0;
rep(i,n){
if(m.find(b[i])==m.end()){
f=1;
break;
}
a[m[b[i]].back()]=nap++;
m[b[i]].pop_back();
if(m[b[i]].empty()) m.erase(b[i]);
}
if(f){
cout<<-1<<el;
return 0;
}
ll ans = 0;
rep(i,n){
ans += qr(MAXN)-qr(a[i]);
upd(a[i]);
}
cout<<ans<<el;
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (ll i = ((ll)(x)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;//llの最大9*10^18
const int INF = pow(2, 30) - 1;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
string S;
cin >> N;
vector<ll> A(N),B(N),C(N);
REP(i,N){
cin >> A.at(i);
}
REP(i, N)
{
cin >> B.at(i);
}
REP(i, N)
{
cin >> C.at(i);
}
vector<ll> vecB(100000+1,0);
REP(i,N){
vecB.at(B.at(C.at(i)-1))++;
}
//debug(vecB);
ll ans = 0;
REP(i,N){
if(vecB.at(A.at(i))>0){
ans += vecB.at(A.at(i));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define dump(x) cout << #x << " = " << (x) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define COUT(x) cout<<(x)<<endl
#define SCOUT(x) cout<<(x)<<" "
#define VECCOUT(x) for(auto&youso_: (x) )cout<<right<<setw(10)<<youso_<<" ";cout<<endl
#define ENDL cout<<endl
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) long long __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define mp make_pair
#define PQ priority_queue<long long>
#define PQG priority_queue<long long,V,greater<long long>>
typedef long long ll;
typedef vector<long long> vl;
typedef vector<long long> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<vc> vvc;
typedef pair<long long, long long> pll;
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
template<class T>
void mod(T &x) {
x %= MOD;
x += MOD;
x %= MOD;
}
ll GCD(ll a, ll b) {
if(b == 0) return a;
else return GCD(b, a%b);
}
struct COMB{
vl fact, fact_inv, inv;
void init_nCk(long long SIZE) {
fact.resize(SIZE + 5);
fact_inv.resize(SIZE + 5);
inv.resize(SIZE + 5);
fact.at(0) = fact.at(1) = fact_inv.at(0) = fact_inv.at(1) = inv.at(1) = 1;
for(long long i = 2; i < SIZE + 5; i++) {
fact.at(i) = fact.at(i - 1)*i%MOD;
inv.at(i) = MOD - inv.at(MOD%i)*(MOD/i)%MOD;
fact_inv.at(i) = fact_inv.at(i - 1)*inv.at(i)%MOD;
}
}
long long nCk (long long n, long long k) {
assert(!(n < k));
assert(!(n < 0 || k < 0));
return fact.at(n)*(fact_inv.at(k)*fact_inv.at(n - k)%MOD)%MOD;
}
};
ll extGCD(ll a, ll b, ll &x, ll &y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a/b*x;
return d;
}
void Main() {
LCIN(N);
vl x(N), y(N);
for(int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i);
}
ll ans = 0;
for(int i = 0; i < N; i++) {
for(int j = i + 1; j < N; j++) {
int X = x.at(i) - x.at(j);
int Y = y.at(i) - y.at(j);
if(abs(X) >= abs(Y)) ans++;
}
}
cout << ans << endl;
}
int main() {
cout << fixed << setprecision(15);
Main();
return 0;
} |
//Bismillahir-Rahmanir-Rahim
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int llu;
#define f1(i,n) for(i=1;i<=n;i++)
#define f(i,n) for(i=0;i<n;i++)
#define Max 100009
#define pb push_back
#define mp make_pair
#define cy "YES\n"
#define cn "NO\n"
using namespace std;
int main()
{
ll n,i,j,m,s=0,mx,mn;
cin>>n;
ll in1,in2,mx1=0,mx2=0;
n=pow(2,n);
ll a[n+1];
f1(i,n) cin>>a[i];
for(i=1;i<=n/2;i++)
{
if(a[i]>mx1)
{
mx1=a[i];
in1=i;
}
}
for(i=n/2+1;i<=n;i++)
{
if(a[i]>mx2)
{
mx2=a[i];
in2=i;
}
}
if(mx1>mx2)
cout<<in2<<endl;
else cout<<in1<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define popcount __builtin_popcount
#define next __next
#define prev __prev
#ifndef LOCAL
#define dmp(...) ;
#else
#define dmp(...) \
cerr << "[ " << #__VA_ARGS__ << " ] : " << dump_str(__VA_ARGS__) << endl
#endif
// ---------------- Utility ------------------
template <class T>
bool chmin(T &a, const T &b) {
if (a <= b) return false;
a = b;
return true;
}
template <class T>
bool chmax(T &a, const T &b) {
if (a >= b) return false;
a = b;
return true;
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
vector<T> vect(int len, T elem) {
return vector<T>(len, elem);
}
// ----------------- Input -------------------
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
return is >> p.first >> p.second;
}
template <class T>
istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) is >> vec[i];
return is;
}
// ----------------- Output ------------------
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << p.first << ',' << p.second;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &e : v) os << e << " ";
return os;
}
template <class T>
ostream &operator<<(ostream &os, const deque<T> &d) {
for (const T &e : d) os << e << " ";
return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &s) {
os << "{ ";
for (const T &e : s) os << e << " ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
os << "{ ";
for (const auto &[key, val] : m) os << "( " << key << " -> " << val << " ) ";
return os << "}";
}
template <class TupleTy, size_t... I>
void dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {
(..., (os << (I == 0 ? "" : ",") << std::get<I>(t)));
}
template <class... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
os << "(";
dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());
return os << ")";
}
void dump_str_rec(ostringstream &) {}
template <class Head, class... Tail>
void dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {
oss << ", " << head;
dump_str_rec(oss, forward<Tail>(tail)...);
}
template <class T, class... U>
string dump_str(T &&arg, U &&... args) {
ostringstream oss;
oss << arg;
dump_str_rec(oss, forward<U>(args)...);
return oss.str();
}
// --------------- Fast I/O ------------------
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
// ------------ End of template --------------
#define endl "\n"
using ll = long long;
using pii = pair<int, int>;
void solve() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') break;
cout << s[i];
}
cout << endl;
return;
}
int main() {
fastio();
solve();
// int t; cin >> t; while(t--)solve();
// int t; cin >> t;
// for(int i=1;i<=t;i++){
// cout << "Case #" << i << ": ";
// solve();
// }
return 0;
}
|
// Problem: F - Close Group
// Contest: AtCoder - AtCoder Beginner Contest 187
// URL: https://atcoder.jp/contests/abc187/tasks/abc187_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define F(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end()
using ld = long double;
using vi = vector <int>;
using mi = map <int, int>;
using pii = pair <int, int>;
const int N = 600005;
const int MOD = 1e9 + 7;
#define show(arr) { for (auto x: arr) cout << x << " "; cout << '\n'; }
#define show_(arr, n) F(i, n) show(arr[i])
int adj[20][20];
int dp[N];
int dist[N];
void solve() {
int n,m, ans = 0; cin>>n>>m;
F(i, m){
int x,y;
cin>>x>>y; x--; y--;
adj[x][y]=1;
adj[y][x]=1;
}
int a = 0;
for(int i=0;i<n;i++) a += (1ll<<i);
F(i,(1ll<<n)){
dp[i]=0;
}
dp[0]=1;
F(i,(1ll<<n)){
dist[i] = 1e9;
for(int j=0;j<n;j++){
if(dp[i^(1ll<<j)]){
bool ok=1;
int x=(i^(1ll<<j));
for(int k=0;k<n;k++){
if(k==j) continue;
if(((1ll<<k) & x )&&(adj[k][j]==0)){ ok=0; break;}
}
if(ok){
dp[i]=1;
break;
}
}
}
}
dist[0]=0;
for(int i=0;i+1<(1<<n);i++)
{
int j=0;
while(i>>j&1)j++;
int t=~i&(1<<n)-1;
t^=1<<j;
for(int k=t;;k=k-1&t)
{
if(dp[k|1<<j])
{
dist[i|k|1<<j]=min(dist[i|k|1<<j],dist[i]+1);
}
if(k==0)break;
}
}
cout<<dist[(1<<n)-1]<<endl;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int32_t t=1;
// cin >> t;
while (t--) solve();
return 0;
} | //abc187_f.cpp
//Sat Jan 9 16:04:40 2021
#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int n,m;
cin >> n >> m;
vector<int> e(n,0);
rep(i,m){
int a,b;
cin >> a >> b;
a--;b--;
e[a] += 1<<b;
e[b] += 1<<a;
}
vector<int> dp(1<<n,99999);
dp[0] = 0;
rep(i,1<<n){
if (i==0)continue;
rep(j,n){
if(1<<j&i){
int target = i-(1<<j);
if (dp[target]<=1 && (e[j]&target)==target){
dp[i] = 1;
}
break;
}
}
}
rep(i,1<<n){
for (int j=i;j>0;j=((j-1)&i)){
int k = i-j;
dp[i] = min(dp[i],dp[j]+dp[k]);
}
}
cout << dp[(1<<n)-1] << endl;
} |
/*...................................................................*
*............___..................___.....____...______......___....*
*.../|....../...\........./|...../...\...|.............|..../...\...*
*../.|...../.....\......./.|....|.....|..|.............|.../........*
*....|....|.......|...../..|....|.....|..|............/...|.........*
*....|....|.......|..../...|.....\___/...|___......../....|..___....*
*....|....|.......|.../....|...../...\.......\....../.....|./...\...*
*....|....|.......|../_____|__..|.....|.......|..../......|/.....\..*
*....|.....\...../.........|....|.....|.......|.../........\...../..*
*..__|__....\___/..........|.....\___/...\___/.../..........\___/...*
*...................................................................*
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
bool cmp1(const pair<pair<int,int>,int> &a, const pair<pair<int,int>,int> &b)
{
return a.first.first<b.first.first;
}
bool cmp2(const pair<pair<int,int>,int> &a, const pair<pair<int,int>,int> &b)
{
return a.first.second<b.first.second;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt=1;
//cin >> tt;
while(tt--)
{
int n;
cin >> n;
pair<pair<int,int>,int> p[n];
for(int i=0;i<n;i++)
{
cin >> p[i].first.first >> p[i].first.second;
p[i].second = i;
}
sort(p,p+n,cmp1);
map<pair<int,int>,int> marked;
vector<int> t;
if(marked[{p[0].second,p[n-1].second}]==0)
{
t.push_back(max(abs(p[0].first.first-p[n-1].first.first),abs(p[0].first.second-p[n-1].first.second)));
marked[{p[0].second,p[n-1].second}]++;
}
if(marked[{p[0].second,p[n-2].second}]==0)
{
t.push_back(max(abs(p[0].first.first-p[n-2].first.first),abs(p[0].first.second-p[n-2].first.second)));
marked[{p[0].second,p[n-2].second}]++;
}
if(marked[{p[1].second,p[n-1].second}]==0)
{
t.push_back(max(abs(p[1].first.first-p[n-1].first.first),abs(p[1].first.second-p[n-1].first.second)));
marked[{p[1].second,p[n-1].second}]++;
}
sort(p,p+n,cmp2);
if(marked[{p[0].second,p[n-1].second}]==0)
{
t.push_back(max(abs(p[0].first.first-p[n-1].first.first),abs(p[0].first.second-p[n-1].first.second)));
marked[{p[0].second,p[n-1].second}]++;
}
if(marked[{p[0].second,p[n-2].second}]==0)
{
t.push_back(max(abs(p[0].first.first-p[n-2].first.first),abs(p[0].first.second-p[n-2].first.second)));
marked[{p[0].second,p[n-2].second}]++;
}
if(marked[{p[1].second,p[n-1].second}]==0)
{
t.push_back(max(abs(p[1].first.first-p[n-1].first.first),abs(p[1].first.second-p[n-1].first.second)));
marked[{p[1].second,p[n-1].second}]++;
}
sort(t.begin(),t.end());
cout << t[t.size()-2] << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int n,dsu[110],cnt;
int find(int x){return dsu[x]==x?x:dsu[x]=find(dsu[x]);}
void merge(int x,int y){dsu[find(x)]=find(y);}
pair<double,pair<int,int> >e[20100];
pair<int,int>p[110];
int main(){
scanf("%d",&n);
for(int i=0;i<=n+1;i++)dsu[i]=i;
for(int i=1;i<=n;i++)scanf("%d%d",&p[i].first,&p[i].second),e[++cnt]=make_pair(100-p[i].second,make_pair(0,i)),e[++cnt]=make_pair(p[i].second+100,make_pair(i,n+1));
for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)e[++cnt]=make_pair(sqrt((p[i].first-p[j].first)*(p[i].first-p[j].first)+(p[i].second-p[j].second)*(p[i].second-p[j].second)),make_pair(i,j));
sort(e+1,e+cnt+1);
for(int i=1;i<=cnt;i++){merge(e[i].second.first,e[i].second.second);if(find(0)==find(n+1)){printf("%lf\n",e[i].first/2);return 0;}}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> T(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> T.at(i);
sum = sum + T.at(i);
}
sum /= 2;
vector<bool> ans(sum + 1, false);
ans.at(0) = true;
int pmax = 0;
for (int i = 0; i < N; i++) {
for (int j = min(pmax, sum); j >= 0; j--) {
if (T.at(i) + j <= sum && ans.at(j) == true) {
ans.at(j + T.at(i)) = true;
}
}
pmax += T.at(i);
}
for (int i = sum; i >= 0; i--) {
if (ans.at(i) == true) {
cout << pmax - i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> void read(T &x) {
x = 0; int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + (ch - 48);
ch = getchar();
}
x *= f;
}
typedef long long LL;
int n;
LL ans = 1;
LL gcd(LL a, LL b) {
return (b == 0) ? a : gcd(b, a % b);
}
LL lcm(LL a, LL b) {
return a * b / gcd(a, b);
}
int main() {
read(n);
for (LL i = 2; i <= n; i++) {
ans = lcm(ans, i);
}
cout << ans + 1 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast \
ios_base ::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct \
ll t; \
cin >> t; \
while (t--)
#define bi begin()
#define ei end()
#define fi first
#define se second
#define foe(i, a, b) for (ll i = a; i < b; i++)
#define rfoe(i, a, b) for (ll i = a; i >= 0; i--)
#define sz(s) (ll) s.size()
#define mem(a, s) memset(a, s, sizeof(a))
#define all(v) v.bi, v.ei
#define MAX 8000000000000000064LL
#define MIN -8000000000000000064LL
typedef pair<ll, ll> pii;
ll add(ll a, ll b) { return (a % MOD + b % MOD + ((MAX) / MOD) * MOD) % MOD; }
ll sub(ll a, ll b) { return (a % MOD - b % MOD + ((MAX) / MOD) * MOD) % MOD; }
ll mul(ll a, ll b) { return ((a % MOD) * (b % MOD) + ((MAX) / MOD) * MOD) % MOD; }
long long binpow(long long a, long long b)
{
long long res = 1;
while (b > 0)
{
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll lcm(ll a, ll b) { return (a * b) / __gcd(a, b); }
// ll fact[1000007 ]={0};
// ll expo(ll x, ll y) {ll res=1;x=x%MOD;while(y>0){if(y&1)res=(1ll*res*x)%MOD;
// y=y>>1;x=(1ll*x*x)%MOD;} return res;}
// void facto() {fact[0]=1;fact[1]=1;for(ll i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%MOD;}
// ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(expo(fact[r],MOD-2)))%MOD; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res;}
// ll npr(ll n,ll r) {facto(); ll res=1; res=fact[n]; res=(res*(expo(fact[n-r],MOD-2)))%MOD; return res; }
int const N = 1e3 + 9;
ll const INF = 2e9 + 5;
ll dx[8] = {0, 0, 1, -1, 1, 1, -1, -1};
ll dy[8] = {1, -1, 0, 0, -1, 1, -1, 1};
char dr[4] = {'R', 'L', 'D', 'U'};
ll n, c, ans = INF, a[25];
void go(ll x, ll xr)
{
if (x == n)
{
ans = min(ans, xr);
return;
}
ll orr = 0;
foe(i, x, n)
{
orr |= a[i];
go(i + 1, xr ^ orr);
}
}
void solve()
{
cin >> n;
ll dp[32];
mem(dp, 0);
foe(i, 0, n)
{
cin >> a[i];
}
go(0, 0);
cout << ans << "\n";
}
int main()
{
fast
// facto();
// Sieve();
// ct
{
solve();
}
} | #include <bits/stdc++.h>
#define rep( i, a, b ) for( i = a; i < b; i ++ )
using namespace std;
struct sc {
int t;
int am;
public:
bool operator>( const sc &r ) const {
return t == r.t ? am > r.am : t > r.t;
}
};
int main() {
int le, li, u, am, f, t, i;
priority_queue< sc, vector< sc >, greater< sc > > scq;
cin >> le >> li;
rep( i, 0, le ) {
cin >> f >> t >> am;
scq.push( { f, am } );
scq.push( { t, -am } );
}
while( ! scq.empty() ) {
li -= scq.top().am;
if( li < 0 ) {
cout << "No" << endl;
return 0;
}
scq.pop();
}
cout << "Yes" << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
if(n==1 && m==0){
cout << 1 << " " << 2 << endl;
return 0;
}else if(m<0 || n-2<m){
cout << -1 << endl;
return 0;
}
for (ll i = 0; i < n-1; i++){
cout << 3*i+3 << " " << 3*i+1+3 << endl;
}
cout << 3*(n-m-2)-1+3 << " " << 3*n << endl;
return 0;
}
| // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define eq equal_range
#define fs first
#define ss second
#define ins insert
#define mkp make_pair
#define endl "\n"
using namespace std;
typedef vector<ll> vll;
typedef vector<int> vin;
typedef vector<char> vch;
typedef vector<string> vst;
typedef set<ll> sll;
typedef set<int> sint;
typedef set<char> sch;
typedef set<string> sst;
typedef queue<ll> qll;
typedef queue<int> qin;
typedef deque<ll> dqll;
typedef deque<int> dqint;
typedef priority_queue<ll> pqll;
typedef priority_queue<int> pqin;
typedef map<ll,ll> mpll;
typedef map<int,int> mpin;
typedef pair<ll,ll> pll;
typedef pair<int,int> pin;
const ll MOD=1000000007;
const long double PI=3.1415926535897932384626433832795;
ll pwr(ll b,ll p){ll res=1;while(p){if(p&1) {res*=b; p--;}else{b*=b; p>>=1;}}return res;}
ll mpwr(ll b,ll p){ll res=1;while(p){if(p&1) {res=(res*b)%MOD; p--;}else{b=(b*b)%MOD; p>>=1;}}return res;}
int msb (int n) {return 31-__builtin_clz(n);}
ll msbl (ll n) {return 63-__builtin_clzll(n);}
int lsb (int n) {return __builtin_ctz(n);}
ll lsbl (ll n) {return __builtin_ctzll(n);}
int setbit (int n) {return __builtin_popcount(n);}
ll setbitl (ll n) {return __builtin_popcountll(n);}
int main()
{
/*
freopen ("input.txt","r","stdin");
freopen ("output.txt","w","stdout");
*/
ios_base::sync_with_stdio(false) , cin.tie(NULL) , cout.tie(NULL);
int n; cin>>n;
vector <pair<int,string>> v (n);
F (i,0,n,1) {
cin>>v[i].ss>>v[i].fs;
}
sort (fall (v)); reverse (fall (v));
cout<<v[1].ss;
}
/* What we know is a drop , but what we don't know is an ocean !*/ |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define mod 1000000007
const int N = 100001;
int fexp(int a, int b,int m){int ans = 1;while(b){if(b&1)ans=(ans*a)%m; b/=2;a=(a*a)%m;}return ans;}
int inverse(int a, int p){return fexp(a, p-2,p);}
// int fac[2000001];
// int nCrModPFermat(int n, int r,int p) {
// if (r==0) return 1;
// return (((fac[n]*((((inverse(fac[r],p)%p)*inverse(fac[n-r],p))%p))))%p);
// }
void solve(){
int n;cin>>n;int mx=0;
vi a(n);rep(i,0,n){cin>>a[i];mx=max(mx,abs(a[i]));}
int man=0;
rep(i,0,n)man+=abs(a[i]);
double eucl=0.0;
rep(i,0,n)eucl+=(a[i]*a[i]);
eucl=sqrt(eucl);
cout<<man<<endl;
cout<<fixed<<setprecision(10)<<eucl;
cout<<endl<<mx;
}
signed main(){
IOS;
int t=1;
// cin>>t;
// fac[0] = 1;
// for (int i=1 ; i<=100001; i++) fac[i] = fac[i-1]*i%mod;
rep(i,0,t){
// cout<<"Case #"<<i+1<<": ";
solve();
cout<<"\n";
}
// return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a;
long long mx=0;
for (int i=0; i<n; i++) {
long long x;
cin >> x;
a.push_back(x);
mx=max(mx,abs(x));
}
long long sum=0;
for (int i=0; i<n; i++) {
sum+=abs(a[i]);
}
cout << sum << endl;
sum=0;
for (int i=0; i<n; i++) {
sum+=pow(abs(a[i]),2);
}
printf("%.14f\n", sqrt(sum));
cout << mx << endl;
} |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define endl '\n'
#define debug(x) std::cerr << #x << " = " << (x) << endl;
using ll = long long;
using P = std::pair<ll, ll>;
constexpr ll INF = 1ll<<60;
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; }
template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
const ll mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=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 {
mint res(*this);
return res/=a;
}
};
struct combination {
std::vector<mint> fact, ifact;
combination(int n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
};
ll T;
mint tri( ll x ) {
if( x < 0 )
return 0;
return mint(x)*(x+1)/2;
}
int main() {
std::cin >> T;
rep( t, T ) {
ll N, A, B;
std::cin >> N >> A >> B;
mint f = tri(N-A-B+1);
mint X = mint(N-A+1)*(N-B+1)*f;
mint Y = f*f;
mint ans = X*4-Y*4;
std::cout << ans.x << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define ff first
#define ss second
#define hell 1000000007
#define test4(x,y,z,a) cout<<"x is "<<x<<" y is "<<y<<" z is "<<z<<" a is "<<a<<endl;
#define test3(x,y,z) cout<<"x is "<<x<<" y is "<<y<<" z is "<<z<<endl;
#define test2(x,y) cout<<"x is "<<x<<" y is "<<y<<endl;
#define test1(x) cout<<"x is "<<x<<endl;
#define N 300009
ll power(ll a,ll b,ll m)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;cin>>n;
ll a[n+2],b[n+2];
ll ans= hell;
rep(i,1,n+1) {
cin >> a[i] >> b[i];
}
rep(i,1,n+1) {
rep(j,1,n+1) {
if( i == j)
ans = min(ans, a[i]+b[j]);
else
ans = min(ans, max(a[i],b[j]));
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
using ll= long long;
ll fun(string s,ll mid,ll m )
{
ll val=0,z=1;
for(ll i=s.size()-1; i>=0; i--)
{
ll t=s[i]-'0';
if(t>(m/z))
{
val=m+1;
break;
}
val+=t*z;
if(val>m)
{
val=m+1;
break;
}
if(z> (m/mid) &&i>0 )
{
val=m+1;
break;
}
if( z>(m/mid) &&i==0 )
{
break;
}
z=z*mid;
// cout<<"z="<<z<<endl;
}
return val;
}
int main()
{
ll m;
string s;
cin>>s;
cin>>m;
if(s.size()==1)
{
int t=s[0]-'0';
// t++;
if(t<=m)
cout<<1<<endl;
else
cout<<0<<endl;
return 0;
}
ll mx=0;
for(int i=0; i<s.size(); i++)
{
ll x=s[i]-'0';
mx=max(mx,x);
}
ll lw=mx+1;
ll w=mx+1;
ll ub=m;
ll k=0;
while(lw<=ub)
{
ll mid=lw+(ub-lw)/2;
ll v=fun(s,mid,m);
// cout<<"v="<<v<<" mid="<<mid<<endl;
if(v<=m)
{
lw=mid+1;
k=mid;
}
else if(v>m)
{
ub=mid-1;
}
//cout<<lw<<" "<<ub<<endl;
}
ll e=0;
ll f=k-mx;
cout<<max(e,f)<<endl;
return 0;
}
| #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN
using namespace std;
typedef long long int64;
int read() {
int f = 1,res = 0;
char ch = getchar();
while(ch < '0' || ch > '9') {
if(ch == '-') f *= -1;
ch = getchar();
}
while('0' <= ch && ch <= '9') {
res = res*10+ch-'0';
ch = getchar();
}
return res*f;
}
void out(int i) {
if(i < 0) {
putchar('-');
i = -i;
}
if(i > 9) out(i/10);
putchar(i%10+'0');
return;
}
int main() {
string s;
string t = "atcoder";
int T = read();
while(T--) {
cin>>s;
if(s > t) {
puts("0");
continue;
}
bool f = true;
int k = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] != 'a') {
f = false;
k = i;
break;
}
}
if(f) {
puts("-1");
continue;
}
for(int i = 0; i < k; i++) {
swap(s[k-i],s[k-i-1]);
if(s > t) {
out(i+1);enter;
break;
}
}
}
return 0;
} |
/**
* created: 02.11.2020 19:03:47
**/
#ifdef _LOCAL_
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/math/tools/minima.hpp>
// #include <boost/range/irange.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define name(x) #x
#define dump(x) cout << name(x) << " = " << x << endl;
#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 = (s); i < (int)(n); i++)
#define For(i,x) for (auto &i : x)
#define len(x) ll(x.size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) ll(__builtin_popcountll(bit))
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a * b / __gcd(a,b)
// using boost::math::tools::brent_find_minima;
// using boost::irange;
using ll = long long;
using P = pair<int,int>;
// using bint = boost::multiprecision::cpp_int;
const long double pi = acos(-1.0);
const int MAX = 1000010;
const int INF = 0x7fffffffffffffffll;
const int MOD1 = 1000000007;
const int MOD2 = 998244353;
template<typename T> bool chmax(T &a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T> bool chmin(T &a, T b) {if (b < a) {a = b; return 1;} return 0;}
template<typename T> T bpow(T a, int n) {T r(1); while(n) {if (n & 1) r *= a; a *= a; n >>= 1;} return r;}
template<typename T> auto comp(vector<T> a) {sort(all(a)); a.erase(unique(all(a)),a.end()); return a;}
template<typename T,typename U> ostream &operator<<(ostream &os, const pair<T,U> &p) {os << p.first << " " << p.second; return os;}
template<typename T,typename U> ostream &operator<<(ostream &os, const map<T,U> &mp) {For(p,mp) {os << "[" << p << "]\n";} return os;}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) {rep(i,len(v)) {if(i) os << " "; os << v[i];} return os;}
template<typename T> ostream &operator<<(ostream &os, const set<T> &st) {int c(0); For(x,st) {if (c) os << " "; os << x; c++;} return os;}
// UnionFind（Disjoint-Set Data Structure）
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n,-1) {}
int root(int x) {
if (par[x] < 0) return x;
return par[x] = root(par[x]);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x,y);
par[x] += par[y]; par[y] = x;
return true;
}
bool issame(int x, int y) {return root(x) == root(y);}
int size(int x) {return -par[root(x)];}
};
void solve() {
int n; cin >> n;
vector<P> v(n);
rep(i,n) {
int a, b; cin >> a >> b;
v[i] = P(a, b);
}
int s = n, t = n+1;
vector<pair<double,P>> edge;
rep(i,n) {
int a = v[i].first, b = v[i].second;
double d1 = b + 100, d2 = 100 - b;
edge.emplace_back(d1,P(s,i));
edge.emplace_back(d2,P(t,i));
}
rep(i,n) rep(j,i) {
edge.emplace_back(hypotl(v[i].first-v[j].first,v[i].second-v[j].second),P(i,j));
}
sort(all(edge));
UnionFind uf(n+2);
int ans = 100;
For(x, edge) {
auto p = x.second;
uf.merge(p.first, p.second);
if (uf.issame(s, t)) {
cout << x.first / 2 << endl;
return;
}
}
return;
}
signed main() {
auto start = system_clock::now();
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
auto end = system_clock::now();
#ifdef _LOCAL_
cout << endl << fixed << setprecision(3);
cout << double(duration_cast<microseconds>(end-start).count())/1000;
cout << " ms" << endl;
#endif
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007LL
//#define MOD 998244353LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>; // intの2次元の型に vvi という別名をつける
const ll llMAX=9223372036854775807LL;
const ll llMIN=-9223372036854775808LL;
void myprint1D(vi &data)
{
REP(i,data.size())
cout<<data[i]<<" ";
cout<<endl;
}
//配列を[y][x]で表示
void myprint2D_T(vvi &data)
{
REP(i,data.size())
myprint1D(data[i]);
}
//配列を[x][y]で表示
void myprint2D(vvi &data)
{
ll l1=data.size();
ll l2=data[0].size();
REP(j,l2){
REP(i,l1)
cout<<data[i][j]<<" ";
cout<<endl;
}
}
//print(a,b...)って使い方
void print1(ll a){cout<<a<<endl;}
void print2(ll a,ll b){cout<<a<<" "<<b<<endl;}
void print3(ll a,ll b,ll c){cout<<a<<" "<<b<<" "<<c<<endl;}
void print4(ll a,ll b,ll c,ll d){cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;}
void print5(ll a,ll b,ll c,ll d,ll e){cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<endl;}
//moddivとnCkとgarner
//c剰余下でaをbで割った値
ll moddiv(ll a,ll b,ll c){
ll x0=c,x1=b,x2,n0=0LL,n1=1LL,n2,t=a%b,m,ans;
if (t==0LL) return a/b;
for(int i=0;i<900;i++){
m=x0/x1;
x2=x0-x1*m;
n2=(n0-m*n1)%c;
if (x2==1LL){
ans=(n2+c)%c;
break;
}
x0=x1;x1=x2;
n0=n1;n1=n2;
}
return (a+((t*ans)%c)*b-t)/b;
}
//剰余の割ざん
//aのn乗 mod c
ll expmod(ll a,ll n,ll c){
ll ans=1LL,aa=a,beki=n;
for(int i=0;i<64;i++){
if (beki%2==1LL) ans=ans*aa%c;
aa=aa*aa%c;
beki/=2LL;
if (beki==0LL)break;
}
return ans;
}
//nCk
vi mulmod(500001);//0!,1!,2!,3!,4!,,,,
void first_nCk(){
mulmod[0]=1LL;
for(ll i=1;i<500001;i++){
mulmod[i]=mulmod[i-1]*i%MOD;
}
}
ll nCk(ll nn,ll kk){
return moddiv(mulmod[nn],mulmod[kk]*mulmod[nn-kk]%MOD,MOD);
}
ll modinv(ll a,ll b){
return moddiv(1,a,b);
}
ll garner(__int128_t a,__int128_t b,__int128_t ar,__int128_t br){
__int128_t tmp=(br-ar)%b*modinv(a,b)%b;
if (tmp<0)tmp+=b;
return ar+tmp*a;
}
ll n;
string saa,sab,sba,sbb;
ll fib(ll nn){
nn-=3;
ll a0=1;
ll a1=1;
ll ret=1;
for(ll nnn=0;nnn<nn;nnn++){
a0=a1;
a1=ret;
ret=(a1+a0)%MOD;
}
return ret;
}
int main(){
ll ans=0;
cin >> n;
cin>>saa>>sab>>sba>>sbb;
if (sab=="A"){
if (saa=="A"){
cout<<1<<endl;
return 0;
}else{
if (sba=="A"){
ans=fib(n);
cout<<ans<<endl;
return 0;
}else{
if (n<=3){cout<<1<<endl;return 0;}
ans=expmod(2,n-3,MOD);
cout<<ans<<endl;return 0;
}
}
}else{
if (sbb=="B"){
cout<<1<<endl;
return 0;
}else{
if (sba=="B"){
ans=fib(n);
cout<<ans<<endl;
return 0;
}else{
if (n<=3){cout<<1<<endl;return 0;}
ans=expmod(2,n-3,MOD);
cout<<ans<<endl;return 0;
}
}
}
//cout<<ans<<endl;
return 0;
}
/*
*/ |
#include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> graf;
vector<long long> val, trz;
vector<bool> odw;
long long curVal, curTrz;
void dfs(long long x){
odw[x] = true;
curVal+=val[x];
curTrz+=trz[x];
for(auto it:graf[x]){
if(!odw[it]) dfs(it);
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr);
long long n, m; cin>>n>>m;
odw.resize(n);
graf.resize(n);
for(long long i = 0; i < n; i++){
long long a; cin>>a; val.push_back(a);
}
for(long long i = 0; i < n; i++){
long long a; cin>>a; trz.push_back(a);
}
for(long long i = 0; i < m; i++){
long long a, b; cin>>a>>b;
a--; b--;
graf[a].push_back(b);
graf[b].push_back(a);
}
for(long long i = 0; i < n;i++){
if(!odw[i]){
curVal=0;
curTrz=0;
dfs(i);
if(curVal!=curTrz) {cout<<"No"; return 0;}
}
}
cout<<"Yes";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+9;
const int MAX=1e2+9;
const double ep=1e-10;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
const double inf=1e20;
const double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) cout<<"##"<<(x)<<endl;
#define mk make_pair
#define PII pair<int,int>
#define PDI pair<double,int>
#define PIII pair<int,PII >
#define PIII1 pair<PII,int>
#define PIIII pair<PII,PII >
#define PIL pair<int,ll>
#define PLI pair<ll,int>
#define PLIII pair<PLI,PII >
#define PLL pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dep(i,a,b) for(int i=(a);i>=(b);--i)
#define sd(x) scanf("%d",&(x))
#define slld(x) scanf("%lld",&(x))
#define sdd(x,y) scanf("%d%d",&(x),&(y))
#define sc(s) scanf("%s",(s))
#define pd(x) printf("%d\n",(x))
#define plld(x) printf("%lld\n",(x))
#define pdk(x) printf("%d ",(x))
#define plldk(x) printf("%lld ",(x))
#define pdd(x,y) printf("%d %d\n",(x),(y))
#define PR(x) printf("Case %d: ",(x))
/*
*/
int n,m,pre[maxn];
int Find(int x)
{
return pre[x]==x?x:pre[x]=Find(pre[x]);
}
void mix(int x,int y)
{
int fx=Find(x),fy=Find(y);
pre[fx]=fy;
}
ll a[maxn],b[maxn],sum1[maxn],sum2[maxn];
bool vis[maxn];
void solve()
{
sdd(n,m);
rep(i,1,n)pre[i]=i;
rep(i,1,n)slld(a[i]);
rep(i,1,n)slld(b[i]);
rep(i,1,m)
{
int u,v;
sdd(u,v);
mix(u,v);
}
rep(i,1,n)
{
int fx=Find(i);
vis[fx]=1;
sum1[fx]+=a[i];
sum2[fx]+=b[i];
}
rep(i,1,n)
{
if(vis[i]&&sum1[i]!=sum2[i])
{
puts("No");return;
}
}
puts("Yes");
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);
int T=1;
// sd(T);
while(T--)solve();
} |
#include <iostream>
#include <vector>
#include <cmath>
#include<algorithm>
using namespace std;
#define endl '\n'
#define vi vector <ll>
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main()
{ fast;
ll t;
cin>>t;
ll x= 1.08 * t;
if( x< 206)
cout<<"Yay!";
else if(x == 206)
cout<<"so-so";
else
cout<<":(";
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(n) for(int i=0;i<n;i++)
#define pb push_back
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
void solve(){
int n;cin>>n;set<int>s;
for(int i=2;i<=pow(n,0.5)+5;i++){
for(int j=2;j<24/log(i);j++){
if(binpow(i,j)<=n){s.insert(binpow(i,j));cerr<<i<<" "<<j<<endl;}
}
}
cout<<n-(int)s.size()<<endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);cerr.tie(NULL);
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
#define MOD 1000000007
ll ll_pow(ll a, ll b) {
if (b == 0) {
return 1;
}
return a * ll_pow(a, b - 1);
}
int main() {
ll S, P;
cin >> S >> P;
vector<pair<ll, ll>> v;
for (ll i = 1; i <= sqrt(P); ++i) {
if (P % i == 0) {
pair<ll, ll> p = make_pair(i, P / i);
v.push_back(p);
}
}
for (auto i : v) {
if (i.first + i.second == S) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, j, k) for(int i = j; i < k; i++)
#define print(x) cout << x
#define newline cout << endl
#define space cout << ' '
#define INF 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
int main(){
ll s,p;
cin >> s >> p;
rep(i,1000001){
if(i*(s-i)==p){
print("Yes");
return 0;
}
if(i>=s||i>=p) break;
}
print("No");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll converter(ll number)
{
ll num1, num2, res;
string num = to_string(number);
sort(num.begin(), num.end(), greater<char>());
num1 = stoll(num);
sort(num.begin(), num.end());
num2 = stoll(num);
res = num1-num2;
return res;
}
int main(int argc, char const *argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll num,res;
int k;
cin >> num >> k;
res = num;
for(int i=0; i<k; i++){
res = converter(res);
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
#define vc vector<char>
#define vs vector<string>
#define np(vec) next_permutation(vec.begin(),vec.end())==true
#define en endl
#define vvl vector<vector<int64_t>>
#define sti stack<int64_t>
#define qui que<int64_t>
#define ms(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
ll fun(ll x){
ll r,s,t;
s=0;
t=0;
if(x==0){return 0;}
fo(i,11){
ll k=i;
if(pow(10,k-1)<=x&&x<pow(10,k)){r=k;
break;}
}
vl vec(r);
vl v2(r);
fo(i,r){
vec.at(i)=x%10;
x=x/10;
}
sor(vec);
fo(i,r){
v2.at(i)=vec.at(i);
}
rev(v2);
fo(i,r){
s+=vec.at(i);
s=s*10;
}
s=s/10;
fo(i,r){
t+=v2.at(i);
t=t*10;
}
t=t/10;
return abs(t-s);
}
int main(){
ll n,k;
cin>>n>>k;
fo(i,k){
n=fun(n);
}
cout<<n<<endl;
} |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define vec vector<int>
#define fo(i, n) for (int i = 0; i < n; i++)
#define foo(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define ll long long
#define mod 1000000007
//#define mod 998244353
#define so(v) sort(v.begin(), v.end())
#define fi first
#define se second
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
//__builtin_popcount
//vector<vector<int>>
// dir = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int power(int x, unsigned int y, int p)
{
int res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int mI(int a, int m)
{
return power(a, m - 2, m);
}
#define double long double
int n,m;
vec v1(1001), v2(1001);
int dp[1001][1001];
int fun(int i,int j){
//debug(i, j);
if(i==n){
return m-j;
}
if(j==m){
return n - i;
}
if(dp[i][j]!=-1)
return dp[i][j];
int g = 0;
if(v1[i]!=v2[j])
g = 1;
return dp[i][j]=min({fun(i + 1, j + 1) + g, fun(i, j + 1)+1,fun(i+1,j)+1});
}
void solve(){
//int n, m;
cin >> n>>m;
fo(i,n) {
cin >> v1[i];
}
fo(i,m){
cin >> v2[i];
}
// if(n>m){
// swap(n, m);
// swap(v1, v2);
// }
memset(dp, -1, sizeof(dp));
// int val = fun(0, 0);
// //val = min({val, n, m});
// val = max(m,n) - val;
cout << fun(0,0) << "\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
srand(time(0));
int t = 1;
//cin >> t;
while (t--)
{
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
int m=1e9+7;
int main()
{
int n,m,temp1,temp2;
cin>>n>>m;
int a[n];
int b[m];
int c[m+1];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++){cin>>b[i];c[i]=i;}
c[m]=m;
for(int i=1;i<=n;i++)
{
c[0]=i;
temp2=i-1;
for(int j=1;j<=m;j++)
{
temp1=c[j];
if(a[i-1]==b[j-1])c[j]=temp2;
else
{
c[j]=min(1+temp2,min(c[j]+1,c[j-1]+1));
}
temp2=temp1;
}
}
cout<<c[m];
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define reps(i,n) for(ll i=1;i<=(n);++i)
#define repr(i,n) for(int i=2;i*i<=(n);++i)
#define ll long long
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define pob pop_back()
#define Mod (ll)(1e9+7)
#define mod (ll)(998244353)
#define setp(x) setprecision((ll)(n))
#define INF (ll)(1000000000000000000)
using namespace std;
using vi=vector<int>;
using vc=vector<char>;
using vl=vector<long long>;
using vvi=vector<vi>;
using vvl=vector<vl>;
using vvc=vector<vc>;
using vpl=vector<pair<ll,ll>>;
using vs=vector<string>;
using pii=pair<int, int>;
using pll=pair<ll,ll>;
int main(){
ll n; cin>>n;
vi p(n);
rep(i,n) cin>>p[i];
sort(all(p));
ll sum=1,res=0;
rep(i,n-1){
if(p[i]==p[i+1]) sum++;
else {
res+=sum*(sum-1)/2;
sum=1;
}
}
res+=sum*(sum-1)/2;
sum=1;
cout<<n*(n-1)/2-res<<endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<sstream>
#include<cctype>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<set>
#include<functional>
#define in(x) x=read()
#define qr read()
#define int ll
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
namespace fastIO
{
#define BUF_SIZE 100000
bool IOerror=0;
inline char nc()
{
static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
if (p1==pend){
p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);
if (pend==p1){IOerror=1;return -1;}
}
return *p1++;
}
inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
inline ll read()
{
bool sign=0; char ch=nc();ll x=0;
for (;blank(ch);ch=nc());
if (IOerror)return 0;
if (ch=='-')sign=1,ch=nc();
for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
if (sign)x=-x;
return x;
}
#undef BUF_SIZE
};
using namespace fastIO;
int n,k,num=0;
vector<int>e[1000010];
int dfs(int x,int pre,int lim)
{
int now=0,minn=1e16,son=0;
for(auto i:e[x])
{
if(i==pre)continue;
int nxt=dfs(i,x,lim);
son++;
now=max(now,nxt+1);
minn=min(minn,nxt+1);
}
// cout<<x<<":"<<now<<","<<minn<<","<<son<<"\n";
if(son!=1&&now+minn<=2*lim+1)now=minn;
if(x!=1&&e[x].size()==1)return lim+1;
if(now==2*lim+1||(x==1&&now>lim))num++,now=0;
return now;
}
bool check(int x)
{
num=0;
// cout<<x<<":"<<"\n-------------------\n";
dfs(1,1,x);
// cout<<"num="<<num<<"\n"<<"--------------------\n";
return num<=k;
}
signed main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
n=qr,k=qr;
for(int i=1;i<n;i++)
{
int x=qr,y=qr;
e[x].push_back(y);
e[y].push_back(x);
}
int l=1,r=n,ans;
while(l<=r)
{
int mid=(l+r)/2;
if(check(mid))ans=mid,r=mid-1;
else l=mid+1;
}
cout<<ans;
return 0;
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(int argc, char** argv) {
double a,b,c,d;
cin >> a >> b >> c >> d;
printf("%.10lf",(c-a)/(b+d)*b+a);
return 0;
} | /*Jai Shree Ram*/
// Never Give Up
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define F(i,s,e,j) for(int i=s;i<=e;i+=j)
#define mt19937 rng(chrono::steady_clock::now().tjhe_since_epoch().count());
//shuffle(arr,arr+n,rng)
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int dp[16][1<<8][9][17];
int total_ways(int idx,int j,int mask1,int mask2,int n,int a,int b)
{
if(idx==-1)
return mask1==0?1:0;
if(j==0 && dp[idx][mask1][a][b]!=-1)
return dp[idx][mask1][a][b];
if(j==n)
return total_ways(idx-1,0,mask2,0,n,a,b);
if(mask1&(1<<j))
return total_ways(idx,j+1,mask1,mask2,n,a,b);
int ans = 0;
if(j<n-1 && (mask1&(1<<(j+1)))==0 && a>0)
ans += total_ways(idx,j+2,mask1,mask2,n,a-1,b);
if(idx>=1 && a>0)
ans += total_ways(idx,j+1,mask1,mask2|(1<<j),n,a-1,b);
if(b>0)
ans += total_ways(idx,j+1,mask1,mask2,n,a,b-1);
return dp[idx][mask1][a][b] = ans;
}
int32_t main()
{ c_p_c();
int n,m,a,b;
cin>>n>>m>>a>>b;
memset(dp,-1,sizeof(dp));
cout<<total_ways(m-1,0,0,0,n,a,b)<<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>
//eolibraries
#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) (ll)(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 <ll,ll>
#define rep(i,n) for(ll i = 0 ; i < n ; i++)
#define drep(i,n) for(ll i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(ll i = x ; i < n ; i++)
#define vi vector <ll>
#define v(s) vector<s>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
const ll max_n = 100000;
using namespace std;
ll k,n,m;
vi a;
bool ok(ll x) {
ll lo = 0 , hi = 0;
rep(i,k) {
ll p2 = (a[i]*m + x) / n;
ll p1 = (a[i]*m - x + n - 1) / n;
p1 = max((ll)0,p1);
hi+=p2;
lo+=p1;
}
return lo <= m and m <= hi;
}
int main(){
fcin;
cin >> k >> n >> m;
a.resize(k,0);
rep(i,k)cin>>a[i];
ll l = 0 , r = 1e15 , c = 0;
while(l <= r) {
ll mid = (l+r)/2;
if(ok(mid)) {
c = mid;
r = mid - 1;
}else {
l = mid + 1;
}
}
v(vi) candy;
ll x = c;
rep(i,k) {
ll p2 = (a[i]*m + x) / n;
ll p1 = (a[i]*m - x + n - 1) / n;
candy.pb({p1,p2});
}
ll s = 0;
for(auto p : candy) s += p[0];
ll need = m - s;
rep(i,k) {
ll em = candy[i][0];
candy[i][0] = min(candy[i][1] , candy[i][0] + need);
need -= candy[i][0] - em;
}
rep(i,k) cout << candy[i][0] << " ";
/*
*/
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//optimal subsequences-2 technocup round-3 2020
using namespace std;
using namespace __gnu_pbds;
const int N=2e5+10;
//#define d double
#define F first
#define S second
#define ll long long int
#define FastIO ios_base::sync_with_stdio(false),cin.tie(0)
#define fix std::fixed<<setprecision(6)
const int M=1e9+7;
//const int M=998244353;
#define f(n) for(int i=0;i<n;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define vi vector<int>
#define pb push_back
//#define si set<int>
#define cl(n,m) (ceil(double(n)/double(m)))
#define T() int t; cin>>t; while(t--)
#define pi pair<ll,ll>
//int MOD=998244353;
//const int MOD=1e9+7;
#define endl "\n"
const double PI = 3.141592653589793238460;
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
//ll d1=304933,d2=4395853;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//bitset<N>bs;
//bitset<512>bb[512];
//vector<vector<int>>arr;
//#ifndef ONLINE_JUDGE
//freopen("input.txt", "r" , stdin);
//freopen("output.txt", "w", stdout);
//#endif
ll MOD;
ll power(ll a,ll b)
{
ll res=1;
if(a==1)return 1;
for(;b>0;b>>=1)
{
if(b&1)res=(res*a);
if(res>MOD)res%=MOD;
a=(a*a);
if(a>MOD)a=a%MOD;
}
return res;
}
bool isPrime[3000000+1];
vector<ll>prime;
vector<int>divisor;
void seive2(int limit)
{
divisor=vector<int>(limit+1,0);
for(int i=2;i<=limit;i++)
{
if(divisor[i]==0)
{
divisor[i]=i;
if(i*1ll*i<=limit)
for(int j=i*i;j<=limit;j+=i)divisor[j]=i;
}
}
}
void seive(int limit)
{
isPrime[0]=isPrime[1]=1;
for(int i=2;i*i<=limit;i++)
{
if(!isPrime[i])
for(int j=i*i;j<=limit;j+=i)
{
isPrime[j]=1;
}
}
for(int i=2;i<=limit;i++)if(!isPrime[i])prime.pb(i);
}
#define pii pair<ll,pi>
ll pt[200010],sz[200010],wt[200010];
int finds(int x)
{
while(pt[x]!=x)
{
pt[x]=pt[pt[x]];
x=pt[x];
}
return pt[x];
}
bool unions(int x,int y)
{
int px=finds(x),py=finds(y);
if(px==py)return 0;
if(sz[px]>sz[py])swap(px,py);
pt[px]=py;
sz[py]+=sz[px];
wt[py]+=wt[px];
return 1;
}
ll bit[200100];
ll query(ll bit[],int x)
{
ll ans=0;
for(int i=x;i>0;i-=(i&(-i))){
ans+=bit[i];
}
return ans;
}
void update(ll bit[],int x,ll val)
{
for(int i=x;i>0;i-=(i&(-i)))
bit[i]+=val;
}
void update2(ll bit[],int x,ll val)
{
for(int i=x;i<=600005;i+=(i&(-i)))
bit[i]+=val;
}
ll query2(ll sum[],int x)
{
ll ans=0;
for(int i=x;i<=200005;i+=(i&(-i)))
ans+=sum[i];
return ans;
}
void dfs(int s,vector<int>&v,vector<int>&P,int visited[])
{
visited[s]=1;
v.pb(s);
int x=P[s];
if(!visited[x])
{
dfs(x,v,P,visited);
}
}
void solve()
{
ll k,n,m;
cin>>k>>n>>m;
ll a[k+1];
f(k)cin>>a[i+1];
vector<ll>v;
ll sum=0;
f(k)
{
ll x=(a[i+1]*m+n-1)/n;
v.pb(x);
sum+=x;
}
set<pi>s;
f(k)
{
ll b=v[i]-1;
ll d=b*n-a[i+1]*m;
s.insert({abs(d),i});
}
ll d=sum-m;
while(d)
{
auto it=*s.begin();
s.erase(it);
int id=it.S;
v[id]--;
d--;
}
for(int x:v)cout<<x<<' ';
}
int main()
{
//FastIO;
int t=1;
// cin>>t;
for(int i=1;i<=t;i++)
{
// cout<<"Case #"<<i<<": ";
solve();
//if(i!=t)cout<<endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define GETVEC(v) for(auto& m : v) cin >> m;
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int r1, c1, r2, c2; cin >> r1 >> c1 >> r2 >> c2;
int ans = -1;
if (r1 == r2 && c1 == c2)
{
ans = 0;
}
else if (abs(r1 - r2) + abs(c1 - c2) <= 3 || abs(r1 - r2) == abs(c1 - c2))
{
ans = 1;
}
else if ((r1 + c1) % 2 == (r2 + c2) % 2)
{
ans = 2;
}
else
{
ans = 3;
for (int r = r1 - 2; r <= r1 + 2; ++r)
{
for (int c = c1 - 2; c <= c1 + 2; ++c)
{
if (abs(r - r2) + abs(c - c2) <= 3
|| abs(r - r2) == abs(c - c2))
{
ans = 2;
}
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL LINF = 334ll << 53;
constexpr int INF = 15 << 26;
constexpr LL MOD = 1E9 + 7;
namespace Problem {
using namespace std;
class Solver {
public:
void solve() {
LL x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
if (x1 == x2 && y1 == y2) {
cout << 0 << endl;
} else if (x1 + y1 == x2 + y2 || x1 - y1 == x2 - y2 || abs(x1 - x2) + abs(y1 - y2) <= 3) {
cout << 1 << endl;
} else if (abs(x1 + y1 - x2 - y2) <= 3 || abs(x1 - y1 - x2 + y2) <= 3 || abs(x1 - x2) + abs(y1 - y2) <= 6 || (x1 + y1) % 2 == (x2 + y2) % 2) {
cout << 2 << endl;
} else {
cout << 3 << endl;
}
}
};
} // namespace Problem
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(12);
Problem::Solver sol;
sol.solve();
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ull;
int main()
{
ull x,y;
cin>>x>>y;
if(x==y){
cout<<x;
}else{
switch(x+y){
case 1:
cout<<2;
break;
case 2:
cout<<1;
break;
case 3:
cout<<0;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#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 all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
typedef pair<int, int> P;
// typedef modint1000000007 mint;
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 (b < a) {
a = b;
return true;
}
return false;
}
void speedUpIO() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
}
/*--------------------------------------------------*/
void solve() {
int n, m;
cin >> n >> m;
V<int> a(n);
rep(i, n) cin >> a[i];
V<int> cnt(n + 1);
rep(i, m) cnt[a[i]]++;
int ans = n;
rep(i, n) {
if (cnt[i] == 0) {
ans = i;
break;
}
}
for (int i = 1; i <= n - m; i++) {
int l = i - 1;
int r = i + m - 1;
// if (cnt[a[l]] == 0) chmin(ans, a[l]);
cnt[a[l]]--;
cnt[a[r]]++;
if (cnt[a[l]] == 0) chmin(ans, a[l]);
}
rep(i, n) {
if (cnt[i] == 0) {
chmin(ans, i);
break;
}
}
cout << ans << "\n";
}
int main() {
speedUpIO();
solve();
return 0;
}
|
#include<cstdio>
using namespace std;
long double f=1.08;
int n,m;
int main(){
scanf("%d",&n);
m=n*f;
if(m<206)printf("Yay!");
else if(m==206)printf("so-so");
else printf(":(");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long n,cnt,sum,ans;
bool u[100005];
int main()
{
cin>>n;
ans=n;
cnt=2;
while(cnt*cnt<=n)
{
if(u[cnt]==1)
{
cnt++;
continue;
}
sum=cnt*cnt;
while(sum<=n)
{
if(sum<=100000)u[sum]=1;
ans--;
sum*=cnt;
}
cnt++;
}
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
void solve() {
ll l, r; cin >> l >> r;
ll ma = r, mi = l + l;
if(ma < mi){
print(0);
return;
}
print((ma - mi + 1) * (ma - mi + 2) / 2);
return;
}
int main(){
int t; cin >> t;
while(t--) solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define irreps(i, m, n) for (int i = ((int)(n)-1); i > (int)(m); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) (int)(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
using ld = long double;
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; }
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
const ll INF = 1e9+10;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
int n; cin>>n;
vpll v(n);
rep(i,n){
ll x,c; cin>>x>>c;
v[i]={c,x};
}
vsort(v);
set<ll> s;
map<ll,ll> ma,mi;
for(auto e: v){
ll c,x; tie(c,x)=e;
if(!s.count(c)) ma[c]=x;
else chmax(ma[c],x);
if(!s.count(c)) mi[c]=x;
else chmin(mi[c],x);
s.insert(c);
}
vc<ll> x;
for(auto e: s) x.push_back(e);
int m=s.size();
vc<vc<ll>> dp(m+1,vc<ll>(2));
rep(i,m){
ll L=LINF, R=LINF;
ll now=x[i];
if(i==0){
R=abs(mi[now])+abs(ma[now]-mi[now]); // 左行ってから右
L=abs(ma[now])+abs(ma[now]-mi[now]);
dp[i+1][1]=R;
dp[i+1][0]=L;
}else{
ll pre=x[i-1];
R=dp[i][1]+abs(ma[now]-mi[now])+abs(ma[pre]-mi[now]);
chmin(R,dp[i][0]+abs(ma[now]-mi[now])+abs(mi[pre]-mi[now]));
L=dp[i][1]+abs(ma[now]-mi[now])+abs(ma[pre]-ma[now]);
chmin(L,dp[i][0]+abs(ma[now]-mi[now])+abs(mi[pre]-ma[now]));
dp[i+1][1]=R;
dp[i+1][0]=L;
}
}
// cout<<mi[x[m-1]]<<' '<<ma[x[m-1]]<<endl;
ll ans=LINF;
chmin(ans, dp[m][0]+abs(mi[x[m-1]]));
chmin(ans, dp[m][1]+abs(ma[x[m-1]]));
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=3000,mod=998244353;
int add(int a,int b,int p=mod){return a+b>=p?a+b-p:a+b;}
int sub(int a,int b,int p=mod){return a-b<0?a-b+p:a-b;}
int mul(int a,int b,int p=mod){return (LL)a*b%p;}
void sadd(int &a,int b,int p=mod){a=add(a,b,p);}
void ssub(int &a,int b,int p=mod){a=sub(a,b,p);}
void smul(int &a,int b,int p=mod){a=mul(a,b,p);}
int n,m;
void into(){
scanf("%d%d",&n,&m);
}
int dp[N+9][N*2+9];
void Get_dp(){
dp[0][0]=1;
for (int i=1;i<=n;++i)
for (int j=n;j>=1;--j) dp[i][j]=add(dp[i-1][j-1],dp[i][j<<1]);
}
void work(){
Get_dp();
}
void outo(){
printf("%d\n",dp[n][m]);
}
int main(){
into();
work();
outo();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main (){
#ifndef ONLINE_JUDGE
freopen("SuhaibSawalha1","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
int t = 1;
if (a < b) {
swap(a, b);
t = -1;
}
for (int i = 1; i <= a; ++i) {
cout << i * t << " ";
}
t = ~t ? -1 : 1;
for (int i = 1; i < b; ++i) {
cout << i * t << " ";
}
cout << (a - b + 1) * (a + b) / 2 * t;
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
struct node{
int f,s;
node(int ff=1,int ss=0){f=ff,s=ss;}
node& operator+=(node a) {
if((f+s)%2){f+=a.f; s+=a.s;}
else{f+=a.s; s+=a.f;}
return *this;
}
};
const int operator<(const node& n1,const node& n2){
int p1=(n1.f+n1.s)%2,p2=(n2.f+n2.s)%2;
if(p1==p2){
return n1.f-n1.s<n2.f-n2.s;
}
if(p1==0) return n1.f-n1.s<0;
return n2.f-n2.s>=0;
}
void dfs(vector<vector<int>>& adj, vector<node>& game,int a=0){
if(adj[a].size()==0) return;
for(int v:adj[a]){
dfs(adj,game,v);
}
sort(adj[a].begin(),adj[a].end(),
[&](int i,int j){return game[i]<game[j];});
for(int v:adj[a]){
game[a]+=game[v];
}
}
int main(){
int n; cin >>n;
vector<vector<int>> adj(n);
rep(i,n-1){
int p; cin >>p; p--;
adj[p].push_back(i+1);
}
vector<node> game(n);
dfs(adj,game);
print(game[0].f);
}
| #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <queue>
#include <ctime>
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
inline int read_int(){
int t=0;bool sign=false;char c=getchar();
while(!isdigit(c)){sign|=c=='-';c=getchar();}
while(isdigit(c)){t=(t<<1)+(t<<3)+(c&15);c=getchar();}
return sign?-t:t;
}
inline LL read_LL(){
LL t=0;bool sign=false;char c=getchar();
while(!isdigit(c)){sign|=c=='-';c=getchar();}
while(isdigit(c)){t=(t<<1)+(t<<3)+(c&15);c=getchar();}
return sign?-t:t;
}
inline char get_char(){
char c=getchar();
while(c==' '||c=='\n'||c=='\r')c=getchar();
return c;
}
inline void write(LL x){
char c[21],len=0;
if(!x)return putchar('0'),void();
if(x<0)x=-x,putchar('-');
while(x)c[++len]=x%10,x/=10;
while(len)putchar(c[len--]+48);
}
inline void space(LL x){write(x),putchar(' ');}
inline void enter(LL x){write(x),putchar('\n');}
const int MAXN=1e5+5;
int sz[MAXN],dp[MAXN];
struct Edge{
int to,next;
}edge[MAXN];
int head[MAXN],edge_cnt;
void Insert(int u,int v){
edge[++edge_cnt]=Edge{v,head[u]};
head[u]=edge_cnt;
}
struct Node{
int d1,d2;
bool operator < (const Node &b)const{
return (d1-d2)>(b.d1-b.d2);
}
};
void dfs(int u){
sz[u]=1;
int d1=0,d2=0;
vector<Node> temp;
for(int i=head[u];i;i=edge[i].next){
int v=edge[i].to;
dfs(v);
sz[u]+=sz[v];
if(sz[v]%2==0){
if(dp[v]*2>=sz[v])
dp[u]+=dp[v];
else
d1+=sz[v]-dp[v],d2+=dp[v];
}
else
temp.push_back(Node{dp[v],sz[v]-dp[v]});
}
sort(temp.begin(),temp.end());
for(int i=0;i<temp.size();i++){
if(i%2==0)
dp[u]+=temp[i].d1;
else
dp[u]+=temp[i].d2;
}
if(temp.size()%2==0)
dp[u]+=d2;
else
dp[u]+=d1;
}
int main()
{
// freopen("test.in","r",stdin);
// freopen("test.out","w",stdout);
int n=read_int();
_rep(i,2,n)
Insert(read_int(),i);
dfs(1);
enter(n-dp[1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >> n;
long long left = 0;
long long right = 2e9;
while (right - left > 1)
{
long long x = (left + right) / 2;
if ((x * (x + 1)) / 2 <= n + 1)
{
left = x;
}
else
{
right = x;
}
}
cout << n + 1 - left << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string X;
ll M;
bool solve(ll mid) {
ll res = 0;
ll multiply = 1;
for(ll i = X.length() - 1; i >= 0; i--) {
ll x = (X.at(i) - '0');
if(multiply > (1e18 / x)) {
return false;
}
if(res > 1e18 - x * multiply) {
return false;
}
res += x * multiply;
if(i != 0) {
if(multiply > 1e18 / mid) {
return false;
}
multiply *= mid;
}
}
return (res <= M);
}
int main() {
cin >> X;
cin >> M;
if(X.length() == 1) {
ll num = X.at(0) - '0';
if(num <= M) {
cout << 1 << endl;
return 0;
}
cout << 0 << endl;
return 0;
}
ll d = 0;
for(const char &c : X) {
d = max(d, (ll)(c - '0'));
}
ll ok = d;
ll ng = (long double)(1e18) + 1;
while(abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if(solve(mid)) {
ok = mid;
} else {
ng = mid;
}
}
cout << ok - d << endl;
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll r, x, y;
int main()
{
cin >> r >> x >> y;
double d = sqrt(x * x + y * y);
double num = d / r;
double temp = d - ((ll)num * r);
// cout << d << " " << num << " " << temp << endl;
if (temp == 0)
cout << (ll)num << endl;
else
{
if ((ll)num == 0)
cout << 2 << endl;
else
cout << (ll)num + 1 << endl;
}
} | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
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;}
int main(){
int n;
string s,t;
cin >> n >> s >> t;
ll ans = 0;
queue<int> q;
if(s[0]!=t[0]){
q.push(0);
}
FOR(i,1,n){
if(s[i]=='1' && !q.empty()){
int x = q.front();
q.pop();
ans += i-x;
s[i]='0';
}
if(s[i]!=t[i]){
q.push(i);
}
}
if(q.empty()){
cout << ans << endl;
}else{
cout << "-1\n";
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
vector<int> BFS(int n, vector<vector<int>>& paths, int& N) {
// BFSで宝石nから各宝石までの距離を求める
vector<int> dist(N, INT_MAX); dist[n] = 0;
set<int> visited; visited.insert(n);
deque<int> que; que.push_back(n);
while(!que.empty()) {
int now = que.front();
que.pop_front();
for (int nx: paths[now]) {
if (visited.count(nx)) continue;
visited.insert(nx);
dist[nx] = min(dist[nx], dist[now]+1);
que.push_back(nx);
}
}
return dist;
}
void solve2(){
int N, M; cin >> N >> M;
vector<vector<int>> paths(N);
for (int i=0; i<M; i++) {
int A, B; cin >> A >> B; A--; B--;
paths[A].push_back(B);
paths[B].push_back(A);
}
int K; cin >> K;
vector<int> Cs(K);
for (int i=0; i<K; i++) {
int C; cin >> C; C--;
Cs[i] = C;
}
vector<vector<int>> dists;
for (int i=0; i<K; i++) {
dists.emplace_back(BFS(Cs[i], paths, N)); // 始点cからの最短距離を求める
}
// for (int i=0; i<K; i++) {
// cout << "FROM:" << Cs[i] << endl;
// for (int j=0; j<K; j++) {
// cout << Cs[j] << ":" << dists[i][Cs[j]] << endl;
// }
// }
// bitDP[S][i] := 既に訪れた重要宝石集合Sにおいて、現在の重要宝石がiのときの、最短距離
vector<vector<int>> dp(1<<K, vector<int>(K, INT_MAX));
for (int i=0; i<K; i++) {
dp[0][i] = 0;
}
for (int i=0; i<K; i++) {
for (int j=0; j<K; j++) {
dp[(1<<i)|(1<<j)][j] = dists[i][Cs[j]];
}
}
for (int S=1; S<(1<<K); S++) {
for (int i=0; i<K; i++) { // 現在の宝石i
if (~S>>i&1) continue; // iはまだ訪れていない
for (int j=0; j<K; j++) { // 次に行く宝石j
if (S>>j&1) continue; // jは既に訪れている
int new_cost = dp[S][i]+dists[i][Cs[j]];
if (new_cost<0) new_cost = INT_MAX; // オーバーフロー対策
dp[S|1<<j][j] = min(dp[S|1<<j][j], new_cost);
}
}
}
// 答え
int ans = INT_MAX;
for (int i=0; i<K; i++) {
ans = min(ans, dp[pow(2,K)-1][i]);
}
if (ans == INT_MAX) {
cout << -1 << endl;
}
else {
cout << ans+1 << endl;
}
}
int main(int argc, char const *argv[]){
solve2();
return 0;
} | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#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 int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
int N, M; cin >> N >> M;
vector<ll> A(N);
for(auto &e : A) cin >> e;
using Edge = int;
using Graph = vector< vector< Edge > >;
Graph G(N);
vector<int> deg(N);
for(int i=0; i<M; i++) {
int u, v; scanf("%d%d", &u, &v);
u--; v--;
G[v].emplace_back(u);
deg[u]++;
}
vector<ll> dp(N, -LONGINF);
queue< pair<ll, ll> > que;
for(int i=0; i<N; i++) {
if(deg[i] == 0) {
que.emplace(i, dp[i]);
}
}
while(que.size()) {
ll cur, cost; tie(cur, cost) = que.front(); que.pop();
for(auto to : G[cur]) {
chmax(dp[to], max(dp[cur], A[cur]));
if(--deg[to] == 0) {
que.emplace(to, dp[to]);
}
}
}
ll ans = -LONGINF;
for(int i=0; i<N; i++) {
chmax(ans, dp[i] - A[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long ll;
int start[100005], finish[100005];
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
int n, len;
cin >> n >> len;
for (int i = 1; i <= n; i++) cin >> start[i];
for (int i = 1; i <= n; i++) cin >> finish[i];
start[n + 1] = len + 1, finish[n + 1] = len + 1, start[0] = 0, finish[0] = 0;
queue <int> qu;
ll ans = 0;
for (int i = 0; i <= n + 1; i++)
{
if (start[i] > finish[i] && !qu.empty()) cout << "-1\n", exit(0);
if (!qu.empty() && start[i] - finish[qu.front()] == i - qu.front()) ans += (ll) qu.size();
while (!qu.empty() && start[i] - finish[qu.front()] == i - qu.front()) qu.pop();
if (start[i] == finish[i] && !qu.empty()) cout << "-1\n", exit(0);
if (i == n + 1) break;
if (start[i] < finish[i]) qu.push(i);
}
for (int i = n + 1; i >= 0; i--)
{
if (start[i] < finish[i] && !qu.empty()) cout << "-1\n", exit(0);
if (!qu.empty() && finish[qu.front()] - start[i] == qu.front() - i) ans += (ll) qu.size();
while (!qu.empty() && finish[qu.front()] - start[i] == qu.front() - i) qu.pop();
if (start[i] == finish[i] && !qu.empty()) cout << "-1\n", exit(0);
if (i == 0) break;
if (start[i] > finish[i]) qu.push(i);
}
cout << ans << '\n';
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; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
putchar('\n');
}
bool yes;
LL X[100011], Y[100011];
LL solve(int len) {
if (len <= 1) return 0;
// rprintf("%lld", X, X+len);
// rprintf("%lld", Y, Y+len);
LL ret = len - 1;
int left = 0;
for (int i=1; i<len; ) {
int j = i;
while (j < len && Y[i] == Y[j]) j++;
while (X[left] <= Y[i]) left++;
if (left && X[left-1] == Y[i]) {
ret += i - left;
} else {
yes = false;
return 0;
}
i = j;
}
return ret;
}
int N;
LL L;
LL A[100011];
LL B[100011];
void MAIN() {
scanf("%d%lld", &N, &L);
A[0] = B[0] = 0;
REP (i, N) scanf("%lld", A+i+1);
REP (i, N) scanf("%lld", B+i+1);
N += 2;
A[N-1] = B[N-1] = L+1;
REP (i, N) {
A[i] -= i;
B[i] -= i;
}
yes = true;
LL ans = 0;
for (int i=0; i<N && yes; ) {
int j = i + 1;
while (B[j] < A[j]) j++;
int len = j - i;
REP (a, len) {
X[a] = A[i+a] - A[i];
Y[a] = B[i+a] - B[i];
}
ans += solve(len);
int k = j;
while (A[k] < B[k]) k++;
if (B[k] < A[k]) {
yes = false;
break;
}
len = k - j + 1;
REP (a, len) {
X[a] = A[k] - A[k-a];
Y[a] = B[k] - B[k-a];
}
ans += solve(len);
i = k;
}
if (yes) {
printf("%lld\n", ans);
} else {
puts("-1");
}
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
|
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
//#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define PA pair<int, int>
typedef long long ll;
#define rep(i, z, n) for(int i = z; i < n; i++)
//const ll INF = 1e9;
const ll INF = 1000000007;
//const ll MOD = 9223372036854775807;
//const ll MOD2 = 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; }
using namespace std;
/*
long long powmod(long long x, long long n) {
long long ret = 1;
while (n > 0) {
if (n & 1){
ret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける
ret %= MOD;
}
x *= x;
x %= MOD;
n >>= 1; // n を1bit 左にずらす
}
return ret;
}
ll nikou(ll A, ll B){
//B Combination A
ll x = 1, y = 1;
rep(i, 0, A){
x *= (B - i);
y *= (i + 1);
x %= MOD;
y %= MOD;
}
y = powmod(y, MOD - 2);
return x * y % MOD;
}
ll comb(int n, int r) {
vector<vector<long long>> v(n + 1,vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k < j; k++) {
v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]);
}
}
return v[n][r];
}
*/
int main(){
int N, M;
cin >> N >> M;
vector<int> A(M);
if(M == 0){
cout << 1 << endl;
return 0;
}
rep(i, 0, M){
cin >> A[i];
}
sort(all(A));
int vac = A[0] - 1;
if(vac == 0) vac = INF;
rep(i, 0, M - 1){
if(A[i + 1] - A[i] == 1) continue;
vac = min(vac, A[i + 1] - A[i] - 1);
}
if(A[M - 1] != N){
vac = min(vac, N - A[M - 1]);
}
//cout << vac << endl;
if(vac == INF){
cout << 0 << endl;
return 0;
}
ll ans = 0;
if(A[0] != 1){
ll x = A[0] - 1;
ans += ((x + vac - 1) / vac);
}
//cout << ans << endl;
rep(i, 0, M - 1){
if(A[i + 1] - A[i] == 1) continue;
else{
ll y = A[i + 1] - A[i] - 1;
ans += ((y + vac - 1) / vac);
}
}
//cout << ans << endl;
if(A[M - 1] != N){
ll z = N - A[M - 1];
ans += ((z + vac - 1)/ vac);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (auto &i : a) i = ri();
int res = 2000000000;
for (int i = 0; i < 1 << (n - 1); i++) {
int xored = 0;
int ored = 0;
for (int j = 0; j <= n; j++) {
if (j < n) ored |= a[j];
if (j == n || (i >> j & 1)) xored ^= ored, ored = 0;
}
res = std::min(res, xored);
}
printf("%d\n", res);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<string.h>
using namespace std;
long long int a[300001];
long long int b[300001];
long long int amax[200001];
string func0(string s);
string func1(string s);
string func2(string s);
int main() {
int n;
cin >> n;
int bi[9] = { 1,2,4,8,16,32,64,128,256 };
cout << bi[n] - 1 << endl;
string ab[256], abold[256];
int i, j;
ab[0] = "AB";
for (i = 2; i <= n; i++) {
for (j = 0; j < 256; j++) {
abold[j] = ab[j];
}
ab[0] = func0(abold[0]);
for (j = 0; j < bi[i - 1] - 1; j++) {
ab[j+1] = func1(abold[j]);
}
for (j = 0; j < bi[i - 1]-1; j++) {
ab[j + bi[i - 1]] = func2(abold[j]);
}
}
for (i = 0; i < bi[n]-1; i++) {
cout << ab[i] << endl;
}
return 0;
}
string func0(string s) {
return s + s;
}
string func1(string s) {
int i;
string t = "";
for (i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
t = t + "AA";
}
else if(s[i] == 'B') {
t = t + "BB";
}
}
return t;
}
string func2(string s) {
int i;
string t = "";
for (i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
t = t + "AB";
}
else if (s[i] == 'B') {
t = t + "BA";
}
}
return t;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using Vec2 = vector<vector<T>>;
#define REP(i, m, n) for(ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for(ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for(ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <class T1, class T2>
bool chmax(T1 &a, const T2 b){if(a < b){a = b; return true;} return false;}
template <class T1, class T2>
bool chmin(T1 &a, const T2 b){if(a > b){a = b; return true;} return false;}
ll pow2(const int n){return (1LL << n);}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &i : v) os << i << ' ';
return os;
}
void co() { cout << '\n'; }
template <class Head, class... Tail>
void co(Head&& head, Tail&&... tail) {
cout << head << ' ';
co(forward<Tail>(tail)...);
}
void ce() { cerr << '\n'; }
template <class Head, class... Tail>
void ce(Head&& head, Tail&&... tail) {
cerr << head << ' ';
ce(forward<Tail>(tail)...);
}
template <class T>
vector<T> Vec(int64_t a, int64_t x = 0) {
return vector<T>(a, x);
}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const int n){cout << fixed << setprecision(n);}
constexpr int INF = 1000000001;
constexpr ll LINF = 1000000000000000001;
constexpr ll MOD = 1000000007;
constexpr ll MOD_N = 998244353;
constexpr ld EPS = 1e-11;
const double PI = acos(-1);
int main(void) {
ll n;
cin >> n;
auto a = Vec<ll>(n);
rep(i, n) cin >> a[i];
rep(i, n - 1) a[i + 1] += a[i];
ll ans = 0, p = 0, max = 0;
rep(i, n) {
chmax(ans, p + max);
p += a[i];
chmax(ans, p);
chmax(max, a[i]);
}
co(ans);
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N)
cin >> A[i];
ll DP[N+1][2];
ll numm[N+1]={0},nump[N+1]={0};
memset(DP,0,sizeof(DP));
DP[1][0] = A[0];
nump[1] = 1;
numm[1] = 0;
for(int i=2;i<=N;i++){
nump[i] = nump[i-1] + numm[i-1];
numm[i] = nump[i-1];
nump[i] %= MOD;
numm[i] %= MOD;
DP[i][0] = nump[i]*A[i-1];
DP[i][0] %=MOD;
DP[i][0] += DP[i-1][0] + DP[i-1][1];
DP[i][0] %=MOD;
DP[i][1] = DP[i-1][0] - numm[i]*A[i-1];
if(i != N){
while(DP[i][1] < 0)
DP[i][1] += (ll)MOD*(ll)MOD;
}
DP[i][1] %=MOD;
}
ll ans = DP[N][0] + DP[N][1];
while(ans < 0)
ans += (ll)MOD * (ll)(MOD);
ans %= MOD;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define ss second
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define nn "\n"
#define sci(x) scanf("%d", &x)
#define LL_INF (1LL << 62)
#define INF (1 << 30)
#define SetBit(x, k) (x |= (1LL << k))
#define ClearBit(x, k) (x &= ~(1LL << k))
#define CheckBit(x, k) (x & (1LL << k))
#define mod 998244353
#define N 200005
int n;
ll z;
int x[105];
int dp[105][105][105];
int solve(int pos, int cnt, int rem, int k){
if(cnt==k){
if(rem==0) return 0;
return -INF;
}
if(pos>=n) return -INF;
if(dp[pos][cnt][rem]!=-1) return dp[pos][cnt][rem];
int res = -INF;
res = max(res, x[pos]+solve(pos+1, cnt+1, (k+(rem-x[pos])%k)%k, k));
res = max(res, solve(pos+1, cnt, rem, k));
return dp[pos][cnt][rem] = res;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> z;
for(int i = 0; i < n; i++){
cin >> x[i];
}
ll res = LL_INF;
for(int i = 1; i <= n; i++){
memset(dp, -1, sizeof dp);
ll r = solve(0, 0, z%i, i);
if(r>=0 && (z-r)%i==0) res = min(res, (z-r)/i);
}
cout << res << nn;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(x) (x).begin(),(x).end()
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define rep(i,n) for(int i=0;i<(n);i++)
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; }
template<class T> using V = vector<T>;
int dx[4] = {-1,0,1,0};
int dy[4] = {0,-1,0,1};
int main(){
int H, W, X, Y; cin >> H >> W >> X >> Y; X--, Y--;
V<string> grid(H); rep(i, H)cin >> grid[i];
int res = 1;
rep(k, 4){
int x = X, y = Y;
while(1){
x += dx[k], y += dy[k];
if(x<0 or y<0 or x>=H or y>=W)break;
if(grid[x][y]=='#')break;
res++;
}
}
cout << res << ln;
}
| #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
// find_by_order(k) returns the iterator to the kth largest element (start from 0)
// order_of_key(k) returns the number of elements in the set which are strictly less than the value k
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define rightmostbit(x) __builtin_ffsll(x)
#define mod 1000000007
#define inf 1e18
#define pi 3.141592653589793238
#define mk(a,n) int n;cin>>n;vi a(n);for(int i=0;i<n;i++) cin>>a[i]
#define endl "\n"
#define w(x) int x; cin>>x; while(x--)
#define deb(...) cerr << "[" << #__VA_ARGS__ << "]: "; cerr << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; } template<typename T> int SIZE(const T &t) { return t.size(); } string to_string(const string s, int x1 = 0, int x2 = 1e9) { return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c) { return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) { string t = ""; for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1); __iii__ <= __jjj__; ++__iii__) { t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1 = 0, int x2 = 1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if (l_v_l_v_l == 0) res += "\n"; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2 - x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if (e != l) { if (rnk > 1) { res += "\n"; t_a_b_s = l_v_l_v_l; }; } else { t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if (l_v_l_v_l == 0) res += "\n"; return res; } void dbgm() {;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T) { cerr << to_string(H) << " | "; dbgm(T...); }
#define debm(...) cerr << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cerr << endl
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void g_b()
{
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);
freopen("error.txt", "w", stderr);
#endif
}
const int N = 2e5 + 6;
int32_t main()
{
g_b();
int h, w, x, y; cin >> h >> w >> x >> y;
char a[h + 1][w + 1];
for (int i = 1; i <= h; i++)
for (int j = 1; j <= w; j++)
cin >> a[i][j];
int ans = 0;
ans += (a[x][y] == '.');
for (int j = y + 1; j <= w; j++) {
if (a[x][j] == '.') ans++;
else break;
}
for (int j = y - 1; j >= 1; j--)
{
if (a[x][j] == '.') ans++;
else break;
}
for (int i = x + 1; i <= h; i++) {
if (a[i][y] == '.') ans++;
else break;
}
for (int i = x - 1; i >= 1; i--)
{
if (a[i][y] == '.') ans++;
else break;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int mod = 1e9 + 7;
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
const ll inf = 2e18;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int add(int a, int b) {
int res = (a + b) % mod;
if (res < 0)
res += mod;
return res;
}
int mult(int a, int b) {
int res = (a * 1LL * b) % mod;
if (res < 0)
res += mod;
return res;
}
int power(int a, int b) {
int res = 1;
while (b) {
if ((b % 2) == 1)
res = mult(res, a);
a = mult(a, a);
b /= 2;
}
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return to_string(string(1, c)); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void dbg() { cout << endl; }
template <typename Head, typename... Tail> void dbg(Head H, Tail... T) {
cout << " " << to_string(H);
dbg(T...);
}
#ifdef LOCAL
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", dbg(__VA_ARGS__)
#else
#define debug(...)
#endif
void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(all(v));
int total = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
ans += (v[i] * i - total);
total += v[i];
}
cout << ans << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(10);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
// cout<<"Case "<<i<<": ";
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//okita
int main(){
ll N;cin>>N;
vector<double>l(N),r(N);
rep(i,N){
int t; cin >> t >> l[i] >> r[i];
t--;
if(t&1) r[i] -= 0.5;
if(t&2) l[i] += 0.5;
}
ll ans = 0;
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
if((max(l[i],l[j]) <= min(r[i],r[j]))){
ans++;
}
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f[3005][3005],a[3005],s[3005],ans=0ll;
ll mod=1e9+7;
int n;
int main(){
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i],s[i]=s[i-1]+a[i];
f[1][0]=1;
for(int i=1;i<=n;i++){
for(int j=n;j>=1;j--){
f[j+1][s[i]%(j+1)]=(f[j+1][s[i]%(j+1)]+f[j][s[i]%j])%mod;
if(i==n){
ans=(ans+f[j][s[i]%j])%mod;
}
}
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void cout_line(vector<int> &a){
for(int i=0;i<a.size();i++){
if(i<a.size()-1){
cout<<a.at(i)<<" ";
}else{
cout<<a.at(i)<<endl;
}
}
}
signed main(){
int N; cin>>N;
vec_int A(N); rep(i,N)cin>>A.at(i);
int MOD = pow(10, 9) + 7;
vec_int cumul_A(N+1, 0);
for(int i=1;i<=N;i++){
cumul_A.at(i) = cumul_A.at(i-1)+A.at(i-1);
}
vector<vec_int> DP(N+1, vec_int(N+1, 0)); // DP.at(i).at(j): j番目の数値までをi個に区切ったときの数
DP.at(0).at(0) = 1;
for(int i=0;i<N;i++){
vec_int cumul_A2(N+1);
rep(k,N+1)cumul_A2.at(k) = cumul_A.at(k)%(i+1);
vector<vec_int> inds(i+1);
vector<vec_int> cumul(i+1);
rep(k, i+1)cumul.at(k).push_back(0);
vec_int start_vec(N+1, 0);
rep(k,N+1){
inds.at(cumul_A2.at(k)).push_back(k);
int sz = inds.at(cumul_A2.at(k)).size();
start_vec.at(k) = sz-1;
int prev = cumul.at(cumul_A2.at(k)).at(sz-1);
cumul.at(cumul_A2.at(k)).push_back(prev + DP.at(i).at(k));
}
for(int j=1;j<=N;j++){
// if(DP.at(i).at(j)==0)continue;
int from = cumul_A2.at(j);
int start_ind = start_vec.at(j);
// cout<<i<<" "<<j<<" "<<from<<" "<<start_ind<<" "<<cumul.at(from).at(start_ind)<<endl;
DP.at(i+1).at(j) += cumul.at(from).at(start_ind);
DP.at(i+1).at(j) %= MOD;
/*
for(int k=start_ind+1; k<inds.at(from).size();k++){
DP.at(i+1).at(inds.at(from).at(k)) += DP.at(i).at(j);
DP.at(i+1).at(inds.at(from).at(k)) %= MOD;
}
*/
}
}
int ans = 0;
for(int i=1;i<=N;i++){
ans += DP.at(i).at(N);
ans %= MOD;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main(){
int n;cin>>n;
vector<ll> ans;
vector<ll> x(n,0),y(n,0);
REP(i,n) cin>>x.at(i)>>y.at(i);
sort(x.begin(),x.end());
sort(y.begin(),y.end());
ans.emplace_back(abs(x.at(0)-x.at(n-1)));
ans.emplace_back(abs(x.at(1)-x.at(n-1)));
ans.emplace_back(abs(x.at(0)-x.at(n-2)));
ans.emplace_back(abs(y.at(0)-y.at(n-1)));
ans.emplace_back(abs(y.at(1)-y.at(n-1)));
ans.emplace_back(abs(y.at(0)-y.at(n-2)));
sort(ans.rbegin(),ans.rend());
if(ans.at(0)!=ans.at(1)) cout<<ans.at(1)<<endl;
else{
int xl,xr,yl,yr;
if(x.at(0)!=x.at(1) && x.at(n-2)!=x.at(n-1)){
if(y.at(0)!=y.at(1) && y.at(n-2)!=y.at(n-1)){
xl=x.at(0);
xr=x.at(n-1);
yl=y.at(0);
yr=y.at(n-1);
if(xr-xl==yr-yl){
cout<<ans.at(2)<<endl;
return 0;
}
}
}
cout<<ans.at(1)<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<tuple<int, int, int>> Hx(N), Hy(N);
for(int i = 0; i < N; i++)
{
cin >> get<0>(Hx.at(i)) >> get<1>(Hx.at(i));
get<2>(Hx.at(i)) = i;
get<0>(Hy.at(i)) = get<1>(Hx.at(i));
get<1>(Hy.at(i)) = get<0>(Hx.at(i));
get<2>(Hy.at(i)) = i;
}
sort(Hx.begin(), Hx.end());
sort(Hy.begin(), Hy.end());
vector<tuple<int, int, int>> D(6);
get<0>(D.at(0)) = get<0>(Hx.at(N - 1)) - get<0>(Hx.at(0));
get<1>(D.at(0)) = min(get<2>(Hx.at(N - 1)), get<2>(Hx.at(0)));
get<2>(D.at(0)) = max(get<2>(Hx.at(N - 1)), get<2>(Hx.at(0)));
get<0>(D.at(1)) = get<0>(Hx.at(N - 1)) - get<0>(Hx.at(1));
get<1>(D.at(1)) = min(get<2>(Hx.at(N - 1)), get<2>(Hx.at(1)));
get<2>(D.at(1)) = max(get<2>(Hx.at(N - 1)), get<2>(Hx.at(1)));
get<0>(D.at(2)) = get<0>(Hx.at(N - 2)) - get<0>(Hx.at(0));
get<1>(D.at(2)) = min(get<2>(Hx.at(N - 2)), get<2>(Hx.at(0)));
get<2>(D.at(2)) = max(get<2>(Hx.at(N - 2)), get<2>(Hx.at(0)));
get<0>(D.at(3)) = get<0>(Hy.at(N - 1)) - get<0>(Hy.at(0));
get<1>(D.at(3)) = min(get<2>(Hy.at(N - 1)), get<2>(Hy.at(0)));
get<2>(D.at(3)) = max(get<2>(Hy.at(N - 1)), get<2>(Hy.at(0)));
get<0>(D.at(4)) = get<0>(Hy.at(N - 1)) - get<0>(Hy.at(1));
get<1>(D.at(4)) = min(get<2>(Hy.at(N - 1)), get<2>(Hy.at(1)));
get<2>(D.at(4)) = max(get<2>(Hy.at(N - 1)), get<2>(Hy.at(1)));
get<0>(D.at(5)) = get<0>(Hy.at(N - 2)) - get<0>(Hy.at(0));
get<1>(D.at(5)) = min(get<2>(Hy.at(N - 2)), get<2>(Hy.at(0)));
get<2>(D.at(5)) = max(get<2>(Hy.at(N - 2)), get<2>(Hy.at(0)));
int A, B;
for(int i = 0; i < 3; i++)
{
A = get<1>(D.at(i));
B = get<2>(D.at(i));
for(int j = 3; j < 6; j++)
{
if(A == get<1>(D.at(j)) && B == get<2>(D.at(j)))
{
if(get<0>(D.at(j)) <= get<0>(D.at(i))) get<0>(D.at(j)) = -1;
else get<0>(D.at(i)) = -1;
}
}
}
vector<int> ans(6);
for(int i = 0; i < 6; i++) ans.at(i) = get<0>(D.at(i));
sort(ans.begin(), ans.end(), greater<int>());
cout << ans.at(1) << endl;
return 0;
} |
//#define DEBUG
#define OPTIMIZE
//#define PBDS
//#define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5000;
const int INF = 0x3f3f3f3f, MOD = 998244353;
const long long LINF = LONG_LONG_MAX;
#define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/sizeof(arr[0])), val)
#define REP(i, lb, rb, inc) for(int i = (lb); i < (rb); i += inc)
#define RREP(i, rb, lb, dec) for(int i = (rb)-1; i >= (lb); i -= dec)
typedef long long ll;
typedef queue<int> QI;
typedef vector<int> VI;
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define X real()
#define Y imag()
#define ALL(x) x.begin(), x.end()
#define OUT(x) {x; cout<<endl;}
#ifdef DEBUG
# define dbg(x) x
#else
# define dbg(x)
#endif
#ifdef OPTIMIZE
# pragma GCC optimize("unroll-loops")
# pragma GCC optimize("O3")
# pragma GCC optimize("Ofast")
#endif
#ifdef PBDS
# include <bits/extc++.h>
using namespace __gbu_pbds;
#endif
#ifndef INTERACTIVE
# define endl '\n'
# define IOS() cin.tie(0); cout.sync_with_stdio(0); cout.tie(0)
#else
int ask(int query) {
cout << "? " << query << endl;
int in;
cin >> in;
return in;
}
void answer(int ans) {
cout << "! " << ans << endl;
exit(0);
}
#endif
#define READ(a, t) t a; cin >> a
#define READARR(arr, n) REP(___i, 0, (n), 1) cin >> arr[___i]
#define PRINTARR(arr, n) { REP(___i, 0, (n), 1) cout << arr[___i] << " "; cout << endl; }
int a[MAXN][MAXN];
int p[MAXN][MAXN];
ll fp[MAXN+1];
ll dp[MAXN][MAXN];
signed main() {
#ifndef INTERACTIVE
IOS();
#endif
fp[0] = 1;
REP(i, 1, MAXN+1, 1) fp[i] = (fp[i-1]*3)%MOD;
READ(r, int); READ(c, int); READ(k, int);
REP(i, 0, k, 1) {
int pr, pc; char d;
cin >> pr >> pc >> d;
pr--, pc--;
a[pr][pc] = d=='R'? 1 : d=='D'? 2 : d=='X'? 3 : 0;
}
REP(i, 0, r, 1)
REP(j, 0, c, 1)
p[i][j] = (i>0?p[i-1][j]:0) + (j>0?p[i][j-1]:0) - (i>0&&j>0 ? p[i-1][j-1]:0) + (a[i][j] == 0);
dp[0][0] = 1;
REP(i, 1, r, 1) {
if (a[i-1][0] & 2) dp[i][0] = dp[i-1][0];
else if (!a[i-1][0]) dp[i][0] = 2*dp[i-1][0] % MOD;
}
REP(j, 1, c, 1) {
if (a[0][j-1] & 1) dp[0][j] = dp[0][j-1];
else if (!a[0][j-1]) dp[0][j] = 2*dp[0][j-1] % MOD;
}
REP(i, 1, r, 1) {
REP(j, 1, c, 1) {
ll cnt;
cnt = fp[p[i][j-1]-p[i-1][j-1]];
if (a[i-1][j] & 2) dp[i][j] += dp[i-1][j]*cnt % MOD;
else if (!a[i-1][j]) dp[i][j] += 2*dp[i-1][j]*cnt % MOD;
dp[i][j] %= MOD;
cnt = fp[p[i-1][j]-p[i-1][j-1]];
if (a[i][j-1] & 1) dp[i][j] += dp[i][j-1]*cnt % MOD;
else if (!a[i][j-1]) dp[i][j] += 2*dp[i][j-1]*cnt % MOD;
dp[i][j] %= MOD;
}
}
cout << dp[r-1][c-1]*( !a[r-1][c-1] ? 3:1 ) % MOD << endl;
dbg(
REP(i, 0, r, 1) PRINTARR(dp[i], c);
cout << endl;
REP(i, 0, r, 1) PRINTARR(p[i], c);
)
} | #include <bits/stdc++.h>
/* snippet: useful macros and functions */
#define ARC(i, a, b) for(Int i = (a); i < (b); ++i)
#define RC(i, n) ARC(i, 0, n)
#define ARCH(i, a, b) for(Int i = (a) - 1; i >= (b); --i)
#define RCH(i, n) ARCH(i, n, 0)
#define ALL(v) v.begin(), v.end()
template<class T> T rng(const T &a, const T &b){ return a < b ? b - a : a - b; }
template<class T> void chmaxmin(T &a, const T &b, const T &(*f)(const T &, const T &)){ a = f(a, b); }
#define chmax(a, b) chmaxmin(a, b, std::max)
#define chmin(a, b) chmaxmin(a, b, std::min)
#if __has_include(<experimental/iterator>)
#include <experimental/iterator>
auto debug = std::experimental::make_ostream_joiner(std::cout, " ");
#endif
/* snippet: inf struct */
#if __cplusplus >= 201703
struct{ template<class T> constexpr operator T(){ return std::numeric_limits<T>::max(); } constexpr auto operator-(); } inf;
struct{ template<class T> constexpr operator T(){ return std::numeric_limits<T>::lowest(); } constexpr auto operator-(); } negative_inf;
constexpr auto decltype(inf)::operator-(){ return negative_inf; }
constexpr auto decltype(negative_inf)::operator-(){ return inf; }
#endif
/* snippet: modint library */
#if __cpp_concepts
template<std::signed_integral T, T MOD>
#else
template<class T, T MOD>
#endif
class Modint{
T val;
public:
Modint(T val = 0) : val(val % MOD + (val >= 0 ? 0 : MOD)) {}
operator T(){ return val; }
Modint &operator+=(const Modint &a){ val += a.val; if(val >= MOD) val -= MOD; return *this; }
Modint &operator-=(const Modint &a){ val -= a.val; if(val < 0) val += MOD; return *this; }
Modint &operator*=(const Modint &a){ val = val * a.val % MOD; return *this; }
void inverse(){T x[2]={MOD,val},a[2]={0,1};int i;for(i=0;x[!i];i^=1){a[i]-=x[i]/x[!i]*a[!i];x[i]=x[i]%x[!i];}if(!i)a[i]+= MOD;val=a[i];}
Modint &operator/=(Modint a){ a.inverse(); return *this *= a; }
friend Modint modpow(Modint a, int n){ Modint ret(1); while(n){ if(n & 1) ret *= a; a *= a; n >>= 1; } return ret; }
friend Modint operator+(Modint a, const Modint &b){ return a += b; }
friend Modint operator-(Modint a, const Modint &b){ return a -= b; }
friend Modint operator*(Modint a, const Modint &b){ return a *= b; }
friend Modint operator/(Modint a, const Modint &b){ return a /= b; }
friend std::ostream &operator<<(std::ostream &os, const Modint &a){ return os << a.val; }
};
/* push n numbers and get i-th min */
/* to get min and 2nd min, declare K_th_min<T, 2> and use get<0>(), get<1>() */
#if __cplusplus >= 201703
template<class T, std::size_t K>
class K_th_min{
friend class K_th_min<T, K + 1>;
T val;
K_th_min<T, K - 1> lower;
void push_(T &x){ lower.push_(x); if(val > x) std::swap(val, x); }
public:
K_th_min() : val(std::numeric_limits<T>::max()) {}
void push(T x){ push_(x); }
template<std::size_t I> T get(){ if constexpr(I == K - 1) return val; else return lower.template get<I>(); }
};
template<class T> class K_th_min<T, 0>{ friend class K_th_min<T, 1>; void push_(T &){} public: K_th_min(){} void push(T){} };
#endif
/* snippet: */
int fourd[] = {0, 1, 0, -1, 0};
int eightd[] = {0, 1, 1, -1, 0, -1, -1, 1, 0};
/* snippet: using declarations */
using Int = long long;
using std::cout;
using std::cin;
using std::endl;
using Mint = Modint<long long, 1000000007>;
int main(){
Int time;
cin >> time;
RC(t, time){
Int n_, a_, b_;
cin >> n_ >> a_ >> b_;
if(a_ + b_ > n_){
cout << 0 << endl;
continue;
}
Mint n(n_), a(a_), b(b_);
Mint aa = n - a + Mint(1);
Mint bb = n - b + Mint(1);
Mint ab = a + b - Mint(1);
// cout << "aa: " << aa << endl;
// cout << "bb: " << bb << endl;
// cout << "ab: " << ab << endl;
Mint tmp = (a + ab) * b;
// cout << tmp << endl;
tmp += ab * (aa - b * Mint(2));
// cout << tmp << endl;
tmp *= tmp;
cout << aa * aa * bb * bb - tmp << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string S;
void gogo()
{
cin >> N >> S;
if (S[0] != S[N-1])
{
cout << "1\n";
return;
}
for (int i = 0; i + 1 < N; i++)
{
if (S[i] != S[0] && S[i+1] != S[0])
{
cout << "2\n";
return;
}
}
cout << "-1\n";
}
int main()
{
ios_base::sync_with_stdio(0);
int T = 1;
for (int t = 0; t < T; t++)
gogo();
} |
/*/ Author : Abhishek Chauhan /*/
#include<bits/stdc++.h>
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
using namespace std;
// a+b = a^b + 2*(a&b)
// According to Fermat's little theorem, (a^b)%mod = ((a^(b%(mod - 1)))%mod) if mod is a prime number and not the other way round.
// whenever using a comparator return true only if a<b
// make it forward first if it doesnt work do the reverse
// vector a = ax + ay b = bx + by then dot porduct is |a||b|cos@ //and also for eas you can use (ax*bx)+(ay*by);
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define mod 1000000007
#define bpop(x) __builtin_popcountll((x))
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl '\n'
template<class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
template<class T>
T power(T x, T y){T res = 1;while (y > 0){ if (y & 1){res = res*x;} y = y>>1;x = x*x;}return res;}
template<class T>
T powermod(T x, T y, T p){T res = 1;x = x % p;while (y > 0){if (y & 1){res = (res*x) % p;}y = y>>1; x = (x*x) % p;}return res;}
const int N = 20;
vector<int>g[N];
int vis[N],col[N];
vector<int>order;
void get(int node){
vis[node] = 1;
order.pb(node);
for(auto x:g[node]){
if(vis[x]==0){
get(x);
}
}
}
int recur(int i){
if(i>=order.size()){
return 1;
}
int res = 0;
vis[order[i]] = 1;
vector<int>can(4,1);
for(auto x:g[order[i]]){
if(col[x]!=0){
can[col[x]] = 0;
}
}
for(int c=1;c<4;c++){
if(can[c]){
col[order[i]] = c;
res+=recur(i+1);
col[order[i]] = 0;
}
}
return res;
}
void snow(){
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
vis[i] = 0;
col[i] = 0;
}
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;a--;b--;
g[a].pb(b);
g[b].pb(a);
}
int ans = 1;
for(int i=0;i<n;i++){
if(!vis[i]){
order.clear();
get(i);
col[order[0]] = 1;
vis[order[0]] = 1;
if(order.size()==1){
ans = ans*3;
}
else{
ans=ans*3*recur(1);
}
}
}
cout<<ans<<endl;
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fastio;
int _;
_=1;
for(int i=1;i<=_;i++){
// cout<<"Case #"<<i<<": ";
snow();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define D(n) DW(i, n)
#define DD(n) DW(j, n)
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vpll = vector<pll>;
using vtll = vector<tll>;
using gr = vector<vll>;
using wgr = vector<vpll>;
void add_edge(gr&g,ll x, ll y){ g[x].pb(y);g[y].pb(x); }
void add_edge(wgr&g,ll x, ll y, ll z){ g[x].eb(y,z);g[y].eb(x,z); }
template<typename T,typename U>
ostream& operator<<(ostream& os, const pair<T,U>& p) {
cerr << ' ' << p.x << ',' << p.y; return os; }
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for(auto x: v) os << ' ' << x; return os; }
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
for(auto x: v) os << ' ' << x; return os; }
template<typename T,typename U>
ostream& operator<<(ostream& os, const map<T,U>& v) {
for(auto x: v) os << ' ' << x; return os; }
struct d_ {
template<typename T> d_& operator,(const T& x) {
cerr << ' ' << x; return *this;}
} d_t;
#define dbg(args ...) { d_t,"|",__LINE__,"|",":",args,"\n"; }
#define deb(X ...) dbg(#X, "=", X);
#define EPS (1e-10)
#define INF (1LL<<61)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
int main(void) {
ios_base::sync_with_stdio(false);
ll n; cin >> n;
map<ll,ll> g;
auto r = [&](ll d, ll x) {
if(g.count(d)) g[d]=__gcd(g[d],x);
else g[d]=x;
};
ll mn = INF;
REP(_,n) {
ll x; cin >> x;
for(ll i=1;i*i<=x;++i) {
if(x%i==0) r(i,x),r(x/i,x);
}
mn = min(mn, x);
}
ll ret = 0;
for(auto i: g) if(i.x<=mn && i.x==i.y) ret++;
cout << ret << endl;
return 0;
}
| #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
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];
}
os << '}';
return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
cerr << " " << x;
debugg(args...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 4020000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
int sz = a.size();
for(auto itr = a.begin(); itr != a.end(); itr++){
cout << *itr;
sz--;
if(sz) cout << " ";
}
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;
ll GCD(ll a, ll b){
if(b==0) return a;
else return GCD(b,a%b);
}
int main(){
int n; cin >> n;
vl a(n); rep(i,n) cin >> a[i];
map<int,vector<int>> mp;
sort(all(a));
rep(i,n){
for(int j=1; j*j<=a[i]; j++){
if(a[i] % j == 0){
mp[j].push_back(a[i]);
if(j != a[i]/j) mp[a[i]/j].push_back(a[i]);
}
}
}
int ans = 0;
for(auto x : mp){
if(x.first > a[0]) break;
int gc = 0;
for(auto y : x.second){
gc = GCD(gc, y);
}
if(gc == x.first) ans++;
}
cout << ans << "\n";
} |
#include <algorithm>
#include <cstdint>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <cfloat>
using namespace std;
using lint=int64_t;
using uint=uint32_t;
using ulint=uint64_t;
template<class T>
using vector2d=vector<vector<T>>;
template<class T>
bool UpdateMax(T &a, const T &b){
if(a<b){
a=b;
return true;
}else{
return false;
}
}
template<class T>
bool UpdateMin(T &a, const T &b){
if(a>b){
a=b;
return true;
}else{
return false;
}
}
template <class T>
void OutVec(const vector<T>& vec){
for(int i = 0; i < vec.size() - 1; ++i){
cout<<vec[i]<<" ";
}
cout<<vec.back()<<endl;
}
template <class T>
void OutVec2d(const vector2d<T>& vec){
for(auto v:vec){
OutVec(v);
}
}
int main(){
cout << std::fixed << std::setprecision(16);
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
string s;
cin>>s;
cout<<s[1]<<s[2]<<s[0]<<endl;
return 0;
}
| #include<cstdio>
using namespace std;
char a,b,c;
int main()
{
scanf("%c%c%c",&a,&b,&c);
if(a==b&&b==c) printf("Won");
else printf("Lost");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vpii vector<pii>
#define pb push_back
#define MOD 1000000007
#define all(x) x.begin(), x.end()
#define sze(x) (int) x.size()
int main() {
double v, s, t, d;
scanf("%lf %lf %lf %lf", &v, &s, &t, &d);
if(d/v < s || d/v > t) {
printf("Yes\n");
}
else {
printf("No\n");
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double a,b,c,d;
cin >> a >> b >> c >> d;
double k = (a*d+b*c)/(b+d);
cout << setprecision(8) << k << endl;
} |
#include<bits/stdc++.h>
#define M 200005
typedef long long ll;
using namespace std;
bool f2;
char IO;
ll rd(){
ll 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;
}
int n,m;
struct node{
int X,Y;
bool operator<(const node &_)const{
if(X==_.X)return Y<_.Y;
return X<_.X;
}
}A[M];
int B[M];
map<int,int> mp;
int upd[M],del[M],cnt,c;
bool f1;
int main(){
// cout<<(&f1-&f2)/1024.0/1024.0<<endl;
n=rd();m=rd();
for(int i=1;i<=m;++i)
A[i].X=rd(),A[i].Y=rd();
sort(A+1,A+m+1);
mp[n]=1;
for(int i=1;i<=m;++i){
if(mp[A[i].Y-1]||mp[A[i].Y+1])
upd[++cnt]=A[i].Y;
del[++c]=A[i].Y;
if(i==m||A[i].X!=A[i+1].X){
while(c)mp[del[c--]]=0;
while(cnt)mp[upd[cnt--]]=1;
}
}
int ans=mp[n];mp[n]=0;
for(int i=1;i<=m;++i){
ans+=mp[A[i].Y];
mp[A[i].Y]=0;
}cout<<ans;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
map<int, vector<int>> mp;
rep(i, m){
int x, y;
cin >> x >> y;
mp[x].push_back(y);
}
set<int> s;
s.insert(n);
for(auto p : mp){
vector<int> add;
for(int y : p.second){
if(s.count(y-1) || s.count(y+1)) add.push_back(y);
}
for(int y : p.second) s.erase(y);
for(int y : add) s.insert(y);
}
cout << s.size() << endl;
} |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <sstream>
#define INF 1000000009
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << max(a,b) - min(c,d) << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
int main()
{
int a,b,c,d,e;
cin >> a >> b;
cin >> c >>d;
e = b-c;
cout << e;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll MOD=1000000007;
// ll MOD=998244353;
constexpr ll mod=998244353;
void Add(int &a, int b) {
a += b;
while (a >= MOD) a -= MOD;
while (a < 0) a += MOD;
}
void Mul(int &a, int b) {
a = 1LL * a * b % MOD;
}
int Pow(int b, int e) {
if (e < 0) e += MOD - 1;
int ret = 1;
while (e) {
if (e & 1) ret = 1LL * ret * b % MOD;
b = 1LL * b * b % MOD;
e >>= 1;
}
return ret;
}
int main() {
ll n,m,s;
s=0;
cin >> n >> m;
vector<ll> a(n);
rep(i,n) cin >> a[i];
rep(i,n) s+=a[i];
ll ans=1;
rep(i,s+n) (ans*=(m+n-i))%=MOD;
rep(i,s+n) (ans*=Pow(i+1,MOD-2))%=MOD;
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int n,m,sum,ans,a[2005];
int ksm(int n,int m){
if (!m)return 1;
int s=ksm(n,m>>1);
s=1LL*s*s%mod;
if (m&1)s=1LL*s*n%mod;
return s;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
sum+=n;
m+=n;
//c(m,sum)
ans=1;
for(int i=1;i<=sum;i++)ans=1LL*ans*ksm(i,mod-2)%mod*(m-i+1)%mod;
printf("%d",ans);
} |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin>>n;
vector<pair<ll,ll>>v;
for(ll i=0;i<n;i++)
{
ll z,x;
cin>>z>>x;
v.push_back({z,x});
}
vector<ll>t;
for(ll i=0;i<n;i++)
{
for(ll j=0;j<n;j++)
{
if(i==j)
{
t.push_back(v[i].first+v[i].second);
}
else
{
t.push_back(max(v[i].first,v[j].second));
t.push_back(max(v[i].second,v[j].first));
}
}
}
cout<<*min_element(t.begin(),t.end())<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fori(i, start, end) for(int i=start; i<=end; i++)
#define ford(i, start, end) for(int i=start; i>=end; i--)
#define fora(i, iterable) for(auto i=iterable.begin(); i!=iterable.end(); i++)
#define mmset(ds, val) memset(ds, val, sizeof(ds))
#define sortar(arr, len) sort(arr, arr + len)
#define sortds(ds) sort(ds.begin(), ds.end())
#define nl '\n'
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef set<int> sti;
typedef set<ll> stl;
void solve() {
int n;
cin >> n;
int c[n][2];
int alone = INT_MAX, a = INT_MAX, b = INT_MAX;
fori(i, 0, n-1) {
fori(j, 0, 1) {
cin >> c[i][j];
}
if(i==0) a = c[i][0], b = c[i][1];
if(a > c[i][0])
a = c[i][0];
else
b = min(b, c[i][1]);
alone = min(alone, c[i][0] + c[i][1]);
}
cout << min(alone, max(a,b)) << nl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template <class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define INF 0x3f3f3f3f
#define sqr(a) (a) * (a)
#define siz(a) int(a.size())
#define ints(a...) int a; read(a)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define trav(i, v) for (const auto i : v)
#define Fill(a, b) memset(a, b, sizeof(a))
#define rep(i, b, n) for (auto i = b; i < n; i++)
#define per(i, b, n) for (auto i = b; i >= n; i--)
#define unify(a) sort(all(a)), a.resize(unique(all(a)) - a.begin())
template <class T> using vec = vector<T>;
template <class... Args> inline void read(Args&... args) { ((cin >> args), ...); }
template <class... Args> inline void show(Args... args) { ((cout << args << " "), ...); }
template <class T1, class T2> inline bool ckmin(T1 &a, T2 b) { return a > b ? a = b, 1 : 0; }
template <class T1, class T2> inline bool ckmax(T1 &a, T2 b) { return a < b ? a = b, 1 : 0; }
template <class T> inline void operator>> (istream& in, vector<T>& v) { rep(i, 0, siz(v)) in >> v[i]; }
template <class T> inline void operator<< (ostream& out, const vector<T>& v) { rep(i, 0, siz(v)) out << v[i] << " \n"[i + 1 == siz(v)]; }
const int MOD = 1e9 + 7;
const ld PI = acos(-1);
void solve() {
ints(n);
vec<ll> a(n); read(a);
sort(all(a));
vec<ll> suf(n + 1);
per(i, n - 1, 0)
suf[i] = suf[i + 1] + a[i];
ll res = 0;
rep(i, 0, n - 1)
res += abs((n - 1 - i) * a[i] - suf[i + 1]);
cout << res;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
// setw(), setfill()
int _ = 1;
// cin >> _;
rep(i, 1, _ + 1) {
// printf("Case %d: ", i);
// Solution solve;
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define dd long double
#define all(x) x.begin(),x.end()
bool decToOctal(int n)
{
// array to store octal number
int octalNum[100];
// counter for octal number array
int i = 0;
while (n != 0) {
// storing remainder in octal array
octalNum[i] = n % 8;
n = n / 8;
i++;
}
// printing octal number array in reverse order
for (int j = i - 1; j >= 0; j--){
if(octalNum[j]==7){
return false;
}
}
return true;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
vector<ll> arr(n+1);
arr[0]=-1e18;
REP(i,n){
cin>>arr[i+1];
}
sort(all(arr));
vector<ll> pref(n+1,0);
for(ll i=1;i<=n;i++){
pref[i]=pref[i-1]+arr[i];
}
ll ans=0;
for(ll i=1;i<=n;i++){
ll x=(i-1)*arr[i];
ll prex=pref[i-1];
ll temp=abs(x-prex);
ans+=temp;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<math.h>
#include<set>
#include<string>
#include<queue>
#include<map>
using namespace std;
#define rep(i,n) for(ll i = 0;i<n;i++)
#define req(i,n) for(ll i = 1;i<=n;i++)
#define rrep(i,n) for(int i = n-1;i>=0;i--)
#define ALL(a) a.begin(),a.end()
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; }
typedef long long ll;
typedef long double d;
const ll INF = 1<<61;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
int a, b, c; cin >> a >> b >> c; int o = a % 10,ans;
if (o == 1 || o == 0 || o == 5 || o == 6) ans = a % 10;
else if (o == 2 || o == 7 || o == 8) {
int t = mod_pow(b, c, 4);
if (o == 2) {
if (t == 0)ans = 6;
else if (t == 1)ans = 2;
else if (t == 2)ans = 4;
else ans = 8;
}
else if (o == 7) {
if (t == 0)ans = 1;
else if (t == 1)ans = 7;
else if (t == 2)ans = 9;
else ans = 3;
}
else {
if (t == 0)ans = 6;
else if (t == 1)ans = 8;
else if (t == 2)ans = 4;
else ans = 2;
}
}
else if (o == 4 || o == 9) {
int t = mod_pow(b, c, 2);
if (o == 4) {
if (t == 0) ans = 6;
else ans = 4;
}
else {
if (t == 0)ans = 1;
else ans = 9;
}
}
else {
int t = mod_pow(b, c, 3);
if (t == 0) ans = 7;
else if (t == 1)ans = 3;
else ans = 9;
}cout << ans << endl;
} | #include <stdio.h>
long long A, B, C;
long long d[10][4];
int main() {
long long i, u;
for (i = 0; i < 10; i++) for (d[i][0] = i, u = 1; u < 4; u++) d[i][u] = (d[i][u - 1] * i) % 10;
scanf("%lld%lld%lld", &A, &B, &C);
B %= 4, C %= 32;
for (i = 1, u = 0; u < C; i *= B, u++);
printf("%lld", d[A % 10][(i + 3) % 4]);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define eb emplace_back
using namespace std;
void vec(vector<int> & v){
for(int i = 0;i<v.size() ; i++){
cout<<v[i]<< " ";
}
cout<<endl;
}
void vec_ll(vector<long long int> & v){
for(int i = 0;i<v.size() ; i++){
cout<<v[i]<< " ";
}
cout<<endl;
}
void vec_ull(vector<ull> & v){
for(int i = 0;i<v.size() ; i++){
cout<<v[i]<< " ";
}
cout<<endl;
}
int parsestring(string temp){
int num= 0;
int digs = temp.size() - 1;
for(int i = 0 ;i<=digs;i++){
num += pow(10 , digs -i)*(temp[i] - '0');
}
return num;
}
void factorize(ll n , map<ll , ll>&m){
for(ll i = 2;i<=(long long)sqrt(n);i++){
if(n% i == 0){
while(n%i == 0){
m[i]++;
n = n/i;
}
}
}
if(n > 1){m[n]++;}
}
vector<vector<int>>adj , v;
vector<int>in , out, h;
int timer = 1;
void dfs(int root , int depth){
// cout<<"at "<<root<<endl;
in[root] = timer;
h[root] = depth;
v[depth].eb(in[root]);
for(int i = 0;i<adj[root].size() ;i++){
timer++;
dfs(adj[root][i] ,depth +1 );
}
timer++;
out[root] = timer;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
adj = vector<vector<int>>(n+1);
for(int i = 2;i<=n;i++){
int x;
cin>>x;
adj[x].eb(i);
}
v = vector<vector<int>>(n+1);
in = out = h = vector<int>(n+1);
dfs(1 , 0);
int q;
cin>>q;
while(q){
int u,d;
cin>>u>>d;
int temp1 = lower_bound(v[d].begin() ,v[d].end() , in[u]) - v[d].begin();
int temp2= lower_bound(v[d].begin() , v[d].end() , out[u]) - v[d].begin();
// cout<<"temp "<<temp1<< " " <<temp2<<endl;
if(temp1 < temp2){
cout<< temp2- temp1<<endl;
}
else{cout<<0<<endl;}
q--;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%MOD+MOD)%MOD){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator-=(const mint a) {
if ((x += MOD-a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= MOD; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination MOD prime
struct combination {
vector<mint> fact, ifact;
combination(int n):fact(n+1),ifact(n+1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
mint p(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[n-k];
}
}; // comb(10000007); // ←MOD-1が上限
// comb(5, 2) → 10, comb.p(5, 2) → 20
// comb.fact[4] → 24, 2のN乗 → mint(2).pow(N)
int main() {
// parallel world (projection)
int T;
cin >> T;
rep(i, T) {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (A + B > N) {
cout << 0 << '\n';
continue;
}
// 辺で考えて重ならない方法をまず求める、(N-A-B+2)C2
mint x = mint(N-A-B+2) * (N-A-B+1) / 2 * 2;
mint y = mint(N-A+1) * (N-B+1) - x;
mint ans = mint(N-A+1).pow(2) * mint(N-B+1).pow(2);
ans -= y.pow(2);
printf("%lld\n", ans.x);
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n, s, d;
cin >> n >> s >> d;
vector<ll> a(n), b(n);
rep(i, n){
cin >> a[i] >> b[i];
}
ll total = 0;
rep(i, n){
if(a[i] < s && b[i] > d){
total += b[i];
}
}
if(total > 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int N, S, D;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
cin >> N >> S >> D;
for(int i=1; i<=N; i++)
{
int x, y;
cin >> x >> y;
if (x >= S || y <= D) continue;
cout << "Yes";
return 0;
}
cout << "No";
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
int main()
{
ll n;
cin >> n;
ll ans = n + 1;
ll tmp = 0;
ll num = 1;
while (tmp + num <= n + 1)
{
ans--;
tmp += num;
num++;
}
cout << ans << '\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
//inline unsigned long long read()
//{
// unsigned long long sum=0,nega=1;char ch=getchar();
// while(ch>'9'||ch<'0'){if(ch=='-')nega=-1;ch=getchar();}
// while(ch<='9'&&ch>='0')sum=sum*10+ch-'0',ch=getchar();
// return sum*nega;
//}
unsigned long long n,res,ans,mid;
int main()
{
cin>>n;
res=n*8+9;
unsigned long long l=0,r=4e9;
while(l<r)
{
mid=(l+r+1)/2;
if(mid*mid<=res)l=mid;
else r=mid-1;
}
if(l*l<=res)ans=l;
else ans=r;
ans=(ans-1)/2;
cout<<n-ans+1<<endl;
//cout<<min((sum*2-1)*x,x+)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n, c;
cin >> n >> c;
vector<pair<int, int>> vp(2 * n);
for (int i = 0; i < n; ++i)
{
int a, b, c1;
cin >> a >> b >> c1;
vp[2 * i] = {a, c1};
vp[2 * i + 1] = {b + 1, -c1};
}
sort(vp.begin(), vp.end());
ll ans = 0;
int i;
vector<pair<int, ll>> nvp;
for (i = 0; i < 2 * n;)
{
ll cur = 0;
int j = i;
while (j < 2 * n && vp[i].first == vp[j].first)
{
cur += vp[j].second;
++j;
}
nvp.push_back({vp[i].first, cur});
i = j;
}
n = nvp.size();
ll cur = 0;
for (int i = 0; i < n - 1; ++i)
{
cur += nvp[i].second;
ans += min(cur, (ll)c) * (nvp[i + 1].first - nvp[i].first);
}
cout << ans << '\n';
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
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 a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; //check the limits, dummy
void solve() {
int N; cin >> N;
ll C; cin >> C;
map<int, ll> ev;
F0R(i, N) {
int A, B; ll C; cin >> A >> B >> C;
ev[A]+=C;
ev[B+1]-=C;
}
ll sum = 0;
ll ans = 0;
trav(a, ev) {
sum += a.s;
auto it = ev.ub(a.f);
if (it != ev.end()) {
ans += min(sum, C) * (it->f - a.f);
}
}
cout << ans << nl;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while(T--) {
solve();
}
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343
|
#include <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <vector>
#include <list>
#include <cmath>
#include <map>
#include <deque>
#include <utility>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <string>
#include <stack>
#include <set>
#include <functional>
#include <iterator>
#include <algorithm>
using namespace std;
typedef long long ll;
class UnionFind {
private:
vector<int> f;
int _components;
public:
explicit UnionFind(int sz): f(sz), _components(sz) {
for (int i = 0; i < sz; i++) {
f[i] = i;
}
}
int find(int x) {
if (x == f[x]) return x;
int fa = f[x];
return f[x] = find(fa);
}
void add(int x, int y) {
int fx = find(x), fy = find(y);
if (fx != fy) {
_components--;
}
f[fx] = fy;
}
int components() const {
return _components;
}
};
ll gcd(ll a, ll b) {
if (b == 0)return a;
else return gcd(b, a%b);
}
int main(int argc, char *argv[]) {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
const int mod = 1e9+7;
int n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
ll ret = arr[0] + 1;
for (int i = 1; i < n; i++) {
ret *= (arr[i] - arr[i-1] + 1);
ret %= mod;
}
cout << ret << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cerr << "[" << #x << "]: " << x << "\n";
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using pl = pair<ll, ll>;
ld const PI = 4*atan((ld)1);
template<int MOD = 998'244'353>
struct Mint
{
int val;
Mint() : val(0) {}
Mint(ll _val) : val((int)(_val % MOD)) { if (val < 0) val += MOD; }
Mint& operator+= (const Mint &rhs) { val += rhs.val; if (val >= MOD) val -= MOD; return *this; }
Mint& operator-= (const Mint &rhs) { val -= rhs.val; if (val < 0) val += MOD; return *this; }
Mint& operator*= (const Mint &rhs) { val = (int)((ll) val * rhs.val % MOD); return *this; }
friend Mint fpow(Mint x, ll y)
{
Mint res = 1;
for (; y > 0; y >>= 1, x *= x)
{
if (y & 1)
res *= x;
}
return res;
}
friend Mint inverse(Mint x) { return fpow(x, MOD-2); }
Mint& operator/= (const Mint &rhs) { return *this *= inverse(rhs); }
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) { return 0 - a; }
friend Mint operator* (Mint a, const Mint &b) { return a *= b; }
friend Mint operator/ (Mint a, const Mint &b) { return a /= b; }
friend ostream& operator<< (ostream &os, const Mint &a) { return os << a.val; }
friend bool operator== (const Mint &a, const Mint &b) { return a.val == b.val; }
friend bool operator!= (const Mint &a, const Mint &b) { return a.val != b.val; }
};
const int MAX = 107;
int n;
int w[MAX];
Mint<> dp[MAX][MAX * MAX]; //dp[a][b], pick a items such that the weigh sum is exactly b
Mint<> fact[MAX];
int main()
{
fastio;
fact[0] = 1;
for (int i = 1; i < MAX; ++i)
fact[i] = i * fact[i-1];
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i)
cin >> w[i], sum += w[i];
if (sum & 1)
{
cout << 0 << '\n';
return 0;
}
dp[0][0] = 1;
for (int i = 0; i < n; ++i)
{
for (int a = n-1; a >= 0; --a)
{
for (int b = 10000; b >= 0; --b)
{
dp[a+1][b + w[i]] += dp[a][b];
}
}
}
Mint<> res = 0;
for (int i = 1; i <= n; ++i)
{
res += dp[i][sum/2] * fact[i] * fact[n-i];
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
double a,b; cin>>a>>b;
double ans=((a-b)/a);
cout<<ans*100;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
void func(long long A, long long B){
double ans = 100*(B-A)/(double)A;
cout<<abs(ans)<<endl;
}
int main(){
// cout << fixed << setprecision(5);
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
func(A, B);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define For(n) for(int i=0;i<n;i++)
#define in(x) int x; cin>>x;
#define rrep(i,a,n) for(int i=n;i>=a;i--)
#define out(x) cout<<x<<'\n';
#define vi vector<int>
#define pi pair<int,int>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
using ll = long long;
int main() {
int n;
cin>>n;
ll s=0;
while(n--)
{
ll a,b;
cin>>a>>b;
s+=(b*(b+1))/2;
s-=(a*(a-1))/2;
}
out(s)
return 0;
}
| #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <set>
#include <map>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll sum = 0;
rep(i, 0, n) {
ll a, b;
cin >> a >> b;
sum += (b + a) * (b - a + 1) / 2;
}
cout << sum << "\n";
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b));
}
int mul(int a,int b){
return mod(mod(a)*mod(b));
}
// ****************************************************************************
int mat[801][801];
int n,k;
bool isValid(int mid){
int dp[n+1][n+1];
memset(dp,0,sizeof dp);
fo(i,1,n+1){
fo(j,1,n+1){
if(mat[i][j]>mid)
dp[i][j]=1;
}
}
fo(i,1,n+1){
fo(j,1,n+1)
dp[i][j]+=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
}
int pos = ((k*k)/2);
fo(i,k,n+1){
fo(j,k,n+1){
int temp = dp[i][j]-dp[i-k][j]-dp[i][j-k]+dp[i-k][j-k];
if(temp<=pos)
return true;
}
}
return false;
}
void solve(){
cin>>n>>k;
fo(i,1,n+1)
fo(j,1,n+1)
cin>>mat[i][j];
int s = 0,e=INT_MAX;
int ans = e;
while(s<=e){
int mid = s + (e-s)/2;
if(isValid(mid)){
ans=mid;
e=mid-1;
}
else s=mid+1;
}
cout<<ans<<"\n";
}
signed main()
{
FIO
int t;
t=1;
// cin>>t;
while(t--)
{
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
const int N=800+5;
int n,k;
int a[N][N];
struct point{
int x,y;
int a;
bool operator <(const point &p)const{
return a<p.a;
}
}s[N*N];
int cnt;
int f[N][N];
int get(int l,int r,int x,int y){
return f[x][y]-f[x][r-1]-f[l-1][y]+f[l-1][r-1];
}
bool check(int mid){
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
if(a[i][j]<=s[mid].a)f[i][j]=1;
else f[i][j]=0;
}
}
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f[i][j]+=f[i][j-1]+f[i-1][j]-f[i-1][j-1];
for(int i=k;i<=n;++i)
for(int j=k;j<=n;++j)
if(get(i-k+1,j-k+1,i,j)>=k*k-k*k/2)return 1;
return 0;
}
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j){
scanf("%d",&a[i][j]);
s[++cnt]=(point){i,j,a[i][j]};
}
sort(s+1,s+cnt+1);
int l=1,r=n*n,ans;
while(l<=r){
int mid=l+r>>1;
//printf("mid=%d\n",mid);
if(check(mid))r=mid-1,ans=mid;
else l=mid+1;
}
printf("%d\n",s[ans].a);
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 1e5 + 10;
int n, fa[N], col[N];
struct SGT {
int sz[N << 2];
void modify(int x, int l, int r, int p, int v) {
if (l == r) {
sz[x] = v; return;
}
int mid = (l + r) >> 1;
p <= mid ? modify(x << 1, l, mid, p, v) : modify(x << 1 | 1, mid + 1, r, p, v);
sz[x] = sz[x << 1] + sz[x << 1 | 1];
}
int query(int x, int l, int r, int lx, int rx) {
if (rx < l || lx > r) return 0;
if (lx <= l && r <= rx) return sz[x];
int mid = (l + r) >> 1;
return query(x << 1, l, mid, lx, rx) + query(x << 1 | 1, mid + 1, r, lx, rx);
}
} T;
int main() {
cin >> n;
rep(i, 1, n) fa[i] = i;
col[1] = 1;
rep(i, 2, n) {
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
int x = j, y = i / j;
T.modify(1, 1, n, col[x], 1);
T.modify(1, 1, n, col[y], 1);
}
}
int l = 1, r = n, pos = n;
while (l <= r) {
int mid = (l + r) >> 1;
if (T.query(1, 1, n, 1, mid) < mid) pos = mid, r = mid - 1;
else l = mid + 1;
}
col[i] = pos;
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
int x = j, y = i / j;
T.modify(1, 1, n, col[x], 0);
T.modify(1, 1, n, col[y], 0);
}
}
}
rep(i, 1, n) printf("%d ", col[i]); puts("");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
for (int i=1; i<=n; i++)
cout << int(log2(i))+1 << " ";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define inf INT_MAX
#define llinf LLONG_MAX
#define mt make_tuple
#define mp make_pair
#define parll pair<ll,ll>
#define parii pair<int,int>
#define mxn 2002
ll n,m,p,d,t;
vector < vector<parll> > G;
vector <ll> V(mxn,0),D(mxn,llinf);
priority_queue <parll> Q;
ll Dijkstra( ll root )
{
D[root] = 0;
Q.push({0,root});
ll i,novi,w,rez=llinf;
while ( Q.size() )
{
i = Q.top().second; Q.pop();
if ( V[i] )
{
continue;
}
V[i] = 1;
for ( ll j = 0; j < G[i].size(); j++ )
{
novi = G[i][j].first; w = G[i][j].second;
if ( novi == root )
{
rez = min( rez, D[i]+w );
continue;
}
if ( D[i]+w < D[novi] )
{
D[novi] = D[i]+w;
Q.push({-D[novi],novi});
}
}
}
return (rez==llinf)?-1:rez;
}
int main()
{
ios;
cin >> n >> m;
G.resize(n+1);
for ( int i = 1; i <= m; i++ )
{
cin >> p >> d >> t;
G[p].push_back({d,t});
}
for ( int i = 1; i <= n; i++ )
{
fill( V.begin(), V.end(), 0 ); fill( D.begin(), D.end(), llinf );
cout << Dijkstra(i) << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,Q;
cin >>N;
long long X[N+1],Y[N+1];
//input
for(int i=1;i<=N;i++){
cin >> X[i] >> Y[i];
}
cin >> M;
vector<pair<int,int>> op;
int a,b;
for(int i=1;i<=M;i++){
cin >> a;
if(a==3||a==4){
cin >>b;
op.push_back(make_pair(a,b));
}
else op.push_back(make_pair(a,0));
}
cin >> Q;
vector<tuple<int,int,int>> q;
for(int i=0;i<Q;i++){
cin >> a >> b;
q.push_back(make_tuple(a,b,i));
}
sort(q.begin(),q.end());
long long ans1[Q],ans2[Q];
int c;
int cnt = 0;
long long Xm[3],Ym[3];
Xm[0] = -1000; Ym[0] = 1000;
Xm[1] = 1000; Ym[1] = 1000;
Xm[2] = -1000; Ym[2] = -1000;
long long cX,cY;
for(int i=0;i<Q;i++){
tuple<int,int,int> qn = q.at(i);
a = get<0>(qn);
b = get<1>(qn);
c = get<2>(qn);
for(int j=cnt;j<a;j++){
auto p = op.at(j);
int n = p.first; long long m=p.second;
for(int k=0;k<3;k++){
if(n==1){
long long z = Ym[k];
Ym[k]=(-1)*Xm[k];
Xm[k]=z;
}
else if(n==2){
long long z = Ym[k];
Ym[k]=Xm[k];
Xm[k]=(-1)*z;
}
else if(n==3) Xm[k]=2*m-Xm[k];
else if(n==4) Ym[k]=2*m-Ym[k];
// cout << "change" << endl;
}
}
cnt = a;
if(Xm[0]==Xm[1]){
cX = Xm[0] + (1000-Y[b])*((abs(Xm[2]-Xm[0]))/(Xm[2]-Xm[0]));
cY = Ym[0] + (X[b]+1000)*((abs(Ym[1]-Ym[0]))/(Ym[1]-Ym[0]));
}
else{
cX = Xm[0] + (X[b]+1000)*((abs(Xm[1]-Xm[0]))/(Xm[1]-Xm[0]));
cY = Ym[0] + (1000-Y[b])*((abs(Ym[2]-Ym[0]))/(Ym[2]-Ym[0]));
// cout << 1000-Y[b] << (Ym[2]-Xm[0]) << endl;
}
ans1[c] = cX; ans2[c] = cY;
}
for(int i=0;i<Q;i++){
cout << ans1[i] << " " << ans2[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << (a) << endl
#define prld(a) cout << setprecision(15)<< (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<int,int>> &S,vector<pair<int,int>> &T){
int N = S.size();
int dx = S[0].first-T[0].first;
int dy = S[0].second-T[0].second;
bool flg = true;
reps(i,1,N){
if(!((S[i].first==T[i].first+dx) && (S[i].second==T[i].second+dy))){flg = false; break;}
}
return flg;
}
/*ピタゴラ三角形
5 12 13
8 15 17
3 4 5
*/
vector<pair<int,int>> Pitagora_rot(vector<pair<int,int>> &S,int a, int b , int c){
int N = S.size();
vector<pair<int,int>> PS(N);
auto pt0 = S[0];
PS[0] = pt0;
bool flg = true;
reps(i,1,N){
int dx = S[i].first - pt0.first;
int dy = S[i].second - pt0.second;
if(((dx*b+dy*a)%c)!=0 || ((dx*a-dy*b)%c)!=0) {flg = false; break;}
PS[i] = make_pair((dx*a-dy*b)/c+pt0.first, (dx*b+dy*a)/c+pt0.second);
}
if(flg) return PS;
else return vector<pair<int,int>>();
}
int main(){
std::cin.tie(0); // cinとcoutの同期を解除
std::ios::sync_with_stdio(false);
int N;cin >> N;
bool flg=true;
vector<pair<int,int>> S(N),T(N);
rep(i,N)
{
int x,y;
cin >> x >> y;
S[i].first = x;S[i].second = y;
}
rep(i,N)
{
int x,y;
cin >> x >> y;
T[i].first = x;
T[i].second = y;
}
sort(allrange(T));
/*ピタゴラ三角形
5 12 13
8 15 17
3 4 5
*/
vector<vector<int>> tri(0);
tri.push_back(vector<int>({5, 12, 13}));
tri.push_back(vector<int>({5, 12, 13}));
tri.push_back(vector<int>({12, 5, 13}));
tri.push_back(vector<int>({8,15,17}));
tri.push_back(vector<int>({15,8,17}));
tri.push_back(vector<int>({3,4,5}));
tri.push_back(vector<int>({4,3,5}));
tri.push_back(vector<int>({0,1,1}));
tri.push_back(vector<int>({-1,0,1}));
tri.push_back(vector<int>({0,-1,1}));
tri.push_back(vector<int>({1,0,1}));
//tri.push_back(vector<int>({-5, 12, 13}));
// tri.push_back(vector<int>({-12, 5, 13}));
// tri.push_back(vector<int>({-8,15,17}));
// tri.push_back(vector<int>({-15,8,17}));
tri.push_back(vector<int>({-3,4,5}));
tri.push_back(vector<int>({-4,3,5}));
tri.push_back(vector<int>({-5, -12, 13}));
tri.push_back(vector<int>({-12, -5, 13}));
// tri.push_back(vector<int>({-8,-15,17}));
// tri.push_back(vector<int>({-15,-8,17}));
tri.push_back(vector<int>({-3,-4,5}));
tri.push_back(vector<int>({-4,-3,5}));
// tri.push_back(vector<int>({5, -12, 13}));
// tri.push_back(vector<int>({12, -5, 13}));
// tri.push_back(vector<int>({8,-15,17}));
tri.push_back(vector<int>({15,-8,17}));
tri.push_back(vector<int>({3,-4,5}));
tri.push_back(vector<int>({4,-3,5}));
flg=false;
if(S.size()==2 && T.size()==2){
auto sx = S[0].first-S[1].first;
auto sy = S[0].second-S[1].second;
auto tx = T[0].first-T[1].first;
auto ty = T[0].second-T[1].second;
flg= (sx*sx+sy*sy==tx*tx+ty*ty);
} else {
rep(j,tri.size()){
auto S2 = Pitagora_rot(S,tri[j][0],tri[j][1],tri[j][2]);
if(S2.empty()) continue;
sort(allrange(S2));
flg = solve_translated(S2,T);
if(flg) break;
}
}
if(flg) prl("Yes"); else prl("No");
}
| #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, const T& b) {if (a > b) {a = b;return true;}return false;}
vector<long long> divisor(long long n){vector<long long> res;long long i = 1;while (i*i<=n){if(n%i==0){res.push_back(i);}i++;}if(res.size()==0)return res;for(long long i = res.size()-1-(res.back()*res.back()==n);i>=0;--i){res.push_back(n/res[i]);}return res;}
long long safe_mod(long long x,long long m){x%=m;if(x<0){x+=m;}return x;}
long long modpow(long long x,long long n,long long mod){long long ans=1;while(n>0){if(n&1){ans*=x;ans%=mod;}n>>=1;x*=x;x%=mod;}return ans;}
long long intpow(long long x,long long n){long long ans=1;while(n>0){if(n&1){ans*=x;}n>>=1;x*=x;}return ans;}
template<typename T>T intpow(T x,T n){T ans=1;while(n>0){if(n&1){ans*=x;}n>>=1;x*=x;}return ans;}
vector<pair<long long,long long>> factor_lst(long long n){vector<pair<long long,long long>> factor_lst;long long d=2;while(d*d<=n){if(n%d==0){long long num=0;while(n%d==0){num+=1;n/=d;}factor_lst.push_back({d,num});}d+=1;}if(n!=1){factor_lst.push_back({n,1});}return factor_lst;}
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
int msb(int x){return x==0 ? -1:32-__builtin_clz(x);}//1-indexed
int lsb(int x){return x==0 ? 32:__builtin_ctz(x)+1;}//1-indexed
int popcnt(int x){return __builtin_popcount(x);}
int popcnt(long long x){return __builtin_popcount(x);}
bool ingrid(int i,int j,int H,int W){
return 0<=i&&i<H&&0<=j&&j<W;
}
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
template<typename T> void print(vector<T> &v){for(int i=0;i<v.size();++i){if(i)cout<<" ";cout<<v[i];}cout<<endl;}
template<typename T> void print(T* v,int size){for(int i=0;i<size;++i){if(i)cout<<" ";cout<<v[i];}cout<<endl;}
template<typename T,typename S>void print(pair<T,S>&p){cout<<p.first<<" "<<p.second<<endl;}
const ll LINF=4*1e18;
const ll MINF=5*1e15;
const int INF=2*1e9;
const ld PI=acosl(-1);
void Main();
int main(){cout<<fixed<<setprecision(15);Main();}
void Main(){
int N,M;cin>>N>>M;
int X[M],maskY[M],Z[M];
rep(i,M){
int Y;
cin>>X[i]>>Y>>Z[i];
maskY[i]=(1<<Y)-1;
}
ll dp[1<<N];
rep(i,1<<N)dp[i]=0;
dp[0]=1;
rep(bit,1<<N){
bool judge=true;
rep(i,M){
if(popcnt(bit)==X[i]&&popcnt(maskY[i]&bit)>Z[i])judge&=false;
}
if(!judge)continue;
rep(i,N)if((bit>>i)&1){
int prebit=bit^(1<<i);
dp[bit]+=dp[prebit];
}
}
cout<<dp[(1<<N)-1]<<endl;
}
|
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef vector<vector<int>> graph;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define MOD 1000000007
#define MAXX 1.1529215e+18
#define _1 first
#define _2 second
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
template<class t> using vc=vector<t>;
template<class T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<class T>
T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b == 0) {
x = 1;
y = 0;
} else {
d = extgcd(b, a%b, y, x);
y -= (a/b)*x;
}
return d;
}
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p._1<<","<<p._2<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
template<class T>
vector<T> divisor(T n) {
vector<T> ret;
for (T i = 1; i*i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n/i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
rep(t, T) {
ll N;
cin >> N;
if (N % 2) {
cout << "Odd" << endl;
} else if (N%4) {
cout << "Same" << endl;
} else {
cout << "Even" << endl;
}
}
}
| #include<bits/stdc++.h>
typedef long long ll;
//#define ll long long
#define int long long
//#define ull unsigned long long
//#define PI pair<int,int>
//#define PII pair<int,PI>
//#define PI pair<ll,int>
//#define endl "\n"
using namespace std;
const int maxm=2e3+5;
const int p=1e4;
int read(){
string s;cin>>s;
int t=4;
int f=0;
int ans=0;
for(auto i:s){
if(i=='.'){
f=1;
continue;
}else{
ans=ans*10+(i-'0');
if(f)t--;
}
}
while(t){
ans=ans*10;
t--;
}
return ans;
}
signed main(){
// ios::sync_with_stdio(0);
//
int X=read();
int Y=read();
int R=read();
//定义横坐标左右边界
int lc=X-R;
int rc=X+R;
while(lc%p)lc++;
while(rc%p)rc--;
//定义上下界指针
int up=Y,down=Y;
while(up%p)up++;//取整
while(down%p)down--;
//
int ans=0;
for(int i=lc;i<=rc;i+=p){//枚举横坐标
int ix=abs(X-i);
//
while(ix*ix+(up-Y)*(up-Y)>R*R)up-=p;//up下移
while(up<=Y||ix*ix+(up-Y)*(up-Y)<=R*R)up+=p;//up上移
//
while(ix*ix+(Y-down)*(Y-down)>R*R)down+=p;//down上移
while(down>=Y||ix*ix+(Y-down)*(Y-down)<=R*R)down-=p;//down下移
//
int add=(up-down)/p-1;
if(add>0)ans+=add;
}
cout<<ans<<endl;
return 0;
}
/*
*/
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<climits>
#include<bitset>
#include<unordered_map>
#include<random>
#include<functional>
using namespace std;
#define max(A,B) ((A)>(B)?(A):(B))
#define min(A,B) ((A)<(B)?(A):(B))
int main(void) {
string x;
cin >> x;
long long int m, mx = 0, res = 0;
cin >> m;
if (x.size() == 1) {
if (x[0] - '0' <= m)cout << 1;
else cout << 0;
return 0;
}
for (int i = 0; i < x.size(); i++)mx = max(mx, x[i] - '0');
long long int l = mx, r = m, now;
res = l;
while (l <= r) {
int f = 0;
long long int note = 0;
now = (l + r) / 2;
for (int i = 0; i <x.size(); i++) {
if (note >= LLONG_MAX / now) {
f = 1;
break;
}
note *= now;
note += x[i] - '0';
if (note > m) {
f = 1;
break;
}
}
if (f) {
r = now - 1;
}
else {
res = max(res, now);
l = now + 1;
}
}
cout << res - mx;
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;
#define int long long
#define ll long long
#define pb push_back
#define vi vector<ll>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define sz(x) (ll)x.size()
#define endl '\n'
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b)) / gcd((a),(b))
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp make_pair
#define F first
#define S second
#define rep(i, begin, end) for (int i=begin;i<end;i++)
#define repd(i, begin, end) for (int i=end-1;i>=begin;i--)
#define M 998244353
#define hell 1000000007
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update >
const int INF=1e18;
const int N=2e5+5;
int powm(int a,int b,int mod)
{
int res=1;
while(b)
{
if(b&1)
res=(res*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return res;
}
int pow(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
res=(res*a);
a=(a*a);
b>>=1;
}
return res;
}
signed main(void)
{ios
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);freopen("answer.txt", "w", stdout);
#endif
int tests=1;
// cin>>tests;
while(tests--)
{
int n;
cin>>n;
int a[n][n];
rep(i,0,n) rep(j,0,n) cin>>a[i][j];
vi r(n),c(n);
rep(i,0,n)
{
r[i]=INF;
rep(j,0,n)
{
r[i]=min(r[i],a[i][j]);
}
}
rep(i,0,n)
{
c[i]=a[0][i]-r[0];
}
// rep(i,0,n) cout<<c[i]<<' ';
rep(i,0,n)
{
rep(j,0,n)
{
if(a[i][j]!=r[i]+c[j])
{
cout<<"No"<<endl;
return 0;
}
}
}
cout<<"Yes"<<endl;
rep(i,0,n)
{
cout<<r[i]<<' ';
}
cout<<endl;
rep(i,0,n) cout<<c[i]<<' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define IN(x,c) (find(c.begin(),c.end(),x) != (c).end())
#define REP(i,n) for (int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define INIT(a,v) memset(a,v,sizeof(a))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
template<class A, class B> A cvt(B x) { stringstream ss; ss<<x; A y; ss>>y; return y; }
#define SPC << " " <<
#define DEBUG(x) cerr << #x << " = "; cerr << x << endl;
#define DEBUG_ITER(x) cerr << #x << " = "; for (auto _ : x) cerr << _ << ' '; cerr << endl;
typedef pair<int,int> PII;
typedef long long int64;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<double> VD;
int n,m;
vector<PII> v[20];
int64 f[20][1<<20];
int64 solve(int i, int m) {
if (i==n) return 1;
if (f[i][m]!=-1) return f[i][m];
int64 r=0;
REP (j,n) if ((m&(1<<j))==0) {
int mm=m|(1<<j), ok=1;
for (auto [y,z] : v[i]) {
int k=__builtin_popcount(mm&((1<<y)-1));
if (k>z) ok=0;
}
if (ok) r+=solve(i+1, mm);
}
f[i][m]=r;
return r;
}
int main() {
//freopen("test.in","r",stdin);
cin >> n >> m;
REP (i,m) {
int x,y,z;
cin >> x >> y >> z;
x--;
v[x].PB({y,z});
}
INIT(f,-1);
cout << solve(0,0) << endl;
return 0;
}
| // Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
x = y;
return true;
}
return false;
}
signed main(){
int n, m;
cin >> n >> m;
vector<int> x(m), y(m), z(m);
vector<vector<pair<int,int>>> c(n);
for(int i = 0; i < m; ++i){
cin >> x[i] >> y[i] >> z[i];
c[x[i]].emplace_back(y[i] - 1, z[i]);
}
vector<vector<i64>> dp(n + 1, vector<i64>(1 << n, 0));
dp[0][0] = 1;
for(int i = 0; i < n; ++i){
for(int j = 0; j < (1 << n); ++j){
vector<int> r(n + 1, 0);
for(int k = 0; k < n; ++k){
if(j & (1 << k))
++r[k];
}
for(int k = 0; k < n; ++k){
r[k + 1] += r[k];
}
for(auto [pre, cnt] : c[i]){
if(r[pre] > cnt){
dp[i][j] = 0;
break;
}
}
if(dp[i][j] == 0)
continue;
for(int k = 0; k < n; ++k){
if(j & (1 << k))
continue;
dp[i + 1][j | (1 << k)] += dp[i][j];
}
}
}
cout << dp.back().back() << endl;
return 0;
}
|
Subsets and Splits