code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
struct debug {
~debug(){cerr << endl;}
template<class c> debug& operator<<(c x) {cerr << x; return *this;}
template<class c, class d>
debug& operator<<(pair<c, d> x) {*this << "(" << x.first << ", " << x.second << ")";
return *this;}
template<class c> debug& operator<<(vector<c> x) { *this << "[";
int f = 0; for(auto it : x) { *this << (f?", ":""); *this << it; f = 1;}
*this << "]"; return *this;}
};
#define dbg(x) "[" << #x << ": " << x << "] "
#define Wa() cerr << "[LINE: " << __LINE__ << "] -> "; debug() <<
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(NULL)
int dp[1000+3][1000+3];
vector<int> a, b;
int f(int i, int j)
{
if(i == 0 || j == 0) {
return abs(i-j);
}
int& ret = dp[i][j];
if(ret != -1) return ret;
ret = min({f(i-1, j) + 1, f(i, j-1) +1, f(i-1, j-1) + (a[i-1] != b[j-1])});
return ret;
}
int main()
{
int n, m;
cin >> n >> m;
a = vector<int> (n);
b = vector<int> (m);
for(int& i : a) cin >> i;
for(int& i : b) cin >> i;
memset(dp, -1, sizeof dp);
cout << f(n, m) << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int n, m; cin >> n >> m;
vector<int> A(n), B(m);
rep(i, n)cin >> A[i];
rep(i, m)cin >> B[i];
vector<vector<ll>> dp(n+10, vector<ll>(m+10, LINF));
dp[0][0] = 0;
rep(i, n+1){
rep(j, m+1){
chmin(dp[i+1][j], dp[i][j]+1);
chmin(dp[i][j+1], dp[i][j]+1);
if(A[i]==B[j]){
chmin(dp[i+1][j+1], dp[i][j]);
}else{
chmin(dp[i+1][j+1], dp[i][j]+1);
}
}
}
cout << dp[n][m] << ln;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a+b>=15&&b>=8)
{
cout<<1;
return 0;
}
else if(a+b>=10&&b>=3)
{
cout<<2;
return 0;
}
else if(a+b>=3)
{
cout<<3;
return 0;
}
else
{
cout<<4;
return 0;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define lld long double
#define inf 1000000000
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define mod2 998244353
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; ++i)
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define w(x) int x; cin>>x; while(x--)
#define in(a) for(auto &x: a)cin>>x;
void print(bool n){if(n)cout<<"YES\n";else cout<<"NO\n";}
signed main(){
fastio
int a,b;
cin>>a>>b;
if(a+b>=15 && b>=8)cout<<1<<'\n';
else if(a+b>=10 && b>=3)cout<<2<<'\n';
else if(a+b>=3)cout<<3<<'\n';
else cout<<4<<'\n';
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i )
typedef std::pair<int,int> pint;
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<pint> p(N);
rep(i,N){
cin >> p[i].first >> p[i].second;
}
int count = 0;
for(int i = 0;i < (N - 1);i++){
for(int j = i + 1;j < N;j++){
float x = abs(p[i].first - p[j].first);
float y = abs(p[i].second - p[j].second);
float g = y / x;
//cout << g << endl;
if((0 <= g) && (g <= 1)){
//cout << x << ' '<< y << endl;
count++;
}
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
#include <bitset>
// #include <atcoder/all>
#include <fstream>
#include <random>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
// using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef int itn;
const ll LINF = 1e16;
const ll INF = 1e16;
//マクロ定義
#define vvint(vec,n,m,l) vector<vector<int>> vec(n, vector<int>(m,l)); // lで初期化
#define vvll(vec,n,m,l) vector<vector<ll>> vec(n,vector<ll>(m,l));
#define vint vector<int>
#define pint pair<int,int>
#define rep(i,a) for(ll i=0;i<(a);i++)
#define all(x) (x).begin(),(x).end()
#define debug system("pause") //デバッグ用
#define ret return 0
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 = 1000000007;
const ll MOD2 = 998244353;
const long double PI = 3.1415926535897932;
using Graph = vector<vector<ll>>;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(15); // 15桁表示指定
ll n;
cin >> n;
ll ans = n;
ll b = 2;
for (int i = 1; i <= 60; i++)
{
ll a = n / b;
ll c = n % b;
ans = min(ans, a + i + c);
b *= 2;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MOD 1000000007
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(){
ll n, ans=0;
cin >> n;
ll maxa=0, x, y;
vector<ll> a, b;
rep(i, n){
cin >> x;
a.push_back(x);
}
rep(i, n){
cin >> x;
b.push_back(x);
}
rep(i, n){
chmax(maxa, a[i]);
chmax(ans, maxa*b[i]);
cout << ans << endl;
}
return 0;
}
| ///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<int,int>
#define nd(a,b,c) mp(mp(a,b),c)
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=2e18;
const int mod=1e9+7;
const int M=200005;
int a[M],b[M],n;
main()
{
fast
cin>>n;
f(i,1,n)
{
cin>>a[i];
}
f(i,1,n)
{
cin>>b[i];
}
int ses=0,mx=0;
f(i,1,n)
{
mx=max(mx,a[i]);
ses=max(ses,mx*b[i]);
cout<<ses<<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pi (acos(-1.0))
#define fff ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
int main() {
fff;
long long r, x, y; cin>>r>>x>>y;
long double d = sqrt(x*x*1.0 + y*y*1.0);
long long dd= ceil(d/r);
if(dd==1LL && ((x*x)+(y*y))%(r*r))
dd++;
cout << dd<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tp tuple<int,int,int>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const int N = 1e6 + 6;
int ara[10];
int solve(int id , int taken , int tgt) {
if(id == 5) return taken == tgt;
return ( solve(id+1, taken + ara[id] , tgt) | solve(id+1 , taken , tgt) );
}
int main() {
fastio;
int tot = 0;
for(int i = 1; i <= 4 ; i++ ) cin>>ara[i] , tot += ara[i];
if(tot%2) {
cout<<"No\n";
return 0;
}
int ok = solve(1 , 0 , tot/2)<<'\n';
if(ok) cout<<"Yes\n";
else cout<<"No\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define seive_len 10000001
typedef long long int lli;
vector<bool> seive(seive_len, true);
const int MOD = 1000000007;
lli primeSeive[seive_len];
lli gcd(lli a, lli b) {
if(b == 0)
return a;
return gcd(b, a%b);
}
lli lcm(lli a, lli b) {
lli gcd_ = gcd(a, b);
lli lcm_ = (a*b)/gcd_;
return lcm_;
}
lli ncr(lli n, lli r) {
lli res = 1;
if(r > n-r)
r = n-r;
for(lli i=0;i<r;i++) {
res *= (n-i);
res /= (i+1);
}
return res;
}
lli ncrMODp(lli n, lli r) {
if(r > n-r)
r = n-r;
lli prow[r+1];
memset(prow, 0, sizeof(prow));
prow[0] = 1;
for(lli i=1;i<=n;i++) {
for(lli j=min(i, r);j>0;j--) {
prow[j] = (prow[j]+prow[j-1])%MOD;
}
}
return prow[r];
}
lli fastPower(lli a, lli b) {
lli res=1;
while(b > 0) {
if(b&1)
res *= a;
a *= a;
b >>= 1;
}
return res;
}
lli fastPowerMODp(lli a, lli b) {
a %= MOD;
lli res = 1;
while(b) {
if(b%2 == 1)
res = (res*a)%MOD;
a = (a*a)%MOD;
b >>= 1;
}
return res;
}
void multiply(lli a[][2], lli b[][2]) {
lli res[2][2];
memset(res, 0, sizeof(res));
for(lli i=0;i<2;i++) {
for(lli j=0;j<2;j++) {
for(lli k=0;k<2;k++) {
res[i][j] += a[i][k]*b[k][j]%MOD;
}
}
}
for(lli i=0;i<2;i++)
for(lli j=0;j<2;j++)
a[i][j] = res[i][j];
}
void matrixExpo(lli a[][2], lli n) {
if(n == 0 || n == 1)
return;
lli b[][2] = {{1,1}, {1,0}};
matrixExpo(a, n/2);
multiply(a, a);
if(n%2)
multiply(a, b);
}
void makeSeive() {
for(lli i=2;i*i<=seive_len;i++) {
if(seive[i]) {
for(lli j=i*i;j<=seive_len;j+=i)
seive[j] = false;
}
}
}
void makePrimeSeive() {
for(lli i=1;i<seive_len;i++)
primeSeive[i] = i;
for(lli i=4;i<seive_len;i+=2)
primeSeive[i] = 2;
for(lli i=3;i*i<seive_len;i++) {
if(primeSeive[i] == i) {
for(lli j=i*i;j<seive_len;j+=i) {
if(primeSeive[j] == j)
primeSeive[j] = i;
}
}
}
}
bool isPrime(lli n) {
for(lli i=2;i<=sqrt(n);i++) {
if(n%i == 0)
return false;
}
return true;
}
void getInput(vector<lli>& a, lli n) {
lli x;
for(lli i=0;i<n;i++) {
cin >> x;
a.push_back(x);
}
}
void testCase() {
lli n;
cin >> n;
vector<lli> a(n), b(n);
for(lli i=0;i<n;i++)
cin >> a[i] >> b[i];
lli sum = 0, suma = 0;
for(lli i: b)
sum += i;
for(lli i: a)
suma += i;
vector<pair<lli, lli>> c;
for(lli i=0;i<n;i++)
c.push_back({2*a[i]+b[i], i});
sort(c.rbegin(), c.rend());
sum = 0;
lli i = 0;
while(sum <= suma) {
sum += a[c[i].second]+b[c[i].second];
suma -= a[c[i].second];
i++;
}
cout << i;
}
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
lli t=1;
// cin >> t;
// makePrimeSeive();
makeSeive();
// FILE* fp;
// fp = fopen("out.txt", "w");
for(lli i=1;i<=t;i++) {
// fprintf(fp, "Case #%d:\n", i);
// cout << "Case #" << i << ":" << ' ';
// cout << "Scenario #" << i << ":" << endl;
testCase();
cout << '\n';
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<vector>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const ll maxn = 200010;
ll a[200010],b[200010],ans[200010];
struct st{
ll a,b,c,d;
}p[200010];
bool cmp(st aa,st bb){
return aa.d+aa.a>bb.d+bb.a;
}
int main(){
ll n;
cin>>n;
ll s=0;
ll a,b;
for(ll i=0;i<n;i++){
cin>>p[i].a>>p[i].b;
p[i].c=p[i].b-p[i].a;
p[i].d=p[i].b+p[i].a;
s-=p[i].a;
}
sort(p,p+n,cmp);
ll cnt=0,j=0;
while(s<=0){
s+=p[j].d+p[j].a;
j++;
cnt++;
}
cout<<cnt<<endl;
}
|
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;
#define PB push_back
#define For(i, n) for (ll i = 0; i < n; i++)
#define PYES cout<<"YES\n"
#define PNO cout<<"NO\n"
#define PYes cout<<"Yes\n"
#define PNo cout<<"No\n"
#define vll vector<ll>
#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<int>())
#define mnv(v) *min_element(v.begin(),v.end())
#define mxv(v) *max_element(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define Fas ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int M= 1e9 +7;
//--------------------------------------------functions-------------------------------------------------//
ll power(ll a,ll b){int result=1;while(b>0){if(b%2 == 1){result *= a;} a *= a;b /= 2;}return result;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
ll countSetBits(ll x){ll Count=0;while(x>0){if(x&1) Count++;x=x>>1;}return Count;}
bool isPerfectSquare(ll n){ll sr = sqrt(n);if (sr * sr == n)return true;else return false;}
ll mod(ll x){return ((x%M + M)%M);}
ll add(ll a, ll b){return mod(mod(a)+mod(b));}
ll mul(ll a, ll b){return mod(mod(a)*mod(b));}
ll powerM(ll a,ll b){ll res=1;while(b){if(b%2==1){res=mul(a,res);}a=mul(a,a);b/=2;}return res;}
//------------------------------------sieve of erantothenes-----------------------------------------------//
vector<bool> sieve_of_eratothenes(ll n){
vector<bool> a(n+1,1);
a[0]=0;
a[1]=0;
for(ll i=2;i<=sqrt(n);i++){
if(a[i]==1){
for(ll j=2;i*j<=n;j++){
a[j*i]=0;
}
}
}
return a;
}
//----------------------------------------nCr mod------------------------------------------------------//
ll modInverse(ll n){
return powerM(n,M-2);
}
ll nCrM(ll n,ll r){
if(n<r) return 0;
if(r==0) return 1;
vector<ll> fact(n+1);
fact[0]=1;
for(ll i=1;i<=n;i++){
fact[i]=mul(fact[i-1],i);
}
return mul(mul(fact[n],modInverse(fact[r])),modInverse(fact[n-r]));
}
//-----------------------------------------------solve-----------------------------------------------------//
void solve(){
ll a,b;cin>>a>>b;
if(a+b>=15 && b>=8){
cout<<1<<endl;
}else if(a+b>=10 && b>=3){
cout<<2<<endl;
}else if(a+b>=3){
cout<<3<<endl;
}else{
cout<<4<<endl;
}
}
int main(){
Fas;
// ll t=0;
// cin>>t;
// while(t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int a, b;
int main(){
scanf("%d%d", &a, &b);
if((a+b) >= 15 && b >= 8){
puts("1");
}else if((a+b) >= 10 && b >= 3){
puts("2");
}else if((a+b) >= 3){
puts("3");
}else puts("4");
} |
#include<iostream>
#include<string>
#include<queue>
#include<map>
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>PII;
typedef long long ll;
ll split(ll n) {
ll i, j, te, x, xlen;
for (i = 1, xlen = 0; (te = i * (i - 1) / 2) < n; i++) {
x = n - te;
if (x % i == 0) {
x /= i;
xlen++;
}
}
return xlen;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
if(n==1){
cout<<2<<endl;
}
else cout<<2*split(n)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "false");}
template <typename A> string to_string(A);
template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
template <typename A> string to_string(A v) {bool f = 1; string r = "{"; for (const auto &x : v) {if (!f)r += ", "; f = 0; r += to_string(x);} return r + "}";}
void debug_out() { cout << endl; }
void show() { cout << endl; }
void pret() { cout << endl; exit(0);}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {cout << " " << to_string(H); debug_out(T...);}
template <typename Head, typename... Tail> void show(Head H, Tail... T) {cout <<H<<" "; show(T...);}
template <typename Head, typename... Tail> void pret(Head H, Tail... T) {cout <<H<<" "; pret(T...);}
#define pr(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef long long ll;
#define int ll
typedef long double ld;
typedef vector<int> vi;
#define disp(x) cout<<x<<" ";
#define rep(i,a,b) for(int i=a;i<(int)b;i++)
#define fo(i,a,b) for(int i=a;i<=(int)b;i++)
#define rf(i,a,b) for(int i=a;i>=(int)b;i--)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
#define endl '\n'
//cout.setf(ios::fixed);cout.precision(18)
const int MOD = 1e9+7;
const int maxn = 1e7 +10;
bool f(int n, int tot){
tot *= 2;
if(tot % n != 0) return 0;
tot /= n;
tot -= (n - 1);
// show(n, tot);
return ((tot % 2) == 0 and tot / 2 > 0);
}
int32_t main(){
fast_io;
int n;
cin >> n;
int ans = 0;
fo(i, 1, maxn){
if(f(i, n)) ans++;
}
show(ans * 2);
return 0;
} |
#pragma GCC optimize("O3")
// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }
template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg!=',')cerr<<*sdbg++;
cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}
template<class T> ostream &operator<<(ostream& os, vector<T> V) {
os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
return os << "(" << P.st << "," << P.nd << ")";
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
// using mint = modint998244353;
// ostream& operator<<(ostream& out, mint m){
// out << m.val();
// return out;
// }
const int P = 998244353;
void add(int &a,int b){
a += b;
if(a >= P)
a -= P;
}
void sub(int &a,int b){
a -= b;
if(a < 0)
a += P;
}
int mul(int a,int b){
return a * b % P;
}
int n;
int res = 0;
vector<vector<int>> dp;
vector<int> t;
void add(int x){
int pom = t[x];
int a = SZ(dp);
int b = SZ(dp[0]);
vector<vector<int>> dp2(a + 1,vector<int>(b + pom));
R(i,a)R(j,b){
add(dp2[i + 1][j + pom], mul(dp[i][j], i + 1));
if(j <= pom){
add(dp2[a - i][pom - j], mul(dp[i][j], a - i));
}else{
add(dp2[i][j - pom], mul(dp[i][j], a - i));
}
}
// debug(dp,pom,dp2);
swap(dp,dp2);
}
void licz(int po,int ko){
if(po + 1 == ko){
debug(po,dp);
R(i,SZ(dp)){
R(j,min(SZ(dp[0]), t[po])){
sub(res, dp[i][j]);
}
}
debug(po,t[po],res);
return;
}
int m = (po + ko) / 2;
auto pam = dp;
for(int i = po; i < m; i++)add(i);
licz(m,ko);
swap(dp,pam);
for(int i = m; i < ko; i++)add(i);
licz(po,m);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(11);
cerr << fixed << setprecision(6);
cin >> n;
t.resize(n);
res = 1;
R(i,n){
cin >> t[i];
res = mul(res, i + 1);
}
debug(res);
dp.resize(1,vector<int>(1,1));
licz(0,n);
cout << res << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
template<class T> T T_INF(){ return 1000000000000000000; }
template<> int T_INF<int>(){ return 1000000000; }
template<int MOD> struct modint{
ull val;
modint(ull x){ val=x%MOD; }
modint(){}
friend modint modpow(modint x,ull k){
modint ret(1ULL);
while(k>0){
if(k&1ULL)ret*=x;
x*=x;
k>>=1;
}
return ret;
}
modint& operator +=(const modint& rhs){
this->val+=rhs.val;
if(this->val>=MOD)this->val-=MOD;
return *this;
}
friend modint operator+(modint lhs, const modint& rhs){
lhs+=rhs;
return lhs;
}
modint& operator -=(const modint& rhs){
this->val+=MOD-rhs.val;
if(this->val>=MOD)this->val-=MOD;
return *this;
}
friend modint operator-(modint lhs, const modint& rhs){
lhs-=rhs;
return lhs;
}
modint& operator *=(const modint& rhs){
this->val*=rhs.val;
this->val%=MOD;
return *this;
}
friend modint operator*(modint lhs, const modint& rhs){
lhs*=rhs;
return lhs;
}
static vector<modint> inv_;
static void precalc_inv_(int k){
int t=inv_.size();
inv_.resize(k);
for(int i=t;i<k;i++){
inv_[i]=modpow(modint(i),MOD-2);
}
}
modint& operator /=(const modint& rhs){
//if(rhs.val<inv_.size()){
// (*this)*=inv_[rhs.val];
//}
//else {
(*this)*=modpow(rhs,MOD-2);
//}
return *this;
}
friend modint operator/(modint lhs, const modint& rhs){
lhs/=rhs;
return lhs;
}
static vector<vector<modint>> C_;
static vector<modint> fac,inv_fac;
static void precalc_C_(int k){
C_.resize(k,vector<modint>(k));
for(int i=0;i<k;i++){
C_[i][0]=C_[i][i]=1;
for(int j=1;j<=i-1;j++){
C_[i][j]=C_[i-1][j-1]+C_[i-1][j];
}
}
}
static void precalc_fac(int k){
fac.resize(k);
inv_fac.resize(k);
fac[0]=inv_fac[0]=1;
for(int i=1;i<k;i++){
fac[i]=fac[i-1]*i;
inv_fac[i]=modpow(fac[i],MOD-2);
}
}
static modint C(ll n,ll k,int type=0){
if(k<0||k>n)return 0;
if(type==0){
return C_[n][k];
}
else {
return fac[n]*inv_fac[k]*inv_fac[n-k];
}
}
};
template<int MOD> vector<modint<MOD>> modint<MOD>::inv_;
template<int MOD> vector<vector<modint<MOD>>> modint<MOD>:: C_;
template<int MOD> vector<modint<MOD>> modint<MOD>::fac;
template<int MOD> vector<modint<MOD>> modint<MOD>::inv_fac;
const int MOD=998244353;
typedef modint<MOD> mi;
int n;
int w[102];
mi dp[102][10002];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&w[i]);
for(int i=0;i<102;i++)for(int j=0;j<10002;j++)dp[i][j]=0;
dp[0][0]=1;
for(int i=0;i<n;i++){
for(int j=i;j>=0;j--)for(int k=0;k<10002;k++){
if(k+w[i]<10002)dp[j+1][k+w[i]]+=dp[j][k];
}
}
int sum=0;
for(int i=0;i<n;i++)sum+=w[i];
if(sum%2==1){
puts("0");
return 0;
}
mi::precalc_fac(102);
mi ret=0;
for(int i=1;i<=n;i++){
ret+=dp[i][sum/2]*mi::fac[i]*mi::fac[n-i];
}
cout<<ret.val<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
vector<int> posx(n, 0);
vector<int> posy(n, 0);
iota(posx.begin(), posx.end(), 0);
iota(posy.begin(), posy.end(), 0);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
sort(posx.begin(), posx.end(), [&](int i, int j) {
return x[i] < x[j];
});
sort(posy.begin(), posy.end(), [&](int i, int j) {
return y[i] < y[j];
});
set<int> candidates;
candidates.insert(posx[0]);
candidates.insert(posx[1]);
candidates.insert(posx[n - 2]);
candidates.insert(posx[n - 1]);
candidates.insert(posy[0]);
candidates.insert(posy[1]);
candidates.insert(posy[n - 2]);
candidates.insert(posy[n - 1]);
vector<int> dis;
for (auto i = candidates.begin(); i != candidates.end(); i++) {
for (auto j = i; j != candidates.end(); j++) {
if (i == j) continue;
dis.push_back(max(abs(x[*i] - x[*j]), abs(y[*i] - y[*j])));
}
}
sort(dis.begin(), dis.end(), greater<int>());
cout << dis[1];
return 0;
} | #include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
pair<int, int> p[400009];
int st[800009], lz[800009];
void lazy(int tn, int s, int e)
{
if (lz[tn] != 0) {
st[tn] += lz[tn];
if (s != e) {
lz[tn * 2] += lz[tn];
lz[tn * 2 + 1] += lz[tn];
}
lz[tn] = 0;
}
}
void update(int tn, int s, int e, int ts, int te, int w)
{
lazy(tn, s, e);
if (e < ts || s > te) return;
if (ts <= s && e <= te) {
lz[tn] += w;
lazy(tn, s, e);
return;
}
int md = (s + e) / 2;
update(tn * 2, s, md, ts, te, w); update(tn * 2 + 1, md + 1, e, ts, te, w);
if (s != e) st[tn] = min(st[tn * 2], st[tn * 2 + 1]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (int i = 1; i <= 2 * n; i++) {
cin >> p[i].first;
if (i <= n) p[i].second = n - i + 1;
else p[i].second = i - n;
}
sort(p + 1, p + 2 * n + 1); reverse(p + 1, p + 2 * n + 1);
long long ans = 0;
for (int i = 1; i <= n; i++)
update(1, 1, n, i, n, 1);
for (int i = 1; i <= 2 * n; i++) {
update(1, 1, n, p[i].second, n, -1);
if (st[1] < 0) {
update(1, 1, n, p[i].second, n, 1);
continue;
}
ans += p[i].first;
}
cout << ans << '\n';
return 0;
} |
//#include <atcoder/maxflow.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <iterator>
#include <random>
#include <chrono>
#include <complex>
#include <bitset>
#include <fstream>
#define forr(i,start,count) for (int i = (start); i < (start)+(count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) int i; cin >> i
#define readll(i) ll i; cin >> i
#define readdouble(i) double i; cin >> i
#define readstring(s) string s; cin >> s
typedef long long ll;
//using namespace __gnu_pbds;
//using namespace atcoder;
using namespace std;
//const ll modd = (1000LL * 1000LL * 1000LL + 7LL);
const ll modd = 998244353;
int main(int argc, char *argv[]) {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(0, modd); // rand_gen(rng) gets the rand no
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(12);
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readll(n);
ll pow2 = 1;
ll b = 0;
ll ans = n;
while (true) {
ll c = n%pow2;
ll a = n/pow2;
ans = min(ans, a+b+c);
if (pow2>n) { break; }
++b;
pow2 *= 2;
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<ll,ll>;
#define pb push_back
int main(){
vvl tate(29, vl(30,0));
vvl yoko(30, vl(29,0));
rep(_,1000){
int a, b, ato, bto;
cin >> a >> b >> ato >> bto;
int ma = a;
int mb = b;
string ans;
while(a != ato || b != bto){
if (a == ato){
if (b < bto){
b++;
ans.pb('R'); continue; // continueの貼り付けを忘れると
} else { // バグる ato btoが連続するからです
b--; // 全てに張り付けておく必要があるので
ans.pb('L'); continue;
}
}
if (b == bto){
if (a < ato){
a++;
ans.pb('D'); continue;
} else {
a--;
ans.pb('U'); continue;
}
}
if (a < ato && b < bto){
// 下 右
if (tate[a][b] < yoko[a][b]){
a++; // 縦移動優先
ans.pb('D'); continue;
} else {
b++;
ans.pb('R'); continue;
}
}
if (a < ato && b > bto){
// 下 左
if (tate[a][b] < yoko[a][b-1]){
a++; // 縦移動優先
ans.pb('D'); continue;
} else {
b--;
ans.pb('L'); continue;
}
}
if (a > ato && b < bto){
// 上 右
if (tate[a-1][b] < yoko[a][b]){
a--; // 縦移動優先
ans.pb('U'); continue;
} else {
b++;
ans.pb('R'); continue;
}
}
if (a > ato && b > bto){
// 上 左 ここから続き
if (tate[a-1][b] < yoko[a][b-1]){
a--; // 縦移動優先
ans.pb('U'); continue;
} else {
b--;
ans.pb('L'); continue;
}
}
}
cout << ans << endl; // flushを炊く
ll average;
cin >> average;
average /= ans.size(); // 一歩当たりのコスト計算
// cout << average << endl; // debug
rep(i,ans.size()){
if (ans[i] == 'U'){
tate[ma-1][mb] = (tate[ma-1][mb] + average)/2;
ma--; // 実数値に近づけていく方針にした
}
if (ans[i] == 'D'){
tate[ma][mb] = (tate[ma][mb] + average)/2;
ma++;
}
if (ans[i] == 'L'){
yoko[ma][mb-1] = (yoko[ma][mb-1] + average)/2;
mb--;
}
if (ans[i] == 'R'){
yoko[ma][mb] = (yoko[ma][mb] + average)/2;
mb++;
}
}
// for(auto x : tate){ // コスト計算debug
// for(auto y : x){
// cout << y << " ";
// } cout << endl;
// }
// for(auto x : yoko){
// for(auto y : x){
// cout << y << " ";
// } cout << endl;
// }
}
} |
/* stuff you should look for
* int overflow, array bounds, uppercase/lowercase
* special cases (n=1?)
* do sth. instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
#include<cstdio>
#include<string>
#include<iostream>
#include<map>
char s[15];
std::map<int,std::string> mp;
int main() {
int n; scanf("%d",&n);
for(register int i=1;i<=n;++i) {
int v;
scanf("%s%d",s,&v);
std::string str=s;
mp[v]=str;
}
std::map<int,std::string>::iterator it=mp.end(); --it; --it;
printf("%s\n",it->second.c_str());
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct sa{
string nam;
int gd;
}a[1005];
int n;
bool cmp(sa x,sa y){
return x.gd<y.gd;
}
int main(){
cin>>n;
for(int i=1;i<=n;++i){
cin>>a[i].nam>>a[i].gd;
}
sort(a+1,a+n+1,cmp);
cout<<a[n-1].nam;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int k, n, dep[200010];
char vis[200010];
vector <int> gl[200010];
int check(const int &u, const int &d, int &cnt);
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
scanf("%d%d", &n, &k);
for (int i = 1; i < n; ++i) {
int u, v; scanf("%d%d", &u, &v);
gl[--u].push_back(--v); gl[v].push_back(u);
}
int l = 1, r = n - 2, ans = n - 1;
while (l <= r) {
const int mid = l + r >> 1;
memset(vis, 0, n);
int cnt = 0, ret = check(0, mid, cnt);
if (ret < 0)
++cnt;
if (cnt > k)
l = mid + 1;
else
r = mid - 1, ans = mid;
}
printf("%d\n", ans);
return 0;
}
int check(const int &u, const int &d, int &cnt) {
vis[u] = 1;
int maxv = 0, minv = 0;
for (int i = 0; i < gl[u].size(); ++i) {
int &v = gl[u][i];
if (vis[v])
continue;
int tmp = 0, ret = check(v, d, tmp);
maxv = max(maxv, ret), minv = min(minv, ret);
cnt += tmp;
}
if (maxv + minv >= 1)
return maxv - 1;
else if (minv == -d) {
++cnt;
return d;
}
else
return minv - 1;
}
| #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int LOG = 22;
vector<int> G[200010];
int parent[25][200010];
int d[200010];
void dfs(int s, int p){
parent[0][s] = p;
for(int v:G[s]){
if(v==p) continue;
d[v] = d[s] + 1;
dfs(v,s);
}
}
void init(int sz,int root){
d[root] = 0; dfs(root,-1);
for(int k=0;k<LOG;k++){
for(int i=0;i<sz;i++){
if(parent[k][i]<0) parent[k + 1][i] = -1;
else parent[k + 1][i] = parent[k][parent[k][i]];
}
}
}
int lca(int u, int v){
if(d[u]>d[v]) swap(u,v);
for(int k = 0;k<LOG;k++){
if((d[v] - d[u])&(1<<k)){
v = parent[k][v];
}
}
if(u==v) return u;
for(int k = LOG-1;k>=0;k--){
if(parent[k][u]!=parent[k][v]){
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
int dist(int u,int v){return d[u] + d[v] - 2*d[lca(u,v)];}
vector<int> used;
//bool dp[200010][210];
void dfs2(int s,int p,int x){
used[s] = 1;
if(x==0) return;
//if(x==0 || dp[s][x]) return;
//dp[s][x] = true;
for(int v: G[s]){
if(v==p) continue;
dfs2(v,s,x - 1);
}
}
int main(){
int i,n,k; cin >> n >> k;
for(i=0;i<n - 1;i++){
int a,b; cin >> a >> b; a--; b--;
G[a].push_back(b); G[b].push_back(a);
}
if(k==n){
cout << 0 << endl;
return 0;
}
init(n,0);
vector<pair<int,int>> p;
for(i=0;i<n;i++) p.push_back({d[i],i});
sort(p.begin(),p.end()); used.resize(n);
int l = 0,r = n/k;
while(r - l>1){
int mid = (l + r)/2,num = 0;
vector<int> v;
for(i=0;i<n;i++) v.push_back(p[i].second), used[i] = 0;
if(mid<=200 && k>100){
while(v.size()){
int u = v.back(); v.pop_back();
if(used[u]) continue;
for(i=0;i<mid;i++){
if(parent[0][u]==-1) break;
u = parent[0][u];
}
num++;
dfs2(u,-1,mid);
}
}else{
vector<int> col;
while(v.size()){
int u = v.back(); v.pop_back();
bool f = true;
for(i=0;i<col.size();i++){
if(dist(u,col[i])<=mid) f = false;
}
int x = min(mid,d[u]);
for(i=LOG;i>=0;i--){
if((x>>i)&1) u = parent[i][u];
}
if(f) col.push_back(u);
if(col.size()>k) break;
}
num = col.size();
}
if(num<=k) r = mid;
else l = mid;
}
cout << r << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int x[2010];
int y[2010];
int main() {
int n,t,li,ri,ans;
cin >> n;
rep(i,n){
cin >> t >> li >> ri;
li*=2;
ri*=2;
if(t==2)ri--;
if(t==3)li++;
if(t==4){
li++;
ri--;
}
x[i]=li;
y[i]=ri;
}
ans=0;
rep(i,n){
rep(j,n){
if(i>=j) continue;
if(y[i]<x[j]) continue;
if(y[j]<x[i]) continue;
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = 1e9+7;
int main(){
ll n;
cin >> n;
double t, a, b;
vector<pair<double, double>>v;
for(ll i=0; i<n; i++){
cin >> t >> a >> b;
if(t == 1)
v.push_back(make_pair(a, b));
else if(t == 2)
v.push_back(make_pair(a, b-0.5));
else if(t == 3)
v.push_back(make_pair(a+0.5, b));
else if(t == 4)
v.push_back(make_pair(a+0.5, b-0.5));
}
ll ans = 0;
for(int i=0; i<n-1; i++){
for(int j=i+1; j<n; j++){
if(max(v[i].first, v[j].first) <= min(v[i].second, v[j].second))
ans++;
}
}
cout << ans << endl;
return 0;
} |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order(k): It returns to an iterator to the kth element (counting from zero) in the set
// order_of_key(k) : It returns to the number of items that are strictly smaller than our item k
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define f first
#define s second
#define F(i,a,b) for(i=a;i<b;i++)
#define nl "\n"
#define sp " "
#define all(c) (c).begin(),(c).end()
#define rev(i,b,a) for(int i=b;i>=a;i--)
#define iota cout<<-1<<nl
#define cty cout<<"YES"<<nl
#define ctn cout<<"NO"<<nl
#define lmax LLONG_MAX
#define lmin LLONG_MIN
#define sz(v) (v).size()
#define deci(n) fixed<<setprecision(n)
#define c(x) cout<<(x)
#define csp(x) cout<<(x)<<" "
#define c1(x) cout<<(x)<<nl
#define c2(x,y) cout<<(x)<<" "<<(y)<<nl
#define c3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<nl
#define c4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<nl
#define c5(a,b,c,d,e) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<" "<<(e)<<nl
#define c6(a,b,c,d,e,f) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<" "<<(e)<<" "<<(f)<<nl
typedef long double ld;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
const int mod=998244353;
const int mod1=1000000007;
const double pi=3.14159265358979323846264338327950288419716939937510582097494459230;
// priority_queue<t>
ll max(ll a , ll b){ if(a>b)return a; return b;}
ll min(ll a , ll b){ if(a<b)return a; return b;}
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll pct(ll x) { return __builtin_popcount(x); } // # of bits set
ll poww(ll a, ll b) { ll res=1; while(b) { if(b&1) res=(res*a); a=(a*a); b>>=1; } return res; }
ll modI(ll a, ll m=mod) { ll m0=m,y=0,x=1; if(m==1) return 0; while(a>1) { ll q=a/m; ll t=m; m=a%m; a=t; t=y; y=x-q*y; x=t; } if(x<0) x+=m0; return x;}
ll powm(ll a, ll b,ll m=mod) {ll res=1; while(b) { if(b&1) res=(res*a)%m; a=(a*a)%m; b>>=1; } return res;}
//*******************************************************************************************************************************************//
vector<pair<ll,pll>>v[100001];
bool vis[100001]={0};
ll dp[100001];
ll n;
ll calc(ll st, ll c, ll d)
{
return max(st,sqrt(d));
}
void bfs(ll s)
{
ll i,j,d,x,y;
for(i=1;i<=n;i++)dp[i]=lmax;
priority_queue<pll>q;
q.push({0,1});
dp[1]=0;
while(q.size())
{
x=q.top().s;
q.pop();
if(vis[x])
continue;
vis[x]=1;
for(auto u:v[x])
if(u.f!=x)
{
d=calc(dp[x],u.s.f,u.s.s);
d=u.s.f+fdiv(u.s.s,d+1)+d;
if(d<dp[u.f])
{//c2(u.f,d);
dp[u.f]=d;
q.push({-1*dp[u.f],u.f});
}
}
}
}
void iamzeus()
{ ll i,j,x=0,y,ans=0,m,d,cnt=0,z,c=2,k;
cin>>n>>m;
for(i=0;i<m;i++)
{
cin>>x>>y>>z>>d;
v[x].pb({y,{z,d}}),v[y].pb({x,{z,d}});
}
bfs(1);
if(dp[n]==lmax)
iota;
else
c1(dp[n]);
};
int main()
{fast;
int t;
t=1;
//cin >>t;
while(t--)
iamzeus();
}
| #include<bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
int N, M;
vector<pair<int, pii>> G[100010];
int dist[100010];
//時刻tかそれ以降にCi=c,Di=dの道の通行を始めるとき、最短で到着する時刻
int earliest(int c, int d, int t) {
int T = sqrt(d) - 1;
int T2 = sqrt(d);
if (T < t)T = t;
if (T2 < t)T2 = t;
return min({t + c + d / (t + 1), T + c + d / (T + 1), T2 + c + d / (T2 + 1)});
}
void dijkstra() {
priority_queue<pii, vector<pii>, greater<pii>> pq;
dist[0] = 0;
for (int i = 1; i < N; ++i)dist[i] = INF;
pq.emplace(dist[0], 0);
while (!pq.empty()) {
pii p = pq.top();
pq.pop();
int v = p.second;
if (dist[v] < p.first)continue;
for (auto e:G[v]) {
int to = e.first;
int c = e.second.first;
int d = e.second.second;
int time = earliest(c, d, dist[v]);
if (dist[to] > time) {
dist[to] = time;
pq.emplace(dist[to], to);
}
}
}
}
signed main() {
cin >> N >> M;
rep(i, M) {
int a, b, c, d;
cin >> a >> b >> c >> d;
--a, --b;
G[a].emplace_back(b, pii(c, d));
G[b].emplace_back(a, pii(c, d));
}
dijkstra();
if (dist[N - 1] == INF)cout << -1 << endl;
else cout << dist[N - 1] << endl;
return 0;
}
|
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#include<queue>
#include<cstdio>
#include<vector>
#include <algorithm>
#include<map>
#define rep(i,n) for (int i=0;i<(n);++i)
using ll = long long;
using namespace std;
using P = pair<int,int>;
#define INF 1000000000
int main(){
map<char,ll> mp;
vector<string> s(3);
set<char> head;
rep(i,3) cin>>s[i];
rep(i,3){
reverse(s[i].begin(),s[i].end());
ll co = 1;
if(i == 2) co = -1;
for(char c : s[i]){
mp[c] += co;
co *= 10;
}
reverse(s[i].begin(),s[i].end());
head.insert(s[i][0]);
}
if(mp.size() > 10){
cout<<"UNSOLVABLE"<<endl;
return 0;
}
vector<int> p(10);
iota(p.begin(),p.end(),0);
do{
int i = 0;
ll tot = 0;
for(auto x:mp){
char c = x.first;
ll co = x.second;
if(p[i] == 0 && head.count(c)) tot = 1e18;
tot += co*p[i];
++i;
}
if(tot == 0){
i = 0;
for(auto& x:mp){
x.second = p[i];
++i;
}
rep(i,3){
ll k = 0;
for(char c : s[i]){
k = k*10 + mp[c];
}
cout<<k<<endl;
}
return 0;
}
}while(next_permutation(p.begin(),p.end()));
cout<<"UNSOLVABLE"<<endl;
return 0;
} | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define pb push_back
#define INF 1000000000
#define LL_MAX 1000000000000000000
#define LL_MIN -1000000000000000000
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265358979323846264338327950288419716939937510
#define ll int64_t
#define ld long double
#define vi vector <int>
#define vb vector<bool>
#define vvi vector <vector<int>>
#define vll vector<ll>
#define vvl vector <vector<ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define pld pair<ld,ld>
#define vpll vector<pair<ll,ll>>
#define vpld vector<pair<ld,ld>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fs(x) fixed<<setprecision(x)
#define print(a) {for(auto x:a){cout << x << " ";}}
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
bool chmin(ll& a, const ll& b) {
return b < a ? a = b, 1 : 0;
}
bool chmax(ll& a, const ll& b) {
return a < b ? a = b, 1 : 0;
}
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
const int N = 1e7;
void run_case() {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
map<char, int> mp;
for (char c : s1) mp[c]++;
for (char c : s2) mp[c]++;
for (char c : s3) mp[c]++;
if (mp.size() > 10) {
cout << "UNSOLVABLE" << endl;
return ;
}
string s0;
for (auto p : mp) s0 += p.first;
int m = s0.size();
vector<int> v(10);
for (int i = 0; i < 10; i++) v[i] = i;
auto val = [&](char c) {
for (int i = 0; i < m; i++) {
if (c == s0[i]) {
return v[i];
}
}
return -1;
};
while (next_permutation(all(v))) {
if (val(s1[0]) == 0 || val(s2[0]) == 0 || val(s3[0]) == 0)continue;
ll x1 = 0, x2 = 0, x3 = 0;
for (auto x : s1) {
x1 *= 10;
x1 += val(x);
}
for (auto x : s2) {
x2 *= 10;
x2 += val(x);
}
for (auto x : s3) {
x3 *= 10;
x3 += val(x);
}
if (x1 + x2 == x3) {
cout << x1 << endl;
cout << x2 << endl;
cout << x3 << endl;
return;
}
}
cout << "UNSOLVABLE\n";
}
auto clk = clock();
int main()
{
FIO
#ifndef ONLINE_JUDGE
//for getting input from input.txt
freopen("input.txt", "r", stdin);
//for writting output to output.txt
freopen("output.txt", "w", stdout);
#endif
int t;
//cin >> t;
t = 1;
while (t--) {
run_case();
}
// #ifndef ONLINE_JUDGE
// cout << endl
// << "Time elapsed: " << fs(10) << (double)(clock() - clk) / CLOCKS_PER_SEC << endl
// << endl;
// #endif
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* in case of segmentation fault check for ex- a variable declared more than once , or index becoming negative
* check TLE due to not clearing adjacency list for each test
* do smth instead of nothing and stay organized
* BELIEVE in yourself
*/ |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
string s;
string tmp = "110";
int n;
cin >> n;
cin >> s;
ll ans = 0;
for (int i = 0; i < 3; i++)
{
bool ok = 1;
for (int j = 0; j < n; j++)
if (s[j] != tmp[(i + j) % 3])
{
ok = 0;
break;
}
if (ok)
ans += (10000000000LL * 3 - i - n) / 3 + 1;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int64_t MAX = 10000000000;
int64_t is_valid(string &S, string &T){
int64_t ret = -1;
for(int i=0; i<S.size() - T.size()+1; i++){
bool flag = true;
for(int j=0; j<T.size(); j++){
if(S[i+j] != T[j]){
flag = false;
}
}
if(flag){
ret = i;
break;
}
}
return ret;
}
int main(){
int N;
cin >> N;
string T;
cin >> T;
if(T == "1"){
cout << MAX*2 << endl;
return 0;
}
if(T == "11" || T == "0"){
cout << MAX << endl;
return 0;
}
string A = "110";
string S = "";
for(int i=0; i<(N+4)/3; i++){
S += A;
}
//cout << S << endl;
int64_t x = is_valid(S,T);
if(x == -1){
cout << 0 << endl;
}
else{
int64_t ok = 0;
int64_t ng = MAX+10;
while(ng - ok > 1){
int64_t mid = (ok+ng)/2;
if((mid-1)*3 + N <= MAX*3 - x){
ok = mid;
}
else{
ng = mid;
}
}
cout << ok << endl;
}
} |
#include <algorithm>
#include <array>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
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<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef NEAL_DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
int main() {
ios::sync_with_stdio(false);
#ifndef NEAL_DEBUG
cin.tie(nullptr);
#endif
int N;
cin >> N;
vector<int64_t> A(N), B(N);
for (auto &a : A)
cin >> a;
for (auto &b : B)
cin >> b;
vector<int64_t> change;
int64_t sum = 0;
for (int i = 0; i < N; i++) {
int64_t take = i % 2 == 0 ? A[i] : B[i];
int64_t other = i % 2 == 0 ? B[i] : A[i];
sum += take;
change.push_back(other - take);
}
nth_element(change.begin(), change.begin() + N / 2, change.end(), greater<int64_t>());
for (int i = 0; i < N / 2; i++)
sum += change[i];
cout << sum << '\n';
}
| #include <cmath>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using std::map;
using std::vector;
int main() {
int n;
cin >> n;
ll a[n];
ll max = 0;
ll cursumA = 0;
ll b = 0;
REP(i, n) {
cin >> a[i];
max = std::max(max, a[i]);
b += cursumA + a[i];
cout << max * (i + 1) + b << endl;
cursumA += a[i];
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
bool _DD = false;
#define _D(a)if(_DD)cout<<#a<<':'<<a<<" | ";
#define DBG(a){_D(a);if(_DD)cout<<'\n';}
#define DBG2(a,b){_D(a);_D(b);if(_DD)cout<<'\n';}
#define DBG3(a,b,c){_D(a);_D(b);_D(c);if(_DD)cout<<'\n';}
#define DBG4(a,b,c,d){_D(a);_D(b);_D(c);_D(d);if(_DD)cout<<'\n';}
#define DBG5(a,b,c,d,e){_D(a);_D(b);_D(c);_D(d);_D(e);if(_DD)cout<<'\n';}
#define DBG6(a,b,c,d,e,f){_D(a);_D(b);_D(c);_D(d);_D(e);_D(f);if(_DD)cout<<'\n';}
#define PB push_back
#define EB emplace_back
#define btoe(v) (v).begin(),(v).end()
#define etob(v) (v).rbegin(),(v).rend()
#define F first
#define S second
#define SZ size()
typedef unsigned long long int ulli;
typedef long long int lli;
typedef long double ldbl;
#define f(i,a,b) for(int i=(a); i<(b); ++i)
#define fr(i,a,b) for(int i=(a); i>(b); --i)
#define fl(i,a,b) for(lli i=(a); i<(b); ++i)
#define flr(i,a,b) for(lli i=(a); i>(b); --i)
#define w(x) lli x; cin>>x; while(x--)
#define inpn(n,v,T) T n; cin>>n; vector<T> v(n); fl(i,0,n) cin>>v[i];
#define inp(n,v,T) vector<T> v(n); fl(i,0,n) cin>>v[i];
typedef pair<int,int> pii;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<pii> vpii;typedef vector<vector<pii>> vvpii;typedef pair<lli,lli> plli;typedef vector<lli> vlli;typedef vector<vlli> vvlli;typedef vector<plli> vplli;typedef vector<vector<plli>> vvplli;typedef vector<bool> vb;typedef vector<vb> vvb;typedef vector<string> vs;typedef vector<vector<string>> vvs; typedef vector<char> vc; typedef vector<vc> vvc;
#define unmp unordered_map
const lli PRIME = 1000000007ll;
const lli PRIME2 = 998244353ll;
inline void debugORfast(bool a=0,bool b=1){
if(a) _DD=1;
if(b){ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);}
}
//Question Link
int main(int argc,char* argv[])
{
if(argc>1 and strcmp(argv[1],"1")==0) debugORfast(1,1);
else debugORfast(0,1);
int x,y; cin>>x>>y;
if(x>y) swap(x,y);
if(y-x<3) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
| #include <iostream>
int a[100];
int b[100];
int used[200];
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> a[i] >> b[i];
if (a[i] != -1) ++used[a[i] - 1];
if (b[i] != -1) ++used[b[i] - 1];
if (a[i] != -1 and b[i] != -1 and a[i] >= b[i]) {
std::cout << "No\n";
return 0;
}
if (a[i] != -1 and used[a[i] - 1] == 2) {
std::cout << "No\n";
return 0;
}
if (b[i] != -1 and used[b[i] - 1] == 2) {
std::cout << "No\n";
return 0;
}
}
int ilen, jlen, idx;
for (int i = 0; i < n; ++i) {
for (int j = i - 1; j < n; ++j) {
if (i == j) continue;
if (j < 0) continue;
if (a[i] == -1 or b[i] == -1) continue;
if (a[i] <= a[j] and a[j] <= b[i] and a[i] <= b[j] and b[j] <= b[i]) {
std::cout << "No\n";
return 0;
}
if (b[j] != -1) {
if (a[i] <= a[j] and a[j] <= b[i]) {
ilen = b[i] - a[i] + 1;
jlen = b[j] - a[j] + 1;
if (ilen != jlen) {
std::cout << "No\n";
return 0;
}
}
} else {
if (a[i] <= a[j] and a[j] <= b[i]) {
ilen = b[i] - a[i];
idx = a[j] + ilen - 1;
if (idx < 0 or 2 * n <= idx or used[idx] == 1) {
std::cout << "No\n";
return 0;
}
}
}
if (a[j] != -1) {
if (a[i] <= b[j] and b[j] <= b[i]) {
ilen = b[i] - a[i] + 1;
jlen = b[j] - a[j] + 1;
if (ilen != jlen) {
std::cout << "No\n";
return 0;
}
}
} else {
if (a[i] <= b[j] and b[j] <= b[i]) {
ilen = b[i] - a[i];
idx = b[j] - ilen - 1;
if (idx < 0 or 2 * n <= idx or used[idx] == 1) {
std::cout << "No\n";
return 0;
}
}
}
}
}
std::cout << "Yes\n";
} |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <random>
#include <stack>
#include <climits>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
#define double ld
#define loop(i, n) for(int i = 0; i < (int)n; ++i)
#define loop1(i, n) for(int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair <int, int>
#define all(x) begin(x), end(x)
//#define ti tuple <int, int, int>
#define Point Vect
#define mkt make_tuple
#define mkp make_pair
#define no {cout << "NO\n"; return;}
void solve() {
int n; cin >> n;
vector <int> ans;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ans.pb(i);
ans.pb(n / i);
}
}
if (ans[ans.size() - 1] == ans[ans.size() - 2])
ans.pop_back();
sort(all(ans));
for (int x : ans)
cout << x << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//int t; cin >> t; loop(i, t)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> divisors (ll n) {
vector<ll> dest;
for (ll i = 1; i < floor(pow(n, 0.5) + 1); i++) {
if (n % i == 0) {
dest.push_back(i);
if (floor(n / i) != i) {
dest.push_back(floor(n / i));
}
}
}
sort(dest.begin(), dest.end());
return dest;
}
int main () {
ll n;
cin >> n;
auto ans = divisors(n);
for (ll i = 0; i < (ll)ans.size(); i++) {
cout << ans[i] << endl;
}
} |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int n;
vector<int>v;
string s;
int cache[20][200];
int dp(int i, int sum)
{
if(i == n)
{
if(sum%3 == 0)
return 0;
else
return 1e6;
}
int &ans = cache[i][sum];
if(ans != -1)
return ans;
ans = 0;
int add = s[i] - '0';
ans = min(dp(i+1, sum+add), 1 + dp(i+1, sum));
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(cache, -1, sizeof(cache));
cin>>s;
n = s.size();
int ans = dp(0, 0);
if(ans == n)
cout<<-1;
else
cout<<ans;
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>
using namespace std;
#define INF LLONG_MAX/5
#define MOD 1000000007
#define pi 3.14159265358979
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define enld endl
void vout(vector<int>A) {
rep(i, A.size()) {
cout << A[i];
if (i == A.size() - 1) {
cout << endl;
}
else {
cout << ' ';
}
}
}
void vvout(vector<vector<int>>A) {
rep(i, A.size()) {
rep(j, A[i].size()) {
cout << A[i][j];
if (j == A[i].size() - 1) {
cout << endl;
}
else {
cout << ' ';
}
}
}
}
signed main() {
vector<int>V(4);
rep(i, 4) {
cin >> V[i];
}
int N = 4;
for (int S = 0; S < 1 << N; S++) {
//作成
vector<int>A;
rep(i, N) {
A.push_back(S >> i & 1);
}
int ans = 0;
//操作
rep(i, 4) {
if (A[i] == 1) {
ans += V[i];
}
}
if (ans == V[0] + V[1] + V[2] + V[3] - ans) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
//bool vis[1000];
//int x[]={1,-1,0,0};
//int y[]={0,0,1,-1};
//int f=0;
//"'';
ll a,b,k;
ll util(ll a,ll b){
ll dp[a+b+1][a+b+1];
memset(dp,-1,sizeof(dp));
for(int i=0;i<=a+b;i++){
for(int j=0;j<=i;j++){
if(j==0||j==i){
dp[i][j]=1;
continue;
}
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
if(dp[i][j]<0){
return 1e18;
}
}
}
return dp[a+b][a];
}
int main() {
cin>>a>>b>>k;
string ans;
while(a>0||b>0){
ll s=0;
//cout<<a<<" "<<b<<" "<<k<<endl;
if(a>0){
ll z=util(a-1,b);
s=z;
}
//cout<<s<<endl;
if(s>=k){
ans.push_back('a');
a=a-1;
continue;
}
else{
ans.push_back('b');
b=b-1;
k=k-s;
}
}
cout<<ans<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
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; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
using Graph = vector<vector<int>>;
int main(){
int H,W,N,M; cin>>H>>W>>N>>M;
vector<int> A(N),B(N),C(M),D(M);
rep(i,N)cin>>A[i]>>B[i];
rep(i,M)cin>>C[i]>>D[i];
vector<vector<char>> S(H,vector<char>(W,'.'));
rep(i,N)S[A[i]-1][B[i]-1]='l';
rep(i,M)S[C[i]-1][D[i]-1]='#';
vector<vector<int>> E(H,vector<int>(W,0));//(i,j)の上方向に電球があるかどうか
vector<vector<int>> F(H,vector<int>(W,0));//(i,j)の下方向に電球があるかどうか
rep(i,W){
rep(j,H){
if(S[j][i]=='l')E[j][i]=1;
else if(S[j][i]=='.'){
if(j>0){
E[j][i]=E[j-1][i];
}
}
}
for(int j = H-1; j >= 0; j--){
if(S[j][i]=='l')F[j][i]=1;
else if(S[j][i]=='.'){
if(j<H-1){
F[j][i]=F[j+1][i];
}
}
}
}
vector<vector<int>> G(H,vector<int>(W,0));
vector<vector<int>> I(H,vector<int>(W,0));
rep(i,H){
rep(j,W){
if(S[i][j]=='l')G[i][j]=1;
else if(S[i][j]=='.'){
if(j>0){
G[i][j]=G[i][j-1];
}
}
}
for(int j = W-1; j >= 0; j--){
if(S[i][j]=='l')I[i][j]=1;
else if(S[i][j]=='.'){
if(j<W-1){
I[i][j]=I[i][j+1];
}
}
}
}
int res = 0;
rep(i,H){
rep(j,W){
if(E[i][j]==1||F[i][j]==1||G[i][j]==1||I[i][j]==1)res++;
}
}
cout<<res<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define fi first
#define se second
signed main(){
fastio
int t;
//cin>>t;
t=1;
while(t--){
int v,t,s,d;
cin>>v>>t>>s>>d;
int l=v*t,r=v*s;
if(d>=l && d<=r)cout<<"No\n";
else cout<<"Yes\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define si(x) int x;cin>>x;
#define w(x) si(x); while(x--)
#define fo(i,n) for(int i=0 ; i<n ; i++)
#define rea(a,n) int a[n];fo(i,n){cin>>a[i];}
#define rea2d(a,n,m) int a[n][m];fo(i,n){fo(j,m){cin>>a[i][j];}}
#define pra(a,n) fo(i,n){cout<<a[i]<<" ";}
#define prv(a,n) for (auto i = a.begin(); i != a.end(); ++i){cout<<*i<<" ";}
#define prg(a,n) for (auto ir = a.rbegin(); ir != a.rend(); ++ir){cout<<*i<<" ";}
#define pb push_back
#define mkp make_pair
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define e endl
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef deque<pii> dpii;
typedef unordered_map<int,int> um;
// int max 2147483647
void solution()
{
si(v);si(t);si(s);si(d);
int q=d/v;
if(d>=v*t&&d<=v*s){cout<<"No";}
else cout<<"Yes";
}
int32_t main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// w(t){
// solution();
// }
solution();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#define ll long long int
#define pb push_back
#define fo(i, n) for (int i = 0; i < n; i++)
#define vct vector<long long int>
const ll INF = 1e18;
const ll NINF = -1e18;
#define f first
#define s second
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, a,b,c;
cin>>n;
vector<ll>v;
for (int i = 0; i < 65; i++)
{
// cout<<i<<endl;
ll z = pow(2, i);
if(n>=z){
c = n%z;
b = i;
a = (n-c)/z;
v.pb(a+b+c);
}
else {
break;
}
}
sort(v.begin(), v.end());
cout<<v[0]<<endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
putchar('\n');
}
int N;
int A[100011];
void MAIN() {
scanf("%d", &N);
REP (i, N) scanf("%d", A+i);
bool first;
if (N % 2 == 1) {
first = false;
} else {
sort(A, A+N);
first = false;
for (int i=0; i<N; i+=2) {
if (A[i] != A[i+1]) first = true;
}
}
puts(first? "First": "Second");
}
int main() {
int TC = 1;
scanf("%d", &TC);
REP (tc, TC) MAIN();
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;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long int
#define pb push_back
#define pi pair<int, int>
#define pii pair<pi, int>
#define fir first
#define sec second
#define DEBUG 0
#define MAXN 1001
#define mod 1000000007
#define eps 1e-9
int n, m;
vector<int> v;
vector<int> k;
int dp[MAXN][MAXN];
int solve(int i, int j)
{
if (i == n)
{
return m - j;
}
if (j == m)
{
return n - i;
}
if (dp[i][j] != -1)
{
return dp[i][j];
}
int ret = LLONG_MAX;
ret = (v[i] != k[j]) ? min(ret, 1 + solve(i + 1, j + 1)) : min(ret, 0 + solve(i + 1, j + 1));
ret = min(ret, 1 + solve(i + 1, j));
ret = min(ret, 1 + solve(i, j + 1));
return dp[i][j] = ret;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
v.resize(n);
k.resize(m);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < m; i++)
cin >> k[i];
memset(dp, -1, sizeof(dp));
cout << solve(0, 0) << endl;
return 0;
}
// 1 2 1 3
// 1 3 1
// 1 2 1
// 1 3 1
// 1 elemento removido
// apenas 1 par de indices que os caras sao diferentes
// ans = 2 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(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 repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
rep(i, v.size()) {
if (i) os << " ";
os << v[i];
}
return os;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) { is >> v[i]; }
return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
#ifdef LOCAL
#define dbg(x) cerr << #x << ": " << (x) << '\n'
#define say(x) cerr << (x) << '\n'
#else
#define dbg(x)
#define say(x)
#endif
string solve(bool a) { return ((a) ? "Yes" : "No"); }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll b, c, ans = 0LL;
cin >> b >> c;
P left, right;
if(c==0LL){
cout<<1<<endl;
return 0;
}
if(c==1LL){
if(b==0LL){
cout<<1<<endl;
}else{
cout<<2<<endl;}
return 0;
}
P cost;
left.F = -b - (c - 1) / 2;
right.F = b - c / 2;
cerr<<left.F<<" "<<right.F<<'\n';
cost=mp(abs(-b-left.F)*2+1,abs(b-right.F)*2);
cerr<<cost<<'\n';
/*
if (c % 2 == 0) {
left.S = -right.F + 1;
right.S = -left.F;
} else {
left.S = -right.F;
right.S = -left.F - 1;
}
*/
if(c >cost.F){
right.S=-left.F;
}else{
right.S=-left.F-1;
}
if(c > cost.S){
left.S=-right.F;
}else
{
left.S=-right.F-1;
}
if(left.F >left.S){
swap(left.F,left.S);
}
if(right.F >right.S){
swap(right.F,right.S);
}
if (left.F <= right.S && right.F <= left.S) {
ans = abs(min({left.F, left.S,right.F, right.S})-max({left.F, left.S,right.F, right.S}))+1;
cerr<<"one"<<endl;
} else {
ans = abs(right.F - right.S) + abs(left.F - left.S)+2;
}
cerr<<left<<right<<endl;
cout << ans << endl;
}
// https://atcoder.jp/contests/arc112/tasks/arc112_b
/*
[(r-1/2)-B (r-1/2)+1-B -B -(r/2)+1-B] 0 [-r/2+B (r/2)-1+B B
(-(r-1/2)-1 )+B]
[-D-1 -D ... -B ... -E] ... 0 ... [ E-1 E ... B ...
D] 1 c(r2) c-2(r2) 0 c(r2)
*/
/*
B-c/2 B
-B-(c-1)/2 -B
*/ |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define print(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
int main()
{
int A, B;
cin >> A >> B;
cout << (A + B)/2 << " ";
cout << (A - B)/2;
return 0;
}
| #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
//priority_queue<ll, vector<ll>, greater<ll>> Q;
/*
1 = 1
2 = 1,2
3= 1,3
4 = 1,2,4
5 = 1,5
6=1,2,3,6
10^18まで
NlogN
10^9までになっちゃう
8 = 1,2,4,8 = 2^3
10 = 2,5 2とそれ以外の組み合わせが偶数個数
36 = 2,2,3,3= {2,2}{1,3,3}
*/
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(10);
ll T;
cin >> T;
rep(i, T){
ll N;
cin >> N;
ll two = 0;
while (N%2 == 0){
N/= 2;
two++;
}
if (two == 1)
cout << "Same" << endl;
else if (two == 0)
cout << "Odd" << endl;
else
cout << "Even" << endl;
}
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define repl(k,n) for(k=0;k<n;++k)
int main() {
long long int n;
cin >> n;
long long int half = (long long int)(sqrt(n)+1);
long long int i;
long long int count = 0;
vector<long long int> v(0);
vector<long long int> u(0);
for (i = 1; i < half; i++) {
if (n % i == 0) {
v.push_back(i);
if (n / i == i) {
count = count + 1;
}
else {
u.push_back(n / i);
count = count + 2;
}
}
}
reverse(u.begin(), u.end());
copy(u.begin(), u.end(), back_inserter(v));
for (i = 0; i < count; i++) {
cout << v[i]<<"\n";
}
return 0;
} | #include<iostream>
using namespace std;
int sum(int x)
{
int ans=0;
for(int j=2;j<x;j++)
{
int s=0;
if(x%j==0)
{
while(x%j==0) x/=j,s++;
}
ans+=s;
}
if(x>1) ans++;
return ans;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
if(n==1)
cout<<"1";
else
{
cout<<" "<<sum(i)+1;
}
}
} |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,cc,n) for(int i=cc;i<(n);++i)
#define dreps(i,cc,n) for(int i=cc;i>(n);--i)
#define llreps(i,cc,n) for(long long i=cc;i<(n);++i)
#define ALL(v) begin(v),end(v)
#define rALL(v) rbegin(v),rend(v)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
int main()
{
string s;
cin >> s;
stack<char> st;
rep(i, s.length())
{
char ch = s[i];
if (ch == '6')
ch = '9';
else if (ch == '9')
ch = '6';
st.push(ch);
}
string ans = "";
while(!st.empty())
{
ans += st.top();
st.pop();
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sz(a) (ll)(a.size())
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin>>n;
string s;
cin>>s;
string st;
for(int i=0;i<n;i++)
{
st.pb(s[i]);
int l = sz(st);
if(l >= 3)
{
if(st.substr(l-3,3) == "fox")
{
st.pop_back();
st.pop_back();
st.pop_back();
}
}
}
cout<<sz(st)<<"\n";
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define scan(a) scanf("%d", &a)
#define scanl(a) scanf("%lld", &a)
#define scand(a) scanf("%lf", &a)
#define scan2(a, b) scanf("%d %d", &a, &b)
#define scanl2(a, b) scanf("%lld %lld", &a, &b)
#define scand2(a, b) scanf("%lf %lf", &a, &b)
#define yes cout << "yes\n"
#define no cout << "no\n"
#define Case(i) cout << "Case " << int(i) << ": "
#define lop(n) for(int i = 0; i < n; i++)
#define lopj(n) for(int j = 0; j < n; j++)
#define loop(k, a, b) for(int k = a; k < b; k++)
#define loopr(j, b, a) for(int j = b; j >= a; j--)
#define lopc(i, a, b, c) for(int i = a; i < b; i += c)
#define all(x) x.begin(), x.end()
#define sorta(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.rbegin(), x.rend())
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define vin vector <int>
#define vll vector <ll>
#define vst vector <string>
#define pll pair <ll, ll>
#define pss pair <string, string>
#define vpll vector <pll>
#define fread freopen("input.txt", "r", stdin)
#define fwrite freopen("output.txt", "w", stdout)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define mod (const int) 1e9+7
#define PI acos(-1.0)
#define inf (1 << 61)
#define N (const int) 1e6+5
using namespace std;
int main()
{
fastio;
int tt, n;
cin >> n;
int a[n], c = 0, ans = 0, k = 0;
lop(n) cin >> a[i];
for (int i = 2; i < 1002; i++)
{
c = 0;
for (int j = 0; j < n; j++)
if (a[j] % i == 0)
c++;
if (c > k)
ans = i, k = c;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int N; cin >> N;
vector<int> A(N);
for(auto& a : A) cin >> a;
int mx = 0, ans;
for(int i = 2; i <=1000; i++){
int cnt = 0;
for(int j = 0; j < N; j++){
if(A[j] % i == 0){
cnt++;
}
}
if(mx < cnt){
mx = cnt;
ans = i;
}
}
cout << ans << '\n';
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
int x = 0, f = 1; char ch;
while(!isdigit(ch = getchar())) (ch == '-') && (f = -1);
for(x = ch ^ 48 ; isdigit(ch = getchar()) ; x = (x << 3) + (x << 1) + (ch ^ 48));
return x * f;
}
const int N = 1e6 + 9, p = 998244353;
int a[N],s[N];
int my_pow(int a,int b){
int ans = 1, base = a;
while(b){
if(b & 1) ans = ans * base % p;
base = base * base % p;
b >>= 1;
} return ans;
}
signed main(){
int n = read(), ans = 0;
for(int i = 1 ; i <= n ; i ++) a[i] = read();
sort(a + 1,a + n + 1);
for(int i = 1 ; i <= n ; i ++) s[i] = my_pow(2,i) * a[i] % p;
for(int i = n ; i >= 1 ; i --) s[i] += s[i + 1], s[i] %= p;
for(int i = 1 ; i <= n ; i ++){
ans += a[i] * my_pow(my_pow(2,i + 1),p - 2) % p * s[i + 1] % p;
ans += a[i] * a[i] % p, ans %= p;
} cout<<ans<<"\n";
return 0;
} | /* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;
#define PB push_back
#define For(i, n) for (ll i = 0; i < n; i++)
#define trav(a,x) for (auto& a : x)
#define PYES cout<<"YES\n"
#define PNO cout<<"NO\n"
#define PYes cout<<"Yes\n"
#define PNo cout<<"No\n"
#define endl '\n'
#define sq(x) (x*x)
#define vll vector<ll>
#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<int>())
#define mnv(v) *min_element(v.begin(),v.end())
#define mxv(v) *max_element(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define Fas ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ll M= 998244353;
//--------------------------------------------functions-------------------------------------------------//
ll power(ll a,ll b){ll result=1;while(b>0){if(b%2 == 1){result *= a;} a *= a;b /= 2;}return result;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
ll countSetBits(ll x){ll Count=0;while(x>0){if(x&1) Count++;x=x>>1;}return Count;}
bool isPerfectSquare(ll n){ll sr = sqrt(n);if (sr * sr == n)return true;else return false;}
ll mod(ll x){return ((x%M + M)%M);}
ll add(ll a, ll b){return mod(mod(a)+mod(b));}
ll mul(ll a, ll b){return mod(mod(a)*mod(b));}
ll powerM(ll a,ll b){ll res=1;while(b){if(b%2==1){res=mul(a,res);}a=mul(a,a);b/=2;}return res;}
//------------------------------------sieve of erantothenes-----------------------------------------------//
//ll MAXN=100001;
//vector<ll> fact(MAXN);
//void sieve_of_erantothenes()
//{
// fact[1] = 1;
// for (ll i = 2; i <= MAXN; i++)
// fact[i] = i;
// for (ll i = 4; i <= MAXN; i += 2)
// fact[i] = 2;
// for (ll i = 3; i * i <= MAXN; i++){
// if (fact[i] == i){
// for (ll j = i * i; j <= MAXN; j += i)
// if (fact[j] == j)
// fact[j] = i;
// }
// }
//}
//----------------------------------------nCr mod------------------------------------------------------//
ll modInverse(ll n){
return powerM(n,M-2);
}
ll nCrM(ll n,ll r){
if(n<r) return 0;
if(r==0) return 1;
vector<ll> fact(n+1);
fact[0]=1;
for(ll i=1;i<=n;i++){
fact[i]=mul(fact[i-1],i);
}
return mul(mul(fact[n],modInverse(fact[r])),modInverse(fact[n-r]));
}
//-----------------------------------------------solve-----------------------------------------------------//
void solve() {
ll n;cin>>n;
vll v(n);
trav(w, v) cin>>w;
srt(v);
ll ans;
if(n>1){
ll right=v[0];
ans=mul(v[0],v[1]);
for(ll i=1;i<n-1;i++){
right=add(v[i],mul(2,right));
ans=add(ans,mul(v[i+1],right));
}
for(ll i=0;i<n;i++){
ans=add(ans,mul(v[i],v[i]));
}
}else{
ans=mul(v[0],v[0]);
}
cout<<ans<<endl;
}
int main(){
Fas;
// ll t=0;
// cin>>t;
// while (t--)
solve();
return 0;
}
|
// #pragma GCC optimize("Ofast")
#include <vector>
#include <iostream>
#include <utility>
#include <cmath>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int,int> pii;
// #define int ll
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; ++i)
#define REP(i,n) for(int i = 0;i < (n) ; ++i)
#define MP(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T> inline bool chmax(T &a, T b){if(a < b){a = b;return true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
/*----------------------------------------------------------------*/
inline unsigned long long xor128() {
static unsigned long long rx = 123456789, ry = 986960440, rz = 738905609, rw = 23140692;
unsigned long long rt = (rx ^ (rx << 11));
rx = ry;ry = rz;rz = rw;
return (rw = (rw ^ (rw >> 19)) ^ (rt ^ (rt >> 8)));
}
inline float rand128(float min = 0, float max = 1){
return (float)(xor128() % 0xFFFF) / 0xFFFF * (max - min) + min;
}
inline uint64_t rdtsc(){
uint32_t hi,lo;
__asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
return ((uint64_t)lo) | (((uint64_t)hi)<<32);
}
inline double GetSeconds() {
// return rdtsc()/2.8e9; //Topcoder
return rdtsc()/3.0e9; // Atcoder
}
double start_time;
const double TL = 1.90;
/*----------------------------------------------------------------*/
/*----------------------------------------------------------------*/
int h[30][29];
int v[29][30];
const int Q = 1000;
const int H = 30;
const int W = 30;
/*----------------------------------------------------------------*/
void input(){
cerr << "in h" << endl;
cerr << H << endl;
cerr << W << endl;
rep(i,H)rep(j,W-1){
cin >> h[i][j];
cerr << h[i][j] << endl;
}
cerr << "in v" << endl;
rep(i,H-1)rep(j,W)cin >> v[i][j];
}
void solve(){
cerr << "solve" << endl;
int si,sj,ti,tj,a;
rep(q,Q){
cin >> si >> sj >> ti >> tj;
if(si > ti)rep(i,si-ti)cout << 'U';
if(ti > si)rep(i,ti-si)cout << 'D';
if(sj > tj)rep(i,sj-tj)cout << 'L';
if(tj > sj)rep(i,tj-sj)cout << 'R';
cout << endl;
cin >> a;
}
}
/*----------------------------------------------------------------*/
int main(){
cerr << "s" << endl;
start_time = GetSeconds();
solve();
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n) - 1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define sz(v) (int)v.size()
const int INF = 1000000001;
int main() {
vi _r{-1, 0, 1, 0};
vi _c{0, 1, 0, -1};
vector<char> _d{'U', 'R', 'D', 'L'};
map<char, int> _q;
_q['U'] = 0;
_q['R'] = 1;
_q['D'] = 2;
_q['L'] = 3;
vector<vector<vector<double>>> g(30, vector<vector<double>>(30, vector<double>(4, 5000.0)));
REP(i, 30) {
g[i][0][3] = -1.0;
g[i][29][1] = -1.0;
}
REP(i, 30) {
g[0][i][0] = -1.0;
g[29][i][2] = -1.0;
}
int si, sj, ti, tj;
double score;
string ans;
auto trueSearch = [&]() {
deque<tuple<int, int, double, string>> q;
q.emplace_back(si, sj, 0.0, "");
int r, c;
double d;
string m;
vector<vector<double>> h(30, vector<double>(30, INF));
h[si][sj] = 0.0;
while (!q.empty()) {
tie(r, c, d, m) = q.front();
q.pop_front();
if (r == ti and c == tj) {
ans = m;
continue;
}
REP(i, 4) {
if (g[r][c][i] < 0.0) continue;
if (g[r][c][i] + d >= min(h[ti][tj], h[r + _r[i]][c + _c[i]])) continue;
h[r + _r[i]][c + _c[i]] = g[r][c][i] + d;
q.emplace_back(r + _r[i], c + _c[i], g[r][c][i] + d, m + _d[i]);
}
}
cout << ans << endl;
cin >> score;
return h[ti][tj];
};
auto horizontalSearch = [&]() {
double actual = 0.0;
int r = si;
int c = sj;
while (c < tj) {
actual += g[r][c][1];
ans += 'R';
c++;
}
while (c > tj) {
actual += g[r][c][3];
ans += 'L';
c--;
}
while (r < ti) {
actual += g[r][c][2];
ans += 'D';
r++;
}
while (r > ti) {
actual += g[r][c][0];
ans += 'U';
r--;
}
cout << ans << endl;
cin >> score;
return actual;
};
auto virticalSearch = [&]() {
double actual = 0.0;
int r = si;
int c = sj;
while (r < ti) {
actual += g[r][c][2];
ans += 'D';
r++;
}
while (r > ti) {
actual += g[r][c][0];
ans += 'U';
r--;
}
while (c < tj) {
actual += g[r][c][1];
ans += 'R';
c++;
}
while (c > tj) {
actual += g[r][c][3];
ans += 'L';
c--;
}
cout << ans << endl;
cin >> score;
return actual;
};
REP(i, 1000) {
cin >> si >> sj >> ti >> tj;
ans = "";
auto actual = (i < 80 ? horizontalSearch() : (i < 160 ? virticalSearch() : trueSearch()));
int l = sz(ans);
double coefficient = score / actual;
coefficient = (1.1 + coefficient) / 2.0;
int r = si;
int c = sj;
REP(i, l) {
int d = _q[ans[i]];
g[r][c][d] *= coefficient;
r += _r[d];
c += _c[d];
g[r][c][(d + 2) % 4] *= coefficient;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define double long double
#define rbtree __gnu_pbds::tree<int,__gnu_pbds::null_type,less<int>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>
#define int ll
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define ALL(X) X.begin(),X.end()
#define F(i,n) FF(i,0,n)
#define F1(i,n) FF(i,1,n+1)
#define FF(i,n,m) for(int i=(int)n;i<(int)m;++i)
#ifndef LOCAL
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#else
#endif // LOCOL
//#define mp make_pair
using namespace std;
//using namespace __gnu_pbds;
template<typename T> bool remax(T& a, const T& b) {return b>a?a=b,1:0;}
template<typename T> bool remin(T& a, const T& b) {return b<a?a=b,1:0;}
inline ostream& operator << (ostream& os,__int128_t a){if(a==0) {return (os<<'0');}bool flag=0;if(a<0) {a=-a,flag=1;}string s;while(a){s+=a%10+'0';a/=10;}s+=flag?"-":"";reverse(ALL(s));return os<<s;}
inline istream& operator >>(istream& is,__int128_t& a){string s;cin>>s;a=0;for(auto c:s) a=a*__int128_t(10)+__int128_t(c-'0');return is;}
template<typename T,typename P> inline ostream& operator << (ostream& os,pair<T,P> a){os<<a.first<<" "<<a.second; return os;}
template<typename T,typename P> inline istream& operator >> (istream& is,pair<T,P> &a){is>>a.first>>a.second; return is;}
using ll=long long;
using ull=unsigned long long;
using int128= __int128_t;
using uint128= __uint128_t;
using pii =pair<int,int>;
const double pi=acos(-1);
const int N=2E6+5;
const ll M=1000000000;
const ll INF_64=0x3f3f3f3f3f3f3f3f;
const int INF_32=0x3f3f3f3f;
const int16_t INF_16=0x3f3f;
const int klog=20;
const int mod=1E9+7;//998244353
const double eps=1E-8;
void gen(){
}
template <class T>
T qpow(T base,ll power){
T re=base,tmp=base;
power--;
while(power){
if(power&(1LL)){
re=re*tmp;re%=mod;
}
power>>=1;
tmp=tmp*tmp;tmp%=mod;
}
return re;
}
int pw[N]{};
int invp[N]{};
int val(int n,int m){
if(n<0||m<0) return 0;
return pw[n+m]*invp[n]%mod*invp[m]%mod;
}
void sol(){
pw[0]=1;
F1(i,N-1) pw[i]=pw[i-1]*i%mod;
F(i,N) invp[i]=qpow(pw[i],mod-2);
int n,m,k;cin>>n>>m>>k;
if(n>m+k){
cout<<"0\n";
return;
}
int an=val(n,m);
int sub=val(n-k-1,m+k+1);
cout<<((an-sub)%mod+mod)%mod<<"\n";
}
int32_t main(){
#ifdef LOCAL
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
#endif // LOCAL
IOS;
int t=1;
gen();
//cin>>t;
FF(i,1,t+1){
//cout<<"Case #"<<i<<": ";
sol();
}
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const ll MOD = 998244353;
// auto mod int
// ref. https://github.com/atcoder-live/library/blob/master/mint.cpp
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%MOD+MOD)%MOD){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator-=(const mint a) {
if ((x += MOD-a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime MOD
mint inv() const {
return pow(MOD-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res/=a;
}
};
vector<mint> as;
vector<mint> bs;
vector<mint> factorial;
vector<mint> sum_diagonal;
int main(void) {
int N, K;
cin >> N >> K;
as.resize(N);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
as[i] = mint(x);
}
factorial.resize(K + 1);
factorial[0] = mint(1);
{
mint acc = mint(1);
for (int i = 1; i <= K; i++) {
acc *= i;
factorial[i] = acc;
}
}
bs.resize(K + 1);
{
for (int i = 0; i < N; i++) {
mint base = as[i];
mint acc = mint(1);
for (int x = 0; x <= K; x++) {
bs[x] += acc;
acc *= base;
}
}
}
#ifdef DEBUG
printf("bs: \n");
for (int i = 0; i <= K; i++) {
printf("%lld\n", bs[i].x);
}
printf("\n");
#endif
sum_diagonal.resize(K + 1);
{
for (int i = 0; i < N; i++) {
mint base = as[i] * 2;
mint acc = mint(1);
for (int x = 0; x <= K; x++) {
sum_diagonal[x] += acc;
acc *= base;
}
}
}
{
for (int x = 1; x <= K; x++) {
mint acc = mint(0);
for (int y = 0; y <= x; y++) {
acc += (bs[y] / factorial[y]) * (bs[x - y] / factorial[x - y]);
}
acc *= factorial[x];
acc -= sum_diagonal[x];
acc /= 2;
printf("%lld\n", acc.x);
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
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 debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define lp(i,a,b) for (int i=a;i<=b;i++)
#define rp(i,a,b) for (int i=a;i>=b;i--)
#define ms(a,x) memset(a,x,sizeof a)
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define nl cout<<"\n"
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (((a)*(b))/(gcd(a,b)))
#define sq(a) ((a)*(a))
#define sz(a) (int) a.size()
#define mod 998244353
#define PI (2*acos(0.0))
const int N=1e6+5;
int cnt[N],A[N],ex[N];
void solve()
{
int l,r;
cin>>l>>r;
lp(i,l,r)
cnt[i]++;
for(int i=1;i<N;i++)
{
int sum=0;
for(int j=i;j<N;j+=i)
{
sum=(sum+cnt[j]);
}
A[i]=sum;
}
int now=r-l+1;
int ans=(now*(now-1));
for(int i=N-1;i>=1;i--)
{
ex[i]=(A[i]*(A[i]-1));
//if(ex[i]>0)
{
for(int j=i+i;j<N;j+=i)
ex[i]=(ex[i]-ex[j]);
}
}
ans-=ex[1];
if(l==1) l++;
lp(i,l,r)
{
for(int j=i+i;j<=r;j+=i)
ans-=2;
}
cout<<ans;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int T=1;
//cin>>T;
while(T--) solve();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<ll>;
int main () {
int L, R;
cin >> L >> R;
Vi num(R + 10, 0);
bool db[1000100];
for (int i = 0; i <= R; i ++) {
db[i] = true;
}
ll ans = 0;
for (int i = 2; i <= R; i ++) {
if (db[i]) {
ll kj = (R / i) - ((L - 1) / i);
kj = kj * (kj - 1);
kj /= 2;
ll x = 1;
if (num[i] > 0 && num[i] % 2 == 0) x = -1;
ans += kj * x;
}
if (num[i] == 0) {
//cout << i << endl;
for (int j = 2; j * i <= R; j ++) {
num[i * j] ++;
}
if (i <= 1010) {
for (int j = 1; j * i * i <= R; j ++) {
db[i * i * j] = false;
}
}
}
//cout << i << ' ' << ans << endl;
}
//cout << ans << endl;
for (int i = max(2, L); i <= R; i ++) {
ans -= R / i;
ans ++;
}
cout << ans * 2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;
using IP = pair<int, int>;
using LP = pair<ll, ll>;
#define all(x) begin(x), end(x)
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)
#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)
#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)
template<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }
// constexpr int INF = 1070000000;
// constexpr long long LINF = 4611686015206162431;
// constexpr long long MOD = 1000000007;
// constexpr long double PI = 3.1415926535897932;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
vc<ll> a(N), t(N);
rep (i, N) cin >> a[i] >> t[i];
ll r = 1e+16, l = -1e+16;
ll sum = 0;
rep (i, N) {
if (t[i] == 1) {
l += a[i];
r += a[i];
sum += a[i];
}
else if (t[i] == 2) {
l = max(l, a[i]);
if (r < l) r = l;
}
else {
r = min(r, a[i]);
if (r < l) l = r;
}
}
int Q;
cin >> Q;
rep (i, Q) {
ll x;
cin >> x;
x += sum;
if (x > r) cout << r << endl;
else if (x < l) cout << l << endl;
else cout << x << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int N;
long long a;
int t;
int Q;
long long x;
long long mi=0x3f3f3f3f3f3f3f3f;
long long ma=0xcfcfcfcfcfcfcfcf;
long long add;
int main()
{
scanf("%d",&N);
while(N--)
{
scanf("%lld %d",&a,&t);
if(t==2)
{
ma=max(ma,a);
mi=max(mi,a);
continue;
}
if(t==3)
{
ma=min(ma,a);
mi=min(mi,a);
continue;
}
mi+=a;
ma+=a;
add+=a;
}
scanf("%d",&Q);
while(Q--)
{
scanf("%lld",&x);
printf("%lld ",max(min(mi,x+add),ma));
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &x){
x = 0; int f = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
x *= f;
}
inline void write(int x){if (x > 9) write(x/10); putchar(x%10+'0'); }
int n,ans[11];
const int P = 1e9+ 7;
char caa,cab,cba,cbb;
unordered_map<string,int>mp;
inline void dfs(string s){
if (mp.count(s)) return;
++ans[s.size()];
mp[s] = 1; if (s.size() ==10){ return; }
for (int i = 0; i < s.size()-1; ++i){
bool s1 = s[i] == 'a' ? 1 : 0,s2 = s[i+1] == 'a' ? 1 : 0;
if (s1&&s2) dfs(s.substr(0,i+1) + caa + s.substr(i+1,s.size()-i-1));
else if (s1&&!s2) dfs(s.substr(0,i+1) + cab + s.substr(i+1,s.size()-i-1));
else if (!s1&&!s2) dfs(s.substr(0,i+1) + cbb + s.substr(i+1,s.size()-i-1));
else if (!s1&&s2) dfs(s.substr(0,i+1) + cba + s.substr(i+1,s.size()-i-1));
}
}
inline int all1(){
for (int i = 2; i <= 10; ++i) if (ans[i] ^ 1) return 0;
return 1;
}
inline int pw2(){
for (int i = 2; i <= 3; ++i) if (ans[i] ^ 1) return 0;
for (int i = 4,now = 2; i <= 10; ++i,now *= 2) if (ans[i] ^ now) return 0;
return 1;
}
int fib[1005];
int main(){
// caa = 'b';
// cab = 'b';
// cba = 'a';
// cbb = 'b';
fib[2] = 1,fib[3] = 1;
for (int i = 4; i <= 1000; ++i) fib[i] = (fib[i-1] + fib[i-2]) %P;
cin>>n>>caa>>cab>>cba>>cbb;
if (n<=3)cout<<1<<'\n',exit(0);
caa -= 'A'-'a';
cab -= 'A'-'a';
cba -= 'A'-'a';
cbb -= 'A'-'a';
dfs("ab");
// for (int i = 2; i <= 10; ++i) cout<<i<<' '<<ans[i]<<'\n';
if (all1()) cout<<1<<'\n',exit(0);
if (pw2()){
int ans= 1;
for (int i = 1; i <= n-3; ++i) ans=ans*2%P;
cout<<ans<<'\n';exit(0);
}
cout<<fib[n]<<'\n';
return 0;
} | //#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
ll mod_pow(ll x, ll n, ll m = mod) {
if (n < 0) {
ll res = mod_pow(x, -n, m);
return mod_pow(res, m - 2, m);
}
if (abs(x) >= m)x %= m;
if (x < 0)x += m;
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 1;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[a - b];
}
void solve() {
ll a, b, c; cin >> a >> b >> c;
int ida = 1; int idb = 1;
if (a < 0 && c % 2)ida = -1;
if (b < 0 && c % 2)idb = -1;
a = abs(a); b = abs(b);
if (ida != idb) {
if (ida < 0)cout << "<";
if (idb < 0)cout << ">";
cout << "\n";
return;
}
if (a == b) {
cout << "=\n"; return;
}
if (ida >= 0) {
if (a < b)cout << "<";
else cout << ">";
}
else {
if (a < b)cout << ">";
else cout << "<";
}
cout << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
//init_f();
//init(); cout << ps.size() << "\n";
//expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(void){
int n,m; cin >> n >> m;
if(m==0){
cout << 1 << endl;
return 0;
}
vector<int> a(m);
rep(i,m){
cin >> a[i];
a[i]--;
}
sort(a.begin(),a.end());
//set<int> s;
vector<int> s;
int count=0,sansyo=0;
rep(i,n){
if(i!=a[sansyo]) count++;
if(i==a[sansyo]){
sansyo++;
//a.erase(a.begin());
//s.insert(count);
if(count!=0) s.push_back(count);
count=0;
}
if(i==n-1&&count!=0) s.push_back(count);
}
if(s.size()==0){
cout << 0 << endl;
return 0;
}
sort(s.begin(),s.end());
int k=s[0],ans=0;
rep(i,s.size()){
if(s[i]%k==0) ans += s[i]/k;
if(s[i]%k!=0) ans += s[i]/k+1;
}
cout << ans << endl;
}
| #include <iostream>
#include <algorithm>
using namespace std;
int a[500005];
int main(int argc, char** argv) {
int n,m;
cin >> n >> m;
for(int i=1;i<=m;i++)
cin >> a[i];
sort(a+1,a+m+1);
a[m+1]=n+1;
int mn=1e9;
for(int i=1;i<=m+1;i++)
if(a[i]-a[i-1]-1) mn=min(mn,a[i]-a[i-1]-1);
int ans=0;
for(int i=1;i<=m+1;i++)
ans+=(a[i]-a[i-1]-1+mn-1)/mn;
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
int parent[200002];
int find(int x){
if(parent[x]==x)return x;
return parent[x]=find(parent[x]);
}
void merge(int x,int y){
x=find(x),y=find(y);
if(x!=y)parent[x]=y;
}
ll a[200002],b[200002];
ll asum[200002],bsum[200002];
int main(){
int n,m;
scanf("%d%d",&n,&m);
fup(i,1,n,1)scanf("%lld",a+i);
fup(i,1,n,1)scanf("%lld",b+i);
fup(i,1,n,1)parent[i]=i;
while(m--){
int x,y;
scanf("%d%d",&x,&y);
merge(x,y);
}
fup(i,1,n,1){
int t=find(i);
asum[t]+=a[i];
bsum[t]+=b[i];
}
fup(i,1,n,1)if(asum[i]!=bsum[i])return !printf("No\n");
puts("Yes");
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lint A, B;
cin >> A >> B;
vector<lint> ans(A+B);
lint sum = 0;
if(A >= B) {
REP(i, A) {
ans[i] = i+1;
sum += i+1;
}
FOR(i, A, A+B-1) {
ans[i] = -(i-A+1);
sum -= i-A+1;
}
ans[A+B-1] = -sum;
} else {
REP(i, B) {
ans[i] = -(i+1);
sum += i+1;
}
FOR(i, B, A+B-1) {
ans[i] = i-B+1;
sum -= i-B+1;
}
ans[A+B-1] = sum;
}
REP(i, A+B) cout << ans[i] << (i!=A+B-1 ? " " : "");
cout << "\n";
} |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)6e18
#define pii pair<ll,ll>
#define mod 1000000007
#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=(ll)3e5;
ll inv[N];
ll fac[N];
void init(){
fac[0]=1;
for(ll i=1;i<N;i++)
fac[i]=(i*fac[i-1])%mod;
for(ll i=0;i<N;i++)
inv[i]=inv_mod(fac[i]);
}
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;
}
bool test_cases=0;
string simplify(string &s){
stack<char>st;
ll n=s.size();
string ans;
for(ll i=0;i<n;i++){
if(st.empty())
st.push(s[i]);
else if(st.top()==s[i])
st.pop();
else
st.push(s[i]);
}
while(!st.empty())
{
ans+=st.top();
st.pop();
}
rev(ans);
return ans;
}
void solve()
{
string s;
cin>>s;
ll n=s.size();
string ans;
deque<char>dq;
ll x=0;
for(ll i=0;i<n;i++){
if(s[i]=='R')
x^=1;
else{
if(x==1)
dq.push_front(s[i]);
else
dq.pb(s[i]);
}
}
while(!dq.empty()){
ans+=dq.front();
dq.pop_front();
}
if(x)
rev(ans);
ans=simplify(ans);
///cout<<ans<<endl;
cout<<ans<<endl;
}
int main()
{ ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// init(); //factorial calculations
//Start from Here.
ll t;
t=1;
if(test_cases)
cin>>t;
while(t--)
solve();
//Good Bye!
return 0;
}
| #include <stdio.h>
#include <vector>
#define cm (1 << 17)
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
return A;
}
int main() {
int h = getint(), w = getint(), n = getint(), m = getint();
using std::vector;
vector<vector<bool>> g1(h, vector<bool>(w, 0)), g2(h, vector<bool>(w, 0)),
res(h, vector<bool>(w, 0));
for (int i = 0; i < n; i++) {
g1[getint() - 1][getint() - 1] = 1;
}
for (int i = 0; i < m; i++) {
g2[getint() - 1][getint() - 1] = 1;
}
for (int i = 0; i < h; i++) {
bool flag = 0;
for (int j = 0; j < w; j++) {
if (g2[i][j]) {
flag = 0;
} else if (g1[i][j]) {
flag = 1;
for (int jj = j - 1; ~jj; jj--) {
if (g1[i][jj] || g2[i][jj]) break;
res[i][jj] = 1;
}
}
if (flag) res[i][j] = 1;
}
}
for (int j = 0; j < w; j++) {
bool flag = 0;
for (int i = 0; i < h; i++) {
if (g2[i][j]) {
flag = 0;
} else if (g1[i][j]) {
flag = 1;
for (int ii = i - 1; ~ii; ii--) {
if (g1[ii][j] || g2[ii][j]) break;
res[ii][j] = 1;
}
}
if (flag) res[i][j] = 1;
}
}
int ans = 0;
for (auto&& v : res) {
for (auto&& e : v) {
if (e) ans++;
}
}
printf("%d", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
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);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1'000'000'007;
const int N = 3e5, M = N;
//=======================
vi g[N];
int a[N];
void solve() {
int n;
cin>>n;
vi a(n);
fo(i,n)cin>>a[i];
ll ans=0;
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
int x=upper_bound(a.begin(),a.end(),a[i])-a.begin();
ans+=n-x;
}
cout<<ans<<endl;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
while(t--) {
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m){
int i, u, v;
while(m--){
cin>>u>>v;
u--, v--;
g[u].pb(v);
g[v].pb(u);
}
}
void dfs(int u, int par){
for(int v:g[u]){
if (v == par) continue;
dfs(v, u);
}
}
| #pragma region
#include <bits/stdc++.h>
#define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define prec fixed<<setprecision(9)
#define all(x) x.begin(),x.end()
using ll = long long;
using namespace std;
int mod = 1e9+7;
string to_string(string& s) {return '"'+s+'"';}
string to_string(bool& b) {return b?"true":"false";}
string to_string(const char* s) {string t; return to_string(t=s);}
template <class A, class B> string to_string(pair<A, B>& p) {return "("+to_string(p.first)+", "+to_string(p.second)+")";}
template <class A> string to_string(A& v) {string s; for (auto &x : v) s+=(s.empty()?"":", ")+to_string(x); return "{"+s+"}";}
template<class... Ts> void _debug(Ts&... args){(..., (cerr<<" "<<to_string(args))); cerr<<endl;}
#ifdef apurv
#define debug(args...) cerr<<__LINE__<<" ["<<#args<<"]:", _debug(args)
#else
#define debug(...) 42
#endif
#pragma endregion
int main()
{
fastIO
int n; cin >> n;
vector<int> arr(n); for(auto&i : arr) cin >> i;
map<int,int> mp;
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += (i - mp[arr[i]]);
mp[arr[i]]++;
}
cout << ans << endl;
} |
/*pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << first << ',' << second << ')'
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
ll INF = 1001001001001001001;
long double EPS = 1e-8;
long double PI = 3.141592653589793238;
template <typename T>
void remove(std::vector<T> &vector, unsigned int index)
{
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
// MOD確認
long double X,Y,R;
ll x,y,r;
int main(){
cin >> X >> Y >> R;
x = floor(X*10000+0.5),y = floor(Y*10000+0.5), r = floor(R*10000+0.5);
ll ans = 0;
for(ll i = ((x-r) / 10000) * 10000;i <= ((x+r) / 10000) * 10000;i += 10000){
ll a = r * r - (i-x) * (i-x);
ll l = ((y - (ll)pow(a,0.5) - 150000) / 10000) * 10000,r = ((y + (ll)pow(a,0.5) + 150000) / 10000) * 10000;
ll L = l,R = r;
while(l < R+10000){
if((y-l)*(y-l) > a) l += 10000;
else break;
}
while(r > L-10000){
if((y-r)*(y-r) > a) r -= 10000;
else break;
}
if(l <= r) ans += (r - l + 10000) / 10000;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define yes() cout << "Yes" << endl
#define no() cout << "No" << endl
using ll = long long;
using ld = long double;
using P = pair<int,int>;
int main() {
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b<c*c)yes();
else no();
}
|
// Create by JJL
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <set>
#include <queue>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N=2010,mod=1e9+7;
char g[N][N];
int l[N][N],r[N][N],u[N][N],d[N][N],a[N][N];
#define int long long
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};
int qmi(int a,int b){
int res=1;
while(b){
if(b&1) res=(LL)res*a%mod;
b>>=1;
a=(LL)a*a%mod;
}
return res;
}
signed main(){
int n,m;
cin>>n>>m;
for(int i=0;i<n;++i) cin>>g[i];
int cnt=0;
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
if(g[i][j]=='.'){
l[i][j]=(j-1>=0?l[i][j-1]:0)+1;
cnt++;
}
else l[i][j]=0;
}
for(int j=m-1;j>=0;--j){
if(g[i][j]=='.') r[i][j]=(j+1<m?r[i][j+1]:0)+1;
else r[i][j]=0;
}
}
for(int j=0;j<m;++j){
for(int i=0;i<n;++i){
if(g[i][j]=='.') u[i][j]=(i-1>=0?u[i-1][j]:0)+1;
else u[i][j]=0;
}
for(int i=n-1;i>=0;--i){
if(g[i][j]=='.') d[i][j]=(i+1<n?d[i+1][j]:0)+1;
else d[i][j]=0;
}
}
int ans=0;
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
if(g[i][j]=='.') a[i][j]=l[i][j]+r[i][j]+u[i][j]+d[i][j]-3;
// cout<<a[i][j]<<" ";
}
}//cout<<"in\n";
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
ans=(LL)(ans+(LL)(qmi(2,a[i][j])-1)*qmi(2,cnt-a[i][j])%mod)%mod;
}
}
cout<<ans;
return 0;
}
| #include<iostream>
#include<cstring>
#include<cctype>
using namespace std;
const int BUF = 200005;
const int MOD = 1000000007;
int add(int a, int b) {
return (a + b) % MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
string N;
int K;
void read() {
cin >> N >> K;
}
int ch2v(char ch) {
if (isdigit(ch)) {
return ch - '0';
} else {
return ch - 'A' + 10;
}
}
int rec(int idx, int nType, bool anyDigitOK, bool addedDigit,
int dp[BUF][16][2][2], int digit2added[16]) {
if (nType > K) return 0;
if (idx == N.size()) return nType == K;
int &ret = dp[idx][nType][anyDigitOK][addedDigit];
if (ret != -1) return ret;
ret = 0;
if (!anyDigitOK) {
int v = ch2v(N[idx]);
// Add same digit as N
++digit2added[v];
ret = add(ret, rec(idx + 1, nType + (digit2added[v] == 1), false, true, dp, digit2added));
// cout << idx << ' ' << nType << ' ' << rec(idx + 1, nType + (digit2added[v] == 1), false, true, dp, digit2added) << " aaa" << endl;
--digit2added[v];
// Add digit which is less than N
for (int i = addedDigit ? 0 : 1; i < v; ++i) {
++digit2added[i];
ret = add(ret, rec(idx + 1, nType + (digit2added[i] == 1), true, true, dp, digit2added));
--digit2added[i];
}
// Don't add digit
if (!addedDigit) {
ret = add(ret, rec(idx + 1, nType, true, false, dp, digit2added));
}
} else if (!addedDigit) {
// Add digit
for (int i = 1; i < 16; ++i) {
++digit2added[i];
ret = add(ret, rec(idx + 1, nType + (digit2added[i] == 1), true, true, dp, digit2added));
//cout << idx << ' ' << nType << ' ' << rec(idx + 1, nType + (digit2added[i] == 1), true, true, dp, digit2added) << " bbb" << endl;
--digit2added[i];
}
// Don't add digit
ret = add(ret, rec(idx + 1, nType, true, false, dp, digit2added));
} else {
// Add already-added digit
ret = add(ret, mul(nType, rec(idx + 1, nType, true, true, dp, digit2added)));
// Add not-added digit
if (nType < 16) {
ret = add(ret, mul(16 - nType, rec(idx + 1, nType + 1, true, true, dp, digit2added)));
}
}
return ret;
}
void work() {
static int dp[BUF][16][2][2];
memset(dp, -1, sizeof(dp));
int digit2added[16] = {};
cout << rec(0, 0, 0, 0, dp, digit2added) << endl;
}
int main() {
read();
work();
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;
const int M = 998244353;
int dfs(int i, vector<int>& was, vector<vector<int>>& v) {
was[i] = 1;
int res = 1;
for (int next : v[i]) {
if (was[next] == 0) {
res += dfs(next, was, v);
}
}
return res;
}
vector<int> calcfact(int n) {
vector<int> res(n+1);
res[0] = 1;
for (int i = 1; i <= n; ++i) {
res[i] = (res[i - 1] * (long long)i) % M;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<vector<int>> a(n, vector<int>(n, 0));
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
cin >> a[i][j];
auto f = calcfact(n);
vector<vector<int>> v(n);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
bool ok = true;
for (int z = 0; z < n; ++z) {
if (a[i][z] + a[j][z] > k) {
ok = false;
break;
}
}
if (ok) {
v[i].push_back(j);
v[j].push_back(i);
}
}
}
int res = 1;
vector<int> was(n, 0);
for (int i = 0; i < n; ++i) {
if (was[i] == 0) {
int cnt = dfs(i, was, v);
res = (res * (long long)f[cnt]) % M;
}
}
v.assign(n, vector<int>(n, 0));
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
bool ok = true;
for (int z = 0; z < n; ++z) {
if (a[z][i] + a[z][j] > k) {
ok = false;
break;
}
}
if (ok) {
v[i].push_back(j);
v[j].push_back(i);
}
}
}
was.assign(n, 0);
for (int i = 0; i < n; ++i) {
if (was[i] == 0) {
int cnt = dfs(i, was, v);
res = (res * (long long)f[cnt]) % M;
}
}
cout << res << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
template<class T> inline int sz(T &a) { return a.size(); }
using ll = long long; using ld = long double;
using pi = pair<int,int>; using pl = pair<ll,ll>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
const int inf = numeric_limits<int>::max();
const ll infll = numeric_limits<ll>::max();
// Modint
// modint<MOD> で宣言
template<ll MOD>
struct modint{
ll x;
ll mod = MOD;
modint(ll x=0):x(x%MOD){}
modint& operator+=(const modint a){
if((x+=a.x)>=MOD) x-=MOD;
return *this;
}
modint& operator-=(const modint a){
if((x += MOD-a.x)>=MOD) x-=MOD;
return *this;
}
modint& operator*=(const modint a){
(x*=a.x)%=MOD;
return *this;
}
modint operator+(const modint a) const{
modint res(*this);
return res+=a;
}
modint operator-(const modint a) const{
modint res(*this);
return res-=a;
}
modint operator*(const modint a) const{
modint res(*this);
return res*=a;
}
modint pow(ll t) const{
if(!t) return 1;
modint a = pow(t>>1);
a*=a;
if(t&1) a*=*this;
return a;
}
//for prime mod
modint inv() const{
return pow(MOD-2);
}
modint& operator/=(const modint a){
return (*this) *= a.inv();
}
modint operator/(const modint a) const{
modint res(*this);
return res/=a;
}
};
using mint = modint<998244353>;
const int NMAX=1000010; // we can calculate nCk until n is equal to NMAX
mint fact[NMAX],infac[NMAX];
void Make_Fact(){
fact[0]=fact[1]=1;
for(int i=2;i<=NMAX-1;++i){
fact[i]=fact[i-1]*(mint)i;
}
}
void Make_InvFact(){
infac[0]=infac[1]=1;
for(int i=2;i<=NMAX-1;++i){
infac[i]=infac[i-1]/(mint)i;
}
}
mint Comb(int n,int k){
if(n<0||k<0||n-k<0) return 0;
return fact[n]*infac[k]*infac[n-k];
}
struct UFT{
vector<int> par;//親
vector<int> rank;//木の深さ
vector<int> size;//木の大きさ
int n;
UFT(int _n)
{
n = _n;
par.resize(n);
rank.assign(n,0);
size.assign(n,1);
rep(i,n){
par[i] = i;
}
}
//xの根を返す
int find(int x)
{
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
//x,yを併合
void unite(int x,int y)
{
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
size[y] += size[x];
}
else{
par[y] = x;
size[x] += size[y];
if(rank[x] == rank[y]) rank[x]++;
}
}
//x,yが同じグループにいるかどうかを返す
bool same(int x,int y)
{
return find(x) == find(y);
}
//xの属する木のサイズを探す
int usize(int x)
{
return size[find(x)];
}
};
int main()
{
int n,k; cin >> n >> k;
vvi a(n, vi(n));
rep(i,n) {
rep(j,n) {
cin >> a[i][j];
}
}
Make_Fact();
UFT uf(2*n);
rep(i,n) {
rep(j,n) {
if(i >= j) continue;
bool f = true;
rep(l,n) {
if(a[i][l] + a[j][l] > k) f =false;
}
if(f) uf.unite(i, j);
}
}
rep(i,n) {
rep(j,n) {
if(i >= j) continue;
bool f = true;
rep(l,n) {
if(a[l][i] + a[l][j] > k) f =false;
}
if(f) uf.unite(i+n, j+n);
}
}
mint res(1);
rep(i,2*n) {
if(uf.find(i) == i) {
res *= fact[uf.usize(i)];
}
}
cout << res.x << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#define ll long long
#define ld long double
#define iter vector<ll>::iterator
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define frep(i,a,b) for(ll i=a;i<=b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
#define deb(x) cout<<x<<endl
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
int t;
ll MOD = 1000000007;
ll INF = 1e18+7;
ll MAXN = 5*1e5+100;
ll fact(ll n){
if(n==1||n==0){
return 1;
}
else{
return n*fact(n-1);
}
}
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll binpow(ll a, ll b) {
if (b == 0)
return 1;
long long res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
ll binpow(ll a, ll b, ll m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll ncr(ll n,ll r){
return fact(n)/(fact(r)*fact(n-r));
}
void solve(){
string S; cin >> S;
int ans = 0;
for(int i=0; i<=9999; i++){
vector<bool> flag(10);
int X = i;
for(int j=0; j<4; j++){
flag[X%10] = true;
X /= 10;
}
bool flag2 = true;
for(int j=0; j<10; j++){
if(S[j]=='o' && !flag[j]) flag2 = false;
if(S[j]=='x' && flag[j]) flag2 = false;
}
ans += flag2;
}
cout << ans << endl;
}
int main(){
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//cin>>t;
//cout<<t;
t=1;
while(t--){
//cout<<t<<endl;
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i < N; ++i) {
int c1 = 0, c2 = 0;
for (int j = i; j < N; ++j) {
if (S[j] == 'A')
c1++;
else if (S[j] == 'T')
c1--;
else if (S[j] == 'C')
c2++;
else
c2--;
if (c1 == 0 && c2 == 0) ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
long long po(long a, long b){
if(b==0){
return 1;
}
long long z = po(a,b/2);
z = mod(z*z);
if(b%2!=0){
z = mod(a*z);
}
return z;
}
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=std::sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
std::swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
int main(){
//using namespace std;
int n, m;
cin>>n>>m;
vector<long long> w(n);
REP(i, n) cin>>w[i];
vector<long long> l(m), v(m);
REP(i, m) cin>>l[i]>>v[i];
long long min_v = INF;
REP(i, m) if(v[i] < min_v) min_v = v[i];
//cout << "min_v = " << min_v << endl;
long long max_w = -1;
REP(i, n) max_w = max(max_w, w[i]);
if(max_w > min_v){
cout << -1 << endl;
return 0;
}
typedef pair<long long, long long> P;
auto cmp = [](P p, P q) -> bool {
return p.second < q.second;
};
{
vector<P> vec;
REP(i, m) vec.emplace_back(l[i], v[i]);
sort(ALL(vec), cmp);
REP(i, m){
l[i] = vec[i].first;
v[i] = vec[i].second;
}
}
//REP(i, m) cout << l[i] << " " << v[i] << endl;
vector<long long> dl(m);
REP(i, m){
if(i == 0) dl[i] = l[i];
else dl[i] = max(l[i], dl[i - 1]);
}
sort(ALL(w));
long long ans = INF;
do {
vector<long long> dw(n);
REP(i, n){
if(i == 0) dw[i] = w[i];
else dw[i] = w[i] + dw[i - 1];
}
vector<vector<long long>> x(n, vector<long long>(n, 0));
REP(i, n){
REP(j, n){
if(i > j) continue;
//i <= j
if(i == j) continue;
//i < j
long long cw;
if(i > 0) cw = dw[j] - dw[i - 1];
else cw = dw[j];
int idx = lower_bound(ALL(v), cw) - v.begin();
if(idx == 0) continue;
x[i][j] = max(x[i][j], dl[idx - 1]);
}
}
vector<long long> dp(n);
REP(i, n){
if(i == 0) continue;
long long temp = 0;
for(int j = 0; j <= i; j++){
temp = max(temp, dp[j] + x[j][i]);
}
dp[i] = temp;
}
ans = min(ans, dp[n - 1]);
} while (next_permutation(ALL(w)));
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define hi ios_base::sync_with_stdio;cin.tie(NULL);cin.tie(NULL);
typedef long long int ll;
typedef long double ld;
typedef long long unsigned llu;
#define test int test; cin>>test; while(test--)
#define loop(i,n,k) for(int i=n;i<k;i++)
#define rloop(i,n,k) for(int i=n;i>=k;i--)
#define INT(a) int a;scanf("%d",&a);
#define intin(temp) scanf("%d",&temp);
#define longin(temp) scanf("%lld",&temp);
#define LLI(a) ll a;scanf("%lld",&a);
#define DOUBLE(a) double a;scanf("%f",&a);
#define LD(a) long double a;scanf("%lf",&a);
#define pb(i) push_back(i);
#define sz(i) i.size()
#define mkp(i,j) make_pair(i,j);
#define ip pair<int,int>
#define dp pair<ll,ll>
#define FOR(i,n) for(i=0;i<n;i++)
#define range(v) v.begin(),v.end()
#define bye return 0;
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
//===============================================================================================================
//Author:- Absolute_looser
//Class :- loosers
//===============================================================================================================
template<class c>
c gcd (c a,c b){
if(b==0)
return a;
gcd(b,a%b);
}template<class a>
bool prime(a n){
for(a i=2;i<=sqrt(n);i++){
if(n%i==0)
return 0;
}
return 1;
}
bool bigger(pair<int,int>picachu,pair<int,int> qicachu){
return (picachu.first<qicachu.first);
}void printarr(int arr[],int n){
for(int i=0;i<n;i++)
cout<<arr[i]<<' ';
cout<<endl;
}
int chartoint(char c) {
if (c >= 'a' && c <= 'z') return c - 'a';
if (c >= 'A' && c <= 'Z') return c - 'A' + 26;
return 52;
}
int kadane(int arr[],int n){
int maximum= arr[0];
int max_so_far = 0;
for(int i=0;i<n;i++){
max_so_far+=arr[i];
if(max_so_far>maximum)
maximum = max_so_far;
if(max_so_far<0)
max_so_far = 0;
}
return maximum;
}
int a[200004];
ll div(ll x,ll n,ll m){
ll ans =1 ;
while(n){
if(n&1){
ans = ans*x%m;
}
x = x*x%m;
n >>=1;
}
return ans;
}
void run(){
ll n;
ll m;
cin >> n;
cin >> m;
cout << div(10,n,m*m)/m<< endl;
}
int main(){
hi;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
{
run();
}
cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
bye;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)//rep(i,回数){処理}
using namespace std;
using ll = long long;
using P = pair<int, int>;
#include <unordered_set>
int main() {
ll n,count=1, sum=0; cin >> n;
vector<ll> v(n); rep(i,n) cin >> v[i];
sort(v.begin(), v.end());
for (int i=0; i<n-1; i++) {
if (v[i] == v[i+1]) count++;
else {
sum += count*(count-1)/2;
count = 1;
}
}
sum += count*(count-1)/2;
ll ans = n*(n-1)/2;
cout << ans - sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(obj) rbegin(obj), rend(obj)
#define sz(x) (int)(x).size()
#define cinv(a) rep(i, sz(a)) cin >> a[i]
#define debug(a) rep(i, sz(a)) cout << a[i] << " \n"[i == sz(a) - 1]
#define show(x) cerr << #x << " = " << x << endl;
#define pb push_back
#define pf push_front
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<Pi> vp;
typedef vector<vp> vvp;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
template <typename T> bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, 1, 0, -1};
const int MOD = 1e9 + 7;
const int INF = 1e9 + 9;
const ll LINF = 1e18;
const long double eps = 1e-10;
const char nl = '\n';
ll power(ll a, ll b, int mod) { return b ? power(a * a % mod, b / 2, mod) * (b % 2 ? a : 1) % mod : 1; }
ll nCk(int n, int k, int mod)
{
ll x = 1, y = 1;
for (int i = 1; i <= k; ++i)
{
x = x * (n - i + 1) % mod;
y = y * i % mod;
}
return x * power(y, mod - 2, mod) % mod;
}
struct UF
{
vi d;
UF(int n) : d(n, -1) {}
int root(int x)
{
if (d[x] < 0) return x;
return d[x] = root(d[x]);
}
bool unite(int x, int y)
{
x = root(x);
y = root(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return -d[root(x)]; }
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll n; cin >> n;
vl A(n); cinv(A);
map<ll, ll> mp;
for (ll &x : A) mp[x]++;
ll ans = 0;
rep(i, n-1)
{
ans += n-1-i;
if (mp[A[i]] > 1)
{
mp[A[i]]--;
ans -= mp[A[i]];
}
}
cout << ans << nl;
} |
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <utility>
#include <map>
#include <list>
#include <climits>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <string>
// #define cerr if(false)cerr
#define watch(x) cerr << "> " << #x << ": " << x << "\n";
using namespace std;
template <typename T>
std::ostream &operator <<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator <<(std::ostream &out, vector<pair<T, N> > &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, vector<vector<T> > &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> present(2e5 + 1);
int min_valid = 0;
int p;
for (int i = 0; i < n; ++i) {
cin >> p;
present[p] = 1;
while (present[min_valid]) {
++min_valid;
}
cout << min_valid << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
using namespace std;
#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 Clear(a) a = decltype(a)()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define vec vector
typedef long long ll;
typedef pair<ll,ll> P;
const double PI=acos(-1);
//const ll big=998244353;
const ll big=1000000007LL;
const ll INF=1e18;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll max(ll x,ll y){
if(x>y)return x;
else return y;
}
ll min(ll x,ll y){
if(x<y)return x;
else return y;
}
ll expm(ll x,ll y){
if(y==0)return 1;//0^0=1
if(x==1||x==0)return x;
if(y%2==1)return (expm(x,y-1)*x)%big;
ll t=expm(x,y/2);
return (t*t)%big;
}
ll exp(ll x,ll y){
if(y==0)return 1;//0^0=1
if(x==1||y==0)return x;
if(y%2==1)return exp(x,y-1)*x;
ll t=exp(x,y/2);
return t*t;
}
int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
int n;cin >> n;
vector<int> out;
set<int> res;
rep(i,200009)res.insert(i);
rep(i,n){
int p;cin >> p;
res.erase(p);
out.push_back((*begin(res)));
}
rep(i,n)cout << out[i] << endl;
} |
#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9+7;
using namespace std;
vector<int>v[200005];
vector<int>g[200005];
int dep[200005];
int in[200005], out[200005];
int stamp;
void dfs(int now, int pre) {
in[now] = ++stamp;
v[dep[now]].pb(stamp);
for (auto &i : g[now]) {
if (i == pre) {
continue;
}
dep[i] = dep[now] + 1;
dfs(i, now);
}
out[now] = stamp;
}
void solve() {
int n;
cin >> n;
for (int i = 2 ; i <= n ; i++) {
int x;
cin >> x;
g[x].pb(i);
}
dfs(1, 0);
int q;
cin >> q;
while (q--) {
int x, y;
cin >> x >> y;
cout << upper_bound(v[y].begin(), v[y].end(),out[x]) - lower_bound(v[y].begin(), v[y].end(),in[x]) << '\n';
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while (t--) {
solve();
}
} | #include <iostream>
#include <vector>
using namespace std;
const int INF = (1u<<31) - 1;
int main() {
int n;
cin >> n;
long long max_thr = INF, min_thr = -INF;
long long max_v = INF, min_v = -INF;
for (int i = 0; i < n; i++) {
long long a, t;
cin >> a >> t;
if (t == 1) {
max_v += a;
min_v += a;
} else if (t == 2) {
if (a > min_v) {
min_thr += a - min_v;
min_v += a - min_v;
if (max_thr < min_thr) {
max_thr = min_thr;
max_v = min_v;
}
}
} else {
if (a < max_v) {
max_thr -= max_v - a;
max_v -= max_v - a;
if (max_thr < min_thr) {
min_thr = max_thr;
min_v = max_v;
}
}
}
}
int Q;
cin >> Q;
for (int q = 0; q < Q; q++) {
long long x;
cin >> x;
long long ans;
if (x <= min_thr) {
ans = min_v;
} else if (x >= max_thr) {
ans = max_v;
} else {
ans = min_v + (x - min_thr);
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int n, m, ans1, k;
vector<pair<int, int> > v, vv;
vector<int> ans;
int solve(int i){
if(i >= k){
int ok = 0;
unordered_map<int, int> mp;
for(auto k : ans)
mp[k]++;
for(int i = 0; i < m; ++i){
int a = v[i].first, b = v[i].second;
if(mp[a] and mp[b])
++ok;
ans1 = max(ans1, ok);
}
return ok;
}
long long int a = vv[i].first, b = vv[i].second, cur = 0;
ans.push_back(a);
cur += solve(i + 1);
ans.pop_back();
ans.push_back(b);
cur += solve(i + 1);
ans.pop_back();
return cur;
}
int main(){
fast;
cin >> n >> m;
for(int i = 0; i < m; ++i){
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
cin >> k;
for(int i = 0; i < k; ++i){
int a, b;
cin >> a >> b;
vv.push_back({a, b});
}
solve(0);
cout << ans1 << '\n';
return 0;
} | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,a[110],b[110],c[110],x[110],y[110],k,ans;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++) scanf("%d%d",&a[i],&b[i]);
scanf("%d",&k);
for(int i=1;i<=k;i++) scanf("%d%d",&x[i],&y[i]);
for(int i=0;i<=(1<<k)-1;i++)
{
int p=i;//printf("\n%d\n",p);
memset(c,0,sizeof(c));
for(int j=1;j<=k;j++)
{
//printf("%d",p&1);
if(p&1) c[x[j]]++;
else c[y[j]]++;
p>>=1;
}
int cnt=0;
for(int j=1;j<=m;j++) if(c[a[j]]&&c[b[j]]) cnt++;
ans=max(ans,cnt);
}
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
#define BOOM ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define PI 3.14159265358979323846
#define NEWLINE cout<<"\n";
#define ll long long
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(v) v.begin(), v.end()
#define ff first
#define ss second
#define pii pair<int,int>
#define mset(a,b) memset(a, b, sizeof(a))
#define BHAAGO {cout<<"NO\n";continue;}
using namespace std;
#define MAXN 200
#define MOD 1000000007
int posfastscan() {
register int c; int number = 0;
for(c = getchar(); !(c>47 && c<58); c= getchar());
for (; (c>47 && c<58); c=getchar()) number = (number<<1) + (number<<3) + (c ^ 48);
return number;
}
int fastscan() {
bool negative = false; register int c; int number = 0;
for(c = getchar(); !(c>47 && c<58) && c!= '-'; c= getchar());
if (c=='-') c = getchar(), negative = true;
for (; (c>47 && c<58); c=getchar()) number = (number<<1) + (number<<3) + (c ^ 48);
if (negative) return -number; else return number;
}
void write(int x){
if(x>9) write(x/10);
putchar(x%10 + 48);
}
//LARGE POWERS
ll power(long long x, long long y, long long p)
{
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1) res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
//Fermat Inverse
ll fermatinv(int n, int p) { return power(n,p-2,p); }
//Combination nCr
int fact[MAXN], ifact[MAXN];
void Cinit() {
fact[0] = 1;
for (int i = 1; i < MAXN; ++i) fact[i] = 1LL * fact[i - 1] * i % MOD;
ifact[MAXN - 1] = power(fact[MAXN - 1], MOD - 2, MOD);
for (int i = MAXN - 2; i >= 0; --i) ifact[i] = 1LL * ifact[i + 1] * (i + 1) % MOD;
}
int nCr(int n, int r) {
if (r < 0 || r > n) return 0;
return (1LL * fact[n] * ifact[r] % MOD * ifact[n - r] % MOD)%MOD;
}
long long int sumXOR(ll arr[], int n)
{
long long int sum = 0;
for (int i = 0; i < 64; i++)
{
// Count of zeros and ones
ll zc = 0, oc = 0;
// Individual sum at each bit position
long long int idsum = 0;
for (int j = 0; j < n; j++)
{
if (arr[j] % 2 == 0)
zc++;
else
oc++;
arr[j] /= 2;
}
// calculating individual bit sum
idsum = ((oc * zc)%MOD) * (1LL << (i/2)) % MOD * (1LL << (i-i/2)) % MOD;
// final sum
sum += idsum;
}
return sum%MOD;
}
int main()
{
// BOOM
int _, n, m, k, l=0, r=0, i, j, tt=1, sum=0, c, x,y,z=1;
bool flag=0;
string s, ss;
// Cinit();
// cin>>tt;
while(tt--){
// int q;
cin>>n;
// int a[n];
// for(i=0;i<n;i++) cin>>a[i];
std::vector<pair<ll,ll>> adj[n];
for(i=0;i<n-1;i++) {
ll x,y,z;
cin>>x>>y>>z;
adj[x-1].emplace_back(y-1, z);
adj[y-1].emplace_back(x-1, z);
}
ll a[n]={};
bool vis[n]={};
queue<int> q;
q.push(0);
while(!q.empty()) {
int u = q.front(); q.pop();
vis[u]=1;
for(auto p : adj[u])
if(!vis[p.ff])
a[p.ff] = p.ss ^ a[u],
q.push(p.ff);
// cout<<"u = "<<u<<endl;
}
// cout<<"Y"<<endl;
cout<<sumXOR(a, n);
// if(a[1] + a[1] == a[0] + a[2])
// cout<<"Yes"<<'\n';
// for(i=0;i<n;i++) cout<<a[i]<<' '; cout<<'\n';
// }
// else
// cout<<ans+1<<'\n';
// cout<<"No"<<'\n';
}
//cout<<ans;
/*for(i=0;i<n;i++){
cin>>;
}
*/
// for(i=0;i<=n;i++){
// cout<<"\nadj["<<i<<"] = ";
// for(j=0;j<adj[i].size();j++)
// cout<<adj[i][j]<<" ";
// }
// for(i=0;i<d.size();i++)
// cout<<d[i]<<" ";NEWLINE
/*v = n*m;
Graph G(v);
char a[v], b[n][m];
vector<bool> visited(v, false);
vector<pair<int, unsigned long int>> level(v);
for(i=0;i<v;i++){
level[i].first = i; level[i].second = 0;
}*/
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;
typedef pair<pair<int, int>, int> ppi;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef bitset<60> Bitset;
const ll INFL = 1LL << 60;
const int INF = 1000000005;
const int MOD = 1000000007;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return (a * b) / GCD(a, b); }
bool range(int x,int y,int X,int Y){if(0<=x&&x<X&&0<=y&&y<Y){return true;} return false;}
//------------------------------------------------------------------------------------------------------------------------------
int main(void) {
ios::sync_with_stdio(false);cin.tie(nullptr);
int n;cin>>n;
vector<pll> p(n);
for(int i = 0; i < n; i++) {
ll x,y;cin>>p[i].first>>p[i].second;
}
int m;cin>>m;
vvl v(m+1,vl(6,0));
v[0][0] = v[0][3] = 1;
for(int i = 1; i <= m; i++) {
int op;cin>>op;
ll p;
if(op>=3) cin>>p;
switch(op){
case 1:
v[i][0] = v[i-1][2]; v[i][1] = v[i-1][3]; v[i][2] = -v[i-1][0]; v[i][3] = -v[i-1][1];
v[i][4] = v[i-1][5]; v[i][5] = -v[i-1][4];
break;
case 2:
v[i][0] = -v[i-1][2]; v[i][1] = -v[i-1][3]; v[i][2] = v[i-1][0]; v[i][3] = v[i-1][1];
v[i][4] = -v[i-1][5]; v[i][5] = v[i-1][4];
break;
case 3:
v[i][0] = -v[i-1][0]; v[i][1] = -v[i-1][1]; v[i][2] = v[i-1][2]; v[i][3] = v[i-1][3];
v[i][4] = -v[i-1][4] + 2*p; v[i][5] = v[i-1][5];
break;
case 4:
v[i][0] = v[i-1][0]; v[i][1] = v[i-1][1]; v[i][2] = -v[i-1][2]; v[i][3] = -v[i-1][3];
v[i][4] = v[i-1][4]; v[i][5] = -v[i-1][5] + 2*p;
break;
}
/*
for(int j = 0; j < 6; j++) cout<<v[i][j]<<' ' ;
cout<<endl;
*/
}
int q;cin>>q;
for(int i = 0; i < q; i++) {
int a,b;cin>>a>>b;b--;
ll x = p[b].first,y = p[b].second;
cout<<v[a][0]*x+v[a][1]*y+v[a][4]<<' '<<
v[a][2]*x+v[a][3]*y+v[a][5]<<endl;
}
} |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define ll long long
#define MAXN 1000005
#define uns unsigned
#define INF 0x3f3f3f3f
using namespace std;
inline ll read(){
ll x=0;bool f=1;char s=getchar();
while((s<'0'||s>'9')&&s>0){if(s=='-')f^=1;s=getchar();}
while(s>='0'&&s<='9')x=(x<<1)+(x<<3)+s-'0',s=getchar();
return f?x:-x;
}
ll n,k,s,a,b,sum[MAXN<<2];
inline ll fgg(ll s){
if(s>(n<<1)||s<2)return 0;
if(s<=n+1)return s-1;
else return n-(s-n)+1;
}
inline ll gee(ll s){
ll rank=0;
for(int i=1;i<=n&&i<s;i++)rank+=sum[s-i];
return rank;
}
int main()
{
n=read(),k=read();
for(int i=1;i<=(n<<2);i++)sum[i]=sum[i-1]+fgg(i);
s=2;
for(int i=22;i>=0;i--)
if(s+(1ll<<i)<=n*3&&gee(s+(1ll<<i))<k)
s+=(1ll<<i);
k-=gee(s),s++;
// printf("%lld %lld %lld %lld\n",gee(3),gee(4),gee(5),gee(6));
// printf(" %lld %lld\n",s,k);
for(a=max(1ll,s-(n<<1));a<=n;){
if(fgg(s-a)>=k)break;
else k-=fgg(s-a),a++;
}
// printf(" %lld %lld\n",a,k);
b=max(1ll,s-a-n)+k-1;
printf("%lld %lld %lld\n",a,b,s-a-b);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define For(i,a,b) for(register int i=a;i<=b;++i)
#define Down(i,a,b) for(register int i=a;i>=b;i--)
#define reg register
namespace yspm{
inline int read(){
int res=0,f=1; char k;
while(!isdigit(k=getchar())) if(k=='-') f=-1;
while(isdigit(k)) res=res*10+k-'0',k=getchar();
return res*f;
}
char s[1010][1010];
int n,m,fa[3000];
set<int> lin,col;
inline int min(int x,int y){return x<y?x:y;}
inline int max(int x,int y){return x>y?x:y;}
inline void swap(int &x,int &y){int t=x; x=y; y=t; return ;}
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline void merge(int x,int y){
x=find(x); y=find(y); if(x==y) return ;
if(x>y) swap(x,y); fa[y]=x; return ;
}
signed main(){
n=read(); m=read(); For(i,1,n) scanf("%s",s[i]+1);
for(reg int i=1;i<=n+m;++i) fa[i]=i; fa[1]=fa[n]=fa[n+1]=fa[n+m]=1;
For(i,1,n){
int pre=0; For(j,1,m) if(s[i][j]=='#') merge(i,j+n),pre?merge(pre+n,j+n):void(),pre=j;
}
For(i,1,m){
int pre=0; For(j,1,n) if(s[j][i]=='#') merge(j,n+i),pre?merge(pre,j):void(),pre=j;
}
for(reg int i=1;i<=n;++i) if(find(i)!=1) lin.insert(find(i));
for(reg int i=n+1;i<=n+m;++i) if(find(i)!=1) col.insert(find(i));
printf("%lld\n",min(lin.size(),col.size()));
return 0;
}
}
signed main(){return yspm::main();}
|
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <cmath>
#include <climits>
#include <fstream>
#include <functional>
#include <time.h>
using namespace std;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
int ans = 0;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
ans += max(0, a[i]-10);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define bck(i, a, b) if ((i) >= (a) && (i) < (b))
#define trav(x, a) for (auto &x : (a))
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define dbg(X) std::cerr << "[DBG]("<<__FUNCTION__<<":"<<__LINE__<<") " << #X << ": " << X << std::endl;
using namespace std;
typedef long long ll;
typedef string str;
template<typename T> using vec = vector<T>;
template<typename T> using pq = priority_queue<T, vector<T>, std::greater<T>>;
template<typename T> using mxpq = priority_queue<T>;
typedef pair<int,int> pii;
typedef vec<int> vi;
typedef vec<pii> vii;
typedef vec<vi> vvi;
typedef pair<ll,ll> pll;
typedef vec<ll> vl;
typedef vec<pll> vll;
typedef vec<vl> vvl;
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; }
template<typename A, typename B>
istream& operator>>(istream& s, pair<A,B>& p) { return s>>p.first>>p.second; }
template<typename T>
istream& operator>>(istream& s, vec<T>& p) { for (T& t : p) s >> t; return s; }
template<typename T>
ostream& operator<<(ostream& s, const vec<T>& p) { for (const T& t : p) s << t << " "; return s; }
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n; cin >> n;
ll mn = LLONG_MAX;
rep(b, 0, 63) {
ll a = n >> b;
ll c = n & ((1ll << b) - 1);
ckmin(mn, a+b+c);
}
cout<<mn<<endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ljc 998244353
#define bit __builtin_popcount
using namespace std;
#define gc getchar
inline ll read(){
register ll x=0,f=1;char ch=gc();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=gc();}
while (isdigit(ch)){x=(x<<3)+(x<<1)+ch-'0';ch=gc();}
return (f==1)?x:-x;
}
inline void file(){
freopen(".in","r",stdin);
freopen(".out","w",stdout);
}
int n;
ll A[1010101],B[1010101],sumB[1010101];
ll f[1010101][2],g[2][2];
priority_queue<ll> q[2];
signed main(){
n=read();
for (int i=1;i<=n;i++){
A[i]=read();
}
ll _=0,ans=0;
for (int i=1;i<=n;i++){
B[i]=read();
q[i%2].push(B[i]-A[i]);
_+=A[i];
// sumB[i]=sumB[i-1]+B[i];
}
ans=_;
for (int i=1;i<=n/2;i++){
_+=q[0].top(),_+=q[1].top();
ans=max(ans,_);
q[0].pop(),q[1].pop();
}
cout<<ans;
// g[1][0]=0;
// g[1][1]=-1e16;
// g[0][1]=-1e16;
// g[0][0]=0;
// for (int i=1;i<=n;i++){
// //(..) i-j=odd ok
// f[i][0]=sumB[i-1]+g[1^(i&1)][1]+A[i];
// g[i&1][0]=max(g[i&1][0],f[i][0]-sumB[i]);
// f[i][1]=sumB[i-1]+g[1^(i&1)][0]+A[i];
// g[i&1][1]=max(g[i&1][0],f[i][1]-sumB[i]);
// ans=max(ans,f[i][0]+sumB[n]-sumB[i]);
// }
// cout<<ans;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
//shorthands
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mkp make_pair
#define fastio ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (ll)((x).size())
#define fr first
#define sc second
#define vll vector <ll>
#define vpll vector < pair<ll,ll> >
#define vect(a,n) vll a(n); rep(i,0,n) cin>>a[i];
#define rep(i,a,b) for(ll i = a; i < b; i++)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define PI 3.14159265358979323846
//Debug
#define printall(a) rep(i,0,a.size()) cout<<a[i]<<" "; cout<<"\n";
//Constants
const int mod = (int) 1e9 + 7 ;
const int INF = (int) 1e18 ;
//Input-Output File
void fileio(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin) ;
freopen("output.txt", "w", stdout) ;
#endif
}
ll modulo_binary_exp(ll a , ll b , ll m) {
ll res = 1;
while(b) {
if(b % 2 == 0) {
b = b/2;
a = ((a % m)*(a % m)) % m;
}
else
{
b--;
res = ((res % m)*(a % m)) % m;
}
}
return res;
}
void solve() {
ll a,b,c;
cin >> a >> b >> c;
ll p = modulo_binary_exp(b , c , 100);
p += 100;
ll q = modulo_binary_exp(a , p , 10);
cout << q;
}
int main() {
fastio;
fileio;
int t = 1; //cin >> t;
while(t--) solve();
}
|
#include <stdio.h>
#include <queue>
#include <set>
#include <iostream>
using namespace std;
typedef long long int llint;
llint n;
priority_queue<llint> que;
int main(){
long n;
cin >> n;
set<long> ans;
for(long d=1;d*d<=n;d++){
if(n%d==0){
ans.insert(d);
ans.insert(n/d);
}
}
for(auto x:ans)cout << x << endl;
} | /* C++ */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
if(n==0) return 1;
else return Factorial(n-1)*n;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
/* isPrime[1]=false; */
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/* 約数列挙 */
vector<ll> divisor(ll n){
// O(√n)
vector<ll> ans;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ans.push_back(i);
if(i*i!=n) ans.push_back(n/i);
}
}
sort(ALL(ans));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n;
cin>>n;
vector<ll> v=divisor(n);
rep(i,v.size()) cout<<v[i]<<endl;
} |
//#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(x,a) memset(x,a,sizeof(x))
#define fo0(i,k) for(i=fr[k];i;i=nx[i])
#define fo1(i,l,r) for(i=l;i<=r;i++)
#define fo2(i,l,r) for(i=l;i>=r;i--)
#define fo(i,n) for(i=1;i<=n;i++)
#define ret return
#define x first
#define cint const int
#define y second
#define opi(x) freopen(x,"r",stdin)
#define opo(x) freopen(x,"w",stdout)
#define tpl template<class T>
#define priq priority_queue
#define mp make_pair
#define use using namespace
#define WT while(T--)
#define pb push_back
#define sz size()
use std;
typedef pair<int,int> pii;typedef pair<int,ll> pil;typedef pair<ll,int> pli;typedef pair<ll,ll> pll;
namespace io
{
void _(int &k){char c;int e=1;k=0;while((c=gtc)>'9'||c<'0')if(c=='-')e=-1;k=c-'0';while((c=gtc)<='9'&&c>='0'){k*=10;k+=c-'0';}k*=e;}
void _(ll &k){char c;int e=1;k=0;while((c=gtc)>'9'||c<'0')if(c=='-')e=-1;k=c-'0';while((c=gtc)<='9'&&c>='0'){k*=10;k+=c-'0';}k*=e;}
void _(char &c){while((c=gtc)==' '||c=='\n');}void _(dou &c){scanf("%lf",&c);}void _(char *s){char c;while((c=gtc)!=EOF&&c!=' '&&c!=10)*s++=c;}
template<class t1,class t2>void _(t1 &a,t2 &b){_(a);_(b);}template<class t1,class t2,class t3>void _(t1 &a,t2 &b,t3 &c){_(a);_(b);_(c);}
template<class t1,class t2,class t3,class t4>void _(t1 &a,t2 &b,t3 &c,t4 &d){_(a);_(b);_(c);_(d);}
template<class t1,class t2,class t3,class t4,class t5>void _(t1 &a,t2 &b,t3 &c,t4 &d,t5 &e){_(a);_(b);_(c);_(d);_(e);}
void _p(dou k){printf("%.6lf",k);}void _p(char *c){for(;*c;ptc(*c++));}void _p(const char *c){for(;*c;ptc(*c++));}void _p(char c){ptc(c);}
tpl void _p0(T k){if(k>=10)_p0(k/10);ptc(k%10+'0');}tpl void _p(T k){if(k<0){ptc('-');_p0(-k);}else _p0(k);}tpl void __p(T k){_p(k);ptc(' ');}
tpl void _pn(T k){_p(k);ptc('\n');}template<class t1,class t2>void _p(t1 a,t2 b){__p(a);_pn(b);}
template<class t1,class t2,class t3>void _p(t1 a,t2 b,t3 c){__p(a);__p(b);_pn(c);}
template<class t1,class t2,class t3,class t4>void _p(t1 a,t2 b,t3 c,t4 d){__p(a);__p(b);__p(c);_pn(d);}
tpl void op(T *a,int n){int i;n--;fo(i,n)__p(a[i]);_pn(a[n+1]);}int gi(){int x;_(x);ret x;}ll gll(){ll x;_(x);ret x;}
}
int gcd(int a,int b){ret b?gcd(b,a%b):a;}void fcl(){fclose(stdin);fclose(stdout);}
void fop(const char *s){char c[256],d[256];cl(c,0);cl(d,0);strcpy(c,s);strcpy(d,s);opi(strcat(c,".in"));opo(strcat(d,".out"));}
int eq(dou a,dou b){return a+eps>=b&&b+eps>=a;}tpl void _ma(T &a,T b){if(a<b)a=b;}tpl void _mi(T &a,T b){if(a>b)a=b;}
cint N=1234567,EE=100000000,GG=1000000000,ima=2147483647;
use io;
int n,m,a,b,c,T;
int ksm(int a,int b,int p)
{
if(!b)
return 1;
int t=ksm(a,b/2,p);
t=t*t%p;
return b%2?t*a%p:t;
}
int main()
{
int i,j,a1,a2;
_(a,b,c);
_pn(ksm(a%10,ksm(b%4,c,4)+4,10));
}
| #include <bits/stdc++.h>
#define rei register int
using namespace std;
int qpow(int x,int p,int mod){
int res = 1; while(p){
if(p & 1) res = 1ll*res * x % mod; x = 1ll*x * x % mod; p >>= 1;
} return res;
} bool vis[11];
int main(){
int A,B,C; cin >> A >> B >> C;
int mod = 1,now = 1; vis[1] = 1; while(1){
now = 1ll*now * A % 10;
if(vis[now]) break; ++mod; vis[now] = 1;
} if(A % 2 == 0 || A % 5 == 0) --mod;
int x = qpow(B,C,mod);
if(A % 2 != 0 && A % 5 != 0) cout << qpow(A,x,10);
else cout << qpow(A,(x - 1 + mod) % mod + 1,10) % 10;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin>>n;
int d = n.size()-1;
int count = 0 , c= 0;
for(int i = d;i>=0; i-- ){
if(n[i]=='0')c++;
else break;
}
for(int i = 0;i<c; i++ ){
n = '0'+n;
}
d = d + c ;
for(int i = 0 ; i <= d/2 ;i++ ){
if(n[i]!=n[d-i])count=2;
}
if(count == 0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <bitset>
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s == string(s.rbegin(), s.rend())) {
cout << "Yes" << endl;
}
else {
int n = atoi(s.c_str());
while (n % 10 == 0) {
n /= 10;
}
string ss = to_string(n);
if (ss == string(ss.rbegin(), ss.rend())) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 200100
#define MOD 1000000007 //998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
vector<pii>e[N];
int a[N];
bool used[N];
void dfs(int k,int pc,int ec) {
bool v = true;
used[k] = true;
if ((a[k] == -1) && (ec != pc))a[k] = ec;
int sz = e[k].size();
rep(i, sz) {
if (!used[e[k][i].first]) {
if ((a[k] == -1) && (e[k][i].second != pc))a[k] = e[k][i].second;
dfs(e[k][i].first, a[k], e[k][i].second);
}
}
return;
}
int main() {
int n, m;
int x, y, z;
cin >> n >> m;
rep(i, m) {
cin >> x >> y >> z;
x--;
y--;
e[x].pb({ y,z });
e[y].pb({ x,z });
}
rep(i, n) {
used[i] = false;
a[i] = -1;
}
dfs(0, -1, -1);
rep2(i, 1, n)used[i] = false;
rep(i, n) {
if (a[i] >= 0)used[a[i]] = true;
}
rep2(i,1, n) {
if (!used[i]) {
x = i;
break;
}
}
rep(i, n) {
if (a[i] < 0)a[i] = x;
}
rep(i, n)cout << a[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int i = 0; i < (int)(n) ; i++)
#define rep2(i,a,b) for (int i = (a); i < (int)(b); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define ENDL '\n'
#define pb push_back
#define SIZE(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define UNIQUE(a) a.erase(unique(all(a)),a.end());
#define debug(x) cout<<(#x)<<" is : "<<x<<endl;
#define debugc(vec) {cout<<(#vec)<<" is below; ---"<<endl;for(auto c:vec)cout<<c<<" ";cout<<endl<<"----------------"<<endl;}
inline string rev(string s) {string t(s.rbegin(), s.rend()); return t;}
template<class T> inline bool chmin(T &a, T b) { if(a>b) {a=b; return 1;} return 0;}
template<class T> inline bool chmax(T &a, T b) { if(a<b) {a=b; return 1;} return 0;}
const ll INF = (1LL<<30)-1;
const ll INFLL = (1LL<<62)-1;
const ld PI = 3.14159265358979323846L;
int main() {
cout << fixed << setprecision(15);
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n; cin>>n;
string s; cin>>s;
int q; cin>>q;
int odd=0;
vector<pair<int,int>> quer;
while(q--) {
int t,a,b; cin>>t>>a>>b;
a--; b--;
if(t==2) {odd++; continue;}
if(odd%2==0) {
quer.push_back({a,b});
}
else {
if(a<=n-1) a+=n;
else a-=n;
if(b<=n-1) b+=n;
else b-=n;
quer.push_back({a,b});
}
}
for(auto [a,b]:quer) {
swap(s[a],s[b]);
}
if(odd%2==1) {
string latter=s.substr(n), former=s.substr(0,n);
s=latter+former;
}
cout<<s<<endl;
} |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";}
//おちこんだりもしたけれど、私はげんきです。
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin>>N;
ll cen[4];
rep(i,4) cen[i]=0;
vector<ll> A(N),B(N),C(N),D(N);
rep(i,N){
cin>>A[i]>>B[i];
A[i]*=N;
B[i]*=N;
cen[0]+=A[i];
cen[1]+=B[i];
}
rep(i,N){
cin>>C[i]>>D[i];
C[i]*=N;
D[i]*=N;
cen[2]+=C[i];
cen[3]+=D[i];
}
rep(i,4) cen[i]/=N;
rep(i,N){
A[i]-=cen[0];
B[i]-=cen[1];
C[i]-=cen[2];
D[i]-=cen[3];
}
if(A[0]*A[0]+B[0]*B[0]==0){
swap(A[0],A[1]);
swap(B[0],B[1]);
}
set<pair<int,int>> s;
ll L=A[0]*A[0]+B[0]*B[0];
rep(i,N) s.insert({C[i]*L,D[i]*L});
bool T=false;
vector<vector<ll>> q=
{
{A[0],B[0]},
{B[0]*-1,A[0]}
};
//rep(i,N) cout<<A[i]<<" "<<B[i]<<" "<<C[i]<<" "<<D[i]<<endl;
rep(i,N){
if(L!=C[i]*C[i]+D[i]*D[i]) continue;
bool U=true;
vector<vector<ll>> p(2,vector<ll>(2));
vector<vector<ll>> r=
{
{C[i],D[i]*-1},
{D[i],C[i]}
};
rep(a,2) rep(b,2) rep(c,2){
p[a][b]+=q[a][c]*r[c][b];
}
/*rep(i,2){
rep(j,2) cout<<p[i][j]<<" ";
cout<<endl;
}*/
rep(j,N){
ll X=0,Y=0;
X=A[j]*p[0][0]+B[j]*p[0][1];
Y=A[j]*p[1][0]+B[j]*p[1][1];
if( !s.count({X,Y}) ){
U=false;
break;
}
}
T|=U;
}
yneos(T);
}
| // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
ll cross(ll x1, ll y1, ll x2, ll y2) {
return x1*y2 - x2*y1;
}
ll dot(ll x1, ll y1, ll x2, ll y2) {
return x1*x2 + y1*y2;
}
int main() {
int N; cin >> N;
vector<int> A(N), B(N);
for(int i=0; i<N; i++) cin >> A[i] >> B[i];
vector<int> C(N), D(N);
for(int i=0; i<N; i++) cin >> C[i] >> D[i];
if(N == 1) {
puts("Yes");
return 0;
}
set< vector< tuple<ll, ll, ll> > > S;
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
if(i == j) continue;
// ベクトル ij に沿って x 軸を作る感じ
ll x1 = A[j] - A[i], y1 = B[j] - B[i];
vector< tuple<ll, ll, ll> > vec;
for(int k=0; k<N; k++) {
ll x2 = A[k] - A[i], y2 = B[k] - B[i];
ll c = cross(x1, y1, x2, y2);
ll d = dot(x1, y1, x2, y2);
ll len = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
vec.emplace_back(c, d, len);
}
sort(vec.begin(), vec.end());
S.emplace(vec);
}
}
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
if(i == j) continue;
ll x1 = C[j] - C[i], y1 = D[j] - D[i];
vector< tuple<ll, ll, ll> > vec;
for(int k=0; k<N; k++) {
ll x2 = C[k] - C[i], y2 = D[k] - D[i];
ll c = cross(x1, y1, x2, y2);
ll d = dot(x1, y1, x2, y2);
ll len = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
vec.emplace_back(c, d, len);
}
sort(vec.begin(), vec.end());
if(S.count(vec)) {
puts("Yes");
return 0;
}
}
}
puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define POPCOUNT(x) __builtin_popcount(x)
template <typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template <typename T> void chmax(T &a, const T &b) { a = max(a, b); }
const ll INF = 1LL << 60;
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fastiofastio;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// BEGIN CUT
ll modpow(ll x, ll y, ll m) {
ll a = 1, p = x;
while (y > 0) {
if (y % 2 == 0) {
p = (p * p) % m;
y /= 2;
} else {
a = (a * p) % m;
y--;
}
}
return a;
}
// END CUT
int dp[100000][2]; //た or あ
vector<int> G[100000];
int sz[100000];
int dfs(int v) {
sz[v] = 1;
for (int to : G[v]) {
sz[v] += dfs(to);
}
return sz[v];
}
void solve(int v) {
//た のターンだとする
vector<int> odd, even;
int ans = 0;
for (int to : G[v]) {
solve(to);
if (sz[to] % 2 == 0)
even.push_back(dp[to][0] - dp[to][1]);
else
odd.push_back(dp[to][0] - dp[to][1]);
ans += dp[to][1];
}
sort(ALL(odd), greater<int>());
int rest = 0;
for (int x : even) {
if (x >= 0)
ans += x;
else
rest += x;
}
if (odd.size() % 2 == 0)
ans += rest;
for (int i = 0; i < odd.size(); i += 2)
ans += odd[i];
dp[v][0] = ans - 1;
// あ のターン
odd.clear();
even.clear();
ans = rest = 0;
for (int to : G[v]) {
if (sz[to] % 2 == 0)
even.push_back(dp[to][1] - dp[to][0]);
else
odd.push_back(dp[to][1] - dp[to][0]);
ans += dp[to][0];
}
sort(ALL(odd));
for (int x : even) {
if (x <= 0)
ans += x;
else
rest += x;
}
if (odd.size() % 2 == 0)
ans += rest;
for (int i = 0; i < odd.size(); i += 2)
ans += odd[i];
dp[v][1] = ans + 1;
}
int main() {
int n;
cin >> n;
FOR(i, 1, n) {
int p;
cin >> p;
p--;
G[p].push_back(i);
}
dfs(0);
solve(0);
cout << (n + dp[0][1]) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n; cin >> n;
ll a[n]; zep(i, 0, n)cin >> a[i];
ll cnt[200]; memset(cnt, 0, sizeof(cnt));
ll ans = 0;
zep(i, 0, n){
ans += cnt[a[i] % 200];
cnt[a[i] % 200]++;
}
print(ans)
return 0;
} |
//全力以赴
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 3e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll extGcd(ll a, ll b, ll &x, ll &y) { // solves for x and y where ax+by=gcd(a,b)
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll modInv(ll a, ll p) { // solve for x=a^-1 where ax + py = 1 % p
if(gcd(a, p) != 1) return -1; // modInv only exists if a and p are coprime (gcd(a, p) = 1)
ll x, y;
extGcd(a, p, x, y);
x = (x % p + p) % p;
return x;
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a,b);
}
/*
a^b:
if b is even -> a^b = a^(b/2) * a^(b/2)
if b is odd -> a^b = a * a^(b-1/2) * a^(b-1/2)
*/
ll modPow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return res;
}
int find(int x) {
return x == parent[x] ? x : parent[x] = find(parent[x]);
}
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if(xPar != yPar) parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for(ll i=1;i<=r;i++) {
res = res * (n - r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
int msbPos(int n) {
if(n == 0) return 0;
int msbPos = 0;
n /= 2;
while(n != 0) {
n /= 2;
msbPos++;
}
return msbPos;
}
string toOct(int n) {
string res;
while(n > 0) {
res = to_string(n % 8) + res;
n /= 8;
}
return res;
}
vector<int> d(1e6+6);
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << n - a + b << endl;
}
int main()
{
IOS
/*int t;
cin >> t;
while(t--) solve();*/
solve();
return 0;
} | // I've done my sentence but committed no crime
#pragma GCC optimize("Ofast")
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define mod (int)(1e9+7)
#define flush fflush(stdout);
void solve() {
int n,m,x,y; cin>>n>>m>>x>>y;
string s[n];
for(auto &it:s)
cin>>it;
int ans=0;
x--;y--;
for(int i=x-1;i>=0&&s[i][y]!='#';i--){
ans++;
}
for(int i=x+1;i<n&&s[i][y]!='#';i++){
ans++;
}
for(int i=y-1;i>=0&&s[x][i]!='#';i--){
ans++;
}
for(int i=y+1;i<m&&s[x][i]!='#';i++){
ans++;
}
ans++;
cout<<ans;
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define Rep(i,j,n) for (ll i=(ll)(j);i<=(ll)(n);++i)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9+7;
const int mod = 998244353;
const ll INF = 2e15;
template<class T> void print(const T& t){ cout << t << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
/*
ll ti=clock();
cout<<("Execution Time: %.4lf sec", 1.0 * (clock() - ti) / CLOCKS_PER_SEC)<<endl;
*/
int main(){
ll x,y,z;
cin>>x>>y>>z;
ll ans=10000000;
while(1){
if(y*z>x*ans){
break;
}
ans--;
}
print(ans);
} | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<random>
#include<ctime>
#include<queue>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int mod = 1e9+7;
const int maxn = 2e6+5;
ll n;
ll up[105];
ll dp[105][105][105];
int vis[105][105][105];
int len;
ll dfs(int pos,int limit,int a,int b){
if(pos==-1) return 1;
if(!limit&&vis[pos][a][b]!=-1) return dp[pos][a][b];
ll ans = 0;
int li = limit?up[pos]:1;
for(int i=0;i<=li;i++){
if(i==0){
if(a>0) ans+=dfs(pos-1,limit&&(i==li),a-1,b);
}else {
if(b>0) ans+=dfs(pos-1,limit&&(i==li),a,b-1);
}
}
if(!limit&&vis[pos][a][b] == -1) dp[pos][a][b] = ans,vis[pos][a][b] = 0;
return ans;
}
ll f(ll x,int a,int b){
int pos = 0;memset(up,0,sizeof(up));
while(x){
up[pos++] = x&1LL;
x>>=1LL;
}
return dfs(a+b-1,1,a,b);
}
void clc(ll ans){
string tmp;
while(ans){
if(ans&1LL) tmp+='b';
else tmp+='a';
ans>>=1;
}
while(tmp.size()<(len)) tmp+='a';
reverse(tmp.begin(),tmp.end());
cout<<tmp<<"\n";
}
int main() {
int a,b;
ll s;
cin>>a>>b>>s;
len = a+b;
ll l = (1LL<<(b))-1;
ll r = l<<a;
ll ans = 0;
memset(vis,-1,sizeof(vis));
while(l<=r){
ll mid = l+(r-l)/2;
ll sum = f(mid,a,b);
if(sum>=s){
if(sum==s){
ans = mid;
}
r = mid-1;
}else{
l = mid+1;
}
}
clc(ans);
return 0;
}
|
/*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef int ll;
const int N=10,M=1e5+10;
int n,m;
int wei[N],id[N];
ll f[N];
pair<int,int> bri[M]; //(limit,length)
inline int Read(int &r){
int b=1,c=getchar();r=0;
while(c<'0' || '9'<c) b=c=='-'? -1:b,c=getchar();
while('0'<=c && c<='9') r=(r<<1)+(r<<3)+(c^'0'),c=getchar();
return r*=b;
}
int Query(int tot){
int le=0,ri=m;
while(le+1<ri){
int mi=(le+ri)>>1;
if(bri[mi].first<tot) le=mi;
else ri=mi;
}
if(bri[ri].first<tot) return bri[ri].second;
return bri[le].second;
}
int main(){
Read(n),Read(m);
int minbri=1e8,maxwei=0;
for(int i=1;i<=n;i++) maxwei=max(maxwei,Read(wei[i])),id[i]=i;
for(int i=1;i<=m;i++){
Read(bri[i].second);
minbri=min(minbri,Read(bri[i].first));
}
if(minbri<maxwei){
printf("-1\n");
return 0;
}
sort(bri+1,bri+1+m);
for(int i=2;i<=m;i++)
bri[i].second=max(bri[i].second,bri[i-1].second);
ll ans=(ll)1e18;
do{
for(int i=1;i<=n;i++) f[i]=0;
for(int i=1;i<=n;i++){
int tot=wei[id[i]];
for(int j=i+1;j<=n;j++){
tot+=wei[id[j]];
f[j]=max(f[j],f[i]+Query(tot));
}
}
ans=min(ans,f[n]);
}while(next_permutation(id+1,id+1+n));
printf("%d\n",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
//V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int,int>;
using Pl = pair<ll, ll>;
using Vs = vector<string>;
const ll mod = 1000000007;
const ll inf = 1000000000000;//10の12乗
int main() {
ll h,w,n,m;
cin >> h >> w >> n >> m;
VVl aka(h,Vl(w)),lit(h,Vl(w));
rep(i,n){
ll x,y;
cin >> x >> y;
x--;y--;
aka[x][y]+=2;
}
rep(i,m){
ll x,y;
cin >> x >> y;
x--;y--;
aka[x][y]--;
}
rep(i,h)rep(j,w){
if(aka[i][j]>0){
while(j>0){
if(aka[i][j-1]==-1)break;
j--;
}
while(j<w){
if(aka[i][j]==-1){
//j++;
break;
}
lit[i][j]++;
j++;
}
}
//cout << j << endl;
}
rep(j,w)rep(i,h){
if(aka[i][j]>0){
while(i>0){
if(aka[i-1][j]==-1)break;
i--;
}
while(i<h){
if(aka[i][j]==-1){
//i++;
break;
}
lit[i][j]++;
i++;
}
//cout << i << endl;
}
}
ll ans=0;
rep(i,h)rep(j,w){
if(lit[i][j]>=1&&aka[i][j]>=0) ans++;
//cout << lit[i][j] << endl;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void canhazfast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
while (b) {
T q = a/b; a %= b; swap(a, b);
x0 -= q*x1; swap(x0, x1);
y0 -= q*y1; swap(y0, y1);
}
x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}
int main()
{
canhazfast();
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
ans = gcd(ans, a);
}
cout << ans << '\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int dp[2][100005],dpp[2][100005],a[100005];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
dp[0][n]=dp[1][n]=1;
dpp[0][n]=a[n];
dpp[1][n]=(-a[n]+mod)%mod;
for(int i=n-1;i>=1;i--){
dp[0][i]=(dp[1][i+1]+dp[0][i+1])%mod;
dp[1][i]=dp[0][i+1];
dpp[0][i]=(1LL*dp[0][i]*a[i]%mod+dpp[0][i+1]+dpp[1][i+1])%mod;
dpp[1][i]=(1LL*dp[1][i]*((-a[i]+mod)%mod)+dpp[0][i+1])%mod;
// printf("%d %d %d %d %d\n",i,dp[0][i],dp[1][i],dpp[0][i],dpp[1][i]);
}
printf("%d",dpp[0][1]);
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int a,b,c,d;
cin >> a >> b >> c >> d;
int ans = a * d - b * c;
cout << ans;
}
|
//#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#include <iterator>
#include <random>
#include <chrono>
#include <complex>
#include <thread>
#define forr(i,start,count) for (int i = (start); i < (start)+(count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) int i; cin >> i
#define readll(i) ll i; cin >> i
#define readdouble(i) double i; cin >> i
#define readstring(s) string s; cin >> s
typedef long long ll;
using namespace std;
//using namespace atcoder;
//ll modd = (1000LL * 1000LL * 1000LL + 7LL);
ll modd = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cout.precision(17);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(0, modd); // rand_gen(rng) gets the rand no
auto start = chrono::steady_clock::now();
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readint(a); readint(b); readint(c); readint(d);
cout << a*d-b*c << endl;
}
// auto stop = chrono::steady_clock::now();
// auto duration = chrono::duration_cast<chrono::milliseconds>(stop - start);
// cout << "Duration: " << duration.count() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,x,n) for(int i = x; i<=n; i++)
#define FORO(i,n) for(int i = 0; i<n; i++)
#define nl "\n"
#define sp " "
#define MOD 1000000007
#define pb push_back
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c;
cin>>a>>b>>c;
if(a*a+b*b<c*c) cout<<"Yes";
else cout<<"No";
return 0;
}
| #ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}
// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len=v.size();
for(int i=0; i<len; ++i) {
s<<v[i];
if(i<len-1) s<<" ";
}
return s;
}
// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
s<<endl;
int len=vv.size();
for(int i=0; i<len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
// パスカル Pascal nCk
long long com[61][61];
int solve(){
ll a,b,k;
cin>>a>>b>>k;
ll n = a+b;
string s;
com[0][0] = 1;
for (int i = 1; i < 61; ++i) {
for (int j = 0; j <= i; ++j) {
com[i][j] += com[i-1][j];
if (j > 0) com[i][j] += com[i-1][j-1];
}
}
dbg(com[60][30])
auto dfs = [&](auto &&self, ll a, ll b, ll k)->void {
if(a<=0 && b<=0) return;
dbg(mp(mp(a,b),k));
if( a > 0){
ll zenhan = com[a+b-1][a-1];
dbg(zenhan)
if(k <= zenhan){
s += 'a';
a--;
self(self, a,b,k);
}else{
k -= zenhan;
s += 'b';
b--;
self(self, a,b,k);
}
}else{
s += 'b';
b--;
self(self, a,b,k);
}
};
dfs(dfs, a, b, k);
out(s);
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
// ll T;
// cin>>T;
// while(T--)
solve();
}
|
#include <bits/stdc++.h>
using i64 = long long;
constexpr int P = 1000000007;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
std::vector<int> a(n);
std::vector<std::vector<i64>> dp(n + 1, std::vector<i64>(2));
std::vector<std::vector<int>> cnt(n + 1, std::vector<int>(2));
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
dp[0][0] = a[0];
cnt[0][0] = 1;
for (int i = 1; i < n; i++) {
cnt[i][0] = (cnt[i - 1][0] + cnt[i - 1][1]) % P;
cnt[i][1] = cnt[i - 1][0];
dp[i][0] = (dp[i - 1][0] + dp[i - 1][1] + i64(a[i]) * cnt[i - 1][0] % P + i64(a[i]) * cnt[i - 1][1] % P + P) % P;
dp[i][1] = (dp[i - 1][0] - i64(a[i]) * cnt[i - 1][0] % P + P) % P;
}
std::cout << (dp[n - 1][0] + dp[n - 1][1]) % P << "\n";
return 0;
} | #include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
long long c = a % i_7;
if(c >= 0) return c;
return c + i_7;
}
long long po(long a, long b){
if(b == 0) return 1;
long long z = po(a , b / 2);
z = mod(z * z);
if(b % 2 != 0) z = mod(a * z);
return z;
}
bool prime_(int n){
if(n == 1){
return false;
}else if(n == 2){
return true;
}else{
for(int i = 2; i <= std::sqrt(n); i++) if(n % i == 0) return false;
return true;
}
}
long long gcd_(long long a, long long b){
if(a < b) std::swap(a,b);
if(a % b == 0) return b;
else return gcd_(b, a % b);
}
long long lcm_(long long x, long long y){
return (x / gcd_(x,y)) * y;
}
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
int main(){
//using namespace std;
int x;
cin>>x;
int ans = ((x + 99) / 100) * 100 - x;
if(ans == 0) ans = 100;
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
#define num_l(a,v) POSL(a,v) //v未満の要素数
#define num_eql(a,v) POSU(a,v) //v以下の要素数
#define num_h(a,v) (a.size() - POSU(a,v)) //vより大きい要素数
#define num_eqh(a,v) (a.size() - POSL(a,v)) //v以上の要素数
// static_cast< long long ll >
int N = 30*30;
int L = 30;
// (i,j) i個下 , j個右
int ind(int a,int b){
return a*L + b;
}
//vector< vector<string> > S(N,vector<string>(N));
vector<vector<long double>> H(L,vector<long double>(L,5000.0));
vector<vector<long double>> V(L,vector<long double>(L,5000.0));
// 上は下より(i,j)のiが小さい 右は左より(i,j)のjが大きい
// 順路正の向きで
const int From_U = 0;//上から来た
const int From_D = 1;//下から来た
const int From_L = 2;//左から来た
const int From_R = 3;//右から来た
// 復元
string make_char = "DURL";
const int dy[] = {-1,1,0,0};
const int dx[] = {0,0,-1,1};
int main(){
int sy,sx,ty,tx;
int s,t;
FOR(k,0,1000){
cin >> sy >> sx >> ty >> tx;
int dir_y = 1;
int dir_x = 1;
if(sy > ty) dir_y = -1;
if(sx > tx) dir_x = -1;
// (i,j) には (i - dir_y , j) or (i , j - dir_x) から行く
vector< vector<long double> > score(L,vector<long double>(L,INF));
vector< vector<int> > from(L,vector<int>(L,-1));
score[sy][sx] = 0;
for(int y=sy;(y-dir_y)!=ty;y+=dir_y){
for(int x=sx;(x-dir_x)!=tx;x+=dir_x){
//cout << y << " " << x << endl;
if(y==sy && x==sx) continue;
long double a = INF,b = INF;
if(y != sy) a = score[y-dir_y][x] + H[min(y-dir_y,y)][x];
if(x != sx) b = score[y][x-dir_x] + V[y][min(x,x-dir_x)];
if(a < b){
from[y][x] = (dir_y == 1 ? From_U : From_D );
score[y][x] = a;
}else{
from[y][x] = (dir_x == 1 ? From_L : From_R );
score[y][x] = b;
}
}
}
//return 0;
//cout << "95" << endl;
string T;
int y=ty,x=tx;
while(y!=sy || x!=sx){
int a = from[y][x];
T += make_char[a];
assert(0 <= a && a <= 3);
y += dy[a];
x += dx[a];
//cout << "from[" << y << "][" << x << "] = " << a << endl;
}
//cout << "106" << endl;
//cout << T << endl;
REV(T);
/*{ // チェック
assert(T.size() == (abs(sy-ty)+abs(sx-tx)));
int ud=0,lr=0;
for(auto c:T){
if(c == 'U' || c == 'D') ud++;
if(c == 'L' || c == 'R') lr++;
}
assert(abs(sy-ty) == ud);
assert(abs(sx-tx) == lr);
}*/
cout << T << endl;
cout << flush;
long double score_now,r;
cin >> score_now;
r = pow( score_now / score[ty][tx] , 1.0 - 1.0*(abs(sy-ty) + abs(sx-tx)) / 120.0 );
y=ty,x=tx;
while(y!=sy || x!=sx){
int a = from[y][x];
int by = y + dy[a],bx = x + dx[a];
if(by != y){
H[min(by,y)][x] *= r;
}else{
V[y][min(bx,x)] *= r;
}
y += dy[a];
x += dx[a];
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT16(x) cout << fixed << setprecision(16) << (x) << "\n";
unsigned long Combination(int n,int r)
{
unsigned long i = 1;
int k = r > n - r ? n - r : r, count;
if(k < 0) return 0;
for(count = 1; count <= k; ++count)
{
i *= n - count + 1;
i /= count;
}
return i;
}
int main(){
//input
ll a,b,k;
cin >> a >> b >> k;
string ans = "";
ll now = 0;
while(a!=0||b!=0){
ll now_a = Combination(a+b-1,a-1);//aを選んだとする
ll now_b = Combination(a+b-1,b-1);//bを選んだとする
if(now+now_a>=k){
ans += 'a';
--a;
}
else{
ans += 'b';
now+=now_a;
--b;
}
}
COUT(ans);
} |
#include <bits/stdc++.h>
#define lol long long
#define INF 998244353
using namespace std;
int main(){
int a,b;
char c;
cin>>a>>b;
for(int i=0;i<a;i++){
cin>>c;
if(c=='o') b++;
else if(b!=0) b--;
}
cout<<b<<"\n";
return(0);
} | #include <bits/stdc++.h>
#define f(a, n) for (int a = 0; a < n; a++)
#define F(a, n) for (int a = 1; a <= n; a++)
using namespace std;
int main(){
int n, x;
string s;
cin>>n>>x>>s;
f(i, n){
if (s[i] == 'o'){
x++;
}
else{
if (x > 0) x--;
}
}
cout<<x<<endl;
} |
#include <iostream>
#include <vector>
#include <numeric>
#include<cstdlib>
#include <map>
#include <set>
#include <algorithm> // std::random_shuffle
#define INF (1<<30)
#define ll long long
#define MAXX 800*800
using namespace std;
int A[888][888];
int B[888][888];
int cumul[888][888];
bool Can(int N,int K) {
for(int i=0;i<=N;i++) {
for(int j=0;j<=N;j++) {
cumul[i][j]=0;
}
}
for(int i=1;i<=N;i++) {
for(int j=1;j<=N;j++) {
cumul[i][j]=cumul[i-1][j]+cumul[i][j-1]-cumul[i-1][j-1]+B[i][j];
// printf("%d %d :: %d\n",i,j,cumul[i][j]);
}
}
// printf("st=%d\n");
for(int i=1;i+K-1<=N;i++) {
for(int j=1;j+K-1<=N;j++) {
// printf("%d %d ::: %d\n",i,j,cumul[i+K-1][j+K-1]-cumul[i-1][j+K-1]-cumul[i+K-1][j-1]+cumul[i-1][j-1]);
// cout << K*K-(K*K)/2-1 << endl;
if (cumul[i+K-1][j+K-1]-cumul[i-1][j+K-1]-cumul[i+K-1][j-1]+cumul[i-1][j-1] >= K*K-(K*K)/2) {
return true;
}
}
}
return false;
}
int main() {
int N,K;
cin>>N>>K;
for(int i=1;i<=N;i++) {
for(int j=1;j<=N;j++) {
cin>>A[i][j];
}
}
ll low=0;
ll high=1.1e9;
while(low < high) {
ll mid = (low + high)/2;
//cout << mid << endl;
for(int i=1;i<=N;i++) {
for(int j=1;j<=N;j++) {
B[i][j]=(A[i][j]<mid);
}
}
if (Can(N, K)) {
high=mid;
} else {
low=mid+1;
}
}
cout << low-1 << endl;
} | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM(f:>>)
// ---- inserted function f:>> from util.cc
template <typename T1, typename T2>
istream& operator>> (istream& is, pair<T1,T2>& p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2, typename T3>
istream& operator>> (istream& is, tuple<T1,T2,T3>& t) {
is >> get<0>(t) >> get<1>(t) >> get<2>(t);
return is;
}
template <typename T1, typename T2, typename T3, typename T4>
istream& operator>> (istream& is, tuple<T1,T2,T3,T4>& t) {
is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t);
return is;
}
template <typename T>
istream& operator>> (istream& is, vector<T>& v) {
for (size_t i = 0; i < v.size(); i++) { is >> v[i]; }
return is;
}
template <typename T>
vector<T> read_vector_n(istream& is, size_t n) {
vector<T> ret(n);
for (size_t i = 0; i < n; i++) {
is >> ret[i];
}
return ret;
}
template <typename T>
vector<T> read_vector(istream& is) {
size_t n; is >> n;
return read_vector_n<T>(is, n);
}
// ---- end f:>>
// @@ !! LIM -- end mark --
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N; cin >> N;
vector<ll> A(2*N); cin >> A;
using sta = pair<ll, ll>;
vector<sta> P;
for (ll i = 0; i < 2*N; i++) {
P.emplace_back(A[i], i);
}
sort(P.begin(), P.end());
vector<ll> ord(2*N);
for (ll i = 0; i < 2*N; i++) {
auto [a, j] = P[i];
ord[j] = i;
}
string ans = "";
ll exc = 0;
bool flag = false;
for (ll i = 0; i < 2*N; i++) {
if (exc > 0) {
ll inc = (flag == (bool)(ord[i] < N));
if (inc) {
ans += '(';
exc++;
}else {
ans += ')';
exc--;
}
}else {
if (ord[i] < N) {
flag = true;
}else {
flag = false;
}
ans += '(';
exc++;
}
}
cout << ans << endl;
return 0;
}
|
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace ::std;
// clang-format off
template<typename T> T nxt() {T res; cin >> res; return res;}
#define tests() for (int _ = nxt<int>(); _ > 0; _--)
#define nxt1(t,n) t (n); cin >> n
#define nxt2(t,n,m) t (n),(m); cin >> n >> m
#define nxt3(t,n,m,k) t (n),(m),(k); cin >> n >> m >> k
#define rep(i, A) for (int i = 0 ; i < A ; i++)
#define ll long long
typedef pair<int,int> pii;typedef pair<ll, ll> pll;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<ll> vl;typedef vector<vl> vvl;
#define dbg(vari) cerr<<#vari<<" = "<<(vari)<<endl;
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t){for(T ti : t)s<<ti<<" ";return s; }
#define all(x) (x).begin(), (x).end()
#define last(vec) vec[vec.size()-1]
#define has(c,x) ((c).find(x) != (c).end())
// clang-format on
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N = nxt<int>();
cout << N - 1 << endl;
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, K;
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> K;
ll x = N;
rep(_, 0, K) {
if (x % 200 == 0) x /= 200;
else x = x * 1000 + 200;
}
cout << x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define REP(i, s, n) for (long long i = (s); i <= (n); i++)
#define repr(i, n) for (long long i = (n - 1); i >= 0; i--)
#define REPR(i, s, n) for (long long i = (s); i >= (n); i--)
#define all(v) (v).begin(), (v).end() //biginからendへ
#define rall(v) (v).rbegin(), (v).rend()
#define sumvec(v) accumulate(all(v), 0LL)
#define DOUBLE fixed << setprecision(15)
#define OK cerr << "OK\n"
#define OK1 cerr << "OK1\n"
#define OK2 cerr << "OK2\n"
#define sz(s) (long long)s.size()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vd> vvd;
typedef vector<vc> vvc;
typedef vector<vb> vvb;
typedef pair<ll, ll> P;
typedef vector<P> vP;
//vectorの末尾参照は .back()を使おう。
//if(chmax(ans, i))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
IN(__VA_ARGS__)
void scan(int &a)
{
cin >> a;
}
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail>
void IN(Head &head, Tail &...tail)
{
scan(head);
IN(tail...);
}
//INT(a,b)とか使う
void YES(bool b) { cout << ((b) ? "YES\n" : "NO\n"); }
void Yes(bool b) { cout << ((b) ? "Yes\n" : "No\n"); }
void yes(bool b) { cout << ((b) ? "yes\n" : "no\n"); }
void Yay(bool b) { cout << ((b) ? "Yay!\n" : ":(\n"); }
void posible(bool b) { cout << ((b) ? "posible\n" : "imposible\n"); }
void Posible(bool b) { cout << ((b) ? "Posible\n" : "Imposible\n"); }
void POsIBLE(bool b) { cout << ((b) ? "POsIBLE\n" : "IMPOsIBLE\n"); }
//出力の形式に合わせて関数をキャスとする
const int inf = 1001001001;
const long long INF = ((1LL << 62) - (1LL << 31));
const long double pi = acos(-1.0);
int main(){
vector<pair<double,double>> v;
LL(n);
rep(i,n){
LL(t);
DBL(l,r);
if(t == 2) r -= 0.1;
if(t == 3) l += 0.1;
if(t == 4){
r -= 0.1;
l += 0.1;
}
v.push_back(make_pair(l,r));
}
ll ans = 0;
rep(i,n){
REP(j,i + 1,n - 1){
if(v[i].first == v[j].first || v[i].first == v[j].second || v[i].second == v[j].first || v[i].second == v[j].second) ans++;
else if((v[j].first < v[i].first && v[j].second > v[i].first) || (v[i].first < v[j].first && v[i].second > v[j].first)) ans++;
}
}
cout << ans;
}
| // Template begins
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <math.h>
#include <iomanip>
#include <queue>
#include <string.h>
#include <string>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
#define fo(i,a,b) for(i=a;i<=b;i++)
#define all(v) (v).begin(),(v).end()
#define sort0(v) sort(all(v))
#define lbb(a,b,arr,x) lower_bound(arr+a,arr+b+1,x)-arr
#define ubb(a,b,arr,x) upper_bound(arr+a,arr+b+1,x)-arr
#define freq(a,b,arr,x) upper_bound(arr+a,arr+b+1,x)-lower_bound(arr+a,arr+b+1,x)
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define d0(x) cout<<(x)<<" "
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define d5(a,b,c,d,e) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<" "<<(e)<<endl
#define d6(a,b,c,d,e,f) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<" "<<(e)<<" "<<(f)<<endl
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((c),(d)))
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
#define printp(x) cout << x.ff << " " << x.ss << endl
const ll mod=998244353;
#define inf 9999999999999
#define MAXN 100001
// stores smallest prime factor for every number
ll inv(ll i){if(i==1) return 1;return (mod-((mod/i)*inv(mod%i))%mod)%mod;}
ll gcd(ll a,ll b){if(a==0) return b;return gcd(b,b%a);}
inline void fastio(){ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
// Template ends
const int MN = 2e5+7;
ll dp[1 << 21];
ll fun(ll mask, ll n, vector <pii> v[]) {
int i=__builtin_popcount(mask);
if (i== n) {
return 1;
}
if (dp[mask] != -1) {
return dp[mask];
}
ll temp = 0;
ll cnt = 0;
for (auto j: v[i]) {
cnt = 0;
for (ll k = 1; k <= j.ff; k++) {
if (mask & (1LL << k)) {
++cnt;
}
}
if (cnt > j.ss) {
temp = -1e18;
}
}
for (ll j = 0; j < n; j++) {
if (mask & (1LL << j)) {
continue;
}
temp+=fun( mask | (1LL << j), n, v);
}
temp = max(temp, 0LL);
return dp[mask] = temp;
}
void solve(){
ll n,m; cin>>n>>m;
ll ans;
if (!m) {
ans = 1;
for (ll i = 1; i <= n; i++) {
ans *= i;
}
cout<<ans<<endl;
return;
}
vector <pii> v[20];
for (ll i = 0; i < m; i++) {
int x,y,z; cin>>x>>y>>z;
v[x].pb(mp(y,z));
}
memset(dp, -1, sizeof(dp));
ans = fun( 0, n, v);
cout<<ans<<endl;
}
int main(){
fastio();
//write code
solve();
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n, T;
int a[40];
vector<int> pre;
vector<int> suf;
void dfs(int cor, int end, int tsum, vector<int> &vec) {
if (cor == end) {
vec.push_back(tsum);
return;
}
dfs(cor + 1, end, tsum, vec);
dfs(cor + 1, end, tsum + a[cor], vec);
}
signed main() {
int i, j;
cin >> n >> T;
rep(i, n) cin >> a[i];
if (n == 1) {
if (a[0] <= T) {
cout << a[0] << endl;
}
else {
cout << 0 << endl;
}
return 0;
}
dfs(0, n / 2, 0, pre);
dfs(n / 2, n, 0, suf);
sort(pre.begin(), pre.end());
sort(suf.begin(), suf.end());
int ans = 0;
j = 0;
for (i = (int)pre.size() - 1; i >= 0; i--) {
if (pre[i] > T) continue;
for (; j < (int)suf.size(); j++) {
if (pre[i] + suf[j] > T) break;
}
if (j == 0) ans = max(ans, pre[i]);
else ans = max(ans, pre[i] + suf[j - 1]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ ios_base::sync_with_stdio(0);cin.tie(0);
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define forn(i,a,n) for(int i=a; i < n; i++)
typedef long long int lli;
typedef long double Double;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int mod = 1e9+7;
const int maxn = 40;
const int inf = 1e9;
int a[maxn];
int main(){__
int n;
cin >> n;
lli t;
cin >> t;
for(int i=0; i < n; i++) cin >> a[i];
int mit = n/2;
vector<lli> izq,der;
int uno = n/2;
int dos = n - uno;
for(int msk=0; msk < (1 << uno); msk++){
lli suma = 0ll;
for(int j=0; j < uno; j++){
if(msk & (1 << j)){
suma+=a[j];
}
}
izq.pb(suma);
}
for(int msk=0; msk < (1 << dos); msk++){
lli suma = 0ll;
for(int j=0; j < dos; j++){
if(msk & (1 << j)){
suma+=a[j+uno];
}
}
der.pb(suma);
}
sort(all(izq));
sort(all(der));
lli maxi = 0ll;
for(lli x : izq){
if(x > t) continue;
maxi = max(maxi,x);
int pos = upper_bound(all(der),t - x) - der.begin();
if(pos == 0) continue;
pos--;
assert(der[pos] + x <= t);
maxi = max(maxi,der[pos] + x);
}
for(lli x : der){
if(x > t) continue;
maxi = max(maxi,x);
int pos = upper_bound(all(izq),t - x) - izq.begin();
if(pos == 0) continue;
pos--;
assert(izq[pos] + x <= t);
maxi = max(maxi,izq[pos] + x);
}
cout << maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
namespace hy {
typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define PB push_back
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define MOD (int)(1e9 + 7)
#define EPS (1e-8)
#define INF (int)(1e9)
#define PI 3.14159265358979323846
#define VALID(x, y, m, n) (x >= 0 && x < m && y >= 0 && y < n)
#define LOW_BIT(x) ((x) & (-(x)))
#define fast_iostream ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
template<typename T> void chmin(T& a, T b) { if (b < a) a = b; }
template<typename T> void chmax(T& a, T b) { if (b > a) a = b; }
const vector<PII> dir {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
} using namespace hy;
#ifdef DEBUG
template <class T> ostream& operator << (ostream& os, vector<T>& vec) { for (auto x : vec) os << x << ' '; return os; }
template <class T> ostream& operator << (ostream& os, vector<vector<T> >& vec)
{ for (auto& v : vec) { for (auto x : v) os << x << ' '; os << endl; } os << endl; return os; }
template <class T> ostream& operator << (ostream& os, deque<T>& dq) { for (auto x : dq) os << x << ' '; return os; }
template <class T> ostream& operator << (ostream& os, pair<T, T>& p)
{ os << p.first << ' ' << p.second; os << endl; return os; }
#if __cplusplus >= 201103L
template <class K, class V> ostream& operator << (ostream& os, unordered_map<K, V>& mp)
{ for (auto x : mp) os << x.first << " : " << x.second << endl; return os; }
#endif
void print() { cout << endl; }
template<typename T, typename... Ts>
void print(T arg, Ts... args) { cout << " " << arg; print(args...); }
#else
void print() {}
#endif
// <-----------------------------------------------------------> //
/**
* TODO:
* Remember to reset global variable in every test cases!
* Check INT overflow!
*
* STAY ORGANIZED.
*/
int main() {
fast_iostream;
int n; cin >> n;
double x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
double d = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
double theta = PI / 2.0 - PI / n;
theta *= -1;
double len = cos(theta) * d;
PDD p = {(x2 - x1) / d, (y2 - y1) / d};
PDD q = {cos(theta) * p.first - sin(theta) * p.second, sin(theta) * p.first + cos(theta) * p.second};
cout << fixed << setprecision(6) << x1 + q.first * len << ' ' << y1 + q.second * len << endl;
return 0;
}
| //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif
/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }
/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
/* Initial processing */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;
/* Remove the source of the bug */
signed pow(signed, signed) { assert(false); return -1; }
/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}
/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }
/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;
//=============================================================================================
signed main() {
ll n;
cin >> n;
VL a(n), b(n);
cin >> a >> b;
multiset<ll, std::greater<ll>> odd, even;
REP(i, n) {
((i & 1) ? odd : even).emplace(b[i] - a[i]);
}
ll ans = 0;
REPC(x, a) { ans += x; }
dump(ans, odd, even);
while (!odd.empty() && *odd.begin() + *even.begin() > 0) {
ans += *odd.begin() + *even.begin();
odd.erase(odd.begin());
even.erase(even.begin());
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using lint = long int;
using llint = long long int;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k, m;
cin >> n >> k >> m;
vector<int> points(n - 1);
rep(i, n) cin >> points[i];
int cur_sum = 0;
for (auto point : points) cur_sum += point;
// check
for (int i = 0; i <= k; i++) {
int now = (cur_sum + i) / n;
if (now >= m) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| // Problem: B - Sign of Friendship
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, D, H;
cin >> n >> D >> H;
double ans = 0;
while (n--) {
int d, h;
cin >> d >> h;
ans = max(ans, H - (double)(H - h) / (D - d) * D);
}
printf("%.15lf\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
char c;
bool zf=0;
while(((c=getchar())<'0'||c>'9')&&c!= '-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
const int maxn=1e5+5;
int v[maxn];
int p[maxn],r;
int f[maxn];
signed main(){
int n=read();
f[1]=1;
for(register int i=2;i<=n;++i){
if(!v[i]){
p[++r]=i,f[i]=2;
}
for(register int j=1;j<=r&&i*p[j]<=n;++j){
v[i*p[j]]=1,f[i*p[j]]=f[i]+1;
if(i%p[j]==0){
break;
}
}
}
for(register int i=1;i<=n;++i){
printf("%d ",f[i]);
}
puts("");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE\n" : "IMPOSSIBLE\n" )
#define ANS(n) cout << (n) << "\n"
#define REP(i,n) for(int64 i=0;i<(n);++i)
#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)
#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)
#define all(obj) (obj).begin(),(obj).end()
#define rall(obj) (obj).rbegin(),(obj).rend()
#define fi first
#define se second
#define pb(a) push_back(a)
typedef pair<int32,int32> pii;
typedef pair<int64,int64> pll;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) { a = b; return true; } return false;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) { a = b; return true; } return false;
}
int32 n,m;
vector<vector<pii>> uc;
vector<int32> ans;
void dfs(int v, int p = -1, int pc = -1, bool selected = true){
if(selected){
if(pc == 1){
ans[v] = 2;
}else{
ans[v] = 1;
}
}else{
ans[v] = pc;
}
for(auto [u,c] : uc[v]){
if(ans[u] !=-1)continue;
dfs(u,v,c,ans[v] == c);
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
uc.resize(n);
REP(i,m){
int32 u,v,c;
cin >> u >> v >> c;
--u;--v;
uc[v].emplace_back(u,c);
uc[u].emplace_back(v,c);
}
ans.resize(n,-1);
dfs(0);
REP(i,n)ANS(ans[i]);
return 0;
} |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using i64 = int64_t;
using vi64 = vector<i64>;
using u64 = uint64_t;
#define rep(i, s, n) for (i64 i = (s); i < (n); ++i)
void run() {
i64 n, m;
cin >> n >> m;
vi64 hs(n), ws(m);
rep(i, 0, n) { cin >> hs[i]; }
rep(i, 0, m) { cin >> ws[i]; }
sort(begin(hs), end(hs));
sort(begin(ws), end(ws));
hs.push_back(numeric_limits<i64>::max());
vi64 rsum(n + 1);
rsum[n] = 0;
for (i64 i{n - 2}; - 1 < i; i -= 2) {
rsum[i] = hs[i + 1] - hs[i] + rsum[i + 2];
}
i64 ret{numeric_limits<i64>::max()}, iw{0}, lsum{0};
for (i64 ih{0}; ih < n; ih += 2) {
i64 cut_min{numeric_limits<i64>::max()};
for (; iw < m; ++iw) {
i64 cut{lsum + abs(hs[ih] - ws[iw]) + rsum[ih + 1]};
if (cut < cut_min) {
cut_min = cut;
} else if (cut_min < cut) {
--iw;
break;
}
}
iw = min(iw, m - 1);
ret = min(ret, cut_min);
lsum += hs[ih + 1] - hs[ih];
}
cout << ret << endl;
}
int main() {
cin.tie(nullptr);
cout.precision(std::numeric_limits<double>::max_digits10);
run();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,0,1,-1,-1};
const ll dx[8]={0,1,0,-1,0,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
return ((a > b) ? (a = b, true) : (false));
}
int main(){
ll n;cin >> n;
vl a(n),b(n),c(n);
rep(i,n){
cin >> a[i];a[i]--;
}
rep(i,n){
cin >> b[i];b[i]--;
}
rep(i,n)cin >> c[i],c[i]--;
rep(i,n)c[i]=b[c[i]];
map<ll,ll> mp;
rep(i,n)mp[a[i]]++;
ll ans=0;
rep(i,n){
ans+=mp[c[i]];
}
cout << ans <<endl;
}
|
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
const int N = 2e5 + 8;
const int K = 301;
const int MOD = 998244353;
int add(int a, int b) {
if (a + b < MOD) {
return a + b;
}
return a + b - MOD;
}
int sub(int a, int b) {
if (a >= b) {
return a - b;
}
return a - b + MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int binpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = mul(res, a);
a = mul(a, a);
b /= 2;
}
return res;
}
int divv(int a, int b) {
return mul(a, binpow(b, MOD - 2));
}
int a[N];
int s[K];
int ans[K];
int C[K][K];
void init() {
for (int i = 0; i < K; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = add(C[i - 1][j], C[i - 1][j - 1]);
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
int c = 1;
for (int j = 0; j < K; j++) {
s[j] = add(s[j], c);
c = mul(c, a[i]);
}
}
for (int i = 0; i < K; i++) {
for (int j = 0; i + j < K; j++) {
int S = mul(s[i], s[j]);
S = sub(S, s[i + j]);
S = divv(S, 2);
ans[i + j] = add(ans[i + j], mul(C[i + j][j], S));
}
}
for (int i = 1; i <= k; i++) {
cout << ans[i] << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(n,k) cout<<fixed<<setprecision(k)<<n<<endl
#define LL_MAX LLONG_MAX
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
int exp(int x,int y){int res=1;x=x%mod;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int modinv(int x){return exp(x,mod-2);}
int add(int a,int b){a%=mod,b%=mod;a=((a+b)%mod+mod)%mod;return a;}
int sub(int a,int b){a%=mod,b%=mod;a=((a-b)%mod+mod)%mod;return a;}
int mul(int a,int b){a%=mod,b%=mod;a=((a*b)%mod+mod)%mod;return a;}
int gcd(int a, int b){if (b == 0)return a; return gcd(b, a % b);}
int log2n( int n){ return (n > 1) ? 1 + log2n(n / 2) : 0;}
int fac[1000009];int ncr_mod(int n,int k){int ans=fac[n];ans*=modinv(fac[k]);ans%=mod;ans*=modinv(fac[n-k]);ans%=mod;return ans;}
vector<int>v_prime;void Sieve(int n){bool prime[n + 1];memset(prime,true,sizeof(prime));for (int p = 2; p*p <=n;p++){if(prime[p] ==true) {for(int i = p*p; i<= n; i += p)prime[i]=false;}}for(int p = 2;p<= n;p++)if (prime[p])v_prime.pb(p);}
vector<int>v_factor;void factor(int n){ for (int i=1; i<=sqrt(n); i++) {if (n%i == 0) {if (n/i == i) v_factor.pb(i);else { v_factor.pb(i),v_factor.pb(n/i);};} } sort(all(v_factor)); }
void out(vector<int>&a){for(int i=0;i<a.size();i++) cout<<a[i]<<" "; }
void sout(set<int>s){for(auto it=s.begin();it!=s.end();++it)cout<<*it<<" "; cout<<endl;}
void mout(map<int,int>mm){for(auto it=mm.begin();it!=mm.end();++it) cout<<it->fi<<" "<<it->se<<endl;}
int power(int x, int y){int temp;if( y == 0)return 1; temp = power(x, y / 2);if (y % 2 == 0) return temp * temp;else return x * temp * temp;}
// s.top().second;
signed main()
{
run;
/*
open for mod factorial
fac[0]=1;
for(int i=1;i<1000009;i++)
{
fac[i]=mul(fac[i-1],i);
}
*/
/*
for sieve open this and use v_prime
int pp=pow(10,6)+100000;
Sieve(pp);
*/
// factor(n) && USE v_factor For calculating factors
int t=1;
//cin>>t;
while(t--)
{
// map<int,int>mp; // x.second-->frequency
int n,i,x,y,ok=0,sum=0,ans=0,j,k,cnt=0,m,c=0;
int h[100009]={0};
cin>>x>>y;
vector<int>a(y,0),v,b(x,0);
int x1=-power(10,6);
for(i=0;i<y;i++)
{
a[i]=x1;
x1++;
sum+=a[i];
}
for(i=0;i<x-1;i++)
{
b[i]=i+1;
sum+=b[i];
}
b[x-1]=abs(sum);
out(a);
out(b);
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI 3.1415926535897932384
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S acm(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
void YN(bool b){cout<<(b?"YES":"NO")<<"\n";}
void Yn(bool b){cout<<(b?"Yes":"No")<<"\n";}
void yn(bool b){cout<<(b?"yes":"no")<<"\n";}
int sgn(const double&r){return (r>EPS)-(r<-EPS);} // a>0 : sgn(a)>0
int sgn(const double&a,const double&b){return sgn(a-b);} // b<=c : sgn(b,c)<=0
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;}
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s;a=0;} return os;}
struct UnionFind{
vl par,dist;
UnionFind(int x){par.assign(x,-1); dist.assign(x,0);}
ll find(ll x){return par[x]<0?x:find(par[x]);}
ll depth(ll x){return par[x]<0?0:depth(par[x])+dist[x];}
bool same(ll x,ll y){return find(x)==find(y);}
ll size(ll x){return -par[find(x)];}
ll diff(ll x,ll y){return same(x,y)?depth(x)-depth(y):LINF;}
void unite(ll x,ll y,ll k=0){
k+=depth(y); k-=depth(x); k=-k;
x=find(x); y=find(y);
if(x==y)return;
if(size(x)<size(y)){swap(x,y);k=-k;}
par[x]+=par[y]; par[y]=x; dist[y]=k;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vd x(n),y(n);
vector<tuple<double,ll,ll>> v;
rep(i,n)cin>>x[i]>>y[i];
rep(i,n){
range(j,i+1,n){
v.emplace_back(hypot(y[i]-y[j],x[i]-x[j]),i,j);
}
v.emplace_back(100-y[i],i,n);
v.emplace_back(y[i]+100,i,n+1);
}
sort(all(v));
UnionFind u(n+2);
rep(i,v.size()){
u.unite(get<1>(v[i]),get<2>(v[i]));
if(u.same(n,n+1)){
fcout(7)<<get<0>(v[i])/2<<endl;
return 0;
}
}
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
ll m = max(a,b);
ll n = min(a,b);
if(n == 0) return m;
else return gcd(n, m%n);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll gcd = extgcd(b, a % b, x, y);
ll oldX = x;
x = y;
y = oldX - a / b * y;
return gcd;
}
int main(){
ll t;
cin >> t;
vector<ll> A(t);
for(int i=0; i<t; i++){
ll n,s,k;
cin >> n >> s >> k;
//sにkを足して行ってnの倍数になれば終わり
k=k%n;
ll d = gcd(k,n);
if(d!=1){
if(s%d!=0){
A.at(i) = -1;
continue;
}
else{
k = k/d;
n = n/d;
s = s/d;
}
}
// s + xk = 0(modn)
// kの逆元を求める
// nx + ky = 1
ll x,y;
ll g = extgcd(n,k,x,y);
ll ans = -s*y;
ans %= n;
if(ans<0) ans+=n;
A.at(i) = ans;
}
for(int i=0; i<t; i++){
cout << A.at(i) << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
double k;
double a,b,c,d,s,p;
double f(double x)
{
return -b/k+a;
}
int main()
{
cin>>a>>b>>c>>d;
b=-b;
k=(b-d)/(a-c);
s=f(0);
printf("%.10lf",s);
return 0;
} | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
using namespace std;
int main()
{
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
double t = (((x1 * y2) + (x2 * y1))/(y1 + y2));
cout <<fixed << setprecision(10) <<t << endl;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <string>
#include <math.h>
using namespace std;
int main(){
int x,y,z;
cin>>x>>y>>z;
for(int i=0;;i++){
if(y*z<=x*i){
cout<<i-1<<endl;
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using ll = long long int;
using namespace std;
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL)
using ld = long double;
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define mod 1000000007
#define F first
#define S second
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
//recursions\
#pragma comment(linker, "/stack:200000000")
//loops\
#pragma GCC optimize("unroll-loops")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>//s.order_of_key(val)->(strictly less than val) *s.find_by_order(ind)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
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...);
}
const int N = 1e6 + 5;
int main()
{
sync;
clock_t clk = clock();
int x, y, z;
cin >> x >> y >> z;
int ans = (y * z) / x - ((y * z) % x == 0);
cout << ans;
//cerr << '\n'<<"Time (in s): " << double(clock() - clk) * 1.0 / CLOCKS_PER_SEC << '\n';
}
|
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define case(t) cout << "Case #" << (t) << ": "
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int mod = 998244353;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
const ld eps = 1e-9;
template<class T> void read(T& x) { cin >> x; }
template<class X, class Y> void read(pair<X,Y>& a) { read(a.first), read(a.second); }
template<class T, size_t U> void read(array<T,U>& x) { for (int i = 0; i < U; i++) read(x[i]); }
template<class T> void read(vector<T>& x) { trav(y, x) read(y); }
template<class T, class... O> void read(T& x, O&... y) { read(x), read(y...); }
string to_string(const char& x) { return string(1,x); }
string to_string(const char*& x) { return (string)x; }
string to_string(const string& x) { return x; }
template<class T, class U> string to_string(const pair<T,U>& x) { return to_string(x.first) + " " + to_string(x.second); }
template<class T, size_t U> string to_string(const array<T,U>& x) { string ret = ""; for (int i = 0; i < U; i++) ret += (!i ? "" : " ") + to_string(x[i]); return ret; }
template<class T> string to_string(const vector<T>& x) { string ret = ""; bool f = 0; trav(y, x) ret += (!f ? "" : " ") + to_string(y), f = 1; return ret; }
template<class T> string to_string(const set<T>& x) { string ret = ""; bool f = 0; trav(y, x) ret += (!f ? "" : " ") + to_string(y), f = 1; return ret; }
void print() { cout << endl; }
template<class T> void pr(const T& x) { cout << to_string(x); }
template<class T, class... O> void print(const T& x, const O&... y) { pr(x); if (sizeof...(y)) pr(" "); print(y...); }
int inv[N], ifac[N], fac[N];
inline int add(int x, int y) { return x+y < mod ? x+y : x+y-mod; }
inline int sub(int x, int y) { return x-y >= 0 ? x-y : x-y+mod; }
inline int mul(int x, int y) { return x * 1ll * y % mod; }
template<class T, class... O> inline int add(T x, O... y) { return add(x, add(y...)); }
template<class T, class... O> inline int mul(T x, O... y) { return mul(x, mul(y...)); }
inline int norm(int x) { return x >= 0 ? (x < mod ? x : x-mod) : x+mod; }
inline int pw(int x, int y) {
int r = 1;
for (; y; x = mul(x, x), y /= 2)
if (y & 1)
r = mul(r, x);
return r;
}
inline int inverse(int x) { return pw(x, mod-2); }
inline int ncr(int n, int k) {
if (n < k || k < 0) return 0;
if (n < N) return mul(fac[n], ifac[n-k], ifac[k]);
int r = 1;
for (int i = 1; i <= k; i++)
r = mul(r, n-i+1, inv[i]);
return r;
}
void precomputeInverse(int n) {
inv[1] = ifac[0] = ifac[1] = fac[0] = fac[1] = 1;
for (int i = 2; i < n; i++) {
inv[i] = mod - mul(mod / i, inv[mod % i]);
fac[i] = mul(fac[i-1], i);
ifac[i] = mul(ifac[i-1], inv[i]);
}
}
int dp[2][55][55 * 105];
int v[55];
int main() {
FIO
precomputeInverse(N);
int n; read(n);
vector<int> a(n); read(a);
// int n = 100;
// vector<int> a(n, 100);
int ans = 0;
int s = 0;
for (int i: a) s += i;
if (s & 1) {
print(0);
return 0;
}
s /= 2;
dp[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= min(i, n / 2); j++) {
for (int k = 0; k <= s; k++) {
dp[i & 1][j][k] = dp[(i & 1)^1][j][k];
if (j > 0 && k >= a[i-1])
dp[i & 1][j][k] = add(dp[i & 1][j][k], dp[(i & 1)^1][j - 1][k - a[i-1]]);
}
}
}
for (int i = 1; i <= n / 2; i++)
ans = add(ans, mul(1 + (2 * i != n), dp[n & 1][i][s], fac[i], fac[n-i]));
print(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = (int)1e9+7;
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
vector<int>arr(n+1);
for(int i = 1; i<=n; i++){
cin >> arr[i];
}
vector<vector<int>>dp(n+1,vector<int>(n+1));// current ans as we iterate through
dp[1][0] = 1;
// dp[i][j] is ans of currently being in ith subarray with sum of j under modulus of i
vector<int>inc(n+1);//actual index of j modulus i is inc[i]+j; so index j holds the value of index j-inc[i]
//each iteration you either slap the current number into a new subarray, or you continue current subarray
for(int i = 2; i<=n; i++){
for(int j = n-1; j>=1; j--){
int realind = (j+0*arr[i]-inc[j])%j;realind+=j; realind%=j;
int realind2 = (j+1-0*arr[i]-inc[j+1])%(j+1); realind2+=(j+1); realind2%=(j+1);
dp[j+1][realind2]+=dp[j][realind];dp[j+1][realind2]%=mod;
}
for(int j = n; j>=1; j--){
inc[j]+=arr[i]; inc[j]%=j;
}
}
int ans = 0;
for(int j = 1; j<=n; j++){
for(int k = 0; k<j; k++){
int idx = (j+k-inc[j])%j;
if(k==0)ans+=dp[j][idx];
ans%=mod;
//cout << dp[j][idx] << " ";
}
//cout << "\n";
}
cout << ans << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
const long long MOD=1e9+7;
int main(){
int n;
cin>>n;
n*=108;
n/=100;
if(n<206)cout<<"Yay!"<<endl;
else if(n==206)cout<<"so-so"<<endl;
else cout<<":("<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vbl;
typedef vector<vector<bool>> vvbl;
void INX(){}
template<typename Head, typename... Tail>
void INX(Head&& head, Tail&&... tail)
{
cin >> head;
INX(forward<Tail>(tail)...);
}
void OUTX(){}
template<typename Head, typename... Tail>
void OUTX(Head&& head, Tail&&... tail)
{
cout << head << endl;
OUTX(forward<Tail>(tail)...);
}
#define ADD emplace_back
#define MP make_pair
#define VVEC(type) vector<vector<type>>
//#define MOD 1000000007 // 10^9 + 7
//setprecision(10)
ll EuclideanAlgorithm(ll A, ll B)
{
if(A > B) swap(A, B);
ll r = 0;
while(true)
{
r = B % A;
if(r == 0)
{
return A; //このときのAが最大公約数
}
else
{
B = A;
A = r;
}
}
}
ll modinv(ll a, ll m)
{
ll b = m, u = 1, v = 0;
while(b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if(u < 0) u += m;
return u;
}
int main()
{
ll T;
INX(T);
for (ll query = 0; query < T; query++)
{
ll N, S, K;
INX(N, S, K);
// S + Kx ≡ 0 mod N
// Kx ≡ N - S mod N
// A = K, B = N - S, M = N
// Ax ≡ B mod M
// d = gcd(A, B, M)
// A = A / d, B = B / d, M = M / d
// if gcd(A, M) != 1 then 解なし
// else (if gcd(A, M) == 1) then x = A^(-1) * B
ll A = K;
ll B = N - S;
ll M = N;
ll d = EuclideanAlgorithm(EuclideanAlgorithm(A, B), M);
A /= d;
B /= d;
M /= d;
if(EuclideanAlgorithm(A, M) != 1)
{
OUTX(-1);
}
else
{
//Aの逆元とそこから答えを計算
ll result = modinv(A, M) * B;
result %= M;
OUTX(result);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,N;
string b;
cin>>N;
vector<pair<int, string>> p(N);
for (int i = 0; i < N; i++) {
cin>>b>>a;
p.at(i)=make_pair(a,b);
}
sort(p.begin(), p.end());
// tie(a,b) = data;
cout<<p.at(N-2).second<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
int a,b;
cin>>a>>b;
cout<<2*a+100-b<<endl;
} |
#line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T, class U> inline void chmax(T &a, const U &b) { if ((a) < (b)) (a) = (b); }
template <class T, class U> inline void chmin(T &a, const U &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }
template <class T> T cdiv(T a, T b){ assert(a >= 0 && b > 0); return (a+b-1)/b; }
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)
typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }
#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif
#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
int solve() {
ll n;cin>>n;
dump(n);
ll mul = 3;
for(ll a = 1; mul < n; a++){
ll rem = n - mul;
dump(a, rem);
int b = 0;
while (rem % 5 == 0){
rem /= 5;
b++;
}
if (rem == 1 && b >= 1){
cout << a << " " << b << endl;
return 0;
}
mul *= 3;
}
cout << -1 << endl;
return 0;
}
int main(){/*{{{*/
solve();
#if defined(PCM) || defined(LOCAL)
check_input();
#endif
return 0;
}/*}}}*/
| #include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) a ; i >= b ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int; // watch out for overflows in your code
using pii = pair<int,int>;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void debug() { cout << "\n"; };
template <typename T, typename... Targs>
void debug(T t, Targs... args) {
cout << t << " ";
debug(args...);
}
template <typename T1, typename T2>
inline ostream& operator << (ostream& os, const pair<T1,T2>& p) {
return os << "(" << p.F << ", " << p.S << ")";
}
template <typename T>
inline ostream& operator << (ostream& os, const vec<T>& v) {
for(auto& t : v) {
os << t << " ";
}
return os;
}
template <typename T>
inline ostream& operator << (ostream& os, const vec<vec<T>>& m) {
for(auto& v : m) {
for(auto& t : v) {
os << t << " ";
}
os << "\n";
}
return os;
}
template <typename T>
inline ostream& operator << (ostream& os, const set<T>& v) {
for(auto& t : v) {
os << t << " ";
}
return os;
}
template <typename K, typename V>
inline ostream& operator << (ostream& os, const map<K,V>& m) {
for(auto& p : m) {
os << p.F << " -> " << p.S << "\n";
}
return os;
}
const ll INF = 9 * 1e18;
int N;
vec<ll> lo, hi;
ll dist(ll st, ll fn, ll x) {
return abs(x-st) + abs(st-fn);
}
vec<vec<ll>> dp;
void compute_dp() {
dp.assign(N+1, vec<ll>(2,0));
ffor(c, 1, N) {
if(lo[c] == lo[c-1] && hi[c] == hi[c-1]) {
dp[c][0] = dp[c-1][0];
dp[c][1] = dp[c-1][1];
}
else {
dp[c][0] = min(dp[c-1][0] + dist(hi[c], lo[c], lo[c-1]), dp[c-1][1] + dist(hi[c], lo[c], hi[c-1]));
dp[c][1] = min(dp[c-1][0] + dist(lo[c], hi[c], lo[c-1]), dp[c-1][1] + dist(lo[c], hi[c], hi[c-1]));
}
//debug("c=", c, "dp(c,0)=", dp[c][0], "dp(c,1)=", dp[c][1]);
}
}
////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
lo.assign(N+1, INF);
hi.assign(N+1, -INF);
lo[0] = hi[0] = 0;
ffor(i, 1, N) {
ll x; int c;
cin >> x >> c;
lo[c] = min(lo[c], x);
hi[c] = max(hi[c], x);
}
ffor(c, 1, N) {
if(lo[c] == INF) lo[c] = lo[c-1];
if(hi[c] == -INF) hi[c] = hi[c-1];
}
//debug("lo=", lo);
//debug("hi=", hi);
compute_dp();
cout << min(dp[N][0] + abs(lo[N]), dp[N][1] + abs(hi[N])) << "\n";
}
|
/*
* 答え見た
* https://atcoder.jp/contests/keyence2021/submissions/19465975
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x) cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v) rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v) cerr << "L" << __LINE__ << ": " << #v << " = { "; rep(i, v.size()) cerr << v[i] << (i + 1 == v.size() ? "" : ", "); cerr << " }" << endl;
typedef long long ll; /* 10^18 くらいまでいける */
int mod = 998244353;
char grid[5005][5005];
ll dp[5005][5005];
// (x^y) % mod
long long modpow(long long x, long long y){
if (y == 0) return 1;
if (y % 2) return x * modpow(x, y - 1) % mod;
long long res = modpow(x, y / 2);
return res * res % mod;
}
int main(){
ll h, w, k;
cin >> h >> w >> k;
rep(i, k){
ll x, y;
char c;
cin >> x >> y >> c;
x--; y--;
grid[x][y] = c;
}
// 開始マスの初期値は 3^(h*w-k)
dp[0][0] = modpow(3, h*w-k);
ll div_three = modpow(3, mod-2); // 1/3 を表す
rep(i, h){
rep(j, w){
// 空白マスの場合
// 2/3 を掛ける
if (!grid[i][j]){
ll plus = (dp[i][j] * div_three) % mod;
if (j + 1 != w)
{
dp[i][j + 1] += plus;
dp[i][j + 1] %= mod;
}
if (i + 1 != h)
{
dp[i + 1][j] += plus;
dp[i + 1][j] %= mod;
}
if (j + 1 != w)
{
dp[i][j + 1] += plus;
dp[i][j + 1] %= mod;
}
if (i + 1 != h)
{
dp[i + 1][j] += plus;
dp[i + 1][j] %= mod;
}
}
else
{
if (grid[i][j] == 'R')
{
if (j + 1 != w)
{
dp[i][j + 1] += dp[i][j];
dp[i][j + 1] %= mod;
}
}
if (grid[i][j] == 'D')
{
if (i + 1 != h)
{
dp[i + 1][j] += dp[i][j];
dp[i + 1][j] %= mod;
}
}
if (grid[i][j] == 'X')
{
if (j + 1 != w)
{
dp[i][j + 1] += dp[i][j];
dp[i][j + 1] %= mod;
}
if (i + 1 != h)
{
dp[i + 1][j] += dp[i][j];
dp[i + 1][j] %= mod;
}
}
}
}
}
cout << dp[h - 1][w - 1] << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 5005, MOD = 998244353;
int m, n, k, f[MAX][MAX];
char a[MAX][MAX];
int mul(int x, int k) {
if (k == 0)
return 1;
int tmp = mul(x, k / 2);
if (k % 2 == 0)
return tmp * tmp % MOD;
return tmp * tmp % MOD * x % MOD;
}
int32_t main() {
#ifdef ACM
freopen("input", "r", stdin);
#endif
cin >> m >> n >> k;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++)
a[i][j] = '*';
int x, y;
char c;
for (int i = 0; i < k; i++) {
cin >> x >> y >> c;
a[x][y] = c;
}
f[1][1] = 1;
int rev3 = mul(3, MOD - 2);
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++) {
if (i + j == 2)
continue;
if (i > 1) {
if (a[i - 1][j] == 'D' || a[i - 1][j] == 'X')
f[i][j] = (f[i][j] + f[i - 1][j]) % MOD;
if (a[i - 1][j] == '*')
f[i][j] = (f[i][j] + f[i - 1][j] * 2 % MOD * rev3) % MOD;
}
if (j > 1) {
if (a[i][j - 1] == 'R' || a[i][j - 1] == 'X')
f[i][j] = (f[i][j] + f[i][j - 1]) % MOD;
if (a[i][j - 1] == '*')
f[i][j] = (f[i][j] + f[i][j - 1] * 2 % MOD * rev3) % MOD;
}
}
cout << f[m][n] * mul(3, m * n - k) % MOD;
} |
// SMOKE SHISHA PLAY FIFA //
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define pll pair<ll,ll>
#define MP make_pair
#define ff first
#define ss second
#define PB push_back
#define mod 1000000007
#define lp(i,start,end) for(ll i=start;i<=end;i++)
#define deb1(a) cout<<#a<<" = "<<(a)<<endl;
#define deb2(a,b) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define deb3(a,b,c) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
ll modu(ll a, ll b)
{
ll ans =1;
while(b>0)
{
if(b&1)
ans = (ans*a)%mod;
b/=2;
a = (a*a)%mod;
}
return ans;
}
int main()
{
fastio
ll n,q;
cin>>n>>q;
vector<pair<ll,ll>>fi;
fi.PB({0,0});
lp(i,0,n-1){
ll x;
cin>>x;
fi.PB({x,0});
}
sort(fi.begin(),fi.end());
lp(i,1,n){
fi[i].ss=fi[i-1].ss+fi[i].ff-fi[i-1].ff-1;
}
while(q--){
ll y;
cin>>y;
ll l=0,r=n,m;
while(l<r){
m=(l+r)/2;
if(fi[m].ss<y)
l=m+1;
else
r=m;
}
//cout<<l<<" ";
if(fi[l].ss>=y)
l--;
cout<<fi[l].ff+y-fi[l].ss<<endl;
}
return 0;
}
| #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define MAXN 110000
#define MOD
using namespace std;
int T,n,m;
LL a[MAXN];
int sum[MAXN];
LL work(LL x)
{
LL L=1,R=2e18;
while(L!=R)
{
LL mid=(L+R)/2;
int loc = upper_bound(a+1,a+n+1,mid) - (a+1);
if(mid-sum[loc] >= x)
R=mid;
else
L=mid+1;
}
return L;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
{
if(i==1||a[i]!=a[i-1])
sum[i]++;
sum[i]+=sum[i-1];
}
for(int i=1;i<=m;i++)
{
LL x;
scanf("%lld",&x);
printf("%lld\n",work(x));
}
return 0;
} |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define S second
#define F first
using namespace std;
const int maxn=2e5+5;
struct node{
int x,id;
}a[maxn];
bool cmp(node a,node b){
return a.x<b.x;
}
vector<pii> ans;
int n,b[maxn],p[maxn],Id[maxn],cnt;
main(){
ios::sync_with_stdio(0),cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i].x,a[i].id=i;
for(int i=1;i<=n;i++)cin>>b[i];
for(int i=1;i<=n;i++){
cin>>p[i],Id[p[i]]=i;
if(b[p[i]]>=a[i].x&&p[i]!=i){
cout<<-1;
return 0;
}
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
if(p[a[i].id]!=a[i].id){
int now=a[i].id;
ans.push_back({now,Id[now]});
p[Id[now]]=p[now];
Id[p[now]]=Id[now];
}
}
cout<<ans.size()<<'\n';
for(auto i:ans)
cout<<i.F<<" "<<i.S<<'\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).begin(), (x).end()
#define INF 1000000000000 //10^12:∞
#define MOD 10000000 //10^9+7:合同式の法
//sort(all(a)); ソート
//sort(all(a),greater<int>()); 逆順ソート
int main() {
long long int n,m;
cin >>n>>m;
if(n==1&&m==0){
cout<<1<<" "<<2<<endl;
return 0;
}
if(n==m||n==-m||n-1==m||n-1==-m){
cout<<-1<<endl;
return 0;
}
if(m==0){
rep(i,1,n+1){
cout<<i<<" "<<n*2-i+1<<endl;
}
}
if(m>0){
cout<<1<<" "<<MOD<<endl;
rep(i,2,m+2){
cout<<i*2<<" "<<i*2+1<<endl;
}
cout<<MOD-1<<" "<<MOD+1<<endl;
rep(i,0,n-m-2){
cout<<i*2+MOD+2<<" "<<i*2+1+MOD+2<<endl;
}
}
if(m<0){
cout<<-1<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; }
template <typename X, typename Y> istream& operator>>(istream& is, pair<X, Y>& p) { return is >> p.first >> p.second; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<int> a(k), max_consec(k);
cin >> a;
if(k > 0) {
max_consec[0] = 1;
}
for(int i = 1; i < k; i++) {
max_consec[i] = (a[i] == a[i - 1] + 1 ? max_consec[i - 1] : 0) + 1;
}
if(k > 0 and *max_element(max_consec.begin(), max_consec.end()) >= m) {
cout << -1 << endl;
} else {
vector<pair<double, double>> E(n + m + 1);
pair<double, double> psum = {0, 0};
for(int i = n - 1; i >= 0; i--) {
psum.first -= E[i + m + 1].first / m;
psum.second -= E[i + m + 1].second / m;
if(find(a.begin(), a.end(), i) != a.end()) {
E[i] = {1.0, 0};
} else {
E[i] = {psum.first, psum.second + 1};
}
psum.first += E[i].first / m;
psum.second += E[i].second / m;
}
cout << fixed << setprecision(3) << E[0].second / (1 - E[0].first) << endl;
}
return 0;
}
| #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, M, K;
cin >> N >> M >> K;
const auto unavailable{[&N, &M, &K]{
vector<unsigned long> unavailable(N + 1);
vector<unsigned long> ban;
for(unsigned long i{0}, a; i < K; ++i){
cin >> a;
unavailable[a] = 1;
ban.push_back(a);
}
sort(begin(ban), end(ban));
for(unsigned long i{M - 1}; i < K; ++i)if(ban[i - M + 1] + M - 1 == ban[i])exit(puts("-1") & 0);
return unavailable;
}()};
const auto iteration{[&N, &M, &unavailable](long double x) -> long double {
vector<long double> dp(N + 1);
long double now{0}, c{0}, tmp{0}, y{0};
for(unsigned long i{N}; i--; ){
dp[i] = unavailable[i] ? x : now / M + 1;
now += dp[i];
now -= dp[min(N, i + M)];
}
return dp[0];
}};
constexpr long double eps{1e-10};
cout << setprecision(15) << [&iteration]{
auto tmp{[&iteration]{
auto [l, r]{[&iteration]{
if(2 > iteration(2))return make_pair(1.0L, 2.0L);
long double r{2};
while(r * r < iteration(r * r))r *= r;
return make_pair(r, r * r);
}()};
for(unsigned long i{0}; i < 100; ++i){
long double m{sqrt(l) * sqrt(r)};
(m < iteration(m) ? l : r) = m;
}
return l;
}()};
for(unsigned long i{0}; i < 100; ++i)tmp = iteration(tmp);
return tmp;
}() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl "\n"
ll mod=1000000007;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//ll t;cin>>t;while(t--)
{
ll a,b,c,d,i,j,k,l,m,n,sum=0,temp=0,f=0,cnt=0;
cin>>a>>b>>c>>d;
k=(a*d)-(b*c);
cout<<k<<endl;
}
}
| #include <vector>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <iostream>
#include <random>
#include <queue>
#include <algorithm>
#include <climits>
#include <map>
#include <set>
#include <stack>
#include <sstream>
#include <cstring>
#include <bitset>
#include <deque>
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<ld> vd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
typedef vector<cd> vcd;
typedef vector<string> vs;
#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; i > a; i--)
#define F0Rd(i, a) for (int i = a; i > -1; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define pob pop_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
#define que queue
#define pa pair
#define ex(m, i) m.find(i) != m.end()
#define nex(m, i) m.find(i) == m.end()
typedef vector<int> vi1;
typedef vector<vector<int>> vi2;
typedef vector<vector<vector<int>>> vi3;
typedef vector<vector<vector<vector<int>>>> vi4;
typedef vector<vector<vector<vector<vector<int>>>>> vi5;
typedef vector<ll> vl1;
typedef vector<vector<ll>> vl2;
typedef vector<vector<vector<ll>>> vl3;
typedef vector<vector<vector<vector<ll>>>> vl4;
typedef vector<vector<vector<vector<vector<ll>>>>> vl5;
#define uniq(x) x.resize(unique(all(x)) - x.begin())
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int inf = 1e9;
const int MX = 100001; //check the limits, dummy
const double epsilon = 1e-12;
const int ds[4][2] = {
{-1, 0},
{1, 0},
{0, -1},
{0, 1}};
const int dds[8][2] = {
{-1, 0},
{1, 0},
{0, -1},
{0, 1},
{-1, 1},
{-1, -1},
{1, -1},
{1, 1},
};
const int ks[8][2] = {
{2, 1},
{2, -1},
{-2, 1},
{-2, -1},
{1, 2},
{1, -2},
{-1, 2},
{-1, -2}};
#define LOCAL
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
{
sim > struct rge
{
c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug
{
#ifdef LOCAL
~debug()
{
cerr << endl;
}
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d)
{
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &)
{
ris;
}
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }
/*
*/
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int a, b, c ,d; cin >> a >> b >> c >> d;
printf("%d",a*d-b*c);
return 0;
} |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_REP(__VA_ARGS__, REP3, REP2) (__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2) (__VA_ARGS__)
#define IN(type, n) type n; cin >> n
#define INALL(v) for (auto &e : v) { cin >> e; }
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
#pragma endregion
ll s2ll(string num, ll base = 10000) {
ll ans = 0;
size_t dot_idx = 0;
bool is_negative = false;
for (size_t idx = 0; idx < num.size(); ++idx) {
if (num.at(idx) == '.') {
dot_idx = idx;
break;
} else if (num.at(idx) == '-') {
is_negative = true;
} else {
ans *= 10;
ans += num.at(idx) - '0';
}
}
ans *= base;
if (dot_idx != 0) {
for (int i = 1; base > 1; ++i) {
if (dot_idx + i >= num.size()) break;
base /= 10;
ans += (num.at(dot_idx + i) - '0') * base;
}
}
if (is_negative) ans *= -1;
return ans;
}
ll floor_base(ll num, ll base = 10000) {
return (num / base) * base;
}
int main() {
IN(string, X);
ll xl = abs(s2ll(X));
IN(string, Y);
ll yl = abs(s2ll(Y));
IN(string, R);
ll rl = s2ll(R);
if (xl - rl <= 0) xl += floor_base(rl - xl + 10000);
if (yl - rl <= 0) yl += floor_base(rl - yl + 10000);
ll ans = 0;
for (ll pos_x = floor_base(xl + rl); pos_x >= xl - rl; pos_x -= 10000) {
ll len_x = pos_x - xl;
ll len_y;
if (len_x == 0) len_y = rl;
else len_y = (ll)sqrtl(rl * rl - len_x * len_x);
ans += (yl + len_y) / 10000 - (yl - len_y - 1) / 10000;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 2e5 + 5;
ll h[N], w;
ll l[N], r[N];
int n, m;
ll ans = LLONG_MAX;
set<int> st;
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
ll sum = 0;
for (int i = 0; i < n; i += 2) {
l[i] = sum;
sum += abs(h[i + 1] - h[i]);
}
sum = 0;
for (int i = n - 1; i >= 0; i -= 2) {
r[i] = sum;
sum += abs(h[i] - h[i - 1]);
}
for (int i = 0; i < m; ++i) {
cin >> w;
st.insert(w);
}
st.insert(INT_MAX);
st.insert(INT_MIN);
for (int i = 0; i < n; i += 2) {
auto it = st.lower_bound(h[i]);
ll mi = abs(*it - h[i]);
--it;
mi = min(mi, abs(*it - h[i]));
ll res = l[i] + r[i] + mi;
ans = min(ans, res);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
typedef pair<ll, ll> P;
int main()
{
ll N, K;
cin >> N >> K;
vector<P> AB(N);
rep(i, N) {
ll a, b;
cin >> a >> b;
AB[i] = {a, b};
}
sort(all(AB));
ll ans = 0;
ll place = 0;
rep(i, N) {
ll diff = place + K;
if (AB[i].first <= diff) {
K -= (AB[i].first - place);
place = AB[i].first;
K += AB[i].second;
}
else {
break;
}
}
cout << place + K << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,w;cin>>n>>w;
long long a[200001]={},i,j,x,y,z;
for(i=0;i<n;i++)
{
cin>>x>>y>>z;
a[x]+=z;
a[y]-=z;
}
for(i=1;i<=200000;i++)
{
a[i]+=a[i-1];
}
for(i=0;i<=200000;i++)
{
if(a[i]>w) break;
}
if(i==200001)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
}
|
using namespace std;
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 105
int n;
char s[N];
int e[N][N];
int main(){
scanf("%d",&n);
for (int i=1;i<=n;++i){
scanf("%s",s+1);
for (int j=1;j<=n;++j)
e[i][j]=s[j]-'0';
}
for (int i=1;i<=n;++i)
e[i][i]=1;
for (int k=1;k<=n;++k)
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
e[i][j]|=(e[i][k]&&e[k][j]);
double ans=0;
for (int i=1;i<=n;++i){
int cnt=0;
for (int j=1;j<=n;++j)
if (e[j][i])
cnt++;
ans+=1.0/cnt;
}
printf("%.10lf\n",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define finf -0x3f3f3f3f
#define scNO printf("NO\n");
#define scNo printf("No\n");
#define scno printf("no\n");
#define sc0 printf("0\n");
#define sc1 printf("1\n");
#define scf1 printf("-1\n");
#define scz1 printf("1\n");
#define scYES printf("YES\n");
#define scyes printf("yes\n");
#define scYes printf("Yes\n");
#define scyes printf("yes\n");
#define ll long long
#define bug(a) printf("%d \n ",a);
#define bugg(a,b) printf("%d * %d \n",a,b);
#define buggg(a,b,c) printf("%d * %d * %d \n",a,b,c);
#define bugggg(a,b,c,d) printf("%d * %d * %d* %d\n",a,b,c,d);
const long N = 200000;
long prime[N] = {0},num_prime = 0;
int isNotPrime[N] = {1, 1};
int read() //read quickly
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*f;
}
void sushushai()
{
for(long i = 2 ; i < N ; i ++)
{
if(! isNotPrime[i])
prime[num_prime ++]=i;
for(long j = 0 ; j < num_prime && i * prime[j] < N ; j ++)
{
isNotPrime[i * prime[j]] = 1;
if( !(i % prime[j] ) )
break;
}
}
}
void cheng(int *a,int c) //High precision multiplication
{
int jw=0;
for(int i=1;i<=1000;i++)
{
a[i]=a[i]*c+jw;
jw=a[i]/10;
a[i]%=10;
}
}
int cl(int x,int n) //High precision Division
{
int s=0,i=0,w[101];
while(x>=1)
{
w[++i]=x%n;
x=x/n;
}
for(int j=i;j>=1;j--)
s=s*10+w[j];
return s;
}
void pplus(int *a,int *c) //High precision addition
{
int jw=0;
for(int i=1;i<=1000;i++)
{
c[i]+=a[i]+jw;
jw=c[i]/10;
c[i]%=10;
}
}
long long A(int n,int m) //(n)*(n-1)*(n-2)*....(n-m)
{
long long ret=1;
for(int i=0;i<m;++i)
{
ret*=(n-i);
// ret%=mod;
}
return ret;
}
int c( int m,int n ) //c(5,1)==c(5,4)
{
int a = 1,b = 1;
n = min(n,m-n);
if( n == 0 )
return 1;
for( int i = m ; i >=m-n+1 ; i-- )
a = a*i;
for( int i = 1 ; i <= n ; i++ )
b = b*i;
return a/b;
}
long long quickpow(long long a,long long b){
long long ret=1;
while(b){
if(b&1){
ret=ret*a;
//%modd;
}
a=a*a;
//%modd;
b>>=1;
}
return ret;
}
const int MAXN=200005;
const long long mod=1e9+7;
int main()
{
string s1;
cin>>s1;
int d1=s1.length();
string s2;
int flag=0;
for(int i=0;i<=d1+1;i++){
string s3=s2;
s3+=s1;
string s4=s3;
reverse(s4.begin(),s4.end());
if(s4==s3){
scYes;
flag=1;
break;
}
s2+='0';
}
if(flag==0){
scNo;
}
}
|
#include <bits/stdc++.h>
using namespace std;
// BEGIN LIB
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<vector<ll>> matrix;
typedef pair<ll, ll> pll;
// END LIB
void dfs(unordered_map<int, vi> &adj, vector<bool> &visited, int root, int &reached){
if(visited[root]) return;
reached++;
visited[root]=true;
for(auto next:adj[root])
dfs(adj, visited, next, reached);
return;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int N, M, u, v, ans=0, INF=1000000;
cin >> N >> M;
vector<bool> visited(N);
unordered_map<int, vi> adj;
rep(i,0,M){
cin >> u >> v;
adj[u-1].push_back(v-1);
}
rep(i,0,N){
int reached=0;
rep(j,0,N) visited[j]=false;
dfs(adj, visited, i, reached);
ans+=reached;
}
cout <<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void debug(vector<T> item) {
for (auto& i : item) {
cout << i << " ";
}
cout << endl;
}
int64_t dfs(int n, vector<vector<int>>& neb, vector<bool>& vis) {
if (vis[n]) return 0;
vis[n] = true;
int64_t ret = 1;
for (int nxt : neb[n]) {
if (!vis[nxt]) {
ret += dfs(nxt, neb, vis);
}
}
return ret;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> adj(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
}
int64_t ret = 0;
for (int i = 0; i < N; ++i) {
vector<bool> vis(N, false);
ret += dfs(i, adj, vis);
}
cout << ret << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
#include <cassert>
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define REPE(i, n) for (int (i)=0; (i) <= (n); (i)++)
#define CONTAINS_MAP(m, a) ((m).find((a)) != m.end())
#define CONTAINS_SET(m, a) ((m).find((a)) != m.end())
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; exit(0); }
void Yes() { cout << "Yes" << endl; exit(0); }
void No() { cout << "No" << endl; exit(0); }
int N, M;
int X[101];
vector<int>Y[20];
vector<int>Z[20];
int _dp[1000000];
int bit_count(ull v)
{
ull count = (v & 0x5555555555555555ULL) + ((v >> 1ULL) & 0x5555555555555555ULL);
count = (count & 0x3333333333333333ULL) + ((count >> 2ULL) & 0x3333333333333333ULL);
count = (count & 0x0f0f0f0f0f0f0f0fULL) + ((count >> 4ULL) & 0x0f0f0f0f0f0f0f0fULL);
count = (count & 0x00ff00ff00ff00ffULL) + ((count >> 8ULL) & 0x00ff00ff00ff00ffULL);
count = (count & 0x0000ffff0000ffffULL) + ((count >> 16ULL) & 0x0000ffff0000ffffULL);
return (int)((count & 0x00000000ffffffffULL) + ((count >> 32ULL) & 0x00000000ffffffffULL));
}
signed main()
{
cin >> N >> M;
//REP(i, M) cin >> X[i] >> Y[i] >> Z[i];
REP(i, M)
{
int x, y, z;
cin >> x >> y >> z;
Y[x].push_back(y);
Z[x].push_back(z);
}
int dp_max = (1LL << N);
_dp[0] = 1;
for (int i = 0; i < dp_max; i++)
{
int prev = _dp[i];
for (int j = 0; j < N; j++)
{
int cur = (1LL << j);
if ((i & cur) == 0)
{
int bitcnt = bit_count(i | cur);
if (Y[bitcnt].size() == 0)
{
_dp[i | cur] += _dp[i];
}
else
{
bool is_valid = true;
for (int k = 0; k < Y[bitcnt].size(); k++)
{
int y = Y[bitcnt][k];
int z = Z[bitcnt][k];
int mask = (1LL << y) - 1;
int b = ((i | cur) & mask);
int cnt = bit_count(b);
if (cnt > z)
{
is_valid = false;
}
}
if (is_valid)
{
_dp[i | cur] += _dp[i];
}
}
}
else
{
}
}
}
cout << _dp[(1LL << N) - 1] << endl;
}
| // Created at 2021/02/07 22:38
// {TODO}WA, {TODO}min, {TODO}diff
// goal: {TODO}min
#include <bits/stdc++.h>
//#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (lint i = 0, i##_len = n; i < i##_len; i++)
#define rep2(i, n) for (lint i = 1, i##_len = n; i <= i##_len; i++)
#define rep3(i, s, e) for (lint i = s, i##_len = e; i < i##_len; i++)
#define all(i) (i).begin(), (i).end()
#define print(s) cout << s << '\n';
#define print2(s1, s2) cout << s1 << ' ' << s2 << '\n';
#define mk_p make_pair
using namespace std;
//using namespace atcoder;
using lint = long long;
using pi = pair<int, int>;
using pl = pair<lint, lint>;
using vi = vector<int>;
using vl = vector<lint>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using qi = queue<int>;
using ql = queue<lint>;
constexpr int INF = 1 << 30;
constexpr lint INFl = 1LL << 62;
template<class T, class U>
istream &operator>>(istream &is, pair<T, U> &pair) {
is >> pair.first >> pair.second;
return is;
}
template<class T, class U>
ostream &operator<<(ostream &os, pair <T, U> &pair) {
os << pair.first << " " << pair.second;
return os;
}
template<class T>
istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec) is >> v;
return is;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
os << '[';
for (auto v : vec) os << v << ',';
os << ']';
return os;
}
template<class T>
inline bool chmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(15);
/*----------------------------------------------------*/
int n, m; cin >> n >> m;
vvi g(n);
rep(i, m) {
int ai, bi; cin >> ai >> bi;
ai--; bi--;
g.at(ai).push_back(bi);
g.at(bi).push_back(ai);
}
int k; cin >> k;
vi c(k); cin >> c;
for (int &ci : c) ci--;
vvi dist(k, vi(k, INF));
rep(i, k) {
int start = c.at(i);
vi disti(n, INF);
qi q;
disti.at(start) = 0;
q.push(start);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int next : g.at(now)) {
if (chmin(disti.at(next), disti.at(now) + 1)) {
q.push(next);
}
}
}
rep(j, k) {
dist.at(i).at(j) = disti.at(c.at(j));
}
}
// print(g)
// print(dist)
vvi dp(1 << k, vi(k, INF));
rep(start, k) {
dp.at(1 << start).at(start) = 1;
}
rep(went, 1 << k) rep(now, k) {
rep(next, k) {
if (dist.at(now).at(next) != INF) {
chmin(dp.at(went|1 << next).at(next), dp.at(went).at(now) + dist.at(now).at(next));
}
}
}
int ans = INF;
rep(last, k) {
chmin(ans, dp.back().at(last));
}
if (ans == INF) print(-1)
else print(ans)
}
// break? continue?
// 時間? メモリ?
// map->bucket?
// あまり->非負か確認
// set? multiset?
// オーバーフロー確認(最大値を求める)
// 入力確認
// 型確認
// ループ回数確認(TLE)
// 小数の計算は避けよう(割り算)(0割りだめ！絶対！)
// Python を使っては?
// 擬似コードを作っては?
// 汚くてもok
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 10000000000000007;
const long long mod = 1000000007;
typedef long long ll;
typedef pair<int, int> P;
template<class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<int> table(2500);
vector<vector<int>> tile(2500);
vector<vector<bool>> seen(50,vector<bool>(50,0));
vector<vector<int>>point(50,vector<int>(50));
int now_x, now_y;
int si, sj;
// ll sum = 0;
vector<int> dx = {1, 0, -1, 0};
vector<int> dy = {0, 1, 0, -1};
vector<int>ans;
void solve(int now_x, int now_y) {
int cnt = 0;
while (1) {
cnt++;
if (cnt%20==0) {
si = rand()%50;
sj = rand()%50;
}
int num = table[now_x+now_y*50];
for (int j = 0; j < tile[num].size(); j++) {
int k = tile[num][j];
seen[k/50][k%50] = 1;
}
int nx,ny,index=-1;
ll ma = -1;
for (int i = 0; i < 4; i++) {
nx = now_x + dx[i];
ny = now_y + dy[i];
if (nx<0||nx>=50||ny<0||ny>=50) continue;
if (seen[ny][nx]==1) continue;
ll score = 0;
if (i==0) score += 50-si;
else if (i==1) score += 50-sj;
else if (i==2) score += si;
else if (i==3) score += sj;
score += point[ny][nx] / 10;
if (chmax(ma, score)) {
index = i;
}
}
if (index==-1) break;
now_x = now_x + dx[index];
now_y = now_y + dy[index];
ans.push_back(index);
}
return;
}
int main()
{
cin >> sj >> si;
now_x = si;
now_y = sj;
for (int i = 0; i < 2500; i++) {
int num;
cin >> num;
table[i] = num;
tile[num].push_back(i);
}
for (int i = 0; i < 2500; i++) {
int x = i%50;
int y = i/50;
cin >> point[y][x];
}
solve(now_x, now_y);
// 出力
for (int i = 0; i < ans.size(); i++) {
if (ans[i]==0) cout << 'R';
else if (ans[i]==1) cout << 'D';
else if (ans[i]==2) cout << 'L';
else if (ans[i]==3) cout << 'U';
}
cout << endl;
}
| #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define dump(x) cout << #x << " = " << (x) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define COUT(x) cout<<(x)<<endl
#define SCOUT(x) cout<<(x)<<" "
#define VECCOUT(x) for(auto&youso_: (x) )cout<<right<<setw(10)<<youso_<<" ";cout<<endl
#define ENDL cout<<endl
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) long long __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define mp make_pair
#define PQ priority_queue<long long>
#define PQG priority_queue<long long,V,greater<long long>>
typedef long long ll;
typedef vector<long long> vl;
typedef vector<long long> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<vc> vvc;
typedef pair<long long, long long> pll;
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
template<class T>
void mod(T &x) {
x %= MOD;
x += MOD;
x %= MOD;
}
ll GCD(ll a, ll b) {
if(b == 0) return a;
else return GCD(b, a%b);
}
struct COMB{
vl fact, fact_inv, inv;
void init_nCk(long long SIZE) {
fact.resize(SIZE + 5);
fact_inv.resize(SIZE + 5);
inv.resize(SIZE + 5);
fact.at(0) = fact.at(1) = fact_inv.at(0) = fact_inv.at(1) = inv.at(1) = 1;
for(long long i = 2; i < SIZE + 5; i++) {
fact.at(i) = fact.at(i - 1)*i%MOD;
inv.at(i) = MOD - inv.at(MOD%i)*(MOD/i)%MOD;
fact_inv.at(i) = fact_inv.at(i - 1)*inv.at(i)%MOD;
}
}
long long nCk (long long n, long long k) {
assert(!(n < k));
assert(!(n < 0 || k < 0));
return fact.at(n)*(fact_inv.at(k)*fact_inv.at(n - k)%MOD)%MOD;
}
};
ll extGCD(ll a, ll b, ll &x, ll &y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a/b*x;
return d;
}
void Main() {
ll ans = 0;
LCIN(N, M, K);
COMB c;
c.init_nCk(3000000);
ans = c.nCk(N + M, M);
if(N > M + K) {
cout << 0 << endl;
return;
}
if(M + N >= M + K + 1) ans -= c.nCk(M + N, M + K + 1);
cout << (ans%MOD + MOD)%MOD << endl;
return;
if(N == 0) {
cout << 1 << endl;
return;
}
if(M == 0) {
return;
}
for(ll i = 0; i <= N + M; i++) {
if(K <= i && i < 2*N - K) {
if((i - K)%2 == 0) {
ll n = (i + K)/2;
ll m = (i - K)/2;
ans -= c.nCk(N + M - n - m - 1, N - n - 1);
ans %= MOD;
}
}
/*
if(i > K) {
ans -= c.nCk(N + M - i - 1, M - 1);
ans %= MOD;
} */
}
cout << (ans%MOD + MOD)%MOD << endl;
}
int main() {
cout << fixed << setprecision(15);
Main();
return 0;
} |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;
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; }
using namespace std;
typedef long long ll;
void solve(){
ll l, r; cin >> l >> r;
if(2*l > r) {
cout << 0 << endl;
return;
}
ll x = r-2*l+1;
cout << (x*(x+1))/2 << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
int t; cin >> t;
for(int i = 0; i < t; i++) solve();
} | #include <bits/stdc++.h>
using namespace std;
//UnionFindテンプレ
class UnionFind {
// まとめる 判定 サイズを知る
public:
// Aから見た親の番号を格納する。rootだったら-1*その集合のサイズ。
vector<int> Parent;
// 初期化
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
// Aのrootを調べる
int root(int A) {
if (Parent[A] < 0) return A; // マイナスならそれはroot
return Parent[A] = root(Parent[A]);
}
// rootの値をプラスに戻して返す(サイズ)
int size(int A) {
return -Parent[root(A)];
}
// くっつける関数
bool connect(int A, int B) {
// AとBのroot同士をくっつける
A = root(A); // ここのAは、"rootの場所"の意味
B = root(B);
if (A == B) return false; // 既にくっついている
if (size(A) < size(B))
swap(A, B); // 大きい方にくっつけるために中身交換
Parent[A] += Parent[B]; // 中身更新
Parent[B] = A;
return true;
}
//連結か調べる関数
bool issame(int A, int B) {
return root(A) == root(B);
}
};
//chmin,chmax関数(DP用)
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;
}
//aのZ/mZでの逆元
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
//最大公約数
int64_t gcd(int64_t a, int64_t b) {
if (a % b == 0) {
return b;
}
return gcd(b, a%b);
}
//エラストテレスのふるい
vector<bool> make_is_prime(int N) {
vector<bool> prime(N + 1, true);
if (N >= 0) prime[0] = false;
if (N >= 1) prime[1] = false;
for (int i = 2; i * i <= N; i++) {
if (!prime[i]) continue;
for (int j = i * i; j <= N; j += i) {
prime[j] = false;
}
}
return prime;
}
//累乗a^b
int64_t pow(int a, int b) {
int64_t ans = (int64_t)1;
for (int i = 0; i < b; i++) {
ans *= (int64_t)a;
}
return ans;
}
//ここから
int main() {
int T; cin>>T;
vector<int64_t> answer(T);
for (int i = 0; i < T; i++) {
int64_t L,R; cin>>L>>R;
int64_t ans = 0;
if (2*L > R) {
answer.at(i) = 0;
continue;
} else {
answer.at(i) = (R-2*L+2)*(R-2*L+1)/2;
}
}
for (int i = 0; i < T; i++) {
cout << answer.at(i) << endl;
}
}
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<int> vsize;
UnionFind(int size) : par(size), rank(size), vsize(size) {
REP(i, size) {
par[i] = i;
rank[i] = 0;
vsize[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y) return;
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y]) rank[x]++;
}
vsize[x] += vsize[y];
vsize[y] = vsize[x];
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return vsize[find(x)]; }
};
class CKeepGraphConnected {
public:
vector<int> res;
vector<vector<P>> G;
void dfs(int n, int p) {
for (auto to: G[n]) {
if (to.first == p) continue;
if (res[n] == to.second) {
res[to.first] = to.second == 1 ? 2 : 1;
} else {
res[to.first] = to.second;
}
dfs(to.first, n);
}
}
void solve(std::istream& cin, std::ostream& cout) {
int N, M;
cin >> N >> M;
G.resize(N);
UnionFind uf(N);
REP(i, M) {
int u, v, c;
cin >> u >> v >> c;
u--, v--;
if (uf.same(u, v)) continue;
uf.unite(u, v);
G[u].push_back({v, c});
G[v].push_back({u, c});
}
res.resize(N);
res[0] = 1;
dfs(0, -1);
REP(i, N) {
cout << res[i] << endl;
}
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream& in(std::cin);
std::ostream& out(std::cout);
CKeepGraphConnected solver;
solver.solve(in, out);
return 0;
}
| /**
* author: shu8Cream
* created: 18.04.2021 12:10:02
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
template<typename T>
struct BIT{
public:
int n; vector<T> a;
BIT(int n_):n(n_),a(n+1,0){}
void add(int idx, T x){
idx++;
if(idx<=0 || n<idx){ cerr << "Index error" << endl; return; }
for(int i=idx; i<=n; i+=i&(-i)){
a[i]+=x;
}
}
T sum(int idx){
T res = 0;
idx++;
if(idx<0 || n<idx){ cerr << "Index error" << endl; return 0; }
if(idx==0) return 0;
for(int i=idx; i>0; i-=(i&-i)){
res+=a[i];
}
return res;
}
T sum(int l, int r){
if(l==0) return sum(r-1);
return sum(r-1)-sum(l-1);
}
};
BIT<ll> a_cnt(440000);
BIT<ll> b_cnt(440000);
BIT<ll> a_sum(440000);
BIT<ll> b_sum(440000);
int a[220000];
int b[220000];
vi decomp;
ll ts[220000], xs[220000], ys[220000];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n,m,q,t,x,y;
cin >> n >> m >> q;
a_cnt.add(0,n);
b_cnt.add(0,m);
decomp.push_back(0);
rep(i,q){
cin >> ts[i] >> xs[i] >> ys[i];
decomp.push_back(ys[i]);
}
sort(all(decomp));
decomp.erase(unique(all(decomp)), decomp.end());
rep(i,q){
ys[i] = lower_bound(all(decomp), ys[i]) - decomp.begin();
}
ll ans = 0;
rep(i,q){
t = ts[i], x = xs[i], y = ys[i];
if(t==1){
int before = a[x];
int after = y;
int m = min(before, after),
M = max(before, after);
ll diff = -b_sum.sum(m,M)
+ b_cnt.sum(m,M) * decomp[M]
+ (decomp[M]-decomp[m])*b_cnt.sum(0,m);
if(before<=after) ans += diff;
else ans-=diff;
a_sum.add(before, -decomp[before]);
a_cnt.add(before, -1);
a_sum.add(after, decomp[after]);
a_cnt.add(after, 1);
a[x]=y;
}
if(t==2){
int before = b[x];
int after = y;
int m = min(before, after),
M = max(before, after);
ll diff = -a_sum.sum(m,M)
+ a_cnt.sum(m,M) * decomp[M]
+ (decomp[M]-decomp[m])*a_cnt.sum(0,m);
if(before<=after) ans += diff;
else ans-=diff;
b_sum.add(before, -decomp[before]);
b_cnt.add(before, -1);
b_sum.add(after, decomp[after]);
b_cnt.add(after, 1);
b[x]=y;
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
struct dijkstra{
vector<long long> min_dst;
vector<vector<pair<long long, long long>>> G;
dijkstra(int n){
min_dst.resize(n);
G.resize(n);
}
void append(int u, int v, long long cost){G[u].push_back(make_pair(v, cost));}
void run(int s){
priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, greater<pair<long long, long long>>> que;
fill(min_dst.begin(), min_dst.end(), -1);
min_dst[s] = 0;
que.push(make_pair(0, s));
while(!que.empty()){
auto p = que.top(); que.pop();
int at = p.second;
if(min_dst[at] < p.first){continue;}
for(int i = 0; i < G[at].size(); i++){
int to = G[at][i].first;
long long cost = G[at][i].second;
if(min_dst[to] == -1 || min_dst[at] + cost < min_dst[to]){
min_dst[to] = min_dst[at] + cost;
que.push(make_pair(min_dst[to], to));
}
}
}
}
long long get(int at){return min_dst[at];}
};
ll r, c, a[505][505], b[505][505];
ll encode(ll i, ll j){
return i * c + j;
}
ll encode2(ll i, ll j){
return i * c + j + r * c;
}
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin >> r >> c;
zep(i, 0, r)zep(j, 0, c - 1)cin >> a[i][j];
zep(i, 0, r - 1)zep(j, 0, c)cin >> b[i][j];
dijkstra d(2 * r * c);
zep(i, 0, r)zep(j, 0, c - 1){
d.append(encode(i, j), encode(i, j + 1), a[i][j]);
d.append(encode(i, j + 1), encode(i, j), a[i][j]);
}
zep(i, 0, r)zep(j, 0, c){
d.append(encode(i, j), encode2(i, j), 1);
d.append(encode2(i, j), encode(i, j), 0);
}
zep(i, 0, r - 1)zep(j, 0, c){
d.append(encode(i, j), encode(i + 1, j), b[i][j]);
d.append(encode2(i + 1, j), encode2(i, j), 1);
}
d.run(0);
//zep(i, 0, r){zep(j, 0, c)cout << d.get(encode(i, j)) << " "; cout << endl;}
print(d.get(encode(r - 1, c - 1)))
return 0;
} | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=510; //check the limits, dummy
int a[N][N], b[N][N];
int n, m;
int mem[N][N][2];
struct pnt{
int c, l, x, y;
};
bool operator <(pnt a, pnt b){
if(a.c==b.c)
return -a.x-a.y>-b.x-b.y;
return a.c>b.c;
}
pnt mkk(int c, int l, int x, int y){
pnt tmp;
tmp.c=c;
tmp.l=l;
tmp.x=x;
tmp.y=y;
return tmp;
}
int solve(){
priority_queue<pnt> q;
q.push(mkk(0,0,0,0));
memset(mem, -1, sizeof mem);
pnt tp;
int x, y, c, l;
while(q.size()>0){
tp = q.top();
q.pop();
x = tp.x;
y = tp.y;
c = tp.c;
l = tp.l;
if(x==n-1 && y==m-1){
return c;
}
if(mem[x][y][l]!=-1)
continue;
mem[x][y][l]=c;
if(y+1<m)
q.push(mkk(c+a[x][y],0,x,y+1));
if(y-1>=0)
q.push(mkk(c+a[x][y-1],0,x, y-1));
if(x+1<n){
q.push(mkk(c+b[x][y],0,x+1,y));
}
if(x-1>=0){
if(l)
q.push(mkk(c+1,1,x-1, y));
else
q.push(mkk(c+2,1,x-1, y));
}
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=0; i<n; ++i){
for(int j=0; j<m-1; ++j){
scanf("%d",&a[i][j]);
}
}
for(int i=0; i<n-1; ++i){
for(int j=0; j<m; ++j){
scanf("%d",&b[i][j]);
}
}
int ans = solve();
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 2e5 + 5;
const int mod = 998244353;
void solve() {
int n; cin >> n;
vector<ll> a(n), sum1(n), sum2(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (!i) {
sum1[i] = a[i];
sum2[i] = a[i] * a[i];
} else {
sum1[i] = sum1[i - 1] + a[i];
sum2[i] = sum2[i - 1] + a[i] * a[i];
}
}
ll ans = 0;
for (int i = 1; i < n; i++) {
ans += i * a[i] * a[i] - 2 * a[i] * (sum1[i - 1]) + sum2[i - 1];
//cout << ans << '\n';
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T = 1; //cin >> T;
while(T--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, start, n) for (int i = start; i < (n); i++)
using ll = long long;
int main()
{
int N;
cin >> N;
vector<ll> A(N);
ll st1, st2, st3;
ll sum1 = 0; // sum(A)
ll sum2 = 0; // sum(A^2)
rep(i,0,N)
{
cin >> A.at(i);
sum1 += A.at(i);
sum2 += A.at(i)*A.at(i);
}
ll ans = 0;
ans = N*sum2 - sum1*sum1;
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector <int> vi;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ff first
#define ss second
#define f(i,a,b) for(int i = a; i < b; i++)
#define fa(i,a,b) for(int i = a; i >= b; i--)
const int inf=1e9+10;
const ll INF = 1e18+10;
const ll N=1e5+5;
const ll M=1e7+5;
const ll mod=1e9+7;
int n, ans;
int a[2005], mini = inf;
vector <ii> divi;
int main(){
fastio;
cin >> n;
f(i,0,n) {
cin >> a[i];
mini = min(mini,a[i]);
}
f(i,0,n){
for(int j = 1; j*j <= a[i]; j++){
if(a[i]%j == 0){
divi.push_back({j,a[i]});
if(a[i]/j != j) divi.push_back({a[i]/j,a[i]});
}
}
}
sort(divi.begin(), divi.end());
int id = 0;
while(id < divi.size()){
int comp = divi[id].ff, d = 0;
while(divi[id].ff == comp){
d = __gcd(d, divi[id].ss); id++;
}
if(d == comp and d <= mini) ans++;
}
cout << ans << '\n';
return 0;
}
| #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
const ll LINF=2e18;
const ll MOD=2e18;
const int INF=0x3f3f3f3f;
const int MAXN=100050;
//35000
int a[MAXN];
map<int,int>gcdd;
int gcd(int x,int y)
{
return y?gcd(y,x%y):x;
}
void mainwork(int T){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",a+i);
}
sort(a+1,a+n+1);
int minn=a[1];
int ans=1;
for(int i=1;i<=n;i++){
for(int j=1;j<minn&&j*j<=a[i];j++){
if(a[i]%j==0){
gcdd[j]=gcd(gcdd[j],a[i]);
if(a[i]/j<minn)gcdd[a[i]/j]=gcd(gcdd[a[i]/j],a[i]);
}
}
}
for(auto i:gcdd){
if(i.first>=minn)break;
if(i.second==i.first)ans++;
}
printf("%d\n",ans);
}
signed main(){
//IOS;
#ifndef ONLINE_JUDGE
//freopen("./in.txt","r",stdin);
//freopen("out.txt","w",stdout);
#endif
int t=1;
//scanf("%d",&t);
//prework();
for(int i=1;i<=t;i++){
mainwork(i);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define quickread \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define hii cout << "Hii there Sparky! \n"
#define endl '\n'
#define mod 1000000007
//#define mod 998244353
#define maxn 100010 //check the limits, dummy
#define N 200001
#define inputG push_back
vector<int> G[N];
bool visited[N] = {};
int parent[N] = {};
int depth[N] = {};
int intime[N], outtime[N];
vector<int> tim;
int timer = 0;
// int weight[N] = {};
// int op[N] = {};
// int components = 0;
void inp(int a, int b) {
a--, b--;
G[a].inputG(b);
G[b].inputG(a);
}
void dfs(int cur) {
timer++;
intime[cur] = timer;
tim.pb(cur);
visited[cur] = true;
depth[cur] = depth[parent[cur]] + 1;
for (auto u : G[cur]) {
if (visited[u])
continue;
parent[u] = cur;
dfs(u);
}
timer++;
outtime[cur] = timer;
tim.pb(cur);
}
void DFS(int n) {
for (int i = 0; i < n; i++) {
if (!visited[i]) {
dfs(i);
}
}
}
void clearGraph(int n) {
for (int i = 0; i < n; i++)
G[i].clear();
memset(visited, false, sizeof(visited));
memset(parent, 0, sizeof(parent));
memset(depth, 0, sizeof(depth));
// memset(weight, 0, sizeof(weight));
// memset(op, 0, sizeof(op));
// components = 0;
}
unordered_map<int, vector<int>> m;
void solve() {
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
inp(i, x);
}
DFS(n);
for (int i = 0; i < tim.size(); i++) {
tim[i] = depth[tim[i]];
m[tim[i]].pb(i);
}
int q;
cin >> q;
while (q--) {
int u, d;
cin >> u >> d;
u--;
int l = intime[u];
int r = outtime[u];
int val = d + 1;
l--, r--;
int a = lower_bound(all(m[val]), l) - m[val].begin();
int b = upper_bound(all(m[val]), r) - m[val].begin();
cout << (b - a) / 2 << endl;
}
}
int32_t main() {
quickread;
int test = 1;
//cin >> test;
for (int i = 0; i < test; i++) {
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second
const int N = 2e5 + 5;
int Time = 0;
int intime[N];
int outtime[N];
int n;
vector<int> adj[N];
vector<pair<int, int> > depth[N];
int dd[N];
void dfs(int s, int d){
dd[s] = d;
pair<int, int> p;
p = {Time++, 0};
intime[s] = Time - 1;
for(int i = 0; i < adj[s].size(); i++){
dfs(adj[s][i], d + 1);
}
Time++;
p.second = Time;
outtime[s] = Time;
depth[d].pb(p);
}
int main(){
FAST
cin >> n;
for(int i = 1; i < n; i++){
int p; cin >> p;
p--;
adj[p].pb(i);
}
dfs(0, 0);
vector<int> depth1[N];
vector<int> depth2[N];
for(int i = 0; i < n; i++){
sort(depth[i].begin(), depth[i].end());
for(int j = 0; j < depth[i].size(); j++){
depth1[i].pb(depth[i][j].first);
depth2[i].pb(depth[i][j].second);
}
}
int q; cin >> q;
while(q--){
int U, d;
cin >> U >> d;
U--;
if(depth1[d].size() == 0 || dd[U] > d){
cout << 0 << endl;
continue;
}
if(dd[U] == d){
cout << 1 << endl;
continue;
}
//intime[U], outtime[U];
int a = intime[U], b = outtime[U];
int num = lower_bound(depth1[d].begin(), depth1[d].end(), a) - depth1[d].begin();
if(num == depth1[d].size()){
cout << 0 << endl;
continue;
}
if(depth2[d][num] > b){
cout << 0 << endl;
continue;
}
int lo = num, hi = depth1[d].size() - 1;
while(lo < hi){
int mid = (lo + hi + 1)/2;
if(depth2[d][mid] > b){
hi = mid - 1;
}
else{
lo = mid;
}
}
cout << lo - num + 1 << endl;
}
return 0;
}
|
Subsets and Splits