code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
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;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1<<30;
const ll inf_l = 1LL<<61;
const int MAX = 2 * 1e5 + 10;
const long double eps = 1e-10;
double a, b, r;
ll pow_l(ll x) {return x * x;};
bool in_circle(int x, int y) {
ll la = round(a * 10000);
ll lb = round(b * 10000);
ll lr = round(r * 10000);
ll lx = (ll)x * 10000;
ll ly = (ll)y * 10000;
return pow_l(ly - lb) <= pow_l(lr) - pow_l(lx - la);
}
int left_cnt(int x) {
int ng = -MAX, ok = b;
if (!in_circle(x, ok)) return 0;
while (ng + 1 < ok) {
int mid = (ok + ng) / 2;
if (in_circle(x, mid)) ok = mid;
else ng = mid;
}
return (int)b - ok + 1;
}
int right_cnt(int x) {
int ng = MAX, ok = b + 1;
if (!in_circle(x, ok)) return 0;
while (ok + 1 < ng) {
int mid = (ok + ng) / 2;
if (in_circle(x, mid)) ok = mid;
else ng = mid;
}
return ok - (int)(b + 1) + 1;
}
int main() {
cin >> a >> b >> r;
ll ans = 0;
for (int x = -MAX; x <= MAX; x++) {
ans += left_cnt(x) + right_cnt(x);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
using ll = long long;
using db = double;
using pii = pair<int, int>;
using vi = vector<int>;
mt19937 mrand(time(0));
ll get(ll r) { return ((ll)mrand() * mrand() % r + r) % r; }
ll get(ll l, ll r) { return get(r - l + 1) + l; }
ll n, K, P, f[110][110*110*110], up;
signed main() {
scanf("%lld %lld %lld", &n, &K, &P), up = K * n * (n - 1) / 2, f[0][0] = 1;
for(int i = 1; i < n; i++) {
for(int j = 0; j <= up; j++) {
f[i][j] = f[i - 1][j];
if(j >= i) (f[i][j] += f[i][j - i]) %= P;
}
for(int j = up; j >= (K + 1) * i; j--)
(f[i][j] += P - f[i][j - (K + 1) * i]) %= P;
}
for(int i = 1; i <= n; i++) {
ll nw = 0;
for(int j = 0; j <= up; j++)
(nw += f[i - 1][j] * f[n - i][j]) %= P;
printf("%lld\n", (nw * (K + 1) % P - 1 + P) % P);
}
fprintf(stderr, "time=%.4f\n", (db)clock()/CLOCKS_PER_SEC);
return 0;
} |
#include <bits/stdc++.h>
#define int long long int
#define all(x) x.begin(), x.end()
#define send ios_base::sync_with_stdio(false);
#define help cin.tie(NULL)
#define inf (int)(1e17+1)
#define mod (int)(1e9+7)
#define N (int)(2e5+5)
#define fi first
#define se second
#define endl "\n"
#define double long double
#define eps (double)(1e-9)
#define sa cout<<"sa"<<endl
using namespace std;
void solve(){
int n;
cin>>n;
int mx=0,sum=0,ans=0;
for(int i=1;i<=n;i++){
int x;cin>>x;
mx=max(mx,x);
sum+=x;
ans+=sum;
cout<<ans+i*mx<<endl;
}
}
int32_t main(){
send help;
#ifdef LOCAL
freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);
#endif
int t=1;
//cin>>t;
while(t--) solve();
return 0;
} | #include <bits/stdc++.h>
#pragma region my_template
struct Rep {
struct I {
int i;
void operator++() { ++i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i < *o; }
};
const int l_, r_;
Rep(int l, int r) : l_(l), r_(r) {}
Rep(int n) : Rep(0, n) {}
I begin() const { return {l_}; }
I end() const { return {r_}; }
};
struct Per {
struct I {
int i;
void operator++() { --i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i > *o; }
};
const int l_, r_;
Per(int l, int r) : l_(l), r_(r) {}
Per(int n) : Per(0, n) {}
I begin() const { return {r_ - 1}; }
I end() const { return {l_ - 1}; }
};
template <class F>
struct Fix : private F {
Fix(F f) : F(f) {}
template <class... Args>
decltype(auto) operator()(Args&&... args) const {
return F::operator()(*this, std::forward<Args>(args)...);
}
};
template <class T = int>
T scan() {
T res;
std::cin >> res;
return res;
}
template <class T, class U = T>
bool chmin(T& a, U&& b) {
return b < a ? a = std::forward<U>(b), true : false;
}
template <class T, class U = T>
bool chmax(T& a, U&& b) {
return a < b ? a = std::forward<U>(b), true : false;
}
#ifndef LOCAL
#define DUMP(...) void(0)
template <int OnlineJudge, int Local>
constexpr int OjLocal = OnlineJudge;
#endif
using namespace std;
#define ALL(c) begin(c), end(c)
#pragma endregion
constexpr int L = 1e6;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
cout << fixed << setprecision(20);
int n = scan();
int m = scan();
int q = scan();
vector<int> w(n), v(n);
for (int i : Rep(n)) {
w[i] = scan();
v[i] = scan();
}
vector<int> order(n);
iota(ALL(order), 0);
sort(ALL(order), [&](int i, int j) { return v[i] > v[j]; });
vector<int> x(m);
generate(ALL(x), scan<>);
while (q--) {
int l = scan() - 1;
int r = scan();
multiset<int> ms;
for (int j : Rep(m)) {
if (l <= j and j < r) continue;
ms.insert(x[j]);
}
int ans = 0;
for (int i : order) {
auto it = ms.lower_bound(w[i]);
if (it == end(ms)) continue;
ms.erase(it);
ans += v[i];
}
cout << ans << '\n';
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int a[200010];
int t[200010];
int q;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> t[i];
}
cin >> q;
long ub = 1000000000;
long lb = -ub;
long offset = 0;
for (int i = 0; i < n; ++i) {
if (t[i] == 1) {
offset += a[i];
ub += a[i];
lb += a[i];
} else if(t[i] == 2) {
if (lb < a[i]) {
lb = a[i];
}
if (ub < lb) {
ub = lb;
}
} else {
if (ub > a[i]) {
ub = a[i];
}
if (lb > ub) {
lb = ub;
}
}
}
for (int i = 0; i < q; ++i) {
long x;
cin >> x;
x += offset;
if (x < lb) {
x = lb;
}
if (x > ub) {
x = ub;
}
cout << x << endl;
}
}
| /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void solve(){
ll N;
cin >> N;
vll a(N), t(N);
rep(i,0,N) cin >> a[i] >> t[i];
ll Q;
cin >> Q;
vll x(Q);
rep(i,0,Q) cin >> x[i];
vector<lpair> lp;
rep(i,0,Q) lp.push_back({x[i], i});
sort(lp.begin(), lp.end());
vll ans(Q+1, 0);
ll min_val = -INF, max_val = INF;
ll cur = 0;
rep(i,0,N){
if(t[i] == 1){
cur += a[i];
}else if(t[i] == 2){
ll val = a[i] - cur;
min_val = max(min_val, val);
}else{
ll val = a[i] - cur;
max_val = min(max_val, val);
}
}
ll m1 = min_val, m2 = max_val;
rep(i,0,N){
if(t[i] == 1){
m1 += a[i];
m2 += a[i];
}else if(t[i] == 2){
chmax(m1, a[i]);
chmax(m2, a[i]);
}else{
chmin(m1, a[i]);
chmin(m2, a[i]);
}
}
rep(q,0,Q){
ll X = lp[q].first;
ll idx = lp[q].second;
ll res = 0;
if(X >= min_val && X <= max_val){
res = m1 + (X - min_val);
}else if(X < min_val){
res = m1;
}else{
res = m2;
}
ans[idx] = res;
}
rep(i,0,Q) print(ans[i]);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define endl '\n'
#define pb push_back
#define sz(c) (ll)c.size()
#define mp make_pair
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define F first
#define S second
#define M 1000000007
#define PI 3.1415926535897932384
#define pii pair<ll,ll>
const ll INF=1e18;
const ll N=1e5+5;
ll mod=998244353;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<pair<ll,ll>> vp;
typedef vector<vector<ll>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<char>> vvc;
//bool isPrime(ll n){
// if(n<=1)
// return false;
// if(n<=3)
// return true;
// if(n%2==0 || n%3==0)
// return false;
// for(ll i=5;i*i<=n;i=i+6)
// {
// if(n%i==0 || n%(i+2)==0)
// return false;
// }
// return true;
//}
//ll fact(ll n)
//{
// ll ans=1;
// for(ll i=1;i<=n;i++)
// ans=(ans*i)%M ;
// return ans;
//}
//
//
//
//
//ll exp(ll x,ll n){
//
// ll res=1;
// while(n>0){
// if(n%2==1)
// res=(res*x)%M;
// x=(x*x)%M;
// n=n/2;
// }
// return res;
//}
//
//
//ll nCr(ll n, ll k)
//{
// ll res = 1;
//
// // Since C(n, k) = C(n, n-k)
// if(k>n-k){
// k=n-k;
// }
//
// // Calculate value of
// // [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
// for (ll i=0;i<k;i++) {
// res *= (n - i);
// res /= (i + 1);
// }
//
// return res;
//}
// nCr
//vector<ll> fact(1e6+5,0);
//void fac(){
// fact[0]=1;
// fact[1]=1;
// for(ll i=2;i<1e6+5;i++){
// fact[i] = (fact[i-1]*i)%M;
// }
//}
//ll ncr(ll n,ll r){
// ll num= fact[n];
// ll den= (fact[n-r]*fact[r])%M;
// den = exp(den,M-2);
// return (num*den)%M;
//
//}
void null(){
ll n;
cin>>n;
map<ll,ll> mx,my;
vi x(n),y(n);
vp a,b;
rep(i,0,n){
cin>>x[i]>>y[i];
a.pb({x[i],i});
b.pb({y[i],i});
mx[x[i]]++;
my[y[i]]++;
}
sort(all(a),[&](auto &p,auto &q){
if(p.F==q.F)
return y[p.S]<y[q.S];
return p.F<q.F;
});
sort(all(b),[&](auto &p,auto &q){
if(p.F==q.F)
return x[p.S]<x[q.S];
return p.F<q.F;
});
vi ans;
ll op1= a[n-1].F-a[0].F;
ll op2= b[n-1].F-b[0].F;
if(a[n-1].S ==b[n-1].S and a[0].S==b[0].S){
ans.pb(max(op1,op2));
}
else{
ans.pb(op1);
ans.pb(op2);
}
ll op3= a[n-1].F-a[1].F;
ll op4= b[n-1].F-b[1].F;
if(a[n-1].S ==b[n-1].S and a[1].S==b[1].S){
ans.pb(max(op3,op4));
}
else{
ans.pb(op3);
ans.pb(op4);
}
ll op5= a[n-2].F-a[0].F;
ll op6= b[n-2].F-b[0].F;
if(a[n-2].S ==b[n-2].S and a[0].S==b[0].S){
ans.pb(max(op5,op6));
}
else{
ans.pb(op5);
ans.pb(op6);
}
// vi a={op1,op2,op3,op4,op5,op6};
sort(all(ans));
reverse(all(ans));
cout<<ans[1]<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
cout<<setprecision(4);
cout<<fixed;
ll t = 1;
clock_t start, end;
start = clock();
// fac();
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// freopen("error.txt", "w", stderr);
// #endif
// cin>>t;
// compute();
while(t--){
null();
}
end = clock();
double time_taken = double(end - start) / double(CLOCKS_PER_SEC);
//cerr<<time_taken;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#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 ins insert
#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}
using namespace std;
template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}
//-------------------------------------------------
//--Extended GCD
//-------------------------------------------------
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;
}
//-------------------------------------------------
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int t; cin>>t;
while(t--){
ll N,S,K; cin>>N>>S>>K;
ll g = __gcd(K,N);
if (S%g!=0){
cout<<"-1\n";
continue;
}
N/=g; S/=g; K/=g;
ll inv,_;
extgcd(K,N,inv,_);
inv=(inv+N)%N;
cout<<inv*(N-S)%N<<"\n";
}
return 0;
}
|
#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;
template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define N 100012
#define ll long long
#define int ll
#define pi pair<int , int>
#define pip pair<pair ,int>
#define mp make_pair
#define f first
#define s second
#define mod 1000000007
ll Mod(ll x, ll y, int p)
{ ll res = 1; x = x % p;
while (y > 0)
{ if (y & 1) res = (res * x) % p;
y = y >> 1; x = (x * x) % p;
} return res;
}
int* getlps(string pattern) {
int len = pattern.length();
int * lps = new int[len];
lps[0] = 0;
int i = 1 , j = 0;
while (i < len) {
if (pattern[i] == pattern[j]) {
lps[i] = j + 1;
i++;
j++;
}
else {
if (j != 0) {
j = lps[j - 1];
}
else {
lps[i] = 0;
i++;
}
}
}
return lps;
}
class Triplet {
public:
int x ;
int y ;
int gcd;
};
Triplet extendedEuclid(int a , int b) {
if (b == 0) {Triplet ans; ans.gcd = a; ans.x = 1; ans.y = 0; return ans;}
Triplet smallAns = extendedEuclid(b , a % b);
Triplet ans;
ans.gcd = smallAns.gcd;
ans.x = smallAns.y;
ans.y = smallAns.x - (a / b) * smallAns.y;
return ans;
}
int mmInverse(int a , int m) {
Triplet ans = extendedEuclid(a , m);
return (ans.x + m) % m;
}
int fact[N];
void calfac(int n ) {
fact[0] = 1;
for (int i = 1 ; i <= n + 2; i++) {
fact[i] = (((fact[i - 1] % mod) * (i % mod)) % mod + mod) % mod;
}
}
int calc(int n , int r) {
if (r > n)return 0;
if (r == n)return 1;
int ans = 1;
ans = ((ans % mod) * (fact[n]) % mod + mod) % mod;
ans = ((ans % mod) * (mmInverse(fact[n - r] , mod) % mod) + mod) % mod;
ans = ((ans % mod) * (mmInverse(fact[r] , mod) % mod) + mod) % mod;
return (ans + mod) % mod;
}
void solve(int cntt) {
int n;
int k;
cin >> n;
cin >> k;
int arr[n];
int dp[n + 1] = {0};
for (int i = 0 ; i < n ; i++) {
cin >> arr[i];
dp[arr[i]]++;
}
dp[0] = min(dp[0] , k);
for (int i = 1 ; i < n ; i++) {
dp[i] = min(dp[i] , dp[i - 1]);
}
int st = dp[0];
int ans = 0;
for (int i = 1 ; i < n ; i++) {
ans += i * (st - dp[i]);
st = min(st , dp[i]);
}
ans += st * (n);
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// preprocess();
int t;
t = 1;
int l = 0;
while (t--) {
l++;
solve(l);
}
return 0;
} | /* Clearink */
#include <cstdio>
inline void wint ( int x ) {
if ( 9 < x ) wint ( x / 10 );
putchar ( x % 10 ^ '0' );
}
const int MAXN = 100;
int N, K, M, f[MAXN + 1][MAXN * ( MAXN / 2 + 1 ) * ( MAXN >> 1 ) / 2 + 5];
inline void addeq ( int& a, const int b ) { ( a += b ) < M ? 0 : a -= M; }
inline void initDP () {
f[0][0] = 1;
int sbound = K * ( N / 2 + 1 ) * ( N >> 1 ) >> 1;
for ( int i = 0; i < N; ++ i ) {
for ( int j = 0, cur; j <= sbound; ++ j ) {
if ( !( cur = f[i][j] ) ) continue;
for ( int k = 0, s = j; k <= K && s <= sbound; ++ k, s += i + 1 ) {
addeq ( f[i + 1][s], cur );
}
}
}
}
inline int solve ( const int x ) {
// k[x-1]+2k[x-2]+...+(x-1)k[1] = k[x+1]+2k[x+2]+...+(n-x)k[n].
int sbound = x - 1 < N - x ? x - 1 : N - x, ret = 0;
sbound = K * sbound * ( sbound + 1 ) >> 1;
for ( int s = 0; s <= sbound; ++ s ) {
addeq ( ret, 1ll * f[x - 1][s] * f[N - x][s] % M );
}
return ( ret * ( K + 1ll ) % M + M - 1 ) % M;
}
int main () {
scanf ( "%d %d %d", &N, &K, &M );
initDP ();
for ( int i = 1; i <= N; ++ i ) {
wint ( solve ( i ) );
putchar ( '\n' );
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<ll,int>Pli;
typedef pair<int,int> Pi;
const ll INF=1000000000000000001;
struct edge{int to,cost;};
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
struct Road{double cost;int a,b;};
struct pos{
// 1 変数を入れる;
int x,y;
ll cost;
};
int main(){
string s;
cin>>s;
char c='A';
int si=s.size()-1;
ll ans=0;
for(int i=s.size()-1; i>0; i--){
if(s[i]==s[i-1]){
if(s[i]==c)ans+=si-i-1;
else ans+=s.size()-i-1;
c=s[i];
while(s[i]==c)i--;
i++;
si=i;
}
}
c='A';
for(int i=0; i<s.size(); i++){
if(s[i]!=s[i+1]&&c==s[i])ans--;
if(s[i]==s[i+1]){
c=s[i];
while(s[i]==c)i++;
i--;
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string,int> mp;
rep(i,n) {
cin >> s[i];
mp[s[i]] = 1;
}
for(auto iter = mp.begin(); iter != mp.end(); iter++){
if(iter->first[0] == '!') continue;
else {
string temp = "!" + iter->first;
if(mp[temp] == 1){
cout<<iter->first<<endl;
return 0;
}
}
}
cout<<"satisfiable"<<endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
//#include <random>
#include <map>
//#include <unordered_map>
#include <cstdlib>
#include <functional>
#include <time.h>
//#include <chrono>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream> // std::stringstream
#include <bitset> // std::bitset<N>
//#include <type_traits>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define RFOR(i,a,b) for(int i=b-1;i>=a;i--)
#define ll long long
#define INF 1000000001
#define MOD 1000000007
#define SORT(s) sort(s.begin(), s.end());
#define REVERSE(s) reverse(s.begin(), s.end());
#define SUM(s) accumulate(s.begin(), s.end(), 0LL);
#define P pair<int,int>
#define mp make_pair
#define valid(x,y,h,w) (0<=x&&x<h&&0<=y&&y<w)
//#define int ll
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
int ndx[8] = { 0,1,0,-1, 1,1,-1,-1 };
int ndy[8] = { 1,0,-1,0, 1,-1,-1,1 };
double pi = 3.141592653589793;
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }
ll m;
string x;
int s;
ll binary_search_f(ll n) {
ll res = 0;
ll a = 1;;
rrep(i, s) {
if (i != s - 1) a *= n;
if (a > 1000000000000000001 || res > 1000000000000000001) {
return 1000000000000000001;
}
if (x[i] - '0' == 0) {
continue;
}
if (a > 1000000000000000001 / (x[i] - '0')) {
return 1000000000000000001;
}
ll res0 = res;
res += (x[i] - '0') * a;
if (res < 0 || res - (x[i] - '0') * a != res0) {
return 1000000000000000001;
}
}
return res;
}
ll f(ll a) {
//ll cnt = 0;
if (a <= 1)return a;
ll x = 1;
while (binary_search_f(x) < a) {
x *= 2;
//cnt++;
}
ll top = x + 1;
ll bot = x / 2;
ll c = (top + bot) / 2;
while (1) {
//cnt++;
if (c == 0 && binary_search_f(c) > a) {
return -1;
}
if (binary_search_f(c) <= a && binary_search_f(c + 1) > a) {
//cout << cnt << endl;
return c;
}
else if (binary_search_f(c) > a) {
top = c;
c = (c + bot) / 2;
}
else {
bot = c;
c = (c + top) / 2;
}
}
}
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<int> w(n), v(n), x(m), l(q), r(q);
vector<P> vw(n);
rep(i, n) {
cin >> w[i] >> v[i];
vw[i] = mp(v[i], w[i]);
}
rep(i, m) {
cin >> x[i];
}
rep(i, q) {
cin >> l[i] >> r[i];
l[i]--; r[i]--;
}
SORT(vw);
REVERSE(vw);
rep(i, q) {
vector<int> y, use;
rep(j, m) {
if (j < l[i] || r[i] < j) {
y.push_back(x[j]);
use.push_back(0);
}
}
SORT(y);
ll ans = 0;
rep(j, n) {
int W = vw[j].second;
int V = vw[j].first;
rep(k, y.size()) {
if (use[k] == 0 && y[k] >= W) {
use[k] = 1;
ans += V;
break;
}
}
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll MOD = 1e9+7;
int main(){
ll N, M, Q;
cin >> N >> M >> Q;
vector<ll> X(M);
using P = pair<ll, ll>;
vector<P> WV(N);
REP(i,N){
ll w, v;
cin >> w >> v;
WV[i] = P(w, v);
}
sort(WV.begin(), WV.end());
REP(i,M){
ll x;
cin >> x;
X[i] = x;
}
while(Q--){
ll L, R;
cin >> L >> R;
L--, R--;
priority_queue<ll, vector<ll>, greater<ll>> Y;
REP(i,L)
Y.push(X[i]);
REPi(i,R+1,M)
Y.push(X[i]);
priority_queue<ll> V;
ll idx = 0;
ll ans = 0;
while(!Y.empty()){
auto y = Y.top(); Y.pop();
while(idx < N){
auto [w, v] = WV[idx];
if(w > y) break;
V.push(v);
idx++;
}
if(V.empty()) continue;
auto v = V.top();
V.pop();
ans += v;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<unordered_map>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 100000000001
#define LLINF 9223372036854780LL
#define mod 998244353
//#define mod 1000000007
//priority_queue<int,vector<int>, greater<int> > q2;
ll modpow(ll a, ll n = mod - 2) {
ll r = 1;
while (n) r = r * ((n % 2) ? a : 1) % mod, a = a * a%mod, n >>= 1;
return r;
}
long long modinv(long long a) {
return modpow(a, mod - 2);
}
struct LazySegmentTree {
private:
int n;
vector<ll> node, lazy;
public:
LazySegmentTree(vector<ll> v) {
int sz = (int)v.size();
n = 1; while (n < sz) n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, 0);
for (int i = 0; i < sz; i++) node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--) node[i] = (node[i * 2 + 1] + node[i * 2 + 2]) % mod;
}
void eval(int k, int l, int r) {
if (lazy[k] != 0) {
node[k] += lazy[k];
node[k] %= mod;
if (r - l > 1) {
lazy[2 * k + 1] += lazy[k] * modinv(2);
lazy[2 * k + 2] += lazy[k] * modinv(2);
lazy[2 * k + 1] %= mod;
lazy[2 * k + 2] %= mod;
}
lazy[k] = 0;
}
}
void add(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
if (r < 0) r = n;
eval(k, l, r);
if (b <= l || r <= a) return;
if (a <= l && r <= b) {
lazy[k] += (r - l) * x;
lazy[k] %= mod;
eval(k, l, r);
}
else {
add(a, b, x, 2 * k + 1, l, (l + r) / 2);
add(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = (node[2 * k + 1] + node[2 * k + 2]) % mod;
}
}
ll getsum(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0) r = n;
eval(k, l, r);
if (b <= l || r <= a) return 0;
if (a <= l && r <= b) return node[k];
ll vl = getsum(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = getsum(a, b, 2 * k + 2, (l + r) / 2, r);
return (vl + vr) % mod;
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int M; cin >> M;
VI H(N), W(M);
REP(i, N)cin >> H[i];
REP(i, M)cin >> W[i];
SORT(H);
int ans = LLINF;
VI sum(N + 2, 0), sum1(N + 2, 0);
for (int i = 0; i < N; i += 2) {
if (i + 1 >= N)break;
sum[i / 2 + 1] += abs(H[i] - H[i + 1]) + sum[i / 2];
}
int j = 1;
for (int i = N - 1; i >= 0; i -= 2) {
if (i - 1 < 0)break;
sum1[j] += abs(H[i] - H[i - 1]) + sum1[j - 1];
j++;
}
REP(i, M) {
int it = LB(H, W[i]) - H.begin();
int itt = N - it;
int cnt = sum[it / 2] + sum1[itt / 2];
//cout << it << " " << sum[it / 2] << " " << sum1[itt / 2] << endl;
if (it % 2) {
cnt += abs(W[i] - H[it - 1]);
}
else {
cnt += abs(W[i] - H[it]);
}
chmin(ans, cnt);
}
cout << ans << endl;
/*
int N, Q; cin >> N >> Q;
while (Q--) {
int t, x; cin >> t >> x;
}
*/
return 0;
}
| #include<iostream>
using namespace std;
typedef long long ll;
int MOD = 998244353;
ll ksm(ll a,ll b,ll mod){
ll ans = 1;
while(b>0){
if(b&1) ans = ans * a % mod;
a = a * a % mod;
b >>=1;
}
return ans;
}
int main(){
ll N,M,K;
cin >> N >> M >> K;
ll ans = 0;
for(int i = 1; i <= K; ++i){
if(M == 1)
ans+=((ksm(i,N,MOD) - ksm(i-1,N,MOD) + MOD)%MOD);
else if(N==1){
ans+=((ksm(i,N,MOD) - ksm(i-1,N,MOD) + MOD)%MOD)*((ksm(K-i+1,M,MOD) - ksm(K-i,M,MOD)+MOD)%MOD);
}
else
ans+=((ksm(i,N,MOD) - ksm(i-1,N,MOD) + MOD)%MOD)*(ksm(K-i+1,M,MOD)%MOD);
ans%=MOD;
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pt;
typedef pair<ll,ll> pll;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//#define ordered_set tree<pair<int, int>,null_type,less<pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update>
#define vint vector<int>
#define vll vector<long long>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define F(i,n) for(int i = 0;i<n;i++)
#define Fr(i,l,r) for(int i = l;i <= r;i++)
#define rF(i,n) for(int i = n-1;i>=0;i--)
#define Max 1000001
#define intinf 2147483647
#define longlonginf 9223372036854775807
#define MOD 998244353
#define MOD2 1000000007
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define all(arr) arr.begin(),arr.end()
//#define sort(vec) sort(vec.begin(),vec.end())
//#define reverse(vec) reverse(vec.begin(),vec.end())
ll Lpow(ll a,ll b)
{
ll ans = 1;
while(b > 0)
{
if(b%2)
ans = (ans*a);
a = (a*a);
b = b/2;
}
return ans;
}
ll Lpow(ll a,ll b,ll M)
{
ll ans = 1;
while(b > 0)
{
if(b%2)
ans = (ans*a)%M;
a = (a*a)%M;
b = b/2;
}
return ans;
}
int main()
{
fastio;
ll n,C;
cin >> n >> C;
vector<pair<ll,ll>> arr(2*n);
ll a,b,c;
for(int i = 0;i<n;i++)
{
cin >> a >> b >> c;
arr[2*i].first = a;
arr[2*i].second = c;
arr[2*i + 1].first = b + 1;
arr[2*i + 1].second = -c;
}
sort(all(arr));
ll curr = 0;
ll ans = 0;
for(int i = 0;i<2*n;i++)
{
curr = curr + arr[i].second;
while(i + 1 < 2*n && arr[i].first == arr[i + 1].first)
{
curr = curr + arr[i+1].second;
i++;
}
ll days = 0;
if(i + 1 < 2*n)
days = arr[i + 1].first - arr[i].first;
ans += days*min(C,curr);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
enum Which{
COUNT,
VAL,
};
enum Type{
A,
B,
};
struct Query{
ll t,x,y;
};
ll num_A,num_B;
ll N,a[SIZE],b[SIZE];
ll BIT[SIZE][2][2];
map<ll,ll> MAP,REV;
Query query[SIZE];
void add(ll loc,ll value,Which which,Type type){
BIT[loc][which][type] += value;
loc += loc & -loc;
while(loc <= N){
BIT[loc][which][type] += value;
loc += loc & -loc;
}
}
ll getSum(ll loc,Which which,Type type){
if(loc == 0)return 0;
ll sum = BIT[loc][which][type];
loc -= loc & -loc;
while(loc > 0){
sum += BIT[loc][which][type];
loc -= loc & -loc;
}
return sum;
}
int main(){
int num_Q;
scanf("%lld %lld %d",&num_A,&num_B,&num_Q);
for(ll i = 1; i <= num_A; i++){
a[i] = 0;
}
for(ll i = 1; i <= num_B; i++){
b[i] = 0;
}
vector<ll> vec;
vec.push_back(0);
for(int i = 0; i < num_Q; i++){
scanf("%lld %lld %lld",&query[i].t,&query[i].x,&query[i].y);
vec.push_back(query[i].y);
}
sort(vec.begin(),vec.end());
vec.erase(unique(vec.begin(),vec.end()),vec.end());
for(int i = 0; i < vec.size(); i++){
MAP[vec[i]] = i+1;
REV[(i+1)] = vec[i];
}
ll ans = 0;
N = vec.size();
for(ll i = 0; i <= N; i++){
for(int k = 0; k < 2; k++){
for(int p = 0; p < 2; p++){
BIT[i][k][p] = 0;
}
}
}
add(MAP[0],num_A,COUNT,A);
add(MAP[0],num_B,COUNT,B);
for(int i = 0; i < num_Q; i++){
ll loc = query[i].x;
if(query[i].t == 1){ //Aを操作
if(a[loc] == query[i].y){
printf("%lld\n",ans);
continue;
}
ll pre = a[loc];
ans -= pre*getSum(MAP[pre],COUNT,B); //前の値の加算値
if(pre < query[i].y){ //大きくなった
ans -= getSum(MAP[query[i].y],VAL,B)-getSum(MAP[pre],VAL,B); //
}else{ //小さくなった
ans += getSum(MAP[pre],VAL,B)-getSum(MAP[query[i].y],VAL,B);
}
ans += query[i].y*getSum(MAP[query[i].y],COUNT,B);
a[loc] = query[i].y;
add(MAP[pre],-1,COUNT,A);
add(MAP[pre],-pre,VAL,A);
add(MAP[query[i].y],1,COUNT,A);
add(MAP[query[i].y],query[i].y,VAL,A);
}else{
if(b[loc] == query[i].y){
printf("%lld\n",ans);
continue;
}
ll pre = b[loc];
//printf("B: pre:%lld\n",pre);
ll tmp = pre*getSum(MAP[pre]-1,COUNT,A); //前の値の加算値
//printf("前の加算地:%lldをマイナス\n",tmp);
ans -= tmp;
if(pre < query[i].y){ //大きくなった
tmp = getSum(MAP[query[i].y]-1,VAL,A)-getSum(MAP[pre]-1,VAL,A);
//printf("大きくなったので%lldをマイナス\n",tmp);
ans -= tmp;
}else{ //小さくなった
tmp = getSum(MAP[pre]-1,VAL,A)-getSum(MAP[query[i].y]-1,VAL,A);
//printf("小さくなったので%lldをプラス\n",tmp);
ans += tmp;
}
//printf("ここまでのans:%lld\n",ans);
tmp = query[i].y*getSum(MAP[query[i].y]-1,COUNT,A);
//printf("今回は%lldを加算\n",tmp);
ans += tmp;
b[loc] = query[i].y;
add(MAP[pre],-1,COUNT,B);
add(MAP[pre],-pre,VAL,B);
add(MAP[query[i].y],1,COUNT,B);
add(MAP[query[i].y],query[i].y,VAL,B);
}
printf("%lld\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
ll pw(ll x, ll y, ll mod) {
ll res=1;
while (y) {
if (y%2) res=res*x%mod;
x=x*x%mod;y=y/2;
}
return ((res%mod)+mod)%mod;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll A,B,C;
cin>>A>>B>>C;
ll p = pw(B, C, 4)+4;
ll ans = pw(A, p, 10);
// ans %= 10;
// ans += 10;
// ans %= 10;
out(ans);
return 0;
}
| #include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#define ri register int
const int N = 1e6 + 618;
using namespace std;
int v,t,s,d;
int main(){
scanf("%d%d%d%d",&v,&t,&s,&d);
if(d < v * t||d > v * s) printf("Yes");
else
printf("No");
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()
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll b,c;
cin>>b>>c;
if(b<0){
ll nl=b,nh=b;
nl=b-c/2;
if(c>=2){
nh=-max(-b-(c-2)/2,1ll);
}
ll ans=nh-nl+1;
if(c>0){
ll pl=max(-b-(c-1)/2,0ll);
ll ph=-b+(c-1)/2;
ans+=ph-pl+1;
}
cout<<ans<<endl;
}
else{
ll pl=b,ph=b;
pl=max(b-c/2,0ll);
if(c>=2){
ph=-(-b-(c-2)/2);
}
ll ans=ph-pl+1;
if(c>0){
if(b){
c--;
}
ll nl=-b-(c)/2;
ll nh=-max(1ll,b-(c)/2);
ans+=nh-nl+1;
}
cout<<ans<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll B, C;
cin >> B >> C;
ll ans;
ll k = C / 2;
int r = C % 2;
if (C == 0) {
ans = 1;
} else if (B == 0) {
ans = C;
} else if (C == 1) {
ans = 2;
} else if (B > 0) {
if (C <= 2 * B) {
ans = 2 * C - 1;
} else {
ans = 2 * B + C - 1;
}
} else {
if (C <= -2 * B - 2) {
ans = 2 * C - 1;
} else {
ans = -2 * B + C;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 50;
int mod = 998244353;
vector<int> g[N];
int ans;
int vis[N];
void dfs(int node) {
vis[node] = 1;
for (auto to: g[node]) {
if (vis[to] == 1)
ans++;
else if (vis[to] == 0) {
dfs(to);
}
}
vis[node]++;
}
int binpow(int a, int b) {
int ret = 1;
while (b) {
if (b & 1) {
ret *= a;
ret %= mod;
}
a = (a * a) % mod;
b >>= 1;
}
return ret;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int fi;
cin >> fi;
g[i].push_back(fi);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(i);
}
cout << (binpow(2, ans) - 1 + mod) % mod << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
template<typename T> using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr int MOD = 1e9+7;
constexpr int MOD2 = 998244353;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
char interval[2] = {' ', '\n'};
template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
template<> struct is_plural<string> : true_type{};
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for(auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if(vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for(auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
template<typename T> istream &operator>>(istream &is, complex<T> &x) { T a, b; is >> a >> b; x = complex<T>(a, b); return is; }
template<typename T> ostream &operator<<(ostream &os, complex<T> &x) { return os << x.real() << ' ' << x.imag(); }
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << '\n'; return a; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
/* -------- <templates end> -------- */
int64_t modpow(int a, int64_t n, int mod = MOD) { int64_t ret = 1; do { if(n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while(n >>= 1); return ret; }
void solve() {
int n; cin >> n;
vector<int> a(n); cin >> a;
for(auto &x : a) --x;
vector<int> timestamp(n, -1);
int pw = 0;
auto dfs = [&](auto dfs, int v, int t) -> void {
if(timestamp[v] != -1) {
if(timestamp[v] == t) ++pw;
return;
}
timestamp[v] = t;
dfs(dfs, a[v], t);
};
for(int i=0; i<n; ++i) {
dfs(dfs, i, i);
}
cout << modpow(2, pw, MOD2) - 1 << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
void Main() {
ll n;
R n;
P a[n];
rep(i,n) cin >> a[i].F >> a[i].S;
map<ll,P> m;
rep(i,n) {
if(!m.count(a[i].S)) m[a[i].S]=P(a[i].F,a[i].F);
m[a[i].S].F=min(m[a[i].S].F,a[i].F);
m[a[i].S].S=max(m[a[i].S].S,a[i].F);
}
vector<P> p;
p.pb(P(0,0));
tr(it,m) {
P q=it->S;
p.pb(P(q.F,q.S));
}
p.pb(P(0,0));
n=p.size();
ll dp[n][2];
rep(i,n)rep(j,2)dp[i][j]=MAXL;
dp[0][0]=dp[0][1]=0;
REP(i,1,n) {
dp[i][0]=min(dp[i][0],dp[i-1][0]+abs(p[i-1].F-p[i].S)+abs(p[i].F-p[i].S));
dp[i][0]=min(dp[i][0],dp[i-1][1]+abs(p[i-1].S-p[i].S)+abs(p[i].F-p[i].S));
dp[i][1]=min(dp[i][1],dp[i-1][0]+abs(p[i-1].F-p[i].F)+abs(p[i].F-p[i].S));
dp[i][1]=min(dp[i][1],dp[i-1][1]+abs(p[i-1].S-p[i].F)+abs(p[i].F-p[i].S));
}
pr(dp[n-1][0]);
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
| #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << endl
#define boost ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define error(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) {
cerr << *it << " = " << a << " ";
err(++it, args...);
}
template<typename T>
inline void read(T& x) {
x = 0; T f = 1; char ch = getchar();
while (!isdigit(ch)) f = (ch == '-') ? -1 : 1, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
x *= f;
}
template<typename T, typename ...Args>
inline void read(T& x, Args&... args) { read(x), read(args...); }
constexpr int MAXN = 2e5 + 5, MOD = 1e9 + 7;
#define int long long
int n;
array<long long, MAXN> x, c, l, r;
long long dp[MAXN][2];
signed main() {
boost;
cin >> n;
vector<int> vc;
memset(dp, 0x3f, sizeof(dp));
fill(l.begin(), l.end(), 2e9);
fill(r.begin(), r.end(), -2e9);
for (int i = 1; i <= n; i++) {
cin >> x[i] >> c[i];
l[c[i]] = min(l[c[i]], x[i]);
r[c[i]] = max(r[c[i]], x[i]);
vc.push_back(c[i]);
}
sort(vc.begin(), vc.end());
int cnt = unique(vc.begin(), vc.end()) - vc.begin();
for (int i = 0; i < cnt; i++) {
int co = vc[i], L = l[co], R = r[co], prePos = 0;
if (i == 0) {
if (R * L < 0) {
dp[0][0] = R * 2 - L; // stop at left
dp[0][1] = 2LL * (-L) + R;
} else {
if (R > 0) {
dp[0][0] = 2LL * R - L;
dp[0][1] = R;
} else {
dp[0][0] = -L;
dp[0][1] = 2LL * (-L) - R;
}
}
} else {
prePos = l[vc[i - 1]];
if ((R - prePos) * (L - prePos) < 0) {
dp[i][0] = min(dp[i][0], dp[i - 1][0] + (R - prePos) * 2 - (L - prePos));
dp[i][1] = min(dp[i][1], dp[i - 1][0] + 2LL * (-(L - prePos)) + (R - prePos));
} else {
if ((R - prePos) > 0) {
dp[i][0] = min(dp[i][0], dp[i - 1][0] + 2LL * (R - prePos) - (L - prePos));
dp[i][1] = min(dp[i][1], dp[i - 1][0] + R - prePos);
} else {
dp[i][0] = min(dp[i][0], dp[i - 1][0] + (-(L - prePos)));
dp[i][1] = min(dp[i][1], dp[i - 1][0] + 2LL * (-(L - prePos)) - (R - prePos));
}
}
prePos = r[vc[i - 1]];
if ((R - prePos) * (L - prePos) < 0) {
dp[i][0] = min(dp[i][0], dp[i - 1][1] + (R - prePos) * 2 - (L - prePos));
dp[i][1] = min(dp[i][1], dp[i - 1][1] + 2LL * (-(L - prePos)) + (R - prePos));
} else {
if ((R - prePos) > 0) {
dp[i][0] = min(dp[i][0], dp[i - 1][1] + 2LL * (R - prePos) - (L - prePos));
dp[i][1] = min(dp[i][1], dp[i - 1][1] + R - prePos);
} else {
dp[i][0] = min(dp[i][0], dp[i - 1][1] + (-(L - prePos)));
dp[i][1] = min(dp[i][1], dp[i - 1][1] + 2LL * (-(L - prePos)) - (R - prePos));
}
}
}
}
cout << min(dp[cnt - 1][0] + abs(l[vc.back()]), dp[cnt - 1][1] + abs(r[vc.back()]));
return 0;
} |
#include <bits/stdc++.h>
#include <complex>
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef complex<double> point;
#define INF numeric_limits<int>::max()
//Graphs
class AdjGraph{
ll V;
list<ll> *l;
vector<ll> checker;
vector<bool> visited;
public:
AdjGraph(ll Vert){
this->V = Vert;
l = new list<ll>[Vert];
vector<bool> vs(Vert,false);
this->visited = vs;
}
void AddEdge(ll x,ll y){
l[x].push_back(y);
l[y].push_back(x);
}
//Template for DFS
void DFS(ll at){
this->visited[at] = true;
for(int x:l[at]){
if(this->visited[x] != true){
DFS(x);
}
}
}
bool CheckConnect(ll x,ll y){
DFS_c(x);
reset_visited();
for(ll t: checker){
if(t == y){
checker.erase(checker.begin(),checker.end());
return true;
}
}
checker.erase(checker.begin(),checker.end());
return false;
}
void reset_visited(){
vector<bool> new_visited(this->V,false);
this->visited = new_visited;
}
private:
void DFS_c(ll at){
this->visited[at] = true;
checker.push_back(at);
for(ll x:l[at]){
if(this->visited[x] != true){
DFS_c(x);
}
}
}
};
class AdjGraphWeight{
ll V;
vector<pair<ll,ll> > *edge;
vector<bool> *visited;
public:
AdjGraphWeight(ll Vert){
this->V = Vert;
edge = new vector<pair<ll,ll> >[Vert];
visited = new vector<bool>(Vert,false);
}
};
//Number Theory
bool isPrime(ll x){
for(int i = 2;i < sqrt(x)+1;i++){
if(x % i == 0){
return false;
}
}
return true;
}
vector<ll> prime_divs(ll x){
vector<ll> divs;
for(int i = 0;i < sqrt(x)+1;i++){
if((isPrime(i) == true) && (x % i == 0)){
divs.push_back(i);
if(isPrime(x/i) == true){
divs.push_back(x/i);
}
}
}
return divs;
}
vector<ll> exponents(ll x){
vector<ll> divs = prime_divs(x);
vector<ll> res;
for(int i = 0; i< divs.size();i++){
ll temp = 0;
double expression = x/pow(divs[i],temp);
while(ceil(x/pow(divs[i],temp)) == x/pow(divs[i],temp)){
temp++;
}
res.push_back(temp);
}
return res;
}
vector<ll> get_all_divs(ll x){
vector<ll> divs;
divs.push_back(1);
divs.push_back(x);
if(isPrime(x) != true){
for(int i = 2;i < sqrt(x)+1;i++){
if(x % i == 0){
divs.push_back(i);
if(i*i != x){
divs.push_back(x/i);
}
}
}
}
return divs;
}
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ios::sync_with_stdio(false);
double x,y,z;
cin >> x >> y >> z;
double temp = y/x;
if(x == z){
cout << y-1 << endl;
}else{
double res = floor(temp*z-1/x);
if(res == x){
cout << res-1 << endl;
}else{
cout << res << endl;
}
}
return 0;
}
| #include <iostream>
int main() {
double x, y, z;
scanf("%lf %lf %lf", &x, &y, &z);
// y/x > z/?
int answer = 0;
for (int v = 0; v < 1e9; ++v) {
if (x/y >= z/v) {
break;
} else {
answer = v;
}
}
std::cout << answer;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
int n,ql,qr,lst,s,t;
vector<int>edge[maxn];
int dist[maxn],par[maxn],dep[maxn],que[maxn],ans[maxn];
bool bad[maxn];
void bfs(int s){
for(int i=1;i<=n;i++)dist[i]=-1;
dist[s]=0;
ql=1;qr=0;
que[++qr]=s;
while(ql<=qr){
int x=que[ql++];
for(int i=0;i<int(edge[x].size());i++){
int y=edge[x][i];
if(dist[y]<0)dist[y]=dist[x]+1,par[y]=x,que[++qr]=y;
}
}
}
void dfs(int x,int p){
lst=x;
int yy=0;
for(int i=0;i<int(edge[x].size());i++){
int y=edge[x][i];
if(y==p)continue;
if(!bad[y])
ans[y]=ans[lst]+dist[lst]+dist[y]-2*dist[x],dfs(y,x);
else yy=y;
}
if(yy)
ans[yy]=ans[lst]+dist[lst]+dist[yy]-2*dist[x],dfs(yy,x);
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n-1;i++){
int u,v;
scanf("%d%d",&u,&v);
edge[u].push_back(v);
edge[v].push_back(u);
}
bfs(1);
for(int i=1;i<=n;i++)if(!s||dist[i]>dist[s])s=i;
bfs(s);
for(int i=1;i<=n;i++)if(!t||dist[i]>dist[t])t=i;
while(t!=s)bad[t]=true,t=par[t];
ans[s]=1;
dfs(s,0);
for(int i=1;i<=n;i++)printf("%d%c",ans[i],i==n?'\n':' ');
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double Lf;
typedef pair<int, int> pii;
const int maxn = 2e5 + 5;
int n;
int dep[maxn], ans[maxn], mx[maxn];
vector<int> g[maxn];
inline void findFar(int u, int p, int &s){
if(~p)
dep[u] = dep[p] + 1;
else
dep[u] = 0;
if(!~s || dep[u] > dep[s])
s = u;
mx[u] = 1;
FOR(i, 0, g[u].size()) if(g[u][i] != p)
findFar(g[u][i], u, s), mx[u] = max(mx[u], mx[g[u][i]] + 1);
return;
}
inline void dfs(int u, int p, int &clk){
ans[u] = clk;
vector<pii> son;
FOR(i, 0, g[u].size()){
int v = g[u][i];
if(v == p)
continue;
son.PB(MP(mx[v], v));
}
sort(son.begin(), son.end());
FOR(i, 0, son.size())
dfs(son[i].snd, u, ++clk);
++clk;
return;
}
int main(){
scanf("%d", &n);
FOR(i, 1, n){
int u, v; scanf("%d%d", &u, &v);
--u; --v;
g[u].PB(v); g[v].PB(u);
}
int s = -1, t = -1;
findFar(0, -1, s);
findFar(s, -1, t);
int clk = 1;
dfs(s, -1, clk);
FOR(i, 0, n)
printf("%d ", ans[i]); puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template<typename T> void setmax(T& x, T y) {x = max(x, y);}
template<typename T> void setmin(T& x, T y) {x = min(x, y);}
const double PI = acos(-1.0);
const int INF = 1e9 + 47;
const LL LINF = 1LL * INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int where[1 << 20];
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
VI a(n), b(n), p(n);
FOR(i, 0, n)
cin >> a[i];
FOR(i, 0, n)
cin >> b[i];
vector<PII> arr;
FOR(i, 0, n)
{
cin >> p[i];
p[i]--;
where[p[i]] = i;
if(i == p[i]) continue;
if(a[i] <= b[p[i]])
{
cout << "-1" << endl;
return 0;
}
arr.PB(MP(a[i], i));
}
vector<PII> ans;
sort(ALL(arr));
FOR(j, 0, SZ(arr))
{
int i = arr[j].Y;
if(p[i] == i) continue;
ans.PB(MP(i, where[i]));
where[p[i]] = where[i];
swap(p[i], p[where[i]]);
}
cout << SZ(ans) << endl;
FOR(i, 0, SZ(ans))
cout << ans[i].X + 1 << " " << ans[i].Y + 1 << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
int N;
vector<LL> dp;
vector<string> S;
vector<bool> used;
template<typename T>
ostream& operator << (ostream& os, const vector<T>& vs){
for (const T& v : vs) os << v << " ";
return os;
}
void dfs(int v) {
used[v] = true;
dp[v]++;
for (int i = 0; i < N; ++i) {
if (!used[i] && S[v][i] == '1') {
dfs(i);
}
}
}
int main() {
cin >> N;
S.resize(N);
for (int i = 0; i < N; ++i) cin >> S[i];
dp.resize(N, 0);
for (int i = 0; i < N; ++i) {
used = vector<bool>(N, false);
dfs(i);
}
double sum = 0;
for (double v : dp) {
sum += N / v;
}
printf("%.15f\n", sum / N);
}
|
#include<bits/stdc++.h>
using namespace std;
template<class T>
istream& operator >>(istream& is, vector<T>& v){
for(auto&& elem:v)cin >> elem;
return is;
}
template<class T>
ostream& operator <<(ostream& os, const vector<T>& v){
if(!v.empty()){
for(int i=0, size=v.size(); i<size-1; ++i)os << v[i] << " ";
os<<v.back();
}
return os;
}
int main(){
int n, w;
cin >> n >> w;
vector<long long> times(200010, 0);
for(int i=0; i<n; ++i){
int s, t, p;
cin >> s >> t >> p;
times[s]+=p;
times[t]-=p;
}
for(int i=1, size= times.size(); i<size; ++i){
times[i] += times[i-1];
}
for(auto&& t : times){
if(t > w){
cout <<"No"<<endl;
fflush(stdout);
return 0;
}
}
cout <<"Yes"<<endl;
fflush(stdout);
return 0;
} | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <random>
#ifdef DEBUG
#include "library/Utility/debug.cpp"
#else
#define debug(...)
#endif
#define rep(i,n) for(int i=0;i<(n);++i)
#define EL '\n'
#define print(i) std::cout << (i) << '\n'
#define all(v) (v).begin(), (v).end()
using lnt = long long;
struct FIO{FIO(){std::cin.tie(0);std::ios_base::sync_with_stdio(0);std::cout<<std::fixed<<std::setprecision(15);}}fIO;
template<typename T> using V = std::vector<T>;
template<typename T> void fill(V<T>&v) { for(T&e:v) std::cin >> e; }
/*-*/
int main() {
int n; lnt w;
std::cin >> n >> w;
V<lnt> cost((int)3e5,0);
rep(i,n) {
int s,t; lnt p;
std::cin >> s >> t >> p;
cost[s]+=p;
cost[t]-=p;
}
rep(i,(int)3e5-4) {
cost[i+1]+=cost[i];
if(cost[i]>w) {
print("No");
return 0;
}
}
print("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, fa[N], ans[N], vis[N];
vector<pair<int, int> > G[N];
int Find(int x) {
return fa[x] == x ? x : fa[x] = Find(fa[x]);
}
void dfs(int u, int lst) {
for (auto &e : G[u]) {
int v = e.first;
if (v == lst) continue;
if (ans[u] == e.second) ans[v] = -1;
else ans[v] = e.second;
dfs(v, u);
}
if (ans[u] == -1) {
for (auto &e : G[u]) {
int v = e.first;
if (v == lst) continue;
vis[ans[v]] = 1;
}
if (ans[lst] >= 1) vis[ans[lst]] = 1;
for (int i = 1; i <= n; i++) if (!vis[i]) {
ans[u] = i;
break;
}
for (auto &e : G[u]) {
int v = e.first;
if (v == lst) continue;
vis[ans[v]] = 0;
}
if (ans[lst] >= 1) vis[ans[lst]] = 0;
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) fa[i] = i;
for (int i = 1; i <= m; i++) {
int u, v, c;
scanf("%d%d%d", &u, &v, &c);
if (Find(u) != Find(v)) {
fa[Find(u)] = Find(v);
G[u].emplace_back(v, c);
G[v].emplace_back(u, c);
}
}
ans[1] = -1;
dfs(1, 0);
for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
return 0;
} | /* by Hyperhydrochloric Acid */
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < (n); ++i)
#define cont(i, n) for(int i = 1; i <= (n); ++i)
#define circ(i, a, b) for(int i = (a); i <= (b); ++i)
#define range(i, a, b, c) for(int i = (a); ((c) > 0 ? i <= (b) : i >= (b)); i += (c))
#define foreach(it, v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define y0 y0O0OO00OO0OO0OO0OOO00OO0OO0O0O000OO0
#define y1 y1II11II11III11I1III11II111IIII1II1I1
#define pub push_back
#define pob pop_back
#define mak make_pair
typedef long long ll;
typedef long double lf;
const int Inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
/* Source code starts here */
int n, m;
vector<pair<int, int> > nei[1 << 17];
bool lgl[1 << 17];
int res[1 << 17];
void inline dfs(int now, int col, bool sme = 0) {
if(!sme) res[now] = col;
else res[now] = col % n + 1;
lgl[now] = 1;
loop(i, SZ(nei[now])) {
int to = nei[now][i].first, co = nei[now][i].second;
if(lgl[to]) continue;
dfs(to, co, co == res[now]);
}
}
int main() {
scanf("%d%d", &n, &m);
cont(i, m) {
int a, b, c; scanf("%d%d%d", &a, &b, &c);
nei[a].pub(mak(b, c)); nei[b].pub(mak(a, c));
}
dfs(1, 1);
cont(i, n) printf("%d\n", res[i]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define fi first
#define se second
#define ld long double
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define eb emplace_back
const int mxn = 1e5+5;
void multi(int64_t &a, int64_t b, const int64_t &MOD){
a%=MOD; b%=MOD;
a=((a*b)%MOD+MOD)%MOD;
}
void add(int64_t &a, int64_t b, const int64_t &MOD){
a%=MOD; b%=MOD;
a=((a+b)%MOD+MOD)%MOD;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int64_t MOD = (int64_t)998244353;
int n; cin>>n;
vector<int64_t>a(n); for(auto &x:a)cin>>x;
int64_t ans=0;
map<pair<int,int>,int>cnt;
sort(all(a));
//naive
if(0){
for(int mask=1; mask<(1<<n); mask++){
int64_t mn=MOD,mx=MOD;
cerr<<mask<<": ";
for(int i=0; i<n; i++){
if((mask>>i)&1){
cerr<<"1";
if(mn==MOD){
mn=a[i];
mx=a[i];
}else{
mn=min(mn,a[i]);
mx=max(mx,a[i]);
}
}else{
cerr<<"0";
}
}
cerr<<": ";
if(mn==MOD)continue;
cerr<<mn<<" "<<mx<<" ";
cnt[{mn,mx}]++;
multi(mn,mx,MOD);
add(ans,mn,MOD);
cerr<<mn<<" "<<ans<<"\n";
}
}
int64_t prev = 0;
for(int i=0; i<n; i++){
add(prev,prev,MOD);
if(i)add(prev,-a[i-1],MOD);
add(prev,a[i],MOD);
int64_t cur = prev;
multi(cur,a[i],MOD);
add(ans,cur,MOD);
}
cout<<ans<<"\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) a.begin(),a.end()
#define P pair<int,int>
#define Pll pair<long,long>
#define mp make_pair
#define INF 1000000001
#define INFl 1000000000000000001
#define ll long long
using namespace std;
struct edge{long to,cost,k;};
int main() {
int N;cin>>N;
vector<long> A(N);
rep(i,N)cin>>A[i];
sort(all(A));
long c=0;
long mod=998244353;
long a=A[N-1];
rep(i,N-1){
int j=N-i-2;
c+=A[j]*a;
c%=mod;
a*=2;
a%=mod;
a+=A[j];
a%=mod;
}
rep(i,N){
c+=A[i]*A[i];
c%=mod;
}
cout<<c%mod<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
/* overload to_string */
template <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) { return '"' + s + '"';}string to_string(const char* s) { return to_string((string) s);}string to_string(bool b) { return (b ? "true" : "false");}string to_string(vector<bool> v) { bool first = true; string res = "{"; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += ", "; } first = false; res += to_string(v[i]); } res += "}"; return res;}template <size_t N>string to_string(bitset<N> v) { string res = ""; for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); } return res;}template <typename A>string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res;}template <typename A, typename B>string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";}
/* claim debug 不能打印普通数组、自定义结构体 */
void debug_out() { cout << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) { cout << " " << to_string(H); debug_out(T...);}
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
/* read --- 只能输入整数数字(int , ll) */
template<typename T> void read(T &x){ x = 0;char ch = getchar();long long f = 1; while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;}
template<typename T, typename... Args> void read(T &first, Args& ... args) { read(first); read(args...);} // read end
/*-------------------------------------------------------------------------------------------------------------------------*/
#define rep(i, a, b) for(register int (i) = (a); (i) <= (int)(b); (i)++)
#define repd(i, b, a) for(register int (i) = (b); (i) >= (int)(a); (i)--)
#define set(a, x) memset((a), (x), sizeof(a))
#define get(a, id) get<(id)>(a)
#define int long long /* int 变成 long long */
typedef pair<int, int> pii;
typedef long long ll;
/*--------------------------------------------------------------------------------------------------------------------------*/
const int mod = 1e9 + 7;
const int maxn = 1e3 + 10;
int n;
void solve(){
int a, b, c;
cin >> a >> b >> c;
if( a== b){
cout << c;
}else if (a == c) {
cout << b;
}else if( b == c){
cout << a;
}else
cout << 0 << endl;
}
signed main(){
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int T = 1;
// cin >> T;
rep(i, 1, T){
// cout << "Case #" << i << ": ";
solve();
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
if(a==b){
cout<<c;
}
else if(b==c){
cout<<a;
}
else if(a==c){
cout<<b;
}
else{
cout<<"0";
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define pb push_back
#define pii pair<int,int>
#define gok ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll mod = 1e9 + 7,mxn=2e5 + 5;
signed main(){
gok
int n,m;
cin>>n>>m;
int gr[n][m];
int mi=1e9;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>gr[i][j];
mi = min(mi,gr[i][j]);
}
}
int an=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
an += gr[i][j]-mi;
}
}
cout<<an;
return 0;
}
| #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define ll long long
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<ll> a;
for(int i = 0; i < n; ++i) {ll x; cin >> x; a.push_back(x);}
sort(a.begin(), a.end());
//for (int i = 0; i < n; ++i) cout << a[i] << " ";
//cout << endl;
vector<ll>su;
su.push_back(a[0] - 1);
for (int i = 1; i < n; ++i) {
ll k = (a[i] - a[i - 1] - 1);
if (k < 0) k = 0;
su.push_back(k);
}
//for (int i = 0; i < n; ++i) cout << su[i] << " ";
//cout << endl;
for (int i = 1; i < n; ++i) su[i] += su[i - 1];
//for (int i = 0; i < n; ++i) cout << su[i] << " ";
//cout << endl;
while(q--) {
ll k1;
cin >> k1;
int in = lower_bound(su.begin(), su.end(), k1) - su.begin();
if (in > 0) {
ll suc = k1 - su[in - 1];
//cout << "SU " << in << endl;
//cout << suc << " " << k1 << " " << su[in - 1] << endl;
cout << a[in - 1] + suc << endl;
} else {
//cout << "IN 0" << endl;
cout << k1 << endl;
}
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
int X, Y, Z;
cin >> X >> Y >> Z;
int ans = 0;
if(Y*Z % X == 0) ans = Y*Z/X - 1;
else ans = Y*Z/X;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i=((n)-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
#define mod 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
ld x,y,z;
cin>>x>>y>>z;
ld a=y/x;
rep(i,1000010){
if(y/x<=(ld)i/z){
cout<<i-1;
return 0;
}
}
} |
#include <algorithm>
#include <cstdio>
#include <vector>
#include <stack>
using namespace std;
bool mark[400000];
char s[400001];
int main()
{
int N;
scanf("%d", &N);
vector<pair<int, int>> v;
for (int i = 0; i < 2 * N; i++) {
int x;
scanf("%d", &x);
v.emplace_back(x, i);
}
sort(v.begin(), v.end());
for (int i = 0; i < N; i++) {
mark[v[i].second] = true;
}
stack<int> st;
for (int i = 0; i < 2 * N; i++) {
if (st.size() == 0 || mark[st.top()] == mark[i]) st.push(i);
else {
s[st.top()] = '(';
s[i] = ')';
st.pop();
}
}
printf("%s\n", s);
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 2e5 + 5;
int mod = 998244353;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
n *= 2;
int a[n], tag[n];
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) cin >> a[i], v.push_back({a[i], i});
sort(v.begin(), v.end());
for (int i = 0; i < n / 2; i++) tag[v[i].se] = 1;
for (int i = n / 2; i < n; i++) tag[v[i].se] = -1;
int ans[n]{}, pre[n + 1]{};
map<int, queue<int>> v2;
for (int i = 0; i < n; i++) pre[i + 1] = pre[i] + tag[i], v2[pre[i + 1]].push(i);
for (int i = 0; i < n; i++){
if (ans[i]) continue;
ans[i] = 1;
v2[pre[i + 1]].pop();
int p = v2[pre[i]].front();
v2[pre[i]].pop();
ans[p] = 2;
//cout << pre[i] << ' ' << p << '\n';
}
for (int i = 0; i < n; i++) cout << (ans[i] == 1 ? '(' : ')');
} |
#include<bits/stdc++.h>
using namespace std;
#define I(X) scanf("%d",&(X))
#define II(X, Y) scanf("%d%d",&(X),&(Y))
#define III(X,Y,Z) scanf("%d%d%d",&(X),&(Y),&(Z))
#define IL(X) scanf("%lld",&(X))
#define IIL(X, Y) scanf("%lld%lld",&(X),&(Y))
#define pb push_back
#define popb pop_back
#define ll long long int
#define ull unsigned long long int
#define MOD 1000000007
#define f first
#define s second
#define mem(a,v) memset(a,v,sizeof(a))
#define mp make_pair
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define MAX 100000000000014
#define MIN -100000000000014
#define gti greater<int>
#define PI1 acos(-1.0)
#define pi2 2.0*acos(0.0)
#define endl '\n'
int main()
{
int n,m;
cin>>n>>m;
map<int,int>Hash;
for(int i = 0 ; i < n; i++){
int x;
cin>>x;
Hash[x]++;
}
vector<int>ans;
for(int i = 0 ; i < m; i++){
int x;
cin>>x;
Hash[x]++;
}
for(auto i : Hash)
if(Hash[i.first] == 1)
cout<<i.first<<" ";
cout<<endl;
}
| #define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// clang-format off
#define PI 3.14159265358979323846264338327950L
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep2(i,s,n) for (int i=(s); i<(int)(n); ++i)
#define prep_ios(do_flush) if(!do_flush){ ios::sync_with_stdio(false);cin.tie(nullptr);constexpr char endl='\n'; } cout<<fixed<<setprecision(20)
#define put(expr) cout<<expr<<'\n'
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "[ "; for (auto v: vec) os << v << " "; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "< "; for (auto v: vec) os << v << " "; os << ">"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{ "; for (auto v: vec) os << v << " "; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{ "; for (auto v: vec) os << v << " "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{ "; for (auto v: mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{ "; for (auto v: mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
typedef int8_t i8; typedef int16_t i16; typedef int32_t i32; typedef int64_t i64; typedef uint8_t u8; typedef uint16_t u16; typedef uint32_t u32; typedef uint64_t u64; typedef float f32; typedef double f64; typedef long double f80;
typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef map<int, int> mii;
typedef __int128_t i128; i128 parse(string &s) { i128 ret = 0; for (int i = 0; i < s.length(); i++) if ('0' <= s[i] && s[i] <= '9') ret = 10 * ret + s[i] - '0'; return ret; } istream &operator>>(istream &is, i128 &v) { string s; is >> s; v = parse(s); return is; } ostream &operator<<(ostream &os, const i128 &v) { if (v == 0) return (os << "0"); i128 num = v; if (v < 0) { os << '-'; num = -num; } string s; for (; num > 0; num /= 10) s.push_back('0' + (char)(num % 10)); reverse(s.begin(), s.end()); return (os << s); }
template <typename T> bool chmax(T &now, const T &cand) { if (now < cand) { now = cand; return true; } return false; } template <typename T> bool chmin(T &now, const T &cand) { if (now > cand) { now = cand; return true; } return false; }
template <typename T> T gcd(const T &a, const T &b) { if (a % b == 0) return b; return gcd(b, a % b); } template <typename T> T lcm(const T &a, const T &b) { return a * b / gcd(a, b); }
template <typename T> T nCr(const T &n, T k) { if (k > n) return 0; if (k * 2 > n) k = n - k; if (k == 0) return 1; int result = n; for (int i = 2; i <= k; ++i) { result *= (n - i + 1); result /= i; } return result; }
const int INF = 1<<30; /* INF > 10^9 */ const i64 INFLL = 1LL<<60; /* INFLL > 10^18 */ const string YES = "Yes", NO = "No";
// clang-format on?
int main() {
prep_ios(true);
vi anss = vi(1010);
i64 N, M;
cin >> N >> M;
rep(i, N) {
i64 tmp;
cin >> tmp;
++anss[tmp];
}
rep(i, M) {
i64 tmp;
cin >> tmp;
++anss[tmp];
}
bool first = true;
rep(i, anss.size()){
if (anss[i]==1){
if (first) {
first = false;
} else{
cout << ' ';
}
cout<<i;
}
}
cout<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) begin(X), end(X)
#define size(X) (int)std::size(X)
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main()
{ _
int n, m;
cin >> n >> m;
constexpr int mmax = 20;
int cnt[2]{};
for (int i = 0; i < n; ++i)
{
bitset<mmax> b;
cin >> b;
cnt[b.count() % 2] += 1;
}
ll res = 1LL * cnt[0] * cnt[1];
cout << res << endl;
exit(0);
}
| #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define LL long long
#define mem(s, v) memset(s, v, sizeof s)
#define FILEIN(s) freopen(s".in", "r", stdin)
#define FILEOUT(s) freopen(s".out", "w", stdout)
inline LL read(void) {
LL x = 0, f = 1; char ch = getchar();
while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return f * x;
}
const int maxn = 1e5 + 5;
int n, m;
int a[maxn];
long long ans;
int cnt1[maxn], cnt2[maxn];
char op[30];
int main() {
n = read(); m = read();
for (int i = 1; i <= n; ++ i) {
scanf("%s", op + 1);
int res = 0;
for (int j = 1; j <= m; ++ j) {
if (op[j] == '1') ++ res;
}
cnt1[i] = cnt1[i - 1];
cnt2[i] = cnt2[i - 1];
if (res & 1) ans += cnt2[i], cnt1[i]++;
else ans += cnt1[i], cnt2[i] ++;
}
printf("%lld\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define ZERO {puts("0"); return 0;}
#define NO {puts("No"); return 0;}
#define ALL(obj) begin(obj), end(obj)
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vl>
template<class T> void chmin(T& a, T b) { if (a > b) a = b; }
template<class T> void chmax(T& a, T b) { if (a < b) a = b; }
int const X = 101;
double dp[X][X][X];
int main()
{
int a, b, c; cin >> a >> b >> c;
for (int i = 99; i >= a; --i)
for (int j = 99; j >= b; --j)
for (int k = 99; k >= c; --k)
{
double now = 0;
now += dp[i+1][j][k] * i;
now += dp[i][j+1][k] * j;
now += dp[i][j][k+1] * k;
dp[i][j][k] = now / (i+j+k) + 1;
}
printf("%.10f\n", dp[a][b][c]);
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
long double r,x,y;
long double d;
cin>>r>>x>>y;
d=sqrt((x*x)+(y*y));
if(d==r)
cout<<1;
else
if(d<=(2*r))
cout<<2;
else
cout<<ceil(d/r);
return 0;
} |
/*
ID: gurban1
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn=5e3+5;
const int mod=998244353;
int n,m;
ll f[maxn],inv[maxn];
ll dp[maxn][maxn];
ll binmod(ll a,ll b) {if(b==0)return 1;ll x=binmod(a*a%mod,b>>1);return b&1?x*a%mod:x;}
ll choose(int a,int b){
return (((f[a] * inv[b]) % mod)*inv[a-b])%mod;
}
int main(){
// freopen("","r",stdin);
// freopen("","w",stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
f[0] = 1;
for(int i = 1;i <= n;i++) f[i] = (f[i-1] * i) % mod;
inv[n] = binmod(f[n],mod-2);
for(int i = n-1;i >= 0;i--) inv[i] = ((i+1) * inv[i+1])%mod;
for(int i = 0;i <= n;i += 2) dp[0][i] = choose(n,i);
// for(int i = 0;i <= n;i+=2) cout<<i<<' '<<dp[0][i]<<'\n';
int lg = __lg(m);
for(int i = 1;i <= lg;i++){
for(int j = 0;j <= n;j += 2){
for(int k = (j<<i);k <= m;k += 2){
ll cnt = (choose(n,j) * dp[i-1][k-(j<<i)])%mod;
dp[i][k] = (dp[i][k] + cnt)%mod;
}
}
}
cout<<dp[lg][m];
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
ll po(ll x,ll y){
ll res=1;
for(;y;y>>=1){
if(y&1)res=res*x%mod;
x=x*x%mod;
}
return res;
}
ll gcd(ll a,ll b){
return (b?gcd(b,a%b):a);
}
#define X 200010
ll fac[X],ivf[X];
void initfac(){
fac[0]=1;
for(ll i=1;i<X;i++)fac[i]=fac[i-1]*i%mod;
for(ll i=0;i<X;i++)ivf[i]=po(fac[i],mod-2);
}
ll C(ll n,ll k){
return fac[n]*ivf[n-k]%mod*ivf[k]%mod;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll n,p[200010],place[200010];
cin>>n;
rep(i,n){
cin>>p[i]; p[i]--;
place[p[i]]=i;
}
vector<ll> v;
bool ok=1;
ll s=0;
while(1){
ll i=place[s]-1;
if(i<s){ok=0;break;}
for(;i>=s;i--){
v.push_back(i);
swap(p[i+1],p[i]);
}
s=place[s];
if(s==n-1)break;
}
rep(i,n)ok&=(p[i]==i);
if(ok){
rep(i,v.size())cout<<v[i]+1<<"\n";
}
else cout<<-1<<endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int max(ll a, ll b) {
if (a > b) return a;
return b;
}
int min(ll a, ll b) {
if (a < b) return a;
return b;
}
int main() {
ll a,b,c;
cin >> a >>b >>c;
cout << (7-a)+(7-b)+(7-c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A,B,C;cin>>A>>B>>C;int s[4];
A%=10;
B%=4;
s[1]=A;s[2]=(A*A)%10;s[3]=s[2]*A%10;s[0]=s[3]*A%10;
if(B==0||B==1)cout<<s[B];
else if(B==2){
if(C==1)cout<<s[2];
else cout<<s[0];
}
else{
if(C%2==0)cout<<s[1];
else cout<<s[3];
}cout<<endl;
} |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
rep(t, T) {
int L, R;
cin >> L >> R;
ll LR = R - L;
ll tmp = LR - L;
if (tmp >= 0) co((tmp + 2) * (tmp + 1) >> 1);
else co(0);
}
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i < (n); ++i)
#define repD(i, a, n) for(ll i = a; i > (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (long long) (x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
// #define mp make_pair
#define pb push_back
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void __print(double x) {cout << x;}
void __print(long double x) {cout << x;}
void __print(char x) {cout << '\'' << x << '\'';}
void __print(const char *x) {cout << '\"' << x << '\"';}
void __print(const string &x) {cout << '\"' << x << '\"';}
void __print(bool x) {cout << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
const long double PI = 3.141592653589793238462643383;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long int> vll;
typedef vector<double> vd;
typedef vector<pii> vii;
long long Ceil(long long a, long long b){
if(a%b==0) return a/b;
else return (a/b)+1;
}
ll p=1000000007;
// ll p = 1000000000000000000+5;
float E = 0.00000000000001;
ll power(ll x, ll y){
if(y==0){
return 1;
}
if(y%2==0){
ll q=power(x,y/2);
q=q%p;
return (q*q)%p;
}
ll q=power(x,y/2);
q=q%p;
return ((x%p)*((q*q)%p))%p;
}
bool isPowerOfTwo (long long x)
{
/* First x in the below expression is for the case when x is 0 */
return x && (!(x&(x-1)));
}
long long int gcd(long long int a, long long int b){
if (a == 0)
return b;
return gcd(b % a, a);
}
long long int mod(long long int a, long long int b) {
long long int ret = a%b; return ret>=0? ret: ret+b;
}
int backward(int i, string &s, vector<int> &back){
if(i == 0)
return 0;
if(s[i-1] == 'R')
return back[i-1];
else
return 0;
}
int forward(int i, string &s, vector<int> &forw){
int n = s.size();
if(i == n)
return 0;
if(s[i] == 'L')
return forw[i+1];
else
return 0;
}
int main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
cin>>t;
while(t--){
ll l,r;cin>>l>>r;
// long long ans = 0;int diff = l;
// for(int i = l ; i <= r ; i++){
// ans += max(0, r-(i+diff)+1);
// }
// long long upp = min(r, r-l+1);
// if(l == r){
// if(l == 0)
// cout<<1<<endl;
// else
// cout<<0<<endl;
// continue;
// }
// ll upp = r-l+1;
// cout<<(r-l+1)*(upp-l+1)-(upp*(upp+1))/2 + ((l-1)*l)/2<<endl;
// cout<<ans<<endl;
ll num = r-2*l+1;
if(num>0)
cout<<num*(num+1)/2<<endl;
else
cout<<0<<endl;
}
return 0;
} |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <functional>
#include <utility>
#include <tuple>
#include <numeric>
#include <queue>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <regex>
#include <stack>
#include <limits>
#include <climits>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
n *= 2;
int res = 0;
for (long long i = 1; i*i < n; ++i) {
if (n % i == 0) {
long long d = i;
if ((n / d - d + 1) % 2 == 0) ++res;
d = n / i;
if ((n / d - d + 1) % 2 == 0) ++res;
}
}
cout << res << endl;
return 0;
}
| #include<bits/stdc++.h>
#define Pair pair<ll,int>
#define ar array
#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std ;
const ll LLMAX = 9223372036854775807;
int main(){
ll n;
cin>>n;
ll cur_low = n;
ll num_len = 1;
ll sum = n;
ll res = 0;
while(cur_low>0){
if((sum-n)%num_len==0){
ll diff = (sum-n)/num_len;
if(diff<0)
break;
res++;
cur_low-=diff;
sum = n+cur_low-1;
//cout<<"cur low "<<cur_low<<endl;
//cout<<"num len "<<num_len<<endl;
cur_low--;
num_len++;
}
else{
cur_low--;
sum+=cur_low;
num_len++;
}
}
/*
res = 1+res*2;
ll s = sqrt(1+8*n);
if(s*s == 1+8*n){
if((-1+s)%2==0)
res++;
}
*/
cout<<2*res<<endl;
}
|
#include <stdio.h>
#include <iostream>
int main(){
int n;
int *a;
int max1_i=0;
int max2_i=0;
std::cin >> n;
a = new(int[2<<(n-1)]);
int max1 = 0;
int max2 = 0;
for (int i=0; i< (2<<(n-1)); i++) {
std::cin >> a[i];
if (n >= 2) {
if (i< (2<<(n-2))) {
if (max1 < a[i]) {
max1 = a[i];
max1_i = i+1;
}
}else{
if (max2 < a[i]) {
max2 = a[i];
max2_i = i+1;
}
}
}
}
if (n == 1) {
if (a[0] < a[1] ) {
std::cout << "1" << std::endl;
}else{
std::cout << "2" << std::endl;
}
return 0;
}
if (max1 < max2) {
std::cout << max1_i << std::endl;
}else{
std::cout << max2_i << std::endl;
}
return 0;
} | #include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define pf push_front
#define dll deque<ll>
#define vll vector<ll>
#define vvll vector<vll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define dpll deque<pll>
#define mapll map<ll,ll>
#define umapll umap<ll,ll>
#define endl "\n"
#define all(v) v.begin(),v.end()
#define ms(a,x) memset(a,x,sizeof(a))
//#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
vector<string> split(const string& s, char c) {
vector<string> v; stringstream ss(s); string x;
while (getline(ss, x, c)) v.push_back(x); return move(v);
}
template<typename T, typename... Args>
inline string arrStr(T arr, int n) {
stringstream s; s << "[";
for(int i = 0; i < n - 1; i++) s << arr[i] << ",";
s << arr[n - 1] << "]";
return s.str();
}
#define EVARS(args...) {__evars_begin(__LINE__); __evars(split(#args, ',').begin(), args);}
inline void __evars_begin(int line) { cerr << "#" << line << ": "; }
template<typename T> inline void __evars_out_var(vector<T> val) { cerr << arrStr(val, val.size()); }
template<typename T> inline void __evars_out_var(T* val) { cerr << arrStr(val, 10); }
template<typename T> inline void __evars_out_var(T val) { cerr << val; }
inline void __evars(vector<string>::iterator it) { cerr << endl; }
template<typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__evars_out_var(a);
cerr << "; ";
__evars(++it, args...);
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template<class T, class H>using umap=unordered_map<T,H,custom_hash>;
template<class T>using uset=unordered_set<T,custom_hash>;
int32_t main()
{
clock_t clk = clock();
fast_az_fuk
ll testcase; cin>>testcase;
for(ll test=1;test<=testcase;test++)
{//cout<<"Case #"<<test<<": ";
ll n; cin>>n;
if(n&1) cout<<"Odd\n";
else if((n/2)&1) cout<<"Same\n";
else cout<<"Even\n";
}
// cerr << '\n'<<"Time (in s): " << double(clock() - clk) * 1.0 / CLOCKS_PER_SEC << '\n';
return 0;
} |
#include <cstdio>
#include <algorithm>
#define int long long
const int N = 200005;
int n, x[N], y[N], o[N], pp[N], p, qth, q, m;
struct ABC{
int k, co, b;
}dx, dy;
struct AandB{
int A, B, id;
}qu[N];
struct Anss{
int x, y, id;
}ans[N];
bool cmp(AandB x, AandB y){ return x.A < y.A; }
bool cmp2(Anss x, Anss y){ return x.id < y.id; }
signed main() {
scanf("%lld", &n);
for(int i = 1; i <= n; i++)
scanf("%lld%lld", &x[i], &y[i]);
scanf("%lld", &m);
for(int i = 1; i <= m; i++){
scanf("%lld", &o[i]);
if(o[i] >= 3) scanf("%lld", &pp[i]);
}
scanf("%lld", &q);
for(int i = 1; i <= q; i++){
scanf("%lld%lld", &qu[i].A, &qu[i].B);
qu[i].id = i;
}
std::sort(qu+1, qu+1+q, cmp);
qth = 1;
while(qth <= q && qu[qth].A == 0){
ans[qth].x = x[qu[qth].B], ans[qth].y = y[qu[qth].B];
ans[qth].id = qu[qth].id;
qth++;
}
dx.co = 0, dx.k = 1;
dy.co = 1, dy.k = 1;
ABC temp = dx;
for(int i = 1; i <= m; i++){
int op = o[i];
if(op == 1){
temp = dx; dx = dy; dy = temp;
dy.k = -dy.k; dy.b = -dy.b;
}
else if(op == 2){
temp = dx; dx = dy; dy = temp;
dx.k = -dx.k; dx.b = -dx.b;
}
else if(op == 3){
p = pp[i];
dx.k = -dx.k; dx.b = -dx.b;
dx.b += 2*p;
}
else if(op == 4){
p = pp[i];
dy.k = -dy.k; dy.b = -dy.b;
dy.b += 2*p;
}
while(qth <= q && qu[qth].A == i){
if(dx.co == 0) ans[qth].x = x[qu[qth].B], ans[qth].y = y[qu[qth].B];
else ans[qth].x = y[qu[qth].B], ans[qth].y = x[qu[qth].B];
ans[qth].x = ans[qth].x * dx.k + dx.b;
ans[qth].y = ans[qth].y * dy.k + dy.b;
ans[qth].id = qu[qth].id;
qth++;
}
// printf("%d %d %d | %d %d %d\n", dx.co, dx.k, dx.b, dy.co, dy.k, dy.b);
}
std::sort(ans+1, ans+1+q, cmp2);
for(int i = 1; i <= q; i++)
printf("%lld %lld\n", ans[i].x, ans[i].y);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
int n,x[N],y[N],m,q;
ll fx[N],fy[N],px[N],py[N];
int jg[N];
int main(){
scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
scanf("%d",&m);
fx[0]=fy[0]=1;
for(int i=1;i<=m;i++){
fx[i]=fx[i-1],fy[i]=fy[i-1],px[i]=px[i-1],py[i]=py[i-1],jg[i]=jg[i-1];
int op,p;scanf("%d",&op);
if(op>2) scanf("%d",&p);
else swap(fx[i],fy[i]),swap(px[i],py[i]),jg[i]^=1;
if(op==1) fy[i]=-fy[i],py[i]=-py[i];
else if(op==2) fx[i]=-fx[i],px[i]=-px[i];
else if(op==3) fx[i]=-fx[i],px[i]=2*p-px[i];
else fy[i]=-fy[i],py[i]=2*p-py[i];
}
scanf("%d",&q);while(q--){
int a,b;scanf("%d%d",&a,&b);
if(!jg[a]) printf("%lld %lld\n",fx[a]*x[b]+px[a],fy[a]*y[b]+py[a]);
else printf("%lld %lld\n",fx[a]*y[b]+px[a],fy[a]*x[b]+py[a]);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
vector <int> graf[200005];
int in[200005];
int out[200005];
int tjm;
vector <int> vec[500005];
void dfs(int v, int d){
in[v] = ++tjm;
vec[d].push_back(in[v]);
for(auto c : graf[v]) dfs(c, d+1);
out[v] = ++tjm;
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
for(int i=2; i<=n; i++){
int x;
cin >> x;
graf[x].push_back(i);
}
dfs(1, 0);
int q;
cin >> q;
while(q--){
int u, d;
cin >> u >> d;
auto l = lower_bound(vec[d].begin(), vec[d].end(), in[u]);
auto r = lower_bound(vec[d].begin(), vec[d].end(), out[u]);
r--;
if(l == vec[d].end()){
cout << "0\n";
continue;
}
cout << r-l+1 << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int maxn = 200005;
vector<int> G[maxn];
vector<P> g[maxn];
struct node
{
int u, d;
} arr[maxn];
int siz[maxn], hson[maxn], ans[maxn], d[maxn], d1[maxn];
int dfs0(int u, int f, int t)
{
siz[u] = 1;
d[u] = t;
int maxx = 0;
for (int i = 0; i < G[u].size(); i++)
{
int v = G[u][i];
if (v == f)
continue;
siz[u] += dfs0(v, u, t + 1);
if (siz[v] > maxx)
{
hson[u] = v;
maxx = siz[v];
}
}
return siz[u];
}
void jisuan(int u, int w, int ad)
{
d1[d[u]] += ad;
for (auto v : G[u])
{
if (v == w)
continue;
jisuan(v, w, ad);
}
}
void dfs1(int u, int f, int keep)
{
for (int i = 0; i < G[u].size(); i++)
{
int v = G[u][i];
if (v == f || v == hson[u])
continue;
dfs1(v, u, 0);
}
if (hson[u] != 0)
dfs1(hson[u], u, 1);
jisuan(u, hson[u], 1); /*
cout << u << "-------" << d[u] << endl;
for (int i = 0; i <= 8; i++)
cout << d1[i] << " ";
cout << endl;*/
for (auto p : g[u])
{
ans[p.second] = d1[p.first];
}
if (!keep)
{
jisuan(u, 0, -1);
}
}
int main()
{
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, m, i, j;
cin >> n;
for (i = 2; i <= n; i++)
{
cin >> m;
G[m].push_back(i);
}
int q;
cin >> q;
for (int i = 0; i < q; i++)
{
int x, y;
cin >> x >> y;
g[x].emplace_back(y, i);
}
dfs0(1, 1, 0);
dfs1(1, 1, 0);
for (i = 0; i < q; i++)
cout << ans[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200005;
int tree[maxn], hm[maxn], wm[maxn];
vector<int> vec[maxn];
void add(int k, int v) {
k++;
for (int i = k; i < maxn; i+=i&-i) tree[i] += v;
}
int qry(int k) {
k++;
int res = 0;
for (int i = k; i >= 1; i-=i&-i) res += tree[i];
return res;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < maxn; i++) tree[i] = 0;
int h, w, m;
cin >> h >> w >> m;
for (int i = 0; i <= h; i++) hm[i] = w;
for (int i = 0; i <= w; i++) wm[i] = h;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
hm[x] = min(hm[x], y-1);
wm[y] = min(wm[y], x-1);
}
for (int i = 1; i <= h; i++) if (hm[i-1] == 0) hm[i] = 0;
for (int i = 1; i <= w; i++) if (wm[i-1] == 0) wm[i] = 0;
int res = 0;
for (int i = 1; i <= h; i++) {
res += hm[i];
if (hm[i] != 0) vec[hm[i]].push_back(i);
else add(i,1);
}
for (int i = 1; i <= w; i++) {
if (wm[i] != 0) res += qry(wm[i]);
for (int p : vec[i]) add(p, 1);
}
cout << res << '\n';
}
/*
*/ | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#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 pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
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> 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 outvvp(T v){rep(i,v.size())outvp(v[i]);}
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]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
vi seg;
ll N;
void init(vi v){
N=1;
while(N<v.size())N*=2;
seg=vi(N*2-1);
rep(i,v.size())seg[i+N-1]=v[i];
for(int i=N-2;i>=0;i--)seg[i]=seg[i*2+1]+seg[i*2+2];
}
void update(ll i,ll x){
i=N+i-1;
seg[i]=x;
while(i>0){
i=(i-1)/2;
seg[i]=seg[i*2+1]+seg[i*2+2];
}
}
ll getsum(ll a,ll b,ll k,ll l,ll r){
if(r<=a||b<=l)return 0;
if(a<=l&&r<=b)return seg[k];
ll c1=getsum(a,b,k*2+1,l,(l+r)/2);
ll c2=getsum(a,b,k*2+2,(l+r)/2,r);
return c1+c2;
}
int main(){
ll h,w,n;cin>>h>>w>>n;
ll c=w,d=h;
vvi g(w);
ll ans=0;
ll mi=h;
rep(i,n){
ll a,b;cin>>a>>b;a--;b--;
g[b].pb(a);
if(!b)chmin(mi,a);
}
vi t(mi,1);
init(t);
bool ok=true;
rep(i,w){
sort(all(g[i]));
for(ll x:g[i])if(x<mi)update(x,0);
if(g[i].size()&&g[i][0]==0)ok=false;
if(g[i].size()&&ok){
// out('A');
ans+=g[i][0]+getsum(g[i][0],N,0,0,N);
}
else if(ok){
ans+=h;
// out('B');
}
else{
ans+=getsum(0,N,0,0,N);
// out('C');
}
}
out(ans);
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
int mod = 1000000007;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
template<class... T> int add(int x, T... y) { return add(x, add(y...)); }
int mul(int x, int y) { return 1LL * x * y % mod; }
template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
int sub(int x, int y) { return add(x, mod - y); }
int modpow(int a, long long b) {
int ret = 1; while (b > 0) {
if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
} return ret;
}
int modinv(int a) { return modpow(a, mod - 2); }
void chadd(int& x, int y) { x = add(x, y); }
void chsub(int& x, int y) { x = sub(x, y); }
void chmul(int& x, int y) { x = mul(x, y); }
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i @hamayanhamayan0
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, K, M;
const int MA = 251010;
int dp[101][MA];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> K >> mod;
dp[0][0] = 1;
rep(i, 0, 100) rep(sm, 0, MA) rep(use, 0, K + 1) if (sm + use * (i + 1) < MA) {
chadd(dp[i + 1][sm + use * (i + 1)], dp[i][sm]);
}
rep(x, 1, N + 1) {
int lft = x - 1, rht = N - x;
int ans = 0;
rep(sm, 0, MA) chadd(ans, mul(dp[lft][sm], dp[rht][sm], K + 1));
chsub(ans, 1);
printf("%d\n", ans);
}
}
| #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int,int> pii;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
#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 repr(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (x).size()
constexpr ll mod = 1000000007;
ll gcd(ll a, ll b){
if (a%b == 0)return(b);
else return(gcd(b, a%b));
}
ll inv(ll x){
ll res = 1;
ll k = mod - 2;
ll y = x;
while(k){
if(k&1)res = (res*y)%mod;
y = (y*y) % mod;
k /= 2;
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,p;
cin >> n >> p;
vll pp(60);
rep(i,60) {
if (i == 0) pp[i] = p-2;
else {
pp[i] = pp[i-1] * pp[i-1] % mod;
}
}
ll ret = p-1;
ll cnt = n-1;
rep(i,60) {
if ((cnt >> i) & 1) {
ret = ret * pp[i] % mod;
}
}
cout << ret << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[311111];
ll sum[311111];
int main(){
int n;
while(scanf("%d",&n)!=EOF){
double ans = 0;
for(int i = 1 ; i <= n ; i++){
ans += (1.0/i)*n;
}
printf("%.6f\n",ans-1);
}
return 0;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#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 rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>=1;i--)
#define all(vec) vec.begin(),vec.end()
#define fsort(vec) sort((vec).begin(),(vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef tuple<ll,ll,ll> tlll;
typedef tuple<int,int,int> tiii;
const ll mod=1e9+7;
const int inf=1<<30;
const ll lnf=1ll<<60;
int main(){
cout << fixed << setprecision(15);
ll n; cin >> n;
ld ans=0;
rep1(i,n-1){
ans+=(ld)n/i;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define fo(i,n) for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ull unsigned long long
#define lld long double
#define all(x) x.begin(), x.end()
#define ps(x,y) fixed<<setprecision(y)<<x
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define mod 1000000007
#define inf 1e18
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;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
//=======================
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("Error.txt", "w", stderr);
#endif
}
void solve() {
vl v(3);
fo(i, 3)cin >> v[i];
sort(all(v));
cout << v[1] + v[2];
}
int main() {
c_p_c();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| //
#include <iostream>
using namespace std;
int main() {
short A, B, C; cin >> A >> B >> C;
cout << max(A+B, max(A+C, B+C)) << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<intt>
#define ii pair<int,int>
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.14159265358979323846
#define all(a) a.begin(),a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
int mod = 1000000007;
int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}
int lcm(int a, int b) {return a * b / gcd(a, b); }
intt bpow(intt a,intt b)
{
intt res = 1;
while (b > 0) {
if (b & 1)res = ((res%mod) * (a%mod))%mod;
a = ((a%mod) * (a%mod))%mod;
b >>= 1;
}
return res;
}
intt fact(intt n) {
if ((n==0)||(n==1))
return 1;
else
return n*fact(n-1);
}
void go()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("OUt.txt","w",stdout);
#endif
}
int main()
{
fast_io
go();
int a,b,c;cin>>a>>b>>c;
if(c==0 && a==0){
cout <<"Aoki" << "\n";
return 0;
}
if(c==1 && b==0){
cout << "Takahashi" << "\n";
return 0;
}
while(1){
if(c==0 && a>0){
a--;
}
else if(c==0 && a==0){
cout <<"Aoki" << "\n";
break;
}
if(c==1 && b>0){
b--;
}
else if(c==1 && b==0){
cout << "Takahashi" << "\n";
break;
}
c^=1;
}
}
/*!
You are under no obligation to be the same person you were a minute ago,
You have the right to grow !
*/
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <climits>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define ll long long
#define pb push_back
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//typedef long long MOD=1000000009;
ll MOD=998244353;
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll lcm(ll x, ll y) {ll res = (x * y) / __gcd(x, y); return res;}
ll power(ll x, ll y) {if (y < 0) return 1; ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
void iofoj(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("error.txt","w",stderr);
#endif
}
#define F first
#define S second
void solution()
{
ll k,i,j,n,m,w;
cin>>n>>m>>k;
if(k==0)
{
if(n>m)
{
cout<<"Takahashi";
}
else cout<<"Aoki";
}
else
{
if(m>n)cout<<"Aoki";
else cout<<"Takahashi";
}
//else cout<<"";
}
int main(){
fio
//iofoj();
// ll t;
// cin>>t;
// for(ll i=1;i<=t;i++)
solution();
return 0;
}
|
#include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <cassert>
typedef long long ll;
using namespace std;
constexpr ll mod007 = 1000000007;
constexpr ll mod998 = 998244353;
ll N, F[88];
set<int>st;
int main() {
cin >> N;
F[1] = 1;
for (int i = 2; i < 88; i++) {
F[i] = F[i - 1] + F[i - 2];
}
for (int i = 87; i; i--) {
if (N >= F[i]) {
N -= F[i];
st.insert(i);
}
}
cout << 86 + st.size() << endl;
for (int i = 86; i; i--) {
if (st.find(i + 1) != st.end()) {
if (i % 2) {
cout << 2 << endl;
}
else {
cout << 1 << endl;
}
}
if (i % 2) {
cout << 3 << endl;
}
else {
cout << 4 << endl;
}
}
} | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long n; cin >> n;
long long x = 1;
long long y = 0;
vector<vector<int>>ans;
ans.push_back({});
vector<long long>f;
rep(i, 43) {
ans.push_back({ 4 });
y += x;
f.push_back(y);
ans.push_back({ 3 });
x += y;
f.push_back(x);
}
//cout << ans.size() << endl;
rrep(i, f.size()) {
if (n >= f[i]) {
n -= f[i];
ans[(ans.size() - 1) - (i + 1)].push_back(1 + (i + 1) % 2);
}
}
vector<int>a;
rep(i, ans.size()) {
rep(j, ans[i].size()) {
if ((0 == a.size()) && (ans[i][j] >= 3))continue;
a.push_back(ans[i][j]);
}
}
cout << a.size() << endl;
rep(i, a.size()) cout << a[i] << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
#define For(i,a,b) for(ll i=(a);i<(ll)(b);i++)
#define rFor(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
#define co(a) cout<<a<<endl
#define Sort(a) sort((a).begin(),(a).end())
#define Rev(a) reverse((a).begin(),(a).end())
#define Unique(a) (a).erase(unique((a).begin(), (a).end()),(a).end())
#define cfs(a) cout<<fixed<<setprecision(a)
int main() {
ll H, W;
cin >> H >> W;
vector<string> s(H);
For(i, 0, H) {
cin >> s[i];
}
ll N = H + W - 1;
ll is;
ll h, w;
ll ans = 1;
bool end = false;
For(i, 0, N) {
is = -1;
h = 0;
w = i;
if (w >= W) {
h = i % W + 1 + (i / W - 1) * W;
w = W - 1;
}
for (;;) {
if (s[h][w] == 'R') {
if (is != 1) {
is = 0;
}
else {
end = true;
break;
}
}
else if (s[h][w] == 'B') {
if (is != 0) {
is = 1;
}
else {
end = true;
break;
}
}
h++;
w--;
if (h >= H || w < 0) {
if (is == -1) {
ans *= 2;
ans %= 998244353;
//co(h << " " << w << " " << ans<<" "<<i);
}
break;
}
}
}
if (end) {
co(0);
}
else {
co(ans);
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb 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 pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=998244353;
const double eps=1e-10;
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> 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 outvvp(T v){rep(i,v.size())outvp(v[i]);}
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]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
ll h,w;cin>>h>>w;
vector<string> v(h);rep(i,h)cin>>v[i];
vvi cnt(h+w,vi(3));
rep(i,h)rep(j,w){
if(v[i][j]=='R')cnt[i+j][0]++;
if(v[i][j]=='B')cnt[i+j][1]++;
if(v[i][j]=='.')cnt[i+j][2]++;
}
ll ans=1;
rep(i,h+w){
if(cnt[i][0]&&cnt[i][1])dame(0);
if(cnt[i][0]||cnt[i][1])continue;
if(cnt[i][2])ans=ans*2%mod;
}
out(ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 123;
const int mod = 998244353;
int n, m;
int a[N];
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
a[i] = a[i - 1];
int j = i;
bool ok = 1;
while(j > 1) {
ok &= ((j % 10) != 7);
j /= 10;
}
j = i;
while(j) {
ok &= ((j % 8) != 7);
j /= 8;
}
if(ok)
a[i]++;
}
cout << a[n];
return 0;
}
//N?
| #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define printclock cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
#define deb3(x, y, z) cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl
#define deb4(x, y, z, w) cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << " | " << #w << ": " << w << endl
#define deb5(a, b, c, d, e) cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb1(x) cout << #x << ": " << x << endl
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define prec(n) fixed << setprecision(n)
#define all(a) a.begin(), a.end()
#define vvi vector<vector<int>>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pii pair<int, int>
#define vii vector<int>
#define ld long double
#define int long long
#define MOD LLONG_MAX
#define mp make_pair
#define pb push_back
#define endl "\n";
inline void get(vector<int> &arr, int n)
{
int a;
for (int i = 0; i < n; i++)
{
cin >> a;
arr.push_back(a);
}
}
inline void print(vector<int> &arr, int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}
/*----------------------------------TEMPLATE------------------------------------*/
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
fast;
/*----------------------------PEEPEEPOOPOO-------------------------------------*/
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++)
{
int curr = i;
bool valid = true;
while (curr)
{
if (curr % 10 == 7)
{
valid = false;
break;
}
else
{
curr = curr / 10;
}
}
if (!valid)
continue;
curr = i;
while (curr)
{
if (curr % 8 == 7)
{
valid = false;
break;
}
else
{
curr = curr / 8;
}
}
if (valid)
ans++;
}
cout << ans << endl;
return 0;
}
/*--------------------------------PEEPEEPOOPOO-------------------------------------*/ |
#define ll long long
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int> > a[100005];
ll dp[20][500000];
ll n,c;
ll rec(ll i,ll mask){
ll j,k,s=0,p;
if(dp[i][mask]!=-1) return dp[i][mask];
for(j=0;j<a[i-1].size();j++){
p=0;
for(k=0;k<18;k++){
if(mask>>k&1){
if(k<=a[i-1][j].first) p++;
}
}
if(p>a[i-1][j].second) return dp[i-1][mask]=0;
}
if(i==n) return 1;
for(j=0;j<n;j++){
if(((mask>>j)&1)!=1){
s+=rec(i+1,mask|1<<j);
}
}
return dp[i][mask]=s;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i,j,k,m,x,y,z,t;
cin>>n>>m;
c=pow(2,n)-1;
for(i=0;i<m;i++){
cin>>x>>y>>z;
a[x-1].push_back({y-1,z});
}
memset(dp,-1,sizeof(dp));
k=rec(0,0);
cout<<k<<endl;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define re return
#define all(a) a.begin(),a.end()
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
#define fi first
#define se second
#define ii pair<int,int>
//#define
using namespace std;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
string s[2022];
vector<ii>vec[28];
ii st,ed;
int n,m;
int use[2022][2022],dist[2022][2022];
signed main()
{
cin>>n>>m;
rep(i,n){
cin>>s[i];
rep(j,m){
if (s[i][j]=='S')
st=mp(i,j);
if (s[i][j]=='G')
ed=mp(i,j);
if (islower(s[i][j]))
vec[s[i][j]-'a'].pb(mp(i,j));
}
}
queue<ii>q;
q.push(st);
use[st.fi][st.se]=1;
rep(i,n)rep(j,m)dist[i][j]=1000000000;
dist[st.fi][st.se]=0;
while (!q.empty()){
ii cur=q.front();q.pop();
//cout<<'('<<cur.fi<<','<<cur.se<<')'<<'\n';
rep(i,4){
int nx=cur.fi+dx[i],ny=cur.se+dy[i];
if (nx<n && nx>=0 && ny<m && ny>=0 && !use[nx][ny] && s[nx][ny]!='#'){
//cout<<'('<<nx<<','<<ny<<')'<<'\n';
dist[nx][ny]=dist[cur.fi][cur.se]+1;
q.push(mp(nx,ny));
use[nx][ny]=1;
if (islower(s[nx][ny])){
int tt=s[nx][ny]-'a';
rep(j,sz(vec[tt])){
if (vec[tt][j]==mp(nx,ny)){
vec[tt].erase(vec[tt].begin()+j);
break;
}
}
}
}
}
//cout<<"OK\n";
if (islower(s[cur.fi][cur.se])){
int tt=s[cur.fi][cur.se]-'a';
rep(j,sz(vec[tt])){
int nx=vec[tt][j].fi,ny=vec[tt][j].se;
dist[nx][ny]=dist[cur.fi][cur.se]+1;
q.push(mp(nx,ny));
use[nx][ny]=1;
}
vec[tt]=vector<ii>(0);
}
}
cout<<(dist[ed.fi][ed.se]==1000000000?-1:dist[ed.fi][ed.se]);
re 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long long INF = 1LL << 60;
template <typename T>
void chmin(T& a, T b) {
if(a > b) {
a = b;
}
}
template <typename T>
void chmax(T& a, T b) {
if(a < b) {
a = b;
}
}
int main() {
string S;
cin >> S;
char sentou = S[0];
S[0] = S[1];
S[1] = S[2];
S[2] = sentou;
cout << S << endl;
return 0;
} | #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 n;
cin >> n;
vector<int> a(n+1,0);
rep(i,n){
int x;
cin >> x;
if(x<1||x>n){
cout << "No" << endl;
return 0;
}
if(a[x]!=0){
cout << "No" << endl;
return 0;
}
a[x]++;
}
cout << "Yes" << endl;
return 0;
} |
# include <bits/stdc++.h>
# define N 100010
char s[N];
int main() {
int n,i,las=0;
scanf("%d%s",&n,s+1);
if(s[1]!=s[n]) puts("1");
else {
for(i=2;i<n-1;i++) {
if(s[i]!=s[1] && s[i+1]!=s[1]) break;
}
if(i<n-1) puts("2");
else puts("-1");
}
return 0;
} | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <std::ostream& os = std::cout>
class Prints {
private:
class __Prints {
public:
__Prints(const char* sep, const char* term) : sep(sep), term(term) {}
template <class... Args>
#if __cplusplus >= 201703L
auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {
#else
void operator()(const Args&... args) const {
#endif
print(args...);
}
template <typename T>
#if __cplusplus >= 201703L
auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
#else
void pvec(const T& vec, size_t sz) const {
#endif
for (size_t i = 0; i < sz; i++)
os << vec[i] << (i == sz - 1 ? term : sep);
}
template <typename T>
#if __cplusplus >= 201703L
auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
#else
void pmat(const T& mat, size_t h, size_t w) const {
#endif
for (size_t i = 0; i < h; i++)
for (size_t j = 0; j < w; j++)
os << mat[i][j] << (j == w - 1 ? term : sep);
}
private:
const char *sep, *term;
void print() const { os << term; }
void print_rest() const { os << term; }
template <class T, class... Tail>
void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
template <class T, class... Tail>
void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
};
public:
Prints() {}
__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};
Prints<> prints;
Prints<std::cerr> prints_err;
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
void solve() {
ll N;
cin >> N;
string S;
cin >> S;
char fc = S.front();
char bc = S.back();
if (fc != bc) {
prints()(1);
return;
}
for (ll i = 1; i < N - 2; i++) {
if (S[i] != fc && S[i + 1] != fc) {
prints()(2);
return;
}
}
prints()(-1);
}
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
int main() {
#ifdef FASTIO
std::cin.tie(nullptr), std::cout.tie(nullptr);
std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
std::ifstream ifs("./in_out/input.txt");
std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
std::ofstream ofs("./in_out/output.txt");
std::cout.rdbuf(ofs.rdbuf());
#endif
std::cout << std::setprecision(18) << std::fixed;
solve();
std::cout << std::flush;
return 0;
} |
#include <iostream>
using namespace std;
typedef long long ll;
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)<(y)?(y):(x))
ll comb(ll n, ll k){
if (k == 0 || k == n) return 1;
if (k == 1 || k == n-1) return n;
return comb(n-1,k)+comb(n-1,k-1);
}
int main(){
ll n,k;cin >> n >> k;--k;
ll ss=0;
for(ll xyz=3;xyz<=n+1;++xyz) ss += (xyz-1)*(xyz-2)/2;
if(ss <= k){
k -= ss;
}else{
for(ll xyz=3;xyz<=n+1;++xyz){
ll s = (xyz-1)*(xyz-2)/2;
if(s <= k){
k -= s;
continue;
}
for(ll x=1;x<=xyz-2;++x){
ll c = xyz-1-x;
if(c <= k){
k -= c;
continue;
}
ll y=1+k;
cout << x << " " << y << " " << (xyz-x-y) << "\n";
return 0;
}
}
}
ss=0;
for(ll xyz=n+2;xyz < 2*n+1;++xyz) ss += ((3*n-xyz+2)*(xyz-n-1) + (xyz-2)*(2*n-xyz+1))/2;
if(ss <= k){
k -= ss;
}else{
for(ll xyz=n+2;xyz < 2*n+1;++xyz){
ll s = (3*n-xyz+2)*(xyz-n-1)/2;
if(s <= k){
k -= s;
}else{
for(ll x=1;x<=xyz-n-1;++x){
ll c = 2*n-xyz+1+x;
if(c <= k){
k -= c;
continue;
}
ll y=xyz-n-x+k;
cout << x << " " << y << " " << (xyz-x-y) << "\n";
return 0;
}
}
s = (xyz-2)*(2*n-xyz+1)/2;
if(s <= k){
k -= s;
continue;
}
for(ll x=xyz-n;x<=n;++x){
ll c = xyz-1-x;
if(c <= k){
k -= c;
continue;
}
ll y=1+k;
cout << x << " " << y << " " << (xyz-x-y) << "\n";
return 0;
}
}
}
for(ll xyz=2*n+1;xyz<=3*n;++xyz){
ll s = (3*n-xyz+2)*(3*n-xyz+1)/2;
if(s <= k){
k -= s;
continue;
}
for(ll x=xyz-2*n;x<=n;++x){
ll c = 2*n-xyz+1+x;
if(c <= k){
k -= c;
continue;
}
ll y=xyz-n-x+k;
cout << x << " " << y << " " << (xyz-x-y) << "\n";
return 0;
}
}
return 0;
}
| #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i @hamayanhamayan0
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N; ll K;
ll dp[4][3010101];
//---------------------------------------------------------------------------------------------------
int getTot() {
ll cu = 1;
rep(tot, 3, 3010101) {
if (cu <= K && K < cu + dp[3][tot]) return tot;
cu += dp[3][tot];
}
}
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> K;
dp[0][0] = 1;
rep(cnt, 0, 3) {
rep(tot, 0, 2010101) {
dp[cnt + 1][tot + 1] += dp[cnt][tot];
dp[cnt + 1][tot + N + 1] -= dp[cnt][tot];
}
rep(tot, 1, 3010101) {
dp[cnt + 1][tot] += dp[cnt + 1][tot - 1];
chmin(dp[cnt + 1][tot], infl);
}
}
int tot = getTot();
rep(t, 0, tot) K -= dp[3][t];
ll cu = 1;
int ans_i = -1;
rep(i, 1, N + 1) {
if (cu <= K && K < cu + dp[2][tot - i]) {
ans_i = i;
break;
}
cu += dp[2][tot - i];
}
rep(t, 1, ans_i) K -= dp[2][tot - t];
cu = 1;
int ans_j = -1;
rep(j, 1, N + 1) {
if (cu <= K && K < cu + dp[1][tot - ans_i - j]) {
ans_j = j;
break;
}
cu += dp[1][tot - ans_i - j];
}
int ans_k = tot - ans_i - ans_j;
printf("%d %d %d\n", ans_i, ans_j, ans_k);
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmds
#define y0 hNNNNy_yNNNNNN_sNh
#define y1 mNNNNNdtdNNNNNNtsNNm
#define yn mNNNNNNNNy___smNNNms
#define tm oooooosyysooooot
#define read tyhyt
#define rank ytmNmo
#define index yyy
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i,a,b) for(int i = (b); i >= (a); i--)
#define rall(x,a) for(auto x : a)
#define MOD 1000000007
#define int long long
typedef long long ll;
using namespace std;
int cel(int, int);
int flr(int a, int b) {
if(a < 0 && b < 0 || b < 0) {
return flr(-a, -b);
} else if(a < 0) {
return -cel(-a, b);
}
return a / b;
}
int cel(int a, int b) {
if(a < 0 && b < 0 || b < 0) {
return cel(-a, -b);
} else if(a < 0) {
return -flr(-a, b);
}
return (a + b - 1) / b;
}
const int X = 111111, M = 10000;
int solve() {
double xd, yd, rd;
cin >> xd >> yd >> rd;
int cx = round(xd * M), cy = round(yd * M), r = round(rd * M);
int ans = 0;
rep(i, -X, X) {
int dx = M * i;
int x = cx / M * M + dx;
dx = x - cx;
int lo = 0, hi = X * M;
while(lo < hi) {
int mid = lo + (hi - lo + 1) / 2;
int dist = dx * dx + mid * mid;
if(dist > r * r) {
hi = mid - 1;
} else {
lo = mid;
}
}
if(dx * dx + lo * lo > r * r) continue;
int y1 = cel(cy - lo, M);
int y2 = flr(cy + lo, M);
int add = y2 - y1 + 1;
ans += add;
}
cout << ans << endl;
return 0;
}
signed main() {
srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
while(t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<(a)<<endl
#define dumparr(a,n) cerr<<#a<<"["<<(n)<<"]="<<(a[n])<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#define FOR(i, a, b) for(ll i = (ll)a;i < (ll)b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(ll i = (ll)b-1LL;i >= (ll)a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define SIGN(a) (a==0?0:(a>0?1:-1))
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll,pll> ppll;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<ld,ld> pdd;
pll operator+(pll a,pll b){
return pll(a.first+b.first,a.second+b.second);
}
pll operator-(pll a,pll b){
return pll(a.first-b.first,a.second-b.second);
}
pll operator*(ll a,pll b){
return pll(b.first*a,b.second*a);
}
const ll INF=(1LL<<60);
#if __cplusplus<201700L
ll gcd(ll a, ll b) {
a=abs(a);
b=abs(b);
if(a==0)return b;
if(b==0)return a;
if(a < b) return gcd(b, a);
ll r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
#endif
template<class T>
bool chmax(T& a,const T& b){
if(a<b){
a=b;
return true;
}
return false;
}
template<class T>
bool chmin(T& a,const T& b){
if(a>b){
a=b;
return true;
}
return false;
}
template<class S,class T>
std::ostream& operator<<(std::ostream& os,pair<S,T> a){
os << "(" << a.first << "," << a.second << ")";
return os;
}
template<class T>
std::ostream& operator<<(std::ostream& os,vector<T> a){
os << "[ ";
REP(a.size()){
os<< a[i] << " ";
}
os<< "]";
return os;
}
template<class T>
std::ostream& operator<<(std::ostream& os,set<T> a){
os << "{ ";
for(auto itr=a.begin();itr!=a.end();++itr){
os<< *itr << " ";
}
os<< "}";
return os;
}
template<class T>
void ans_array(T begin,T end){
auto itr=begin;
cout<<*itr;
++itr;
for(;itr!=end;++itr){
cout<<' '<<*itr;
}
cout<<endl;
}
template<class T>
void ans_array_newline(T begin,T end){
for(auto itr=begin;itr!=end;++itr){
cout<<*itr<<endl;
}
}
const long long MOD = 1000000007;
void solve(long long N, std::vector<long long> u, std::vector<long long> v, std::vector<long long> w){
vector<vector<pll>> graph(N);
REP(N-1){
graph[u[i]].push_back(pll(v[i],w[i]));
graph[v[i]].push_back(pll(u[i],w[i]));
}
ll ans=0;
For(numidx,62){
ll mask=(1LL<<numidx);
dump(mask);
auto dfs1=[&](ll cur,ll parent,auto dfs)->pll{
pll curstatus(1,0);
for (auto &&i : graph[cur])
{
if(i.first==parent)continue;
pll tmp=dfs(i.first,cur,dfs);
if((i.second)&mask){
curstatus.first+=tmp.second;
curstatus.second+=tmp.first;
}else{
curstatus.first+=tmp.first;
curstatus.second+=tmp.second;
}
};
return curstatus;
};
auto res=dfs1(0,-1,dfs1);
dump(res);
auto dfs2=[&](ll cur,ll parent,ll curstatus,auto dfs)->ll{
ll ret=(curstatus?res.first:res.second);
for (auto &&i : graph[cur])
{
if(i.first==parent)continue;
if(mask&i.second){
ret+=dfs(i.first,cur,curstatus^1,dfs);
}else{
ret+=dfs(i.first,cur,curstatus,dfs);
}
}
return ret;
};
ll tmp=dfs2(0,-1,0,dfs2)%MOD;
dump(tmp);
ans+=mask%MOD*tmp%MOD;
ans%=MOD;
dump(ans);
}
cout<<ans*((MOD+1)/2)%MOD<<endl;
}
int main(){
cout<<setprecision(1000);
long long N;
scanf("%lld",&N);
std::vector<long long> u(N-1);
std::vector<long long> v(N-1);
std::vector<long long> w(N-1);
for(int i = 0 ; i < N-1 ; i++){
scanf("%lld",&u[i]);
scanf("%lld",&v[i]);
scanf("%lld",&w[i]);
--u[i];--v[i];
}
solve(N, std::move(u), std::move(v), std::move(w));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
#define debug(v) cout<<#v<<": ",prt(v);
template <typename A,typename B>
inline void prt(pair<A,B> p){cout<<"("<<p.first<<", "<<p.second<<")\n";}
template <typename A,typename B,typename C>
inline void prt(tuple<A,B,C> p){cout<<"("<<get<0>(p)<<", "<<get<1>(p)<<", "<<get<2>(p)<<")\n";}
inline void prt(bool p){if(p)cout<<"True"<<'\n';else cout<<"False"<<'\n';}
template <typename T>
inline void prt(vector<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template<typename T>
inline void prt(vector<vector<T> >& vv){ for(const auto& v : vv){ prt(v); } }
template <typename T>
inline void prt(deque<T> v){cout<<'{';for(ll i=0;i<v.size();i++){cout<<v[i];if(i<v.size()-1)cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename A,typename B>
inline void prt(unordered_map<A,B> v){cout<<'{';ll c=0;for(auto &p: v){cout<<p.first<<":"<<p.second;c++;if(c!=v.size())cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(set<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
template <typename T>
inline void prt(multiset<T> v){cout<<'{';for(auto i=v.begin();i!=v.end();i++){cout<<*i;if(i!=--v.end())cout<<", ";}cout<<'}'<<'\n';}
/*
step0 A<BとかA%2!=B%2を除外
step1 自分より右が存在するかチェック
step2 残り物の消去
step3 マッチングしてく
*/
int main(){
ll n;
cin >> n;
string s,t;
cin >> s >> t;
ll A = 0;
ll B = 0;
ll ans = 0;//答え
//step0
rep(i,n){
if(s[i]=='1')A++;
if(t[i]=='1')B++;
}
if(A<B||A%2!=B%2){
cout << -1 << endl;
return 0;
}
ll a = 0;
ll b = 0;
//step1
rep(i,n){
if(A<B){
cout << -1 << endl;
return 0;
}
if(s[i]=='1')a++;
if(t[i]=='1')b++;
if(a>b){
a--;
s[i]='0';
for(int j=i+1;j<n;j++){
if(s[j]=='1'){
s[j]='0';
ans += j-i;
break;
}
}
A -= 2;
}
}
//step2
ll dif = B-A;
ll r = n;
ll l = n;
for(int i=n-1;i>=0;i--){
if(dif==0)break;
if(s[i]=='1'){
if(dif%2==0){
r = i;
dif--;
}
else{
ans += r-i;
dif--;
}
}
}
//step3
rep(i,n){
if(s[i]=='1'){
ans += i;
}
if(t[i]=='1'){
ans -= i;
}
}
cout << ans << endl;
return 0;
}
| // clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcountll
#define ffs __builtin_ffsll
#define ctz __builtin_ctzll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define all(a) (a).begin(), (a).end()
using namespace std;
using namespace __gnu_pbds;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using pll = pair<ll,ll>;
template <typename T> using vec = vector<T>;
using vi = vec<int>;
using vl = vec<ll>;
template <typename T> using que = queue<T>;
template <typename T> using deq = deque<T>;
template <typename T> T id(T b) {return b;};
template <typename T> void chmax(T &x, T y) {if (x < y) x = y;}
template <typename T> void chmin(T &x, T y) {if (x > y) x = y;}
template <typename S, typename K> bool contains(S &s, K k) { return s.find(k) != s.end(); }
void fastio() { ios_base::sync_with_stdio(false); cin.tie(nullptr); }
constexpr ll TEN(int n) { if (n == 0) return 1LL; else return 10LL*TEN(n-1); }
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename K, typename V> using ordered_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>;
// clang-format on
int main() {
fastio();
int n;
string s, t;
cin >> n >> s >> t;
int borrow = 0;
ll ans = 0;
forn(i, n) {
ans += borrow;
if (s[i] == '1' and t[i] == '0') {
if (borrow > 0)
borrow--;
else
borrow++;
}
if (s[i] == '0' and t[i] == '1') {
borrow++;
}
}
bool ok = borrow == 0;
cout << (ok ? ans : -1) << endl;
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <iomanip>
using namespace std;
using VI = vector <int>;
using VVI = vector <VI>;
using VVVI = vector <VVI>;
using VLL = vector <long long>;
using VVLL = vector <VLL>;
using UMI = unordered_map<int, int>;
using UMLL = unordered_map<long long, long long>;
inline int getSum(const VVI& acc, int sr, int sc, int er, int ec) {
if (er < sr || ec < sc) {
return 0;
}
int ret = acc[er][ec];
if (sr-1 >= 0) {
ret -= acc[sr-1][ec];
}
if (sc-1 >= 0) {
ret -= acc[er][sc-1];
}
if (sr-1 >= 0 && sc-1 >= 0) {
ret += acc[sr-1][sc-1];
}
return ret;
}
int main() {
int N;
int K;
cin >> N >> K;
VVI val(N, VI(N));
VI valVec;
UMI rankMap;
UMI rankToVal;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
cin >> val[i][j];
valVec.push_back(val[i][j]);
}
}
int cnt = 0;
sort(valVec.begin(), valVec.end());
rankMap[valVec[0]] = ++cnt;
rankToVal[cnt] = valVec[0];
for (int i = 1; i < valVec.size(); ++i) {
if (valVec[i] != valVec[i-1]) {
rankMap[valVec[i]] = ++cnt;
rankToVal[cnt] = valVec[i];
}
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
val[i][j] = rankMap[val[i][j]];
}
}
int target = K%2 ? (K*K)/2+1 : (K*K)/2;
int low = 1;
int up = rankToVal.size();
int ans = -1;
while (low <= up) {
int mid = (low+up) / 2;
VVI mask(N, VI(N));
VVI acc(N, VI(N));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
mask[i][j] = val[i][j] <= mid;
}
}
for (int i = 0; i < N; ++i) {
int racc = 0;
for (int j = 0; j < N; ++j) {
racc += mask[i][j];
if (i) {
acc[i][j] += acc[i-1][j];
}
acc[i][j] += racc;
}
}
bool ok = false;
for (int i = 0; i+K-1 < N && !ok; ++i) {
for (int j = 0; j+K-1 < N && !ok; ++j) {
int sum = getSum(acc, i, j, i+K-1, j+K-1);
if (sum >= target) {
ok = true;
break;
}
}
}
if (ok) {
up = mid-1;
ans = rankToVal[mid];
} else {
low = mid+1;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> a(n, vector<ll>(n));
rep(i, n) rep(j, n) cin >> a[i][j];
ll ng = -1;
ll ok = 10e10;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
vector<vector<ll>> sum(n + 1, vector<ll>(n + 1));
rep(i, n) rep(j, n) {
sum[i + 1][j + 1] = (a[i][j] <= mid) + sum[i + 1][j];
}
rep(i, n) rep(j, n) { sum[j + 1][i + 1] += sum[j][i + 1]; }
bool exist = false;
for (int i = 0; i + k <= n; i++) {
for (int j = 0; j + k <= n; j++) {
if (sum[i + k][j + k] + sum[i][j] - sum[i][j + k] -
sum[i + k][j] >=
(k * k + 1) / 2)
exist = true;
}
}
if (exist) {
ok = mid;
} else {
ng = mid;
}
}
cout << ok << endl;
} |
#include <iostream>
#include <climits>
#include<vector>
#include <stack>
#include <queue>
#include <string>
#include <utility>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
#include<cmath>
#include <limits>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 10000000000;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
#define REP(i, a,b) for(i=a;i<b;i++)
#define REP1(i,b,a) for(i=b-1;i>=a;i--)
#define output(x) cout<<x<<endl;
#define pb(x) push_back(x);
const int MOD = 1000000007;
int main() {
ll N,i,j,ans;
cin >> N;
string S;
cin >> S;
ans = 0;
ll cca, cct, ccg, ccc;
cca = 0;
cct = 0;
ccg = 0;
ccc = 0;
REP(i, 0, N) {
REP(j, i,N) {
if (S[j] == 'A') cca++;
if (S[j] == 'T') cct++;
if (S[j] == 'G') ccg++;
if (S[j] == 'C') ccc++;
if ((cca == cct) && (ccg == ccc))ans++;
}
cca = 0;
cct = 0;
ccg = 0;
ccc = 0;
}
output(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using pii = pair<int64_t, int64_t>;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
map<char, vi> check;
check['A'] = vi(s.size()+10);
check['T'] = vi(s.size()+10);
check['C'] = vi(s.size()+10);
check['G'] = vi(s.size()+10);
for (int i=1; i < s.size()+1; i++) {
for (auto x : check) {
char key = x.first;
if (s[i-1] == key) check[key][i] = check[key][i-1] + 1;
else check[key][i] = check[key][i-1];
}
}
for (int i = 1; i < s.size()+1; i++) {
rep(j, s.size()+1-i) {
if ((check['A'][j+i] - check['A'][j] == check['T'][j+i] - check['T'][j]) && (check['C'][j+i] - check['C'][j] == check['G'][j+i] - check['G'][j])) {
ans += 1;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vi>;
using ii = pair<ll, ll>;
using vii = vector<ii>;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
const ll mod = 1000000007;
const ll N = 3e5, M = N;
vi g[N];
void solve() {
ll i, j, n, m, k;
cin >> n;
if(n % 100 == 0) {
cout << n / 100;
} else {
cout << n/100 + 1;
}
}
int main() {
ll tc = 1;
for(ll t = 0; t < tc; t++) {
solve();
}
return 0;
}
| /**
* created: 21/03/2021, 13:15:10
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, dp[max_n];
vector<int> all[max_n];
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i < max_n; ++i) {
for (int j = 2 * i; j < max_n; j += i) {
all[j].push_back(i);
}
}
for (int i = 1; i <= n; ++i) {
for (int x : all[i]) {
dp[i] = max(dp[i], dp[x]);
}
++dp[i];
printf("%d ", dp[i]);
}
puts("");
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n, w, ans;
cin >> n >> w;
ans = n/w;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <numeric>
#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 FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
#define MIN(v) *min_element((v).begin(), (v).end())
#define MAX(v) *max_element((v).begin(), (v).end())
#define PF(p) (p).first
#define PS(p) (p).second
#define MF(p) (p)->first
#define MS(p) (p)->second
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define VL vector<long long>
#define VVL vector<vector<long long>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define VC vector<char>
#define VVC vector<vector<char>>
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
//const ll MOD = 998244353LL;
int pmod(int x){int y=x%(int)MOD;return (y>=0)?y:y+(int)MOD;}
ll pmod(ll x){ll y=x%MOD;return (y>=0LL)?y:y+MOD;}
bool in(ll x, ll a, ll b){return (a<=x)&&(x<b);}
template<class T>bool chmin(T& a, T b){if(a>b){a=b;return true;}else return false;}
template<class T>bool chmax(T& a, T b){if(a<b){a=b;return true;}else return false;}
int main(){
ll N,W;
cin>>N>>W;
cout << N/W;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
int N;
double D, H;
cin >> N;
vector<double> d(N), h(N);
cin >> D >> H;
for (int i = 0; i < N; i++) {
cin >> d[i] >> h[i];
}
double ans = 0.0;
for (int i = 0; i < N; i++) {
double y = (h[i]*D - H*d[i]) / (H - h[i]);
double x = h[i]*y / (y + d[i]);
ans = max(ans, x);
}
printf("%32.18f\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, d, h;
double max_hi = 0;
cin >> n >> d >> h;
vector<vector<int>> object(n, vector<int>(2));
for (int i = 0; i < n; i++)
cin >> object.at(i).at(0) >> object.at(i).at(1);
for (int i = 0; i < n; i++){
double tmp;
tmp = object.at(i).at(1) - object.at(i).at(0) * ((double) h - object.at(i).at(1)) / (d - object.at(i).at(0));
if (tmp > max_hi)
max_hi = tmp;
}
cout << fixed << setprecision(16);
cout << max_hi << endl;
} |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define _overload(_1, _2, _3, _4, name, ...) name
#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)
#define _rep2(Itr, A, B) _rep3(Itr, A, B, 1)
#define _rep3(Itr, A, B, S) for(i64 (Itr) = A; (Itr) < B; (Itr) += S)
#define repeat(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define rep(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)
#ifndef SEGMENT_TREE_HPP
#define SEGMENT_TREE_HPP
#include <vector>
#include <functional>
#include <iterator>
//===
template<class Monoid>
struct SegmentTree {
using T = typename Monoid::value_type;
std::vector<T> tree;
SegmentTree() = default;
explicit SegmentTree(int n)
:tree(n << 1, Monoid::identity()) {};
template<class InputIterator>
SegmentTree(InputIterator first, InputIterator last) {
tree.assign(distance(first, last) << 1, Monoid::identity());
int i;
i = size();
for (InputIterator itr = first; itr != last; itr++) {
tree[i++] = *itr;
}
for (i = size() - 1; i > 0; i--) {
tree[i] = Monoid::operation(tree[(i << 1)], tree[(i << 1) | 1]);
}
};
inline int size() {
return tree.size() >> 1;
};
inline T operator[] (int k) {
return tree[k + size()];
};
void update(int k, const T dat) {
k += size();
tree[k] = dat;
while(k > 1) {
k >>= 1;
tree[k] = Monoid::operation(tree[(k << 1)], tree[(k << 1) | 1]);
}
};
// [l, r)
T fold(int l, int r) {
l += size(); //points leaf
r += size();
T lv = Monoid::identity();
T rv = Monoid::identity();
while (l < r) {
if (l & 1) lv = Monoid::operation(lv, tree[l++]);
if (r & 1) rv = Monoid::operation(tree[--r], rv);
l >>= 1;
r >>= 1;
}
return Monoid::operation(lv, rv);
};
template<class F>
inline int sub_tree_search(int i, T sum, F f) {
while (i < size()) {
T x = Monoid::operation(sum, tree[i << 1]);
if (f(x)) {
i = i << 1;
}
else {
sum = x;
i = (i << 1) | 1;
}
}
return i - size();
}
template<class F>
int search(int l, F f) {
l += size();
int r = size() * 2; //r = n;
int tmpr = r;
int shift = 0;
T sum = Monoid::identity();
while (l < r) {
if (l & 1) {
if (f(Monoid::operation(sum, tree[l]))) {
return sub_tree_search(l, sum, f);
}
sum = Monoid::operation(sum, tree[l]);
l++;
}
l >>= 1;
r >>= 1;
shift++;
}
while (shift > 0) {
shift--;
r = tmpr >> shift;
if (r & 1) {
r--;
if (f(Monoid::operation(sum, tree[r]))) {
return sub_tree_search(r, sum, f);
}
sum = Monoid::operation(sum, tree[r]);
}
}
return -1;
};
};
//===
#endif
#include <iostream>
using i64 = long long;
using namespace std;
int main() {
i64 n, q;
cin >> n >> q;
vector<i64> v(n);
for (auto &vs: v) cin >> vs;
struct M {
using value_type = i64;
static i64 operation(i64 a, i64 b) { return a ^ b; };
static i64 identity() { return 0; };
};
SegmentTree<M> seg(n);
rep (i, n) seg.update(i, v[i]);
rep (_, q) {
i64 t, x, y;
cin >> t >> x >> y;
x--;
if (t == 1) {
seg.update(x, seg[x] ^ y);
}
else {
cout << seg.fold(x, y) << '\n';
}
}
return 0;
};
| #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
int mod = 1000000007;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
template<class... T> int add(int x, T... y) { return add(x, add(y...)); }
int mul(int x, int y) { return 1LL * x * y % mod; }
template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
int sub(int x, int y) { return add(x, mod - y); }
int modpow(int a, long long b) {
int ret = 1; while (b > 0) {
if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
} return ret;
}
int modinv(int a) { return modpow(a, mod - 2); }
typedef vector<int> Vec;
typedef vector<Vec> Mat;
Vec mulMatVec(Mat a, Vec b)
{
int n = b.size(); Vec ret(n, 0);
rep(i, 0, n) rep(j, 0, n) ret[i] = add(ret[i], mul(a[i][j], b[j]));
return ret;
}
Mat mulMatMat(Mat a, Mat b)
{
int n = a.size(); Mat ret(n, Vec(n, 0));
rep(i, 0, n) rep(j, 0, n) rep(k, 0, n) ret[i][j] = add(ret[i][j], mul(a[i][k], b[k][j]));
return ret;
}
Mat fastpow(Mat x, ll n)
{
Mat ret(x.size(), Vec(x.size(), 0));
rep(i, 0, x.size()) ret[i][i] = 1;
while (0 < n) { if ((n % 2) == 0) { x = mulMatMat(x, x); n >>= 1; } else { ret = mulMatMat(ret, x); --n; } }
return ret;
}
void printVec(Vec a) { cout << "[\t"; rep(i, 0, a.size()) cout << a[i] << "\t"; cout << "]" << endl; }
void printMat(Mat a) { rep(i, 0, a.size()) printVec(a[i]); }
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i @hamayanhamayan0
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, M, K, A[101];
int X[10101], Y[10101];
int cnt[101];
bool E[101][101];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> M >> K;
rep(i, 0, N) cin >> A[i];
rep(i, 0, M) cin >> X[i] >> Y[i], X[i]--, Y[i]--;
Mat Ma(N, Vec(N));
rep(i, 0, M) {
cnt[X[i]]--;
cnt[Y[i]]--;
E[X[i]][Y[i]] = E[Y[i]][X[i]] = true;
}
rep(to, 0, N) {
int cnt = M;
rep(from, 0, N) if (to != from) {
if (E[to][from]) {
Ma[to][to] = add(Ma[to][to], mul(modinv(M), modinv(2)));
Ma[to][from] = add(Ma[to][from], mul(modinv(M), modinv(2)));
cnt--;
}
}
Ma[to][to] = add(Ma[to][to], mul(cnt, modinv(M)));
}
Vec v(N, 0);
rep(i, 0, N) v[i] = A[i];
Ma = fastpow(Ma, K);
v = mulMatVec(Ma, v);
rep(i, 0, N) cout << v[i] << endl;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.begin(),v.end())
#define rev(v) if(!v.empty())reverse(v.begin(),v.end())
#define PI 3.141592653589793238
#define pqr priority_queue<ll,vector<ll>,greater<ll>()>
using namespace std;
ll pow_mod(ll a,ll b)
{
ll res=1;
while(b!=0)
{
if(b&1)
{
res=(res*a)%mod;
}
a=(a*a)%mod;
b/=2;
}
return res;
}
ll inv_mod(ll x){
return pow_mod(x,mod-2);
}
const ll N=19;
ll inv[N];
ll fac[N];
ll ncr(ll n,ll r){
if(n<r)
return 0;
if(n==r||r==0)
return 1LL;
ll x=fac[n];
ll y=inv[n-r];
ll z=inv[r];
return ((x*y)%mod*z)%mod;
}
void solve()
{
/*
3 1
2 2 1
0
*/
ll n,m;
cin>>n>>m;
if(m==0)
{
cout<<fac[n]<<endl;
return;
}
ll x[m+1],y[m+1],z[m+1];
for(ll i=0;i<m;i++)
cin>>x[i]>>y[i]>>z[i];
vector<pii>v[n+1];
for(ll i=0;i<m;i++){
--x[i];
v[x[i]].pb({y[i],z[i]});
}
ll ans=0;
ll dp[(1LL<<n)+1][n+1];
memset(dp,0,sizeof(dp));
for(ll i=0;i<n;i++){
for(ll j=1;j<(1LL<<n);j++){
ll cnt=__builtin_popcountll(j);
if(cnt!=i+1)
continue;
bool f=true;
for(auto each:v[i]){
ll lim=each.ff;
ll cur=j%(1LL<<lim);
ll cnt_now=__builtin_popcountll(cur);
if(cnt_now>each.ss){
f=false;
break;
}
}
if(f==false){
continue;
}
//// cout<<j<<" "<<i<<endl;
for(ll k=0;k<n;k++){
if(j&(1LL<<k)){
ll prev_pot=j^(1LL<<k);
if(i)
dp[j][i]+=dp[prev_pot][i-1];
else
dp[j][i]+=1;
}
}
}
}
// cout<<dp[0][1]<<endl;
ans=dp[(1LL<<n)-1][n-1];
cout<<ans<<endl;
}
int main()
{ ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//Start from Here.
fac[0]=1;
for(ll i=1;i<N;i++)
fac[i]=(i*fac[i-1]);
ll t;
t=1;
// cin>>t;
while(t--)
solve();
//Good Bye!
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for (int i=0; i<n; i++)
#define all(vec) vec.begin(), vec.end()
#define pcnt __builtin_popcount
int main() {
int N,M;
cin >> N >> M;
vector<vector<P>> ps(N+1);
rep(i, M) {
int x,y,z;
cin >> x >> y >> z;
ps[x].emplace_back(y,z);
}
int N2 = 1<<N;
vector<ll> dp(N2);
dp[0] = 1;
vector<int> mask(N+1);
rep(i,N) mask[i+1] = mask[i]<<1|1;
rep(s,N2) {
int c = pcnt(s);
for (P p : ps[c]) {
if (pcnt(s&mask[p.first]) > p.second) dp[s] = 0;
}
rep(j,N) if (~s>>j&1) {
dp[s|1<<j] += dp[s];
}
}
cout << dp.back() << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#define ll long long int
#define inf 1000000000000
#define mod 1000000007
#define tc(t) int t; cin >> t; while (t--)
#define all(v) v.begin(),v.end()
#define sz(x) (int)x.size()
#define F first
#define S second
#define ps(x,y) fixed<<setprecision(y)<<x
using namespace std;
struct segtree {
vector<int> node;
int size;
void init(int n) {
size = 1;
while (size < n)size *= 2;
node.assign(2 * size, 0ll);
}
void build(vector<int>&a , int x, int lx, int rx) {
if (rx - lx == 1) {
if (lx < (int)a.size()) {
node[x] = a[lx];
}
return;
}
int m = (lx + rx) / 2;
build(a, 2 * x + 1, lx, m);
build(a, 2 * x + 2, m, rx);
node[x] = node[2 * x + 1] + node[2 * x + 2];
}
void build(vector<int>&a) {
build(a, 0, 0, size);
}
void set(int i, int v, int x, int lx, int rx)
{
if (rx - lx == 1) {
node[x] = v;
return;
}
int m = (lx + rx) / 2;
if (i < m) {
set(i, v, 2 * x + 1, lx, m);
}
else {
set(i, v, 2 * x + 2, m, rx);
}
node[x] = node[2 * x + 1] + node[2 * x + 2];
}
void set(int i, int v) {
set(i, v, 0, 0, size);
}
int get(int l, int r, int x, int lx, int rx) {
if (lx >= r || l >= rx)return 0;
if (lx >= l && rx <= r )return node[x];
int m = (lx + rx) / 2;
int s1 = get(l, r, 2 * x + 1, lx, m);
int s2 = get(l, r, 2 * x + 2, m, rx);
return (s1 + s2);
}
int get(int r) {
return get(0, r, 0, 0, size);
}
};
void solve()
{
int h, w, m;
cin >> h >> w >> m;
vector<pair<int, int>>obstacles(m);
vector<vector<int>>by_row(h), by_col(w);
segtree blocked_row;
blocked_row.init(h + 2);
for (int i = 0; i < m; i++) {
cin >> obstacles[i].F >> obstacles[i].S;
}
sort(all(obstacles));
for (auto [x, y] : obstacles) {
--x, --y;
by_row[x].push_back(y);
by_col[y].push_back(x);
}
for (int x = 0; x < h; x++) {
by_row[x].push_back(w);
}
for (int y = 0; y < w; y++) {
by_col[y].push_back(h);
}
int reachable_rows = by_col[0][0];
int reachable_cols = by_row[0][0];
ll ans = 0;
for (int x = 0; x < reachable_rows; x++) {
ans += by_row[x][0];
}
for (int y = 1; y < reachable_cols; y++) {
int height = by_col[y][0];
ans += max(0LL, height * 1LL - reachable_rows * 1LL);
ans += blocked_row.get(min(height, reachable_rows));
for (auto x : by_col[y]) {
blocked_row.set(x, 1);
}
}
cout << ans << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template<typename T> void setmax(T& x, T y) {x = max(x, y);}
template<typename T> void setmin(T& x, T y) {x = min(x, y);}
const double PI = acos(-1.0);
const int INF = 1e9 + 47;
const LL LINF = 1LL * INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
VI g[1 << 19];
int cnt[1 << 19];
int u[1 << 19];
int m = 0;
int us = 0;
void dfs(int v)
{
m += SZ(g[v]);
u[v] = 1;
us++;
for(int to : g[v])
if(!u[to])
dfs(to);
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
VI a(n), b(n);
FOR(i, 0, n)
{
cin >> a[i] >> b[i];
cnt[a[i]]++;
cnt[b[i]]++;
g[a[i]].PB(b[i]);
g[b[i]].PB(a[i]);
}
int ans = 0;
FOR(i, 1, 400001)
if(cnt[i] && !u[i])
{
m = 0;
us = 0;
dfs(i);
m /= 2;
ans += min(m, us);
}
cout << ans << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
int main(void){
// Your code here!
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin >> a >> b;
cout << (abs(a-b)<3 ? "Yes" : "No");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int sum(int a)
{
int ans =0;
while(a)
{
ans+=a%10;
a/=10;
}
return ans;
}
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin>>a>>b;
cout<<max(sum(a),sum(b))<<endl;
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=5e5+500;
ll inf=1e18;
int gti(void)
{
char c=getchar();
int ret=0,st=1;
for (;c!='-'&&!isdigit(c);c=getchar());
if (c=='-') st=-1,c=getchar();
for (;isdigit(c);c=getchar()) ret=ret*10+c-'0';
return ret*st;
}
struct edge{edge *nxt;int to;ll len;}pool[N],*pt[N],*p=pool;
void addedge(int a,int b,int l)
{
*(++p)=(edge){pt[a],b,l},pt[a]=p;
}
struct P
{
int id;
ll dis;
bool operator<(const P &b)const
{
return dis>b.dis;
}
};
priority_queue<P> hp;
ll dis[N];
void dijkstra(int v,int n)
{
for (int i=1;i<=n;i++) dis[i]=inf;
for (edge *i=pt[v];i;i=i->nxt)
{
dis[i->to]=min(dis[i->to],i->len);
hp.push((P){i->to,dis[i->to]});
}
P now;
for (int i=1;i<=n*2;i++)
{
if (hp.size()==0) break;
for (now=hp.top(),hp.pop();hp.size()&&dis[now.id]!=now.dis;)
now=hp.top(),hp.pop();
if (dis[now.id]!=now.dis) break;
for (edge *i=pt[now.id];i;i=i->nxt)
if (dis[i->to]>dis[now.id]+i->len)
{
dis[i->to]=dis[now.id]+i->len;
hp.push((P){i->to,dis[i->to]});
}
}
if (dis[v]>=inf) puts("-1");
else printf("%lld\n",dis[v]);
}
int main(void)
{
int n=gti(),m=gti();
for (int i=1;i<=m;i++)
{
int u=gti(),v=gti(),w=gti();
addedge(u,v,w);
}
for (int i=1;i<=n;i++)
dijkstra(i,n);
return 0;
}
| #pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (ll i = s; i < t; ++i)
#define rng(a) a.begiGn(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using P = pair<ll, ll>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VP = vector<P>;
using VS = vector<string>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
#define MOD 1000000007
// #define MOD 998244353
const int INF = (int)1e9 + 10; // int max > 2*10^9
const long long INFL = (ll)2e18 + 10; // ll max > 9*10^18
template <class T, class C>
bool chmax(T& a, C b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class C>
bool chmin(T& a, C b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
T sum(const vector<T>& v) {
T res = 0;
for (size_t i = 0; i < v.size(); ++i) res += v[i];
return res;
}
/////////////////////////////////////////////////////////
// print like python
// https://qiita.com/Lily0727K/items/06cb1d6da8a436369eed
/////////////////////////////////////////////////////////
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T>& vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
}
template <class T>
void print(vector<vector<T>>& df) {
for (auto& vec : df) {
print(vec);
}
}
#pragma endregion Region_1
/////////////////////////////////////////////////////////
struct mint {
ll x; // typedef long long ll;
int mod;
mint(ll x = 0, int mod = MOD) : x((x % mod + mod) % 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;
}
// x^t
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;
}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
using VMI = vector<mint>;
using VVMI = vector<vector<mint>>;
mint calc_cmb(int n, int m) {
if (n - m < m) m = n - m;
mint x = 1;
mint d = 1;
for (int i = 0; i < m; ++i) {
x *= (n - i);
d *= (i + 1);
}
return x / d;
}
int main() {
std::cout << std::setprecision(15);
//////////////////////////////////////////
ll n, m, k;
cin >> n >> m >> k;
if (n > m + k) {
print(0);
return 0;
}
mint a = calc_cmb((n + m), m);
mint b = calc_cmb((n + m), m + k + 1);
if (k + 1 > n) b = mint(0);
print((a - b).x);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define PB push_back
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
const int INF = INT_MAX;
const int mod = 1e9 + 7;
int main()
{
FAST;
int n;
cin >> n;
int it = 0;
int a[n + 5];
map<int, int> m;
for(int i = 0; i < n; i ++){
cin >> a[i];
}
for(int i = 0 ; i < n; i ++){
m[a[i]] = 1;
for(int j = it; j < 200002; j ++){
if(! m[j]){
cout << j << endl;;
it = j;
break;
}
}
}
return 0;
} | #define _DEBUG
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const ll INF=1e+18;
const int MOD=1e+9+7;
//デバッグ
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug1(x1) cout<<#x1<<": "<<x1<<endl
#define debug2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef _DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug5,debug4,debug3,debug2,debug1,~))(__VA_ARGS__)
#else
#define debug(...)
#endif
//REPマクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
// 多次元 vector 生成
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
//vectorの扱い
#define ALL(x) (x).begin(),(x).end() //sortなどの引数省略
#define SIZE(x) ((ll)(x).size()) //size
#define MAX(x) *max_element(ALL(x)) //最大値
#define MIN(x) *min_element(ALL(x)) //最小値
//省略
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(){
ll N;
cin>>N;
vl p(N);
set<ll> st;
REP(i,200010){
st.insert(i);
}
REP(i,N){
cin>>p[i];
}
REP(i,N){
st.erase(p[i]);
cout<<*st.begin()<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e, p) for (ll i = (ll)s; i < (ll)e; i += p)
#define ALL(vec) vec.begin(), vec.end()
int main(){
int n;
cin >> n;
vector<ll> a(n), b(n);
rep (i, 0, n, 1){
cin >> a[i];
}
rep (i, 0, n, 1){
cin >> b[i];
}
ll m = 0, ma = 0;
rep (i, 0, n, 1){
ma = max(ma, a[i]);
m = max(m, ma * b[i]);
cout << m << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}
#define bitUP(x,a) ((x>>a)&1)
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};
long double EPS = 1e-6;
long double PI = acos(-1);
const ll INF=(1LL<<62);
const int MAX=(1<<30);
constexpr ll MOD=1000000000+7;
inline void bin101(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
using pii=pair<int,int>;
using pil=pair<int,ll>;
using pli=pair<ll,int>;
using pll=pair<ll,ll>;
using psi=pair<string,int>;
using pis=pair<int,string>;
using psl=pair<string,ll>;
using pls=pair<ll,string>;
using pss=pair<string,string>;
using Graph=vector<vector<int>>;
template<typename T >
struct edge {
int to;
T cost;
edge()=default;
edge(int to, T cost) : to(to), cost(cost) {}
};
template<typename T>
using WeightGraph=vector<vector<edge<T>>>;
//1-indexed vector cin
template<typename T>
inline void vin1(vector<T> &v){
for(size_t i=1;i<v.size();i++) cin>>v[i];
}
//0-indexed vector cin
template<typename T>
inline void vin0(vector<T> &v){
for(size_t i=0;i<v.size();i++) cin>>v[i];
}
//1-indexed vector<vector> cin
template<typename T>
inline void vin1(vector<vector<T>> &v){
for(size_t i=1;i<v.size();i++){
for(size_t j=1;j<v[i].size();j++) cin>>v[i][j];
}
}
//0-indexed vector<vector> cin
template<typename T>
inline void vin0(vector<vector<T>> &v){
for(size_t i=0;i<v.size();i++){
for(size_t j=0;j<v[i].size();j++) cin>>v[i][j];
}
}
//要素数n 初期値x
template<typename T>
inline vector<T> vmake(size_t n,T x){
return vector<T>(n,x);
}
//a,b,c,x data[a][b][c] 初期値x
template<typename... Args>
auto vmake(size_t n,Args... args){
auto v=vmake(args...);
return vector<decltype(v)>(n,move(v));
}
//pair cout
template<typename T, typename U>
inline ostream &operator<<(ostream &os,const pair<T,U> &p) {
os<<p.first<<" "<<p.second;
return os;
}
//pair cin
template<typename T, typename U>
inline istream &operator>>(istream &is,pair<T,U> &p) {
is>>p.first>>p.second;
return is;
}
//ソート
template<typename T>
inline void vsort(vector<T> &v){
sort(v.begin(),v.end());
}
//逆順ソート
template<typename T>
inline void rvsort(vector<T> &v){
sort(v.rbegin(),v.rend());
}
//1ビットの数を返す
inline int popcount(int x){
return __builtin_popcount(x);
}
//1ビットの数を返す
inline int popcount(ll x){
return __builtin_popcountll(x);
}
void solve(){
int N;
cin>>N;
vector<ll> a(N),b(N);
vin0(a);
vin0(b);
ll max_a=-1;
ll max_b=-1;
for(int i=0;i<N;i++){
chmax(max_a,a[i]);
b[i]*=max_a;
chmax(max_b,b[i]);
chmax(b[i],max_b);
}
for(int i=0;i<N;i++){
cout<<b[i]<<"\n";
}
}
int main(){
bin101();
int T=1;
//cin>>T;
while(T--) solve();
}
|
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
void perr0(){}; template<typename H,typename... T> void perr0(H h,T... t){cerr<<fixed<<setprecision(10)<<h;perr0(t...);}
void perr(){perr0("\n");}; template<typename H,typename... T>void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);}
void ioinit() { cout << fixed << setprecision(15); ios_base::sync_with_stdio(0); cin.tie(0); }
// clang-format on
#ifdef ONLINE_JUDGE
void dbg(vector<ll> &p, ll j) {}
#else
void dbg(vector<ll> &p, ll j) {
ll n = p.size() - 1;
for (ll i = 1; i <= n; i++) {
perr0(p[i], " ");
}
if (j > 0) {
perr("!", j, "!");
} else {
perr();
}
}
#endif
void output(vector<ll> &ops) {
ll m = ops.size();
print(m);
for (ll i = 0; i < m; i++) {
if (i > 0) print0(" ");
print0(ops[i]);
}
print();
}
void op(vector<ll> &ops, vector<ll> &p, bool &even, ll i) {
// perr(i);
swap(p[i], p[i + 1]);
ops.push_back(i);
even = !even;
dbg(p, i);
}
void solve3(ll n, vector<ll> &p, bool even0, vector<ll> &ops) {
bool even = even0;
while (true) {
if (p[1] == 1 && p[2] == 2 && p[3] == 3) {
break;
}
if (even) {
op(ops, p, even, 2);
} else {
op(ops, p, even, 1);
}
}
}
void solve() {
ll n;
cin >> n;
vector<ll> p(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> p[i];
}
if (n == 2) {
vector<ll> ops2;
if (p[1] == 2) {
ops2.push_back(1);
}
output(ops2);
return;
}
vector<ll> ops;
ll searchval = n;
bool even = false;
while (true) {
if (searchval == 3) {
solve3(3, p, even, ops);
break;
}
ll searchi = -1;
for (ll i = 1; i <= n; i++) {
if (p[i] == searchval) {
searchi = i;
break;
}
}
if (searchi == searchval) {
searchval--;
continue;
}
bool cureven = (searchi % 2 == 0);
if (cureven && !even) {
if (searchi == 2) {
op(ops, p, even, 1);
op(ops, p, even, 2);
searchi = 1;
} else {
op(ops, p, even, 1);
}
} else if (!cureven && even) {
if (searchi == 3) {
op(ops, p, even, 2);
op(ops, p, even, 1);
op(ops, p, even, 2);
searchi = 1;
} else {
op(ops, p, even, 2);
}
}
for (ll i = searchi;; i++) {
if (i >= searchval) break;
op(ops, p, even, i);
}
searchval--;
}
output(ops);
}
int main() {
ioinit();
ll t;
cin >> t;
while (t--) {
solve();
}
}
| /* bimillahir rahmanir rahim...
* AUTHOR
* mubin_akib */
#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 REP(i, a, b) for(int i = a; i <= (b); ++i)
#define trav(a,x) for(auto& a : x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
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 = 1e9 + 7;
const char nl = '\n';
void solve(){
int n;
cin >> n;
vi v(n), w(n);
F0R(i, n){
cin >> v[i];
}
F0R(i, n){
cin >> w[i];
}
int ans = 0;
F0R(i, n){
ans += (v[i] * w[i]);
}
if(ans == 0){
cout << "Yes" << nl;
}
else{
cout << "No" << nl;
}
}
int main() {
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
#define tc int t; cin>>t; while(t--)
#define shweta ios_base::sync_with_stdio(false); cin.tie(NULL);
#define fl for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define MOD 1000000007
#define MAX_SIZE 100005
#define loop(i,a,b) for(int i=a;i<=b;i++)
#define looprev(i,b,a) for(int i=b;i>=a;i--)
#define inf 1e17
// char adj[1001][1001];
// int vis[1001][1001];
// vector<char> finalstring;
// bool bfound = false;
// int dx[] = {0, -1, 1, 0};
// int dy[] = {1, 0, 0, -1};
// string path = "RUDL";
// int N, M;
// int x1 = 0, y1 = 0;
// void bfs(int srcX, int srcY)
// {
// queue<pair<int, int>> q;
// q.push({srcX, srcY});
// vis[srcX][srcY] = 1;
// while (!q.empty())
// {
// int currX = q.front().first;
// int currY = q.front().second;
// vis[currX][currY]=1;
// q.pop();
// // cout<<currX<<" "<<currY<<endl;
// for (int i = 0; i < 4; i++)
// { int newX = currX + dx[i];
// int newY = currY + dy[i];
// if (newX < 1 || newX > N || newY < 1 || newY > M)continue;
// if (adj[newX][newY] == '#' || vis[newX][newY] == 1)continue;
// if (adj[newX][newY] == '.')
// {
// q.push({newX, newY});
// vis[newX][newY] = 1;
// }
// cout<<newX<<" "<<newY<<" "<<adj[newX][newY]<<" "<<vis[newX][newY]<<endl;
// if (adj[newX][newY] == 'B')
// {
// x1 = newX;
// y1 = newY;
// vis[newX][newY] = 1;
// bfound = true;
// break;
// }
// }
// if(bfound)
// {
// break;
// }
// }
// }
// signed main()
// {
// cin >> N >> M;
// int corax, coray;
// for (int i = 1; i <= N; i++)
// {
// for (int j = 1; j <= M; j++)
// {
// cin >> adj[i][j];
// if (adj[i][j] == 'A')
// {
// corax = i;
// coray = j;
// }
// }
// }
// for (int i = 1; i <= N; i++)
// {
// for (int j = 1; j <= M; j++)
// {
// vis[i][j]=0;
// }
// }
// bfs(corax, coray);
// if (bfound == false)
// {
// cout << "NO\n";
// }
// else
// {
// while (1)
// {
// int a = x1;
// int b = y1;
// finalstring.pb(path[vis[x1][y1]]);
// x1 = x1 - dx[vis[a][b]];
// y1 = y1 - dy[vis[a][b]];
// if (x1 == corax && y1 == coray)
// break;
// }
// cout << "YES\n" << finalstring.size() << endl;
// // for(int i=finalstring.size()-1;i>=0;i)
// reverse(finalstring.begin(), finalstring.end());
// for (auto it : finalstring)
// {
// cout << it;
// }
// }
// }
signed main()
{
ll n;
cin>>n;
// cout<<n<<endl;
map <ll,ll> ansh;
map <ll,ll> ::iterator itr;
for(ll i=0;i<n;i++){
ll a;
cin>>a;
ansh[a]++;
}
ll ans=((n)*(n-1))/2;
// cout<<ans<<endl;
itr=ansh.begin();
while(itr!=ansh.end()){
ans-=((itr->second)*(itr->second-1))/2;
itr++;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll arr[n];
map<ll,ll> m;
for(ll i =0 ;i<n;i++){
cin>>arr[i];
m[arr[i]]++;
}
ll ans = 0;
for(ll i =0 ;i<n;i++){
ans += (n-i-m[arr[i]]);
if(m[arr[i]]>0)m[arr[i]]--;
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
cin >> n;
char digits[19];
sprintf(digits, "%lld", n);
int len = strlen(digits);
int lim = 1 << len;
int ans = INT_MAX;
for (int i = 1; i <= lim; ++i) {
int cur = 0, cnt = len;
for (int j = 0; j < len; ++j) {
if ((i >> j) & 1) {
cur += digits[j] - '0';
cnt--;
}
}
if (cur % 3 == 0) ans = min(ans, cnt);
}
if (ans == len)
cout << -1 << endl;
else
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repd(i, n) for(int i = 0; i <= (n); ++i)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
using Pll = pair<long long, long long>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
ll ans = 0;
rep(j, n) {
ans += j-mp[a[j]];
mp[a[j]]++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a[5];
ll sum=0;
while(cin>>a[1]>>a[2]>>a[3]>>a[4])
{
sum=a[1]+a[2]+a[3]+a[4];
int flag=0;
for(int i=1;i<=4;i++)
{
if(sum-a[i]==a[i])
{
flag=1;
break;
}
}
if(!flag)
{
for(int i=1;i<=3;i++)
{
for(int j=i+1;j<=4;j++)
{
if(sum-a[i]-a[j]==a[i]+a[j])
{
flag=1;
break;
}
}
if(flag==1)break;
}
}
if(flag)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
namespace atcoder {}
using namespace atcoder;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> bool chmin(T1 &l, const T2 &r);
template <class T1, class T2> bool chmax(T1 &l, const T2 &r);
template <class T1, class T2> void vadd(vector<T1> &v, T2 x);
#define int long long int
void solve(long long A, long long B, long long C, long long D) {
int c[4] = {A, B, C, D};
int sm = A + B + C + D;
rep(i, 1 << 4) {
int tmp = 0;
rep(j, 4) {
if ((i >> j) & 1) {
tmp += c[j];
}
}
if (tmp * 2 == sm) {
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
}
signed main() {
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
solve(A, B, C, D);
return 0;
}
// -- lib
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2> bool chmin(T1 &l, const T2 &r) {
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2> bool chmax(T1 &l, const T2 &r) {
return (l < r) ? (l = r, true) : false;
}
template <class T1, class T2> void vadd(vector<T1> &v, T2 x) {
for (auto &s : v)
s += T2(x);
}
|
// atcoder/arc105/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }
template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }
using lli = long long int;
using ull = unsigned long long;
using point = complex<double>;
using str = string;
template<typename T> using vec = vector<T>;
constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});
constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});
constexpr lli mod = 1e9 + 7;
int main(int argc, char *argv[])
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios_base::fixed);
cout.precision(15);
int n, m;
while (cin >> n >> m) {
vec<lli> w(n);
cin >> w;
vec<pair<lli, lli>> v(m);
cin >> v;
{
int mx = *max_element(w.begin(), w.end());
bool f = true;
each (i, v) f = f && (mx <= i.second);
unless (f) {
cout << -1 << endl;
continue;
}
}
const int N = 10;
const lli inf = 1LL << 60;
lli mn = inf;
sort(v.begin(), v.end(), [] (auto a, auto b) {
if (a.second != b.second) return a.second < b.second;
return a.first > b.first;
});
const int M = 1e5 + 5;
static lli mx[M];
fill(mx, mx + M, inf);
vec<lli> u;
for (int i = 0; i < m; ++i) {
u.push_back(v[i].second);
mx[i] = v[i].first;
if (i) {
setmax(mx[i], mx[i - 1]);
}
}
sort(w.begin(), w.end());
do {
static lli g[N][N];
fill(&g[0][0], &g[N - 1][N - 1] + 1, 0);
for (int i = 0; i < n; ++i) {
int sum = 0;
for (int j = i; j < n; ++j) {
sum += w[j];
auto itr = lower_bound(u.begin(), u.end(), sum);
if (itr != u.begin()) {
--itr;
setmax<lli>(g[i][j], mx[itr - u.begin()]);
}
}
}
// if (w == vec<lli>({1, 2, 4})) {
// for (int i = 0; i < n; ++i) {
// for (int j = 0; j < n; ++j) {
// cout << g[i][j] << ' ';
// }
// cout << endl;
// }
// }
static lli dp[N];
fill(dp, dp + N, -inf);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
setmax(dp[j], dp[i] + g[i][j]);
}
}
setmin(mn, dp[n - 1]);
} while (next_permutation(w.begin(), w.end()));
cout << mn << endl;
}
return 0;
}
| #include<iostream>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define int long long
using namespace std;
int c[502][502],a[502],b[502];
signed main(){
ios::sync_with_stdio(false);
int n; cin>>n;
rep(i,1,n)rep(j,1,n)cin>>c[i][j];
bool flag=true;
rep(i,1,n){rep(j,2,n){
if(i==1)a[j]=c[i][j]-c[i][j-1];
else if(a[j]!=c[i][j]-c[i][j-1]){flag=false;break;}
}if(!flag)break;}
if(!flag){cout<<"No\n";return 0;}
rep(j,1,n){rep(i,2,n){
if(j==1)b[i]=c[i][j]-c[i-1][j];
else if(b[i]!=c[i][j]-c[i-1][j]){flag=false;break;}
}if(!flag)break;}
if(!flag){cout<<"No\n";return 0;}
int mna=0,mnb=0;
rep(i,1,n){
a[i]+=a[i-1],b[i]+=b[i-1];
mna=min(mna,a[i]),mnb=min(mnb,b[i]);
}
//cout<<mna<<" "<<mnb<<endl;
if(c[1][1]+mna+mnb<0){cout<<"No\n";return 0;}
int ada=-mna,adb=c[1][1]-ada;
cout<<"Yes\n";
rep(i,1,n)cout<<b[i]+adb<<" ";
cout<<endl;
rep(i,1,n)cout<<a[i]+ada<<" ";
cout<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k;
cin >> n >> k;
while (k--) {
if (n % 200 == 0) {
n /= 200;
} else {
n = 1000 * n + 200;
}
}
cout << n << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr)
{
os << '{';
string sep;
for (const auto &x : arr)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V)
{
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, set<T> S)
{
os << "{ ";
for (auto s : S)
os << s << " ";
return os << "}";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) { return os << "(" << P.first << "," << P.second << ")"; }
template <class L, class R>
ostream &operator<<(ostream &os, map<L, R> M)
{
os << "{ ";
for (auto m : M)
os << "(" << m.first << ":" << m.second << ") ";
return os << "}";
}
#ifdef LMAO
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1)
{
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args)
{
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...) 42
#endif
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define tcase \
int tt; \
cin >> tt; \
while (tt--)
#define tcase2 \
int tt; \
cin >> tt; \
for (int qq = 1; qq <= tt; qq++)
#define all(x) x.begin(), x.end()
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
const int MAX = 1000010;
const int MOD2 = 998244353;
const int MOD = 1000000007;
const int INF = 1e8;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ld EPS = 1e-7;
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define forne(i, a, b) for (int i = a; i <= b; i++)
/*****************start************/
#define int ll
int op(int x)
{
if (x % 200)
{
return x * 1000ll + 200ll;
}
else
{
return x / 200;
}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(25);
cerr << fixed << setprecision(10);
int n,k;
cin>>n>>k;
for(int i=1;i<=k;i++)
{
n=op(n);
}
cout<<n<<endl;
return 0;
}
|
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip>
#include <stdio.h>
//end of libraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <int,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
const int max_n = 550;
using namespace std;
int n;
int c[max_n][max_n];
int a[max_n] , b[max_n];
int main(){
fcin;
cin >> n;
rep(i,n) {
rep(j,n) {
cin >> c[i][j];
}
}
a[0] = 0;
int can = 1 , mn = 0;
rep(i,n) {
int cur = 0;
rep(j,n) {
if(i == 0) b[j] = c[i][j];
else {
if(j == 0) cur = c[i][j]-b[j];
else {
if(cur != c[i][j] - b[j]) can = 0;
}
if(cur<0)mn=max(mn,abs(cur));
}
}
}
a[0] = mn;
rep(i,n) {
rep(j,n) {
if(i==0) b[j] = c[i][j] - a[i];
else {
a[i] = c[i][j] - b[j];
}
}
}
rep(i,n) {if(a[i]<0) can = 0;}
rep(i,n) {if(b[i]<0) can = 0;}
if(can==0){
cout << "No\n";
}else {
cout << "Yes\n";
rep(i,n) {
cout << a[i];
if(i+1<n) cout << " ";
}
cout << "\n";
rep(i,n) {
cout << b[i];
if(i+1<n) cout << " ";
}
}
/*
*/
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using ll = long long;
using lint = long long;
typedef vector<long long> vint;
typedef pair<long long, long long> pint;
#define INF INT32_MAX / 2
#define INF64 INT64_MAX / 2
#define EPS 0.001
#define EPS14 1.0E-14
#define REP(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(std::begin(cccc), std::end(cccc), ## __VA_ARGS__); })(c))
#define c(n) cout<<n<<endl;
#define cf(n) cout<<fixed<<setprecision(15)<<n<<endl;
template <class T>inline bool chmin(T&a,T b) {if(a>b){a=b;return true;}return false;}
template <class T>inline bool chmax(T&a,T b) {if(a<b){a=b;return true;}return false;}
template<class T>inline T sum(T n){return n*(n+1)/2;}
map<ll,ll> prime_fac(ll A) {map<ll,ll>mp;for(ll i=2;i*i<=A;i++){while(A%i== 0){mp[i]++;A/=i;}}if(A!=1){mp[A]=1;}return mp;}
bool is_prime(ll N){if(N<=1)return false;for(ll i=2;i*i<=N;i++){if(N%i==0) return false;}return true;}
template<class T>inline T myceil(T a,T b){return (a+(b-1))/b;}
ll pw(ll x, ll n){ll ret=1;while(n>0){if(n&1){ret*=x;}x *= x;n >>= 1;}return ret;}
bool is_product_overflow(long long a,long long b) {long prod=a*b;return (prod/b!=a);}
const string YES = "Yes";
const string NO = "No";
void solve(long long N, std::vector<std::vector<long long>> C){
vector<vector<ll>> ans(2, vector<ll>(N, 0));
ans[0][0] = C[0][0];
ans[1][0] = 0;
for (int i = 1; i < N; i++) {
ans[0][i] = C[i][0] - 0;
}
ll min = 0;
for (int i = 1; i < N; i++) {
ans[1][i] = C[0][i] - C[0][0];
chmin(min, ans[1][i]);
}
if (min < 0) {
for (int i = 0; i < N; i++) {
ans[0][i] -= -min;
}
for (int i = 0; i < N; i++) {
ans[1][i] += -min;
}
}
REP (i, N) {
REP (j, N) {
if (ans[0][i] + ans[1][j] != C[i][j]) {
c(NO)
return;
}
}
}
c(YES)
REP (i, N) {
cout << ans[0][i] << " ";
}
cout << endl;
REP (i, N) {
cout << ans[1][i] << " ";
}
cout << endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<std::vector<long long>> C(N, std::vector<long long>(N));
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < N ; j++){
scanf("%lld",&C[i][j]);
}
}
solve(N, std::move(C));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int k = *max_element(a,a+n);
int H[k]={0};
for(int i=0;i<n;i++){
++H[a[i]];
}
int f=0;
for(int i=0;i<k;i++){
if(H[i]>1){
f=1;
i=k+1;
}
}
if(f==0){
cout<<"Yes"<<"\n";
}
else if(f==1){
cout<<"No"<<"\n";
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
void output(vector<int> &a){
cout << a.size();
for(auto &nx : a){
cout << ' ' << nx;
}
cout << '\n';
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(auto &nx : a){cin >> nx;}
vector<vector<int>> bk(200,vector<int>(0));
int cnt=min(n,8);
for(int i=1;i<(1<<cnt);i++){
int sig=0;
vector<int> s;
for(int j=0;j<cnt;j++){
if(i&(1<<j)){
s.push_back(j+1);
sig+=a[j];sig%=200;
}
}
if(bk[sig].size()!=0){
cout << "Yes\n";
output(bk[sig]);
output(s);
return 0;
}
else{bk[sig]=s;}
}
cout << "No\n";
return 0;
}
|
#include <cstdio>
#define N 400010
#define mo 3
#define ll long long
#define fo(x, a, b) for (int x = (a); x <= (b); x++)
#define fd(x, a, b) for (int x = (a); x >= (b); x--)
using namespace std;
int n, a[N]; char s[N];
ll ans = 0;
ll ksm(ll x, int y) {
ll s = 1;
while (y) {
if (y & 1) s = s * x % mo;
x = x * x % mo, y >>= 1;
}
return s;
}
ll C(int x, int y) {
if (x > y) return 0;
ll res = 1;
fo(i, x + 1, y) res = res * i;
fo(i, 1, y - x) res = res * ksm(i, mo - 2);
return res % mo;
}
ll Lucas(int x, int y) {
if (x < mo && y < mo) return C(x, y);
else return Lucas(x / mo, y / mo) * C(x % mo, y % mo) % mo;
}
int main() {
scanf("%d%s", &n, s + 1);
fo(i, 1, n)
if (s[i] == 'R') a[i] = 0;
else if (s[i] == 'W') a[i] = 1;
else a[i] = 2;
fo(i, 1, n)
ans = (ans + Lucas(i - 1, n - 1) * a[i]) % 3;
if (n % 2 == 0) ans = -ans;
ans = (ans % 3 + 3) % 3;
if (ans == 0) printf("R\n");
else if (ans == 1) printf("W\n");
else printf("B\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void debug_out(){
cerr << endl;
}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef local
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
#else
#define debug(...) 55
#endif
const int N = 10005;
char s[N];
int a[N], b[N], c[N], n;
int ok(int k){
for(int i = 1; i <= n; i++) b[i] = a[i] / k, c[i] = a[i] % k;
for(int i = 1; i < n; i++){
int x = b[i], y = b[i + 1];
if(x == y) return 0;
if(x == y - 1 && c[i] > c[i + 1]) return 0;
if(x == y + 1 && c[i] < c[i + 1]) return 0;
}
return 1;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int ans = 0;
cin >> n;
n++;
cin >> s + 1;
int mn = 1e9;
for(int i = 1; i <= n; i++) cin >> a[i], mn = min(mn, a[i]);
for(int i = 1; i <= 10000; i++){
if(ok(i)) ans = max(ans, i);
}
cout << ans << '\n';
for(int i = 1; i <= ans; i++){
for(int j = 1; j <= n; j++){
int x = a[j] / ans, y = a[j] % ans;
if(i <= y) x++;
cout << x << ' ';
}
cout << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int i;
cin>>s;
s[3]=s[0];
for(i=1;i<4;i++)
{
cout<<s[i];
}
cout<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <bitset>
using namespace std;
int main(void) {
int price;
// input
cin >> price;
int p = price * 1.08;
if (206 > p) {
cout << "Yay!" << endl;
} else if(206 == p){
cout << "so-so" << endl;
}else{
cout << ":(" << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define FOR(i,f,n) for(int i=f;i<n;i++)
#define FORI(i,f,n) for(int i=f;i>=n;i--)
#define sz(a) ((int)(a).size())
#define ff first
#define ss second
#define all(a) (a).begin(),(a).end()
#define alli(a) (a).rbegin(),(a).rend()
#define approx(a) fixed<<setprecision(a)
#define trav(a,x) for(auto& a : x)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,bool> pib;
typedef pair<ll,bool> plb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T> void ckmin(T &a, const T &b) { a = min(a, b); }
template <class T> void ckmax(T &a, const T &b) { a = max(a, b); }
template <class T> void read(vector<T> &v);
template <class F, class S> void read(pair<F, S> &p);
template <class T> void read(T &x) {cin>>x;}
template <class R, class... T> void read(R& r, T&... t){read(r); read(t...);};
template <class T> void read(vector<T> &v) {trav(x, v) read(x);}
template <class F, class S> void read(pair<F, S> &p) {read(p.ff, p.ss);}
template <class F, class S> void pr(const pair<F, S> &x);
template <class T> void pr(const T &x) {cout<<x;}
template <class R, class... T> void pr(const R& r, const T&... t) {pr(r); pr(t...);}
template <class F, class S> void pr(const pair<F, S> &x) {pr("{", x.ff, ", ", x.ss, "}");}
void ps() {pr("\n");}
template <class T> void ps(const T &x) {pr(x); ps();}
template <class T> void ps(vector<T> &v) {trav(x, v) pr(x, ' '); ps();}
template <class F, class S> void ps(const pair<F, S> &x) {pr(x.ff, ' ', x.ss); ps();}
template <class R, class... T> void ps(const R& r, const T &...t) {pr(r, ' '); ps(t...);}
const int MXN = 2e5+1;
vi adj[MXN], level[MXN], in(MXN), out(MXN);
int timer = 0;
void dfs(int v, int d){
in[v] = ++timer;
level[d].pb(in[v]);
for(int u : adj[v]){
dfs(u, d+1);
}
out[v] = ++timer;
}
void solve(){
int n; read(n);
FOR(i,1,n){
int x; read(x);
adj[x].pb(i+1);
}
dfs(1, 0);
int q; read(q);
FOR(i,0,q){
int u, d; read(u, d);
int ans = lower_bound(all(level[d]), out[u]) - lower_bound(all(level[d]), in[u]);
ps(ans);
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set <int>
#define sll set <ll>
#define spii set <pii>
#define vs vector <string>
#define vpii vector <pair <int, int> >
#define vpll vector <pair <long long, long long> >
#define vvi vector <vector <int> >
#define vvpii vector <vector <pii > >
#define vb vector <bool>
#define vvb vector <vb>
#define mp make_pair
#define vvll vector <vll>
#define vsi vector <si>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MANX MAXN
#define itn int
#define dbg(x); {cout << #x << "=" << x << ", ";}
#define in(x); { for (auto &to : x) cin >> to;}
#define out(x); { for (auto &to : x) cout << to << " "; cout << '\n'; }
template<class T>
bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T>
bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const ll INFLL = 1e18;
const int MAXN = 2e5 + 100;
const ll INF = 1e9;
const int mod1 = 1e9 + 7;
const int mod2 = 1e9 + 21;
vvi g;
vvi d;
int ans[MAXN];
vvpii qu;
vector<map<int, int>> mm;
void dfs(int s, int ok) {
mm[s][ok++]++;
for (auto to:g[s]) {
dfs(to, ok);
if (mm[to].size() > mm[s].size())
swap(mm[to], mm[s]);
for (auto too:mm[to])
mm[s][too.fi] += too.se;
}
for (auto to:qu[s]) {
ans[to.se] = (mm[s].find(to.fi) == mm[s].end() ? 0 : mm[s][to.fi]);
}
}
void solve() {
int n;
cin >> n;
mm = vector<map<int, int>>(n);
d = vvi(n);
g = vvi(n);
qu = vvpii(n);
for (int i = 1; i < n; i++) {
int x;
cin >> x;
x--;
g[x].pb(i);
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
x--;
qu[x].pb({y, i});
}
dfs(0, 0);
for (int i = 0; i < q; i++)
cout << ans[i] << '\n';
}
int main() {
#ifdef Mip182
freopen("a.in", "r", stdin);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
int _t;
_t = 1;
// cin>>_t;
while (_t--)
solve();
#ifdef Mip182
cout << '\n' << "Time : " << (double) (clock()) / CLOCKS_PER_SEC << '\n';
#endif
}
|
#include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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;
using namespace std;
ll n;
ll res=1e18;
void solve(vector<ll>& r,vector<ll>& g,vector<ll>& b){
rep(i,r.size()){
auto itr=lower_bound(g.begin(),g.end(),r[i]);
ll k=itr-g.begin();
if(k!=g.size())chmin(res,abs(g[k]-r[i]));
if(k!=0)chmin(res,abs(g[k-1]-r[i]));
}
priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>> > que1,que2;
rep(i,b.size()){
auto itr=lower_bound(g.begin(),g.end(),b[i]);
ll k=itr-g.begin();
ll buf3=1e18;
if(k!=g.size())buf3=abs(b[i]-g[k]);
if(k!=0){
ll buf=abs(b[i]-g[k-1]);
chmin(buf3,buf);
}
itr=lower_bound(r.begin(),r.end(),b[i]);
k=itr-r.begin();
ll buf4=1e18;
if(k!=r.size())buf4=abs(b[i]-r[k]);
if(k!=0){
ll buf=abs(b[i]-r[k-1]);
chmin(buf4,buf);
}
que1.push({buf3,i});
que2.push({buf4,i});
}
if(que1.size()==0)return;
ll buf1_1=que1.top().first;
ll buf2_1=que2.top().first;
que1.pop();que2.pop();
chmin(res,buf1_1+buf2_1);
return;
}
int main(void){
cin>>n;
vector<ll> r,g,b;
rep(i,2*n){
ll a;cin>>a;
char c;cin>>c;
if(c=='R')r.push_back(a);
if(c=='G')g.push_back(a);
if(c=='B')b.push_back(a);
}
if(r.size()%2==0&&g.size()%2==0&&b.size()%2==0){
cout<<0<<endl;
return 0;
}
sort(r.begin(),r.end());
sort(g.begin(),g.end());
sort(b.begin(),b.end());
if(b.size()%2==0){
solve(r,g,b);
}else if(r.size()%2==0){
solve(g,b,r);
}else{
solve(b,r,g);
}
cout<<res<<endl;
} | #include<bits/stdc++.h>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define vll vector<ll>
#define xfor(arr) for(auto& x : arr)
#define input(arr) xfor(arr) cin >> x;
#define output(arr) xfor(arr) cout << x << ' '; cout << '\n';
#define FOR(type,i,n) for(type i = 0; i < n; i++)
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
using namespace std;
int main(){
fastio
// int t = 0;
// cin >> t;
// while(t--){
// }
ll n;
cin >> n;
// while(!(n%10))
// n /= 10;
string s = to_string(n);
ll stop = s.length()-1;
while(s[stop] == '0')
stop--;
ll l = 0, r = stop;
while(l < r) {
if(s[l] != s[r]) {
cout << "No";
return 0;
}
l++;
r--;
}
cout << "Yes";
return 0;
} |
#include<bits/stdc++.h>
#define N 200000
#define LL long long
using namespace std;
LL a,b,c;
const LL mod=998244353;
inline LL qr()
{
char a=0;LL x=0,w=1;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}
inline LL poww(LL a,LL b)
{
if(a==0)
return 0;
LL ans=1;
LL ba=a;
while(b)
{
if(b&1)
ans=(ans*ba)%mod;
b>>=1;
ba=(ba*ba)%mod;
}
return (ans%mod+mod)%mod;
}
int main()
{
a=qr();
b=qr();
c=qr();
a=a*(a+1)%mod/**pow(2,mod-2)*/;
b=b*(b+1)%mod/**pow(2,mod-2)*/;
c=c*(c+1)%mod/**pow(2,mod-2)*/;
//cout<<a<<' '<<b<<' '<<c<<endl;
cout<<a*b%mod*c%mod*poww(8,mod-2)%mod<<endl;
return 0;
}
/*
10
1 0
2 0
3 0
4 0
10 0
*/ | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
int main () {
ios::sync_with_stdio(false); cin.tie(0);
int a, b;
cin >> a >> b;
int ans = 1;
for (int g = 2; g < b; g++) {
// a <= g * x
int l = g * ((a + g - 1) / g);
// g * y <= b
int r = g * (b / g);
if (l < r) ans = g;
}
cout << ans << '\n';
return (0);
}
|
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
struct rep {
struct itr {
usize i;
constexpr itr(const usize i) noexcept : i(i) {}
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
const itr f, l;
constexpr rep(const usize f, const usize l) noexcept
: f(std::min(f, l)), l(l) {}
constexpr auto begin() const noexcept { return f; }
constexpr auto end() const noexcept { return l; }
};
struct revrep {
struct itr {
usize i;
constexpr itr(const usize i) noexcept : i(i) {}
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
const itr f, l;
constexpr revrep(const usize f, const usize l) noexcept
: f(l - 1), l(std::min(f, l) - 1) {}
constexpr auto begin() const noexcept { return f; }
constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
if (a < b)
a = b;
}
template <class F> class rec_lambda {
F f;
public:
rec_lambda(F &&f) : f(std::move(f)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
T ret;
std::cin >> ret;
return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
return l / r + (l % r != 0 ? 1 : 0);
}
} // namespace n91
#include <set>
namespace n91 {
void solve() {
const usize n = scan<usize>();
std::vector<u32> a(n);
for (auto &e : a) {
std::cin >> e;
}
bool f_win = true;
if (n % 2 == 0) {
std::sort(a.begin(), a.end());
f_win = false;
for (const usize i : rep(0, n / 2)) {
if (a[2 * i] != a[2 * i + 1]) {
f_win = true;
}
}
} else {
f_win = false;
}
std::cout << (f_win ? "First" : "Second") << eoln;
}
void main_() {
/*
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//*/
const usize t = scan<usize>();
for (const usize i : rep(0, t)) {
solve();
}
}
} // namespace n91
int main() {
n91::main_();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[300005];
int bit[300005];
void update(int x) {
for (int i = x; i <= n; i += (i & (-i))) {
bit[i]++;
}
}
int query(int x) {
int tot = 0;
for (int i = x; i >= 1; i -= (i & (-i))) {
tot += bit[i];
}
return tot;
}
int main() {
scanf("%d", &n);
long long inv = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
a[i]++;
inv += a[i] - 1 - query(a[i]);
update(a[i]);
}
printf("%lld\n", inv);
for (int i = 0; i < n - 1; i++) {
inv -= a[i] - 1;
inv += n - a[i];
printf("%lld\n", inv);
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans=0;
for(int i=0;i<10000;i++){
vector<int> tmp(10);
int a=i/1000,b=(i-a*1000)/100,c=(i-a*1000-b*100)/10,d=i%10;
if(s[a]=='x'||s[b]=='x'||s[c]=='x'||s[d]=='x')continue;
tmp.at(a)++;tmp.at(b)++;tmp.at(c)++;tmp.at(d)++;
bool ok=true;
for(int j=0;j<10;j++){
if(s[j]=='o'&&tmp.at(j)==0)ok=false;
}
if(ok)ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (register int a = head[b]; a; a = edge[a].nxt)
inline int rd() {
int x = 0; char c = getchar(); bool f = 0;
while (c < '0' && c != '-') c = getchar();
if (c == '-') f = 1, c = getchar();
while (c >= '0') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return f ? -x : x;
}
const int SIZE = 2e5 + 100;
int n;
int head[SIZE], ecnt;
struct Edge {
int v, nxt;
} edge[SIZE << 1];
void Add_Edge (int u, int v) {
edge[++ecnt] = (Edge) { v, head[u] };
head[u] = ecnt;
}
int dep[SIZE], F[SIZE];
int mx[SIZE][2];
int Len = -1, A, B;
void dfs (int u, int fa) {
F[u] = fa;
dep[u] = dep[fa] + 1;
mx[u][0] = mx[u][1] = u;
EREP (i, u) {
int v = edge[i].v;
if (v == fa) continue;
dfs(v, u);
if (dep[mx[v][0]] > dep[mx[u][0]])
mx[u][1] = mx[u][0], mx[u][0] = mx[v][0];
else if (dep[mx[v][0]] > dep[mx[u][1]])
mx[u][1] = mx[v][0];
}
if (dep[mx[u][0]] + dep[mx[u][1]] - 2 * dep[u] > Len) {
Len = dep[mx[u][0]] + dep[mx[u][1]] - 2 * dep[u];
A = mx[u][0];
B = mx[u][1];
}
}
bool mark[SIZE];
int E;
int ans[SIZE];
void D (int u, int fa) {
++E;
ans[u] = E;
EREP (i, u) {
int v = edge[i].v;
if (v == fa) continue;
if (!mark[v]) D(v, u);
}
EREP (i, u) {
int v = edge[i].v;
if (v == fa) continue;
if (mark[v]) D(v, u);
}
++E;
}
void _main () {
n = rd();
FOR (i, 1, n) {
int u = rd(), v = rd();
Add_Edge(u, v);
Add_Edge(v, u);
}
dfs(1, 0);
int T = A;
while (A != B) {
if (dep[A] < dep[B]) swap(A, B);
mark[A] = 1;
A = F[A];
} mark[A] = 1;
D(T, 0);
REP (i, 1, n) printf ("%d ", ans[i]);
}
int main () {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
_main();
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(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
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(bool a) { cout << (a?"Yes":"No") << endl; }
void YES(bool a) { cout << (a?"YES":"NO") << endl; }
int MOD = 1e9+7;
int main(int argc, char **argv) {
int N; cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
int ans = 0;
rep(i, N) {
if (A[i] > 10) ans += A[i] - 10;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int A[N];
for(int i=0;i<N;i++){
cin >> A[i];
}
int ans=0;
for(int i=0;i<N;i++){
for(int j=A[i];j>10;j--){
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
double c;
cin >> a >> b;
c = a-b;
c = c/a;
cout << c * 100 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// #pragma GCC optimize("O2")
typedef long long int ll;
typedef long double ld;
typedef map <ll,ll> mm;
typedef vector <ll> mv;
typedef pair <ll,ll> mp;
typedef set <ll> ms;
typedef multiset <ll> mms;
typedef queue <ll> mq;
typedef deque <ll> mdq;
typedef stack <ll> mst;
typedef priority_queue <ll> mpq;
typedef priority_queue <ll, vector<ll>, greater<ll> > mmh;
typedef complex<double> cd;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define flush cout.flush();
#define all(v) v.begin(),v.end()
#define deb(x) cout << #x << " " << x << endl;
#define ff first
#define ss second
#define pb(v) push_back(v)
#define lb(v) lower_bound(v)
#define ub(v) upper_bound(v)
#define cn continue
#define forl(i,n) for(ll i=0;i<n;i++)
#define forlr(i,n) for(ll i=n-1;i>=0;i--)
#define rev(s) reverse(s.begin(),s.end())
void swap(ll &a,ll &b) {
ll tmp=a;
a=b;
b=tmp;
}
ll atoistring(string s) {
stringstream lol(s);
ll x;
lol>>x;
return x;
}
void pv(mv v) {
forl(i,v.size()) cout<<v[i]<<" ";
cout<<"\n";
}
void pa(ll *v, ll size) {
forl(i,size) cout<<v[i]<<" ";
cout<<"\n";
}
void removeDups(mv &v) {
sort(all(v));
mv::iterator it = unique(v.begin(), v.end());
v.resize(distance(v.begin(), it));
}
inline ld kthRoot(ld n, ll k) {
return pow(k, (1.0 / k) * (log(n) / log(k)));
}
ll power(ll x, ll y, ll p) {
ll res=1;
x=x%p;
while(y>0) {
if(y&1) res = (res*x)%p;
y=y>>1;
x=(x*x)%p;
}
return res;
}
void checkmod(ll &x, ll mod) {
if(x>=mod) x%=mod;
}
ll mod = 1e9 + 7;
void thisIsMain() {
ll a, b;
cin>>a>>b;
ld ans = (a - b) / (1.0 * a);
ans *= 100;
printf("%0.5Lf\n", ans);
}
int main(void)
{
fastio
ll t = 1;
// cin>>t;
while(t--) thisIsMain();
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 1000000007 //998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.begin(),v.end())
#define rev(v) if(!v.empty())reverse(v.begin(),v.end())
#define PI 3.141592653589793238
#define pqr priority_queue<ll,vector<ll>,greater<ll>()>
using namespace std;
ll pow_mod(ll a,ll b)
{
ll res=1;
while(b!=0)
{
if(b&1)
{
res=(res*a)%mod;
}
a=(a*a)%mod;
b/=2;
}
return res;
}
void solve()
{
ll n;
cin>>n;
string s[n];
for(ll i=0;i<n;i++)
cin>>s[i];
ll ans=0;
for(ll i=n-1;i>=0;i--){
if(s[i]=="OR")
{
ans+=(ll)pow(2,i+1);
}
if(i==0){
++ans;
}
}
cout<<ans<<endl;
}
int main()
{ ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//Start from Here.
ll t;
t=1;
//cin>>t;
while(t--)
solve();
//Good Bye!
return 0;
} |
// Problem : A - ReLU
// Contest : AtCoder - AtCoder Beginner Contest 183
// URL : https://atcoder.jp/contests/abc183/tasks/abc183_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#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 db double
#define mod 1000000007
#define pb push_back
#define pp pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=b;i>=a;i--)
#define maxn 200005
#define ss second
#define ff first
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int inv(int a, int b){
return 1<a ? b - inv(b%a,a)*b/a : 1;
}
int test =1;
void solve()
{
//cout << "Case #"<< test++<<": ";
int x;
cin >> x;
cout << max(x,(int)0);
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
//cin >> t;
while(t--)
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n; int t=n;
int x = n/100;
if(x*100 < t){
cout<<x+1<<"\n";
}
else{
cout<<x<<"\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for(int (i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for(int (i) = (m); (i) < (n); ++(i))
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define DEBUG(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << "\033[m" << endl;
typedef long long ll;
int main()
{
int ans = 0;
int i, j, k, l, m, n;
int a[100];
string s;
cin >> n;
cout << (n+99)/100;
// REP(i,5){ DEBUG(ans); }
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int Q = 1000;
while(Q--){
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string ans;
if(sx > tx){
for(int i = sx;i > tx;i--){
ans.push_back('U');
}
}
if(sx < tx){
for(int i = sx;i < tx;i++){
ans.push_back('D');
}
}
if(sy > ty){
for(int i = sy;i > ty;i--){
ans.push_back('L');
}
}
if(sy < ty){
for(int i = sy;i < ty;i++){
ans.push_back('R');
}
}
cout<<ans<<endl;
int dist;
cin >> dist;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// (i,j) i:上下 j:左右
#define NSIZE (30) // node数
#define ESIZE (29) // edge数
#define TEST_NUM (1000)
bool LOCAL_TEST=false; // 提出時はfalseに変更
bool DB_PRINT=false;
int h[NSIZE][ESIZE]; // h[i:上下][j:左右]
int v[ESIZE][NSIZE]; // v[i:上下][j:左右]
int si[TEST_NUM];
int sj[TEST_NUM];
int ti[TEST_NUM];
int tj[TEST_NUM];
double a[TEST_NUM];
double e[TEST_NUM];
int result[TEST_NUM];
int read_h_v()
{
// i:上下, j:左右 h_ij,v_ij
for (int i = 0; i < NSIZE; i++) {
for (int j = 0; j < ESIZE; j++) {
cin >> h[i][j];
}
}
for (int i = 0; i < ESIZE; i++) {
for (int j = 0; j < NSIZE; j++) {
cin >> v[i][j];
}
}
if (DB_PRINT) {
cout << h[ 0][0] << " " << h[ 0][1] << " " << h[ 0][28] << endl;
cout << h[ 1][0] << " " << h[ 1][1] << " " << h[ 1][28] << endl;
cout << h[29][0] << " " << h[29][1] << " " << h[29][28] << endl;
cout << v[ 0][0] << " " << v[ 0][1] << " " << v[ 0][29] << endl;
cout << v[28][0] << " " << v[28][1] << " " << v[28][29] << endl;
}
return 0;
}
int read_s_t_a_e(int k)
{
cin >> si[k] >> sj[k] >> ti[k] >> tj[k] >> a[k] >> e[k];
if (DB_PRINT) {
cout << si[k] << " " << sj[k] << " " << ti[k] << " " << tj[k] << " ";
cout << a[k] << " " << e[k] << endl;
}
return 0;
}
int read_s_t(int k)
{
cin >> si[k] >> sj[k] >> ti[k] >> tj[k];
if (DB_PRINT) {
cout << si[k] << " " << sj[k] << " " << ti[k] << " " << tj[k] << endl;
}
return 0;
}
string query(int si, int sj, int ti, int tj, int prev_result) {
// WRITE YOUR SOLUTION HERE
string str;
// 上下に一気に移動
if (si > ti) {
for (int i = 0; i < si-ti; i++){
str.push_back('U');
}
}
else if (si < ti) {
for (int i = 0; i < ti-si; i++){
str.push_back('D');
}
}
// 左右に一気に移動
if (sj > tj) {
for (int i = 0; i < sj-tj; i++){
str.push_back('L');
}
}
else if (sj < tj) {
for (int i = 0; i < tj-sj; i++){
str.push_back('R');
}
}
return str;
}
int compute_path_length(string path)
{
return 0;
}
int read_result()
{
int result;
cin >> result;
return result;
}
int main() {
if (LOCAL_TEST) {
read_h_v();
}
int prev_result = 0;
double score = 0.0;
for (int k = 0; k < 1000; k++) {
if (LOCAL_TEST) {
read_s_t_a_e(k);
} else {
read_s_t(k);
}
string path = query(si[k], sj[k], ti[k], tj[k], prev_result);
cout << path << endl << flush;
if (LOCAL_TEST) {
int b = compute_path_length(path);
score = score * 0.998 + a[k] / b;
prev_result = round(b * e[k]);
} else {
prev_result = read_result();
}
result[k] = prev_result;
}
if (LOCAL_TEST) {
cout << round(2312311 * score) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
ll ans=0;
if(n>=1000)ans+=(n-999);
//cout<<ans<<" ";
if(n>=1000000)ans+=(n-999999);
if(n>=1000000000)ans+=(n-999999999);
if(n>=1000000000000)ans+=(n-999999999999);
if(n==1e15)ans+=1;
//if(n>=1000000000000000)ans+=n=999999999999999;
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin>>t;
while(t--){
solve();
}
}
| #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
#define pb push_back
#define pob pop_back
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ull unsigned long long
#define ld long double
#define Int int
#define itn int
#define nit int
#define int long long
#define x first
#define y second
using namespace std;
const int N = 1e4 + 123;
const int INF = 2 * 1e18 - 1;
const int inf = 2 * 1e9 - 1;
bool prime(int x) {
for (int i = 2;i <= sqrt(x);i++) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
void factorizing(int x) {
if (prime(x)) {
cout << x;return;
}
int div = 2;
while (x) {
if (x % div == 0) {
cout << div << ' ';
x /= div;
div = 2;
}
else {
div++;
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int sum = 0;
int cnt = 0;
int then = 1000;
for (int i = 1000;i <= n;i *= 10) {
if (i == then) {
cnt++;
then *= 1000;
}
int log = (int)log10(i);
int next = pow(10, log + 1);
int minus = min(n - i + 1, next - i);
sum += (minus * cnt);
}
cout << sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
void solve(){
int n; cin >> n;
vector<ll> a,b;
for (int i=0; i<n; i++){
ll x; cin >> x;
a.push_back(x);
}
for (int i=0; i<n; i++){
ll x; cin >> x;
b.push_back(x);
}
ll dot = 0;
for (int i=0; i<n; i++){
dot = dot + a[i] * b[i];
}
cout << (dot == 0? "Yes\n" : "No\n");
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1; //cin >> t;
while(t--) solve();
return 0;
}
// NK
| /*
* author :Sadik Hassan(_sad_)
*
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define nl "\n"
#define pb push_back
#define fi first
#define se second
#define MP make_pair
#define PI (acos(-1.0))
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define SZ(s) (int)s.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define w(t) int t;cin>>t;while(t--)
#define _SAD() ios::sync_with_stdio(0),cin.tie(0),cout.tie(0),cout<<fixed<<setprecision(10);
typedef vector<int> vi;
typedef vector<ll> vii;
typedef set<int> si;
typedef set<ll> sii;
/*---------------------------------------------------------------------*/
const int N=(int)2e5+5;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+5;
const int nn=1e6;
int main()
{
_SAD()
int n;
cin>>n;
int ans=0;
rep(i,n)
{
int y;
cin>>y;
ans=__gcd(y,ans);
}
cout<<ans<<nl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#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 ins insert
#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}
using namespace std;
template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}
/* Some Libraries */
//-------------------------------------------------
ll my_sqrt(__int128_t n){
__int128_t lo=0,hi=n;
while(hi-lo>1){
__int128_t c = (lo+hi)/2;
(c*c<n)?(lo=c):(hi=c);
}
return hi;
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll R,X,Y; cin>>R>>X>>Y;
if (X*X+Y*Y==R*R){
cout<<"1\n";
return 0;
}
if (X*X+Y*Y<R*R){
cout<<"2\n";
return 0;
}
ll ans = (my_sqrt(X*X+Y*Y)+R-1)/R;
cout<<ans<<endl;
return 0;
}
| #include<iostream>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
#include<iomanip>
#include<fstream>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<sstream>
using namespace std;
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0)
//string::npos
#define eps 1e-6
const double pi = 3.141592653589;
const int maxn = 2e5+10;
const int maxm = 100040;
//const int mod = 998244353;
const int inf = 0x3f3f3f3f;
typedef long long ll;
int main(){
sync;
double r, x, y;
cin >> r >> x >> y;
ll ans = ceil(sqrt(x*x+y*y)/r);
//ll ans = ceil(sqrt(ceil(x*x+y*y/r/r);
//cout << sqrt(x*x+y*y)/r*1.0 << endl;
if(sqrt(x*x+y*y)/r<1) cout << 2 << endl;
else cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<string> S(N);
REP(i, 0, N) cin >> S[i];
vector<vector<bool>> d(N, vector<bool>(N, false));
REP(i, 0, N) REP(j, 0, N) if (S[i][j] == '1') d[i][j] = true;
REP(k, 0, N) REP(i, 0, N) REP(j, 0, N) if (d[i][k] && d[k][j]) d[i][j] = true;
double ans = 0;
REP(i, 0, N) {
int cnt = 0;
REP(j, 0, N) {
if (i == j || d[j][i]) cnt++;
}
ans += (double)(1) / cnt;
}
cout << fixed << setprecision(15);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
typedef double D;
typedef long long int LL;
typedef long double LD;
#define OR ||
#define AND &&
#define nl '\n'
#define ff first
#define ss second
#define S string
#define inf INT_MAX
#define SQR(a) (a) * (a)
#define pb push_back
#define GCD(a, b) __gcd(a, b)
#define PI 2.0*acos(0.0)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define LCM(a, b) (a * b) / GCD(a, b)
#define mem(a,b) memset(a,b,sizeof(a))
#define srtv(v) sort(v.begin(),v.end())
#define T int t; cin>>t; while(t--)
#define Rep(i,a,b) for(int i = a; i <= b; i++)
#define rep(i,a,b) for(int i = a; i >= b; i--)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define inout freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
#define si(x) scanf("%d",&x)
#define pi(x) printf("%d",x)
#define sss(str) scanf("%s",str)
#define pl(x) printf("%lld",x)
#define sl(x) scanf("%lld",&x)
#define sii(x,y) scanf("%d %d",&x,&y)
#define sll(x,y) scanf("%lld %lld",&x,&y)
#define siii(x,y,z) scanf("%d %d %d",&x,&y,&z)
#define slll(x,y,z) scanf("%lld %lld %lld",&x,&y,&z)
using namespace std;
/*
int bs(int l,int r,int n)
{
int mid,res=inf;
while(l<=r)
{
mid=l+(r-l)/2;
if(check(mid,n))
{
r=mid-1;
res=min(res,mid);
}
else
l=mid+1;
}
return res;
}
*/
//--------------------------code starts here---------------------------------------
int L;
unsigned long long dp[205][13];
unsigned long long func(int pos,int taken)
{
if(taken==11)
{
return 1;
}
if(pos==L)
return 0;
if(dp[pos][taken]!=-1)
return dp[pos][taken];
return dp[pos][taken]=func(pos+1,taken)+func(pos+1,taken+1);
}
int main()
{
cin>>L;
mem(dp,-1);
cout<<func(1,0)<<nl;
return 0;
} |
// Problem: C - Squared Error
// Contest: AtCoder - AtCoder Beginner Contest 194
// URL: https://atcoder.jp/contests/abc194/tasks/abc194_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Parsed on: 10-03-2021 21:39:49 IST (UTC+05:30)
// Author: Kapil Choudhary
// ********************************************************************
// कर्मण्येवाधिकारस्ते मा फलेषु कदाचन |
// मा कर्मफलहेतुर्भूर्मा ते सङ्गोऽस्त्वकर्मणि || १.४७ ||
// ********************************************************************
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define PI 3.1415926535897932384626
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vull> vvull;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0,lim-1);
return uid(rang);
}
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;
void solve()
{
int n; cin >> n;
vi cnt(401, 0);
for(int i = 0; i < n; i++) {
int x; cin >> x;
x += 200;
cnt[x]++;
}
ll res = 0LL;
for(int i = 0; i <= 400; i++) {
for(int j = i + 1; j <= 400; j++) {
res += (ll)cnt[i] * cnt[j] * (i - j) * (i - j);
}
}
cout << res << "\n";
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int t = 1;
// cin >> t;
while(t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef complex <double> cp;
#define debug(a) cout<<#a<<":"<<a<<endl;
#define fr freopen("in.txt","r",stdin);
#define Fill(x,a) memset(x,a,sizeof(x))
#define cpy(a,b) memcpy(a,b,sizeof(a))
const double PI = acos(-1);
const ll INF=0x3f3f3f3f;
const ll N=1e6+7;
const ll mod=1e9+7;
ll maxn,minn;
ll T,n,m,q;
ll arr[N];
ll dp[N];
ll sq[N];
int main(){
ll ans = 0;
cin >> n;
sq[0] = 0;
for(ll i = 1; i <= n; i ++ ){
scanf("%lld",arr + i);
sq[i] = sq[i - 1] + arr[i] * arr[i];
}
dp[n + 1] = 0;
for(ll i = n; i >= 1; i --){
dp[i] = dp[i + 1] + arr[i];
}
for(ll i = 1; i <= n; i ++ ){
ans = ans + sq[n] - sq[i];
ans = ans + (n - i) * arr[i] * arr[i];
ans = ans - 2 * arr[i] * (dp[i + 1]);
}
cout << ans << endl;
return 0;
}
|
//
// Created on 2021/03/20.
//
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <ios>
#include <iomanip>
#include <numeric>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
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;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const long long LINF =1e18;
const int INF = 1e9;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
int ans = -INF;
for (int i = a; i <= b; ++i) {
for (int j = c; j <= d; ++j) {
chmax(ans,i-j);
}
}
cout<<ans<<endl;
return 0;
}
| #include <iostream>
using namespace std;
int ri(){
int n = 0;
scanf("%d", &n);
return n;
}
int main(){
int min, max;
int a=ri();
int b=ri();
int c=ri();
int d=ri();
if(a<b) max=b;
else max = a;
if(c>d) min=d;
else min = c;
max -= min;
printf("%d", max);
return 0;
} |
#include <iostream>
#include <vector>
#include <cmath>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
vector<vector<pair<int, ll>>> adj;
vector<ll> dist;
const int MOD = 1e9 + 7;
int modadd(int a, int b) {
return (a % MOD + b % MOD) % MOD;
}
int modmul(int a, int b) {
return (ll) a * b % MOD;
}
void dfs(int u, int p, ll currdist) {
dist[u] = currdist;
for (auto v : adj[u]) if (v.first != p) dfs(v.first, u, currdist ^ v.second);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
adj.resize(n + 1);
dist.resize(n + 1);
for (int i = 0; i < n - 1; i++) {
ll u, v, w;
cin >> u >> v >> w;
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
dfs(1, 0, 0);
int ans = 0;
for (int bitpos = 0; bitpos < 61; bitpos++) {
ll mask = (1ll << bitpos);
int ones = 0, zeros = 0;
for (int u = 1; u <= n; u++) {
ll currdist = dist[u];
if (currdist & mask) ones++;
else zeros++;
}
int count = modmul(ones, zeros);
ans = modadd(ans, modmul(count, mask % MOD));
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main(){
int n =0 , m =0 ;
cin >> n >> m;
int s =0 , s2=0;
vector<pair<int , int > > ar;
for(int i=0;i<m;i++){
cin >> s >> s2;
ar.emplace_back(s ,s2 );
}
int k =0 ;
cin >> k;
vector< pair<int , int > > g ;
for(int i=0;i<k;i++){
cin >> s >> s2 ;
g.emplace_back(s,s2);
}
int mx =0 ;
for(int mask =0 ;mask < (1 << k);mask ++ ){
int pts =0 ;
map<int , bool > tmp;
for(int i =k-1 ;i>=0;i--){
if(mask &(1LL << i)){
tmp[g[i].first] = 1;
}
else
tmp[g[i].second] = 1;
}
for(int i =0 ;i<m;i++){
if(tmp[ar[i].first] &&tmp[ar[i].second])
pts ++ ;
}
mx = max(mx, pts );
}
cout << mx << endl;
return 0;}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#define len(v) int(v.length())
#define lob(v,n) lower_bound(all(v),n)
#define lobi(v,n) lower_bound(all(v),n) - v.begin()
#define upb(v,n) upper_bound(all(v),n)
#define upbi(v,n) upper_bound(all(v),n) - v.begin()
#define mod 998244353
#define infi 1010000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;
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(a > b) {a = b;return 1;}return 0;}
class Combination {
vl fac,finv,inv;
public:
Combination(ll n) {
n++;
fac.resize(n);finv.resize(n);inv.resize(n);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
reps(i,2,n){
fac[i] = fac[i-1]*(ll)i%mod;
inv[i] = (ll)mod - inv[mod%i]*(ll)(mod/i)%mod;
finv[i] = finv[i-1]*inv[i]%mod;
}
}
ll com(ll n, ll m){
if(n < m) return 0;
if(n < 0 || m < 0) return 0;
return fac[n]*(finv[m]*finv[n-m]%mod)%mod;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N,M;
cin >> N >> M;
Combination C(10000);
int n = 14;
vvl dp(n+1,vl(M+1,0));
dp[0][0] = 1;
rep(i,n){
int a = int(1<<i);
rep(k,M+1){
dp[i+1][k] += dp[i][k];
dp[i+1][k] %= mod;
if(dp[i][k] == 0) continue;
for (int j = 2; j <= N; j += 2) {
if(a*j+k > M) break;
dp[i+1][a*j+k] += dp[i][k]*C.com((ll)N,(ll)j)%mod;
dp[i+1][a*j+k] %= mod;
}
}
}
cout << dp[n][M] << endl;
return 0;
}
| #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<cstdlib>
#include<utility>
using namespace std;
const int mod=998244353;
int f[17][5000+5],c[5000+5][5000+5];
void add(int &x,int y){x=(x+y)%mod;}
int main()
{
int n,m,i,j,k,val;
c[0][0]=c[1][1]=c[1][0]=1;
for (i=2;i<=5000;i++)
c[i][0]=1;
for (i=2;i<=5000;i++)
{
for (j=1;j<=i;j++)
c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
}
scanf("%d%d",&n,&m);
f[0][0]=1;
for (i=1;i<=15;i++)
{
val=1<<(i-1);
for (k=0;k<=n&&k*val<=m;k+=2)
for (j=k*val;j<=m;j++)
add(f[i][j],1ll*f[i-1][j-k*val]*c[n][k]%mod);
}
printf("%d\n",f[15][m]);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007; // 998244353;
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void pt_vvll(vvll v) {
rep(i, v.size()) {
rep(j, v[0].size()) {
cout << v[i][j];
if (j != v[0].size() - 1)
cout << " ";
else
cout << "\n";
}
}
}
void pt_vll(vll v) {
rep(i, v.size()) {
cout << v[i];
if (i == v.size() - 1)
cout << "\n";
else
cout << " ";
}
}
vector<ll> sum, ans;
void pre_process(vector<ll> &a, vector<ll> &s) { //累積和のvector
ll n = (ll)a.size();
s.assign(n + 1, 0);
for (ll i = 0; i < n; i++) {
s[i + 1] = s[i] + a[i];
}
}
ll query(ll i, ll j, vector<ll> &s) { //区間[i,j]の和
return (s[j] - s[i]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll H, W, N, M;
cin >> H >> W >> N >> M;
vvll g(H, vll(W));
vll A(N), B(N), C(M), D(M);
rep(i, N) {
cin >> A[i] >> B[i];
g[--A[i]][--B[i]] = 1;
}
rep(i, M) {
cin >> C[i] >> D[i];
g[--C[i]][--D[i]] = -1;
}
vvll dp1 = g, dp2 = g, dp3 = g, dp4 = g;
rep(j, W) {
rep(i, H) {
if (g[i][j] == -1) continue;
if (i + 1 < H && g[i + 1][j] != -1) chmax(dp1[i + 1][j], dp1[i][j]);
}
}
for (ll i = H - 1; i >= 0; i--) {
rep(j, W) {
if (g[i][j] == -1) continue;
if (0 <= i - 1 && g[i - 1][j] != -1)
chmax(dp2[i - 1][j], dp2[i][j]);
}
}
rep(i, H) {
rep(j, W) {
if (g[i][j] == -1) continue;
if (j + 1 < W && g[i][j + 1] != -1) chmax(dp3[i][j + 1], dp3[i][j]);
}
}
rep(i, H) {
for (ll j = W - 1; j >= 0; j--) {
if (g[i][j] == -1) continue;
if (j - 1 >= 0 && g[i][j - 1] != -1)
chmax(dp4[i][j - 1], dp4[i][j]);
}
}
/*
cout << "\n";
cout << "dp1\n";
pt_vvll(dp1);
cout << "\n";
cout << "dp2\n";
pt_vvll(dp2);
cout << "\n";
cout << "dp3\n";
pt_vvll(dp3);
cout << "\n";
cout << "dp4\n";
pt_vvll(dp4);
cout << "\n";
pt_vvll(g);*/
ll ans = 0;
rep(i, H) {
rep(j, W) {
ll pl = 0;
if ((dp1[i][j] + dp2[i][j] + dp3[i][j] + dp4[i][j] > 0)) pl = 1;
ans += pl;
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef vector<int> vint;
#define MAXN 2000
#define MAXLG 20
const int inf = 0x3f3f3f3f;
const ll mod = 1000000007;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const int N = 300100;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int h, w;
int n, m;
set<int>bulb[2][1600], block[2][1600];
bool check(int i, int j, int t){
auto it = bulb[t][i].lower_bound(j);
auto it1 = block[t][i].lower_bound(j);
if(*it1 == j) return false;
if(it != bulb[t][i].end() && (it1 == block[t][i].end() || *it < *it1)) return true;
if(it != bulb[t][i].begin() && it1 == block[t][i].begin()) return true;
if(it != bulb[t][i].begin()){
it--;
it1--;
if(*it > *it1) return true;
}
return false;
}
void solve(){
cin>>h>>w>>n>>m;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
bulb[0][x].insert(y);
bulb[1][y].insert(x);
}
for(int i=0;i<m;i++){
int x,y;
cin>>x>>y;
block[0][x].insert(y);
block[1][y].insert(x);
}
int ans = 0;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
if(check(i, j, 0) || check(j, i, 1)){
ans++;
//cout<<i<<" "<<j<<"\n";
}
}
}
cout<<ans<<"\n";
// Have you read the problem again?
// Maybe you understood the wrong problem
}
int32_t main(){
fastcin;
int t_ = 1;
//cin>>t_;
while(t_--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint2 = modint998244353;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
//const Int mod = 998244353;
typedef struct {
int64_t to, weight;
} edge;
Int dx[] = {0, 1, 0, -1, -1, 1, -1, 1};
Int dy[] = {1, 0, -1, 0, -1, -1, 1, 1};
template<class T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &e : v) {
is >> e;
}
return is;
}
bool print_space_enable = false;
void print() {
std::cout << '\n';
print_space_enable = false;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
if (print_space_enable) std::cout << " ";
std::cout << fixed << setprecision(15) << head;
print_space_enable = true;
print(std::forward<Tail>(tail)...);
}
template<typename T>
void print(vector<T> v) {
for (size_t i = 0; i < v.size(); i++) {
if (i > 0) std::cout << " ";
std::cout << v[i];
}
std::cout << '\n';
}
template<class T>
vector<T> make_vec(size_t n, T val) {
return vector<T>(n, val);
}
template<class... Ts>
auto make_vec(size_t n, Ts... ts) {
return vector<decltype(make_vec(ts...))>(n, make_vec(ts...));
}
bool is_overflow(Int a, Int b) {
return a > INF / b;
}
void solve() {
Int n;
cin >> n;
vector<Int> a(n);
cin >> a;
vector<Int> b = a;
for (Int i = 0; i + 1 < n; i++) {
b[i + 1] += b[i];
}
for (Int i = 0; i + 1 < n; i++) {
b[i + 1] += b[i];
}
vector<Int> c = a;
for (Int i = 0; i + 1 < n; i++) {
c[i + 1] = max(c[i], c[i + 1]);
}
for (Int i = 0; i < n; i++) {
print(b[i] + (i + 1) * c[i]);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
//Int _t; cin >> _t; while (_t--) solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(N, 0);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
V.at(A)++;
}
int ans = 0, X = V.at(0);
for (int i = 0; i < N; i++) {
X = min(K,min(X, V.at(i)));
ans += X;
}
cout << ans << endl;
} |
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
int N;
cin >> N;
int ans = (N - 1) / 100 + 1;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define all(v) ((v).begin()),((v).end())
#define rep(i, val, n) for(int i = val; i < (n); i++)
#define repr(i, val, n) for(int i = n - 1; i >= val; i--)
using namespace std;
const ll mod = 1e9 + 7;
const ll inf = 2e18 + 100;
const double eps = 1e-7;
const ld pi = acos(-1);
const int N = 1e5 + 2;
//bool is_vowel(char a){ return (a=='A' || a=='E' || a=='O' || a=='I' || a=='U');}
//int dx[] = {2,-2,2,-2,1,1,-1,-1}, dy[] = {1,1,-1,-1,2,-2,2,-2}; // knight moves
//int dx[] = {0,0,1,1,1,-1,-1,-1}, dy[] = {-1,1,-1,0,1,-1,0,1}; // 8 adjacent neighbours
//int dx[] = {0,0,1,-1}, dy[] = {-1,1,0,0}; //4 adjacent neighbours
//bool inside(int x, int y,int n,int m){ return (x >= 0 && x < n && y >= 0 && y < m);}
void test() {
int n;cin>>n;
cout<<(n + 99) / 100;
}
int main() {
// precompute();
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int cases = 1, c = 1;
// cin >> cases;
while (cases--) {
// cout<<"Case #"<<c++<<": ";
test();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
const ll INF = 1e18;
const ll NEGINF = -1 * INF;
/*NOTES: Take care of ll vs int
Never use an iterator after erasing it
*/
void solve()
{
vector<int> a(3);
for (int i = 0; i < 3; i++)
{
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[1] - a[0] == a[2] - a[1])
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
int main()
{
fast;
#ifndef ONLINE_JUDGE
freopen("/home/kalit/Desktop/Data Structures-Algo-Competitive/src/codeforces/input.txt", "r", stdin);
freopen("/home/kalit/Desktop/Data Structures-Algo-Competitive/src/codeforces/output.txt", "w", stdout);
#endif
int T = 1;
while (T--)
{
solve();
}
//cout<< "Done in " << clock() / CLOCKS_PER_SEC <<"sec"<< endl;
return 0;
} | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
int main()
{
ll i,j,a,b,c;
cin>>a>>b>>c;
if(2*b==a+c||2*a==b+c||2*c==a+b) printf("Yes\n");
else printf("No\n");
} |
//! 尺卂乃卂.卂ﾌ乇乇ㄒ
#include<bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
//Using namespace __gnu_pbds;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> Ordered_set;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<vi>
#define vip vector<pii>
#define mii map<int,int>
#define mip map<pair<int,int>,int>
#define mic map<char,int>
#define all(v) v.begin(),v.end()
#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 lb(x) (x&(-x))
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x--)
#define itr(it,v) for(auto it:v)
#define show(arr,n) for(int i=0;i<n;i++) cout<<arr[i]<<" "; cout<<"\n";
#define fi(i,n) for(int i=0;i<n;i++)
#define fir(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ff first
#define ss second
#define deb(x) cout << #x << "=" << x << endl
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define check(x) (x && cout<<"Yes\n")||(cout<<"No\n");
#define fin(s) freopen(s,"r",stdin);
#define fout(s) freopen(s,"w",stdout);
const ld pi = 3.141592653589793238462643383279502884;
const int xd[]={-1,0,1,0};
const int yd[]={0,-1,0,1};
int XX[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int YY[] = { -1, 0, 1, -1, 1, -1, 0, 1 };
int expo(int a,int b,int m);
int mmi(int a,int m);
void ipgraph(int m);
const int N=5*(1e5)+10;
vii adj(N);
int a[N],b[N];
void solve(){
}
int n,m;
int32_t main()
{
FIO
int k; cin>>k>>n>>m;
int tot=0;
fi(i,k) {
cin>>a[i];
tot+=a[i];
}
int rem=0;
priority_queue<pii, vector<pii> > p1;
vip v;
fi(i,k){
b[i]=(a[i]*m)/n;
rem+=b[i];
p1.push({abs(n*b[i]-m*a[i]),i});
// v.pb({abs(n*b[i]});
}
// fi(i,k) cout<<b[i]<<" "; cout<<"\n";
rem=m-rem;
while(rem>0){
pii p=p1.top(); p1.pop();
b[p.ss]+=1;
// p1.push({p.ff+1,p.ss});
rem--;
}
fi(i,k) cout<<b[i]<<" "; cout<<"\n";
return 0;
}
void ipgraph(int m){
int i, u, v;
while(m--){
cin>>u>>v;
u--, v--;
adj[u].pb(v);
adj[v].pb(u);
}
}
int expo(int a,int b,int m){
if(b==0) return 1;
if(b==1) return a;
int val=(expo(a,b/2,m)*expo(a,b/2,m))%m;
if(b & 1) return (val*a)%m;
else return val;
}
int mmi(int a,int m){
return expo(a,m-2,m);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = s; i < (ll)(n); i++)
int main() {
ll K, N, M;
cin >> K >> N >> M;
vector<ll> A(K);
vector<ll> B(K);
// lib priority queue 使い方
// l が既存, r が new element. new element の優先度が高い時は true を返すようにする
auto c = [](pair<ll, pair<ll, ll>> l, pair<ll, pair<ll, ll>> r) {
return l.second.first == r.second.first ? l.second.second >= r.second.second : l.second.first <= r.second.first;
};
priority_queue<pair<ll, pair<ll, ll>>, vector<pair<ll, pair<ll, ll>>>, decltype(c)> que(c);
ll sum = 0;
rep(i, 0, K) {
cin >> A[i];
B[i] = A[i] * M / N;
// bi, { cur score, new score }
que.push({i, {abs(B[i] * N - A[i] * M), abs(B[i] * (N + 1) - A[i] * M)}});
sum += B[i];
}
while (que.size() != 0) {
auto worst = que.top();
que.pop();
if (sum < M) {
B[worst.first]++;
} else {
break;
}
sum++;
}
rep(i, 0, K) { cout << B[i] << " "; }
} |
#include<bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define in cin>>
#define ou cout<<
#define nl cout<<endl;
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
void solve()
{
int a,b;
cin>>a>>b;
if(a==b)
cout<<a<<endl;
else
{
if(a==0)
{
if(b==1)
cout<<2<<endl;
else
cout<<1<<endl;
}
else if(a==1)
{
if(b==0)
cout<<2<<endl;
else
cout<<0<<endl;
}
else
{
if(b==0)
cout<<1<<endl;
else
cout<<0<<endl;
}
}
}
int main()
{
//int t;
//in t;
//while(t--){
solve();
//}
return 0;
}
| #include <iostream>
using namespace std;
int main(){ int x,y;
cin>>x>>y;
if(x==y){cout<<x;}
else if(x==0&&y==1){cout<<2;}
else if(x==0&&y==2){cout<<1;}
else if(x==1&&y==0){cout<<2;}
else if(x==1&&y==2){cout<<0;}
else if(x==2&&y==0){cout<<1;}
else if(x==2&&y==1){cout<<0;}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#if 0 //B
#include <iomanip>
#endif
using namespace std;
long long int T[8][8];
int N, K;
int root[9] = { -1,-1,-1,-1,-1,-1,-1,-1,-1 }; // 通る経路。
bool isVisited[8] = { false,false, false, false, false, false, false, false };
int counter = 0;
vector<int> get_unvisited_city(){
vector<int> vec_city;
for (int i = 0; i < N; i++) {
if (isVisited[i] == false) {
vec_city.push_back(i);
}
}
return vec_city;
}
int number_unvisited() {
int cnt = 0;
for (int i = 0; i < N; i++) {
if (isVisited[i] != true) cnt++;
}
return cnt;
}
// 未訪問の都市IDの中から最も若いIDの都市IDを返す関数。すべて訪問済みなら0を返す
int getUnvisitedCityID() {
for (int i = 0; i < N; i++) {
if (isVisited[i] == false) {
return i;
}
}
return 0;
}
// 階乗をおこなう関数
int kaijou(int x) {
int ret = 1;
for (int i = 1; i <= x; i++) {
ret *= i;
}
return ret;
}
void calcTime() {
long long time = 0;
for (int i = 0; i < N; i++) {
int from = root[i];
int to = root[i + 1];
time += T[from][to];
}
if (time == K) {
counter++;
}
}
// n番目に訪問する都市を決める関数
int DecideCityID(int n) {
if (n == N) {
// ルートが決まったので時間の計算
calcTime();
return 0;
}
vector<int> vec_city = get_unvisited_city();
for (auto it = vec_city.begin(); it != vec_city.end(); it++) {
isVisited[*it] = true;
root[n] = *it;
DecideCityID(n + 1);
isVisited[*it] = false;
root[n] = -1;
}
return 0;
}
int main()
{
cin >> N >> K;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> T[i][j];
}
}
int pattern = kaijou(N-1);
bool root_decided = false;
root[0] = root[N] = 0;
int from, to;
from = 0;
isVisited[from] = true;
DecideCityID(1);
to = getUnvisitedCityID();
cout << counter;
return 0;
}
| // #pragma GCC optimise ("O1")
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define rep(i,j,n) for(ll i=j;i<n;i++)
#define scn(a) scanf("%d",&a)
#define scns(a,b) scanf("%d %d",&a,&b)
#define print(a) printf("%0.10lf",a)
#define vec vector<ll>
#define pb push_back
#define pairs pair<ll,ll>
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define srt(v) sort(v.begin(),v.end())
#define read(a) for(auto &it:a) cin>>it;
#define write(a) for(auto it:a) cout<<it<<" ";
#define mem(a,b) memset(a,b,sizeof(a))
#define nl printf("\n")
#define inf 1e9
#define zer INT_MIN
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N=2e3+5;
int main()
{
int t=1;
// cin>>t;
while(t--)
{
int n,k; scns(n,k);
int cost[n+5][n+5];
rep(i,1,n+1)
rep(j,1,n+1)
scn(cost[i][j]);
vec v;
int cnt=0;
rep(i,2,n+1)
v.pb(i);
do
{
int amt=0;
amt+=cost[1][v[0]];
// for(auto it:v)
// cout<<it<<" ";
// cout<<endl;
rep(i,1,v.size())
amt+=(cost[v[i-1]][v[i]]);
amt+=cost[v[v.size() - 1]][1];
// cout<<amt<<" ";
if(amt==k)
cnt++;
} while(next_permutation(all(v)));
cout<<cnt;
}
}
|
//int max = 2 147 483 647 (2^31-1)
//ll max = 9 223 372 036 854 775 807 (2^63-1)
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
//Fast input and output
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);}
//Printing pairs and vectors
template<typename A, typename B> ostream& operator<< (ostream &cout, pair<A,B> const &p)
{return cout << "(" << p.f << ", " << p.s << ")";}
template<typename A> ostream& operator<< (ostream &cout, vector<A> const&v)
{cout << "["; forn(i,(int)v.size()){ if (i) cout << ", "; cout << v[i];} return cout << "]";}
int main(){
fast_io();
int a,b,c; cin >> a >> b >> c;
cout << 21-a-b-c;
}
//code by DanTheMan
| using namespace std;
#include<string>
#include<cmath>
#include<list>
#include<queue>
#include <map>
#include <unordered_map>
#include <set>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ml map<ll,ll>
#define pb push_back
#define mp make_pair
#define ppl pair<ll,ll>
#define F first
#define S second
#define T third
#define Fo fourth
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define ffr(i,a,b) for(ll i=a;i>=b;i--)
#include<bits/stdc++.h>
#include<vector>
#define vl vector<ll>
#define PI 3.141592654
const ll N = 1e9 + 7;
const ll P = 2e5 + 7;
const ll Q = 1e9 + 9;
#include<iterator>
#define EPSILON numeric_limits<double>::epsilon()
#include<tuple>
// struct tup
// {
// ll first, second;
// string third;
// };
// vector<vl> pr(N, vl(30, 0));
// vl vr;
// ml m;
// void precompute() {
// fr(i, 2, N) {
// if (!m[i]) {
// // cout << i << " ";
// vr.pb(i);
// for (ll j = i * i; j < N; j += i)m[j] = 1;
// }
// }
// }
// vl pr(P, 0);
// void prime() {
// fr(i, 2, P) {
// if (pr[i] == 0) {vr.pb(i); for (ll j = i * i; j <= P; j += i)pr[j] = 1;}
// }
// }
ll gcd(ll a, ll b) {
if (a == b)return a;
if (a % b == 0)return b;
if (b % a == 0)return a;
if (b > a)return gcd(a, b % a);
if (a > b)return gcd(a % b, b);
return 0;
}
void show(ll a[], ll d) {
if (d)fr(i, 0, d)cout << a[i] << " ";
}
void inp(ll a[], ll d) {
fr(i, 0, d)cin >> a[i];
}
void Yesno(ll p) {
if (p)cout << "YES";
else cout << "NO";
}
// ll fact(ll n) {
// ll res = 1;
// fr (i, 2, n + 1) res = (res * i) % N;
// return res;
// }
// ll nCr(ll n, ll r) {
// return fact(n) / (((fact(r) * fact(n - r))) % N);
// }
// ll nPr(ll n, ll r) {
// return ((fact(n) % N) / (fact(n - r) % N)) ;
// }
// vl rightgreater(ll a[], ll n) {
// vl v;
// stack<ll> s;
// ffr(i, n - 1, 0) {
// if (s.size() == 0)v.pb(-1);
// else if (s.size() > 0 && s.top() > a[i])v.pb(s.top());
// else if (s.size() > 0 && s.top() <= a[i]) {
// while (s.size() > 0 && s.top() <= a[i])s.pop();
// if (s.size() == 0)v.pb(-1);
// else v.pb(s.top());
// }
// s.push(a[i]);
// }
// reverse(v.begin(), v.end());
// return v;
// }
// vl par, ran;
// ll findpar(ll x) {
// if (x == par[x])return x;
// return par[x] = findpar(par[x]);
// }
// void Union(ll x, ll y) {
// ll parx = findpar(x);
// ll pary = findpar(y)Snippet: map;;
// if (ran[parx] < ran[pary])par[parx] = pary;
// else if (ran[parx] > ran[pary])par[pary] = parx;
// else {par[parx] = pary; ran[pary]++;}
// }
// ld nthRoot(ll A, ll N) {
// ld xPre = rand() % 10, eps = 1e-3, delX = INT_MAX, xK;
// while (delX > eps) {
// xK = ((N - 1.0) * xPre + (ld)A / pow(xPre, N - 1)) / (ld)N;
// delX = abs(xK - xPre);
// xPre = xK;
// }
// return xK;
// }
// bool comp(tup &a, tup &b) {
// if (a.F != b.F)return a.F < b.F;
// else return a.S < b.S;
// }
// vl b;
// vector<vector<ppl>> v;
// vector<vl> v;
// // vl dist, cumu;
// // ll n, m;
// // vl link, val;
// // vector<char>a;
// vector<bool> visited;
// ll dfs(ll pnt, ll data[], ll totsum, ll &mi) {
// visited[pnt] = true;
// ll sum = 0;
// for (auto it : v[pnt]) {
// if (!visited[it]) {
// ll tempans = dfs(it, data, totsum, mi);
// mi = min(mi, abs(totsum - (2 * (tempans))));
// sum += tempans;
// }
// }
// // cout << pnt << " " << mi << '\n';
// // visited[pnt]=false;
// sum += data[pnt];
// return sum;
// }
void solve() {
ll x, y, z; cin >> x >> y >> z;
cout << 21 - (x + y + z);
}
int main() {
fio;
#ifndef ONLINE_JUDGE
// for getting input
freopen("input.txt", "r", stdin);
//for writing output
freopen("jout.txt", "w", stdout);
#endif
// prime();
// precompute();
ll t;
if (1)
t = 1;
else
cin >> t;
fr(i, 0, t) {
// cout << "Case #" << i + 1 << ": ";
solve();
cout << '\n';
}
return 0;
} |
// Problem: C - Squared Error
// Contest: AtCoder - AtCoder Beginner Contest 194
// URL: https://atcoder.jp/contests/abc194/tasks/abc194_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
using l = long;
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<ll>;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define modinv(a,m) modEx(a,m-2,m)
#define moddiv(a,b,m) (a*modinv(b,m))%m
const ll mod=1e9+7;
/* These template codes have been taken from cp-algorithms */
ll extEuclid(ll a,ll b,ll& x,ll& y){
if(b==0){
x=1;
y=0;
return a;
}
ll x1,y1;
ll d=extEuclid(b,a%b,x1,y1);
x=y1;
y=x1-(a/b)*y1;
return d;
}
ll modInverse(ll a,ll n){
ll x,y;
extEuclid(a,n,x,y);
return x;
}
ll linearCong(ll a,ll b,ll n){
ll d=__gcd(a,n);
if(b%d)
return -1;
a/=d;b/=d;n/=d;
ll a_inv=modInverse(a,n);
ll ans=(b*a_inv)%n;
if(ans<0)
ans+=n;
return ans;
}
void divisors(map<int,int>& d,ll N){
for(int div : {2,3,5}){
int cnt=0;
if(N%div==0){
while((N%div)==0){
N/=div;
cnt++;
}
d[div]=cnt;
}
}
static array<int,8> increments = {4,2,4,2,4,6,2,6};
int i=0;
for(ll div=7;div*div<=N;div+=increments[i++]){
if((N%div)==0){
int cnt=0;
while((N%div)==0){
N/=div;
cnt++;
}
d[div]=cnt;
}
if(i==8)
i=0;
}
if(N>1)
d[N]=1;
}
/* Print the string of digits without leading zero */
void norm(string& str){
bool zero=true;
for(auto& c:str){
if(c!='0')
zero=false;
if(c!='0' || !zero)
cout<<c;
}
}
void input(vll& v,int N){
for(int i=0;i<N;i++){
cin>>v[i];
}
sort(all(v));
}
void solve(vll& v,int N){
ll ans=0;
vll prefix(N);
prefix[0]=v[0];
for(int i=1;i<N;i++){
prefix[i]+=prefix[i-1]+v[i];
}
for(int i=1;i<N;i++){
ans-=(prefix[i-1])*v[i];
}
ans*=2;
for(int i=0;i<N;i++)
ans+=(N-1)*1ll*(v[i]*v[i]);
cout<<ans<<"\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin>>N;
vll v(N);
input(v,N);
solve(v,N);
return 0;
}
| #include <bits/stdc++.h>
//#define IHAVEGIRLFRIEND
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,sse4,ssse3,popcnt,abm,mmx,avx,avx2,tune=native")
#define PB emplace_back
#define MP make_pair
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define F first
#define S second
#define REP(i,a,b) for(int i = a; i < b; ++i)
#define REPP(i,a,b) for(int i = a; i <= b; ++i)
#define RREP(i,a,b) for(int i = a; i >= b; --i)
#define endl cout<<'\n'
#define _ <<' '<<
#define CASET int ___T; cin >> ___T; for(int kase = 1; kase <= T; kase++)
#define MS(X,V) memset(X,V,sizeof(X))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
#ifdef IHAVEGIRLFRIEND
#define IOS
#define PAUSE system("pause")
#define debug(...) fprintf(stderr, "\033[1m\033[31m%s [%d] \033[0m(%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__), _do(__VA_ARGS__)
template<typename T> void _do(T &&x){ cerr<<x<<'\n'; }
template<typename T, typename ...S> void _do(T &&x, S &&...y){ cerr<<x<<", ";_do(y...); }
#else
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define PAUSE
#define debug(...)
#endif
constexpr int maxn = 3e5 + 5;
ll arr[maxn];
void solve(){
int N; cin >> N;
ll ans = 0, sum = 0;
REP(i,0,N){
cin >> arr[i];
ans += (N-1)*arr[i]*arr[i];
sum += arr[i];
}
REP(i,0,N-1){
sum -= arr[i];
ans -= arr[i] * sum * 2;
}
cout << ans << '\n';
}
signed main(){
IOS;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200 + 10;
int c[8];
int main(){
ios_base::sync_with_stdio(false);
int tc;
cin >> tc;
while (tc --){
string s;
cin >> s;
if (s > "atcoder"){
cout << 0 << '\n';
continue;
}
bool found = 0;
for (int i = 0; i < s.size(); i++){
if (s[i] > 'a'){
if (s[i] > 't')
cout << max(0,i-1) << '\n';
else
cout << i << '\n';
found = 1;
break;
}
}
if (!found)
cout << -1 << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
string s;
string x = "atcoder";
int aduEgal(int poz)
{
if(s[poz] == x[poz])
return 0;
for(int i = poz + 1; i < s.size(); i ++)
{
if(x[poz] == s[i])
{
for(int j = i; j > poz; j --)
s[j] = s[j - 1];
s[poz] = x[poz];
return i - poz;
}
}
return 9999;
}
int aduMare(int poz)
{
if(s[poz] > x[poz])
return 0;
for(int i = poz + 1; i < s.size(); i ++)
{
if(s[i] > x[poz])
return i - poz;
}
return 9999;
}
int main()
{
int q;
cin >> q;
while(q > 0)
{
q --;
cin >> s;
int rez = 999999999;
int ok = 0;
for(int i = 0; i < s.size(); i ++)
{
if(s[i] != 'a')
ok = 1;
}
if(ok == 0)
cout << "-1\n";
else
{
int cost = 0;
for(int i = 0; i < min(s.size(), x.size()); i ++)
{
int w = aduMare(i);
rez = min(rez, cost + w);
cost += aduEgal(i);
}
if(s.size() > x.size())
rez = min(rez, cost);
cout << rez << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int t;
ll n, s, k;
ll powmod (ll a, ll b) {
if (b == 0) return 1;
if (b == 1) return a % n;
ll tmp = powmod(a, b / 2);
tmp = (tmp * tmp) % n;
if (b & 1) return (tmp * a) % n;
return tmp;
}
ll phi (ll x) {
ll res = x;
for (ll i = 2; i * i <= x; ++ i) {
if (x % i == 0) {
res -= res / i;
while (x % i == 0) x /= i;
}
}
if (x > 1) res -= res / x;
return res;
}
ll modInv (ll x) {
ll phin = phi(n);
return powmod(x, phin - 1);
}
void solve () {
cin >> n >> s >> k;
ll A = k, B = (n - s) % n, M = n;
ll g = __gcd(A, __gcd(B, M));
A /= g; B /= g; M /= g; n /= g;
if (__gcd(A, M) != 1) {
cout << -1 << '\n';
return;
}
ll ans = (modInv(A) * B + M) % M;
cout << ans << "\n";
}
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> t;
while (t --) solve();
return 0;
}
| #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <sstream>
#include <assert.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(bool x) {cerr << (x ? "true" : "false");}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
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...);}
#ifdef HOME
#warning CHECK int:ll::INT_MAX:LLONG_MAX
#define maxn 20
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define maxn 2000006
#define gcd __gcd
#define debug(x...)
#endif
#define ff first
#define endl '\n'
#define ss second
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define PI 3.14159265358979323846264338327950L
#define f(i,x,n) for(int i=x;i<=n;i++)
#define fr(i,x,n) for(int i=x;i>=n;i--)
struct _ { ios_base::Init i; _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); } } _;
int dx[] = { -1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
long long gcd(long long a, long long b, long long& x, long long& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long x1, y1;
long long d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
bool find_any_solution(long long a, long long b, long long c, long long &x0, long long &y0, long long &g) {
g = gcd(abs(a), abs(b), x0, y0);
if (c % g) return false;
x0 *= c / g;
y0 *= c / g;
if (a < 0) x0 = -x0;
if (b < 0) y0 = -y0;
return true;
}
int main() {
long long test; cin >> test;
for (long long tst = 1; tst <= test; ++tst) {
long long n, s, k; cin >> n >> s >> k;
long long g, x0, y0;
if (!find_any_solution(-k, n, s, x0, y0, g)) {
cout << -1 << "\n";
continue;
}
long long dec = n / g;
if (x0 > 0) x0 -= (x0 / dec) * dec;
else x0 += ((-x0 + dec - 1) / dec) * dec;
cout << x0 << "\n";
}
return 0;
} |
//------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#define int long long
using namespace std;
//type
//------------------------------------------
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
using vs=vector<string>;
//REPEAT
//------------------------------------------
#define REP(i,a,b) for(int i=(a);i<(b);++i)
//container util
//------------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(),(a).end()
#define PRINT(V) for (auto v : (V)) cout << v << " "
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
#define SZ(x) ((int)(x).size())
//constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
//math
//------------------------------------------
int QP(int a,int b){int ans=1;do{if(b&1)ans=1ll*ans*a%MOD;a=1ll*a*a%MOD;}while(b>>=1);return ans;}
int QP(int a,int b,int MOD){int ans=1;do{if(b&1)ans=1ll*ans*a%MOD;a=1ll*a*a%MOD;}while(b>>=1);return ans;}
int GCD(int a,int b){return b?GCD(b,a%b):a;}
//debug
//------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
//grobal variable
//------------------------------------------
int N,K;
vi Vec;
//main
//------------------------------------------
signed main(){
cin>>N;
vll A(N);
REP(i, 0, N) cin>>A[i];
ll mn, mx=0;
REP(l, 0, N){
mn=100000;
REP(r, l, N){
mn=min(mn, A[r]);
mx=max(mn*(r-l+1), mx);
}
}
cout<<mx<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = -1;
for (int i = 0; i < n; i++) {
int m = a[i];
for (int j = i; j < n; j++) {
m = min(m, a[j]);
if (ans < m * (j - i + 1)) {
ans = m * (j - i + 1);
}
}
}
cout << ans << endl;
} |
#include <algorithm>
#include <iostream>
#include <cstdint>
int main() {
int N, K;
std::cin >> N >> K;
std::int64_t sum = 0;
for (int ab = 2; ab <= 2 * N; ++ab) {
const int cd = ab - K;
if (cd < 2 || cd > 2 * N) continue;
sum += std::min<std::int64_t>(ab - 1, 2 * N - ab + 1) * std::min<std::int64_t>(cd - 1, 2 * N - cd + 1);
}
std::cout << sum << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
int main() {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
ll n,w;
cin >> n >> w;
cout << n/w << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.