code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
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; }
template<int Mod> class ModInt {
int v;
public:
constexpr ModInt(const long long x = 0) noexcept : v((x % Mod + Mod) % Mod) {}
constexpr ModInt &operator+=(const ModInt rhs) noexcept {
v += rhs.v;
if (v >= Mod)
v -= Mod;
return *this;
}
constexpr ModInt &operator-=(const ModInt rhs) noexcept {
if (v < rhs.v)
v += Mod;
v -= rhs.v;
return *this;
}
constexpr ModInt &operator*=(const ModInt rhs) noexcept {
v = int(1LL * v * rhs.v % Mod);
return *this;
}
constexpr ModInt &operator/=(ModInt rhs) noexcept {
long long exp = Mod - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
constexpr ModInt operator-() const noexcept { return ModInt(-v); }
constexpr ModInt operator+(const ModInt rhs) const noexcept {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt rhs) const noexcept {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt rhs) const noexcept {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt rhs) const noexcept {
return ModInt(*this) /= rhs;
}
constexpr bool operator==(const ModInt rhs) const noexcept {
return v == rhs.v;
}
constexpr bool operator!=(const ModInt rhs) const noexcept {
return v != rhs.v;
}
constexpr ModInt pow(long long exp) const noexcept {
ModInt res(1), mul(v);
while (exp) {
if (exp & 1)
res *= mul;
mul *= mul;
exp >>= 1;
}
return res;
}
friend ostream &operator<<(ostream &os, const ModInt obj) noexcept {
return os << obj.v;
}
friend istream &operator>>(istream &is, ModInt &obj) noexcept {
long long tmp;
is >> tmp;
obj = ModInt<Mod>(tmp);
return is;
}
};
constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
rep(_, t) {
ll n, a, b;
cin >> n >> a >> b;
if (a < b)
swap(a, b);
mint ans = mint(n-a+1)*(n-a+1)*(n-b+1)*(n-b+1);
mint sum;
if (a < n && b > 1) {
ll mn = a+1, mx = min(a+b-1, n);
mint l = n-mx+1, r = n-mn+1;
sum += (l+r)*(r-l+1);
}
sum += mint(n-a+1)*(a-b+1);
ans -= sum*sum;
cout << ans << '\n';
}
return 0;
} | /*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(firstsecond) '(' << 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<pair<ll,ll>>>;
// MOD確認
ll N,M,Q;
pair<ll,ll> P[60];
ll X[60],L[60],R[60];
ll w[60];
ll done[60];
int main(){
cin >> N >> M >> Q;
rep(i,N) cin >> P[i].second >> P[i].first;
rep(i,M) cin >> X[i];
rep(i,Q) cin >> L[i] >> R[i];
sort(P,P+N);
rep(i,Q){
ll cnt = 0,res = 0;
rep(j,M){
if(j < L[i]-1 || R[i] <= j){
w[cnt] = X[j];
cnt++;
}
}
sort(w,w+cnt);
rep(j,60) done[j] = 0;
rrep(j,N){
rep(k,cnt){
if(!done[k] && w[k] >= P[j].second){
done[k] = 1;
res += P[j].first;
break;
}
}
}
cout << res << endl;
}
} |
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <utility>
#include <array>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace std;
typedef long long ll;
#define dump(x) // // cerr << #x << " = " << (x) << " [" << __LINE__ << ":" << __FUNCTION__ << "] " << endl;
// vector出力
template < typename T >
ostream& operator<<(ostream& os, vector< T >& v) {
os << "{";
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i < v.size() - 1 ? ", " : "");
}
os << "}";
return os;
}
// pair出力
template < typename T, typename U >
ostream& operator<<(ostream& os, const pair< T, U >& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
// map出力
template < typename T, typename U >
ostream& operator<<(ostream& os, const map< T, U >& map_var) {
os << "{";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template < typename T >
ostream& operator<<(ostream& os, const set< T >& set_var) {
os << "{";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr;
++itr;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// multiset 出力
template < typename T >
ostream& operator<<(ostream& os, const multiset< T >& set_var) {
os << "{";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr;
++itr;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#pragma endregion
/////////////////////////////////////////
int main() {
ll n;cin >> n;
ll ans = n;
set<ll> st;
for (ll i = 2; i*i <= n; i++) {
for (ll j = i*i; j <= n; j*=i) {
if (st.find(j) != st.end()) continue;
// cout << i << " " << j << endl;
ans--;
st.insert(j);
}
}
cout << ans << endl;
return 0;
}
///////////////////////////////////////// | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <complex>
#include <regex>
#define Debug cout << "line: " << __LINE__ << "Debug" << endl;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define ALL(a) (a).begin(), (a).end()
#define MP make_pair
#define MOD 1000000007
#define PI 3.14159265358979323846
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vd = vector<double>;
using vl = vector<long long>;
void set_FPD(int n){
cout << fixed << setprecision(n);
return;
}
ll Pow(ll a,ll b){
ll ans=1;
for(int i=0;i<b;i++) ans*=a;
return ans;
}
ll apc(ll n,ll b){
ll ans=0,tmp=pow(2,b);
ans+=n%tmp;
ans+=n/tmp;
return ans;
}
void Main(){
ll n;
cin>>n;
ll m=1e18;
for(ll b=0;b<64;b++){
ll tmp=apc(n,b);
m=min(m,tmp+b);
}
cout<<m<<endl;
return;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
Main();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T& A){T 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();A=x*f;}
template <typename T> inline void read(T& A,T& B){read(A),read(B);}
template <typename T> inline void read(T& A,T& B,T& C){read(A),read(B),read(C);}
template <typename T> inline void write(T a){if(a<0)putchar('-'),a=-a;if(a>9)write(a/10);putchar(a%10+'0');}
int n,m,a,b;
int A[1510][1510];
int x[500010];
int y[500010];
int main(){
read(a,b);
read(n,m);
for(int i=1;i<=n;i++){
read(x[i],y[i]);
A[x[i]][y[i]]=2;
}
for(int i=1;i<=m;i++){
int u,v;
read(u,v);
A[u][v]=1;
}
for(int i=1;i<=n;i++){
int lef=x[i]-1;
while(lef>=1&&A[lef][y[i]]!=1&&A[lef][y[i]]!=2){
A[lef][y[i]]=3;
lef--;
}
int rig=x[i]+1;
while(rig<=a&&A[rig][y[i]]!=1&&A[rig][y[i]]!=2){
A[rig][y[i]]=3;
rig++;
}
lef=y[i]-1;
while(lef>=1&&A[x[i]][lef]!=1&&A[x[i]][lef]!=2){
A[x[i]][lef]=3;
lef--;
}
rig=y[i]+1;
while(rig<=b&&A[x[i]][rig]!=1&&A[x[i]][rig]!=2){
A[x[i]][rig]=3;
rig++;
}
}
int ans=0;
for(int i=1;i<=a;i++){
for(int j=1;j<=b;j++){
ans+=(A[i][j]==2||A[i][j]==3);
}
}
cout<<ans;
return 0;
}
| /*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}
void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}
void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}
void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}
void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}
void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(25);
}
} setup_io;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'
ll gcd(ll a, ll b) {
if (b > a) {
swap(a, b);
}
if (b == 0) return a;
ll r = a%b;
while (r != 0) {
a = b;
b = r;
r = a%b;
}
return b;
}
ll lcm(ll a, ll b) {
return (a / gcd(a, b))*b;
}
signed main() {
int n;
cin >> n;
vi a(n);
rep (i, n) cin >> a[i];
vi primes;
REP (i, 2, 51) {
int x = i;
bool flag = true;
for (int j = 2; j < x; j++) {
if (x % j == 0) {
flag = false;
}
}
if (flag) primes.push_back(i);
}
int m = primes.size();
ll ans = INF;
rep (i, 1 << m) {
ll g = 1;
rep (j, m) {
if (i & (1 << j)) g *= primes[j];
}
bool flag = true;
rep (i, n) {
if (gcd(g, a[i]) == 1) flag = false;
}
if (flag) {
chmin(ans, g);
}
}
cout << ans << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int x;
cin>>x;
if (x>=0)cout<<x;
else cout<<0;
return 0;
}
| #include <bits/stdc++.h>
#define M 1000000007
#define ll long long
#define ld long double
#define P pair<int, int>
#define PL pair<ll, ll>
#define F first
#define S second
#define vc vector<int>
#define vcl vector<ll>
#define vcb vector<bool>
#define vt vector
#define pb push_back
#define ha cout << "YES";
#define na cout << "NO";
#define el endl
#define filler(arr, n) \
for (int i = 0; i < n; i++) \
cin >> arr[i];
/*
generated by
jaindipankar284
*/
using namespace std;
void solve();
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// int T;
// cin >> T;
// while (T--)
solve();
return 0;
}
class Helper
{
public:
ll s;
ll idx;
Helper(ll s, ll idx)
{
this->s = s;
this->idx = idx;
}
};
void solve()
{
int x;
cin >> x;
cout << (x >= 0 ? x : 0);
}
|
#pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
template<typename T> using PQ = priority_queue<T>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007; // 998244353;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const ld PI = acos((ld)-1);
constexpr ll dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
inline void Yes() { cout << "Yes" << ENDL; }
inline void No() { cout << "No" << ENDL; }
inline void YES() { cout << "YES" << ENDL; }
inline void NO() { cout << "NO" << ENDL; }
template<typename T,typename Y> inline T mpow(T a, Y n) {
T res = 1;
for(;n;n>>=1) {
if (n & 1) res = res * a;
a = a * a;
}
return res;
}
template <typename T>
vector<T> finddivisor(T x) { //整数xの約数(xを含む)
vector<T> divisor;
for(T i = 1; (i * i) <= x; i++) {
if(x % i == 0) {
divisor.push_back(i);
if(i * i != x) { divisor.push_back(x / i);}
}
}
sort(divisor.begin(), divisor.end());
return divisor;
}
template <typename T> V<T> prefix_sum(const V<T>& v) {
int n = v.size();
V<T> ret(n + 1);
rep(i, 0, n) ret[i + 1] = ret[i] + v[i];
return ret;
}
template<typename T>
T rand(T l,T r){
static random_device rd;
static mt19937 g(rd());
return uniform_int_distribution<T>(l,r)(g);
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(auto&& x: vec) is >> x;
return is;
}
template<typename T,typename Y>
ostream& operator<<(ostream& os,const pair<T,Y>& p){
return os<<"{"<<p.fs<<","<<p.sc<<"}";
}
template<typename T> ostream& operator<<(ostream& os,const V<T>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<typename ...Args>
void debug(Args&... args){
for(auto const& x:{args...}){
cerr<<x<<' ';
}
cerr<<ENDL;
}
#pragma endregion templates
signed main(){
cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false);
cout<<fixed<<setprecision(20);
V<string> s(3);cin>>s;
V<char> cs(0);
rep(i,0,3)for(auto&& c:s[i])cs.eb(c);
sort(all(cs));
cs.erase(unique(all(cs)),cs.end());
ll bit=0,step=0;
V<ll> v(3);
unordered_map<char,int> ma;
auto dfs=[&](auto self)->void{
if(step==siz(cs)){
v.assign(3,0);
rep(i,0,3)rep(j,0,siz(s[i])){
v[i]*=10;
v[i]+=ma[s[i][j]];
if(!j && ma[s[i][j]]==0)return;
}
if(v[0]+v[1]==v[2]){
cout<<v[0]<<ENDL<<v[1]<<ENDL<<v[2]<<ENDL;
exit(0);
}
}else{
rep(i,0,10)if(!(bit & (1<<i))){
bit|=(1<<i);
ma[cs[step]]=i;
step++;
self(self);
step--;
bit^=(1<<i);
}
}
return;
};
dfs(dfs);
cout<<"UNSOLVABLE"<<ENDL;
}
//(・_・)(・_・)(・_・)(・_・)
//CHECK overflow,what to output?
//any other simpler approach? | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define f0(n) for(int i=0;i<n;i++)
#define f1(n) for(int i=1;i<=n;i++)
#define mii map<int,int>
#define mci map<char,int>
#define V vector<int>
#define vp vector<pair<int,int>>
#define pb push_back
#define pp pair<int,int>
#define ff first
#define ss second
#define S set<int>
#define show2(a, b) cout<<a<<' '<<b<<endl;
#define show3(a, b, c) cout<<a<<' '<<b<<' '<<c<<endl;
#define mod 1000000007
int f(string s){
int n=0;
for(int i=0;i<s.length();i++){
n*=10;
n+=(s[i]-'0');
}
return n;
}
int32_t main(){
int t=1;
//cin>>t;
while(t--){
string s1,s2,s3;
cin>>s1>>s2>>s3;
map<char,vector<pp>> m;
f0(s1.length()) m[s1[i]].pb({1,i});
f0(s2.length()) m[s2[i]].pb({2,i});
f0(s3.length()) m[s3[i]].pb({3,i});
vector<vector<pp>> a;
for(auto i=m.begin();i!=m.end();i++) a.pb(i->ss);
if(a.size()>10){
cout<<"UNSOLVABLE\n";
return 0;
}
V v={0,1,2,3,4,5,6,7,8,9};
string t1=s1,t2=s2,t3=s3;
do{
for(int i=0;i<a.size();i++){
for(int j=0;j<a[i].size();j++){
if(a[i][j].ff==1) t1[a[i][j].ss]=v[i]+'0';
if(a[i][j].ff==2) t2[a[i][j].ss]=v[i]+'0';
if(a[i][j].ff==3) t3[a[i][j].ss]=v[i]+'0';
}
}
if(t1[0]=='0'||t2[0]=='0'||t3[0]=='0') continue;
int n1=f(t1),n2=f(t2),n3=f(t3);
if(n1+n2==n3){
cout<<n1<<endl;
cout<<n2<<endl;
cout<<n3<<endl;
return 0;
}
}
while(next_permutation(v.begin(),v.end()));
cout<<"UNSOLVABLE\n";
}
return 0;
} |
//2*10^9 -- int
//9*10^18 -- long long int
//10^38 -- __int128_t
//we also have long double
/*A better way to compare floating point numbers is to assume that
two numbers are equal if the difference between them is less than ε, where ε is a small number.(ε=10−9) */
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define endl "\n"
#define sp " "
#define PI 3.14159265358979323846264338327950L
const ll dif=1e-9;
const ll M=1e9+7;
//to handle when remainder is -neg we add + M
//but when rem is +pos that time also we add so use %M
//so it will work for both
ll mod(ll n){
return (n%M + M)%M;
}
ll modAdd(ll a, ll b){
return mod(mod(a)+mod(b));
}
ll modMul(ll a, ll b){
return mod(mod(a)*mod(b));
}
ll modMinus(ll a, ll b){
return mod(mod(a)-mod(b));
}
ll modpow(ll x, ll n)
{
if (n == 0)
return 1%M;
if (n == 1)
return x%M;
ll u = modpow(x,n/2);
u = modMul(u,u);
if (n%2)
u = modMul(u,x);
return u;
}
ll gcd(ll a,ll b){
if(b==0)
return a;
return gcd(b,a%b);
}
bool isPrime(ll n){
int end = sqrt(n);
for(int i=2;i<=end;i++)
if(n%i==0)
return false;
return true;
}
int getParent(vector<int>&parent,int s){
if(parent[s]==s)
return s;
return getParent(parent,parent[s]);
}
void solve(){
int h,w;
cin>>h>>w;
vector<vector<int>> data(h,vector<int>(w,0));
char c;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c;
data[i][j]=(c=='#'?1:0);
}
}
int ans=0;
//row-wise
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(data[i][j]==1 && data[i-1][j]==0){
int k=j;
ans+=1;
while(k<w && data[i][k]==1 && data[i-1][k]==0)
k++;
j=k;
}
}
}
for(int i=h-1;i>=0;i--){
for(int j=0;j<w;j++){
if(data[i][j]==1 && data[i+1][j]==0){
int k=j;
ans+=1;
while(k<w && data[i][k]==1 && data[i+1][k]==0)
k++;
j=k;
}
}
}
for(int i=0;i<w;i++){
for(int j=0;j<h;j++){
if(data[j][i]==1 && data[j][i-1]==0){
int k=j;
ans+=1;
while(k<h && data[k][i]==1 && data[k][i-1]==0)
k++;
j=k;
}
}
}
for(int i=w-1;i>=0;i--){
for(int j=0;j<h;j++){
if(data[j][i]==1 && data[j][i+1]==0){
int k=j;
ans+=1;
while(k<h && data[k][i]==1 && data[k][i+1]==0)
k++;
j=k;
}
}
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define LL_MAX 1e18
using ll = long long;
using namespace std;
int main(){
int dx[4]={0,0,-1,-1};
int dy[4]={-1,0,-1,0};
int h,w;
cin>>h>>w;
vector<string> s(h);
for(int i=0; i<h; i++) cin>>s[i];
int ans=0;
for(int i=1; i<h; i++){
for(int j=1; j<w; j++){
int white=0,black=0;
for(int k=0; k<4; k++){
if(s[i+dy[k]][j+dx[k]]=='.') white++;
else black++;
}
if(black%2) ans++;
}
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
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; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
int main() {
ll N,M;
cin >> N >> M;
vector<ll> aa((1+N)/2);
vector<ll> bb((1+N)/2);
vector<ll> hh(N);
vector<ll> ww(M);
for(ll i=0;i<N;i++) cin >> hh[i];
for(ll i=0;i<M;i++) cin >> ww[i];
sort(ALL(hh));
ll ans=INF;
aa[0]=0;
for(ll i=1;i<(N+1)/2;i++){
aa[i]=aa[i-1]+hh[2*i-1]-hh[2*i-2];
}
for(ll i=(N-2)/2;i>=0;i--){
bb[i]=bb[i+1]+hh[2*i+2]-hh[2*i+1];
}
for(auto gg : ww){
ll x=lower_bound(ALL(hh),gg)-hh.begin();
if(x & 1) x^=1;
chmin(ans,aa[x/2]+bb[x/2]+abs(gg-hh[x]));
}
cout << ans << endl;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}
//head
ll cc(ll x) {
ll res = 1;
while(x--) res *= 10;
return res;
}
ll dd(ll x) {return x*x;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x = INT_MAX, xt = 0, y = INT_MAX, yt = 0, r = INT_MAX, rt = 0;
string s;
cin >> s;
rep(i, s.size()) {
if(s[i] != '.') continue;
if(s[0] != '-') x = 1;
else x = -1;
s = s.substr(i+1);
x *= stoi(s);
xt = s.size();
break;
}
if(x == INT_MAX) x = 0;
cin >> s;
rep(i, s.size()) {
if(s[i] != '.') continue;
if(s[0] != '-') y = 1;
else y = -1;
s = s.substr(i+1);
y *= stoi(s);
yt = s.size();
break;
}
if(y == INT_MAX) y = 0;
cin >> s;
rep(i, s.size()) {
if(s[i] != '.') continue;
s = s.substr(0, i) + s.substr(i+1);
r = stoi(s);
rt = s.size()-i;
break;
}
if(r == INT_MAX) r = stoi(s);
int t = max({xt, yt, rt});
x *= cc(t-xt);
y *= cc(t-yt);
r *= cc(t-rt);
ll ans = 0;
ll u = cc(t);
//cout << P(x, y) << ' ' << P(r, t) << endl;
for(ll z = -100010; z < 100010; z++) {
ll now = z*u;
//if(abs(y-now) > r) continue;
//cout << z << endl;
ll lb = -100010, ub = 1;
while(ub-lb != 1) {
ll mid = (lb+ub)>>1;
if(dd(x-mid*u)+dd(y-now) <= r*r) ub = mid;
else lb = mid;
}
int lef = ub;
ub = 100010;
lb = 0;
while(ub-lb != 1) {
ll mid = (lb+ub)>>1;
if(dd(x-mid*u)+dd(y-now) <= r*r) lb = mid;
else ub = mid;
}
ans += lb-lef+1;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct BIT {
int n;
vector<T> dat;
BIT(int n=0){
initialize(n);
}
void initialize(int nin){
n = nin;
dat.assign(n, 0);
}
T sum(int i){
T s = 0;
while(i >= 0){
s += dat[i];
i = (i & (i+1)) - 1;
}
return s;
}
T sum_between(int i, int j){
return sum(j) - sum(i-1);
}
void plus(int i, T x){
while(i < n){
dat[i] += x;
i |= i+1;
}
}
// a[0]+...+a[ret] >= x
int lower_bound(T x){
if(x < 0) return -1;
int ret = -1;
int k = 1;
while(2*k <= n) k <<= 1;
for( ;k>0; k>>=1){
if(ret+k < n && dat[ret+k] < x){
x -= dat[ret+k];
ret += k;
}
}
return ret + 1;
}
};
void fail(){
cout << -1 << endl;
exit(0);
}
int main(){
int N;
cin >> N;
map<int, vector<int>> V[2];
for(int k=0; k<2; k++) for(int i=0; i<N; i++){
int a;
cin >> a;
V[k][a+i].push_back(i);
}
vector<int> T(N);
for(auto& [k, v] : V[0]){
int sz = v.size();
if(V[1][k].size() != sz) fail();
for(int i=0; i<sz; i++) T[v[i]] = V[1][k][i];
}
BIT<int> bit(N);
int64_t ans = 0;
for(int a : T){
ans += bit.sum_between(a, N-1);
bit.plus(a, 1);
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
#define int long long
const int N=1000050;
using namespace std;
int n,ans,to[N];
struct node{
int w,p;
bool operator <(node b)const{return w==b.w?p<b.p:w<b.w;}
}a[N],b[N];
int s[N];
void add(int k){
while(k<=n)s[k]++,k+=k&-k;
}
int sum(int k){
int ans=0;while(k)
ans+=s[k],k-=k&-k;
return ans;
}
main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++)scanf("%lld",&a[i].w),a[i].w+=i,a[i].p=i;
for(int i=1;i<=n;i++)scanf("%lld",&b[i].w),b[i].w+=i,b[i].p=i;
sort(a+1,a+1+n);
sort(b+1,b+1+n);
for(int i=1;i<=n;i++){
if(a[i].w!=b[i].w)printf("-1"),exit(0);
to[a[i].p]=b[i].p;
}
for(int i=1;i<=n;i++)
ans+=sum(to[i]-1),add(to[i]);
printf("%lld",n*(n-1)/2-ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
template<class T> inline bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T> inline bool chmin(T &a, const T &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
int main() {
ll N;
cin >> N;
vl E(2 * N, -1), id(2 * N, -1), used(2 * N), se(N), A(N), B(N);
rep(i, N) {
cin >> A[i] >> B[i];
if (A[i] > 0) A[i]--, id[A[i]] = i, used[A[i]]++;
if (B[i] > 0) B[i]--, id[B[i]] = i, used[B[i]]++;
if (A[i] >= 0 and B[i] >= 0) se[i] = 1; // 始点終点が決まっている
if((A[i] >= 0 and B[i] >= 0) and A[i] > B[i]){
cout << "No" << endl;
return 0;
}
}
rep(i, 2 * N){
if(used[i] > 1){
cout << "No" << endl;
return 0;
}
}
rep(i, N) {
if (A[i] == -1 or B[i] == -1) continue;
ll d = B[i] - A[i];
repe(j, A[i], B[i] + 1) {
if(!(E[j] == -1 or E[j] == d)){
cout << "No" << endl;
return 0;
}
E[j] = d;
}
}
vl pass(2 * N + 1);
pass[0] = 1;
rep(i, 2 * N - 1){
if (!pass[i]) continue;
// 選ぶ人数
repe(n, 1, N + 1){
if (i + 2 * n > 2 * N) break;
bool isok = true;
rep(j, n){
if(id[i + j] == -1 and id[i + j + n] == -1){
continue;
}else if(id[i + j] == -1){
if (se[id[i + j + n]]) isok = false;
}else if(id[i + j + n] == -1){
if (se[id[i + j]]) isok = false;
}else{
if (id[i + j] != id[i + j + n]) isok = false;
}
if (!isok) break;
}
if (isok) pass[i + 2 * n] = 1;
}
}
cout << (pass[2 * N] ? "Yes" : "No") << endl;
} |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define fix fixed<<setprecision(10)
#define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
#define repb(i,b,a) for(int i=int(b);i>=int(a);i--)
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0)
typedef double db;
typedef long long ll;
const int N=205;
const int mod=1e9+7;
int n,a[N],dp[N][N][N][2][2];
int rec(int i,int s1,int s2,int f1,int f2){
if(f1 and f2 and s1==s2) return 1;
if(i>n) return 0;
int &cache=dp[i][s1][s2][f1][f2];
if(cache!=-1) return cache;
return cache=(rec(i+1,(s1+a[i])%200,s2,1,f2)|rec(i+1,s1,(s2+a[i])%200,f1,1)|rec(i+1,s1,s2,f1,f2));
}
void path(int i,int s1,int s2,int f1,int f2,vi &v,vi &u){
if(i>n) return;
if(rec(i+1,(s1+a[i])%200,s2,1,f2)){
v.pb(i);
return path(i+1,(s1+a[i])%200,s2,1,f2,v,u);
}
if(rec(i+1,s1,(s2+a[i])%200,f1,1)){
u.pb(i);
return path(i+1,s1,(s2+a[i])%200,f1,1,v,u);
}
path(i+1,s1,s2,f1,f2,v,u);
}
signed main(){
FastIO;
cin>>n;
rep(i,1,n) cin>>a[i];
memset(dp,-1,sizeof dp);
if(!rec(1,0,0,0,0)){
return cout<<"NO",0;
}
cout<<"YES\n";
vi v,u;
path(1,0,0,0,0,v,u);
cout<<v.size()<<' ';
for(int i:v) cout<<i<<' ';
cout<<'\n';
cout<<u.size()<<' ';
for(int i:u) cout<<i<<' ';
return 0;
}
|
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
template <typename T>
void read (T &x) {
x = 0; T f = 1;
char ch = getchar ();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar ();
}
while (ch >= '0' && ch <= '9') {
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar ();
}
x *= f;
}
template <typename T>
void write (T x) {
if (x < 0) {
x = -x;
putchar ('-');
}
if (x < 10) {
putchar (x + '0');
return;
}
write (x / 10);
putchar (x % 10 + '0');
}
template <typename T>
void print (T x, char ch) {
write (x); putchar (ch);
}
template <typename T> T Max (T x, T y) { return x > y ? x : y; }
template <typename T> T Min (T x, T y) { return x < y ? x : y; }
template <typename T> T Abs (T x) { return x > 0 ? x : -x; }
const int Maxn = 2 * 1e5;
int n;
int a[Maxn + 5];
int fa[Maxn + 5];
void MakeSet () {
for (int i = 1; i <= Maxn; i++) {
fa[i] = i;
}
}
int FindSet (int x) {
if (fa[x] != x) {
fa[x] = FindSet (fa[x]);
}
return fa[x];
}
void UnionSet (int x, int y) {
int u = FindSet (x), v = FindSet (y);
if (u == v) return;
fa[u] = v;
}
signed main () {
MakeSet ();
read (n);
for (int i = 1; i <= n; i++) {
read (a[i]);
}
int ans = 0;
for (int i = 1, j = n; i < j; i++, j--) {
if (FindSet (a[i]) != FindSet (a[j])) {
UnionSet (a[i], a[j]);
ans++;
}
}
write (ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define tcase int _; cin >> _; while(_--)
#define ll long long
#define endl '\n'
const int INF = 2e9;
const int MAX = 2e5+100;
void solve() {
ll n;
cin >> n;
vector<int> arr(n);
for(int &x : arr) cin >> x;
vector<int> uf(MAX), w(MAX);
for(int i=0; i<MAX; ++i) uf[i] = i, w[i] = 1;
auto find = [&](auto &&self, int i) -> int {
return i == uf[i] ? i : uf[i] = self(self, uf[i]);
};
auto join = [&](int i, int j) -> void {
i = find(find, i);
j = find(find, j);
if(i == j) return;
if(w[i] > w[j]) {
uf[j] = i;
w[i] += w[j];
} else {
uf[i] = j;
w[j] += w[i];
}
};
int answer = 0;
for(int i=0; i<n/2; ++i) {
if(find(find, arr[i]) != find(find, arr[n-i-1])) {
answer++;
join(arr[i], arr[n-i-1]);
}
}
cout << answer << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <cstring>
#include <bitset>
#include <array>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll pot=3;
int br1=1, br2=1;
ll y;
ll x;
while(pot<n){
y=n-pot;
x=5;
br2=1;
while(y>x){
br2++;
x*=5;
}
if(pot+x==n){
cout << br1 << ' ' << br2 << '\n';
return 0;
}
br1++;
pot*=3;
}
cout << -1 << '\n';
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);
lli n; cin>>n;
f(t,1,38){
f(fv,1,26){
lli val = powl(3,t)+powl(5,fv);
if(val==n){
cout<<t<<' '<<fv<<endl;
return 0;
}
}
}
cout<<-1<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long li;
typedef long double ld;
typedef pair<int,int> pt;
typedef pair<ld, ld> ptd;
typedef unsigned long long uli;
#define SORT(vec) sort(vec.begin(), vec.end())
#define loop(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
#define mp make_pair
#define mset(a, val) memset(a, val, sizeof (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ft first
#define sc second
#define sz(a) int((a).size())
#define x first
#define y second
const int INF = int(1e9);
const li INF64 = li(INF) * li(INF);
const ld EPS = 1e-9;
const ld PI = ld(3.1415926535897932384626433832795);
int main(){
li x,y,a,b;
cin>>x>>y>>a>>b;
li ans=1;
li res=0;
for(int i=0;i<=60;i++){
if(i!=0){
ans*=a;
}
li num=ans*x;
if(y<=num)break;
if(num<(ans/a)*x)break;
res=max(res,(i+(y-num-1)/b));
}
cout<<res<<"\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("file.txt","r",stdin );
#define outF freopen("perimeter.out" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define lp(i , n) for(int x = i ; x < n ; x ++)
#define ll long long
#define read(arr , x , n) for(int i = x ; i < n ; i ++ )cin >> arr[i];
#define vector deque
const int N = 2e4 + 6, M = N * 4 ;
const ll MOD = 1e9 + 7 ;
int32_t main()
{
// inF;outF;
fastio;
// Dont Forget memset
//inF;
ll ans = 0 , a , b , c , d;
cin >> a >> b >> c >> d ;
while(b / c > a && a * c < a + d )ans ++ , a *= c ;
b -= a ;
b -- ;
ans += b / d ;
cout << ans ;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ':' << a << endl; }
#define endl '\n'
#define fi first
#define se second
using lint = long long;
using P = pair<int,int>;
template<class T> using V = vector<T>;
template<class T> using priq = priority_queue<T>;
template<class T> using priq_inv = priority_queue<T, vector<T>, greater<T>>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
template<class T> T ceil(const T &a, const T &b) { return (a+b-1)/b; }
template<class T> bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
struct INF { template<class T> operator T() { return numeric_limits<T>::max() / 2; } } INF;
template<class T, class U> istream& operator>>(istream &in, pair<T,U> &p) {
return in >> p.first >> p.second;
}
template<class T, class U> ostream& operator<<(ostream &out, const pair<T,U> &p) {
return out << p.first << ' ' << p.second;
}
template<class T> istream& operator>>(istream &in, vector<T> &v) {
for(auto &&e: v) in >> e;
return in;
}
template<class T> ostream& operator<<(ostream &out, const vector<T> &v) {
for(const auto &e: v) out << e << ' ';
return out;
}
/*----------------------------------------------------------------------------------------------------*/
bool f(int x, V<V<int>> &as) {
set<V<bool>> st;
int n = sz(as);
rep(i,n) {
V<bool> v(5);
rep(j,5) v[j] = (as[i][j] >= x);
st.insert(v);
}
bool res = false;
for(auto i: st) for(auto j: st) for(auto k: st) {
bool ok = true;
rep(l,5) {
ok &= (i[l] || j[l] || k[l]);
}
res |= ok;
}
return res;
}
int main() {
int n;
cin >> n;
V<V<int>> as(n,V<int>(5));
cin >> as;
int l = 0, r = INF;
while(r-l > 1) {
int mid = (l+r)/2;
if(f(mid,as)) l = mid;
else r = mid;
}
cout << l << endl;
} | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=55;
int n,a[N],X[N],x;
int dp[N][2];
int calc(int i,int carry)
{
if(i==n+1) return carry^1;
int &res=dp[i][carry];
if(res!=-1) return res;
int lim=a[i+1]/a[i];
int cur=X[i]+carry;
if(cur==lim) res=calc(i+1,1);
else if(cur==0) res=calc(i+1,0);
else res=calc(i+1,0)+calc(i+1,1);
return res;
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
memset(dp,-1,sizeof dp);
cin>>n>>x;
for(int i=1;i<=n;i++) cin>>a[i];
a[n+1]=1e18;
for(int i=n;i>=1;i--)
{
X[i]=x/a[i];
x%=a[i];
}
cout<<calc(1,0);
}
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
int mod = 1000000007;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
template<class... T> int add(int x, T... y) { return add(x, add(y...)); }
int mul(int x, int y) { return 1LL * x * y % mod; }
template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
int sub(int x, int y) { return add(x, mod - y); }
int modpow(int a, long long b) {
int ret = 1; while (b > 0) {
if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
} return ret;
}
int modinv(int a) { return modpow(a, mod - 2); }
void chadd(int& x, int y) { x = add(x, y); }
void chsub(int& x, int y) { x = sub(x, y); }
void chmul(int& x, int y) { x = mul(x, y); }
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i @hamayanhamayan0
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, K, M;
const int MA = 251010;
int dp[101][MA];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> K >> mod;
dp[0][0] = 1;
rep(i, 0, 100) rep(sm, 0, MA) rep(use, 0, K + 1) if (sm + use * (i + 1) < MA) {
chadd(dp[i + 1][sm + use * (i + 1)], dp[i][sm]);
}
rep(x, 1, N + 1) {
int lft = x - 1, rht = N - x;
int ans = 0;
rep(sm, 0, MA) chadd(ans, mul(dp[lft][sm], dp[rht][sm], K + 1));
chsub(ans, 1);
printf("%d\n", ans);
}
}
| #include<bits/stdc++.h>
#include<tuple>
typedef long long ll;
#define INF 99999999999999
#define mod 1000000007
#define eps 1e-9
using namespace std;
typedef pair<ll,ll> du;
ll n;
string s,x;
ll dp[200005];
int main(){
ios::sync_with_stdio(0);
cin>>n>>s;
cin>>x;
dp[n]=1;
//cout<<s[0]-'0'<<endl;
for(ll i=n;i>=1;i--){
if(x[i-1]=='T'){
for(ll j=0;j<7;j++){
//cout<<j*10+s[i-1]-'0'<<endl;
if((1<<(j*10%7)&(dp[i]))||(1<<((j*10+s[i-1]-'0')%7))&(dp[i]))
dp[i-1]|=1<<j;
}
}
else{
for(ll j=0;j<7;j++)
if(1<<(j*10%7)&(dp[i])&&1<<((j*10+s[i-1]-'0')%7)&(dp[i]))
dp[i-1]|=1<<j;
}
}
//0,3
//cout<<dp[1]<<endl;
//cout<<dp[0]<<endl;
if(dp[0]&1)
cout<<"Takahashi\n";
else
cout<<"Aoki\n";
return 0;
} |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N; cin >> N;
ll p = 1;
ll a = 0;
while (true) {
if (p >= N / 3) break;
a++;
p *= 3;
ll q = 1;
ll b = 0;
while (true) {
if (q > (N - p) / 5) break;
b++;
q *= 5;
if (p + q == N) {
cout << a << " " << b << endl;
return 0;
}
}
}
cout << -1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
/*-------------------------------------------*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = 0;
rep(i, n) ans += max(0, a[i] - 10);
cout << ans << endl;
return 0;
} |
/*input
3 3 5
2 3 D
1 3 D
2 1 D
1 2 X
3 1 R
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const ll mod = 998244353,N = 5005;
ll H,W,K;
vector<vector<char>> mat(N,vector<char> (N,'.'));
vector<vector<ll>> dp(N,vector<ll> (N,-1)),row(N,vector<ll> (N,0)),col(N,vector<ll> (N,0));
vector<ll> power3(N,0);
int main()
{
cin>>H>>W>>K;
for(int i=0;i<K;i++){
ll x,y;cin>>x>>y;
x--,y--;
char c;cin>>c;
mat[x][y] = c;
}
for(ll x=0;x<H;x++){
for(ll y=W-1;y>=0;y--){
row[x][y] = (mat[x][y]=='.') + (y!=W-1?row[x][y+1]:0);
}
}
for(ll y=0;y<W;y++){
for(ll x=H-1;x>=0;x--){
col[x][y] = (mat[x][y]=='.') + (x!=H-1?col[x+1][y]:0);
}
}
power3[0]=1;
for(ll i =1;i<N;i++){
power3[i] = (power3[i-1]*3)%mod;
}
for(ll x=H-1;x>=0;x--)
{
for(ll y=W-1;y>=0;y--)
{
if(x==H-1 && y==W-1) { dp[x][y] = ((mat[x][y]=='.')?3:1); continue; }
ll ans = 0;
if(mat[x][y]=='R'){
if(y+1<W){
ans = (ans + (dp[x][y+1] * power3[col[x][y]])%mod);
}
}
else if(mat[x][y]=='D'){
if(x+1<H){
ans = (ans + (dp[x+1][y] * power3[row[x][y]])%mod);
}
}
else if(mat[x][y]=='X'){
if(y+1<W){
ans = (ans + (dp[x][y+1] * power3[col[x][y]])%mod);
}
if(x+1<H){
ans = (ans + (dp[x+1][y] * power3[row[x][y]])%mod);
if(ans>=mod) ans-=mod;
}
}
else{
if(y+1<W){
ll val = (dp[x][y+1] * power3[col[x+1][y]])%mod;
val*=2;
if(val>=mod) val-=mod;
ans +=val;
}
if(x+1<H){
ll val = 2*(dp[x+1][y] * power3[row[x][y+1]])%mod;
if(val>=mod) val-=mod;
ans+=val;
if(ans>=mod) ans-=mod;
}
}
dp[x][y]=ans;
}
}
cout<<dp[0][0]<<"\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
const int N = 2e5 + 5;
const int INF = 2e9;
const ll LINF = 9e18;
struct query {
int T, X, Y;
};
int n, m, q;
int a[N], b[N];
ll tree[4][N << 2];
// 0 = Sum_A, 1 = Sum_B, 2 = Freq_A, 3 = Freq_B
void update(int idx, int l, int r, int pos, ll val, int d) {
if(l > pos || r < pos) return;
if(l == r) {
tree[d][idx] += val;
return;
}
int mid = l + r >> 1;
update(idx << 1, l, mid, pos, val, d);
update(idx << 1 | 1, mid + 1, r, pos, val, d);
tree[d][idx] = tree[d][idx << 1] + tree[d][idx << 1 | 1];
}
ll rangeSum(int idx, int l, int r, int from, int to, int d) {
if(l > to || r < from) return 0;
if(from <= l && r <= to) return tree[d][idx];
int mid = l + r >> 1;
return (
rangeSum(idx << 1, l, mid, from, to, d) +
rangeSum(idx << 1 | 1, mid + 1, r, from, to, d)
);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> q;
vector<query> Q;
set<int> distinct;
distinct.insert(0);
while(q--) {
int t, x, y; cin >> t >> x >> y;
Q.push_back({t, x, y});
distinct.insert(y);
}
int cnt = 0;
map<int, int> idx;
for(int u : distinct) {
idx[u] = ++cnt;
}
int s = distinct.size();
update(1, 1, s, idx[0], n, 2);
update(1, 1, s, idx[0], m, 3);
ll ans = 0;
for(query u : Q) {
if(u.T == 1) {
int prv = idx[a[u.X]];
int nxt = idx[u.Y];
ans -= rangeSum(1, 1, s, 1, prv, 3) * a[u.X];
ans += rangeSum(1, 1, s, 1, prv, 1);
ans -= rangeSum(1, 1, s, 1, nxt, 1);
ans += rangeSum(1, 1, s, 1, nxt, 3) * u.Y;
update(1, 1, s, prv, -a[u.X], 0);
update(1, 1, s, nxt, u.Y, 0);
update(1, 1, s, prv, -1, 2);
update(1, 1, s, nxt, 1, 2);
a[u.X] = u.Y;
} else {
int prv = idx[b[u.X]];
int nxt = idx[u.Y];
ans -= rangeSum(1, 1, s, 1, prv, 2) * b[u.X];
ans += rangeSum(1, 1, s, 1, prv, 0);
ans -= rangeSum(1, 1, s, 1, nxt, 0);
ans += rangeSum(1, 1, s, 1, nxt, 2) * u.Y;
update(1, 1, s, prv, -b[u.X], 1);
update(1, 1, s, nxt, u.Y, 1);
update(1, 1, s, prv, -1, 3);
update(1, 1, s, nxt, 1, 3);
b[u.X] = u.Y;
}
cout << ans << "\n";
}
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
const int INF = 0x3f3f3f3f;
int n, L[N], R[N];
long long dp[N][2];
int main() {
memset(L, 0x3f, sizeof(L));
memset(R, -0x3f, sizeof(R));
scanf("%d", &n);
for (int i = 0, x, c; i < n; ++i) {
scanf("%d%d", &x, &c);
L[c] = min(L[c], x);
R[c] = max(R[c], x);
}
L[0] = R[0] = 0;
memset(dp, 0x3f3f, sizeof(dp));
dp[0][0] = dp[0][1] = 0;
for (int i = 1; i <= n; ++i) {
if (L[i] == INF) {
dp[i][0] = dp[i - 1][0];
dp[i][1] = dp[i - 1][1];
L[i] = L[i - 1];
R[i] = R[i - 1];
continue;
}
dp[i][0] = min(dp[i - 1][0] + abs(R[i] - L[i - 1]) + R[i] - L[i],
dp[i - 1][1] + abs(R[i] - R[i - 1]) + R[i] - L[i]);
dp[i][1] = min(dp[i - 1][0] + abs(L[i] - L[i - 1]) + R[i] - L[i],
dp[i - 1][1] + abs(L[i] - R[i - 1]) + R[i] - L[i]);
}
printf("%lld\n", min(dp[n][0] + abs(L[n]), dp[n][1] + abs(R[n])));
} | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
#define X real()
#define Y imag()
// 内積 |a||b|cos(theta)
double dot(P a, P b) { return a.X * b.X + a.Y * b.Y; }
// 外積 |a||b|sin(theta)
double cross(P a, P b) { return a.X * b.Y - a.Y * b.X; }
int main() {
int N;
cin >> N;
vector<P> A(N), B(N);
for (auto &x : A) {
int a, b;
cin >> a >> b;
x = P(a, b);
}
for (auto &x : B) {
int a, b;
cin >> a >> b;
x = P(a, b);
}
map<tuple<int, int, int>, int> s, t;
auto add = [](auto &s, auto a1, auto a2, auto a3) {
// 2点間のベクトル
auto v1 = a2 - a1;
auto v2 = a3 - a1;
// 外積
int cr = cross(v1, v2);
// 2点間の距離(整数にするため２乗)
int r1 = abs(v1) * abs(v1);
int r2 = abs(v2) * abs(v2);
s[{cr, r1, r2}]++;
};
for (auto a : A)
for (auto b : A)
for (auto c : A)
add(s, a, b, c);
for (auto a : B)
for (auto b : B)
for (auto c : B)
add(t, a, b, c);
puts(s == t ? "Yes" : "No");
} |
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>
#include <iomanip>
using namespace std;
#define FOR(i, a, b) for(int (i)=(a);(i)<(b);(i)++)
#define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)
#define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)
#define REP(i, n) FOR((i), 0, (n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main() {
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<int> a(n), b(n), c(m), d(m);
vector<vector<int>> masu(h, vector<int>(w, 0));
REP(i, n){
cin >> a[i] >> b[i];
a[i]--, b[i]--;
masu[a[i]][b[i]] = 1;
}
REP(i, m){
cin >> c[i] >> d[i];
c[i]--, d[i]--;
masu[c[i]][d[i]] = -1;
}
vector<vector<vector<bool>>> hikari(h, vector<vector<bool>>(w, vector<bool>(4, false)));
REP(i, h){
bool nowl = false;
bool nowr = false;
REP(j, w){
// from left
if(masu[i][j] == 1) nowl = true;
else if(masu[i][j] == -1) nowl = false;
hikari[i][j][0] = nowl;
// from right
if(masu[i][w-j-1] == 1) nowr = true;
else if(masu[i][w-j-1] == -1) nowr = false;
hikari[i][w-j-1][1] = nowr;
}
}
REP(j, w){
bool nowt = false;
bool nowb = false;
REP(i, h){
// from top
if(masu[i][j] == 1) nowt = true;
else if(masu[i][j] == -1) nowt = false;
hikari[i][j][2] = nowt;
// from bottom
if(masu[h-i-1][j] == 1) nowb = true;
else if(masu[h-i-1][j] == -1) nowb = false;
hikari[h-i-1][j][3] = nowb;
}
}
int cnt = 0;
REP(i, h)
REP(j, w){
if(hikari[i][j][0] || hikari[i][j][1] || hikari[i][j][2] || hikari[i][j][3])
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
long double n , m , cnt, ans , sum;
ll x , y , z;
ll a , b , c;
string s , s1;
char ch;
map<char , int>mp;
int main(){
cin >> n >> a >> b >> m;
if( m / n >= a and m / n <= b )
cout << "No";
else
cout << "Yes";
}
|
//I still luve you Kashish <3
#include<bits/stdc++.h>
using namespace std ;
#define int long long
#define pb push_back
#define F first
#define S second
#define P push
#define nl "\n"
#define vvi vector<vector<int>>
#define vi vector<int>
#define vc vector<char>
#define pii vector<pair<int, int>>
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define sort(v) sort(all(v))
#define sortr(v) sort(v); reverse(all(v));
#define yes cout << "YES"
#define no cout << "NO"
#define PeeleMera ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int N = 1e9 + 7 , N1 = 1e7 + 5 , N2 = 1e6 + 3, N3 = 1e5 + 3;
#define IM -1e18
#define IX 1e18
void solve()
{
string s;
cin>>s;
int n=sz(s);
vi v(26,0),v1(26,0);
int ans=0;
for(int i=n-1;i>0;i--)
{
if(s[i]==s[i-1])
{
ans+=n-i-1-v[s[i]-97];
// v.clear();
v=v1;
v[s[i]-97]+=n-i+1;
i--;
continue;
}
v[s[i]-97]++;
}
cout<<ans;
}
signed main(){
PeeleMera;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
// cin>>t;
// cout<<fixed<<setprecision(9);
while(t--)
{
solve();
cout<<endl;
}
} | //Hoang Vu - CVA-BD High School for Gifted Student
#include <bits/stdc++.h>
using namespace std;
//ifstream f1("test.inp");
//ofstream f2("test.out");
//#define cin f1
//#define cout f2
#define fu(i,a,b) for(ll i=a;i<=b;++i)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
#define FastIO ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define fa(i,s) for(auto i:s)
#define ll long long
#define ld long double
#define pb push_back
//#define mp make_pair
#define ii pair<ll,ll>
#define fi first
#define se second
#define MOD 1000000007
#define inf 10000000000000000
#define MAXN 3000005
ll n,a[MAXN],res=1,su=0;
map<ll,ll> mp;
set<ll> s;
void solve()
{
cin>>n;
fu(i,1,n)
{
cin>>a[i];
mp[a[i]]++;
s.insert(a[i]);
}
vector<int> save;
fa(i,s) save.pb(mp[i]);
//res=save[0];
su=save[0];
fu(i,1,save.size()-1)
{
res+=save[i]*su;
su+=save[i];
}
cout<<res-1;
}
int main()
{
FastIO
int t=1;
//cin>>t;
solve();
}
|
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) + (end) + 1, value)
#define fillvector(v, value) fill((v).begin(), (v).end(), value)
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
#define vecfirst (*vec.begin())
#define veclast (*vec.rbegin())
#define vecall(v) (v).begin(), (v).end()
#define vecupsort(v) (sort((v).begin(), (v).end()))
#define vecdownsort(v, type) (sort(vecall(v), greater<type>()))
#define veccmpsort(v, cmp) (sort(vecall(v), cmp))
using namespace std;
const int N = 500050;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
clock_t TIME__START, TIME__END;
void program_end()
{
#ifdef ONLINE
printf("\n\nTime used: %.6lf(s)\n", ((double)TIME__END - TIME__START) / 1000);
system("pause");
#endif
}
ll r1, c1, r2, c2;
inline void solve()
{
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2 && c1 == c2)
return puts("0"), void();
if ((r1 + c1 == r2 + c2) || (r1 - c1 == r2 - c2) || (abs(r1 - r2) + abs(c1 - c2) <= 3))
return puts("1"), void();
if (((r1 + c1) % 2 == (r2 + c2) % 2) || (abs(r1 - r2) + abs(c1 - c2) <= 6))
return puts("2"), void();
if (abs(r1 - r2) <= abs(c1 - c2))
{
int ans = min(abs(c1 - abs(r1 - r2) - c2), abs(c1 + abs(r1 - r2) - c2));
if (ans <= 3)
return puts("2"), void();
}
else
{
int ans = min(abs(r1 - abs(c1 - c2) - r2), abs(r1 + abs(c1 - c2) - r2));
if (ans <= 3)
return puts("2"), void();
}
puts("3");
}
int main()
{
TIME__START = clock();
int Test = 1;
// scanf("%d", &Test);
while (Test--)
{
solve();
// if (Test)
// putchar('\n');
}
TIME__END = clock();
program_end();
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <ctype.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vl = vector<ll>;
using vvl = vector<vl >;
using pairi = pair<int, int>;
using pairl = pair<ll, ll>;
#define TR ","
#define TS " "
#define rep(i,N) for(ll i=0;i<(ll)N;++i)
#define rpt(i,a,b) for(ll i=a;i<(ll)b;++i)
#define all(v) v.begin(), v.end()
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a, ll b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y) * y;
}
void printVector(const vector<ll>& vec) {
for (ll value : vec) {
cout << value << " ";
}
cout << endl;
}
vector<int> IntegerToVector(int bit, int N) {
vector<int> S;
for (int i = 0; i < N; ++i) {
if (bit & (1 << i)) {
S.push_back(i);
}
}
return S;
}
const int MAXN = 510000;
const int MOD = 1000000007;
long long fac[MAXN], finv[MAXN], inv[MAXN];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAXN; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(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;
}
int main() {
ll N, M, T;
cin >> N >> M >> T;
vi a(M), b(M);
ll y = N;
rep(i, M) cin >> a[i] >> b[i];
if (N <= a[0]) { cout << "No" << endl; return 0; }
y -= a[0];
rep(i, M-1) {
y = min(N, y + b[i] - a[i]);
if(y<=a[i+1]-b[i]) { cout << "No" << endl; return 0; }
y -= a[i + 1] - b[i];
}
y = min(N, y + b[M-1] - a[M-1]);
if (y <= T - b[M-1]) { cout << "No" << endl; return 0; }
cout << "Yes" << endl; return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int mn=5005;
int cnt[mn][5],ans;
int main()
{
int n;cin>>n;
char c;
for(int i=1;i<=n;++i) {
for(int j=1;j<=4;++j) cnt[i][j]=cnt[i-1][j];
c=getchar();
while(c!='A'&&c!='G'&&c!='C'&&c!='T') c=getchar();
if(c=='A') cnt[i][1]++;
if(c=='G') cnt[i][2]++;
if(c=='C') cnt[i][3]++;
if(c=='T') cnt[i][4]++;
}
for(int i=1;i<=n;++i)
for(int j=1;j<=i;++j) {
if(cnt[i][1]-cnt[j-1][1]==cnt[i][4]-cnt[j-1][4]&&
cnt[i][2]-cnt[j-1][2]==cnt[i][3]-cnt[j-1][3]) {
ans++;
}
}
cout<<ans;
} | // RAKSHIT KADAM
// rax_coder
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 3
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree< int , null_type , less<int> , rb_tree_tag , tree_order_statistics_node_update>
#warning check the size of arrays!!!
// NUMERIC DEFINITIONS :
#define INF 1000000000000000005
#define inf 1000000004
#define MOD 1000000007
#define mod 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long long
#define P(gg) for(auto rax:gg){cout<<rax<<" ";}cout<<endl;
#define Need_for_speed(activated) ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define satisfy ll ter; cin>> ter; while(ter--)
#define inp(n) int n;cin >> n
#define mp make_pair
#define pb push_back
#define endl "\n"
#define x first
#define y second
#define fore(i,a,b) for(ll i=a;i<b;i++)
#define forci(i,n) for(ll i=0;i<n;i++)
#define vi vector<ll>
#define Endl endl
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll,ll>
#define input freopen("input.txt", "r", stdin),freopen("output.txt", "w", stdout)
#define time cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;
ll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);}
int power(int x, unsigned int y, unsigned int m){ if (y == 0) return 1;int p = power(x, y/2, m) % m; p = (p * p) % m;return (y%2 == 0)? p : (x * p) % m;}
ll modInverse(int a, int m){{ return power(a, m-2, m);}}
const int maxn = 500003;
//ll fact[300009];
//ll modIN[100009];
//void facto()
//{
// ll lim =300005;fact[0]=1;
// for(ll i=1;i<lim;i++)
// {
// fact[i]=(fact[i-1]*i)%mod;
// }
//
//}
//ll ncr(ll a,ll b)
//{
// ll ret = 0;
// ret = fact[a]*(modInverse(fact[b],mod));
//
// ret%=mod;
// ret*=modInverse(fact[a-b],mod);
// ret%=mod;
//
// return ret;
//}
// """"" 1LL << x """""
void solve()
{
ll n;cin>>n;
string s;cin>>s;
ll ans = 0 ;
map<char,ll>m;
for(ll i=0;i<n;i++)
{
for(ll j=i;j<n;j++)
{
m[s[j]]++;
if(m['A']==m['T'] && m['C']==m['G'])ans++;
}
m.clear();
}
cout<<ans<<endl;
}
signed main(){
Need_for_speed(activated);
// satisfy
// {
// solve();
// }
//
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
int t = 1; //cin >> t;
while(t--){
int n,k; cin >> n >> k;
int time[n+1][n+1];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
cin >> time[i][j];
vector<int> p;
for(int i = 2; i <= n; i++)
p.push_back(i);
int ans = 0;
do
{
int res = 0;
int city = 1;
for(int x:p)
{
res += time[city][x];
city = x;
}
res += time[city][1];
if(res == k)
ans++;
} while(next_permutation(p.begin(),p.end()));
cout << ans;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<long long>> vvll;
typedef std::vector<bool> vb;
typedef std::vector<std::vector<bool>> vvb;
#define INF 1999999999
#define MODA 1000000007
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define rep1(i,n) for (long long i = 1; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
#define errvn1(x) cerr << #x <<" "<< x << endl;
#define errvn2(x, y) cerr << #x <<" "<< x <<" "<< #y <<" "<< y << endl;
#define errvn3(x, y, z) cerr << #x <<":"<< x <<" "<< #y <<":"<< y <<" "<< #z <<":"<< z << endl;
#define errvn4(x, y, z, a) cerr << #x <<":"<< x <<" "<< #y <<":"<< y <<" "<< #z <<":"<< z <<" "<< #a <<":"<< a << endl;
#define errop2(x, y) cerr << x <<" "<< y << endl;
#define errop3(x, y, z) cerr << x <<" "<< y <<" "<< z << endl;
#define errop4(x, y, z, a) cerr << x <<" "<< y <<" "<< z <<" "<< a << endl;
ll N, K;
vvll T;
ll ans = 0;
// usage:
// foreach_permutation<long long, long long>(n, [&](vector<long long> ind) {
// operations here;
// });
template<typename T1 = long long, typename T2 = long long>
void foreach_permutation(T1 n, std::function<void(vector<T2>)> func) {
vector<T2> indexes(n);
for (T2 i = 0; i < n; ++i) indexes[i] = i;
do {
func(indexes);
} while (std::next_permutation(indexes.begin(), indexes.end()));
}
int main() {
cin >> N >> K;
T.resize(N, vll(N));
rep(i,N) {
rep(j,N) {
cin >> T[i][j];
}
}
ans = 0;
foreach_permutation<long long, long long>(N, [&](vector<long long> ind) {
ll dist = 0;
if (ind[0] != 0) return;
for(ll i=0; i<N-1; ++i) {
dist += T[ind[i]][ind[i+1]];
cerr << ind[i];
}
cerr << endl;
dist += T[ind[N-1]][ind[0]];
if(dist == K) ans++;
});
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
using P = pair<int, int>;
struct E {
int to, co;
E(int to=0, int co=0):
to(to), co(co) {}
};
int main(){
int n, m;
cin >> n >> m;
vector<vector<E>> g(n);
rep(i, m){
int a, b, c;
cin >> a >> b >> c;
--a, --b;
g[a].emplace_back(b, c);
}
const int INF = 1001001001;
rep(sv, n){
vector<int> dist(n, INF);
priority_queue<P, vector<P>, greater<P>> q;
auto push = [&](int v, int d){
if(dist[v] <= d) return;
dist[v] = d;
q.emplace(d, v);
};
for (auto&& e: g[sv]) push(e.to, e.co);
while(!q.empty()){
int d = q.top().first;
int v = q.top().second;
q.pop();
if(dist[v] != d) continue;
for (auto&& e : g[v]){
push(e.to, d+e.co);
}
}
int ans = dist[sv];
if (ans == INF) ans = -1;
cout << ans << endl;
}
} | // author : sharad12arse
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define INF LONG_LONG_MAX
#define gcd __gcd
const long mxN=2001;
const ll ax=1e12;
ll n,m;
vector<pair<ll,ll> > adj[mxN];
vector<ll> vst(mxN),dst(mxN);
ll bfs(ll x){
priority_queue<pair<ll,ll>,vector<pair<ll,ll> > ,greater<pair<ll,ll> > > pq;
pq.push({0,x});
int u,v;
while(pq.size()){
// cout<<pq.size()<<"\n";
u=pq.top().second;
v=pq.top().first;
pq.pop();
for(int i=0;i<adj[u].size();i++){
// cout<<v+adj[u][i].second<<" "<<dst[adj[u][i].first]<<"\n";
if((v+adj[u][i].second)<dst[adj[u][i].first]){
dst[adj[u][i].first]=v+adj[u][i].second;
pq.push({v+adj[u][i].second,adj[u][i].first});
}
}
}
return dst[x];
}
void solve(){
cin>>n>>m;
ll u,v,w;
for(int i=0;i<m;i++){
cin>>u>>v>>w;
adj[u].push_back({v,w});
}
vector<ll> ans(n+1);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
dst[j]=ax;
}
ll y=bfs(i);
if(y>=ax){
ans[i]=-1;
}else{
ans[i]=y;
}
}
for(int i=1;i<=n;i++){
cout<<ans[i]<<"\n";
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
// cin>>t;
while(t--)
solve();
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n,m,k;
vector<pair<int,int>> v;
vector<pair<int,int>> item;
int dish[105];
int ans = 0;
void chk(){
int result = 0;
for(int i=0;i<m;i++){
if(dish[v[i].first]>0&&dish[v[i].second]>0) result++;
}
ans = max(ans,result);
}
void dfs(int idx){
if(idx==k){
chk();
return;
}
dish[item[idx].first]++;
dfs(idx+1);
dish[item[idx].first]--;
dish[item[idx].second]++;
dfs(idx+1);
dish[item[idx].second]--;
}
int main(void){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
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 c,d;
cin >> c >> d;
item.push_back({c,d});
}
dfs(0);
cout << 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 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 long long
#define ld long double
#define vi vector <int>
#define vb vector<bool>
#define vvi vector <vector<int>>
#define vvb vector <vector<bool>>
#define vvvi vector <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 = 3e5 + 5;
void run_case() {
int n;
ld D, H;
cin >> n >> D >> H;
ld ans = 0;
for (int i = 0; i < n; i++) {
int d, h;
cin >> d >> h;
ld x = (ld)H - ((ld)(H - h) / (D - d)) * D ;
if (x > ans )ans = x;
}
cout << fs(20) << ans << endl;
}
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;
for (int i = 1; i <= t; i++) {
//cout << "case #" << i << ": " ;
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
*/ |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
ll mod = 1000000007;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
int f(int n)
{
if(n == 1) return 1;
return n*f(n-1);
}
int C(int n,int r)
{
return (f(n)/(f(n-r)*f(r)));
}
void solve()
{
int x,a=0,b=0;
string s;
cin>>s;
for(int i=0;i<10;i++)
{
if(s[i] == 'o')
{
a++;
}
if(s[i] == '?')
{
b++;
}
}
if(a<=4)
{
if(a == 0)
{
cout<<pow(b,4);
}
else if(a == 1)
{
cout<<pow(b+1,4)-pow(b,4);
}
else if(a == 2)
{
cout<<C(b,2)*24+b*12+(f(4)*b)+14;
}
else if(a == 3)
{
cout<<(f(4)*b)+3*12;
}
else
{
cout<<f(4);
}
}
else
{
cout<<0;
}
}
int main()
{
fast_cin();
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set <int>
#define sll set <ll>
#define spii set <pii>
#define vs vector <string>
#define vpii vector <pair <int, int> >
#define vpll vector <pair <long long, long long> >
#define vvi vector <vector <int> >
#define vvpii vector <vector <pii > >
#define vb vector <bool>
#define vvb vector <vb>
#define mp make_pair
#define vvll vector <vll>
#define vsi vector <si>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MANX MAXN
#define itn int
#define dbg(x); {cout<<#x<<"="<<x<<", ";}
#define in(x); { for (auto &to : x) cin>>to;}
#define out(x); { for (auto &to : x) cout<<to<<" ";cout<<'\n'; }
const ll INFLL = 1e18;
const int MAXN = 1e6+100;
const ll INF = 1e9;
const int mod1 = 1e9+7;
const int mod2 = 1e9+21;
ll lcm(ll a,ll b)
{
return a*b/__gcd(a,b);
}
void solve()
{
// for (int i=2;i<=30;i++) {
int n;
cin >> n;
// n=i;
ll x = 1;
for (int i = 2; i <= n; i++)
x = lcm(x, i);
assert(x+1<=1e13);
cout << x + 1 << '\n';
// }
}
int main() {
#ifdef Mip182
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
#ifdef Mip182
freopen("a.in", "r", stdin);
#endif
int _t;
_t=1;
// cin>>_t;
while (_t--)
solve();
#ifdef Mip182
cout<<'\n'<<"Time : "<<(double)(clock())/CLOCKS_PER_SEC<<'\n';
#endif
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int 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;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i = 0; i < (n); i++)
int s(int n) {
int res = 0;
while(n) {
res += n%10;
n /= 10;
}
return res;
}
int main() {
int a, b;
cin >> a >> b;
int ans = max(s(a), s(b));
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define PI double(2 * asin(1.0))
#define ll long long
#define MOD 1000000007
#define INF 1e15
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
ll a[n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
a[i] %= 200;
}
unordered_map<int, int> umap;
int64_t cnt = 0;
for (int i = 0; i < n; ++i)
umap[a[i] - 200]++;
for (auto x : umap)
{
cnt += ((long long)x.second * (x.second - 1)) / 2;
}
cout << cnt << endl;
return 0;
} | #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 INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007 //10^9+7:合同式の法
#define pb push_back
#define F first
#define S second
typedef long long ll;
//sort(all(a)); ソート
//sort(all(a),greater<int>()); 逆順ソート
//a.erase(unique(all(a)), a.end()); ソート後に重複を削除
//cout<< std::fixed << std::setprecision(15)<<0.000001<<endl; 小数点以下を表示させる
//vector<vector<int>> data(3, vector<int>(4)); int型の2次元配列(3×4要素の)の宣言
int main() {
ll n;
cin>>n;
vector<ll> amari(200);
ll aaa;
rep(i,0,n){
cin>>aaa;
amari.at(aaa%200)++;
}
ll ans=0;
rep(i,0,200){
//cout<<amari.at(i)<<" ";
ans+=((amari.at(i)-1)*amari.at(i))/2;
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
#define clear(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define fornext(x, i) for(int i = head[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define mset(a, b) memset(a, b, sizeof(a))
#define Rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define dRep(i, a, b) for(int i = (a); i >= (b); --i)
#define IOset(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout);
#define int ll
#define un unsigned
#define ll long long
#define db double
#define dbg cout<<"c "
template<typename _T>
inline void rd(_T &dig) {
int flg; char c;
flg = dig = 0;
while (c = getchar(), !isdigit(c)) if (c == '-') flg = 1;
while (isdigit(c)) dig = dig * 10 + c - '0', c = getchar();
if (flg) dig = -dig;
}
template <typename _T, typename ...Args>
inline void rd(_T &dig, Args &...args) {
rd(dig);
rd(args...);
}
const int N = 505;
int f[N][N], g[N], a[N], b[N], ty[N], n, ex[N], id[N]; //-1~1 / 0
void no() {
puts("No");
exit(0);
}
signed main() {
rd(n);
Rep(i, 1, n) {
rd(a[i], b[i]);
if (a[i] != -1 && b[i] != -1 && a[i] >= b[i]) no();
if (a[i] != -1) {
if (ex[a[i]]) no();
ex[a[i]] = 1;
ty[a[i]] = -1;
id[a[i]] = i;
}
if (b[i] != -1) {
if (ex[b[i]]) no();
ex[b[i]] = 1;
ty[b[i]] = 1;
id[b[i]] = i;
}
}
n *= 2;
/*
Rep(i, 2, (n + 2) / 2) {
Rep(j, 1, n + 3 - 2 * i) {
Rep(k, j, j + i - 2) {
if (id[k]) {
if (ty[k] == 1 || (b[id[k]] != -1 && b[id[k]] != k + i - 1)) {
f[j][i] = -1;
break;
}
}
if (id[k + i - 1]) {
if (ty[k + i - 1] == -1 || (a[id[k + i - 1]] != -1 && a[id[k + i - 1]] != k)) {
f[j][i] = -1;
break;
}
}
}
}
}*/
int l, r;
Rep(i, 1, n) Rep(j, 1, i) f[i][j] = -1;
Rep(i, 1, n) Rep(j, i + 1, n) {
if (j - i + 1 % 2 == 1) {
f[i][j] = -1;
continue;
}
l = (j-i + 3) / 2;
Rep(k, i, i + l - 2) {/*
if (id[k]) {
if (ty[k] == -1 && ((b[id[k]] == -1 && !id[k + l - 1]) || b[id[l]] == k + l - 1));
else f[i][j] = -1;
}
if (id[r]) {
if (ty[r] == 1 && ((a[id[r]] == -1 && !id[k]) || a[id[r]] == k));
else f[i][j] = -1;
}*/
r = k + l - 1;
if(id[k] && id[r] && id[k]!=id[r]) f[i][j]=-1;
if(id[k] && !id[r]&&(ty[k]!=-1||b[id[k]]!=-1)) f[i][j]=-1;
if(id[r] && !id[k]&&(ty[r]!=1||a[id[r]]!=-1)) f[i][j]=-1;
}
}
g[0] = 1;
Rep(i, 1, n) {
Rep(j, 0, i - 2) if (g[j] && (f[j + 1][i] != -1)) g[i] = 1;
}
if (g[n]) puts("Yes");
else puts("No");
return 0;
}
| #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int n;
int p[201];
vector<pair<int,int> > v;
map<pair<int, int>, int > mp;
bool solve(int le, int ri){
if(mp[{le, ri}] == 1) return true;
else if(mp[{le, ri}] == -1) return false;
bool ret = false;
for(int i=le + 1; i <= ri - 2;i += 2){
if(solve(le, i) && solve(i+1, ri)) ret = true;
}
if(ret){
mp[{le, ri}] = 1;
return true;
}
int m = ri - le + 1;
m /= 2;
ret = true;
for(int i = le ; i < le + m ;i++){
if(p[i] == -1){
if(p[i+m] == -1){
continue;
}
else{
if(v[p[i+m]].first != -1 && v[p[i+m]].first != i) ret = false;
if(v[p[i+m]].second != -1 && v[p[i+m]].second != i+m) ret = false;
}
}else{
if(p[i+m] == -1){
if(v[p[i]].first != -1 && v[p[i]].first != i) ret = false;
if(v[p[i]].second != -1 && v[p[i]].second != i+m) ret = false;
}
else{
if(p[i] != p[i+m]) ret = false;
if(v[p[i]].first != -1 && v[p[i]].first != i) ret = false;
if(v[p[i]].second != -1 && v[p[i]].second != i+m) ret = false;
}
}
}
if(ret){
mp[{le, ri}] = 1;
return true;
}else{
mp[{le, ri}] = -1;
return false;
}
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
int a, b;
bool ok = true;
memset(p, -1, sizeof(p));
for(int i=0;i<n;i++){
cin >> a >> b;
if(a != -1){
if(p[a] != -1){
ok = false;
}
p[a] = i;
}
if(b != -1){
if(p[b] != -1 || b < a){
ok = false;
}
p[b] = i;
}
v.push_back({a, b});
}
if(!ok){
cout << "No" << endl;
return 0;
}
if(solve(1, n*2)) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const long long maxn=330;
long long n,f[maxn][maxn]={};
int main(){
scanf("%lld",&n);
f[0][0]=1;for(long long i=1;i<=n;i++){f[i][0]=1;for(long long j=1;j<=i;j++)f[i][j]=f[i-1][j-1]+f[i-1][j];}
printf("%lld",f[n-1][11]);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
int main() {
int N; cin >> N;
vector<LL> fact(N + 1);
set<LL> s;
for (int i = 2; i <= 11; ++i) s.insert(i);
for (LL i = 0; i <= N-12; ++i) fact[i] = 1;
for (LL i = N-11; i < N; ++i) {
LL k = i;
for (LL x : s) {
if (k % x == 0) {
k /= x;
s.erase(x);
}
}
fact[i] = k * fact[i-1];
}
for (auto x : s) {
fact[N-1] /= x;
}
cout << fact[N-1] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using uint=unsigned int;
using ull=unsigned long long;
const ll LL_MAX=LLONG_MAX;
class union_find{
private:
vector<ll> par;
vector<ll> siz;
public:
union_find(ll n) : par(n),siz(n,1LL){
for (ll i=0;i<n;i++) par[i]=i;
}
ll root(ll x){
ll i=x;
queue<ll> line;
while(i!=par[i]){
line.push(i);
i=par[i];
}
ll l=line.size();
for (ll j=0;j<l;j++){
par[line.front()]=i;
line.pop();
}
return i;
}
ll size(ll x){
return siz[root(x)];
}
bool unite(ll x,ll y){
x=root(x);
y=root(y);
if (x==y) return false;
if (size(x)<size(y)){
par[x]=y;
siz[y]+=siz[x];
}
else{
par[y]=x;
siz[x]+=siz[y];
}
return true;
}
bool same(ll x,ll y){
if (root(x)==root(y)) return true;
else return false;
}
};
struct In{
template<typename T>
operator T(){
T x;
cin >> x;
return x;
}
};
In in;
template <typename T,typename U>
void forin(T* x,U n){
for (U i=0;i<n;i++) cin >> x[i];
}
template <typename T>
void outl(T x){
cout << x << endl;
}
template < >
void outl<int>(int x){
printf("%d\n",x);
}
template < >
void outl<double>(double x){
printf("%.16lf\n",x);
}
template < >
void outl<char>(char x){
printf("%c\n",x);
}
template < >
void outl<string>(string x){
printf("%s\n",x.c_str());
}
template < >
void outl<uint>(uint x){
printf("%u\n",x);
}
template < >
void outl<ll>(ll x){
printf("%lld\n",x);
}
template < >
void outl<ull>(ull x){
printf("%llu\n",x);
}
void outl(){
printf("\n");
}
template <typename T>
void out(T x){
cout << x << flush;
}
template < >
void out<int>(int x){
printf("%d",x);
}
template < >
void out<char>(char x){
printf("%c",x);
}
template < >
void out<double>(double x){
printf("%.16lf",x);
}
template < >
void out<string>(string x){
printf("%s",x.c_str());
}
template < >
void out<uint>(uint x){
printf("%u",x);
}
template < >
void out<ll>(ll x){
printf("%lld",x);
}
template < >
void out<ull>(ull x){
printf("%llu",x);
}
void outyes(){
printf("Yes\n");
}
void outno(){
printf("No\n");
}
void outyn(bool x){
if (x) printf("Yes\n");
else printf("No\n");
}
void outsp(){
printf(" ");
}
template <typename T>
T gcd(T x,T y){
if (y == 0) return x;
return gcd(y,x%y);
}
template <typename T>
T lcm(T x,T y){
return x*y/gcd(x,y);
}
template <typename T>
T npr(T x,T y){
T loop=max(x-y,y),ans=1;
for (T i=loop;i<=x;i++){
ans*=i;
}
return ans;
}//xPy
template <typename T>
T ncr(T x,T y){
T loop=min(x,x-y),ans=npr(x,y);
for (T i=1;i<=loop;i++){
ans/=i;
}
return ans;
}//xCy
template <typename T>
T fac(T x){
if (x==1) return 1;
return x*fac(x-1);
}
void div1(ll &x) {
x%=1000000007;
}
ll mypow(ll x,ll n){
ll ans=1;
for (ll i=1;i<=n;i = i<<1){
if ((n & i)== i){//ループj回目で2進表記のときにj桁目が1かどうか判定
ans*=x;
}
x*=x;
}
return ans;
}
ll divpow(ll x,ll n){
ll ans=1;
div1(x);
for (ll i=1;i<=n;i = i<<1){
if ((n & i)== i){//ループj回目で2進表記のときにj桁目が1かどうか判定
ans*=x;
div1(ans);
}
x*=x;
div1(x);
}
return ans;
}
int main(){
ll n=in,k=in;
for (int i=0;i<k;i++){
if (n%200==0) n/=200;
else n=n*1000+200;
}
outl(n);
} | ///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 3e5 + 10;
ll n, cnt;
string s, t;
int main(){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
/*
cin >> n >> s >> t;
for(int i = 0; i < n; i ++){
cnt += (s[i] == '0');
cnt -= (t[i] == '0');
}
if(cnt != 0){
return cout << -1, 0;
}
*/
cin >> n;
ll ans = n;
for(int i = 0; (1LL << i) <= n; i ++){
ll b = i, val = (1LL << i);
ll a = n / val, c = n - a * val;
ans = min(ans, a + b + c);
}
cout << ans << '\n';
return 0;
}
/*!
HE'S AN INSTIGATOR,
ENEMY ELIMINATOR,
AND WHEN HE KNOCKS YOU BETTER
YOU BETTER LET HIM IN.
*/
//! N.N
|
#include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);}
const int N=200005;
typedef long long ll;
int a[N];
int main(){
int n;read(n);
int mx=0;
ll s=0,S=0;
for(int i=1;i<=n;++i){
read(a[i]),mx=std::max(a[i],mx);
s+=a[i],S+=s;
printf("%lld\n",S+1LL*i*mx);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) begin(v), end(v)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using Graph = vector<vector<int>>;
ll ll_pow(ll a, ll n) {
ll ans = 1;
for(ll i = 0; i < n; i++) ans *= a;
return ans;
}
vector<vector<int>> G;
bool temp[100001];
void dfs(int v){
if(temp[v]) return;
temp[v] = true;
for(auto vv:G[v]) dfs(vv);
}
int main() {
double n;
cin >> n;
if(n*1.08 >= 206 && n*1.08 < 207) cout << "so-so" <<endl;
else if(n*1.08 < 206) cout << "Yay!" <<endl;
else cout <<":(" <<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define read1(v,n) for(int i=1;i<=n;i++)cin>>v[i];
#define trav(a,x) for (auto& a: x)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define cut(x) {cout<<x;return 0;}
#define print(x) {cout<<x<<nl;continue;}
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORB(i,a,b) for(int i=a;i>=b;i--)
#define err1(a) {cout<<#a<<' '<<a<<nl;}
#define err2(a,b) {cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<nl;}
#define mem(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define nl '\n'
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
ll gcd(ll a, ll b)
{
if (b==0)return a;
return gcd(b, a % b);
}
ll lcm(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
ll bpow(ll a, ll b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%MOD;
b/=2;
a=(a*a)%MOD;
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
ll k,n,m;
cin>>k>>n>>m;
vec a(k),b(k);
read0(a,k);
FOR(i,0,k-1)a[i]*=m;
ll tot=0;
set<pll> diff;
FOR(i,0,k-1)
{
b[i]=a[i]/n;
tot+=b[i];
diff.insert({a[i]-b[i]*n,i});
}
tot=m-tot;
while(tot--)
{
pll p=*diff.rbegin();
diff.erase(prev(diff.end()));
b[p.sc]++;
}
trav(it,b)cout<<it<<' ';cout<<nl;
}
| #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;
int K, N, M;
int A[101010];
i64 rceil(i64 a, i64 b) {
if (a < 0) return 0;
return (a - 1) / b + 1;
}
vector<i64> solve(i64 df) {
vector<i64> low, high;
for (int i = 0; i < K; ++i) {
// -df <= N * x - M * A[i] <= df
low.push_back(rceil((i64)M * A[i] - df, N));
high.push_back(((i64)M * A[i] + df) / N);
}
i64 ls = 0, hs = 0;
for (int i = 0; i < K; ++i) {
if (low[i] > high[i]) return {};
ls += low[i];
hs += high[i];
}
if (!(ls <= M && M <= hs)) return {};
i64 ext = M - ls;
vector<i64> ret;
for (int i = 0; i < K; ++i) {
i64 v = low[i] + min(high[i] - low[i], ext);
ext -= v - low[i];
ret.push_back(v);
}
return ret;
}
int main()
{
scanf("%d%d%d", &K, &N, &M);
for (int i = 0; i < K; ++i) scanf("%d", A + i);
i64 lf = 0, rg = 1LL << 60LL;
while (lf < rg) {
i64 mid = (lf + rg) / 2;
if (solve(mid).size() > 0) {
rg = mid;
} else {
lf = mid + 1;
}
}
auto ans = solve(lf);
for (int i = 0; i < K; ++i) printf("%lld%c", ans[i], i == K - 1 ? '\n' : ' ');
return 0;
}
|
#include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "
#define maxn 10010
void setIO(string name) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
template< typename T>
void PVecPrint(vector<T>&v)
{
for(int i=0;i<(int)v.size();i++)
cout << v[i].first << "," << v[i].second << ' ';
cout << '\n';
}
template<class T>
void VecPrint(vector<T>&v)
{
for(int i=0;i<v.size();i++)
cout << v[i] << ' ';
cout << '\n';
}
/*-------------------------------------------------------------------Code-----------------------------------------------------------------*/
int main()
{
int n;
cin >> n;
n-=3;
vector<int>v{6,10,15};
int t=12;
set<int>s;
while (t<10000 and n>0)
{
v.push_back(t);
s.insert(t);
n-=1;
t+=6;
}
// cout << n << ' ' << s.size() << ' ' << v.size() << '\n';
t=20;
while (t<10000 and n>0)
{
if(s.find(t)==s.end())
{
v.push_back(t);
s.insert(t);
n-=1;
}
t+=10;
}
// cout << n << ' ' << s.size() << ' ' << v.size() << '\n';
t=30;
while (t<10000 and n>0)
{
if(s.find(t)==s.end())
{
v.push_back(t);
s.insert(t);
n-=1;
}
t+=15;
}
// cout << s.size() << ' ' << v.size() << '\n';
// cout << n << '\n';
VecPrint<int>(v);
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define all(v) v.begin(),v.end()
const int mod = 1e9 + 7;
int main (){
fast_io;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
a[i] = 1;
a[0] = 3 * 5;
a[n - 1] = 2 * 5;
map<int, int> freq;
for (int i = 0; i < n; i++) {
freq[a[i]]++;
}
for (int i = 0; i < n - 1; i++) {
if (freq[a[i]] > 1 || a[i] == 1) {
for (int j = 2; j <= 10000; j++) {
if (j % 10 && j % 6 && j % 15)
continue;
if (freq.count(j) == 0) {
freq[j]++;
freq[a[i]]--;
a[i] = j;
break;
}
}
}
}
for (auto it: freq) {
assert(it.second < 2);
}
for (int i = 0; i < n; i++)
cout << a[i] << ' ';
cout << endl;
}
|
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
signed main() {
ll N, K;
cin >> N >> K;
rep(i,K)
{
if(N % 200 == 0)
{
N /= 200;
}
else
{
string s = to_string(N) + "200";
N = stoll(s);
}
}
cout << N << endl;
} | #include <iostream>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <cassert>
#include <functional>
#include <iomanip>
#include <unordered_set>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int gcd(ll x, ll y) {
if(x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
int main(){
ll n,k;
cin >> n >> k;
string s;
for(int i = 0; i< k; i++){
if(n%200 == 0) n/=200;
else {
s = to_string(n);
s += "200";
n = stoll(s);
}
}
cout << n << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<string> S(N);
for (string& s : S) {
cin >> s;
}
vector<int64_t> reached_num(N, 0);
for (int64_t i = 0; i < N; i++) {
//iからスタートして到達できるところに到達回数+1をしていく
vector<bool> curr_reach(N, false);
stack<int64_t> st;
st.push(i);
while (!st.empty()) {
int64_t top = st.top();
st.pop();
if (curr_reach[top]) {
continue;
}
curr_reach[top] = true;
for (int64_t j = 0; j < N; j++) {
if (S[top][j] == '1' && !curr_reach[j]) {
st.push(j);
}
}
}
for (int64_t j = 0; j < N; j++) {
if (curr_reach[j]) {
reached_num[j]++;
}
}
}
double ans = 0;
for (int64_t i = 0; i < N; i++) {
ans += 1.0 / reached_num[i];
}
cout << setprecision(10) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
inline int mrand(int k) {return abs((int) mt()) % k;}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";
void chemthan() {
int n; cin >> n;
vector<string> s(n);
FOR(i, 0, n) cin >> s[i];
vector<vi> g(n, vi(n));
FOR(i, 0, n) g[i][i] = 1;
FOR(i, 0, n) FOR(j, 0, n) if (i != j) {
g[i][j] = s[i][j] == '1';
}
FOR(k, 0, n) FOR(i, 0, n) FOR(j, 0, n) {
g[i][j] |= g[i][k] & g[k][j];
}
double res = 0;
FOR(i, 0, n) {
int num = 0;
FOR(j, 0, n) if (i ^ j) {
if (g[j][i]) {
num++;
}
}
res += 1.0 / (num + 1);
}
cout << prec(9) << res << "\n";
}
int32_t main(int32_t argc, char* argv[]) {
ios_base::sync_with_stdio(0), cin.tie(0);
if (argc > 1) {
assert(freopen(argv[1], "r", stdin));
}
if (argc > 2) {
assert(freopen(argv[2], "wb", stdout));
}
chemthan();
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define reps(i,s,n) for(int i=s; i<n; i++)
#define per(i,n) for(int i=n-1; i>=0; i--)
#define pers(i,n,s) for(int i=n-1; i>=s; i--)
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#define lb(v,n) lower_bound(all(v),n)
#define lbi(v,n) int(lower_bound(all(v),n) - v.begin())
#define ub(v,n) upper_bound(all(v),n)
#define ubi(v,n) int(upper_bound(all(v),n) - v.begin())
#define mod 1000000007
#define infi 1010000000
#define infl 1100000000000000000
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define IN(n,m,v) rep(i,n) rep(j,m){cin >> v[i][j];}
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;
template<typename T> bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}
template<typename T> bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}
void solve(){
int N,M;
cin >> N >> M;
ve<pair<int,string>> A(M);
rep(i,M){
string s;
cin >> s;
A[i].fi = si(s);
A[i].se = s;
}
sort(all(A));
//rep(i,M) cout << A[i].se << endl;
ve<ve<char>> G(N,ve<char>(N,'A'));
int t = 0;
int id = 0;
string s = "";
rep(i,N){
t = 0;
while (t < N) {
id = -1;
int ns = 0;
while (si(s) > 0) {
ns = si(s);
rep(j,M) if(A[j].fi > 0 && ns <= A[j].fi && A[j].fi-ns <= N-t){
if(s == A[j].se.substr(0,ns)){
id = j;
break;
}
}
if(id >= 0) break;
if(si(s) == 1){
s = "";
break;
}
s = s.substr(1,si(s)-1);
}
ns = si(s);
if(id == -1){
rep(j,M) if(A[j].fi > 0 && A[j].fi-ns <= N-t){
id = j;
break;
}
}
s = "";
if(N-t >= A[id].fi-ns){
reps(j,ns,A[id].fi) G[i][t] = A[id].se[j], t++, s += A[id].se[j];
A[id].fi = -1;
id = -1;
}else{
t = 0;
break;
}
if(si(s) == 0) t++;
}
}
rep(i,N) {
rep(j,N) cout << G[i][j];
cout << endl;
}
//id = 0;
//rep(j,M) if(A[j].fi < 0) id++;
//cout << id csp M << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
//int ti = clock();
solve();
//cout << "Execution Time:" << 1.0 * (clock() - ti) / CLOCKS_PER_SEC << "sec" << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
/*"itob" int to "N"base */ template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
/*"chmin" a = MAX*/ template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
/*"chmax" a = MIN*/ template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
/*"ctoi" char to int*/ int ctoi(char c) {return c-'0';}
/*"gcd" MAX Euclidean */ ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
/*"lcm" MIN*/ ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
/*"primecheck"If prime,return true.*/bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
srand(time(NULL));
ll n,m;
cin >> n >> m;
vector<string>che(m);
string ra ="ABCDEFGH";
for(int i=0;i<m;i++){
cin>>che.at(i);
}
sort(che.begin(),che.end());
ll check =0;
for(int i=0;i<n;i++){
string d;
while(d.size()<n){
if(d.size()+che.at(check).size()>n){
while(d.size()<n){
d+='.';
}
break;
}
d+=che.at(check);
check++;
}
if(d.size()>n){
string g;
for(int j=0;j<n;j++){
g+=d.at(j);
}
d=g;
}
cout<<d<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
pair<int, int> l, r;
for (int i = 0; i < (1 << (n - 1)); ++i) {
int a;
cin >> a;
l = max(l, make_pair(a, i));
}
for (int i = 0; i < (1 << (n - 1)); ++i) {
int a;
cin >> a;
r = max(r, make_pair(a, (1 << (n - 1)) + i));
}
if (l.first > r.first) {
cout << r.second + 1 << "\n";
} else {
cout << l.second + 1 << "\n";
}
return 0;
}
| #include<bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define DEBUG
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout <<"DEBUG VAL " << a << ":" << b << endl;}while(0)
#else
#define DEBUG_PRINT(...)do{}while(0);
#define DEBUG_VAL(a, b)do{}while(0);
#endif
using namespace std;
//using namespace atcoder;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
int n;
cin >> n;
pair<ll, int> a{0, -1};
pair<ll, int> b{0, -1};
rep(i, pow(2, n-1)){
ll v;
cin >> v;
if(a.first < v){
a.first = v;
a.second = i+1;
}
}
rep(i, pow(2, n-1)){
ll v;
cin >> v;
if(b.first < v){
b.first = v;
b.second = i+1+pow(2, n-1);
}
}
cout << min(a, b).second << endl;
} |
/*...................................................................*
*............___..................___.....____...______......___....*
*.../|....../...\........./|...../...\...|.............|..../...\...*
*../.|...../.....\......./.|....|.....|..|.............|.../........*
*....|....|.......|...../..|....|.....|..|............/...|.........*
*....|....|.......|..../...|.....\___/...|___......../....|..___....*
*....|....|.......|.../....|...../...\.......\....../.....|./...\...*
*....|....|.......|../_____|__..|.....|.......|..../......|/.....\..*
*....|.....\...../.........|....|.....|.......|.../........\...../..*
*..__|__....\___/..........|.....\___/...\___/.../..........\___/...*
*...................................................................*
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt=1;
//cin >> tt;
while(tt--)
{
int n;
cin >> n;
set<int> s;
s.insert(6);
s.insert(10);
s.insert(15);
for(int i=2;i<=10000/6;i++)
{
if(s.size()==n)
break;
s.insert(6*i);
}
for(int i=2;i<=10000/10;i++)
{
if(s.size()==n)
break;
s.insert(10*i);
}
for(int i=2;i<=10000/15;i++)
{
if(s.size()==n)
break;
s.insert(15*i);
}
assert(s.size()==n);
for(auto it=s.begin();it!=s.end();it++)
cout << *it << " ";
cout << '\n';
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define ll long long
using namespace std;
using namespace __gnu_pbds;
ll int mod=1e9+7;
typedef tree<ll int, null_type, less<ll int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll int mul(ll int x, ll int y)
{
return (x * 1ll * y) % mod;
}
ll int add(ll int x,ll int y)
{
x += y;
while(x >= mod) x -= mod;
while(x < 0) x += mod;
return x;
}
long long power(long long a, long long 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%m;
}
void query(ll int t,ll int i,ll int j,ll int x)
{
cout<<"? "<<t<<" "<<i<<" "<<j<<" "<<x<<endl;
cout.flush();
}
vector<ll int> pr;
bool prime[10000000];
void Sieve(ll int n)
{
memset(prime, true, sizeof(prime));
prime[1]=false;
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
pr.push_back(p);
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
}
int main() {
IOS;
ll int n;
cin>>n;
cout<<6<<" "<<10<<" "<<15<<" ";
n-=3;
map<int,int>mp;
for(int i=2;i*6<=10000 && n>0;i++)
{
if(mp.count(6*i))
continue;
cout<<6*i<<" ";
mp[6*i]++;
n--;
}
for(int i=2;i*10<=10000 && n>0;i++)
{
if(mp.count(10*i))
continue;
cout<<10*i<<" ";
mp[10*i]++;
n--;
}
for(int i=2;i*15<=10000 && n>0;i++)
{
if(mp.count(15*i))
continue;
cout<<15*i<<" ";
mp[15*i]++;
n--;
}
cout<<endl;
}
|
#include<bits/stdc++.h>
// no of bits to store no 2e5 is 19
// 2e5 ka 5 times square root lene se 2 or 3 ke pass pahunch jate hai
using namespace std;
#define int long long
#define mod 998244353
#define MOD 998244353
#define MAX 1000000000
#define inf 2e18
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define mii map<int, int>
#define all(x) (x).begin(), (x).end()
#define fill(a,b) memset(a, b, sizeof(a))
#define sp(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcount(x)
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ll long long
// powermod(a,b,m) == powermod(a,b%(m-1),m) when m is prime fermat's theorem a^(p-1) %p=1 p is prime
int powermod(int a,int b,int c) // gives (a^b)%c
{
int ans = 1,tempans=a%c;
while(b>0)
{
if((b&1)==1)
{
ans=(ans*tempans)%c;
}
tempans=(tempans*tempans)%c;
b=b>>1;
}
return ans;
}
int modinverse(int a,int m) // gives a inverse wrt m and m is prime
{
return powermod(a,m-2,m);
}
ll add(ll x, ll y) {
x += y;
if (x >= mod) return x - mod;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0) return x + mod;
return x;
}
ll mult(ll x, ll y) {
return (x * y) % mod;
}
// my template m
// prime factorization pf
// ncr and factorials ncr
// matrix exponentiation of fibonacci series in log(n) matexpofib
// cycles in a graph cycle
// prime factorization in log(n) spf
// disjoint set union dsu
int spf[200005];
void pre() // call it in main
{
spf[0]=1;
spf[1]=1;
for(int i=2;i<=2e5;i++){
spf[i]=i;
}
for(int i=2;i*i<=2e5;i++){
if(spf[i]==i){
for(int j=i*i;j<=2e5;j+=i){
if(spf[j]==j){
spf[j]=i;
}
}
}
}
}
int fact[2000005],inversefact[2000005];
void precomputations(int n) // is function ko main main ek bar call kr do
{
fact[0]=1;
inversefact[0]=1;
for(int i=1;i<n;i++)
{
fact[i]=(fact[i-1]*i)%MOD;
inversefact[i]=(inversefact[i-1]*modinverse(i,MOD))%MOD;
}
}
int ncr(int n,int r)
{
if(n==r|r==0)
return 1;
if(r>n)
return 0;
if(n<0)
return 0;
int temp= fact[n];
temp= (temp*inversefact[r])%MOD;
temp=(temp*inversefact[n-r])%MOD;
return temp;
}
void solve()
{
int n,m;
cin>>n>>m;
int ans =0;
for(int i=1;i<=m;i++)
{
int z=i;
int temp=1;
while(z!=1) // in solve function
{
int k = z,cnt=0;
while(k%spf[z]==0)// (n-1+cnt)
{
cnt++;
k/=spf[z];
}
temp= mult(temp,ncr(n-1+cnt,n-1));
z=k;
}
//cout<<i<<" "<<temp<<" "<<endl;
ans=add(ans,temp);
}
cout<<ans;
}
int32_t main()
{
fast_in_out;
int t=1;//cin>>t;
int count=0;
pre();precomputations(2000005);
while(t--)
{
count++;
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
for (auto i : x) cout << i << ' ';\
cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
return o >> a.X >> a.Y;
}
const int mod = 998244353, abc = 864197532, N = 300101, logN = 19, K = 333;
lli modpow(lli a, int b) {
lli ans = 1;
for (; b; b >>= 1, a = a * a % mod) {
if (b & 1) ans = ans * a % mod;
}
return ans;
}
int main () {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
if (n == 1 || m == 1) {
cout << modpow(k, n + m - 1) << endl;
return 0;
}
lli ans = 0;
for (int i = 1; i <= k; ++i) {
ans = (ans + (modpow(i, n) + mod - modpow(i - 1, n)) % mod * modpow(k - i + 1, m)) % mod;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 60 + 5;
int n;
ll m;
char s[MAXN];
bool chk(ll base)
{
ll cur = 0;
for(int i=1; i<=n; ++i)
{
if(cur > m / base + 1) return 0;
cur = cur * base + s[i] - '0';
if(cur > m) return 0;
}
return cur <= m;
}
int main(void)
{
scanf("%s%lld",s+1,&m);
n = strlen(s+1);
int mx = 0;
for(int i=1; i<=n; ++i) mx = max(mx, s[i] - '0');
if(n == 1) return printf("%d",s[1] - '0' <= m? 1: 0), 0;
ll l = mx+1, r = 1e18;
if(!chk(l)) return printf("0"), 0;
while(l<r)
{
ll mid = (l+r+1)>>1;
if(chk(mid)) l = mid;
else r = mid-1;
}
printf("%lld",l - mx);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
#define endl "\n"
#define eb emplace_back
#define mem(a, b) memset(a , b , sizeof(a))
const ll INF = 0x3f3f3f3f;
// const ll mod = 998244353;
// const ll mod = 1e9 + 7;
const double eps = 1e-6;
const double PI = acos(-1);
const double R = 0.57721566490153286060651209;
void solve() {
string s; ll M;
cin >> s >> M;
ll x = 0;
for(int i = 0;i < (int)s.length(); i++) x = max(x, (ll)(s[i]- '0'));
x++;
if(s.length() == 1) {
if(s[0] - '0' <= M) cout << 1 << endl;
else cout << 0 << endl;
return ;
}
ll l = 1, r = 1e18 + 10;
ll t = 0;
while(l <= r) {
ll mid = (l + r) / 2;
__int128 ans = 0;
__int128 k = mid;
bool flag = 1;
for(int i = 0;i < (int)s.length(); i++) {
ans = ans * k + (ll)(s[i] - '0');
if(ans <= 0) { flag = 0; break; }
}
if(flag && ans <= M) {
l = mid + 1;
t = mid;
}
else r = mid - 1;
}
cout << max(0ll, t - x + 1) << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
// cin.tie(nullptr);
// cout.tie(nullptr);
#ifdef FZT_ACM_LOCAL
freopen("../in.txt", "r", stdin);
freopen("../out.txt", "w", stdout);
signed test_index_for_debug = 1;
char acm_local_for_debug = 0;
do {
if (acm_local_for_debug == '$') exit(0);
if (test_index_for_debug > 20)
throw runtime_error("Check the stdin!!!");
auto start_clock_for_debug = clock();
solve();
auto end_clock_for_debug = clock();
cout << "Test " << test_index_for_debug << " successful" << endl;
cerr << "Test " << test_index_for_debug++ << " Run Time: "
<< double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
cout << "--------------------------------------------------" << endl;
} while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
solve();
#endif
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define endl "\n"
using ll=long long;
using ld=long double;
using namespace std;
ll mod= 1e9+7;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : a; }
int main(){
ll n,x;
cin>>n>>x;
string s;
cin>>s;
ll pt=x;
rep(i,0,n){
if(s[i]=='o')pt++;
else{
if(pt>0)pt--;
}
}
cout<<pt;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
random_device rnd;
mt19937 mt(rnd());
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1000000007;
using Mat = vector<vector<ll>>;
Mat dot(Mat a, Mat b)
{
Mat c = Mat(3, VL(3, 0));
rep(i, 3)
{
rep(j, 3)
{
rep(k, 3)
{
c[i][j] += a[i][k] * b[k][j];
}
}
}
return c;
}
Mat rotP()
{
Mat c = {{0, 1, 0},
{-1, 0, 0},
{0, 0, 1}};
return c;
}
Mat rotN()
{
Mat c = {{0, -1, 0},
{1, 0, 0},
{0, 0, 1}};
return c;
}
Mat invX(ll p)
{
Mat x = {{1, 0, 0},
{0, 1, -p},
{0, 0, 1}};
Mat y = {{1, 0, 0},
{0, -1, 0},
{0, 0, 1}};
Mat z = {{1, 0, 0},
{0, 1, p},
{0, 0, 1}};
z = dot(z, y);
z = dot(z, x);
return z;
}
Mat invY(ll p)
{
Mat x = {{1, 0, -p},
{0, 1, 0},
{0, 0, 1}};
Mat y = {{-1, 0, 0},
{0, 1, 0},
{0, 0, 1}};
Mat z = {{1, 0, p},
{0, 1, 0},
{0, 0, 1}};
z = dot(z, y);
z = dot(z, x);
return z;
}
int main()
{
int n;
cin >> n;
vector<pair<ll, ll>> ps(n);
rep(i, n)
{
cin >> ps[i].first >> ps[i].second;
}
int m;
cin >> m;
vector<Mat> mats(m + 1);
mats[0] = {{1, 0, 0},
{0, 1, 0},
{0, 0, 1}};
rep(i, m)
{
int op;
cin >> op;
if (op == 1)
{
mats[i + 1] = dot(rotP(), mats[i]);
}
else if (op == 2)
{
mats[i + 1] = dot(rotN(), mats[i]);
}
else if (op == 3)
{
ll p;
cin >> p;
mats[i + 1] = dot(invY(p), mats[i]);
}
else
{
ll p;
cin >> p;
mats[i + 1] = dot(invX(p), mats[i]);
}
}
int q;
cin >> q;
rep(i, q)
{
int a, b;
cin >> a >> b;
b--;
ll x = ps[b].first;
ll y = ps[b].second;
cout << x * mats[a][0][0] + y * mats[a][0][1] + mats[a][0][2] << " "
<< x * mats[a][1][0] + y * mats[a][1][1] + mats[a][1][2] << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 1000000000000000000;
int gcd(int x, int y) {
if (x < y) gcd(y, x);
if (y == 0) return x;
return gcd(y, x % y);
}
int A[100010];
int main()
{
int N;
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
int ans = 0;
for (int i = 0; i < N; i++) ans = gcd(ans, A[i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a, ans;
int main() {
cin >> n >> ans;
for(int i = 1; i < n; ++i) cin >> a, ans = __gcd(ans, a);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define p_q priority_queue
#define m_p make_pair
#define pb push_back
#define ld long double
#define F first
#define S second
#define ull unsigned long long
#define mod 1000000007
#define md 998244353
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
#define int ll
using namespace std;
inline void read(int &x)
{
short negative=1;
x=0;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-')
negative=-1;
c=getchar();
}
while(c>='0' && c<='9')
x=(x<<3)+(x<<1)+(c^48),c=getchar();
x*=negative;
}
ll qpow(ll n,ll k){
ll ans=1;
while(k){
if(k%2){
ans*=n;
ans%=mod;
}
n*=n;
n%=mod;
k/=2;
}
return ans;
}
string iots(int n)
{
string s="";
while(n)
{
int now=n%10;
s+=now+'0';
n/=10;
}
reverse(s.begin(),s.end());
return s;
}
int stoi(string s)
{
int n=0;
rep(i,s.size())
{
n*=10;
n+=s[i]-'0';
}
return n;
}
int n;
int a[200100];
int t[200100];
int mx,mn;
signed main()
{
ios::sync_with_stdio(0);
cin>>n;
rep(i,n)cin>>a[i]>>t[i];
int d=0;
mx=1e18;mn=-1e18;
rep(i,n)
{
if(t[i]==1)
{
d+=a[i];
mn+=a[i];
mx+=a[i];
}
if(t[i]==2)
{
mn=max(mn,a[i]);
mx=max(mx,a[i]);
}
if(t[i]==3)
{
mn=min(mn,a[i]);
mx=min(mx,a[i]);
}
}
int q;
cin>>q;
rep(i,q)
{
int x;
cin>>x;
x+=d;
if(x>mx)x=mx;
if(x<mn)x=mn;
cout<<x<<endl;
}
return 0;
}
//特判判全
//循环边界
//精度足够
//注意初值
| #include <bits/stdc++.h>
using namespace std;
#define maxn 200005
#define ll long long int
ll n, q, x;
ll a, t, low, high, add;
int main(){
cin >> n;
low = -1000000000;
high = 1000000000;
add = 0;
for(int i = 0; i < n; i++){
cin >> a >> t;
if(t == 1){
low += a;
high += a;
add += a;
}else if(t == 2){
low = max(low, a);
high = max(high, a);
}else{
low = min(low, a);
high = min(high, a);
}
}
cin >> q;
for(int i = 0; i < q; i++){
cin >> x;
//cout << min(high, max(low, x+add)) << "\n";
cout << max(low, min(high, x+add)) << "\n";
}
return 0;
}
|
#include <iostream>
int main()
{
int a, b, c, d;
std::cin >> a >> b >> c >> d;
std::cout << b - c << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#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 REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;
int64_t solve(int64_t a, int64_t b, int64_t c, int64_t d) {
// TODO: edit here
return b - c;
}
// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr char endl = '\n';
int64_t a, b, c, d;
cin >> a >> b >> c >> d;
auto ans = solve(a, b, c, d);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
const ll mod = 998244353;
ll fac[maxn], ifac[maxn], inv[maxn];
ll nck(ll n, ll k) {
//cout<<"nck: "<<n<<" "<<k<<endl;
if (n<k) return 0;
return fac[n]*ifac[k]%mod*ifac[n-k]%mod;
}
void gen_inv() {
fac[0]=inv[0]=ifac[0]=1;
fac[1]=inv[1]=ifac[1]=1;
for (int i=2; i<maxn; i++) {
fac[i]=fac[i-1]*i%mod;
inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
ifac[i]=ifac[i-1]*inv[i]%mod;
}
}
void add(ll &x, ll y) {
x %= mod;
y %= mod;
x += y;
x %= mod;
}
ll brute(ll N, ll M) {
vector<ll> dp(M+1, 0);
dp[1] = 1;
for (int it=0; it<N; it++) {
vector<ll> ndp(M+1, 0);
for (int i=1; i<=M; i++) {
for (int j=1; j<=i; j++) {
if (i%j==0) {
add(ndp[i], dp[j]);
}
}
}
dp = ndp;
}
ll res = 0;
for (ll x: dp) {
add(res, x);
}
return res;
}
vector<ll> count_pf(ll x) {
vector<ll> res;
for (ll i=2; i*i<=x; i++) {
ll cnt=0;
while (x%i==0) {
cnt++;
x /= i;
}
if (cnt>0) {
res.push_back(cnt);
}
}
if (x>1) {
res.push_back(1);
}
return res;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
gen_inv();
ll N, M;
cin>>N>>M;
ll res = 0;
// iterate over last element
for (int i=1; i<=M; i++) {
ll bins = N;
ll cur = 1;
auto pf = count_pf(i);
for (ll balls: pf) {
cur *= nck(bins-1+balls, balls);
cur %= mod;
}
//cout<<i<<":"<<cur<<endl;
add(res, cur);
}
//assert(res==brute(N,M));
out(res);
return 0;
}
| #include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 998244353
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define read1(v,n) for(int i=1;i<=n;i++)cin>>v[i];
#define trav(a,x) for (auto& a: x)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define cut(x) {cout<<x;return 0;}
#define print(x) {cout<<x<<nl;continue;}
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORB(i,a,b) for(int i=a;i>=b;i--)
#define err1(a) {cout<<#a<<' '<<a<<nl;}
#define err2(a,b) {cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<nl;}
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define nl '\n'
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
ll gcd(ll a, ll b)
{
if (b==0)return a;
return gcd(b, a % b);
}
ll lcm(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
ll bpow(ll a, ll b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%MOD;
b/=2;
a=(a*a)%MOD;
}
return ans;
}
mpll factorise(ll n)
{
mpll fact;
while (n % 2 == 0)
{
fact[2]++;
n = n/2;
}
// n must be odd at this point. So we can skip
// one element (Note i = i +2)
for (int i = 3; i <= sqrt(n); i = i + 2)
{
// While i divides n, print i and divide n
while (n % i == 0)
{
fact[i]++;
n = n/i;
}
}
// This condition is to handle the case when n
// is a prime number greater than 2
if (n > 2)
fact[n]++;
return fact;
}
const int N=1e6;
ll fac[N];
void precompute()
{
fac[0]=1;
FOR(i,1,(ll)5e5)fac[i]=(i*fac[i-1])%MOD;
}
ll ncr(ll n,ll r)
{
return (((fac[n]*bpow(fac[r],MOD-2))%MOD)*(bpow(fac[n-r],MOD-2)))%MOD;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
ll n,m;
cin>>n>>m;
precompute();
ll sum=0;
FOR(i,1,m)
{
mpll temp=factorise(i);
ll x=1;
trav(it,temp)
{
x=(x*ncr(n+it.sc-1,n-1))%MOD;
}
sum=(sum+x)%MOD;
}
cut(sum)
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
for (int i = 0; i < N; i++){
cout << i * 2 % N + 1 << ' ' << (i * 2 + 1) % N + 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(ll x=pow(10,7)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { ll d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
int main() {
ll N; cin >> N;
rep(i,N) {
ll a = i*2, b = i*2+1;
ll tca = 0; while ((1<<tca)<=a) tca++;
while (a>=N) { if (a&(1<<tca)) a ^= (1<<tca); tca--; }
ll tcb = 0; while ((1<<tcb)<=b) tcb++;
while (b>=N) { if (b&(1<<tcb)) b ^= (1<<tcb); tcb--; }
a++; b++;
cout << a << " " << b << endl;
}
return 0;
} |
/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void solve(){
ll N;
cin >> N;
vll a(N), b(N), c(N), d(N), e(N);
vector<vll> v(N, vll(5));
rep(i,0,N){
rep(j,0,5){
cin >> v[i][j];
}
}
ll ans = 0;
vector<vector<lpair> > alt(1LL<<5);
rep(i,0,N){
rep(bit,1,(1LL<<5)){
ll min_val = INF;
rep(j,0,5){
if(bit & (1LL<<j)){
chmin(min_val, v[i][j]);
}
}
alt[bit].push_back({min_val, i});
}
}
rep(i,0,1LL<<5){
sort(alt[i].begin(), alt[i].end(), greater<lpair>());
}
rep(i,0,N){
rep(j,i+1,N){
ll lv = 0, rv = 1e9+7;
while(rv - lv > 1){
ll mid = (rv + lv) / 2;
ll bit = 0;
rep(k,0,5){
if(max(v[i][k], v[j][k]) < mid){
bit += (1LL<<k);
}
}
if(bit == 0){
lv = mid;
continue;
}
bool ok = false;
ll n = min(3LL, (ll)alt[bit].size());
rep(k,0,n){
if(alt[bit][k].first >= mid && alt[bit][k].second != i && alt[bit][k].second != j){
ok = true;
}
}
if(ok){
lv = mid;
}else{
rv = mid;
}
}
// print(i,j,lv);
chmax(ans, lv);
}
}
print(ans);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#define vvll vector <vll>
#define vpll vector <pll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define mll map <ll, ll>
#define fastmap gp_hash_table
#define cd complex <double>
#define vcd vector <cd>
#define PI acos(-1)
#define ordered_set tree <ll, null_type, less <ll>, rb_tree_tag, tree_order_statistics_node_update>
#pragma 03
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// 1 2 3 4 2 3 1
bool vis[200005], strong[200005];
ll p[200005], a[200005], b[200005];
int main(){
fastio;
ll n; cin >> n;
for (ll i = 0; i < n; i++) cin >> a[i];
for (ll i = 0; i < n; i++) cin >> b[i];
for (ll i = 0; i < n; i++) cin >> p[i], p[i]--;
ll ans = 0, cyc_len = 0;
for (ll i = 0; i < n; i++){
if (p[i] == i) continue;
if (a[i] <= b[p[i]]){
cout << -1 << "\n"; return 0;
}
else{
if (!vis[i]){
vis[i] = 1; ll ii = p[i];
ll mx = a[i], mxdx = i;
ll cyc_len = 1;
while (ii != i){
if (mx < a[ii]){
mx = a[ii], mxdx = ii;
}
vis[ii] = 1; cyc_len++;
ii = p[ii];
}
strong[mxdx] = 1;
ans += (cyc_len - 1);
}
}
}
cout << ans << "\n";
for (ll i = 0; i < n; i++){
if (strong[i]){
ll ii = p[i];
while (ii != i){
cout << i + 1 << " " << ii + 1 << "\n"; ii = p[ii];
}
}
}
} |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = 1e18;
#define rep(i, n) for (int i = 0; i < n; i++)
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else return false;}
int main() {
int n, m, k; cin >> n >> m >> k;
vector<int> a(n+1, 0);
rep(i, k) {
int x; cin >> x;
a[x] = 1;
}
for (int i = 0; i < n+1; i++) {
int j = i;
while (j < n+1 && a[j] == 1)
j++;
if (j - i >= m) {
cout << -1 << endl;
return 0;
}
i = j;
}
vector<double> b(n+m+10), c(n+m+10), sb(n+m+10, 0), sc(n+m+10, 0);
for (int i = n-1; i >= 0; i--) {
if (a[i]) {
b[i] = 1;
c[i] = 0;
}
else {
b[i] = (sb[i+1] - sb[i+m+1]) / m;
c[i] = (sc[i+1] - sc[i+m+1]) / m + 1;
}
sb[i] = b[i] + sb[i+1];
sc[i] = c[i] + sc[i+1];
}
cout << fixed << std::setprecision(15) << c[0] / (1 - b[0]) << endl;
return 0;
}
//小数点精度
//cout << fixed << std::setprecision(15) << y << endl; | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline void rd(char &c){
int i;
for(;;){
i = my_getchar_unlocked();
if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
break;
}
}
c = i;
}
inline int rd(char c[]){
int i;
int sz = 0;
for(;;){
i = my_getchar_unlocked();
if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
break;
}
}
c[sz++] = i;
for(;;){
i = my_getchar_unlocked();
if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
break;
}
c[sz++] = i;
}
c[sz]='\0';
return sz;
}
struct MY_WRITER{
char buf[1048576];
int s;
int e;
MY_WRITER(){
s = 0;
e = 1048576;
}
~MY_WRITER(){
if(s){
fwrite_unlocked(buf, 1, s, stdout);
}
}
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
MY_WRITER_VAR.s = 0;
}
MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
my_putchar_unlocked(a);
}
inline void wt_L(int x){
int s=0;
int m=0;
char f[10];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
my_putchar_unlocked('-');
}
while(s--){
my_putchar_unlocked(f[s]+'0');
}
}
int X;
int Y;
char S[10][12];
int res;
int main(){
int i;
int j;
int k;
rd(X);
rd(Y);
{
int Lj4PdHRW;
for(Lj4PdHRW=(0);Lj4PdHRW<(X);Lj4PdHRW++){
rd(S[Lj4PdHRW]);
}
}
for(i=(1);i<(X);i++){
for(j=(1);j<(Y);j++){
k = 0;
if(S[i-1][j-1] == '#'){
k++;
}
if(S[i-1][j ] == '#'){
k++;
}
if(S[i ][j-1] == '#'){
k++;
}
if(S[i ][j ] == '#'){
k++;
}
res += k % 2;
}
}
wt_L(res);
wt_L('\n');
return 0;
}
// cLay version 20210103-1 [bug fixed 2]
// --- original code ---
// int X, Y;
// char S[10][12];
// int res;
// {
// int i, j, k;
// rd(X,Y,S(X));
// rep(i,1,X) rep(j,1,Y){
// k = 0;
// if(S[i-1][j-1] == '#') k++;
// if(S[i-1][j ] == '#') k++;
// if(S[i ][j-1] == '#') k++;
// if(S[i ][j ] == '#') k++;
// res += k % 2;
// }
// wt(res);
// }
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j,k) vector<vector<ll>> name(i,vector<ll>(j,k))
#define vec3(name,i,j,k,l) vector<vector<vector<ll>>> name(i,vector<vector<ll>>(j,vector<ll>(k,l)))
#define pb push_back
#define MOD 1000000007 //998244353
#define PI 3.141592653
#define INF 100000000000000 //14
#define N 110
#define M 5000
//cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
vector<vector<ll>> conn(N);
vector<vector<ll>> path(M,vector<ll>(2));
vector<ll> fin(M,0);
vector<ll> c(N);
void bfs(ll x) {
REP(i,conn[x].size()){
ll next = conn[x][i];
if (fin[next]!=0) continue;
if (path[next][0]==x) {
fin[next]=1;
bfs(path[next][1]);
}
else {
fin[next]=2;
bfs(path[next][0]);
}
}
return;
}
int main(){
ll n, m; cin >> n >> m;
REP(i,m) {
ll a, b; cin >> a >> b;a--;b--;
path[i][0]=a;path[i][1]=b;
conn[a].pb(i);
conn[b].pb(i);
}
REP(i,n) cin >> c[i];
REP(i,m) {
// cout << i << " " << path[i][0] << " " << path[i][1] << " " << c[path[i][0]] << " " << c[path[i][1]] << endl;
if (c[path[i][0]]>c[path[i][1]]) fin[i]=1;
else if (c[path[i][0]]<c[path[i][1]]) fin[i]=2;
}
// REP(i,m) cout << fin[i] << " ";
// cout << endl;
ll now = 0;
while (now<m) {
if (fin[now]!=0) {
now++;
continue;
}
fin[now]=1;
bfs(path[now][1]);
// cout << "test1" << " " << now << endl;
// REP(i,m) cout << fin[i] << " ";
// cout << endl;
}
REP(i,m) {
if (fin[i]==1) cout << "->" << endl;
else cout << "<-" << endl;
}
} | #include <bits/stdc++.h>
#define ll long long
const int INF = 1000000000;
using namespace std;
const int MAX = 105;
int edgeDir[MAX * MAX], c[MAX], used[MAX];
vector<pair<int, pair<int, int> > > g[MAX];
void dfs(int u) {
used[u] = 1;
for(auto e : g[u]) {
int v = e.first;
int eId = e.second.first;
int reverted = e.second.second;
if(c[v] > c[u]) {
edgeDir[eId] = reverted ^ 1;
} else if(c[v] == c[u]) {
edgeDir[eId] = reverted;
if(!used[v]) {
dfs(v);
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
int N, M;
cin >> N >> M;
for(int i = 0; i < M; i++) {
int u, v;
cin >> u >> v;
--u;--v;
g[u].push_back({v, {i, 0}});
g[v].push_back({u, {i, 1}});
}
vector<int> verts;
for(int i = 0; i < N; i++) {
cin >> c[i];
verts.push_back(i);
}
sort(verts.begin(), verts.end(), [&](int u, int v) {
return c[u] < c[v];
});
for(auto u : verts) {
//cerr << u << '\n';.
if(!used[u]) {
dfs(u);
}
}
for(int i = 0; i < M; i++) {
if(edgeDir[i]) {
cout << "<-\n";
} else {
cout << "->\n";
}
}
}
|
#include <iostream>
#include <vector>
//#include <string>
#include <algorithm>
//#include <math.h>
#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
//typedef long double LD;
using namespace std;
//#define MOD 1000000007
//#define MOD 998244353
//#define MAX 100100
#define NIL -1
//#define INF 1000000000000000000
//const LL SEG_VAL = 1 << 19;
vector<vector<pair<LL, LL>>> tele(26);
vector<bool> tele_visited(26, false);
vector<vector<LL>> a_num(2010, vector<LL>(2010, 0));
vector<vector<LL>> dist(2010, vector<LL>(2010, NIL));
vector<vector<bool>> visited(2010, vector<bool>(2010, false));
LL h;
LL w;
vector<LL> dx={0,1,0,-1};
vector<LL> dy={1,0,-1,0};
void bfs(LL y, LL x){
queue<pair<LL, LL>> q;
q.push(make_pair(y, x));
visited[y][x]=true;
pair<LL, LL> u;
while(!q.empty()){
u = q.front();
q.pop();
for(LL i=0; i<4; i++){
LL y_new=u.first+dy[i];
LL x_new=u.second+dx[i];
if(y_new<0 || y_new>=h){
continue;
}
if(x_new<0 || x_new>=w){
continue;
}
if(a_num[y_new][x_new]==NIL){
continue;
}
if(visited[y_new][x_new]==true){
continue;
}
dist[y_new][x_new]=dist[u.first][u.second]+1;
visited[y_new][x_new]=true;
q.push(make_pair(y_new, x_new));
}
LL tmp=a_num[u.first][u.second];
if(tmp!=0){
if(tele_visited[tmp-1]!=true){
for(LL i=0; i<tele[tmp-1].size(); i++){
LL y_new=tele[tmp-1][i].first;
LL x_new=tele[tmp-1][i].second;
if(visited[y_new][x_new]==true){
continue;
}
dist[y_new][x_new]=dist[u.first][u.second]+1;
visited[y_new][x_new]=true;
q.push(make_pair(y_new, x_new));
}
tele_visited[tmp-1]=true;
}
}
}
}
int main(){
cin >> h >> w;
char a;
LL h_s;
LL w_s;
LL h_e;
LL w_e;
for(LL i=0; i<h; i++){
for(LL j=0; j<w; j++){
cin >> a;
if(a=='#'){
a_num[i][j]=NIL;
}else if(a=='S'){
h_s=i;
w_s=j;
}else if(a=='G'){
h_e=i;
w_e=j;
}else if(a=='.'){
}else{
LL tmp=a-'a';
tele[tmp].push_back(make_pair(i,j));
a_num[i][j]=tmp+1;
}
}
}
dist[h_s][w_s]=0;
bfs(h_s, w_s);
/*
for(LL i=0; i<h; i++){
for(LL j=0; j<w; j++){
//cout << a_num[i][j];
cout << dist[i][j];
}
cout << endl;
}
*/
/*
for(LL i=0; i<3; i++){
for(LL j=0; j<tele[i].size(); j++){
cout << tele[i][j].first << " " << tele[i][j].second << endl;
}
}
*/
cout << dist[h_e][w_e] << endl;
return 0;
}
| #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int CM = 1 << 17, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 72 - dig >> 3;
return tmp;
}
const int MAX = 1000;
class shuturyoku_unko {
public:
char C[MAX * 4];
constexpr shuturyoku_unko() : C() {
rep(i, MAX) {
int X = i;
rep(j, 3) {
C[i * 4 + 2 - j] = '0' + X % 10;
X /= 10;
}
C[i * 4 + 3] = ' ';
}
}
};
constexpr shuturyoku_unko f;
const int dm = 1 << 17;
char* dn = cn, * di = dn, * owad = dn + dm - 20;
void putint(int A) {
if (owad < di) {
fwrite(dn, 1, di - dn, stdout);
di = dn;
}
if (A >= 1000) {
int dig = 1;
if (A >= 100000) dig = 3;
else if (A >= 10000) dig = 2;
memcpy(di, f.C + A / 1000 * 4 + 3 - dig, dig);
memcpy(di + dig, f.C + A % 1000 * 4, 4);
di += dig + 4;
}
else {
int dig = 1;
if (A >= 100) dig = 3;
else if (A >= 10) dig = 2;
memcpy(di, f.C + A * 4 + 3 - dig, dig + 1);
di += dig + 1;
}
}
int N;
int to[400001], ne[400001], he[200001];
int Q[200001], vis[200001], p, q;
ll are[200001];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
N = getint();
rep1(i, N * 2 - 2) {
int a = getint(), b = getint();
to[i] = b;
ne[i] = he[a];
he[a] = i++;
to[i] = a;
ne[i] = he[b];
he[b] = i;
}
Q[q++] = 1;
while (p < q) {
int u = Q[p++];
vis[u] = -1;
for (int i = he[u]; i; i = ne[i]) {
if (vis[to[i]] == 0) {
Q[q++] = to[i];
}
}
}
int tmp = Q[N - 1];
p = 0;
q = 0;
Q[q++] = tmp;
vis[tmp] = 0;
while (p < q) {
int u = Q[p++];
for (int i = he[u]; i; i = ne[i]) {
if (vis[to[i]] < 0) {
vis[to[i]] = u;
Q[q++] = to[i];
}
}
}
ll m = (1ll << 20) - 1, m0 = ~m, m1 = 1ll << 20;
for (int i = N - 1; i >= 0; i--) {
int u = Q[i];
ll kari = (are[u] & m0) + m1 + u;
if (are[vis[u]] < kari) are[vis[u]] = kari;
}
int k = 0;
q = 0;
Q[q++] = tmp;
while (q) {
k++;
int u = Q[q - 1];
if (u < 0) q--;
else {
vis[u] = -k;
Q[q - 1] = -u;
int nanika = are[u] & m;
if (nanika) Q[q++] = nanika;
for (int i = he[u]; i; i = ne[i]) {
int v = to[i];
if (vis[v] >= 0 && v != nanika) {
Q[q++] = v;
}
}
}
}
rep1(i, N) putint(-vis[i]);
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define double long double
#define F first
#define S second
#define pb push_back
#define si set <int>
#define vi vector <int>
#define pii pair <int, int>
#define vpi vector <pii>
#define mii map <int, int>
#define endl "\n"
#define sz(x) ((int) x.size())
#define all(p) p.begin(), p.end()
#define que_max priority_queue <int>
#define que_min priority_queue <int, vi, greater<int>>
#define bug(...) __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a) for(auto x : a) cout << x << " "; cout << endl
#define print1(a) for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y) for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> Set;
template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
const char* comma = strchr (names + 1, ',');
cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}
const int N = 200005;
int a[N], n, m, k;
string s;
void solve()
{
cin >> n >> s;
vector <char> v;
for (int i = 0; i < n; i++)
{
if (sz(v) < 2)
v.pb(s[i]);
else
{
if (s[i] == 'x')
{
char c = v.back();
v.pop_back();
if (v.back() == 'f' and c == 'o')
v.pop_back();
else
{
v.pb(c);
v.pb(s[i]);
}
}
else
v.pb(s[i]);
}
}
cout << sz(v);
}
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout << setprecision(9) << fixed;
clock_t z = clock();
solve();
cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);
return 0;
} | /*
NAME : RISHABH SINGH
INSTITUTION : DELHI TECHNOLOGICAL UNIVERSITY
*/
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pii pair<int, int>
#define bi __builtin_inf()
#define ll long long
#define mp make_pair
#define ss second
#define pb push_back
#define ff first
#define speed_cubing ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define um unordered_map
#define us unordered_set
#define bp __builtin_popcount
#define ld long double
#define rep(n) for (int i = 0; i < n; i++)
#define pll pair<ll, ll>
#define mx = 1e18;
#define lb(v, val) (lower_bound(v.begin(), v.end(), val) - v.begin())
#define ub(v, val) (upper_bound(v.begin(), v.end(), val) - v.begin())
#define PI 3.1415926535
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
ll powmod(ll base,ll exp,ll MOD){ll res=1;while(exp>0){if(exp%2==1) res=(res*base)%MOD;base=(base*base)%MOD;exp/=2;}return (res%MOD);}
#define sz(v) (int)v.size()
#define endl '\n'
const int mod = 1e9+7;
ll mul_inv(ll a,ll b = mod) {ll t1=a,t2=b,t3,v1=1,v2=0,v3;while(t2!=1){ll x=t1/t2;t3=t1-x*t2;v3=v1-x*v2;t1=t2,t2=t3;v1=v2,v2=v3;}return(v2+b)%b;}
const int N = 5e5+5;
int32_t main(){
speed_cubing
char s,t;
cin>>s>>t;
if(s=='Y'){
cout<<char(t-'a'+'A');
}
else
cout<<t;
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define SHOW1d(v,n) {REP(W,n)cerr << v[W] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {REP(aaa,i){REP(bbb,j)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007LL
typedef long long ll;
typedef pair<ll,ll> P;
template<typename T>
void show_vector(vector<T> v) {
for (auto ele: v)cout << ele << " " ;cout << endl;
}
template<typename T>
void show_vector(vector<vector<T>> v) {
for (auto ele: v)show_vector(ele);
}
template<typename T>
void show_vector(vector<vector<vector<T>>> v) {
for (auto ele: v) {
show_vector(ele);
cout << endl;
}
}
void solve() {
ll n;cin >> n;
vector<ll> v(n);
REP(i, n) cin >> v[i], v[i]--;
vector<ll> tmp(2 * n);
REP(i, 2 * n)tmp[i] = i % n;
vector<ll> ans;
int cou = 0;
for (ll now: tmp) {
// cout << "### " << now << " ###" << endl;
ll pla;
REP(i, n) if (v[i] == now) pla = i;
while(pla != now) {
// cout << now << " " << pla << endl;
// show_vector(v);
if (pla % 2 != cou % 2 && pla - 1 >= 0) {
ans.PB(pla - 1);
swap(v[pla - 1], v[pla]);
pla--;
}
else if (pla % 2 == cou % 2 && pla < now) {
ans.PB(pla);
swap(v[pla], v[pla + 1]);
pla++;
}
else {
ans.PB(cou % 2);
swap(v[cou % 2], v[(cou % 2) + 1]);
if (pla == cou % 2) pla++;
}
cou++;
}
}
while (v.size() > 2 && (v[0] != 0 || v[1] != 1 || v[2] != 2)) {
ans.PB(cou % 2);
swap(v[cou % 2], v[(cou % 2) + 1]);
cou++;
}
// cout << "end swap" << endl;
cout << ans.size() << endl;
REP(i, ans.size()) cout << ans[i] + 1 << " ";cout << endl;
}
int main(){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll t;cin >> t;
REP(i, t)solve();
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long;
using P = pair<int,int>;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e18;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;
int main(){
int x;
cin >> x;
cout << max(x,0) << endl;
return 0;
} |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
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;
}
ll modinv(ll a, ll mod){
ll b=mod, u=1, v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a, b);
u-=t*v; swap(u, v);
}
u%=mod;
if(u<0)u+=mod;
return u;
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
//if(i==1)res = false;
if(n%i==0)res=false;
return res;
}
struct UnionFind{
ll N;
llvec p;
llvec cnt;
UnionFind(ll n){
N = n;
p=llvec(N);
cnt=llvec(N, 0);
rep(i, N){
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b){
P at = root(a);
P bt = root(b);
if(at.second!=bt.second){
if(at.first>bt.first){
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second]+=cnt[at.second];
p[a]=bt.second;
}
}
P root(ll a){
ll atmp = a;
ll c=0;
while(atmp!=p[atmp]){
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b){
P at=root(a);
P bt=root(b);
return at.second == bt.second;
}
};
/**************************************
** A main function starts from here **
***************************************/
int main(){
ll N;
cin >> N;
llvec x(N), y(N);
rep(i, N)cin >> x[i]>>y[i];
ld ok = 1e-10;
ld ng = 300;
while(abs(ok-ng)>1e-9){
ld r= (ok+ng)*0.5;
UnionFind uf(N+2);
for(ll i=0;i<N;i++){
for(ll j=i+1;j<N;j++){
if(sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2)) <2 * r){
uf.con(i, j);
}
}
if(abs(y[i]-100)<2*r)uf.con(N, i);
if(abs(y[i]+100)<2*r)uf.con(N+1, i);
}
if(uf.is_con(N, N+1)){
ng=r;
}else{
ok=r;
}
}
cout << setprecision(15)<<ok;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
const long long MOD = 1000000007;
struct mint {
long long int value;
mint() : value(0) {}
explicit mint(long long int value) : value((value % MOD + MOD) % MOD) {}
mint &fix() {
value = (value % MOD + MOD) % MOD;
return *this;
}
mint operator-() const { return mint(0) - *this; }
mint operator~() const { return mint(1) / *this; }
mint &operator+=(const mint &others) {
if ((value += others.value) >= MOD) value -= MOD;
return *this;
}
mint &operator-=(const mint &others) {
if ((value += MOD - others.value) >= MOD) value -= MOD;
return *this;
}
mint &operator*=(const mint &others) {
(value *= others.value) %= MOD;
return *this;
}
mint &operator/=(const mint &others) {
(value *= others.pow(MOD - 2).value) %= MOD;
return *this;
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
mint operator/(const mint &a) const { return mint(*this) /= a; }
mint pow(long long int t) const {
if (!t) return mint(1);
mint res = pow(t / 2);
res *= res;
return (t & 1) ? res * mint(value) : res;
}
bool operator<(const mint &a) const { return value < a.value; }
bool operator<=(const mint &a) const { return value <= a.value; }
bool operator>(const mint &a) const { return value > a.value; }
bool operator>=(const mint &a) const { return value >= a.value; }
bool operator==(const mint &a) const { return value == a.value; }
};
mint ex(mint x, long long int t) {
return x.pow(t);
}
std::istream &operator>>(std::istream &i, mint &a) {
i >> a.value;
return i;
}
std::ostream &operator<<(std::ostream &o, const mint &a) {
o << a.value;
return o;
}
void solve(long long N, std::vector<long long> A){
sort(all(A));
vector<ll> a = {0};
a.insert(a.end(), all(A));
mint ans = mint(1);
rep(i, N) {
ans *= mint(a.at(i + 1) - a.at(i) + 1);
}
cout << ans << endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = b; i >= a; i--)
using namespace std;
const int N = 400005;
int n, b[N];
pair<int, int> a[N];
stack<int> s;
char ans[N];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> n;
rep(i, 1, 2 * n) {
int x;
cin >> x;
a[i] = {x, i};
}
sort(a + 1, a + 2 * n + 1, greater<pair<int, int>>());
rep(i, 1, n)
b[a[i].second] = 1;
rep(i, 1, 2 * n) {
if (!s.empty() && b[s.top()] != b[i]) {
ans[s.top()] = '(';
ans[i] = ')';
s.pop();
}
else
s.push(i);
}
assert(s.empty());
rep(i, 1, 2 * n)
cout << ans[i];
return 0;
}
| /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||_ \
| | \\\ - /'| | |
| \_| `\`---'// |_/ |
\ .-\__ `-. -'__/-. /
___`. .' /--.--\ `. .'___
."" '< `.___\_<|>_/___.' _> \"".
| | : `- \`. ;`. _/; .'/ / .' ; |
\ \ `-. \_\_`. _.'_/_/ -' _.' /
===========`-.`___`-.__\ \___ /__.-'_.'_.-'================
Please give me AC.
*/
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <string>
#include <sstream>
#include <complex>
#include <bitset>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <chrono>
#include <random>
using namespace std;
using int64 = long long;
using uint64 = unsigned long long;
using vi = vector<int>;
using vl = vector<int64>;
using pii = pair<int, int>;
using pll = pair<int64, int64>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\n'
#define print2(x, y) cout << (x) << ' ' << (y) << '\n'
#define print3(x, y, z) cout << (x) << ' ' << (y) << ' ' << (z) << '\n'
#define printn(v) rep(i, (v).size() - 1) cout << (v)[i] << ' '; cout << (v)[n - 1] << '\n';
#ifdef ONLINE_JUDGE
#define debug(x)
#define debug2(x, y)
#define debug3(x, y, z)
#define dbg(v)
#else
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << '\n'
#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){cerr << #v << "[" << _ << "] : " << v[_] << '\n';}
#endif
// constant
const int INF = (1<<30) - 1;
const int64 INF64 = (1LL<<62) - 1;
template<typename T> T gcd(T a, T b) {
if (a < b) return gcd(b, a);
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
template<typename T> T lcm(const T a, const T b) {
return a / gcd(a, b) * b;
}
template<typename T> bool chmin(T& a, const T& b) {
if (a > b) return a = b, true; else return false;
}
template<typename T> bool chmax(T& a, const T& b) {
if (a < b) return a = b, true; else return false;
}
// End of template.
int main() {
cout << fixed << setprecision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
string s;
cin >> s;
if (s[0] == s[1] && s[1] == s[2]) {
print("Won");
} else {
print("Lost");
}
return 0;
}
/*
__ _ ___ _ __ _ __
/ _` | / __| '_ \| '_ \
| (_| || (__| |_) | |_) |
\__,_(_)___| .__/| .__/
|_| |_|
*/
|
#include <bits/stdc++.h>
#include <set>
#define ll long long
#include <string>
#define pb push_back
#define mp make_pair
#define pi 3.14159265358979323846
#define mod 1000000007
#define INF 1e18
// typedef pair<ll, ll> pi;
#define rep(i,n) for(i=0;i<n;i++)
#define repk(i,k,n) for(i=k;i<n;i++)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define oset tree <pair<ll int ,ll int>, null_type, less<pair<ll int,ll int> >, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
#define see(args...) \
{ \
cerr << "LINE " << __LINE__; \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr << endl; \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << ' ' << *it << " = " << a;
err(++it, args...);
}
void fastio()
{
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve()
{
ll int n; cin >> n;
ll int a[n], i, j;
rep(i, n) {
cin >> a[i];
}
vector<ll> ans[200];
rep(i, (1 << min(8ll, n)))
{
ll int s = 0;
vector<ll> temp;
rep(j, min(8ll, n))
{
if (i & (1 << j))
{
s += a[j];
temp.pb(j + 1);
}
}
s = s % 200;
// cout << "sum " << s << ' ' << ans[s].size() << endl;
if (ans[s].size() == 0)
{
ans[s] = temp;
}
else
{
cout << "YES" << endl;
cout << ans[s].size() << " ";
for (auto x : ans[s])
cout << x << ' ';
cout << endl;
cout << temp.size() << ' ';
for (auto z : temp)
cout << z << ' ';
cout << endl;
return;
}
}
cout << "NO" << endl;
}
int main()
{
fastio();
ll int t;
// cin >> t;
t = 1;
while (t--)
{
solve();
}
} | //HEADER FILES AND NAMESPACES
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
// DEFINE STATEMENTS
#define num1 1000000007
#define num2 998244353
#define REP(i,a,n) for(ll i=a;i<n;i++)
#define REPd(i,a,n) for(ll i=a; i>=n; i--)
#define pb push_back
#define pob pop_back
#define f first
#define s second
#define fix(f,n) std::fixed<<std::setprecision(n)<<f
#define all(x) x.begin(), x.end()
#define M_PI 3.14159265358979323846
#define epsilon (double)(0.0000001)
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpll;
typedef vector<int> vii;
// DEBUG FUNCTIONS
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) {
cout<<a;
}
template<typename T, typename F>
void __p(pair<T, F> a) {
cout<<"{";
__p(a.first);
cout<<",";
__p(a.second);
cout<<"}";
}
template<typename T>
void __p(std::vector<T> a) {
cout<<"{";
for(auto it=a.begin(); it<a.end(); it++)
__p(*it),cout<<",}"[it+1==a.end()];
}
template<typename T>
void __p(std::set<T> a) {
cout<<"{";
for(auto it=a.begin(); it!=a.end();){
__p(*it);
cout<<",}"[++it==a.end()];
}
}
template<typename T>
void __p(std::multiset<T> a) {
cout<<"{";
for(auto it=a.begin(); it!=a.end();){
__p(*it);
cout<<",}"[++it==a.end()];
}
}
template<typename T, typename F>
void __p(std::map<T,F> a) {
cout<<"{\n";
for(auto it=a.begin(); it!=a.end();++it)
{
__p(it->first);
cout << ": ";
__p(it->second);
cout<<"\n";
}
cout << "}\n";
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
__p(a1);
__p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout<<name<<" : ";
__p(arg1);
cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket=0,i=0;
for(;; i++)
if(names[i]==','&&bracket==0)
break;
else if(names[i]=='(')
bracket++;
else if(names[i]==')')
bracket--;
const char *comma=names+i;
cout.write(names,comma-names)<<" : ";
__p(arg1);
cout<<" | ";
__f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" ", __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...)
#define error(...)
#endif
// DEBUG FUNCTIONS END
// CUSTOM HASH TO SPEED UP UNORDERED MAP AND TO AVOID FORCED CLASHES
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); // FOR RANDOM NUMBER GENERATION
ll mod_exp(ll a, ll b, ll c)
{
ll res=1; a=a%c;
while(b>0)
{
if(b%2==1)
res=(res*a)%c;
b/=2;
a=(a*a)%c;
}
return res;
}
ll mymod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll gcdExtended(ll,ll,ll *,ll *);
ll modInverse(ll a, ll m)
{
ll x, y;
ll g = gcdExtended(a, m, &x, &y);
g++; //this line was added just to remove compiler warning
ll res = (x%m + m) % m;
return res;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y)
{
if (a == 0)
{
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b%a, a, &x1, &y1);
*x = y1 - (b/a) * x1;
*y = x1;
return gcd;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b;
cin >> a >> b;
cout << 2*a + 100 - b << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int takahashi_num,aoki_num,C;
// 条件数
cin >> takahashi_num >> aoki_num >> C;
if(C==0){
if(takahashi_num<=aoki_num){
cout << "Aoki" << endl;
}else{
cout << "Takahashi" << endl;
}
}else{
if(aoki_num<=takahashi_num){
cout << "Takahashi" << endl;
}else{
cout << "Aoki" << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; } //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //最小公倍数
using Graph = vector<vector<int>>;
int INF=1000000000;
const double PI = 3.14159265358979323846;
int main(){
int a,b,c;
cin >> a >> b >> c;
a+=c;
if(a>b)cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
} |
/*
-----------------AUTHOR-----------------------
--------------Parth Mangal--------------------
----------------------------------------------
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
void gareeb(){
int n;
cin>>n;
int arr[n],temp;
for(int i=0;i<n;i++){
cin>>temp;
arr[i]=abs(temp);
}
ll m=0;
for(int i=0;i<n;i++){
m = m+ arr[i];
}
cout<<m<<endl;
double e=0;
for(int i=0;i<n;i++){
e = e+ pow(arr[i],2);
}
cout<<fixed<<setprecision(15)<<sqrt(e)<<endl;
sort(arr,arr+n);
cout<<arr[n-1];
}
int main()
{
fastio;
int t=1;
//cin>>t;
while(t--)
{
gareeb();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t a[N];
for(int i=0; i<N; i++){
cin >> a[i];
}
for (int i=0; i<N; i++){
if (a[i]<0){
a[i] = (-1) * a[i];
}
}
int64_t M=0;
for(int i=0; i<N; i++){
M+=a[i];
}
int64_t x=0;
double E;
for(int i=0; i<N; i++){
x+=a[i]*a[i];
}
E=sqrt(x);
int64_t C=0;
for(int i=0; i<N; i++){
C=max(C,a[i]);
}
cout << M << endl;
cout << fixed << setprecision(18) << E << endl;
cout << C << endl;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;
void array_show(int *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
long long int pow_mod(long long int p_a,long long int p_n,long long int p_p=1e9+7){
//p_a^p_n mod p_p
long long int p_b=1,p_t=1;
for(;p_b<=p_n;p_b<<=1);
for(p_b>>=1;p_b>0;p_b>>=1){
p_t*=p_t;
if(p_t>=p_p)p_t%=p_p;
if(p_n&p_b)p_t*=p_a;
if(p_t>=p_p)p_t%=p_p;
}
return p_t;
}
int main(){
LL n,m;
int i,j,k;
LL a,b,c;
cin>>n>>m;
a=pow_mod(10,n,m*m);
cout<<a/m<<endl;
} | #include<iostream>
using namespace std;
#define int long long
int n,m,mod=998244353,ans;
int p[5001][5001];
int power(int a,int b)
{
if(p[a][b])return p[a][b];
if(!a)return 0;
if(!b)return 1;
int tmp=power(a,b/2);
tmp=tmp*tmp%mod;
if(b&1)tmp=tmp*a%mod;
return p[a][b]=tmp;
}
signed main()
{
cin>>n>>m;
if(m==1)
{
cout<<1;
return 0;
}
for(int i=1;i<=n-2;i++)
{
int cnt=0;
for(int j=2;j<=m;j++)
{
cnt+=power(m-1,i)-power(m-j,i)+mod;
cnt%=mod;
}
ans+=cnt*(n-i-1)%mod*power(m,n-i-2);
ans%=mod;
}
for(int i=1;i<=n;i++)
{
ans+=power(m-1,i-1)*m%mod*power(m,n-i);
ans%=mod;
}
cout<<ans;
return 0;
} |
#include<bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vvi vector<vector<int>>
#define vpi vector<pair<int,int>>
#define pb push_back
#define mp make_pair
#define int long long int
#define mod 1000000007
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int>>
#define from(i,n) for(int i=0;i<(int)n;i++)
#define from_j(i,j,n) for(int i=j;i<(int)n;i++)
using namespace std;
int power(int n , int k) {
if (k == 0)return 1;
int temp = power(n, k / 2);
temp = (temp * temp);
if (k % 2) return (temp * n);
return temp;
}
int fact(int x)
{
int res = 1;
for(int i=2;i<=x;i++)
res = i*res;
return res;
}
int choose(int n, int r)
{
return fact(n)/(fact(r)*fact(n-r));
}
int gcd(int a, int b)
{
if (min(a, b) == 0)
return max(a, b);
return gcd(min(a, b), max(a, b) % min(a, b));
}
int lcm(int a, int b)
{
int x = gcd(a, b);
return abs(a*b) / x;
}
void print(vi z)
{
for(auto x:z)
cout<<x<<endl;
// cout<<endl;
}
void sync()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
vi factors(int n)
{
vi ans;
ans.pb(1);
if(n == 1)
return ans;
for(int i = 2;i*i<=n;i++)
{
if(n%i == 0)
{
if(n/i == i)
ans.pb(i);
else
{
ans.pb(i);
ans.pb(n/i);
}
}
}
sort(ans.begin(), ans.end());
ans.pb(n);
return ans;
}
void solve()
{
int n; cin>>n;
print(factors(n));
}
int32_t main() {
sync();
int t;
//cin>>t;
t = 1;
while(t--)
{
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
return 0;
}
| // Jai Shree Ram
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define max2(a,b) (a>b)?a:b
#define mi2(a,b) (a<=b)?a:b
#define fori(i,n) for(ll i=0;i<(ll)n;i++)
#define ford(i,n) for(ll i=n;i>=0;i--)
#define pll pair<ll,ll>
#define MOD 998244353
#define ff first
#define ss second
using namespace std;
#define MAX_LIMIT 1000001
// ll power(ll n, ll pow)
// {
// n %= MOD;
// long long int res = 1;
// while (pow)
// {
// if (pow % 2)
// {
// res = ((res % MOD) * (n % MOD)) % MOD;
// }
// pow /= 2;
// n = ((n % MOD) * (n % MOD)) % MOD;
// }
// res %= MOD;
// return res;
// }
// void answer(ll ans)
// {
// cout<<"! "<<ans<<"\n";
// cout.flush();
// }
// ll query(ll l,ll r)
// {
// cout<<"? "<<l<<" "<<r<<"\n";
// cout.flush();
// ll rem;
// cin>>rem;
// return rem;
// }
void solve()
{
ll a,b;
cin>>a>>b;
double d=(a-b)*100.0/a;
cout<<setprecision(18)<<(double)d<<"\n";
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll T;
T=1;
//cin>>T;
//sievefun(1000004);
fori(_,T)
{
solve();
}
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <random>
#include <cstdio>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int) n; i++)
int main() {
int n,k,m;
cin >> n >> k >> m;
int sum = 0;
rep(i,n-1) {
int a;
cin >> a;
sum += a;
}
for (int i = 0; i <= k; i++)
{
if ((sum+i)/n >= m) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n,k,m;
cin >> n >> k >> m;
int Score[n-1],sum=0;
for(int i=0;i<n-1;i++){
cin >> Score[i];
sum += Score[i];
}
//主処理
int TargetScore = m*n;
//すでに目標点を超えている場合
if(TargetScore <= sum){
cout << 0 << endl;
}
//下回っている場合
else{
if(TargetScore-sum <= k){
cout << TargetScore-sum << endl;
}
else{
cout << -1 << endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using matrix = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
template<class in_chmax> void chmax(in_chmax &x, in_chmax y) {x = max(x,y);}
template<class in_chmin> void chmin(in_chmin &x, in_chmin y) {x = min(x,y);}
void Yes() {cout << "Yes" << endl; exit(0);}
void No() {cout << "No" << endl; exit(0);}
template<class in_Cout> void Cout(in_Cout x) {cout << x << endl; exit(0);}
template<class in_vec_cout>
void vec_cout(vector<in_vec_cout> vec) {
for (in_vec_cout res : vec) {cout << res << " ";}
cout << endl;
}
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll maxN = 110;
ll powmodp(ll x, ll n) {
if (n==0) return 1;
if (n%2) return x * powmodp(x,n-1) % mod;
ll res = powmodp(x,n/2);
return res * res % mod;
}
ll inv(ll x) {return powmodp(x,mod-2);}
matrix E(ll n) {
matrix res(n,vector<ll>(n));
rep(i,n) res[i][i] = 1;
return res;
}
void addmodp(ll &x, ll y) {x = (x + y) % mod;}
matrix prodmatrix(matrix x, matrix y) {
ll H = x.size(), W = y[0].size(), sz = y.size();
matrix res(H,vector<ll>(W));
rep(i,H) rep(j,W) rep(k,sz) {
addmodp(res[i][j], x[i][k] * y[k][j] % mod);
}
return res;
}
vector<ll> prodmatrix(matrix A, vector<ll> x) {
matrix X(x.size(),vector<ll>(1));// |y1| |A11 | |x1|
rep(i,x.size()) X[i][0] = x[i]; // |y2| = | A22 | * |x2|
matrix Y = prodmatrix(A,X); // |y3| | A33| |x3|
vector<ll> y(Y.size());
rep(i,Y.size()) y[i] = Y[i][0];
return y;
}
vector<ll> prodmatrix(vector<ll> x, matrix A) {
matrix X(1,vector<ll>(x.size()));// |A11 |
rep(i,x.size()) X[0][i] = x[i]; // |y1, y2, y3| = |x1, x2, x3| * | A22 |
matrix Y = prodmatrix(X,A); // | A33|
vector<ll> y(Y[0].size());
rep(i,Y[0].size()) y[i] = Y[0][i];
return y;
}
matrix powmatrix(matrix x, ll n) {
if (n==0) return E(x.size());
if (n%2) return prodmatrix(x,powmatrix(x,n-1));
matrix res = powmatrix(x,n/2);
return prodmatrix(res,res);
}
ll N, M, K;
vector<ll> A(maxN);
matrix mat(maxN,vector<ll>(maxN));
vector<ll> G[maxN];
int main() {
cin >> N >> M >> K;
rep(i,N) cin >> A[i];
rep(i,M) {
ll x, y; cin >> x >> y;
x--; y--;
G[x].push_back(y);
G[y].push_back(x);
}
rep(now,N) {
ll n = G[now].size();
ll p = n * inv(M) % mod, q = (1-p+mod) % mod;
mat[now][now] = ((p * inv(2) % mod) + q) % mod;
for (ll to : G[now]) {
mat[now][to] = inv(M) * inv(2) % mod;
}
}
vector<ll> res = prodmatrix(A,powmatrix(mat,K));
rep(i,N) cout << res[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define REPR(i,n) for (ll i = (n)-1; i >= 0; --i)
#define FOR(i,m,n) for (ll i = (m); i < (n); ++i)
#define FORR(i,m,n) for (ll i = (n)-1; i >= (m); --i)
#define FORE(x,xs) for (const auto& x : (xs))
#define FORI(i,v) for (auto i = v.begin(); i != v.end(); i++)
#define STATE(s,n) for (int s = 0; s < (1 << (n)); s++)
#define SUB(t,s) for (int t = (s); --t&=(s);)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
#define UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v)),end(v))
#define CHMIN(x,y) x = min(x, (y))
#define CHMAX(x,y) x = max(x, (y))
#define BIT(x,i) (((x) >> (i)) & 1)
#define YES(b) cout << ((b) ? "YES" : "NO") << endl
#define Yes(b) cout << ((b) ? "Yes" : "No") << endl
#define RETURN(x) cout << (x) << endl; return
const ll MAX = 1<<20;
ll A, B;
vi PRIMES({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71});
ll dp[77][MAX];
ll solve() {
dp[0][0] = 1;
FOR (i, A, B+1) {
ll factor = 0;
REP (ip, 20) if (i%PRIMES[ip] == 0) {
factor |= (1 << ip);
}
REP (k, MAX) {
dp[i-A+1][k] += dp[i-A][k];
if ((k&factor) == factor) dp[i-A+1][k] += dp[i-A][k^factor];
}
}
ll ans = 0;
REP (k, MAX) {
ans += dp[B-A+1][k];
}
return ans;
}
int main() {
cout << fixed << setprecision(15);
cin >> A >> B;
cout << solve() << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define lowbit(x) (x&-x)
#define reg register
#define mp make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x3f3f3f3f;
const int mo=1e9+7;
const int iv2=5e8+4;
const int lim=1000000;
const int jzm=1e6+7;
const int orG=3,invG=332748118;
const double Pi=acos(-1.0);
typedef pair<LL,LL> pii;
const double PI=acos(-1.0);
template<typename _T>
_T Fabs(_T x){return x<0?-x:x;}
template<typename _T>
void read(_T &x){
_T f=1;x=0;char s=getchar();
while(s>'9'||s<'0'){if(s=='-')f=-1;s=getchar();}
while('0'<=s&&s<='9'){x=(x<<3)+(x<<1)+(s^48);s=getchar();}
x*=f;
}
template<typename _T>
void print(_T x){if(x<0){x=(~x)+1;putchar('-');}if(x>9)print(x/10);putchar(x%10+'0');}
int gcd(int x,int y){return !y?x:gcd(y,x%y);}
int add(int x,int y){return x+y<mo?x+y:x+y-mo;}
LL n,ans[2005],tot;pii f[2005];
pii solve1(pii tmp){return mp(tmp.fir+1LL,tmp.sec);}
pii solve2(pii tmp){return mp(tmp.fir,tmp.sec+1LL);}
pii solve3(pii tmp){return mp(tmp.fir+tmp.sec,tmp.sec);}
pii solve4(pii tmp){return mp(tmp.fir,tmp.sec+tmp.fir);}
void extend(LL id){
tot=id;
while(f[tot].fir+f[tot].sec<=n){
if(f[tot].fir<=f[tot].sec)tot++,f[tot]=solve3(f[tot-1]),ans[tot]=3;
else tot++,f[tot]=solve4(f[tot-1]),ans[tot]=4;
}
}
LL check(LL id){return n-f[id].fir+id;}
void print(){
while(f[tot].fir<n)++tot,f[tot]=solve1(f[tot-1]),ans[tot]=1;
printf("%d\n",tot);for(int i=1;i<=tot;i++)printf("%d\n",ans[i]);
}
signed main(){
read(n);f[1]=solve2(f[0]);ans[1]=2;f[2]=solve1(f[1]);ans[2]=1;tot=2;extend(tot);
if(check(tot)<=130){print();return 0;}
for(int i=3;i<=tot;i++){
LL las=check(tot);pii ls=f[i];int lasway=ans[i];f[i]=solve1(f[i-1]);ans[i]=1;extend(i);
if(check(tot)>=las)f[i]=ls,ans[i]=lasway,extend(i);
//printf("%d:%lld %lld %lld %lld\n",i,f[i].fir,f[i].sec,check(tot),las);
las=check(tot);ls=f[i];lasway=ans[i];f[i]=solve2(f[i-1]);ans[i]=2;extend(i);
if(check(tot)>=las)f[i]=ls,ans[i]=lasway,extend(i);
//printf("%d:%lld %lld %lld %lld\n",i,f[i].fir,f[i].sec,check(tot),las);
las=check(tot);ls=f[i];lasway=ans[i];f[i]=solve3(f[i-1]);ans[i]=3;extend(i);
if(check(tot)>=las)f[i]=ls,ans[i]=lasway,extend(i);
//printf("%d:%lld %lld %lld %lld\n",i,f[i].fir,f[i].sec,check(tot),las);
las=check(tot);ls=f[i];lasway=ans[i];f[i]=solve4(f[i-1]);ans[i]=4;extend(i);
if(check(tot)>=las)f[i]=ls,ans[i]=lasway,extend(i);
//printf("%d:%lld %lld %lld %lld\n",i,f[i].fir,f[i].sec,check(tot),las);
if(check(tot)<=130){print();return 0;}
//printf("nxt %lld %lld\n",f[i+1].fir,f[i+1].sec);
}
print();
return 0;
}
/*
0 1
1 1
1 2
*/ | #include <bits/stdc++.h>
#define Ri register int
#define ll long long
#define db double
#define FOR(i, j, k) for(Ri i = j; i <= k; i++)
#define DEC(i, j, k) for(Ri i = j; i >= k; i--)
using namespace std;
const int maxn = 2e5 + 100;
int n;
vector<int> g[maxn];
int mx, xm;
int d[maxn];
inline void dfs(int u, int fa) {
d[u] = d[fa] + 1;
if(d[u] > mx) mx = d[u], xm = u;
for(Ri i = 0; i < g[u].size(); i++) {
if(g[u][i] == fa) continue;
dfs(g[u][i], u);
}
}
bool f[maxn];
void tagi(int u) {
if(!u) return;
f[u] = 1;
for(Ri i = 0; i < g[u].size(); i++) {
if(d[g[u][i]] < d[u]) {
tagi(g[u][i]);
break;
}
}
}
int out[maxn];
int sol(int u, int fa, int w) {
out[u] = ++w;
int h = 0;
for(Ri i = 0; i < g[u].size(); i++) {
if(g[u][i] == fa) continue;
if(f[g[u][i]]) {h = g[u][i]; continue;}
w = sol(g[u][i], u, w) + 1;
}
if(h) w = sol(h, u, w);
return w;
}
int main() {
scanf("%d", &n);
FOR(i, 2, n) {
int x, y;
scanf("%d%d", &x, &y);
g[x].push_back(y);
g[y].push_back(x);
}
mx = 0, xm = 0;
dfs(1, 0);
int w = xm;
mx = 0, xm = 0;
dfs(w, 0);
tagi(xm);
sol(w, 0, 0);
FOR(i, 1, n) printf("%d ", out[i]);
return 0;
}
|
#include<cstdio>
using namespace std;
const int mod=998244353;
int n,m,k;
int res;
int pow(int x,int t)
{
int r=1;
while(t) {
if(t&1) {
r=1ll*r*x%mod;
}
t>>=1,x=1ll*x*x%mod;
}
return r;
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
if((n==1)||(m==1)) {
res=pow(k,n==1?m:n);
} else {
for(int i=1;i<=k;++i) {
res=(res+1ll*(pow(i,n)-pow(i-1,n))*pow(k-i+1,m))%mod;
}
}
printf("%d\n",(res+mod)%mod);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define author "Sihare0riginals"
#define ss string
#define lli long long int
#define ld long double
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define I(a,i) memset(a,i,sizeof(a));
#define pb push_back
#define mp make_pair
#define L(i,start,end) for(lli i=start;i<=end;i++)
#define R(i,start,end) for(lli i=start;i>=end;i--)
#define ip(n) cin>>n;lli ip[n+1];L(i,1,n)cin>>ip[i];
const lli LINF = 1e18,mod=998244353;
void Bl0ck_M0mb0();
lli power(lli a,lli b,lli m){ if(b==0) return 1; if(b==1) return a%m;
lli t=power(a,b/2,m); t=(t*t)%m; if(b&1) t=(t*a)%m; return t;}
signed main()
{
Bl0ck_M0mb0();
lli t=1;
//cin>>t;
while(t--){
lli n,m,k,ans=0;
cin>>n>>m>>k;
L(i,1,k)
{
lli val=(power(i,n,mod)-power(i-1,n,mod)+mod)%mod;
//cout<<val<<" ";
lli x=k-i+1;
lli val1;
if(n==1)
val1=(power(x,m,mod)-power(x-1,m,mod)+mod)%mod;
else if(m!=1)
val1=power(x,m,mod);
else
val1=1;
val*=val1;
val%=mod;
//cout<<x<<" "<<val<<endl;
ans+=val;
ans%=mod;
}
cout<<ans<<endl;
}
return 0;
}
void Bl0ck_M0mb0(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("ip.txt","r",stdin);
freopen("op.txt","w",stdout);
#endif
}
/*
#define dbg1D(i,start,end,arr) for(lli i=start;i<=end;i++) cout<<i<<"th : "<<arr[i]<<endl;
#define dbg2D(i,j,s1,e1,s2,e2,arr) for(lli i=s1;i<=e1;i++){cout<<i<<"th :";for(lli j=s2;j<=e2;j++)cout<<arr[i][j]<<" ";cout<<endl;}
#define M map<lli,lli> \n #define sz(s) s.size()-1
#define P pair<lli,lli>
#define V vector<lli>
lli dx[4]={-1, 0, 0, +1};
lli dy[4]={0, -1, +1, 0};
lli power(lli a,lli b,lli m){ if(b==0) return 1; if(b==1) return a%m;
lli t=power(a,b/2,m); t=(t*t)%m; if(b&1) t=(t*a)%m; return t;}
lli modInverse(lli a, lli m) { return power(a, m-2, m); } */ |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[100005],f[100005][2],g[100005][2],p;
int main(){
scanf("%d",&n);
p=1e9+7;
for (int i=1;i<=n;i++) scanf("%lld",&a[i]);
g[0][1]=1;
for (int i=1;i<n;i++){
g[i][0]=g[i-1][1]%p;
g[i][1]=(g[i-1][1]+g[i-1][0])%p;
f[i][0]=(f[i-1][1]+(a[i]*g[i-1][1])%p)%p;
f[i][1]=(f[i-1][1]+(a[i]*g[i-1][1])%p)%p;
f[i][1]=(f[i][1]+f[i-1][0]-((a[i]*g[i-1][0])%p)+p)%p;
}
printf("%lld",((f[n-1][1]+g[n-1][1]*a[n])%p+(f[n-1][0]-((g[n-1][0]*a[n])%p)+p)%p)%p);
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 1e5 + 5;
const int ha = 1e9 + 7;
int f[MAXN],n;
inline void add(int &x,int y){
x += y-ha;x += x>>31&ha;
}
int main(){
f[0] = 1;f[1] = 2;FOR(i,2,MAXN-1) f[i] = (f[i-1]+f[i-2])%ha;
int ans = 0;scanf("%d",&n);
FOR(i,1,n){
int x;scanf("%d",&x);
if(i == 1) add(ans,1ll*x*f[n-1]%ha);
else{
add(ans,1ll*x*f[i-2]%ha*f[n-i]%ha);
add(ans,ha-1ll*x*f[std::max(0,i-3)]%ha*f[std::max(0,n-i-1)]%ha);
}
}
printf("%d\n",ans);
return 0;
}
// f[i] = f[i-1]+f[i-2]
|
#include <bits/stdc++.h>
using namespace std;
typedef int int2;
#define int long long
#define pi pair<int, int>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;
const int B = 450;
int t;
int2 main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(2 * n);
for (int i = 0; i < 2 * n; i++) {
cin >> a[i];
}
map<int, vector<int>> locs;
vector<pi> pairs;
for (int i = n - 1; i >= 0; i--) {
int e1 = a[i];
int e2 = a[2 * n - 1 - i];
pairs.eb(min(e1, e2), max(e1, e2));
}
int ans = 0;
multiset<int> cur;
for (int i = 0; i < n; i++) {
int mn = pairs[i].f;
int mx = pairs[i].s;
ans += mx;
if (!cur.empty() and *(cur.begin()) < mn) {
ans += (mn - (*cur.begin()));
cur.erase(cur.begin());
cur.insert(mn);
}
cur.insert(mx);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define int long long int
#include <time.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin>>n;
vector <int> v1;
vector <int> v2;
for(int i = 1;i<= n;i++){
int z;
cin>>z;
v1.push_back(z);
}
reverse(v1.begin() , v1.end() );
for(int i = 1;i<= n;i++){
int z;
cin>>z;
v2.push_back(z);
}
priority_queue <int> q;
for(int i = 0;i<n;i++){
q.push(-v1[i] );
q.push(-v2[i]);
q.pop();
}
int ans = 0;
while(q.size()){
ans+= -q.top();
q.pop();
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout<<(p)<<endl;
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll MOD = 998244353;
const ld PI = acos(-1);
template<typename T> void co(const vector<T>& v){for(const auto& e : v)
{ cout << e << " "; } cout << "\n";}
const ld EPS = 1e-11;
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T> void co(T e){cout << e << "\n";}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
inline ll ksm(ll a,ll b,const ll m=MOD) {
int ans = 1;
while (b) {
if (b & 1) ans = 1ll * ans * a % m;
a = 1ll * a * a % m;
b >>= 1;
}
return ans;
}
set<int> divisor(int n) {
set<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.insert(i);
if (i * i != n) ret.insert(n / i);
}
}
// sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
int main(){
int n, ans=0;
cin>>n;
vector<int> A;
set<int> B;
rep(i,n){
int l;
cin>>l;
A.push_back(l);
set<int> C;
C=divisor(l);
B.insert(C.begin(),C.end());
}
for(auto i:B){
bool flg=false;
int ret=0;
int flg2=0;
rep(j,n){
if(i>A[j]) {
flg2 = 1;
break;
}
if(A[j]%i==0){
if(flg != true){
ret = A[j]/i;
flg=true;
}
else ret = __gcd(ret, A[j]/i);
}
}
if(flg2==0&&ret==1)ans++;
}
co(ans);
}
| #include<bits/stdc++.h>
#define LL unsigned long long
using namespace std;
const int N=5e5+100;
const LL P=1e9+7;
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void print(LL x){
if(x>9) print(x/10);
putchar(x%10+'0');
}
inline int gcd(int a,int b)
{
return b>0 ? gcd(b,a%b):a;
}
void add(LL &x,LL y){
x+=y;if(x>=P)x-=P;
}
LL qpow(LL x,LL y){
LL re=1;
while(y){
if(y&1) re=re*x%P;
x=x*x%P;y>>=1;
}
return re;
}
int n,ans;
int a[2010];
map<int,int> mp;
void add(int x,int y){
int z=mp[x];
if(z==x) return;
z=gcd(z,y);
mp[x]=z;
if(z==x) ++ans;
return;
}
int main(){
int x;
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]);
sort(a+1,a+1+n);
ans=0;
for(int i=1;i<=n;++i) {
for(int j=1;j<=sqrt(a[i]);++j){
if(a[i]%j==0){
if(j<=a[1])add(j,a[i]);
if(j*j!=a[i]&&(a[i]/j)<=a[1]) add(a[i]/j,a[i]);
}
}
}
cout<<ans<<endl;
return 0;
} |
// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
out << "["; bool first = true;
for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}
typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
int main() {
int n;
cin >> n;
vector<double> a(n);
for (auto& x : a) cin >> x;
sort(a.begin(), a.end());
trace(a);
vector<double> pre(n + 1);
for (int i = 0; i < n; ++i) pre[i + 1] = pre[i] + a[i];
double ret = 1e300, cur;
// 2x <= a[0]
cur = pre[n] / n - a[0] / 2;
ret = min(ret, cur);
// 2x >= a[n - 1]
cur = a[n - 1] / 2;
ret = min(ret, cur);
for (int i = 1; i < n; ++i) {
// a[i - 1] <= 2x <= a[i]
// n * x + pre[n] - pre[i] - (n - i) * x * 2;
double x = 2 * i > n ? a[i - 1] / 2 : a[i] / 2;
cur = (n * x + pre[n] - pre[i] - (n - i) * 2 * x) / n;
ret = min(ret, cur);
}
cout << ret << '\n';
return 0;
}
| #include<iostream>
using namespace std;
double eps=1e-7;
double a[100005];
int n;
double gtval(double x){
double sum=0;
for(int i=1;i<=n;i++){
sum+=x+a[i]-min(a[i],x*2);
}
return sum;
}
int main(){
double mx=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
mx=max(mx,a[i]);
}
double l=0,r=mx,ml,mr;
while(r-l>eps){
ml=((double(r-l)))/3.0+l;
mr=((double(r-l)))/1.5+l;
//cout<<l<<' '<<ml<<' '<<mr<<' '<<r<<endl;
double v1=gtval(ml),v2=gtval(mr);
if(v1<v2)r=mr;
else l=ml;
}
printf("%.10lf",gtval(r)/n);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <deque>
#include <string>
#include <algorithm>
#include <functional>
#include <bitset>
#include <functional>
#include <chrono>
#include <random>
#define sqr(x) (x) * (x)
typedef unsigned int u32;
typedef int i32;
typedef unsigned long long int u64;
typedef long long int i64;
typedef uint16_t u16;
typedef int i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
using namespace std::chrono;
//const i64 mod = 1'000'000'000ll + 7;
const i64 smod = 998'244'353ll;
const i64 inf = 1'000'000'000'000'000'000ll;
const long double eps = 1e-8;
i64 val(i64 a) {
return (a * (a + 1) / 2) % smod;
}
int main(int argc, char* argv[]) {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(15); cout.setf(ios::fixed); cerr.precision(15); cerr.setf(ios::fixed);
i64 a, b, c;
cin >> a >> b >> c;
i64 R = (val(a) * val(b)) % smod;
R *= val(c);
R %= smod;
cout << R << endl;
return 0;
} | #include<bits/stdc++.h>
#define re register
#define int long long
using namespace std;
int n,m,a,b,c,d;
char s[1000002];
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
const int M=1e9+7;
inline void add(re int &x,re int y){(x+=y)>=M?x-=M:x;}
signed main(){
scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
printf("%lld",a*d-b*c);
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
char s[N], t[N];
stack<int> S, T;
int main() {
int n; long long ans = 0; scanf("%d", &n);
scanf("%s%s", s + 1, t + 1);
for (int i = 1; i <= n; i++) {
if (t[i] == '1') T.push(i);
if (s[i] == '1') {
if (!S.empty())
ans += i - S.top(), S.pop();
else {
if (T.empty()) S.push(i);
else ans += i - T.top(), T.pop();
}
}
}
if (!S.empty() || !T.empty()) puts("-1");
else printf("%lld\n", ans);
return 0;
}
| #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
V<ll> p={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
int main(){
ll a,b;
cin>>a>>b;
V<ll> dp((1<<20),0);
dp[0]=1;
V<ll> tmp={};
for(ll i=a;i<=b;i++){
ll v=0;
for(int j=0;j<20;j++){
if(i%p[j]==0)v+=(1ll<<j);
}
tmp.emplace_back(v);
}
int m=tmp.size();
for(int i=0;i<m;i++){
for(ll j=0;j<(1<<20);j++){
if((j&tmp[i])>0)continue;
dp[j|tmp[i]]+=dp[j];
}
}
ll ans=0;
for(int i=0;i<(1<<20);i++)ans+=dp[i];
cout<<ans<<"\n";
} |
#include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int bp = b - a;
int p = bp;
int d = a % p ? p - a % p : 0;
while (d + p > bp) {
p--;
d = a % p ? p - a % p : 0;
}
cout << p << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define w(t) int t;cin>>t;while(t--)
#define int long long
#define fr(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define pqi priority_queue<int>
#define pqd priority_queue<int,vi,greater<int>>
#define inf 1e18
#define mod 1000000007
#define PI 3.14159265358979323846264338327950288419716939937510
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a,b;
cin>>a>>b;
int ans=-1;
fr(i,1,b){
int x=(b/i)*i;
int y=((b/i)-1)*i;
if(y>=a && y<x){
ans=i;
}
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e18+9;
const int mod = 1e9+7;
const int maxn = 2e5+8;
int n, m;
void solve() {
int i, j;
map<int, int> mp;
cin >> n;
for (int x = 3, i = 1; x < n; i++, x *= 3) mp[x] = i;
for (int x = 5, i = 1; x < n; i++, x *= 5) if (mp.find(n - x) != mp.end()) return (void)(cout << mp[n - x] << " " << i << endl);
cout << -1 << endl;
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); //cout << fixed << setprecision(15);
int t = 1; //cin >> t;
while (t--) solve();
return 0;
}
| #include <iostream>
using namespace std;
// a^p
uint64_t my_p(uint64_t a, int p)
{
uint64_t ans = 1;
for (int i = 0; i < p; ++i) { ans *= a;}
return ans;
}
int main()
{
uint64_t N;
cin >> N;
for (int i = 1; i < 38; ++i)
{
for (int j = 1; j < 26; ++j)
{
uint64_t a = my_p(3, i) + my_p(5, j);
if (a == N)
{
cout << i << " " << j << endl;
return 0;
}
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vv = vector<vi>;
using Graph = vector<vector<int>>;
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; }
const ll mod = 1000000007;
const int INF = 100000000;
const double PI = acos(-1);
int main()
{
int n;
cin >> n;
string s;
cin >> s;
vector<char> v;
int ans = 0;
rep(i, n)
{
if (s[i] == 'f')v.push_back(s[i]);
else if (s[i] == 'o')v.push_back(s[i]);
else if (s[i] == 'x')
{
if (v.size() >= 2 && v[v.size() - 2] == 'f' && v[v.size() - 1] == 'o' )
{
ans++;
v.pop_back();
v.pop_back();
}
else v.clear();
}
else
{
v.clear();
}
}
cout << n - 3 * ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
string t = "";
for (auto c : s) {
t.push_back(c);
while (t.size() >= 3 && t.substr(t.size() - 3, 3) == "fox") {
for (int i = 0; i < 3; i++) t.pop_back();
}
}
cout << t.size() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (r)-1; (l) <= i; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0)
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define SZ(c) ((int)(c).size())
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << #x << " = " << (x) << '\n';
using P = pair<ll, ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VD = vector<double>;
using VVD = vector<VD>;
static const double EPS = 1e-10;
static const double PI = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const int INF = (1 << 30) - 1; // 1073741824 - 1
// static const ll INF = (1LL << 60) - 1; // 4611686018427387904 - 1
const int dx[4] = {1, 0, -1, 0};
const 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 / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string x;
cin >> x;
string ans = x.substr(1, 2);
ans += x[0];
COUT(ans);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
string ans = s.substr(1, s.size() - 1);
ans.push_back(s[0]);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
struct P{int to,idx;};
vector<vector<P>> edge;
vector<int> a,b;
vector<string> ans;
const string R="->",L="<-";
vector<int> used;
bool dfs(int from,int idx,int goal,int num){
used[idx]=num;
for(P p:edge[idx]){
if(idx==goal)return true;
if((ans[p.idx]==R&&a[p.idx]!=idx)||(ans[p.idx]==L&&b[p.idx]!=idx))continue;
if(p.to==from)continue;
if(used[p.to]==num)continue;
if(dfs(idx,p.to,goal,num)){
if(ans[p.idx]=="#"){
if(a[p.idx]==idx&&b[p.idx]==p.to)ans[p.idx]=R;
else if(b[p.idx]==idx&&a[p.idx]==p.to)ans[p.idx]=L;
}
return true;
}
}
return false;
}
signed main(){
int n,m;cin>>n>>m;
edge.resize(n);
a.resize(m);
b.resize(m);
vector<int> c(n);
REP(i,m)cin>>a[i]>>b[i];
REP(i,m)a[i]--;
REP(i,m)b[i]--;
REP(i,n)cin>>c[i];
used.resize(n,-1);
ans.resize(m,"#");
REP(i,m){
if(c[a[i]]>c[b[i]]){
ans[i]=R;
edge[a[i]].push_back({b[i],i});
}
else if(c[a[i]]<c[b[i]]){
ans[i]=L;
edge[b[i]].push_back({a[i],i});
}
else{
edge[a[i]].push_back({b[i],i});
edge[b[i]].push_back({a[i],i});
}
}
REP(i,m){
if(ans[i]!="#")continue;
if(dfs(b[i],a[i],b[i],2*i))ans[i]=L;
else{
dfs(a[i],b[i],a[i],2*i+1);
ans[i]=R;
}
}
REP(i,m)cout<<ans[i]<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
struct edge{ int to, id, orientation; };
vector<vector<edge>> graph;
vector<int> ans;
void DFS(int v){
for(edge e : graph[v]){
if(ans[e.id] != 0) continue;
ans[e.id] = e.orientation;
DFS(e.to);
}
}
int main(){
int n, m;
cin >> n >> m;
vector<int> a(m), b(m), c(n);
for(int i=0; i<m; i++) cin >> a[i] >> b[i];
for(int i=0; i<n; i++) cin >> c[i];
graph.resize(n);
ans.resize(m);
for(int i=0; i<m; i++){
a[i] -= 1;
b[i] -= 1;
graph[a[i]].push_back({b[i],i,+1});
graph[b[i]].push_back({a[i],i,-1});
if(c[a[i]] > c[b[i]]) ans[i] = +1;
if(c[a[i]] < c[b[i]]) ans[i] = -1;
}
for(int i=0; i<n; i++) DFS(i);
for(int i=0; i<m; i++){
if(ans[i] == +1) cout << "->" << endl;
if(ans[i] == -1) cout << "<-" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
using ll = long long;
int solve() {
int n; cin >> n;
string s; cin >> s;
if(s.front() != s.back()) return 1;
char a = s.front();
for(int i = 1; i < n - 2; ++i) {
if(s[i] != a && s[i + 1] != a) return 2;
}
return -1;
}
int main() {
cout << solve() << '\n';
return 0;
}
| #include<iostream>
#include<cstdio>
#include<cstring>
#define re register
#define X first
#define Y second
#define mp std::make_pair
#define pb push_back
#define ohh(hhh...) fprintf(stderr,hhh)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int,int> pii;
template<class T1> inline bool cmax(T1 &x,T1 y) {return x<y?(x=y,1):0;}
template<class T1> inline bool cmin(T1 &x,T1 y) {return x>y?(x=y,1):0;}
template<class T1> inline T1 dmax(T1 x,T1 y) {return x>y?x:y;}
template<class T1> inline T1 dmin(T1 x,T1 y) {return x<y?x:y;}
int n;
bool flag;
char s[100010];
int read()
{
int x=0,w=0;
char ch=0;
while(ch<'0'||ch>'9') w|=ch=='-',ch=getchar();
while('0'<=ch&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return w?-x:x;
}
int main()
{
n=read();
scanf("%s",s+1);
if(s[1]!=s[n]) {printf("1\n");return 0;}
for(re int i=2;i<n-1;i++) if(s[i]!=s[1]&&s[i+1]!=s[1]) flag=1;
if(flag) printf("2\n");
else printf("-1\n");
return 0;
} |
// //
// Radmanシ //
// //
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<stack>
using namespace std;
//#define int long long
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef pair<int,pii> pip;
#define F first
#define S second
const int maxn=2e5+5,maxlog=17;
int a[maxn],b[maxn],mark[maxn];
vector<int> v,yal[maxn];
map<int,int> mp;
int ans=0;
void dfs(int now)
{
mark[now]=1;
if(!b[a[now]])
{
b[a[now]]=1;
v.push_back(a[now]);
ans++;
}
for(int i=0;i<yal[now].size();i++)
{
int next=yal[now][i];
if(mark[next])
continue;
dfs(next);
}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n/2;i++)
{
yal[i].push_back(n-i+1);
yal[n-i+1].push_back(i);
}
for(int i=1;i<=n;i++)
{
if(mp[a[i]])
{
yal[i].push_back(mp[a[i]]);
yal[mp[a[i]]].push_back(i);
mp[a[i]]=i;
}
mp[a[i]]=i;
}
for(int i=1;i<=n;i++)
{
if(mark[i])
continue;
dfs(i);
while(v.size())
{
int l=v.back();
v.pop_back();
b[l]=0;
}
ans--;
}
cout<<ans<<endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
#include <bitset>
#include <math.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define pb push_back
#define fi first
#define se second
#define INF 2e9
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
class UnionFind{
private:
vector<int> parent, setSize;
int numSets;
public:
UnionFind(int N){
parent.assign(N, 0), setSize.assign(N, 1), numSets = N;
for(int i = 0; i < N; i++){parent[i] = i;}
}
int findSet(int v){return (v == parent[v] ? v : parent[v] = findSet(parent[v]));}
bool isSameSet(int v1, int v2){return (findSet(v1) == findSet(v2));}
void unionSet(int v1, int v2){
if(!isSameSet(v1, v2)){numSets--;
v1 = findSet(v1);v2 = findSet(v2);
if(setSize[v1] < setSize[v2]){swap(v1, v2);}
parent[v2] = v1;
setSize[v1] += setSize[v2];
}
}
int numDisjointSets(){return numSets;}
int sizeOfSet(int i){return setSize[findSet(i)];}
};
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
vector<int> in(n);
for(int i = 0; i < n; i++){
cin>>in[i];
}
int mxn = 2e5 + 5;
UnionFind uf(mxn);
for(int i = 0; i < n/2; i++){
if(in[i] == in[n-i-1]) continue;
if(in[i] != in[n-i-1]){
uf.unionSet(in[i], in[n-i-1]);
}
}
cout<<mxn - uf.numDisjointSets()<<endl;
return 0;
}
// unordered_map<int, int> mp;
// int parent(int cur){
// return (mp.count(cur) ? mp[cur] = parent(mp[cur]) : cur);
// }
// int main()
// {
// ios_base::sync_with_stdio(0);
// cin.tie(NULL);
// cout.tie(NULL);
// int n;
// cin>>n;
// vector<int> in(n);
// for(int i = 0; i < n; i++){
// cin>>in[i];
// }
// int count = 0;
// for(int i = 0; i < n/2; i++){
// if(in[i] == in[n-i-1]) continue;
// // if(mp.find(in[i]) != mp.end()) in[i] = mp[in[i]];
// // if(mp.find(in[n-i-1]) != mp.end()) in[n-i-1] = mp[in[n-i-1]];
// // // cout<<in[i]<<" "<<in[n-i-1]<<endl;
// // if(in[i] != in[n-i-1]){
// // mp[in[i]] = in[n-i-1];
// // if(rmp.count(in[i])){
// // mp[rmp[in[i]]] = in[n-i-1];
// // }
// // rmp[in[n-i-1]] = in[i];
// // count++;
// // }
// in[i] = parent(in[i]);
// in[n-i-1] = parent(in[n-i-1]);
// if(in[i] != in[n-i-1]){
// mp[in[i]] = in[n-i-1];
// count++;
// }
// }
// cout<<count<<endl;
// return 0;
// } |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//ifstream in("cowsignal.in");
//ofstream out("cowsignal.out");
void solve(){
map<ll, ll> cntJ;
ll n;
cin >> n;
ll a[n], b[n], c[n];
for (int i = 0; i < n; i++){
cin >> a[i];
}
for (int i = 0; i < n; i++){
cin >> b[i];
}
for (int i = 0; i < n; i++){
cin >> c[i];
cntJ[b[c[i]-1]]++;
}
ll ans = 0;
for (int i = 0; i < n; i++){
ans += cntJ[a[i]];
}
cout << ans;
}
//out << area(x1, y1, x2, y2) - iarea(x1, y1, x2, y2, xx1, yy1, xx2, yy2);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define all(arr) arr.begin(),arr.end()
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define nl cout<<"\n";
#define pq priority_queue
#define inf 0x3f3f3f3f
#define test cout<<"abcd\n";
#define pi pair<int,int>
#define pii pair<int,pi>
#define pb push_back
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#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 clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define MOD 1000000007
#define space ' '
#define kick(t) cout << "Case #" << t+1 << ":" << endl;
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;
template <typename T>
void input(vector<T> &arr,lli n) {
T temp;
for(lli i=0;i<n;i++) cin>>temp, arr.push_back(temp);
}
template <typename T>
void output(vector<T> arr) {
for(auto x:arr) cout<<x<<" ";
cout<<endl;
}
template <typename T>
void input_set(set<T> &arr,lli n) {
T temp;
for(lli i=0;i<n;i++) cin>>temp, arr.insert(temp);
}
lli mul(lli a, lli b) {
return (a%MOD*b%MOD)%MOD;
}
lli power(lli a,lli b) {
lli ans = 1;
while(b > 0) {
if(b&1)
ans = mul(ans, a);
a = mul(a,a);;
b >>= 1;
}
return ans;
}
void solve(int testcase) {
lli n;
cin >> n;
vector<lli> b;
vector<lli> c;
map<lli,lli> mp;
lli ans=0;
for(int i=0;i<n;i++){
lli a;
cin >> a;
mp[a]++;
}
input(b,n);
input(c,n);
for(int i=0;i<n;i++){
if(mp[b[c[i]-1]]){
//cout << ans << endl;
ans+= mp[b[c[i]-1]];
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli testcases=1;
//cin >> testcases;
for(int testcase=0; testcase<testcases; testcase++) {
solve(testcase);
}
}
|
#include <iostream>
using namespace std;
int main(void){
long long n, k;
cin >> n >> k;
for (int i = 0; i < k; i++){
if (n % 200 == 0){
n = n / 200;
}
else {
string nn = to_string(n);
nn += "200";
n = stoll(nn);
}
}
cout << n << endl;
} | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <cassert>
#include <climits>
#include <bitset>
#include <functional>
#include <iomanip>
#include <random>
#define FOR_LT(i, beg, end) for (decltype(end) i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (decltype(end) i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (decltype(beg) i = beg; end <= i; i--)
#define REP(n) for (decltype(n) repeat_index = 0; repeat_index < n; repeat_index++)
using namespace std;
template<typename T, size_t S>
T minval(const T(&vals)[S])
{
T val = numeric_limits<T>::max();
FOR_LT(i, 0, S) {
val = min(val, vals[i]);
}
return val;
}
template<typename T, size_t S>
T maxval(const T(&vals)[S])
{
T val = numeric_limits<T>::min();
FOR_LT(i, 0, S) {
val = max(val, vals[i]);
}
return val;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(20);
double a, b; cin >> a >> b;
cout << (a - b) / a * 100.0 << endl;
return 0;
} |
#include<bits/stdc++.h>
#define sf1(n) scanf("%d",&n)
#define sf2(n,q) scanf("%d %d",&n,&q)
#define f first
#define ss second
#define pb push_back
#define lli long long
#define mem(ar,false) memset(ar,false,sizeof(ar))
#define mpr make_pair
#define endl "\n"
#define mod 1000000007
#define inf 900000000000000LL
#define M 200005
using namespace std;
int vis[400005];
int ar[400005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int cnt = 0;
for(int i=1;i<=n;i++)
{
int d = i;
int f=1;
while(d)
{
if(d%10==7)
{
f=0;
break;
}
d/=10;
}
if(f==0)
{
cnt++;
continue;
}
d = i;
while(d)
{
if(d%8==7)
{
f=0;
break;
}
d/=8;
}
if(f==0) cnt++;
}
cout << n-cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
bool ok = true;
for (int x = i; ok && x; x /= 10) {
ok &= (x % 10) != 7;
}
for (int x = i; ok && x; x /= 8) {
ok &= (x % 8) != 7;
}
ans += ok;
}
cout << ans << '\n';
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007LL
//#define MOD 998244353LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>; // intの2次元の型に vvi という別名をつける
const ll llMAX=9223372036854775807LL;
const ll llMIN=-9223372036854775808LL;
void myprint1D(vi &data)
{
REP(i,data.size())
cout<<data[i]<<" ";
cout<<endl;
}
//配列を[y][x]で表示
void myprint2D_T(vvi &data)
{
REP(i,data.size())
myprint1D(data[i]);
}
//配列を[x][y]で表示
void myprint2D(vvi &data)
{
ll l1=data.size();
ll l2=data[0].size();
REP(j,l2){
REP(i,l1)
cout<<data[i][j]<<" ";
cout<<endl;
}
}
//print(a,b...)って使い方
void print1(ll a){cout<<a<<endl;}
void print2(ll a,ll b){cout<<a<<" "<<b<<endl;}
void print3(ll a,ll b,ll c){cout<<a<<" "<<b<<" "<<c<<endl;}
void print4(ll a,ll b,ll c,ll d){cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;}
void print5(ll a,ll b,ll c,ll d,ll e){cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<endl;}
ll n,k,x,y;
int main(){
ll ans=0;
cin >> n >> k;
vi a(40,0),b(1048576),c(1048576);
REP(i,n) cin>>a[i];
REP(i,1048576){
REP(j,20){
if ((i>>j)%2==1)b[i]+=a[j];
}
}
REP(i,1048576){
REP(j,20){
if ((i>>j)%2==1)c[i]+=a[j+20];
}
}
sort(b.begin(), b.end());
sort(c.begin(), c.end());
REP(i,1048576){
ll bb=b[i];
if (k<bb)continue;
if (k==bb){ans=k;break;}
ll y=k-bb;
//y未満の数の個数を求めたい
auto Iter = lower_bound(c.begin(),c.end(), y);
ll ynum=(Iter-c.begin());
if (ynum==0){
continue;
}
ans=max(c[ynum-1]+bb,ans);
if (c[ynum]==y){ans=k;break;}
}
cout<<ans<<endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
struct UnionFind {
//自身が親であれば、その集合に属する頂点数に-1を掛けたもの
//そうでなければ親のid
vector<int> r;
vector<map<int,int>> mp;
UnionFind(int N) {
r = vector<int>(N, -1);
mp = vector<map<int,int>>(N);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (abs(-r[x]) > abs(-r[y])) swap(x, y);
//xの集合の方が要素数が小さい
for(auto p : mp[x]){
mp[y][p.first] += p.second;
}
mp[x] = map<int,int>();
r[y] += r[x];
r[x] = y;
return true;
}
int size(int x) {
return -r[root(x)];
}
};
int main(){
ll a,b,c,d; cin >> a >> b >> c >> d;
cout << a*d - b*c << endl;
} |
#include <iostream>
using namespace std;
int main()
{
char a,b,c;
cin>>a>>b>>c;
cout<<b<<c<<a;
return 0;
}
| #include<stdio.h>
int main ()
{
int g,j,i,h;
scanf("%d %d\n%d %d",&g,&h,&i,&j);
printf("%d",g*j-h*i);
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
string S; cin >> S;
int A[110];
for(int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int ans = 100000;
for(int i = 0; i < N; i++) {
ans = min(ans, abs(A[i] - A[i + 1]));
}
cout << ans << endl;
for(int i = 0; i < ans; i++) {
for(int j = 0; j < N + 1; j++) {
if(j != 0) cout << " ";
cout << (A[j] + i) / ans;
}
cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define lli long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define plli pair<lli,lli>
#define vi vector<int>
#define vlli vector<lli>
#define vpi vector<pii>
#define vplli vector<plli>
#define mi map<int,int>
#define mlli map<lli,lli>
#define forl(i,a,b) for(lli i=a;i<b;i++)
#define ford(i,a,b) for(lli i=a;i>=b;i--)
#define cout0(a) cout << a << endl
#define cout1(a) cout << a << " "
#define cout2(a,b) cout << a << " " << b << endl
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl
lli gcd(lli a,lli b)
{
if(b>a)
{
lli t=a;
a=b;
b=t;
}
while(b!=0)
{
lli t = a;
a = b;
b = t%b;
}
return a;
}
bool sortbysec(const pair<lli,lli> &a,const pair<lli,lli> &b)
{
return (a.first < b.first);
}
void dfs(vlli v[],lli s,lli depth[],lli isvisited[])
{
forl(i,0,v[s].size())
{
lli t=v[s][i];
if(!isvisited[t])
{
depth[t]=depth[s]+1;
isvisited[t]++;
dfs(v,t,depth,isvisited);
}
}
}
lli nCr(lli n,lli r)
{
lli p = 1,k = 1;
if (n-r < r) r = n - r;
if (r != 0)
{
while (r)
{
p*=n;
k*=r;
lli m = __gcd(p, k);
p/=m;
k/=m;
n--;
r--;
}
}
else p = 1;
return p;
}
lli SieveOfEratosthenes(lli n)
{
bool prime[n+1];
memset(prime,true,n+1);
forl(i,2,n+1)
if(prime[i])
for(lli j=2*i;j<n+1;j+=i)
prime[i]=false;
lli count=0;
forl(i,2,n+1)
if(prime[i]) count++;
return count;
}
int main()
{
fastio;
// time_t start, end;
// time(&start);
lli q;
// cin >> q;
q = 1;
while(q--)
{
lli h,w;
cin >> h >> w;
char grid[h+1][w+1];
forl(i,1,h+1)
{
forl(j,1,w+1)
{
cin >> grid[i][j];
}
}
lli starter[h+1][w+1];
lli opponent[h+1][w+1];
ford(j,w,1)
{
ford(i,h,1)
{
lli s_d = INT_MIN,s_r = INT_MIN, o_d = 0, o_r = 0;
if(i==h && j==w)
{
starter[i][j] = 0;
opponent[i][j] = 0;
}
else
{
if(i<h)
{
if(grid[i+1][j] == '+') s_d = 1+opponent[i+1][j];
else s_d = -1+opponent[i+1][j];
o_d = starter[i+1][j];
}
if(j<w)
{
if(grid[i][j+1] == '+') s_r = 1+opponent[i][j+1];
else s_r = -1+opponent[i][j+1];
o_r = starter[i][j+1];
}
if(s_d-o_d > s_r-o_r)
{
starter[i][j] = s_d;
opponent[i][j] = starter[i+1][j];
}
else
{
starter[i][j] = s_r;
opponent[i][j] = starter[i][j+1];
}
}
}
}
if(starter[1][1] > opponent[1][1]) cout0("Takahashi");
else if(starter[1][1] < opponent[1][1]) cout0("Aoki");
else cout0("Draw");
}
// time(&end);
// cout<<fixed<<double(end - start)<<setprecision(10)<<endl;
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18
using namespace std;
typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;
ll n, Q;
vector<ll> G[200005];
ll a[200005], b[200005];
ll add[200005], ans[200005];
ll parent[200005];
void predfs(int v, int p)
{
parent[v] = p;
for(auto u : G[v]){
if(u == p) continue;
predfs(u, v);
}
}
void dfs(int v, int p, ll s)
{
s += add[v];
ans[v] = s;
for(auto u : G[v]){
if(u == p) continue;
dfs(u, v, s);
}
}
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
rep(i, 1, n-1){
cin >> a[i] >> b[i];
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
predfs(1, 0);
cin >> Q;
ll t, e, x;
ll sum = 0;
rep(i, 1, Q){
cin >> t >> e >> x;
ll u = a[e], v = b[e];
if(t == 1){
if(parent[v] == u) sum += x, add[v] -= x;
else add[u] += x;
}
else{
if(parent[v] == u) add[v] += x;
else sum += x, add[u] -= x;
}
}
dfs(1, 0, 0);
rep(i, 1, n) cout << ans[i] + sum << "\n";
flush(cout);
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
#define rrep(i,x) for(int i=(int)x-1;i>=0;--i)
#define rrep1(i,x) for(int i=(int)x;i>=1;--i)
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int, int>;
using vpii=vector<pii>;
template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>p){os<<"("<<p.fst<<", "<<p.scd<<")";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<typename T>T&max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T&min(T&a,T&b){if(a < b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a < b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a > b){a=b;return true;}return false;}
constexpr ll TEN(ll n){return n==0?1:10ll*TEN(n-1);}
constexpr ll inf = TEN(9)+5;
constexpr ll linf = 3*TEN(18);
struct UF {
vi data;
void init(int n)
{
data.resize(n);
fill(all(data), -1);
}
int root(int x)
{
return data[x] < 0 ? x : data[x] = root(data[x]);
}
void unite(int x, int y)
{
x = root(x);
y = root(y);
if (x == y) return;
if (size(x) < size(y)) swap(x, y);
data[x] += data[y];
data[y] = x;
}
bool same(int x, int y)
{
return root(x) == root(y);
}
int size(int x)
{
x = root(x);
return -data[x];
}
bool is_root(int x)
{
return x == root(x);
}
};
UF uf;
vector<int> G[200020];
signed main()
{
int N, M; cin >> N >> M;
vi a(N), b(N);
vector<ll> asum(N), bsum(N);
uf.init(N + 5);
rep(i, N) cin >> a[i];
rep(i, N) cin >> b[i];
rep(i, M) {
int c, d; cin >> c >> d;
--c, --d;
uf.unite(c, d);
}
rep(i, N) {
asum[uf.root(i)] += a[i];
bsum[uf.root(i)] += b[i];
}
bool f = true;
rep(i, N) {
if (asum[i] != bsum[i]) f = false;
}
cout << (f ? "Yes" : "No") << '\n';
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)
#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e << " ";} cerr << "\n";}
#define logvp(a) {cerr << #a << " = "; fore(e, a) {cerr << "(" << e.first << ", " << e.second << ") ";} cerr << "\n";}
#define logvv(a) {cerr << #a << " = \n"; fore(r, a) { fore(e, r) {cerr << e << " ";} cerr << "\n";} }
#define logvf(a, field) {cerr << #a"."#field << " = \n"; fore(e, a) { cerr << e.field << " ";} cerr << "\n"; }
#define logvff(a, f1, f2) {cerr << #a".{"#f1 << ", "#f2 << "} = \n"; fore(e, a) { cerr << "(" << e.f1 <<", " << e.f2 << ") ";} cerr << "\n"; }
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) cerr << #a << " = " << "(" << a.first << ", " << a.second << ")" << "\n";
#define cond(pred, stmt) if (pred) { stmt }
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template<typename T> using vec = vector<T>;
template<typename T, typename Dim>
auto make_vec(T value, Dim dim) { return vector<T>(dim, value); }
template<typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) { return make_vec(make_vec(value, dims...), dim1); }
template<typename T>
bool uax(T& v, const T& newv) { if (v < newv) { v = newv; return true; } else return false; }
template<typename T>
bool uin(T& v, const T& newv) { if (v > newv) { v = newv; return true; } else return false; }
template<typename T>
istream& operator>>(istream& is, vector<T>& c) { for (auto& e : c) is >> e; return is; }
template<typename T, size_t N>
istream& operator>>(istream& is, array<T, N>& c) { for (auto& e : c) is >> e; return is; }
template<typename ...T>
istream& read(T&... args) { return (cin >> ... >> args); }
static mt19937 rande(123123);
template<typename T>
T rand_int(T from, T to) { uniform_int_distribution<T> distr(from, to); return distr(rande); }
// const i64 INF = 2e18;
const int INF = 2e9;
const i64 M = 998244353;
const int MXB = 20;
using bin = bitset<MXB + 1>;
const double EPS = 1e-8;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
rande.seed(chrono::steady_clock::now().time_since_epoch().count());
int n;
while (read(n)) {
llvec a(2 * n);
read(a);
vec<iip> pa(2 * n);
forn(i, 2 * n) {
pa[i] = {a[i], i};
}
sort(pa.begin(), pa.end());
ivec used(2 * n);
forn(i, n) {
used[pa[i].second] = true;
}
string res;
int bal = 0;
int last = 0;
forn(i, 2 * n) {
if (bal == 0) {
last = used[i];
res += '(';
bal++;
} else {
if (used[i] == last) {
res += '(';
bal++;
} else {
res += ')';
bal--;
}
}
}
cout << res << endl;
}
} | #include<bits/stdc++.h>
#define M 400005
using namespace std;
int n;
pair<int,int> A[M],B[M],md;
int cnt[2];
char S[M];
int main(){
scanf("%d",&n);n*=2;
for(int i=1;i<=n;i++){
scanf("%d",&A[i].first);
A[i].second=i;
B[i]=A[i];
}
sort(B+1,B+n+1);
md=B[n/2];
for(int i=1;i<=n;i++){
int t=(A[i]<=md);
if(cnt[!t]>0)S[i]=')',cnt[!t]--;
else S[i]='(',cnt[t]++;
}
printf("%s\n",S+1);
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long N;
cin >> N;
int ans = 0;
for(long long i=1; ; i++){
if(stoll(to_string(i)+to_string(i))<=N) ans += 1;
else break;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
/*long long a,b,c;
if(a==0 or a==1 or a==5 or a==6){
cout<<a<<"\n";
}else{
}*/
string memo;
cin>>memo;
long long th=memo.size();
map<char,long long> save;
long long sum=th,ans=0,con,k,i;
for(i=th-1,con=0;i>=0;i--,con++){
save[memo[i]]+=1;
char aux=memo[i];
if(i>0){
long long lol=con,j=i;
for(k=0;memo[i-1]==aux && i>=0;i--,k++){
con+=1;
if(k==0){
ans+=con-save[aux];
//cout<<con<<" "<<save[aux]<<" "<<i<<"\n";
}
save[aux]+=1;
}
if(k>0){
save.clear();
save[aux]=con+1;
}
}
}
cout<<ans<<"\n";
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#include <unordered_map>
#include <iomanip>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#define pi 3.141592653589793
#define prique priority_queue
constexpr auto mod=1000000007;
constexpr auto MOD=1000000000000000;
using namespace std;
int gcd(int a,int b){
if(b==0) return a;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a*b/gcd(a,b);
}
void syou(int a,double b){
cout<<setprecision(a)<<b<<endl;
}
bool prime(int n){
int cnt=0;
for(int i=1;i<=sqrt(n);i++){
if(n%1==0)cnt++;
}
if(cnt!=1) return false;
else return n!=1;
}
struct UnionFind{
vector<int> r;
UnionFind(int N){
r=vector<int>(N,-1);
}
int root(int x){
if(r[x]<0) return x;
return r[x]=root(r[x]);
}
bool unite(int x,int y){
x=root(x);
y=root(y);
if(x==y) return false;
if(r[x]>r[y]) swap(x,y);
r[x]+=r[y];
r[y]=x;
return true;
}
int size(int x){
return -r[root(x)];
}
};
struct Edge{
int to;
int weight;
};
vector<int> v;
int n=0,m=0,cnt=0,ans=0,aa[220000];
pair<int,int> pp[220000];
string s,ss[220000],sa;
queue<int> que;
signed main(){
cin>>n;
rep(i,n){
cin>>pp[i].first>>pp[i].second;
}
rep(i,n){
rep(j,i){
if(abs(pp[i].first-pp[j].first)>=abs(pp[i].second-pp[j].second)){
cnt++;
}
}
}
cout<<cnt<<endl;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
#define coutfix(i) cout << fixed << setprecision(i) //coutの浮動小数出力の桁数設定
using namespace std;
int main()
{
int64 nn, mm, ans = 0;
cin >> nn >> mm;
vector<int64> memo(nn, 0);
string ss;
for(int64 ii = 0;ii < nn;ii++)
{
cin >> ss;
for(int64 jj = 0;jj < mm;jj++)
{
if(ss[jj] == '1')
{
memo[ii] += (1ll << jj);
}
}
}
for(int64 ii = 0;ii < nn;ii++)
{
int64 tmp = bitset<21>(memo[ii]).count();
if(tmp % 2 == 1)
{
ans++;
}
}
cout << ans * (nn - ans) << endl;
return 0;
} |
/*
By: Anurag Rai
CF: Raag07
CC: call_me_raag
*/
#include<bits/stdc++.h>
#define FIO std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(it, a, b) for(int it = a; it < b; ++it)
#define all(X) (X).begin(), (X).end()
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define sq(X) (X) * (X)
#define mod 1000000007
#define NUM 1000000
using namespace std;
// 1-D <=> 2-D (N*M)
// k <-> [k / N, k % M]
int max(int a, int b) { return a > b ? a : b; }
int min(int a, int b) { return a < b ? a : b; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
bool comp(int a, int b) { return a > b; }
bool sortbySS(const pair<int, int> &A, const pair<int, int> &B) { return A.ss < B.ss; }
void solve() {
// Write your code here
string S;
cin >> S;
string res = "";
for(int i = S.length(); i > 0; --i) {
if(S[i-1] == '6')
res += '9';
else if(S[i-1] == '9')
res += '6';
else
res += S[i-1];
}
cout << res << endl;
}
int32_t main() {
FIO;
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define N 107
#define ldb long double
char s[N][N];
int g[N][N],cnt[N],n;
bool vis[N];
ldb f[N],cof[N];
void dfs(int v){
cnt[v]++; vis[v]=1;
for(int i=1;i<=n;i++)
if(g[v][i]&&!vis[i])
dfs(i);
}
int main(){
//freopen("cpp.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%s",s[i]+1);
for(int j=1;j<=n;j++)
g[i][j]=s[i][j]-'0';
}
for(int i=1;i<=n;i++){
memset(vis,0,sizeof(vis));
dfs(i);
}
ldb ans=0;
for(int i=1;i<=n;i++)
ans+=1.0/cnt[i];
printf("%.10Lf\n",ans);
return 0;
}
|
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;
#define X first
#define Y second
#define eb emplace_back
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int getRand(int L, int R) {
if (L > R) swap(L, R);
return (int)(rng() % (uint64_t)(R - L + 1) + L);
}
template<typename T1, typename T2>
ostream& operator << (ostream &os, pair<T1, T2> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template<typename T>
ostream& operator << (ostream &os, vector<T> vec) {
for (int i = 0; i < vec.size(); ++i) {
if (i) os << " ";
os << vec[i];
}
return os;
}
void solve() {
string s; cin >> s;
int ans = 0;
for (int i = 0; i < s.size()-3; ++i) ans += s.substr(i, 4) == "ZONe";
cout << ans << "\n";
}
int32_t main() {
fastIO();
int t = 1; // cin >> t;
for (int _ = 1; _ <= t; ++_) {
// cout << "Case #" << _ << ": ";
solve();
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int ans=0, i;
string s;
cin >> s;
while ( s.find("ZONe")<s.size() ){
i=s.find("ZONe");
s.erase(i,4);
ans++;
}
cout << ans;
} |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
unsigned char C[4000100];
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
fread(C, 1, 4000100, stdin);
int N = 0;
char c = 0;
auto ci = C;
while ((c = *ci++) >= '0') N = N * 10 + c - '0';
auto S = ci;
rep(i, N) S[i] = (S[i] >> 3 ^ S[i]) & 3;
N--;
int k = 0;
while (N > 0) {
int K = 1;
int tmp = N;
while (tmp >= 3) {
K *= 3;
tmp /= 3;
}
rep(i, N - K + 1) {
S[i] += S[i + K];
}
N -= K;
k++;
if (k % 6 == 0) rep(i, N + 1) S[i] %= 3;
}
int tmp = (S[0] % 3);
if (tmp == 0) cout << 'R';
else if ((tmp == 2) ^ (k & 1)) cout << 'B';
else cout << 'W';
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 400010;
char s[MAXN];
const int MOD = 3;
int cnt3[MAXN], pref_cnt3[MAXN];
int fac[MAXN];
int nck_brute (int n, int k) {
long long ans = 1;
for (int i = n; i > n - k; i--) ans *= i;
for (int i = 1; i <= k; i++) ans /= i;
return ans % 3;
}
int nck(int n, int k) {
int cnt3_up = pref_cnt3[n] - pref_cnt3[n - k];
int cnt3_down = pref_cnt3[k];
if (cnt3_up > cnt3_down) {
return 0;
}
return fac[n] * fac[n - k] * fac[k] % 3;
}
int main() {
int n;
scanf("%d", &n);
fac[0] = 1;
for (int i = 0; i < n; i++) {
int p = 0, j = i;
while (j > 0 && j % 3 == 0) {
p += 1;
j /= 3;
}
cnt3[i] = p;
pref_cnt3[i] = (i > 0 ? pref_cnt3[i - 1] : 0) + cnt3[i];
if (i > 0) {
fac[i] = fac[i - 1] * j % 3;
}
}
scanf("%s", s + 1);
int ans = 0;
for (int i = 1; i <= n; i++) {
int val = s[i] == 'B' ? 0 : s[i] == 'R' ? 1 : 2;
int c = nck(n - 1, i - 1);
ans += c * (n % 2 == 0 ? (3 - val) : val);
}
ans %= 3;
cout << "BRW"[ans] << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <class T> string join(const T &v, const string delim = ",")
{
if (v.empty())
return "";
ostringstream res;
res << v[0];
for (int i = 1; i < v.size(); i++)
{
res << delim << v[i];
}
return res.str();
}
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << ":" << #x << " = " << (x) << endl;
#else
#define dbg
#endif
#pragma endregion Macros
ll g(int N, int M, vector<ll>& H, vector<ll>& W, vector<ll>& lsum, vector<ll>& rsum, ll w, int idx){
ll res = abs(H[idx] - w);
res += lsum[idx / 2];
res += rsum[(idx+1)/ 2];
/*
dbg("--");
dbg(w);
dbg(idx);
dbg(res);
*/
return res;
}
ll f(int N, int M, vector<ll>& H, vector<ll>& W, vector<ll>& lsum, vector<ll>& rsum, ll w){
ll res = 1LL<<60;
int idx = lower_bound(H.begin(), H.end(),w) - H.begin();
if(idx%2==0) {
if (idx < N) chmin(res, g(N, M, H, W, lsum, rsum, w, idx));
}else{
if (idx+1 < N) chmin(res, g(N, M, H, W, lsum, rsum, w, idx+1));
if (idx-1 >=0) chmin(res, g(N, M, H, W, lsum, rsum, w, idx-1));
}
return res;
}
int main()
{
int N, M;
cin >> N >> M;
vector<ll> H(N);
rep(i, N) cin >> H[i];
vector<ll> W(M);
rep(i, M) cin >> W[i];
sort(H.begin(), H.end());
vector<ll> diff1(N / 2), diff2(N/2);
for(int i=0;i<N/2;i++){
diff1[i] = abs(H[i*2] - H[i*2 + 1]);
diff2[i] = abs(H[i*2+1] - H[i*2+2]);
}
vector<ll> lsum(N / 2 + 1), rsum(N / 2 + 1);
for(int i=1;i<N/2+1;i++){
lsum[i] = lsum[i - 1] + diff1[i-1];
}
for(int i=N/2-1;i>=0;i--){
rsum[i] = rsum[i + 1] + diff2[i];
}
ll ans = 1LL<<60;
for(auto w: W){
ll res = f(N,M,H,W,lsum,rsum,w);
chmin(ans, res);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2e5 + 10;
ll qian[MAX] , hou[MAX] , w[MAX] , h[MAX];
int N , M;
int main() {
cin >> N >> M;
register int i;
for(i = 1;i <= N; ++i)
cin >> h[i];
for(i = 1;i <= M; ++i)
cin >> w[i];
sort(h + 1 , h + N + 1);
for(i = 2; i <= N; i += 2)
qian[i] = qian[i - 2] + abs(h[i] - h[i - 1]);
for(i = N - 1; i >= 1; i -= 2)
hou[i] = hou[i + 2] + abs(h[i + 1] - h[i]);
ll ans = 1e18;
for(i = 1; i <= M; ++i) {
int pos = lower_bound(h + 1 , h + N + 1 , w[i]) - h;
if(pos % 2 == 0) --pos;
ans = min(ans , qian[pos - 1] + hou[pos + 1] + abs(h[pos] - w[i]));
}
printf("%lld\n" , ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define unused [[maybe_unused]]
#define tempT template<class T>
#define pcnt(x) __builtin_popcountll(x)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define isin2d(i, j, h, w) (isin((i), 0, (h)) && isin((j), 0, (w)))
#define debug(x) cerr << #x << ": " << x << endl
#define ans_exit(x) { cout << (x) << endl; exit(0); }
#define ans_return(x) { cout << (x) << endl; return; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define r_rep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define reps(i, n, m) for (ll i = (ll)(n); i < (ll)(m); i++)
#define r_reps(i, n, m) for (ll i = (ll)(m) - 1; i >= (ll)(n); i--)
#define _dbgarr(a) {for(auto _e:(a)){cerr << _e << " ";} cerr << endl;}
#define printarr(a) {for(auto _e:(a)){cout << _e << " ";} cout << endl;}
#define debugarr(a) {cerr << #a << ": "; _dbgarr(a);}
using ll unused = long long;
using ld unused = long double;
using vl unused = vector<ll>;
using vvl unused = vector<vl>;
using vvvl unused = vector<vvl>;
using vstr unused = vector<string>;
using vb unused = vector<bool>;
using lp unused = pair<ll, ll>;
using lt unused = tuple<ll, ll, ll>;
using lmap unused = map<ll, ll>;
unused constexpr ll MOD = 998244353;
unused constexpr ll INF = 1 << 29;
unused constexpr ll LINF = 1LL << 61;
unused constexpr double EPS = 1e-10;
unused constexpr int DX[8] = {0, 1, 0,-1, 1, 1,-1,-1};
unused constexpr int DY[8] = {1, 0,-1, 0, 1,-1, 1,-1};
unused inline bool bit(ll b, ll i) { return b & (1LL << i); }
unused inline ll ceiv(ll a, ll b) { return (a + b - 1) / b; }
unused inline ll mod(ll a, ll m = MOD) { return (a % m + m) % m; }
unused inline void modadd(ll &a, ll b, ll m = MOD) { a = mod(a + b, m); }
unused inline ll floordiv(ll a, ll b) { return a / b - (a < 0 && a % b); }
unused inline ll ceildiv(ll a, ll b) { return floordiv(a + b - 1, b); }
tempT unused bool chmin(T &a, T b) { if(a > b) {a = b; return 1;} return 0; }
tempT unused bool chmax(T &a, T b) { if(a < b) {a = b; return 1;} return 0; }
int main() {
ll h, w; cin >> h >> w;
vstr field(h); rep(i, h) cin >> field[i];
set<char> chars[h + w - 1];
rep(i, h) rep(j, w) {
chars[i + j].insert(field[i][j]);
}
ll ans = 1;
rep(i, h + w - 1) {
if(chars[i].count('B') && chars[i].count('R')) {
ans_exit(0);
} else if(chars[i].count('.') && chars[i].size() == 1) {
ans = (ans * 2) % MOD;
}
}
cout << ans << 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> nds;
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pair<int,int>>
#define vpci vector<pair<char,int>>
#define vpcc vector<pair<char,char>>
#define mi map<int,int>
#define mc map<char,int>
#define mpii map<pair<int,int>,int>
#define mpci map<pair<char,int>,int>
#define mpsi map<pair<string,int>,int>
#define ms map<string,int>
#define pii pair<int,int>
#define pc pair<char,char>
#define fbo find_by_order // (use *) value at index in sorted array.
#define odk order_of_key // tells index of element in array.
#define int long long int
#define double long double
#define inf 1e18
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define debug(x) cout<<x<<endl
#define debugc cout<<"!"<<endl
#define wt() int tt; cin>>tt;while(tt--)
# define f(x,a,b) for(int x = a; x <= b; x++)
# define fr(x,a,b) for(int x = b; x >= a; x--)
int max(int a,int b){return (a>=b)?a:b;}
int min(int a,int b){return (a<=b)?a:b;}
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
int rnd(int limit)
{
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<> dis(1, limit);
return dis(gen);
}
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
vpii p;
void factors(int n)
{
int cnt=0;
while (n % 2 == 0)
{
cnt++;
n = n/2;
}
if(cnt)
p.pb({2,cnt});
cnt=0;
for (int i = 3; i <= sqrt(n); i = i + 2)
{
cnt=0;
while (n % i == 0)
{
cnt++;
n = n/i;
}
p.pb({i,cnt});
}
if (n > 2)
p.pb({n,1});
}
int mod=1e9+7;
const int N=2e6;
int fact[N+1], ifact[N+1];
int power(int a,int b)
{
if(b==0)
return 1;
int res=power(a,b/2);
if(b&1)
res = ((res%mod*res%mod)%mod*a)%mod;
else
res=(res%mod*res%mod)%mod;
return res%mod;
}
void pre()
{
fact[0]=1;
f(i,1,N)
fact[i]=((fact[i-1]%mod)*i)%mod;
//inverse
ifact[N]=power(fact[N],mod-2)%mod;;
fr(i,1,N)
ifact[i-1]=((ifact[i])*i)%mod;
}
int ncr(int n,int r)
{
if(r>n)
return 0;
int ans=fact[n];
ans=((ans%mod)*(ifact[n-r])%mod)%mod;
ans=((ans%mod)*(ifact[r]%mod))%mod;
return ans;
}
int npr(int n, int r)
{
if(r>n)
return 0;
int ans=fact[n];
ans=((ans%mod)*(ifact[n-r])%mod)%mod;
return ans;
}
// In mathematics problem just always avoid floating precision errors(We can avoid it by multipling
//everyting with the number we are dividing) and also avoid mod on negative number mistakes(always add +mod)
// __gcd(x, y) = __gcd(x - y, x)
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
pre();
int n, m, k;
cin>>n>>m>>k;
if( n > m + k)
{
cout<<"0"<<endl;
return 0;
}
int ans = (ncr(n + m, n) - ncr(n + m, n - k - 1) + mod) % mod;
cout<<ans % mod<<endl;
}
|
#include <cstdio>
int a[1005];
int b[1005];
int f[1005][1005];
int vis[1005][1005];
int max(int a,int b){ return a>b?a:b; }
void solve(int i,int j){
vis[i][j] = 1;
if(i==0 || j==0) f[i][j] = max(i,j);
else{
if(!vis[i-1][j]) solve(i-1,j);
if(!vis[i][j-1]) solve(i,j-1);
if(!vis[i-1][j-1]) solve(i-1,j-1);
f[i][j] = 1e8+7;
if(f[i][j] > f[i-1][j]+1) f[i][j] = f[i-1][j]+1;
//if(i==2 && j==1) printf("1: %d\n",f[i][j]);
if(f[i][j] > f[i][j-1]+1) f[i][j] = f[i][j-1]+1;
//if(i==2 && j==1) printf("2: %d\n",f[i][j]);
int offer = f[i-1][j-1] + (a[i]!=b[j]);
//if(i==2 && j==1) printf("offer = %d\n",offer);
if(f[i][j] > offer) f[i][j] = offer;
//if(i==2 && j==1) printf("3: %d\n",f[i][j]);
}
//printf("f[%d][%d] = %d\n",i,j,f[i][j]);
}
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++) scanf("%d",&a[i]);
for(int i = 1; i <= m; i++) scanf("%d",&b[i]);
solve(n,m);
printf("%d\n",f[n][m]);
return 0;
}
| // generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)
#include <bits/stdc++.h>
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all(v) v.begin(), v.end()
using namespace std;
using i64 = long long int;
i64 solve(int N, int M, const vector<i64> & A, const vector<i64> & B) {
// TODO: edit here
vector<vector<i64>> dp(N + 1, vector<i64>(M + 1));
rep(i, N + 1) dp[i][0] = i;
rep(i, M + 1) dp[0][i] = i;
rep(i, N){
rep(j, M){
dp[i + 1][j + 1] = min({dp[i][j + 1] + 1, dp[i + 1][j] + 1, dp[i][j] + (A[i] == B[j] ? 0LL : 1LL)});
}
}
return dp[N][M];
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr char endl = '\n';
int N, M;
cin >> N;
vector<i64> A(N);
cin >> M;
vector<i64> B(M);
rep (i, N) {
cin >> A[i];
}
rep (i, M) {
cin >> B[i];
}
auto ans = solve(N, M, A, B);
cout << ans << endl;
return 0;
}
|
/*
我的心脏怦怦跳，监管者就在附近
name:
Algorithm:
writer:Lxs(cdx)
place:
nothing is impossible
*/
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#include<string>
#include<iostream>
#include<cmath>
#include<set>
#include<stack>
#include<queue>
#include<unistd.h>
#include<stdio.h>
#include<cstring>
#define random(a,b) (rand()%(b-a+1)+a)
using namespace std;
bool prime(int x){
int i;
if(x<2) return 0;
for(i=2;i*i<=x;i++){
if(x%i==0){return 0;}
}
return 1;
}
bool flag[19999990];
int _prime[19999990];
void get_prime(int maxn)
{
int i,j;
for(i=2;i<=maxn;i++)
if(!flag[i])
{
_prime[++_prime[0]]=i;
for(j=i*i;j<=maxn;j+=i)
flag[j]=true;
}
}
int main()
{
int a,b;
cin>>a>>b;
cout<<a*2+100-b<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << max(0, (2 * (a) + 100) - b) << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl, greater<ll>> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef map<ll, ll> ml;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {return (a % b + b) % b;}
ll quo(ll a, ll b) {return (a - mod(a, b)) / b;}
template <typename T, typename U> bool chmin(T &a, const U b) {if(a > b) {a = b; return 1;} return 0;}
template <typename T, typename U> bool chmax(T &a, const U b) {if(a < b) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vl v(2*n);
rep(i, 2*n) cin >> v[i];
pql pique;
rep(i, n) {
pique.push(v[n-1-i]);
pique.push(v[n+i]);
pique.pop();
}
ll ans = 0;
while(!pique.empty()) {
ans += pique.top();
pique.pop();
}
cout << ans << newl;
return 0;
} | #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);}
#define N 200016
int x[N], y[N], f[N];
void inc(int n, int i)
{
for (; i <= n; i += i&-i) ++f[i];
}
int get(int i)
{
int res = 0;
for (; i; i -= i&-i) res += f[i];
return res;
}
int main()
{
canhazfast();
int n, p = 0;
ll ans = 0;
priority_queue<pii, vpii, greater<pii>> q;
cin >> n;
for (int i = n; i >= 1; --i) {
cin >> x[i];
ans += x[i];
}
for (int i = 1; i <= n; ++i) {
cin >> y[i];
ans += y[i];
}
for (int i = 0; i < n; ++i) {
while (p < n && get(p) >= p) {
++p;
q.emp(x[p], p);
q.emp(y[p], p);
}
pii u = q.top();
q.pop();
ans -= u.fir;
inc(n, u.sec);
}
cout << ans << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sq(x) (x)*(x)
#define PI acos(-1.0)
#define all(x) x.begin(),x.end()
#define nl '\n'
#define mod 1000000007
typedef long long int ll;
typedef unsigned long long int llu;
int main()
{
ll t;
cin>>t;
while(t--)
{
ll a,b;
cin>>a>>b;
// ll ans=0;
// for(ll i=b;i>=a+a;i--)
// {
// ll x=i-2*a +1;
// ans+=x;
// }
// cout<<ans<<nl;
ll ans=0;
ll x=2*a;
if(b>=x)
{
x=b-x+1;
ans+=x*(x+1)/2;
}
cout<<ans<<nl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y))
#define chmax(x,y) x = max((x),(y))
#define popcount(x) __builtin_popcount(x)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;
void solve(){
int n;
cin >> n;
vector<int> p(n);
rep(i,n) cin >> p[i];
rep(i,n) --p[i];
random_device seed_gen;
mt19937_64 rnd(seed_gen());
uniform_int_distribution<int> dist_a(0, n-2);
int m = 0;
vector<int> ans;
while(1){
bool change = false;
rep(i,n-1){
if(abs(i-m)%2==0 && p[i] > p[i+1]){
swap(p[i],p[i+1]);
ans.push_back(i);
change = true;
++m;
break;
}
}
bool ok = true;
rep(i,n) if(p[i] != i) ok = false;
if(ok) break;
if(!change && !ok){
int ind = n-2;
if(abs(ind-m)%2==1) ind--;
swap(p[ind],p[ind+1]);
ans.push_back(ind);
++m;
}
}
cout << m << endl;
rep(i,m) cout << ans[i]+1 << " ";
cout << endl;
return;
}
int main(){
int t;
cin >> t;
while(t--){
solve();
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
if(n%2==0){
cout<<"White";
}
else{
cout<<"Black";
}
return 0;
} | //BY: YASH JAIN, CF: yashjain0333
#include <bits/stdc++.h>
using namespace std;
#define May_the_fork_be_with_you ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define rall(v) v.rbegin(),v.rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define deb(x) cout<<#x<<": "<<x<<endl;
#define debn(x) cout<<#x<<": "<<x<<" ";
#define MOD 998244353
#define INF 1e18
#define ll long long
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define int long long
#define N 100
#define mod 998244353
#define sq(x) ((x)*(x))
typedef vector<int> vi;
ll gcd(ll a, ll b) {if (!b)return a; return gcd(b, a % b);}
ll power(ll x, ll y, ll p = INF) {ll res = 1; x %= p; while (y > 0) {if (y & 1)res = (res * x) % p; y = y >> 1; x = (x * x) % p;} return res;}
void solve() {
int n; cin >> n;
if (n % 2) cout << "Black";
else cout << "White";
}
int32_t main() {
#ifndef ONLINE_JUDGE
// for geting input form input.txt
freopen("input.txt", "r", stdin);
// for wrting output to output.txt
freopen("output.txt", "w", stdout);
#endif
May_the_fork_be_with_you
int t = 1;
// cin >> t;
cout << fixed << setprecision(12);
while (t--) {
solve();
}
cerr << "Time Taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <climits>
#include <cctype>
#define rg register
#define Fo(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(int i=(a);i>=(b);--i)
#define Fill(x,n) memset((x),(n),sizeof(x))
using namespace std;
typedef long long ll;
typedef unsigned int uint;
const int MX=300;
int N;
/*
const uint A[]=
{
0b11001001,
0b10101010,
0b10011100,
0b11000110,
0b10100101,
0b10010011,
0b11110000
};
*//*
const uint A[]=
{
0b10011100,
0b10101010,
0b11001001,
0b10010011,
0b10100101,
0b11000110,
0b11110000
};*/
char A[MX][MX];
void solve(int N)
{
if(N==1){A[0][0]=1;return;}
solve(N-1);
int x=1<<(N-1),y=x-1;
Fo(i,0,y)Fo(j,0,x)
A[y+i][j]=A[i][j];
Fo(i,0,y)Fo(j,0,x)
A[i][x+j]=A[y-1-i][j];
Fo(i,0,y)Fo(j,0,x)
A[y+i][x+j]=A[i][x+j]^1;
Fo(j,0,x)A[y+y][j]=1;
// Fo(i,0,(1<<N)-1){Fo(j,0,1<<N)printf("%d",A[i][j]);printf("\n");}
}
/*
int check(int N)
{
int x=1<<N;
int y=x-1;
int z=-1;
Fo(i,0,x)Fo(j,0,x)if(i!=j)
{
int cnt=0;
Fo(k,0,y)if(A[k][i]==A[k][j])++cnt;
printf("%d\n",cnt);
if(z==-1)z=cnt;
else if(z!=cnt)return 0;
}
return 1;
}
*/
/*
int main()
{
solve(5);
int res=check(5);
printf("%d\n",res);
return 0;
}
*/
int main()
{
scanf("%d",&N);
solve(N);
int x=1<<N,y=x-1;
printf("%d\n",y);
Fo(i,0,y)Fo(j,0,x)A[i][j]+='A';
Fo(i,0,y)printf("%s\n",A[i]);
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define ci(x) cin >> x
#define ci2(x, y) cin >> x >> y
#define ci3(x, y, z) cin >> x >> y >> z
#define ci4(w, x, y, z) cin >> w >> x >> y >> z
#define co(x) cout << x << endl
#define co2(x, y) cout << x << " " << y << endl
#define co3(x, y, z) cout << x << " " << y << " " << z << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> PQ;
typedef priority_queue<int, vector<int>, greater<int>> PQG;
typedef priority_queue<P> PQP;
typedef priority_queue<P, vector<P>, greater<P>> PQPG;
const int MAX_N = 2e5, MOD = 1e9 + 7, INF = 1e9;
int n, po[8];
vector<string> s[8];
int main() {
ci(n);
po[0] = 1;
rep(i, n - 1) po[i + 1] = 2 * po[i] + 1;
s[0].epb("AB");
rep(i, n - 1) {
rep(j, po[i]) {
string tmp1, tmp2;
for (auto &c: s[i][j]) {
tmp1.append(2, c);
tmp2.append(1, c);
tmp2.append(1, 'A' + (c - 'A' + 1) % 2);
}
s[i + 1].epb(tmp1);
s[i + 1].epb(tmp2);
}
string tmp;
rep(j, po[i] + 1) tmp.append("AB");
s[i + 1].epb(tmp);
}
co(po[n - 1]);
rep(i, po[n - 1]) co(s[n - 1][i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inline void RI(i64 &i) {scanf("%lld", &(i));}
inline void RVI(vi &v) { for(i64 i=0;i<sz(v);++i) { RI(v[i]); } }
inline void RVVI(vvi &vv) { for(i64 i=0;i<sz(vv);++i) { RVI(vv[i]); } }
inline void WI(const i64 &i) {printf("%lld\n", i);}
inline void WVI(const vi &v, char sep=' ') { for(i64 i=0;i<sz(v);++i) { if(i != 0){ printf("%c", sep); } printf("%lld", v[i]);} printf("\n"); }
inline void WS(const string &s) { printf("%s\n", s.c_str()); }
inline void WB(bool b, const string &yes, const string &no) { if(b){ WS(yes);} else { WS(no);} }
inline void YESNO(bool b) { WB(b, "YES", "NO"); }
inline void YesNo(bool b) { WB(b, "Yes", "No"); }
#define BUF_LENGTH 1000000
inline void RS(string &s) {static char buf[BUF_LENGTH]; scanf("%s", buf); s = buf;}
template<typename T> inline bool IN(T &S, const typename T::key_type &key) {
return S.find(key) != S.end();
}
template<typename T> inline bool ON(const T &b, i64 idx) {
return ((T(1) << idx) & b) != 0;
}
int main(int argc, char *argv[]) {
i64 i, j, k;
i64 N, M; RI(N); RI(M);
vector<string> S(M);
i64 L_min = 100, L_max = 0;
unordered_set<string> SS;
REP(0, M, i) {
RS(S[i]);
L_min = min(L_min, sz(S[i]));
L_max = max(L_max, sz(S[i]));
}
sort(all(S), [](const string &lhs, const string &rhs) {
return lhs.size() > rhs.size();
});
unordered_set<string> sub;
for(auto &s: S) {
if(!IN(sub, s)) {
SS.insert(s);
REP(0, sz(s), i) { // left
REP(L_min, sz(s)-i+1, j) { // length
sub.insert(s.substr(i, j));
}
}
}
}
S.clear();
for(auto &s: SS) {
S.pb(s);
}
M = sz(S);
i64 L_avg = (L_min + L_max) / 2;
sort(all(S), [](const string &lhs, const string &rhs) {
return lhs.size() < rhs.size();
});
vector<string> ans(N, string(N, '.'));
// horizontal
vi pos(N, 0);
i64 idx = 0;
bool loop = true;
while(loop) {
loop = false;
REP(0, N, i) {
if(idx < M && pos[i] + sz(S[idx]) <= N) {
for(auto &c: S[idx]) {
assert(ans[i][pos[i]] == '.');
ans[i][pos[i]] = c;
pos[i]++;
}
++idx;
loop = true;
}
}
}
i64 p_max = *max_element(all(pos));
vi pos2(N, 0);
loop = true;
while(loop) {
loop = false;
REP(p_max, N, i) {
if(idx < M && pos2[i] + sz(S[idx]) <= N) {
for(auto &c: S[idx]) {
assert(ans[pos2[i]][i] == '.');
ans[pos2[i]][i] = c;
pos2[i]++;
}
++idx;
loop = true;
}
}
}
REP(0, N, i) {
REP(0, N, j) {
if(ans[i][j] == '.') {
ans[i][j] = 'A' + (rand() % 8);
}
}
}
REP(0, N, i) {
WS(ans[i]);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
string ans[20];
void output();
void init();
bool yokoni_dekirudake_umeru();
void yokoni_umeru(int,int);
int n,m;
int used_m;
string next_s();
vector<string> s;
int main(){ //2,3は無視でいいんじゃないか？
init();
bool filled = false;
while(used_m < m && !filled){
filled = yokoni_dekirudake_umeru();
}
output();
}
bool yokoni_dekirudake_umeru(){
bool filled = true;
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
if(ans[i][j] == '.' && (j + (int)(next_s().size()) <= n + 1)){ //tyuui koko
yokoni_umeru(i,j);
filled = false;
}
}
}
return filled;
}
void yokoni_umeru(int i , int j){
for(int k = 0 ; k < next_s().size() ; k++){
ans[i][j+k] = next_s()[k];
}
used_m++;
}
string next_s(){
return s[used_m];
}
void init(){
cin >> n >> m;
for(int i = 0 ; i < 20 ; i++){
for(int j = 0 ; j < 20 ; j++){
if(j==0)ans[i] = "";
ans[i] += ".";
}
}
for(int i = 0 ; i < m ; i++){
string st;
cin >> st;
s.push_back(st);
}
sort(s.begin(),s.end());
reverse(s.begin(),s.end());
}
void output(){
for(int i = 0 ; i < 20 ; i++){
cout << ans[i] << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define Endl '\n'
#define cont continue
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/__gcd(a,b)
#define pb push_back
#define mp make_pair
#define mem(x) memset(x, 0, sizeof(x))
const ll inf=1e18;
const int mod=1e9+7;
inline int bigmod(int B,int P){int R=1;while(P>0){if(P&1){R=(R*B)%mod;}P>>=1;B=(B*B)%mod;}return R;}
const int mxn = 2e5+10;
int Mod(int a) {
if(a < 0)
return (a+mod)%mod;
else return a % mod;
}
int Mul(int a, int b) {
return Mod(Mod(a) * Mod(b));
}
int Add(int a, int b) {
return Mod(Mod(a) + Mod(b));
}
//ll fact[mxn];
//ll in_fact[mxn];
//fact[0] = 1;
//for(ll i = 1; i < mxn; i++) {
//fact[i] = (i*fact[i-1])%mod;
//}
//in_fact[mxn-1] = bigmod(fact[mxn-1],mod-2);
//for(ll i = mxn-2; i >= 0; i--) {
//in_fact[i] = (in_fact[i+1] * (i+1))%mod;
//}
//ll c(ll n,ll r) {
//ll ans = (fact[n] * (in_fact[r] * in_fact[n-r]%mod))%mod;
//return ans;
//}
signed main(){
fast;
//freopen ("input.txt", "r", stdin);
//freopen ("output.txt", "w", stdout);
int tt = 1;
//cin>>tt;
for(int tc = 1; tc <= tt; tc++) {
int n;
cin>>n;
priority_queue<int>pq;
unordered_map<int,int>vis;
int mn = inf;
for(int i = 0; i < n; i++) {
int x;
cin>>x;
mn = min(mn,x);
if(!vis[x]) {
vis[x] = 1;
pq.push(x);
}
}
while(pq.size() > 1) {
int mx = pq.top();
pq.pop();
int nw = mx%mn;
if(!nw) cont;
if(!vis[nw]) {
vis[nw] = 1;
if(nw < mn) mn = nw;
pq.push(nw);
}
}
cout<<mn<<endl;
//for(int i = 0; i < n; i++) {
//int x;
//cin>>x;
//if(!vis[x]) {
//ip.pb(x);
//vis[x] = 1;
//}
//}
//sort(ip.begin(),ip.end());
//if(ip.size() > 1) {
//ans = ip[0];
//for(int i = 1; i < ip.size(); i++) {
//ans = min(ans,ip[i]-ip[i-1]
}
return 0;
}
| /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>
#include <random>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 61;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
return f.second > s.second;
}
ll gcd(ll a, ll b){
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll conbinationMemo[201][12];
void cmemoInit(){
rep(i, 201){
rep(j, 12){
conbinationMemo[i][j] = -1;
}
}
}
ll nCr(ll n, ll r){
if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
if(r == 0 || r == n){
return 1;
} else if(r == 1){
return n;
}
return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r){
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--) ret *= i;
return ret;
}
//-----------------------ここから-----------
int main(void){
ll n;
cin >> n;
vector<pair<ll,ll>> ps;
rep(i, n){
ll x, y;
cin >> x >> y;
ps.push_back({x, y});
}
ll m;
cin >> m;
vector<pair<ll,ll>> ops;
rep(i, m){
ll t;
cin >> t;
if(t == 1 || t == 2){
ops.push_back({t, -1});
} else {
ll p;
cin >> p;
ops.push_back({t, p});
}
}
ll q;
cin >> q;
vector<pair<ll,ll>> qs;
rep(i, q){
ll a, b;
cin >> a >> b;
b--;
qs.push_back({a, b});
}
ll x = 1, y = 1;
pair<ll,ll> o = {0, 0};
ll swp = 0;
struct S{
ll x;
ll y;
pair<ll,ll> o;
ll swp;
};
vector<S> vec;
vec.push_back({1, 1, {0, 0}, 0});
rep(i, m){
pair<ll,ll> op = ops[i];
if(op.first == 1){
x *= -1;
swap(x, y);
o.first *= -1;
swap(o.first, o.second);
swp--;
swp %= 2;
while(swp < 0) swp += 2;
} else if(op.first == 2){
y *= -1;
swap(x, y);
o.second *= -1;
swap(o.first, o.second);
swp++;
swp %= 2;
while(swp < 0) swp += 2;
} else if(op.first == 3){
//if(swp == 0){
o.first += 2 * (op.second - o.first);
//} else {
//o.second += 2 * (op.second - o.second);
//}
x *= -1;
} else {
//if(swp == 0){
o.second += 2 * (op.second - o.second);
//} else {
//o.first += 2 * (op.second - o.first);
//}
y *= -1;
}
vec.push_back({x, y, o, swp});
}
rep(i, q){
S s = vec[qs[i].first];
if(s.swp == 0){
cout << ps[qs[i].second].first * s.x + s.o.first << " " << ps[qs[i].second].second * s.y + s.o.second << endl;
} else {
cout << ps[qs[i].second].second * s.x + s.o.first << " " << ps[qs[i].second].first * s.y + s.o.second << endl;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;
vector<ll> fac;
void c_fac(ll x=pow(10,7)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { ll d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
int main() {
ll A, B; cin >> A >> B;
ll result = 2*A+100 - B;
cout << result << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
#define repc(i,f,n) for(char i=(f); (i) <= (n); i++)
#define PI 3.14159265358979323846264338327950ll
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
#define Pl pair<ll, ll>
#define dvec vector<vector<ll>>
#define OUT(x) cout << x << endl; return 0;
//printf("%.10f\n")
//cout << fixed << setprecision(10);
template<class T> inline bool chmax(T& a, T b){if (a < b) { a = b; return true; } return false;}
template<class T> inline bool chmaxe(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 = 1000000007ll;
const ll INF = 1e+18;
const int iINF = 1e9;
const double EPS = 1e-8;
vector<vector<ll>> x, y, z, memo;
ll
f(ll H, ll W, vector<string> &grd)
{
if(H == 1 && W == 1) return 1;
if(H < 1 || W < 1) return 0;
if(grd[H - 1][W - 1] == '#') return 0;
if(memo[H][W] != -1) return memo[H][W];
x[H][W] = (f(H - 1, W, grd) + x[H - 1][W] + MOD) % MOD;
y[H][W] = (f(H, W - 1, grd) + y[H][W - 1] + MOD) % MOD;
z[H][W] = (f(H - 1, W - 1, grd) + z[H - 1][W - 1] + MOD) % MOD;
return memo[H][W] = (x[H][W] + y[H][W] + z[H][W] + MOD) % MOD;
}
int
main()
{
ll H, W; cin >> H >> W;
vector<string> grd(H);
rep(i, 0, H) cin >> grd[i];
x.assign(H + 1, vector<ll>(W + 1, 0));
y.assign(H + 1, vector<ll>(W + 1, 0));
z.assign(H + 1, vector<ll>(W + 1, 0));
memo.assign(H + 1, vector<ll>(W + 1, -1));
cout << f(H, W, grd) << endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.