code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 1000000007ll //998244353ll
#define lld long double
#define mii map<int, int>
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; i++)
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define print2d(dp,n,m) for(int i=0;i<=n;i++){for(int j=0;j<=m;j++)cout<<dp[i][j]<<" ";cout<<"\n";}
typedef std::numeric_limits< double > dbl;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
const long long N=200005, INF=2000000000000000000;
lld pi=3.1415926535897932;
int lcm(int a, int b)
{
int g=__gcd(a, b);
return a/g*b;
}
int power(int a, int b, int p)
{
if(a==0)
return 0;
int res=1;
a%=p;
while(b>0)
{
if(b&1)
res=(res*a)%p;
b>>=1;
a=(a*a)%p;
}
return res;
}
int32_t main()
{
IOS;
int n;
cin>>n;
int h[n];
rep(i,0,n)
cin>>h[i];
mii mp;
mp[0]++;
int sum=0, ans=0;
rep(i,0,n)
{
if(i&1)
sum+=h[i];
else
sum-=h[i];
ans+=mp[sum];
mp[sum]++;
}
cout<<ans;
} | #include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
int N;
cin >> N;
vector <int> A(N);
ll ans = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
if(i % 2) A[i] *= -1;
}
map <ll, int> cnt;
cnt[0] = 1;
ll S = 0;
for(int i = 0; i < N; i++) {
S += A[i];
ans += cnt[S];
cnt[S]++;
}
cout << ans;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include <chrono>
/* #include <atcoder/all> */
/* using namespace atcoder; */
using namespace std;
void debug_out(){ cout << "\n"; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = 1000000007;
/* const ll MOD = 998244353; */
const ll INF = 1ll<<60;
const double PI = acos(-1);
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
string s;
cin >> s;
bool ans = true;
REP(i, s.size()){
if(i%2 == 0){
if('A' <= s[i] && s[i] <= 'Z') ans = false;
}else{
if('a' <= s[i] && s[i] <= 'z') ans = false;
}
}
if(ans) Yes;
else No;
return 0;
}
| #include<iostream>
using namespace std;
int main()
{
string s;
cin>>s;
for(int i=0;i<s.size();i++)
{
if(i%2==0)
{
if(s[i]<'a'||s[i]>'z')
{
cout<<"No";return 0;
}
}
else{
if(s[i]<'A'||s[i]>'Z')
{
cout<<"No";return 0;
}
}
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef map<ll, ll> ml;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {return (a % b + b) % b;}
ll quo(ll a, ll b) {return (a - mod(a, b)) / b;}
template <typename T, typename U> bool chmin(T &a, const U b) {if(a > b) {a = b; return 1;} return 0;}
template <typename T, typename U> bool chmax(T &a, const U b) {if(a < b) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
ll t, n;
bool f;
vl p, inv, ans;
void op(ll num) {
ans.push_back(num);
swap(p[num], p[num+1]);
inv[p[num]] = num;
inv[p[num+1]] = num+1;
f = !f;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> t;
rep(_, t) {
cin >> n;
f = 0;
p = vl(n);
inv = vl(n);
ans = vl(0);
rep(i, n) {
cin >> p[i];
p[i]--;
inv[p[i]] = i;
}
if(n >= 5) {
rep3(i, n-1, 4) {
if(inv[i] == i) continue;
else if(f ^ (inv[i] & 1)) {
if(inv[i] >= 3) op(inv[i] - 3);
else op(inv[i] + 1);
}
while(inv[i] != i) op(inv[i]);
}
}
if(n >= 4 && p[3] != 3) {
if(f) op(1);
if(inv[3] == 0) {op(0); op(1); op(2);}
if(inv[3] == 1) {op(2); op(1); op(2);}
if(inv[3] == 2) {op(2);}
}
while(p[0] != 0 || p[1] != 1) {
if(f) op(1);
else op(0);
}
cout << ans.size() << newl;
rep(i, ans.size()) cout << ans[i] + 1 << ' ';
cout << newl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void sub(int n, int *p, vector<int> &ans, int k){
for(int c = 0; c < 20; c++){
bool f = true;
for(int i = n - 3; i < n; i++){
if(p[i] != i) f = false;
}
if(f) return;
else{
if(k % 2 == (n - 2) % 2){
ans.push_back(n - 2);
swap(p[n - 2], p[n - 1]);
k++;
}
else{
ans.push_back(n - 3);
swap(p[n - 3], p[n - 2]);
k++;
}
}
}
}
void query(int n, int *p){
if(n == 2){
if(p[0] == 0){
cout << 0 << endl;
}
else{
cout << 1 << endl << 1 << endl;
}
return;
}
vector<int> ans;
int k = 0;
for(int c = 0; c < n - 3; c++){
for(int i = c; i < n; i++){
if(i == c) continue;
if(p[i] == c){
if((i - 1) % 2 != k % 2){
if(i != n - 1){
ans.push_back(i);
swap(p[i], p[i + 1]);
k++;
ans.push_back(i - 1);
swap(p[i - 1], p[i]);
k++;
i++;
}
else{
ans.push_back(i - 2);
swap(p[i - 2], p[i - 1]);
k++;
}
}
for(int j = i - 1; j >= c; j--){
ans.push_back(j);
swap(p[j], p[j + 1]);
k++;
}
}
}
}
sub(n, p, ans, k);
cout << (int)ans.size() << endl;
for(int i : ans) cout << i + 1 << " ";
cout << endl;
}
int main()
{
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int p[505];
for(int i = 0; i < n; i++){
cin >> p[i];
p[i]--;
}
query(n, p);
}
}
|
#include<bits/stdc++.h>
using namespace std;
int n,a[100010];
inline int read()
{
int x=0,w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return w?-x:x;
}
int gcd(int N,int M)
{while(N^=M^=N^=M%=N);return M;}
int main()
{
n=read();
for(int i=1;i<=n;i++){
a[i]=read();
a[1]=gcd(a[1],a[i]);
}
cout<<a[1]<<'\n';
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 10;
int a[N]; int n;
int gcd(int x,int y){return (y==0) ? x : gcd(y,x%y);}
signed main() {
scanf("%lld",&n);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
int s = a[1]; for(int i=2;i<=n;i++) s = gcd(s,a[i]);
printf("%lld\n",s);
} |
#include <bits/stdc++.h>
using namespace std;
long long dp[205][12];
int n;
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
dp[i][1] = 1;
}
for(int i = 2; i <= 12; i++) {
for(int j = 1; j <= n; j++) {
for(int k = 1; k < j; k++) {
dp[j][i] += dp[k][i - 1];
}
}
}
cout << dp[n][12];
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int L;
cin >> L;
L --;
long long answer = 1;
vector<bool> check(12, true);
for(int n = L-10; n <= L; n++){
int n_before = n;
for(int r = 11; r >= 2; r--){
if(check.at(r)){
if(n_before % r == 0){
n_before /= r;
check.at(r) = false;
}
}
}
answer *= n_before;
}
for(int i = 2; i <= 11; i++){
if(check.at(i)){
answer /= i;
}
}
cout << answer << "\n";
} |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
//定数
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007 //問題による
//略記
#define F first
#define S second
//出力(空白区切りで昇順に)
#define coutALL(x) for(auto i=x.begin();i!=--x.end();i++)cout<<*i<<" ";cout<<*--x.end()<<endl;
//aをbで割る時の繰上げ,繰り下げ
ll myceil(ll a,ll b){return (a+(b-1))/b;}
ll myfloor(ll a,ll b){return a/b;}
int ri() {int n;cin >> n;return n;}
#define ro(a) {cout << a << endl;}
void printVector(const std::vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
ll factorial(ll N) {
ll f = 1;
REP(i, N) {
f *= i+1;
}
return f;
}
signed main() {
float A = ri(), B = ri(), C = ri(), D = ri();
if (C * D - B <= 0) {
ro(-1);
return 0;
}
float tmp = A / (C * D - B);
ro(ceil(tmp));
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#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 sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
const ll mod = 998244353;
vector<int> par, rnk;
void init(int N){ par.resize(N); rnk.assign(N,0); rep(i,N) {par[i] = i;} }
int root(int x) { return par[x] == x? x : par[x] = root(par[x]); }
bool same(int x, int y) { return root(x) == root(y); }
void unite(int x, int y){
x = root(x); y = root(y);
if(x==y) return;
if(rnk[x] < rnk[y]) par[x] = y;
else{
par[y] = x;
if(rnk[x] == rnk[y]) rnk[x]++;
}
}
ll mpow(ll a, ll x){
ll res = 1;
while(x > 0){
if(x & 1) res = (res * a) % mod;
a = (a * a) % mod;
x >>= 1;
}
return res;
}
int main(){
ll N; cin >> N;
vector<ll> f(N); rep(i,N) cin >> f[i];
rep(i,N) f[i]--;
init(N);
ll cnt = 0;
rep(i,N){
unite(i,f[i]);
}
set<int> st;
rep(i,N) st.insert(root(i));
cnt=sz(st);
cout << (mpow(2,cnt)+mod-1)%mod << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, t, a[100];
vector<int> l, r;
void dfs(int dep, int sum) {
if (sum > t) return;
if (dep > (n >> 1)) {
l.push_back(sum);
return;
}
dfs(dep + 1, sum);
dfs(dep + 1, sum + a[dep]);
}
void dfs2(int dep, int sum) {
if (sum > t) return;
if (dep > n) {
r.push_back(sum);
return;
}
dfs2(dep + 1, sum);
dfs2(dep + 1, sum + a[dep]);
}
int main(void) {
scanf("%d%d", &n, &t);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
dfs(1, 0);
dfs2((n >> 1) + 1, 0);
sort(r.begin(), r.end());
int ans = 0;
for (auto i : l) {
ans = max(ans, i + *(upper_bound(r.begin(), r.end(), t - i) - 1));
}
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <cstring>
using namespace std;
char cc[64];
int maxdigit(int n) {
return n == 0 ? 0 : max(maxdigit(n - 1), cc[n - 1] - '0');
}
bool ok(int n, long long b, long long m) {
long long x = 0;
for (int i = 0; i < n; i++) {
if (x > (m - (cc[i] - '0')) / b)
return false;
x = x * b + cc[i] - '0';
}
return true;
}
int main() {
long long m; cin >> cc >> m;
int n = strlen(cc);
if (n == 1) {
cout << (cc[0] - '0' <= m ? 1 : 0) << '\n';
return 0;
}
int d = maxdigit(n);
long long lower = d, upper = m + 1;
while (upper - lower > 1) {
long long b = (lower + upper) / 2;
if (ok(n, b, m))
lower = b;
else
upper = b;
}
long long b = lower;
cout << b - d << '\n';
return 0;
}
|
//----AUTHOR:developer.eeshan----/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ff first
#define ss second
#define it(a, x) for (auto &a : x)
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vb vector<bool>
#define vd vector<double>
#define vll vector<ll>
#define vpii vector<pii>
#define vpll vector<pll>
#define vs vector<string>
#define gi greater<int>
#define vc vector<char>
#define vvi vector<vi>
#define vvb vector<vb>
#define vvd vector<vd>
#define vvll vector<vll>
#define vvc vector<vc>
#define mii map<int, int>
#define us unordered_set
#define um unordered_map
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
for (ll tc = 1; tc <= x; tc++)
#define deb(x) cout << #x << "=" << x << endl;
#define deb1(x, y) cout << #x << "=" << x << ' ' << #y << "=" << y << endl;
#define in(i, x, y) for (ll i = x; i < y; i++)
#define rin(i, x, y) for (ll i = x; i >= y; i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define lb lower_bound
#define ub upper_bound
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //random shuffler
ll fxp(ll a, ll b) {
a %= mod;
ll res = 1;
while (b > 0) {
if (b % 2 == 1)
res = (res * a) % mod;
a = (a * a) % mod;
b /= 2;
}
return res % mod;
}
inline ll minv(ll x) { return fxp(x, mod - 2); }
inline ll mmul(ll a, ll b) {
if (a >= mod) a = a % mod;
if (b >= mod) b = b % mod;
if (a * b >= mod) return (a * b) % mod;
return (a * b);
}
inline ll madd(ll a, ll b) {
if (a >= mod) a = a % mod;
if (b >= mod) b = b % mod;
if (a + b >= mod) return (a + b) % mod;
return (a + b);
}
inline ll msub(ll a, ll b) {
if (a >= mod) a = a % mod;
if (b >= mod) b = b % mod;
return (((a - b) % mod + mod) % mod);
}
inline ll mdiv(ll a, ll bb) {
if (a >= mod) a = a % mod;
ll b = minv(bb);
if (b >= mod) b = b % mod;
if (a * b >= mod) return (a * b) % mod;
return (a * b);
}
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
}
const int mXn = 3e5 + 5;
ll BIT[mXn], a[mXn], n;
//add "delta" at index "x"
void update(ll x, ll delta) {
for (; x <= n; x += x & -x)
BIT[x] += delta;
}
//when atlast you want final array then just take prefix Sum
void range_update(int l, int r, int val) {
update(l, val);
update(r + 1, -val);
}
ll sum(ll x) {
ll sum = 0;
for (; x > 0; x -= x & -x)
sum += BIT[x];
return sum;
}
ll sum(ll l, ll r) {
return sum(r) - sum(l - 1);
}
void solve() {
cin >> n;
ll cnt = 0;
in(i, 1, n + 1) cin >> a[i], a[i]++;
in(i, 1, n + 1) {
cnt += sum(a[i] + 1, n);
update(a[i], 1);
}
in(i, 1, n + 1) {
cout << cnt << endl;
cnt += (n - 1 - 2 * (a[i] - 1));
}
}
int main(int argc, char const *argv[]) {
c_p_c();
solve();
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <unordered_map>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int a[300010];
int c[300010];
int n;
int lowbit(int x) {
return x & -x;
}
void add(int x) {
while (x <= n) {
c[x] = c[x] + 1;
x = x + lowbit(x);
}
}
int getsum(int x) {
int ans = 0;
while (x >= 1) {
ans = ans + c[x];
x = x - lowbit(x);
}
return ans;
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
long long ans = 0;
for (int i = n-1; i >= 0; --i) {
ans += getsum(a[i]);
add(a[i]+1);
}
printf("%lld\n", ans);
for (int i = 0; i < n-1; ++i) {
//printf("move %d\n", a[i]);
ans -= a[i];
ans += n - a[i] - 1;
printf("%lld\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int INF = 1e9;
struct City {
int x, y, z;
City() {}
City(int x, int y, int z) {
this->x = x;
this->y = y;
this->z = z;
}
};
int dist(City c1, City c2) {
return abs(c2.x - c1.x) + abs(c2.y - c1.y) + max(0, c2.z - c1.z);
}
int main() {
int n;
cin >> n;
vector<City> city(n);
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
city[i] = {x, y, z};
}
vector<vector<int>> dp(n, vector<int>(1<<n, INF));
dp[0][0] = 0;
for (int i = 0; i < (1<<n); i++) {
for (int j = 0; j < n; j++) {
if (not (i & (1<<j))) {
for (int k = 0; k < n; k++) {
dp[j][i | (1<<j)] = min(dp[j][i | (1<<j)], dp[k][i] + dist(city[k], city[j]));
}
}
}
}
int ans = dp[0][(1<<n) - 1];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
int inf=1000001000;
ll INF=2e18;
ll MOD=1000000007;
ll mod=998244353;
int main() {
int n;
cin >> n;
vector<int> x(n),y(n),z(n);
vector<int> t(n+1);
rep(i,n) t[i]=pow(2,i);
rep(i,n) cin >> x[i] >> y[i] >> z[i];
int e=pow(2,n);
vector<vector<int>> a(n,vector<int>(e,inf));
a[0][1]=0;
rep(i,n-1){
rep(j,e){
int u=j;
rep(k,n){
if (u%2==0){
rep(ii,n){
a[k][j+t[k]]=min(a[k][j+t[k]],a[ii][j]+abs(x[ii]-x[k])+abs(y[ii]-y[k])+max(0,z[k]-z[ii]));
}
}
u/=2;
}
}
}
int ans=inf;
rep(i,n) ans=min(ans,a[i][e-1]+abs(x[0]-x[i])+abs(y[0]-y[i])+max(0,z[0]-z[i]));
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+1];
for(int i=0; i<n; i++){
cin>>a[i];
}
int ans=0;
int m=-1;
sort(a,a+n);
int mx=a[n-1];
for(int i=2; i<=mx; i++){
int c=0;
for(int j=0; j<n; j++){
if(a[j]%i==0){
c++;
}
}
if(c>=m){
m=c;
ans=i;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define len(x) int((x).size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define randint(n) uniform_int_distribution<int>(1, (n))(rng)
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef ARTHUR_LOCAL
ifstream cin("input.txt");
#endif
int n;
cin>>n;
string s;
cin>>s;
if(s=="1"){
cout<<2LL*ll(1e10)<<endl;
return 0;
}
for(int i=0; i<3; i++){
bool w=1;
for(int j=0; j<n; j++){
if(j%3 == i){
if(s[j] != '0'){
// if(!w) cout<<i<<" "<<j<<endl;
w=0;
}
}
else{
if(s[j] != '1'){
// if(!w) cout<<i<<" "<<j<<endl;
w=0;
}
}
if(j==n-1 && w){
ll ans = ll(3e10)-n;
if(i==0){
// we end at n+2, n+5, ...
ans++;
}
if(i==1){
// we end at n+1, n+4, ...
ans+=2;
}
if(i==2){
ans+=3;
}
cout<<ll(ans/3LL)<<endl;
return 0;
}
}
}
cout<<0<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
using C = complex<double>;
const double gs = 0.000001;
int main(){
int n;
cin >> n;
vector<double> lx(n), ly(n), rx(n), ry(n);
rep(i,n) cin >> lx[i] >> ly[i];
rep(i,n) cin >> rx[i] >> ry[i];
double ljx, ljy, rjx, rjy;
ljx = ljy = rjx = rjy = 0;
rep(i,n){
ljx += lx[i];
ljy += ly[i];
rjx += rx[i];
rjy += ry[i];
}
ljx /= n; ljy /= n; rjx /= n; rjy /= n;
rep(i,n){
lx[i] -= ljx;
ly[i] -= ljy;
rx[i] -= rjx;
ry[i] -= rjy;
}
string ans = "No";
rep(i,n){
rep(j,n){
double llen = sqrt(lx[i]*lx[i] + ly[i]*ly[i]);
double rlen = sqrt(rx[j]*rx[j] + ry[j]*ry[j]);
if(abs(rlen-llen) >= gs) continue;
double lshi = atan2(ly[i], lx[i]);
double rshi = atan2(ry[j], rx[j]);
double shi = lshi - rshi;
bool allMitukata = true;
rep(j2, n){
C tani(cos(shi), sin(shi));
C r(rx[j2], ry[j2]);
r = r*tani;
double rx2 = r.real(); // kaitenn
double ry2 = r.imag();
bool mitukata = false;
rep(i2, n){
if(abs(lx[i2]-rx2)>=gs || abs(ly[i2]-ry2)>=gs) continue;
mitukata = true;
}
if(!mitukata) allMitukata = false;
}
if(allMitukata) ans = "Yes";
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
#define int ll
using vi = vector<int>;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
bitset<100001> dp;
dp[0]=1;
int tot = 0;
rep(i,n){
int t;
cin>>t;
tot += t;
dp |= dp<<t;
}
int ans = tot;
rep(i,tot+1)if(dp[i])ans = min(ans,max(tot-i,i));
cout << ans <<"\n";
return 0;
} |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on
using T = tuple<int, int, int>;
using Edge = tuple<ll, int>;
#include <queue>
#include <cmath>
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
input(n, m);
vector<vector<T>> g(n);
rep(i, 0, m) {
int a, b, c, d;
input(a, b, c, d);
a--;
b--;
g[a].emplace_back(b, c, d);
g[b].emplace_back(a, c, d);
}
priority_queue<Edge, vector<Edge>, greater<Edge>> pq;
pq.emplace(0, 0);
const ll inf = 1LL << 60;
vector<ll> cost(n, inf);
cost[0] = 0;
while (pq.size()) {
auto [cst, ver] = pq.top();
pq.pop();
if (cost[ver] < cst) continue;
cost[ver] = cst;
for (auto [nxt, c, d] : g[ver]) {
ll ddiv = round(sqrt(d));
for (ll t = max(ddiv - 2, 0LL); t <= ddiv + 2; t++) {
ll nxtt = max(cst, t);
nxtt += c + d / (nxtt + 1);
if (chmin(cost[nxt], nxtt)) {
pq.emplace(nxtt, nxt);
}
}
}
}
print(cost[n - 1] == inf ? -1 : cost[n - 1]);
return 0;
}
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<ctime>
#include<queue>
#define mp make_pair
#define zjx printf("%d\n",
#define AK ans
#define IOI );
#define maxn 200005
#define lson now<<1
#define rson now<<1|1
using namespace std;
const int mod=998244353;
inline int read()
{
int x=0;
char c=getchar();
while(!isdigit(c))c=getchar();
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x;
}
int n,m,p,h[100001];
struct pp
{
int to,ne,v,w,t;
}a[200001];
void add(int x,int y,int z,int k)
{
a[++p].to=y;
a[p].ne=h[x];
a[p].v=z;
a[p].w=k;
a[p].t=(int)(sqrt(k));
h[x]=p;
}
long long d[100001];
int vis[100001];
struct node
{
int id;
long long num;
node(int x,long long y)
{
id=x,num=y;
}
bool operator < (const node &x)const
{
return num>x.num;
}
};
priority_queue<node>q;
int main()
{
n=read(),m=read();
for(int i=1;i<=m;i++)
{
int x=read(),y=read(),z=read(),k=read();
add(x,y,z,k),add(y,x,z,k);
}
memset(d,0x3f,sizeof(d));
d[1]=0;
q.push(node(1,0));
while(!q.empty())
{
int x=q.top().id;
q.pop();
if(vis[x])continue;
vis[x]=1;
for(int i=h[x];i;i=a[i].ne)
{
long long v=a[i].v+(d[x]<=a[i].t?(a[i].w/(a[i].t+1)+a[i].t):(a[i].w/(d[x]+1)+d[x]));
if(d[a[i].to]>v)
{
d[a[i].to]=v;
q.push(node(a[i].to,d[a[i].to]));
}
}
}
if(d[n]==0x3f3f3f3f3f3f3f3f)
printf("-1");
else
printf("%lld",d[n]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int f[N][2];
int main()
{
int a,b,x,y;scanf("%d%d%d%d",&a,&b,&x,&y);
memset(f,0x3f,sizeof f);
f[a][0] = 0;
for(int i = a;i <= 100;++i)
{
f[i][0] = min(f[i][0],f[i][1] + x);
f[i][1] = min(f[i][1],f[i][0] + x);
f[i + 1][0] = min(f[i + 1][0],f[i][0] + y);
f[i + 1][0] = min(f[i + 1][0],f[i][1] + x);
f[i + 1][1] = min(f[i + 1][1],f[i][1] + y);
}
for(int i = a;i >= 1;--i)
{
f[i][0] = min(f[i][0],f[i][1] + x);
f[i][1] = min(f[i][1],f[i][0] + x);
f[i - 1][1] = min(f[i - 1][1],f[i][0] + x);
f[i - 1][0] = min(f[i - 1][0],f[i][0] + y);
f[i - 1][1] = min(f[i - 1][1],f[i][1] + y);
}
// cout << f[100][0] << endl;
printf("%d",f[b][1]);
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
if (gx < sx) {
swap(sx, gx);
swap(sy, gy);
}
printf("%.10lf", sx + (gx - sx) * sy / (sy + gy));
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
using namespace std;
#define SIZE 200000
////////// Mod
#include <iostream>
using namespace std;
class Mod {
public:
const long MOD = 1000000007;
//const long MOD = 17;
const int MaxIntPower = 30;
Mod(long v = 0) { var = v; }
void operator = (long r) { var = r; }
Mod operator + (Mod r) { return (var + r.var) % MOD; }
Mod operator - (Mod r) { return (var - r.var + MOD) % MOD; }
Mod operator * (Mod r) { return (var * r.var) % MOD; }
Mod operator / (Mod r) { return (var * r.Reverse().var) % MOD; }
void operator += (Mod r) { var = (var + r.var) % MOD; }
void operator -= (Mod r) { var = (var - r.var + MOD) % MOD; }
void operator *= (Mod r) { var = (var * r.var) % MOD; }
void operator /= (Mod r) { var = (var * r.Reverse().var) % MOD; }
bool operator ==(const Mod& r) { return var == r.var; }
bool operator <(const Mod& r) { return var < r.var; }
bool operator !=(const Mod& r) { return var != r.var; }
Mod Power(int p) {
if (var == 0 || var == 1) return var;
while (p < 0) p += MOD - 1;
p = p % (MOD - 1);
long bit = 1 << MaxIntPower;
Mod ans = 1;
while (bit >= 1) {
ans *= ans;
if ((bit & p) != 0)
ans *= var;
bit = (bit >> 1);
}
return ans;
}
Mod Reverse() {
long a = var;
long b = MOD;
long u = 1;
long v = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
Mod val;
val.var = (u + MOD) % MOD;
return val;
}
long var;
};
int main()
{
long n, m;
long a[2000];
cin >> n >> m;
long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum += n;
Mod bunbo = 1;
Mod bunshi = 1;
for (int i = 0; i < sum; i++) {
bunshi *= m + n - i;
bunbo *= i + 1;
}
Mod ans = bunshi/bunbo;
cout << ans.var;
} | /*
Written By mafailure
*/
#define ill
//In the name of God
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#ifdef ill
#define int long long
#endif
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef AATIF_DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
//#define int long long
// int dx[]={-1,1,0,0}; int dy[]={0,0,1,-1};
// int dx[]={2,2,-2,-2,1,1,-1,-1}; int dy[]={1,-1,1,-1,2,-2,2,-2};
const long long mod = 1e9 + 7;
const double eps=1e-9;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> ii;
typedef vector< pair< int, int > > vii;
typedef map<int, int> mii;
typedef pair<int, ii> pip;
typedef pair<ii, int> ppi;
#define arrinp(arr,init,final,size,type) type* arr=new type[size];for(int i=init;i<final;i++)cin>>arr[i];
#define cr2d(arr,n,m,t) t**arr=new t*[n];for(int i=0;i<n;i++)arr[i]=new t[m];
#define w(t) int t;cin>>t; while(t--)
#define takeInp(n) int n;cin>>n;
#define fr(i,init,final) for(int i=init;i<final;i++)
#define frr(i,init,final) for(int i=init;i>=final;i--)
#define Fr(i,final) for(int i=0;i<final;i++)
#define Frr(i,first) for(int i=first;i>=0;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define debug(x) cerr<<">value ("<<#x<<") : "<<x<<endl;
#define setb __builtin_popcount
#define lsone(n) (n&(-n))
#define rlsone(n) (n&(n-1))
#define clr(a,b) memset(a,b,sizeof(a))
const int inf= INT_MAX;
//struct point_i{int x,y;};
struct point_i{int x,y;
point_i(){ x=0; y=0;}
point_i(int x_,int y_){x=(x_);y=(y_) ;}
};
struct point
{
float x,y;
point (){x=y=0.0;}
point (float x_,float y_){x=(x_); y=(y_);}
bool operator < (point other) const{
if(fabs(x-other.x)>eps)return x<other.x;
return y<other.y;
}
bool operator == (point other) const {
return fabs(other.x-x)<=eps&& fabs(other.y-y)<=eps;
}
} ;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
vi init(string s)
{
istringstream sin(s);
int n;
vi arr;
while(sin>>n)arr.push_back(n);
return arr;
}
int power(int x, int y)
{
if(y==0)return 1;
int u=power(x,y/2);
u=(u*u)%mod;
if(y%2)u=(x*u)%mod;
return u;
}
int gcd(int a,int b)
{
if(a<b)return gcd(b,a);
return (b==0?a:(a%b?gcd(b,a%b):b));
}
int gcd_e(int a,int b,int &x,int &y)
{
if(b==0){x=1; y=0; return a;}
int x1,y1;
int p=gcd_e(b,a%b,x1,y1);
x=y1;
y=x1-(a/b)*y1;
return p;
}
int mul(int a,int b)
{
return (a*b)%mod;
}
int inv(int n)
{
return power(n,mod-2);
}
signed main()
{
IOS
int n; cin>>n;
int m; cin>>m;
vi a(n);
fr(i,0,n) cin>>a[i];
int sum=accumulate(all(a),n);
int num=1;
int den=1;
m+=n;
fr(i,0,sum)
{
num=mul(num,m-i);
den=mul(den,sum-i);
}
cout<<mul(num,inv(den))<<endl;
//fr(i,0,n) sum+=a[i];
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,l,n)for(int i=l;i<n;i++)
#define dloop(i,l,n)for(int i=l;i>=n;i--)
#define read(x) cin>>x
#define print(x) cout<<x
bool compare(pair<int,int>p1,pair<int,int>p2){
if(p1.first>p2.first)return true;
else if(p1.first==p2.first){
if(p1.second<p2.second)return true;
}
return false;
}
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);
ll a,b;
cin>>a>>b;
if((a+b)>=15 &&(b>=8))cout<<1<<'\n';
else if((a+b)>=10 &&(b>=3))cout<<2<<'\n';
else if((a+b)>=3)cout<<3<<'\n';
else cout<<4<<'\n';
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int type = -1;
if ((A + B >= 15) && (B >= 8)) {
type = 1;
}
else if ((A + B >= 10) && (B >= 3)) {
type = 2;
}
else if ((A + B >= 3)) {
type = 3;
}
else {
type = 4;
}
cout << type << endl;
}
|
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define maxn 51
#define ll long long
#define mo 998244353
using namespace std;
int n,m,i,j,k,a[maxn][maxn],fa[maxn],g[maxn];
int father(int x){return (fa[x]==x)?x:fa[x]=father(fa[x]);}
void link(int x,int y){x=father(x),y=father(y);if (x!=y) g[y]+=g[x],fa[x]=y; }
ll fct[maxn];
int main(){
scanf("%d%d",&n,&m);
fct[0]=1;for(i=1;i<=n;i++) fct[i]=fct[i-1]*i%mo;
for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&a[i][j]);
for(i=1;i<=n;i++) fa[i]=i,g[i]=1;
for(i=1;i<=n;i++) for(j=i+1;j<=n;j++) {
int tp=1;
for(k=1;k<=n;k++) if (a[i][k]+a[j][k]>m)
{tp=0;break;}
if (tp) link(i,j);
}
ll ans=1;
for(i=1;i<=n;i++) if (fa[i]==i) (ans*=fct[g[i]])%=mo;
for(i=1;i<=n;i++) fa[i]=i,g[i]=1;
for(i=1;i<=n;i++) for(j=i+1;j<=n;j++) {
int tp=1;
for(k=1;k<=n;k++) if (a[k][i]+a[k][j]>m)
{tp=0;break;}
if (tp) link(i,j);
}
for(i=1;i<=n;i++) if (fa[i]==i) (ans*=fct[g[i]])%=mo;
printf("%lld",ans);
}
| #include <bits/stdc++.h>
using namespace std;
long long cur[101][10001], pre[101][10001];
long long MOD = 998244353;
int main() {
int N; cin >> N;
vector<int> W(N);
for(int i = 0; i < N; i++) {
cin >> W[i];
}
pre[0][0] = 1LL;
int sum = 0;
for(int i = 0; i < N; i++)
sum += W[i];
for(int i = 1; i <= N; i++) {
for(int make = 0; make <= sum; make++) {
for(int use = 0; use <= N; use++) {
cur[use][make] = pre[use][make];
if(W[i - 1] <= make && use > 0)
cur[use][make] += pre[use - 1][make - W[i - 1]];
if(cur[use][make] > MOD) cur[use][make] -= MOD;
}
}
for(int make = 0; make <= sum; make++)
for(int use = 0; use <= N; use++)
pre[use][make] = cur[use][make];
}
vector<long long> f(N + 1);
f[0] = 1LL;
for(int i = 1; i <= N; i++)
f[i] = f[i - 1] * 1LL * i % MOD;
long long ans = 0LL;
if(sum % 2) {
cout << 0 << "\n";
return 0;
}
for(int use = 0; use <= N; use++) {
ans += f[use] * 1LL * f[N - use] % MOD * pre[use][sum / 2] % MOD;
ans %= MOD;
}
if(ans < 0) ans += MOD;
cout << ans;
}
|
#include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 300005
#define MOD 1000000007
#define INF 1000000000000000000
#define EPS 0.0000000001
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
char s[103];
char bst[24000000];
int n,k;
void make_it(int index,int l,int r)
{
if(l==r)
{
bst[index]=(s[l%n]);
return;
}
int m=(l+r)/2;
make_it(index*2,l,m);
make_it(index*2+1,m+1,r);
if(bst[index*2]==bst[index*2+1]) bst[index]=bst[index*2];
else if(bst[index*2]!='R'&&bst[index*2+1]!='R') bst[index]='S';
else if(bst[index*2]!='S'&&bst[index*2+1]!='S') bst[index]='P';
else bst[index]='R';
}
int main()
{
int i,j;
scanf("%d %d ",&n,&k);
for(i=0;i<n;i++)
{
scanf("%c",&s[i]);
}
k=min(k,22);
int m=1<<k;
make_it(1,0,m-1);
printf("%c",bst[1]);
return 0;
}
| //Author: RingweEH
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#define ll long long
#define db double
using namespace std;
int min( int a,int b ) { return a<b ? a : b; }
int max( int a,int b ) { return a>b ? a : b; }
int read()
{
int x=0,w=1; char ch=getchar();
while ( ch>'9' || ch<'0' ) { if ( ch=='-' ) w=-1; ch=getchar(); }
while ( ch<='9' && ch>='0' ) x=x*10+ch-'0',ch=getchar();
return x*w;
}
ll n,k;
char win[230][230];
string str,dbstr;
int main()
{
n=read(); k=read(); cin>>str;
win['R']['R']=win['R']['S']=win['S']['R']='R';
win['S']['S']=win['S']['P']=win['P']['S']='S';
win['P']['P']=win['P']['R']=win['R']['P']='P';
while ( k-- )
{
dbstr=str+str;
for ( int i=0; i<n; i++ )
str[i]=win[dbstr[i*2]][dbstr[i*2+1]];
}
cout<<str[0];
return 0;
} |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T>& a) {
os << "{";
for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? "," : "") << a[i];
return os << "}";
}
[[maybe_unused]] constexpr ll MOD = 1e9 + 7;
[[maybe_unused]] constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] constexpr ll INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0)->sync_with_stdio(0);
string a, b;
cin >> a >> b;
int av = 0, bv = 0;
rep(i, 0, 3) av += a[i] - '0';
rep(i, 0, 3) bv += b[i] - '0';
cout << max(av, bv);
return 0;
} | #include <iostream>
using namespace std;
int main(){
unsigned int a, b;
cin >> a >> b;
unsigned long max;
max = 2 * a + 100;
cout << max - b << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define si(a) scanf("%d",&a)
#define si2(a,b) scanf("%d%d",&a,&b)
#define si3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sl(a) scanf("%lld",&a)
#define sl2(a,b) scanf("%lld%lld",&a,&b)
#define sl3(a,b, c) scanf("%lld%lld%lld",&a,&b,&c)
#define pfi(a) printf("%d", a)
#define pfl(a) printf("%lld", a)
#define pf(a) printf("a")
#define el printf("\n");
#define YES printf("YES\n")
#define NO printf("NO\n")
#define Yes printf("Yes\n")
#define No printf("No\n")
#define yes printf("yes\n")
#define no printf("no\n")
#define space printf(" ")
#define loop(i,a,b) for(int i=a; i<=b; i++)
#define pll pair<ll,ll>
#define pii pair<int, int>
#define sq(a) (a)*(a)
#define pb push_back
#define mk make_pair
#define sz size()
#define ff first
#define ss second
#define mem(a,val) memset(a, val, sizeof(a))
#define all(v) v.begin(), v.end()
#define md 1000000007
#define pi acos(-1.0)
#define inf 1000000000000
#define p(a, b, e) for(int i=b; i<=e; i++) printf("%lld ", a[i]);
#define csh printf("Case #%d: ", ++cs)
#define csc printf("Case %d: ", ++cs)
#define fast1 ios::sync_with_stdio(false);
#define fast2 cin.tie(nullptr);
int x[5]= {0, 1, 0, -1};
int y[5]= {1, 0, -1, 0};
ll a[500010], b[500010];
map<ll,ll>mp, vis;
vector<ll>v, g[2005];
vector<pll>vp;
string s,q;
char c;
void dfs(ll rt, ll &cnt)
{
vis[rt]=1;
cnt++;
//cout<<"pp"<<endl;
for(auto x: g[rt])
{
if(vis[x]==0)
{
//cout<<"pp"<<endl;
dfs(x, cnt);
}
}
}
int main()
{
ll t,n,k,m,l,r,mn=0, mx=0,sum=0, ans=0,nm=0,cnt=0,x,y,z;
int cs=0;
sl2(n,m);
for(int i=0; i<m; i++)
{
sl2(a[i], b[i]);
g[a[i]].pb(b[i]);
}
for(ll i=1; i<=n; i++)
{
cnt=0;
vis.clear();
dfs(i, cnt);
ans += cnt;
}
pfl(ans);
}
| #include <bits/stdc++.h>
using namespace std;
int N,M;
vector<int> lst[2000];
bitset<2000> visited;
queue<int> q;
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; ++i) {
int u,v; scanf("%d %d", &u, &v); u--, v--;
lst[u].push_back(v);
}
int ans = 0;
for (int i = 0; i < N; ++i) {
visited.reset();
visited[i] = true;
q.push(i);
while (!q.empty()) {
int u = q.front(); q.pop();
ans++;
for (int v: lst[u]) if (!visited[v]) {
visited[v] = true;
q.push(v);
}
}
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
using LD = long double;
template <typename T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
void yes(bool ok = true){ cout << (ok ? "yes" : "no") << endl; }
void Yes(bool ok = true){ cout << (ok ? "Yes" : "No") << endl; }
void YES(bool ok = true){ cout << (ok ? "YES" : "NO") << endl; }
void Main(){
const ll INF = 1e18;
ll n; cin >> n;
vll pow3(40, 3), pow5(30, 5);
rep(i, 40) {
if(pow3[i] > INF/3) break;
pow3[i+1] = 3 * pow3[i];
}
rep(i, 30) {
if(pow5[i] > INF/5) break;
pow5[i+1] = 5 * pow5[i];
}
rep(i, 40) rep(j, 30){
if(n == pow3[i] + pow5[j]){
cout << i+1 << " " << j+1 << endl;
return;
}
}
cout << -1 << endl;
return;
}
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | /*************************************************************************
> File Name: main.cpp
> Author: Song
> Mail: [email protected]
> Created Time: 四 11/19 08:58:42 2020
************************************************************************/
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <string>
using namespace std;
void solve() {
string str;
int n;
cin >> n;
vector<vector<bool> > a(n, vector<bool>(n, false));
for (int i = 0; i < n; i++) {
a[i][i] = true;
cin >> str;
for (int j = 0; j < str.length(); j++) {
if (str[j] == '1') {
a[i][j] = true;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++) {
if (a[j][i] && a[i][k]) a[j][k] = true;
}
}
}
double ans = 0.0;
int cnt;
for (int i = 0; i < n; i++) {
cnt = 0;
for (int j = 0; j < n; j++) {
if (a[j][i]) cnt++;
}
ans += 1.0 / cnt;
}
cout << ans << endl;
return ;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout << unitbuf;
cout << fixed << setprecision(10);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
using ll = long long;
const ll INF = 1LL << 60;
using pll = pair<ll, ll>;
int main() {
ll A, B;
cin >> A >> B;
ll cut = 0, V = 501510;
rep(i, A) {
cout << V << " ";
cut += V;
V--;
}
V = -1;
rep(i, B-1) {
cout << V << " ";
cut += V;
V--;
}
cout << -cut << endl;
} | #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>
// Picasso didn't learn to paint by watching lectures
/*
* coder :: ATUL_PANDEY_2608
* >>> INDIA <<<
*/
using namespace std;
using namespace __gnu_pbds;
// #define part ..
#define ook order_of_key
#define fbo find_by_order
#define pb(a) push_back(a)
#define all(a) a.begin(),a.end()
#define mod 1000000007
#define tot_time cerr << "Runtime is: " << clock() * 1.0 / CLOCKS_PER_SEC << endl;
//#define maxx 200006
#define fixed cout<<fixed<<setprecision(14);
#define ll long long
#define quick ios_base::sync_with_stdio(NULL),cin.tie(0);
#define listll vector< long long >
#define listi vector< int>
#define pii pair<int , int>
#define pll pair<long long , long long >
#define minheap priority_queue<long long , vector< long long >, greater<long long > >
#define rep(i,a,b) for(int i=a;i<b;i++)
#define memo(a,x ) memset( a, x ,sizeof ( a) )
#define randoms mt19937 rng(26);
const long long oo = 1e18;
double PI = 3.14159265358979323846;
template < class T >
vector< T > readvector ( T n ) { vector < T > arr(n ) ;
for( int i =0; i < n ; i ++ ) cin>>arr[i] ;
return arr; }
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
ll power( ll a, ll n, ll m= 1000000007){
ll ans = 1;
while(n){
if(n&1)
{
ans *= a;
ans%=m;
}
a*=a;
a%=m;
n/=2;
}
return ans ;
}
vector< int > prm ;
vector < bool > vsp ;
void prime ( int nn = 100000 ) {
vsp = vector < bool > ( nn+1, 0 );
int size_prime = nn;
for( ll i =2; i*i < size_prime ; i++){
if( vsp[i] == 1)
continue;
for(ll j = i*i; j < size_prime ;j+=i){
vsp[j] =1;
}
}
for( int i= 2; i < size_prime ; i++)
if (vsp[i] == 0)
prm.pb(i);
}
//auto comparator = [] ( array < ll ,2 > &a , array < ll , 2 > &b ) { return ( a[0] < b[0 ] || (a[ 0] == b[ 0] && a[1] > b[1] ) ) ; } ;
//priority_queue< array < ll , 2> , vector< array< ll ,2 > > , decltype( comparator ) > pq ( comparator);
template < class T > using oset = tree< T , null_type, less < T > , rb_tree_tag , tree_order_statistics_node_update > ;
// oset< int > tree ;
// tree.ook ( val ) return index of element ;
// tree.fbo ( idx ) return pointer at the element .
// end of #define
// define globals ...
const int maxx = 2e5+26;
//write function from here ...
// never forget to recheck your predefined function in template ..
// already defined :: prime , power , gcd : ( ll )..
int Main(){
ll n , m ;
cin>>n>>m;
//int more = n-m/;
vector< ll > ans ;
if (n >m ){
int i=1 ;
ll tot= 0;
while ( n-->0 ){
tot+=i;
ans.pb(i++);
}
i =2 ;
tot = tot - ( m*( m+1))/2;
ans.pb(-(tot+1));
while(m-- >1 )
ans.pb( -(i++ ));
}
else {
int i=1 ;
ll tot= 0;
while ( m-->0 ){
tot+=i;
ans.pb(-(i++) );
}
i =2 ;
tot = tot - ( n*( n+1))/2;
ans.pb((tot+1));
while(n-- >1 )
ans.pb( (i++ ));
}
for( int a : ans )
cout<<a<<" ";
return 0;
}
int main(){
quick;
//#ifndef ONLINE_JUDGE
//freopen ("input.txt", "r", stdin);
//freopen ("outt.txt", "w", stdout);
//#endif
int t =1;
//cin>>t;
while(t-- )
Main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int a, b;
cin >> a >> b;
int c = a + b;
if (c >= 15 && b >= 8) {
cout << 1;
} else if (c >= 10 && b >= 3) {
cout << 2;
} else if (c >= 3) {
cout << 3;
} else {
cout << 4;
}
cout << "\n";
return 0;
}
| /*
* Author: Moon_light
* Solution:
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;
//global variable
const int N = 1;
const int mod = 1e9+7;
int t;
//functions
LL qmi(LL a,LL k,LL mod){
LL res = 1;
while(k){
if(k&1) res = res*a%mod;
k >>= 1;
a = a*a%mod;
}
return res%mod;
}
int gcd(int a,int b) {
return b==0? a:gcd(b,a%b);
}
//code from here! Come on! Have a pleasant experience~
int main()
{
IO;
int a,b;
cin>>a>>b;
int c = a+b;
int ans = 4;
if(c >= 15 && b >= 8){
ans = 1;
}else if(c >= 10 && b >= 3){
ans = 2;
}else if(c >= 3){
ans = 3;
}
cout<<ans<<endl;
return 0;
} |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
auto tmp = v;
for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
rearrange(ord, head);
rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
ll res=0,buf=0;
bool judge = true;
ll n,m;cin>>n>>m;
vector<ll>a(n);
rep(i,0,n)cin>>a[i];
vector<vector<ll>>g(n);
rep(i,0,m){
ll u,v;cin>>u>>v;u--;v--;
g[u].PB(v);
}
res=-INF;
vector<ll>dp(n,INF);
rep(i,0,n){
chmax(res,a[i]-dp[i]);
chmin(dp[i],a[i]);
for(auto to:g[i]){
chmin(dp[to],dp[i]);
}
}
cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
//#define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false
int main(void){
ll A,B;
cin >> A >> B;
double C = A*B;
C/=100;
cout << setprecision(10) << C << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pob pop_back
void solve()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<(a*d)-(b*c);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r+",stdin);
// freopen("output.txt","w+",stdout);
// #endif
solve();
} |
// International Master sm0016
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define raftaar ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
const ll MOD1=1000000007;
const ll MOD2= 998244353;
const int N=1e6+6;
int main(){
raftaar
int x,y,z;cin>>x>>y>>z;int ans;
int zz=0;
while(y*z>x*zz){
zz++;
}
cout<<zz-1;
}
|
#include<ctime>
#include<cstdio>
#include<cctype>
#include<cstring>
#define ll long long
using namespace std;
const ll N=3e6+7;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll n,k,t,sum,f[5][N];
ll c[N];
void add(ll x,ll k){
for(;x<=n*3;x+=x&-x)
c[x]+=k;
}
ll ask(ll x){
ll res=0;
for(;x;x-=x&-x)
res+=c[x];
return res;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("E.in","r",stdin);
freopen("E.out","w",stdout);
#endif
clock_t t1=clock();
//--------
n=read();
k=read();
f[0][0]=1;
for(ll i=1;i<=3;++i){
memset(c,0,sizeof(c));
for(ll j=0;j<=n*(i-1);++j){
add(j+1,f[i-1][j]);
add(j+n+1,-f[i-1][j]);
}
for(ll j=0;j<=n*i;++j)
f[i][j]=ask(j);
}
for(ll i=3;i<=n*3;++i){
if(t+f[3][i]<k){
t+=f[3][i];
continue;
}
sum=i;
k-=t;
t=0;
break;
}
for(ll i=n*2;i>1;--i){
if(i>=sum)
continue;
if(t+f[2][i]<k){
t+=f[2][i];
continue;
}
printf("%lld ",sum-i);
sum=i;
k-=t;
t=0;
break;
}
for(ll i=n;i;--i){
if(i>=sum)
continue;
if(t+f[1][i]<k){
t+=f[1][i];
continue;
}
printf("%lld %lld",sum-i,i);
break;
}
//--------
clock_t t2=clock();
fprintf(stderr,"time:%0.3lfs",1.0*(t2-t1)/CLOCKS_PER_SEC);
return 0;
} | #include <bits/stdc++.h>
int n;
long long k, dp[4][3000005];
int main() {
std::cin >> n >> k;
for (int i = 1; i <= n; ++i) dp[1][i] = 1;
for (int i = 2; i <= 3; ++i) {
for (int j = 1; j <= i * n; ++j) dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1];
for (int j = i * n; j > n; --j) dp[i][j] -= dp[i][j - n];
}
for (int i = 1; i <= 3 * n; ++i)
if (k <= dp[3][i]) {
for (int j = 1; j <= i; ++j) {
if (k <= dp[2][i - j]) {
for (int x = 1; x <= i - j; ++x) {
if (k <= dp[1][i - j - x]) {
std::cout << j << " " << x << " " << i - j - x;
return 0;
} else k -= dp[1][i - j - x];
}
} else k -= dp[2][i - j];
}
} else k -= dp[3][i];
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <climits>
using namespace std;
int main(void) {
float a, b;
cin >> a >> b;
cout << b / 100.0 * a << endl;
return 0;
} | /* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
#include <bitset>
#include <chrono>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;
#define PB push_back
#define For(i, n) for (ll i = 0; i < n; i++)
#define trav(a,x) for (auto& a : x)
#define PYES cout<<"YES\n"
#define PNO cout<<"NO\n"
#define PYes cout<<"Yes\n"
#define PNo cout<<"No\n"
#define endl '\n'
#define sq(x) (x*x)
#define vll vector<ll>
#define pll pair<ll,ll>
#define ff first
#define ss second
#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())
#define mnv(v) *min_element(v.begin(),v.end())
#define mxv(v) *max_element(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define ACC(v) accumulate(v.begin(),v.end(),0ll)
#define Fas ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
mt19937 rng((unsigned int)chrono::steady_clock::now().time_since_epoch().count());
//--------------------------------------------functions-------------------------------------------------//
ll power(ll a,ll b){ll result=1;while(b>0){if(b%2 == 1){result *= a;} a *= a;b /= 2;}return result;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
ll countSetBits(ll x){ll Count=0;while(x>0){if(x&1) Count++;x=x>>1;}return Count;}
bool isPerfectSquare(ll n){ll sr = sqrt(n);if (sr * sr == n)return true;else return false;}
ll mod(ll x,ll M){return ((x%M + M)%M);}
ll add(ll a, ll b,ll M){return mod(mod(a,M)+mod(b,M),M);}
ll mul(ll a, ll b,ll M){return mod(mod(a,M)*mod(b,M),M);}
ll powerM(ll a,ll b,ll M){
ll res=1ll;
while(b){
if(b%2ll==1ll){
res=mul(a,res,M);
}
a=mul(a,a,M);b/=2ll;
}
return res;
}
ll mod_inv(ll a, ll m) {
ll g = m, r = a, x = 0, y = 1;
while (r != 0) {
ll q = g / r;
g %= r; swap(g, r);
x -= q * y; swap(x, y);
}
return mod(x,m);
}
//------------------------------------sieve of erantothenes-----------------------------------------------//
//ll MAXN=1e7+150;
//vector<ll> fact(MAXN+1);
//void sieve_of_erantothenes()
//{
// fact[1] = 1;
// for (ll i = 2; i <= MAXN; i++)
// fact[i] = i;
// for (ll i = 4; i <= MAXN; i += 2)
// fact[i] = 2;
// for (ll i = 3; i * i <= MAXN; i++){
// if (fact[i] == i){
// for (ll j = i * i; j <= MAXN; j += i)
// if (fact[j] == j)
// fact[j] = i;
// }
// }
//}
//----------------------------------------nCr mod------------------------------------------------------//
ll nCr(ll n, ll k){
if(n<k) return 0;
if(k==0) return 1;
ll res = 1;
if (k > n - k) k = n - k;
for(ll i = 0; i < k; ++i){
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll modInverse(ll n,ll M){
return powerM(n,M-2,M);
}
vector<ll> fact;
void factcalc(ll n,ll M){
fact.resize(n+1);
fact[0]=1;
for(ll i=1;i<=n;i++){
fact[i]=mul(fact[i-1],i,M);
}
}
ll nCrM(ll n,ll r,ll M){
if(n<r) return 0;
if(r==0) return 1;
return mul(mul(fact[n],modInverse(fact[r],M),M),modInverse(fact[n-r],M),M);
}
//-----------------------------------------------solve-----------------------------------------------------//
void solve(){
ldb a,b;cin>>a>>b;
cout<<(a/100)*b<<endl;
}
int main(){
Fas;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cout<<fixed<<setprecision(20);
// ll t=0;
// cin>>t;
// while (t--)
solve();
return 0;
}
|
#include <iostream>
using namespace std;
unsigned long long a,n,cnt=0;
int d;
void calc(){
a=1000;d=1;
while(a*1000<=n){
a*=1000;
d++;
}
cnt+=d+(n-a)*d;
}
int main(void){
cin>>n;
while(n>=1000){
calc();
n=a-1;
}
cout<<cnt<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
int main(){
ll N; cin >> N;
vector<ll> pw(18, 1);
rep(i, 17) pw[i+1] = pw[i]*10;
int K = 0;
while(N >= pw[K]) K++;
ll ans = 0;
rep2(i, 1, K-1){
ans += (pw[i]-pw[i-1])*((i-1)/3);
}
ans += (N+1-pw[K-1])*((K-1)/3);
cout << ans << '\n';
} |
#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 P = pair<int, int>;
using ll = long long;
using vi = vector<ll>;
using vv = vector<vi>;
int main(){
int n;
cin >> n;
vv x(n, vi (3, 1));
rep(i,n)cin >> x[i][0] >> x[i][1];
int m;
cin >> m;
//affine transformation matrix
vector<vv> amat(m+1, vv (3, vi (3, 0)));
amat[0][0][0] = 1;
amat[0][1][1] = 1;
amat[0][2][2] = 1;
rep(mm,m){
int op;
cin >> op;
vv b(3, vi (3, 0));
if(op==1){//clock
b[0][1] = 1;
b[1][0] = -1;
b[2][2] = 1;
}else if(op==2){//anticlock
b[0][1] = -1;
b[1][0] = 1;
b[2][2] = 1;
}else{
ll p;
cin >> p;
if(op==3){
b[0][0] = -1;
b[0][2] = p*2;
b[1][1] = 1;
b[2][2] = 1;
}else{
b[0][0] = 1;
b[1][2] = p*2;
b[1][1] = -1;
b[2][2] = 1;
}
}
rep(i,3)rep(j,3){
rep(k,3)amat[mm+1][i][j] += b[i][k] * amat[mm][k][j];
}
}
int q;
cin >> q;
rep(qq,q){
int a, koma;
cin >> a >> koma;
koma--;
vi ans(3, 0);
rep(i,2)rep(k,3)ans[i] += amat[a][i][k]*x[koma][k];
cout << ans[0] << " " << ans[1] << endl;
}
return 0;
} | #pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x:-x;
}
ll a[maxn],b[maxn],c[maxn],n;
int main()
{
n=read(); rep(i,1,n) a[i]=read(); rep(i,1,n) b[i]=read();
ll premax=0,ans=0;
rep(i,1,n)
{
premax=max(premax,a[i]);
c[i]=max(c[i-1],premax*b[i]);
}
rep(i,1,n) printf("%lld\n",c[i]);
return 0;
} |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <random>
#include <fstream>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
int n,m;
std::string s[888];
char ans[22][22][22];
bool nochange[22][22][22],already[22][888];
void check(int t){
int i,j,k,l;
bool flag;
for(k=0; k<m; ++k){
if(already[t][k]){
continue;
}
for(i=0; i<n; ++i){
for(j=0; j<n; ++j){
flag = true;
for(l=0; l<s[k].l_ength(); ++l){
if(ans[t][i][(j+l)%n] != s[k][l]){
flag = false;
break;
}
}
if(flag){
already[t][k] = true;
for(l=0; l<s[k].l_ength(); ++l){
nochange[t][i][(j+l)%n] = true;
}
break;
}
flag = true;
for(l=0; l<s[k].l_ength(); ++l){
if(ans[t][(i+l)%n][j] != s[k][l]){
flag = false;
break;
}
}
if(flag){
already[t][k] = true;
for(l=0; l<s[k].l_ength(); ++l){
nochange[t][(i+l)%n][j] = true;
break;
}
break;
}
}
if(already[t][k]){
break;
}
}
}
}
int main(void){
int i,j,c[22],k,t,score=0;
std::random_device seed_gen;
std::default_random_engine engine(seed_gen());
std::uniform_int_distribution<> rnd('A','H');
std::cin >> n >> m;
for(i=0; i<m; ++i){
std::cin >> s[i];
}
for(t=0; t<20; ++t){
for(k=0; k<40; ++k){
for(i=0; i<n; ++i){
for(j=0; j<n; ++j){
if(!nochange[t][i][j]){
ans[t][i][j] = rnd(engine);
}
}
}
check(t);
}
c[t] = 0;
for(i=0; i<m; ++i){
if(already[i]){
++c[t];
}
}
score = std::max(score,c[t]);
}
for(t=0; t<20; ++t){
if(score < c[t]){
continue;
}
for(i=0; i<n; ++i){
for(j=0; j<n; ++j){
std::cout << ans[t][i][j];
}
std::cout << std::endl;
}
break;
}
return 0;
}
| #if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, ll>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rrep(i, a, b) for(int i = (int)(a); i >= (int)(b); i--)
const ll INF = 1e18;
const ld PI = acos(-1);
int N,M;
vector<string> substr;
struct Status{
char ans[20][20];
};
Status Now;
void in(){
cin >> N >> M;
substr.resize(M);
rep(i,0,M-1){
cin >> substr[i];
}
}
void make_randomcase(){
}
int score(){
}
void solve(){
rep(i,0,N-1){
rep(j,0,N-1){
Now.ans[i][j]='A'+random()%8;
}
}
}
void out(){
rep(i,0,19){
rep(j,0,19){
cout << Now.ans[i][j];
}cout << endl;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
srand((unsigned int)time(NULL));
/*
while(1){
make_randomcase();
solve();
cerr << score() << '\n';
}
*/
in();
solve();
//cerr << score() << '\n';
out();
} |
/* Author : Anurag Bhatt
* Date : 2021-05-15 17:32:03
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define mp make_pair
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rsz resize
#define bk back()
#define pb push_back
#define ins insert
#define del erase
#define inf INT_MAX
#define db cout << "here" << endl;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define nl endl
const int MOD = 1e9+7;
const ld PI = acos((ld)-1);
mt19937 rng; // or mt19937_64
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
const int MX = 200002;
const int INF = MX+MX;
vector<int> adj[MX];
void solve() {
int n;
cin >> n;
string name[n];
int height[n];
int hei[n];
F0R(i,n) {
cin >> name[i];
cin >> height[i];
hei[i]=height[i];
}
sort(height,height+n);
F0R(i,n) {
if(hei[i]==height[n-2]) {
cout << name[i] << endl;
return;
}
}
}
int main() {
int t = 1;
//cin >> t; //comment if there is only one test - case
for(int i = 1; i <= t ; i++) {
solve();
}
}
| /*if ((double) ((double)(clock() - cl)/(double)CLOCKS_PER_SEC)>1.85) {break;}*/
//#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define double long double
#define ft first
#define sc second
#define pb push_back
#define booost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
#define all(x) (x).begin(),(x).end()
#define file(x) freopen(string(string((x)) + ".in").c_str(), "r", stdin); freopen(string(string((x)) + ".out").c_str(), "w", stdout);
#define GG cout << " OPA " << '\n';
using namespace std;
using namespace __gnu_pbds;
typedef pair <int, int> pi;
typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 1e5 + 5;
const int K = 1e3 + 5;
const int P = 37;
const int INF = 1e18;
const double d_INF = 2000000000.0;
const double EPS = 1e-20;
const int MOD = 1e9 + 7;
const int LOG = 25;
void solve() {
int n;
cin >> n;
vector <pair <int, string> > v;
for (int i = 1; i <= n; i ++) {
string s;
int x;
cin >> s >> x;
v.pb({x, s});
}
sort(all(v), greater <pair <int, string> > ());
cout << v[1].sc << '\n';
}
main () {
int test = 1;
booost;
// cin >> test;
while (test --) {
solve();
}
}
|
#include<bits/stdc++.h>
#define rep(i,n) for ( int i=0; i< (n); ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll n;
int m;
cin >> n >> m;
vector<ll> a(m),sec(0);
rep(i,m) cin >> a[i];
a.push_back(n+1);a.push_back(0);
sort(a.begin(),a.end());
rep(i,m+1){
ll si = a[i+1]-a[i]-1;
if(si>0) sec.push_back(si);
}
ll k = *min_element(sec.begin(),sec.end());
ll ans = 0;
for( ll si : sec ) ans += (si+k-1)/k;
// if sec%k >0 => +1
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define all(V) V.begin(),V.end()
#define pi 3.1415926535897932384626
#define fi fixed<<setprecision(13)
#define MOD 1000000007
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(i, n) for (ll i = 1; i <=(ll)(n); i++)
#define reps(i,k,n) for (ll i = (ll)k; i < (ll)(n); i++)
using namespace std;
template<class T> void chmin(T& a,T b){ if(a > b) a=b; }
template<class T> void chmax(T& a,T b){ if(a < b) a=b; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){fill( (T*)array, (T*)(array+N), val );}
ll nck(ll a,ll b){
ll s=1,x=1;
rep(i,b) s=(s*(a-i))/x,x++;
return s;
}
const ll infll=1LL<<62;
const ll inf=1<<30;
int main(){
int n,m;cin>>n>>m;
vector<int> a(n);
map<int,int> b;
rep(i,n){
cin>>a[i];
if(i<m&&a[i]<m) b[a[i]]++;
}
int mi=inf,ma=0;
bool mio=false;
rep(i,m){
if(b[i]==0){
mi=i;
mio=1;
break;
}
}
if(mio==false) ma=m;
reps(i,m,n){
int s=a[i],t=a[i-m];
b[s]++;
b[t]--;
if(b[t]==0&&mi>s) mi=t,ma=t;
}
if(!mio) cout<<ma;
else cout<<mi;
}
/*制約を確認しろllじゃなくて大丈夫か？*/
|
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main(void){
int N, K;
cin >> N >> K;
int sum = 0;
for(int z=1; z <= N; ++z) {
for(int i=1; i <= K; ++i) {
sum = sum + z * 100 + i;
}
}
cout << sum << 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()
#define rall(v) v.rbegin(), v.rend()
using ll = long long;
using Graph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int SINF = 1LL << 29;
const ll mod = 1000000000+7;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
ll a, b;
cin >> a >> b;
for(int i=b-a; i>=1; i--) {
int c;
if(a % i == 0) c = 0;
else c = a + i - a % i;
if(c + i <= b) {
cout << i << endl;
return 0;
}
}
} |
/* Author : Anurag Bhatt
* Date : 2021-05-22 17:35:47
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define mp make_pair
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rsz resize
#define bk back()
#define pb push_back
#define ins insert
#define del erase
#define inf INT_MAX
#define db cout << "here" << endl;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define nl endl
const int MOD = 1e9+7;
const ld PI = acos((ld)-1);
mt19937 rng; // or mt19937_64
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
const int MX = 200002;
const int INF = MX+MX;
vector<int> adj[MX];
void solve() {
int n;
cin >> n;
ll a[n];
ll b[n];
ll c[n];
F0R(i,n) cin >> a[i];
F0R(i,n) cin >> b[i];
F0R(i,n) cin >> c[i];
ll flag[100002];
memset(flag,0,sizeof flag);
F0R(i,n) flag[a[i]]++;
ll ans = 0;
F0R(i,n) {
ans+=flag[b[c[i]-1]];
}
cout << ans;
}
int main() {
int t = 1;
//cin >> t; //comment if there is only one test - case
for(int i = 1; i <= t ; i++) {
solve();
}
}
| #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 FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll,ll>>
#define pll pair<ll,ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout<<setprecision(x)<<fixed;
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
// getline (std::cin,name);
ll MOD=1e9+7;
ll mod=998244353;
ll ceil1(ll n,ll x){return (n-1)/x+(n>0);}
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll m ,ll mod=MOD );
ll pow2(ll n,ll k);
ll modinv(ll n,ll mod=MOD){ return pow1(n,mod-2,mod);}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
if(a.ff != b.ff)return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N=(ll)1e5+11;
ll const LG=(ll)log2(N)+1;
vpll v[101];
void pre(){
vll prime(101);
for(int i=2;i<=100;i++){
if(prime[i])continue;
for(int j=i;j<=100;j+=i){
prime[j]=1;
int x=j;
int c=0;
while(x%i==0){
c++;
x/=i;
}
v[j].pb({i,c});
}
}
}
ll rem(ll n,ll m){
if(n==0 || m==0)return 1;
map<ll,ll> mp;
for(int i=1;i<=n+m;i++){
for(auto [x,y]:v[i]){
mp[x]+=y;
}
}
for(int i=1;i<=n;i++){
for(auto [x,y]:v[i]){
mp[x]-=y;
}
}
for(int i=1;i<=m;i++){
for(auto [x,y]:v[i]){
mp[x]-=y;
}
}
ll ans=1;
for(auto x:mp){
ans*=pow2(x.ff,x.ss);
}
return ans;
}
void solve() {
ll n;
cin>>n;
map<ll,ll> mp,mp3;
map<ll,vll> mp2;
vll a(n),b(n),c(n);
for(auto &x:a)
cin>>x,mp[x]++;
for(auto &x:b)
cin>>x;
for(auto &x:c)
cin>>x,mp3[x]++;
for(ll i=0;i<n;i++)
{
mp2[b[i]].push_back(i+1);
}
ll ans=0;
for(auto x:mp2)
{
ll t=x.first;
vll cnt=x.second;
for(auto y:cnt)
{
ans+=(mp[t]*mp3[y]);
}
}
cout<<ans;
}
int main(){
// FS;
ll q;
q=1;
pre();
// cin>>q;
for(ll tc=1;tc<=q;tc++){
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n,ll m,ll mod){
if(m==0)return 1;
if(m%2==0)return pow1((n*n)%mod,m/2,mod);
return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}
ll pow2(ll n,ll k){
ll ans=1;
while(k>0){
if(k%2==1)ans=ans*n;
n=n*n;
k/=2;
}
return ans;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll cmb(ll L) {
ll p = L;
ll n = 11;
ll ret = 1;
REP(_, 11) {
ret *= p;
p--;
while (n > 0 && ret % n == 0) {
ret /= n;
n--;
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L;
cin >> L;
ll ans = 1;
cout << cmb(L - 1) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
unsigned long long int binomialCoeff(int n, int k)
{
unsigned long long int C[n + 1][k + 1];
int i, j;
// Caculate value of Binomial Coefficient
// in bottom up manner
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
// Base Cases
if (j == 0 || j == i)
C[i][j] = 1;
// Calculate value using previously
// stored values
else
C[i][j] = C[i - 1][j - 1] +
C[i - 1][j];
}
}
return C[n][k];
}
int main()
{
int l;
cin>>l;
cout<<binomialCoeff(l-1,11)<<endl;
return 0;
} |
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
map<pair<int, int>, int> pre;
pre[{0, 0}] = 1;
int at = 0, cg = 0;
int ans = 0;
for (char c : s) {
if (c == 'A')
at++;
if (c == 'T')
at--;
if (c == 'C')
cg++;
if (c == 'G')
cg--;
ans += pre[{at, cg}]++;
}
cout << ans;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>
// AtCoder
// #include <atcoder/all>
// using namespace atcoder;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...)
#endif
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main (void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll h, w; cin >> h >> w;
vector<string> s(h); rep (i, h) cin >> s[i];
ll ans = 0;
rep (i, h - 1) rep (j, w - 1) {
int x = 0;
rep (p, 2) rep (q, 2) x += (s[i + p][j + q] == '#');
if (x == 1 || x == 3) ans++;
}
cout << ans << "\n";
return 0;
} |
#include<bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
const double pi=acos(-1.0);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int main(void){
int n;
int ans;
cin>>n;
if(n>2){
ans=n-2+1;
}
if(n==2)ans=1;
if(n<2)ans=0;
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
cout << N-1 << endl;
}
|
#include"bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) begin(v), end(v)
#define inf (int)(4e18)
#define N (int)(2e5 + 10)
int isPos(int x, int n, int i) {
if (i > 2) return 0;
int len = 3 * (1e10);
return 3 * (x - 1) + i + n - 1 < len;
}
bool check(string &s, string t) {
int n = s.length();
for (int i = 0; i < n; i += 3) {
int got = min(3ll, n - i);
string tukda = s.substr(i, got);
string toMatch = t.substr(0, got);
if (tukda != toMatch) {
// dbg(tukda, toMatch);
return false;
}
}
return true;
}
void testCase() {
int n; cin >> n;
string s; cin >> s;
if (s == "1") {cout << (int)2e10; return;}
int type = 3;
if (check(s, "110")) type = 0;
else if (check(s, "101")) type = 1;
else if (check(s, "011")) type = 2;
int mi = 0, ma = 1;
while (isPos(ma, n, type)) ma *= 2;
while (mi + 1 < ma) {
int mid = (mi + ma) / 2;
if (isPos(mid, n, type)) mi = mid;
else ma = mid;
}
cout << mi;
}
/* Work hard .. Calm and proceed */
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int t_c = 1;
// cin >> t_c;
while (t_c--)
testCase();
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>
#include <cstdio>
#include <climits>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)return x;
return gcd(y, x%y);
}
ll lcm(ll x, ll y) {
return x / gcd(x, y)*y;
}
ll kai(ll x, ll y, ll m) {
ll res = 1;
for (ll i = x - y + 1; i <= x; i++) {
res *= i; res %= m;
}
return res;
}
ll mod_pow(ll x, ll y, ll m) {
ll res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
ll comb(ll x, ll y, ll m) {
if (y > x)return 0;
return kai(x, y, m) * mod_pow(kai(y, y, m), m - 2, m) % m;
}
const ll INF = 10000000000;
int n;
string s;
signed main() {
std::random_device rnd;
std::mt19937_64 mt(rnd());
cin >> n >> s;
if (n == 1) {
if (s == "0")cout << INF << endl;
else cout << 2 * INF << endl;
return 0;
}
int p = s[0] - '0', cnt = 1;
for (int i = 1; i < n; i++) {
if (s[i - 1] == s[i])cnt++;
else {
if (p == 0) {
if (cnt != 1) {
cout << 0 << endl;
return 0;
}
else cnt = 1, p = 1;
}
else {
if (cnt > 2 || (cnt < 2 && cnt < i)) {
cout << 0 << endl;
return 0;
}
else cnt = 1, p = 0;
}
}
}
if (p == 0 && cnt != 1) {
cout << 0 << endl;
return 0;
}
if (p == 1 && cnt > 2) {
cout << 0 << endl;
return 0;
}
int d = 0;
if (s.substr(0, 2) == "10")d = 1;
if (s.substr(0, 2) == "01")d = 2;
ll x = 3 * INF - n;
while (x % 3 != d)x--;
cout << (x - d) / 3 + 1 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define bitcount(x) (int)__builtin_popcount(x)
int n, m, dp[19][1<<19] ;
vector <pair<int, int>> g[20] ;
int fun(int idx, int mask) {
int &ans = dp[idx][mask] ;
if (ans != -1) return ans ;
ans = 0 ;
bool ok = true ;
for (auto &it: g[idx]) {
int c = bitcount(((1<<it.first)-1) & mask) ;
if (c > it.second) {
ok = 0 ;
break ;
}
}
if (!ok) {
ans = 0 ;
return 0 ;
}
if (idx == n) {
ans = 1 ;
return ans ;
}
for (int i=0;i<n;++i) {
if (!(mask&(1<<i))) {
ans += fun(idx+1, mask|(1<<i)) ;
}
}
ans = max(ans, 0LL) ;
return ans ;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m ;
for (int i=1;i<=m;++i) {
int a, b, c ;
cin >> a >> b >> c ;
g[a].push_back({b, c}) ;
}
memset(dp, -1, sizeof(dp)) ;
int ans = 0;
for (int i=0;i<n;++i) {
ans += fun(1, 1<<i) ;
}
cout << ans << endl ;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void f(string &X, string &Y, int t, int a, int b, int N) {
if (t == 2) {
swap(X, Y);
return;
}
if (a < N && b < N) {
swap(X.at(a), X.at(b));
} else if (a < N && b >= N) {
swap(X.at(a), Y.at(b-N));
} else if (a >= N && b < N) {
swap(Y.at(a-N), X.at(b));
} else if (a >= N && b >= N) {
swap(Y.at(a-N), Y.at(b-N));
}
return;
}
int main() {
int N;
cin >> N;
string S;
cin >> S;
int Q;
cin >> Q;
vector<int> T(Q), A(Q), B(Q);
for (int i = 0; i < Q; i++) {
cin >> T.at(i) >> A.at(i) >> B.at(i);
}
string X(N, 'a');
for (int i = 0; i < N; i++) {
X.at(i) = S.at(i);
}
string Y(N, 'a');
for (int i = 0; i < N; i++) {
Y.at(i) = S.at(N+i);
}
for (int i = 0; i < Q; i++) {
f(X, Y, T.at(i), A.at(i)-1, B.at(i)-1, N);
}
cout << X << Y << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sc(x) scanf("%lld",&(x));
#define pb push_back
#define fi first
#define se second
int A[55];
int P[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int B[55];
int ans = -1;
int n;
void dfs(int x){
if(x == 15){
int y = 1;
for(int i = 0; i < 15; i++){
if(B[i]){
y *= P[i];
}
}
bool flag = true;
for(int i = 0; i < n; i++){
if(__gcd(A[i],y) == 1){
flag = false;break;
}
}
if(flag&& (y < ans|| ans == -1))ans = y;
return;
}
B[x] = 0;
dfs(x+1);
B[x] = 1;
dfs(x+1);
}
signed main()
{
sc(n)
for(int i = 0; i < n; i++)
{
sc(A[i])
}
dfs(0);
cout << ans <<'\n';
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c==0)
{
if(a>b)
cout<<"Takahashi\n";
else
cout<<"Aoki\n";
}
else
{
if(b>a)
cout<<"Aoki\n";
else
cout<<"Takahashi\n";
}
return 0;
} |
#include<iostream>
#include<string.h>
#include<bits/stdc++.h>
#include<cctype>
#include<cstring>
using namespace std;
int main()
{
string s;
char c;
int flag1=1,flag2=1;
cin>>s;
int l = s.length();
for (int i = 0; i < l; i+=2)
{
if(i==l)
break;
c=s.at(i);
if(isupper(c) != 0)
flag1 = 0;
}
for (int i = 1; i < l; i+=2)
{
if(i==l)
break;
c=s.at(i);
if(isupper(c) == 0)
flag1 = 0;
}
if(flag1==1 && flag2==1)
cout<<"Yes"<<endl;
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <random>
#include <chrono>
#include <numeric>
#include <unordered_map>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 567890;
char S[MAXN], T[MAXN];
int main() {
int N;
scanf("%d", &N);
scanf("%s", S);
scanf("%s", T);
vector<int> idx, idx2;
for (int i = 0; i < N; i++)
if (S[i] == '0')
idx.push_back(i);
for (int i = 0; i < N; i++)
if (T[i] == '0')
idx2.push_back(i);
if (idx.size() != idx2.size()) return !printf("-1\n");
int ans = 0;
for (int i = 0; i < (int)idx.size(); i++) {
int want = idx2[i];
int cur = idx[i];
if (cur == want) continue;
ans++;
}
printf("%d\n", ans);
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
by Benq;
*/
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define ld long double
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; i++)
#define fill(a,b) memset(a,b,sizeof(a))
#define vi vector<int>
#define vii vector<pair<int,int>>
#define setbits(x) __builtin_popcountll(x)
#define w(x) int x; cin>>x; while(x--)
#define in(a) for(auto &x: a)cin>>x;
#define out(a) for(auto x: a){cout<<x<<' ';}cout<<'\n';
#define inf 1000000000
void print(bool n){if(n)cout<<"YES";else cout<<"NO";cout<<'\n';}
//1000000007 998244353
const int MOD = 1000000007;
int add(int x, int y){
x += y;
while(x >= MOD)
x -= MOD;
while(x < 0)
x += MOD;
return x;
}
int sub(int x, int y){
return add(x, MOD - y);
}
int mul(int x, int y){
return (x * 1ll * y) % MOD;
}
int binpow(int x, int y){
int z = 1;
while(y > 0)
{
if(y % 2 == 1)
z = mul(z, x);
x = mul(x, x);
y /= 2;
}
return z;
}
int inv(int x){
return binpow(x, MOD - 2);
}
int divide(int x, int y){
return mul(x, inv(y));
}
int fact[2000005];
int c(int n,int m){
//cout<<n+m<<' '<<fact[n+m]<<' '<<mul(fact[n],fact[m])<<'\n';
return divide(fact[n],mul(fact[n-m],fact[m]));
}
signed main(){
int n,m,k;
cin>>n>>m>>k;
if(n>m+k){cout<<0<<'\n';return 0;}
fact[0]=1;
rep(i,1,2000005)fact[i]=mul(i,fact[i-1]);
//cout<<fact[5]<<'\n';
// cout<<c(n+m,n);
// cout<<' '<<c(n+m,m+k+1)<<'\n';
cout<<sub(c(n+m,n),c(n+m,m+k+1))<<'\n';
return 0;
} | // Problem: E - White and Black Balls
// Contest: AtCoder - AtCoder Beginner Contest 205
// URL: https://atcoder.jp/contests/abc205/tasks/abc205_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define endl '\n'
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fill(a,b) memset(a, b, sizeof(a))
#define setbits(x) __builtin_popcountll(x) //count number of 1
#define zrobits(x) __builitin_ctzll(x) //count number of zero before 1st 1 ex- (110000)2 ->4
const int inf=0x3f3f3f3f3f3f3f3f, mod = 1e9 + 7;
int dx[]={0,1,1,1,0,-1,-1,-1};
int dy[]={1,1,0,-1,-1,-1,0,1};
// <--------------------Code Begins Here-------------------->
const int N = 2e6 + 1;
int a[N];
int power(int a, int b, int p){
int res = 1;
while(b != 0) {
if(b & 1)
res = (res % p * a % p) % p;
a = (a%p * a%p)%p;
b /= 2;
}
return res%p;
}
int fact[N],inv[N];
void pre(int p) {
fact[0]=1;
inv[0]=1;
for(int i=1;i<N;i++)
fact[i]=(i*fact[i-1])%p;
for(int i=1;i<N;i++)
inv[i]=power(fact[i], p - 2, p);
}
int nCr(int n, int r, int p) {
if(r>n)
return 0;
if(n==r)
return 1;
if(r==0)
return 1;
return (((fact[n]*inv[r]) % p )*inv[n-r])%p;
}
int32_t main() {
SPEED;
int t = 1;
// cin>>t;
pre(mod);
while(t--) {
int n, m, k;
cin>>n>>m>>k;
if(n > (m + k)) {
cout<<0;
return 0;
}
int ans = nCr(n + m, n, mod);
ans -= nCr(n + m, m + k + 1, mod);
ans %= mod;
if(ans < 0)ans += mod;
cout<<ans;
}
return 0;
} |
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair< ll, ll > Pi;
using vl = vector<ll>;
using vs = vector<string>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 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; }
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;}
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
class UnionFind {
public:
UnionFind() : _n(0) {}
UnionFind(ll n) : _n(n), parent_or_size(n, -1) {}
ll merge(ll a, ll b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
ll x = leader(a), y = leader(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(ll a, ll b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
ll leader(ll a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
ll size(ll a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
vvl groups() {
vl leader_buf(_n), group_size(_n);
rep (i, _n) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
vvl result(_n);
rep (i, _n) result[i].reserve(group_size[i]);
rep (i, _n) result[leader_buf[i]].pb(i);
result.erase(
remove_if(all(result), [&](const vl& v) { return v.empty(); }), result.end());
return result;
}
private:
ll _n;
// root node: -1 * component size
// otherwise: parent
std::vector<ll> parent_or_size;
};
ll N,M;
map<Pi,ll>m;
vvl G(2e5+5);
vector<ll>seen(2e5+5);
vl ans(2e5+5);
void dfs(ll v,ll p){
seen[v] = 1;
rep(i,G[v].size()){
if(seen[G[v][i]] == 0){
//cout<<
if(m[{v,G[v][i]}] ==p){
dfs(G[v][i],(p)%N+1);
ans[G[v][i]]=(p)%N+1;
}else{
dfs(G[v][i],m[{v,G[v][i]}]);
ans[G[v][i]]=m[{v,G[v][i]}];
}
}
}
}
int main() {
cin >>N>>M;
UnionFind uf(N);
rep(i,M){
ll u,v,c;
cin>>u>>v>>c;
u--,v--;
if(!uf.same(u,v)){
G[v].pb(u);
G[u].pb(v);
m[{u,v}]=c;
m[{v,u}]=c;
uf.merge(u,v);
}
}
dfs(0,1);
ans[0]=1;
rep(i,N){
cout<<ans[i]<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#define hh "\n"
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define mapa(a,b) make_pair(a,b)
#define mm(a,b) memset(a,b, sizeof(a));
#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 IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
template <typename T> T gcd (T a, T b) {while (b ^= a ^= b ^= a %= b); return a;}
inline char nc() {static char buf[1000000], *p1 = buf, *p2 = buf;return p1 == p2 && (p2 = (p1 = buf) + fread (buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++;}
#define nc getchar
template <typename T> inline void read(T &sum) {char ch = nc();T tf = 0;sum = 0;while((ch < '0' || ch > '9') && (ch != '-')) ch = nc();tf = ((ch == '-') && (ch = nc()));while(ch >= '0' && ch <= '9') sum = sum * 10+ (ch - 48), ch = nc();(tf) && (sum = -sum);}
template <typename T> inline void write(T x){char F[200];T tmp=x>0?x:-x ;if(x<0)putchar('-') ;T cnt=0 ;while(tmp>0){F[cnt++]=tmp%10+'0';tmp/=10;}while(cnt>0)putchar(F[--cnt]) ;}
//-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
int main()
{
IOS;
int a,b,x,y;
cin>>a>>b>>x>>y;
if(a==b) cout<<x;
else if(a>b)
{
if(x*2<=y) cout<<x+(a-b-1)*x*2;
else cout<<x+(a-b-1)*y;
}else
{
if(x*2<=y) cout<<x+(b-a)*x*2;
else cout<<x+(b-a)*y;
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 10;
int n, ans;
int a[N], f[N];
vector < int > v;
main() {
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i], f[a[i]] = i;
for(int i = 1; i <= n; i++) {
if(f[i] != i) {
if(f[i] > i) {
for(int j = f[i]; j > i; j--) {
f[a[j - 1]] = j;
swap(a[j], a[j - 1]);
ans++;
v.push_back(j - 1);
}
}
else {
for(int j = i; j < f[i]; j++) {
f[a[j + 1]] = j;
swap(a[j], a[j + 1]);
ans++;
v.push_back(j);
}
}
}
if(ans > n - 1) {
cout << "-1\n";
return 0;
}
}
if(ans < n - 1) {
cout << "-1\n";
return 0;
}
for(int x : v) cout << x << "\n";
} | #include <bits/stdc++.h>
using namespace std;
float inf = numeric_limits<float>::infinity();
using ll = long long;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
//素数判定
bool Is_prime(ll num) {
if (num) return false;
//if (num != 2 && num % 2 == 0) return false;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) return false;
}
return true;
}
//約数全列挙
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
long combi(int n, int r) {
if (r == 0) {
return 1;
}
return (n - r + 1) * combi(n, r - 1) / r;
}
long factorial(int n) {
int ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= 100003;
}
return ans;
}
int main() {
int a, b, c, d; cin >> a >> b >> c >> d;
cout << b - c << endl;
}
|
#include "iostream"
#include "vector"
#include "queue"
#include "stack"
#include "algorithm"
#include "string"
#include "cstring"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (n + 99) / 100 << endl;
} | #include<bits/stdc++.h>
using namespace::std;
long long n;
int solve(){
int ans = 0;
for(int len = 1; 2 * n + len - 1ll * len * len > 0; len++){
long long sum = 2 * n + len - 1ll * len * len;
int d = 2 * len;
if(sum % d == 0) ans += 2;
}
return ans;
}
int main(){
scanf("%lld", &n);
printf("%d\n", solve());
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n; --i)
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(),arr.end()
#define ff first
#define ss second
const double pi=3.1415926535897932384626433832795;
const int inf=1e9;
const ll inf2=1e18;
const int mod=1e9+7;
void boost(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void solve(){
int n;
cin>>n;
vi arr(n);
fr(i,0,n){
cin>>arr[i];
}
sort(all(arr),greater<int>());
arr.pb(0);
ll lst=1,cur;
n++;
fr(i,1,n){
cur=(lst*(arr[i-1]-arr[i]+1LL))%mod;
lst=cur;
}
cout<<lst<<endl;
return;
}
int main()
{
boost();
int tc=1;
//cin>>tc;
while(tc--)
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)
template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}
const char newl = '\n';
int main() {
int n;
cin >> n;
for (int i = 0;i < n;++i) {
cout << (i*2+1)%n+1 << " " << (i*2+2)%n+1 << newl;
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
const int MOD = 998244353;
int N; cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i] += i;
}
vector<int> B(N);
for (int i = 0; i < N; ++i) {
cin >> B[i];
B[i] += i;
}
for (int i = 0; i < N; ++i) cerr << A[i] << " \n"[i == N-1];
for (int i = 0; i < N; ++i) cerr << B[i] << " \n"[i == N-1];
map<int, vector<int>> Aloc;
map<int, vector<int>> Bloc;
for (int i = 0; i < N; ++i) {
Aloc[A[i]].push_back(i);
Bloc[B[i]].push_back(i);
}
vector<int> perm(N);
for (int i = N - 1; i >= 0; --i) {
if (Bloc[A[i]].empty()) {
cout << "-1\n";
return 0;
}
perm[i] = Bloc[A[i]].back();
Bloc[A[i]].pop_back();
}
// count inversions
vector<int> fenw(N);
int64_t ans = 0;
for (int v : perm) {
for (int x = v; x < N; x |= (x + 1)) ans += fenw[x];
for (int x = v; x >= 0; x = (x & (x + 1)) - 1) fenw[x] ++;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define f first
#define s second
set<pi> st;
const int nax=2e5+10;
int a[nax],b[nax];
struct node
{
int n;
int bit[nax+1];
node(){}
node(int _n):n(_n){
memset(bit,0,sizeof(bit));
}
void add(int pos,int val)
{
if(pos<=0)
return;
while(pos<=n)
{
bit[pos]+=val;
pos+=(pos&-pos);
}
}
int qry(int pos)
{
int res=0;
pos=min(pos,n);
while(pos)
{
res+=bit[pos];
pos-=(pos&-pos);
}
return res;
}
};
int32_t main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
node root(n);
for(int i=0;i<n;i++)
{
st.insert({a[i]+i,i});
root.add(i+1,1);
}
int res=0;
for(int i=0;i<n;i++)
{
int cur=b[i]+i;
set<pi>::iterator it=st.lower_bound({cur,-1});
if(it!=st.end() and it->f==cur)
{
int j=it->s;
res+=root.qry(j);
st.erase(it);
root.add(j+1,-1);
}
else
{
cout<<"-1";
return 0;
}
}
cout<<res;
return 0;
}
|
// coached by Dukkha and rainboy
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 100;
int aa[N], bb[N], cc[N], dd[N];
int pp[N], qq[N], ii[N];
int rr[N], ss[N], jj[N];
int cross(int x1, int y1, int x2, int y2) {
return x1 * y2 - x2 * y1;
}
int dot(int x1, int y1, int x2, int y2) {
return x1 * x2 + y1 * y2;
}
void convert(int *aa, int *bb, int *pp, int *qq, int n, int x1, int y1, int i2) {
int x2 = aa[i2], y2 = bb[i2];
for (int i = 0; i < n; i++) {
int x = aa[i], y = bb[i];
pp[i] = cross(x - x1, y - y1, x2 - x1, y2 - y1);
qq[i] = dot(x - x1, y - y1, x2 - x1, y2 - y1);
}
}
int main() {
int n; cin >> n;
if (n == 1) {
cout << "Yes\n";
return 0;
}
int xa = 0, ya = 0;
for (int i = 0; i < n; i++) {
cin >> aa[i] >> bb[i];
xa += aa[i], ya += bb[i];
aa[i] *= n, bb[i] *= n;
}
int xb = 0, yb = 0;
for (int i = 0; i < n; i++) {
cin >> cc[i] >> dd[i];
xb += cc[i], yb += dd[i];
cc[i] *= n, dd[i] *= n;
}
for (int i2 = 0; i2 < n; i2++)
if (aa[i2] != xa || bb[i2] != ya) {
convert(aa, bb, pp, qq, n, xa, ya, i2);
break;
}
for (int h = 0; h < n; h++)
ii[h] = h;
sort(ii, ii + n, [] (int i, int j) { return pp[i] < pp[j] || pp[i] == pp[j] && qq[i] < qq[j]; });
for (int i2 = 0; i2 < n; i2++)
if (cc[i2] != xb || dd[i2] != yb) {
convert(cc, dd, rr, ss, n, xb, yb, i2);
for (int h = 0; h < n; h++)
jj[h] = h;
sort(jj, jj + n, [] (int i, int j) { return rr[i] < rr[j] || rr[i] == rr[j] && ss[i] < ss[j]; });
bool yes = true;
for (int h = 0; h < n; h++) {
int i = ii[h], j = jj[h];
if (pp[i] != rr[j] || qq[i] != ss[j]) {
yes = false;
break;
}
}
if (yes) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
}
| // 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: " << v[__i] << endl; \
}\
}while(0)
#define P(fmt, ...) printf(fmt, __VA_ARGS__)
#define LP printf("L: %d\n", __LINE__)
#else
#define Print(v) ((void)0)
#define PrintVec(v) ((void)0)
#define P(fmt, ...) ((void)0)
#define LP ((void)0)
#endif
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = long long;
const double PI = acos(-1);
using P = pair<int, int>;
int calcDist(const P& a, const P& b)
{
return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}
int calcMul(const P& a, const P& b)
{
return a.first * b.second - b.first * a.second;
}
pair<P, int> calcDistAndMul(const P& a, const P& b, const P& c)
{
P dm;
dm.first = calcDist(a, c);
dm.second = calcDist(b, c);
P v0 = {c.first - a.first, c.second - a.second};
P v1 = {c.first - b.first, c.second - b.second};
auto mul = calcMul(v0, v1);
return {dm, mul};
}
int main(int, const char**)
{
int N;
cin >> N;
vector<P> S(N), T(N);
rep(i, N) cin >> S[i].first >> S[i].second;
rep(i, N) cin >> T[i].first >> T[i].second;
if(N == 1) {
cout << "Yes" << endl;
return 0;
}
if(N == 2)
{
if(calcDist(S[0], S[1]) == calcDist(T[0], T[1]))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
vector<pair<P, int>> md(N - 2);
rep(i, N - 2)
{
auto ti = i + 2;
md[i] = calcDistAndMul(T[0], T[1], T[ti]);
}
sort(md.begin(), md.end());
#if 1
rep(i, N - 2)
{
P("[%d]: (%d, %d, %d)\n", i, md[i].first.first, md[i].first.second, md[i].second);
}
#endif
rep(i, N) rep(j, N)
{
if(i == j) continue;
P("i, j = (%d, %d)-----------------\n", i, j);
vector<pair<P, int>> d(N - 2);
int dcount = 0;
rep(k, N)
{
if(k == i || k == j) continue;
d[dcount++] = calcDistAndMul(S[i], S[j], S[k]);
}
sort(d.begin(), d.end());
#if 1
rep(k, dcount)
{
P("[%d]: (%d, %d, %d)\n", k, d[k].first.first, d[k].first.second, d[k].second);
}
#endif
bool valid = true;
rep(k, dcount)
{
if(md[k] != d[k])
{
valid = false;
break;
}
}
if(valid)
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define st first
#define nd second
#define endl '\n'
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) cerr << #x << " is "; for(auto&e: (x)) cerr << e << ' '; cerr << '\n'; //vector, set
#define what_is_a(x, n) cerr << #x << " is "; for(int i=0;i<n;i++) cerr << x[i] << ' '; cerr << '\n'; //n first element of array
#define cerr_pair(x) '{' << x.st << ", " << x.nd << '}'
#define pwhat_is(x) cerr << #x << " is " << cerr_pair(x) << endl;
#define pwhat_is_v(x) cerr << #x << " is "; for(auto&e: (x)) cerr << cerr_pair(e) << ' '; cerr << '\n'; //vector, set
#define pwhat_is_a(x, n) cerr << #x << " is "; for(int i=0;i<n;i++) cerr << cerr_pair(x[i]) << ' '; cerr << '\n'; //n first element of array
// #define int long long
typedef pair<int,int> pii;
const int N = 1e5+5;
const int INF = 1e9;
const int MOD = 1e9+7;
int32_t main()
{
IOS
//freopen("input.txt", "r", stdin);
string s; cin >> s;
cout << s[1] << s[2] << s[0] << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
// C - Rotate
char a,b,c;
cin>>a>>b>>c;
cout<<b<<c<<a;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
ll S, P;
cin >> S >> P;
vector<ll> div;
for (ll i = 1; i * i <= P; ++i) {
if (P % i == 0) {
div.push_back(i);
if (i * i != P)
div.push_back(P / i);
}
}
for (ll d : div) {
ll a = d;
ll b = P / a;
if (a + b == S) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
long S, P;
int main() {
cin >> S >> P;
for ( int i = 0; i < 10000000; i++ ) {
if ( ( i * (S-i) ) == P ) {
cout << "Yes" << endl;
goto END;
}
}
cout << "No" << endl;
END:
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int lst[3][11];
int nlst[10];
bool check(void) {
int num[3] = {0};
for (int i = 0; i < 3; i++) {
if (nlst[lst[i][0]] == 0) return false;
for (int j = 0; j < lst[i][10]; j++) {
num[i] *= 10;
num[i] += nlst[lst[i][j]];
}
}
return (num[0] + num[1] == num[2]);
}
signed main(void) {
string s;
bool b;
char clst[10];
int cp = 0;
for (int i = 0; i < 3; i++) {
cin >> s;
for (int j = s.size() - 1; j >= 0; j--) {
lst[i][10] = s.size();
b = true;
// アルファベットを数字に変換
for (int k = 0; k < cp; k++) {
if (clst[k] == s[j]) {
lst[i][j] = k;
b = false;
break;
}
}
if (b) {
if (cp >= 10) {
// 11文字以上使われてる
cout << "UNSOLVABLE" << endl;
return 0;
}
clst[cp] = s[j];
lst[i][j] = cp;
cp++;
}
}
}
vector<int> seed = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
sort(seed.begin(), seed.end());
do {
for (int i = 0; i < 10; i++) nlst[i] = seed[i];
b = check();
if (b) break;
} while (next_permutation(seed.begin(), seed.end()));
if (b) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < lst[i][10]; j++) cout << nlst[lst[i][j]];
cout << endl;
}
} else
cout << "UNSOLVABLE" << endl;
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
int main() {
ll n;
cin >> n;
vector<vector<ll>> ball(n+1, vector<ll>()), dp(n+1, vector<ll>(2, 0LL));
rep(i, n){
ll x, c;
cin >> x >> c;
ball[c].push_back(x);
}
ll nowl = 0LL, nowr = 0LL;
rep(i, n){
ll balllen = ball[i+1].size();
if(balllen){
sort(ball[i+1].begin(), ball[i+1].end());
ll nextl = ball[i+1][0], nextr = ball[i+1][balllen-1];
ll dis = nextr - nextl;
dp[i+1][0] = min(dp[i][0] + abs(nowl - nextr), dp[i][1] + abs(nowr - nextr)) + dis;
dp[i+1][1] = min(dp[i][0] + abs(nowl - nextl), dp[i][1] + abs(nowr - nextl)) + dis;
nowl = nextl;
nowr = nextr;
}else{
rep(j, 2){
dp[i+1][j] = dp[i][j];
}
}
}
cout << min(dp[n][0] + abs(nowl), dp[n][1] + abs(nowr)) << endl;
return 0;
} |
#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);
template<class T> bool chmin(T &a, const T &b){
if(a > b) {a = b; return true;}
else return false;
}
template<class T> bool chmax(T &a, const T &b){
if(a < b) {a = b; return true;}
else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
if(!v.empty()){
for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
std::cout<<v.back();
}
if(endline) std::cout<<std::endl;
}
struct edge{
int to;
ll cost;
edge(){}
edge(int a, ll b) : to(a), cost(b){}
};
using ve = vector<edge>;
void bfs(vec &a, vec &b, vec &dist){
mat G(N);
rep(i, N - 1) {
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
dist[0] = 0;
queue<int> que;
que.push(0);
while(!que.empty()){
int v = que.front();
que.pop();
for(int to : G[v]){
if(dist[to] == INF){
dist[to] = dist[v] + 1;
que.push(to);
}
}
}
}
void dfs(int p, int v, vec &a, vec &b, vec &c, vector<ve> &G, ll &res, vec &cv){
if(p != -1) cv[v] += cv[p];
for(edge e : G[v]){
if(e.to != p){
cv[e.to] += e.cost;
dfs(v, e.to, a, b, c, G, res, cv);
}
}
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin>>N;
vector<ve> G(N);
vec a(N-1), b(N-1), c(N-1, 0), cv(N, 0), dist(N, INF);
rep(i, N - 1){
cin>>a[i]>>b[i];
--a[i]; --b[i];
}
bfs(a, b, dist);
cin>>Q;
ll res = 0;
rep(_, Q){
int t, e, x;
cin>>t>>e>>x;
--e;
if(dist[a[e]] > dist[b[e]]) t = 3 - t;
if(t == 1){
res += x;
c[e] -= x;
}else{
c[e] += x;
}
}
rep(i, N - 1) if(dist[a[i]] > dist[b[i]]) swap(a[i], b[i]);
rep(i, N - 1){
G[a[i]].emplace_back(b[i], c[i]);
G[b[i]].emplace_back(a[i], 0);
}
dfs(-1, 0, a, b, c, G, res, cv);
rep(i, N){
cout<<res + cv[i]<<endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
int parent[200005],a[200005],b[200005];
ll prop[200005];
vector<int>edges[200005];
void dfs(int u,int p)
{
parent[u] = p;
for(int v:edges[u])
{
if(v==p) continue;
dfs(v,u);
}
return ;
}
void dfs2(int u,int p)
{
prop[u] += prop[p];
for(int v:edges[u])
{
if(v==p) continue;
dfs2(v,u);
}
return ;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,i,j,u,v,t;
ll w;
cin >> n;
for(i=1;i<n;i++)
{
cin >> u >> v;
a[i] = u;
b[i] = v;
edges[u].push_back(v);
edges[v].push_back(u);
}
dfs(1,0);
int q;
cin >> q;
while(q--)
{
cin >> t >> i >> w;
if(t==1)
{
u = a[i];
v = b[i];
}
else
{
u = b[i];
v = a[i];
}
if(u==parent[v])
{
prop[1] += w;
prop[v] -= w;
}
else
prop[u] += w;
}
dfs2(1,0);
for(i=1;i<=n;i++)
cout << prop[i] << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define reps(i,n) for(ll i=1;i<ll(n);i++)
#define rrep(i,n) for(ll i=ll(n);i>=0;i--)
#define ALL(x) x.begin(),x.end()
#define FOR(i,a,b) for(ll i=a;i<=b;i++)//使いにくかったら消す
#define len(x) x.length()//配列の長さ
#define SIZE(x) x.size()//vectorのサイズ
#define NPOS string::npos//findで検索失敗した場合の戻り値(findは文字列内に特定の文字列があるかを判定)
typedef long long ll;
using namespace std;
const ll INF=1LL<<60;//無限大
ll ans=0; //解答用の変数
bool comp_len(const std::string &lh,const std::string &rh){return lh.length() < rh.length();} //文字列を長さでソートする時の比較関数
ll gcd(ll a, ll b) {if (b==0) return a;else return gcd(b, a%b);} //最大公約数
ll lcm(ll a, ll b) {return a * b / gcd(a, b);} //最小公倍数
ll digit_sum(ll a,ll b){ll ans=0;while(a>0){ans+=a%b;a/=b;}return ans;} //n進桁和
ll digit_num(ll a,ll b){ll ans=0;while(a>0){ans++;a/=b;}return ans;} //n進桁数
ll fact(ll n){if(n==1)return 1;else return n*fact(n-1);} //階乗
ll array_sum(ll *a,ll n){ll ans=0;rep(i,n){ans+=a[i];}return ans;} //配列総和
ll combi(ll n, ll k){if(n==k||k==0){return 1;}else{return combi(n-1,k-1)+combi(n-1,k);}} //nCkの組み合わせ
bool is_prime(ll x){for(ll i=2;i*i<=x;i++){if(x%i==0)return false;}return true;} //素数判定
// for(long long i=1;i*i<= n;i++){if(n%i==0){ans.push_back(i);if(i*i!=n)ans.push_back(n/i);}} //約数列挙（vector型の変数の用意が必要）
/*繰り返し2乗法（べき乗のmodをとる）O(log n)*/
ll modPow(ll a,ll n,ll p){if(n==0)return 1;if(n==1)return a%p;if(n%2==1)return (a*modPow(a,n-1,p))%p;ll t=modPow(a,n/2,p);return (t*t)%p;}
/*dp(動的計画法)*/
template <typename T>bool chmax(T &a, const T& b){if(a<b){a=b;return true;}return false;}//a<bならaをbに置き換え
template <typename T>bool chmin(T &a, const T& b){if(a>b){a=b;return true;}return false;}//a>bならaをbで置き換え
// 'a'+(s[j]-'a'+i)%('z'-'a'+1) 文字をi文字ずらす
/*Union-Find(素集合データ構造)*/
vector<ll> par(100010);//親の値を保持
ll root(ll x){if(par[x]==x){return x;}else{return par[x]=root(par[x]);}}//根の値を返す
bool same(ll x,ll y){return (root(x)==root(y));}//根が一致しているか判定
void unite(ll x,ll y){x=root(x);y=root(y);if(x==y)return;par[x]=y;}//グループを併合
int main()
{
double a,b;
cin>>a>>b;
cout<<fixed<<setprecision(10)<<(a*(b/100))<<endl;
return 0;
}
| #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
#define all(a) (a).begin(), (a).end()
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m; cin>>n>>m;
map<int, int> cnt;
for(int i=0; i<n; i++){
int a; cin>>a;
cnt[a]++;
}
for(int i=0; i<m; i++){
int b; cin>>b;
cnt[b]++;
}
for(auto i : cnt){
if(i.second == 1){
cout << i.first << " ";
}
}
cout << endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
#define dbg(var) cout<<#var<<"="<<var<<" "
#define nl cout<<"\n"
#define fr(i,n) for(int i=0;i<n;i++)
#define rep(i,a,n) for(int i = a; i <= n; i++)
#define per(i,a,n) for(int i = a; i >= n; i--)
#define vi vector<int>
#define pb push_back
#define itr(i,v) for(auto &i:v)
#define all(v) v.begin(),v.end()
#define sz(v) (int)(v.size())
#define int long long
#define kill(x) {cout << x << "\n"; return;}
constexpr int mx = 2e5 + 10;
int fa[mx],sz[mx];
int gf(int x) { return fa[x]==x?x:fa[x]=gf(fa[x]); }
void merge(int x,int y) {
x = gf(x); y = gf(y);
if(x!=y) sz[x] += sz[y],fa[y]=x,sz[y] = 0;
}
void solve(){
iota(fa,fa+mx,0);
fill(sz,sz+mx,1);
int n; cin >> n;
vi v(n); fr(i,n) cin >> v[i];
int ans = 0;
fr(i,n/2) merge(v[i],v[n-1-i]);
fr(i,mx) if(sz[i]) ans += sz[i] - 1;
kill(ans);
}
int32_t main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// int tst; cin >> tst; while(tst--)
{
solve();
}
} | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);
template<class T> bool chmin(T &a, const T &b){
if(a > b) {a = b; return true;}
else return false;
}
template<class T> bool chmax(T &a, const T &b){
if(a < b) {a = b; return true;}
else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
if(!v.empty()){
for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
std::cout<<v.back();
}
if(endline) std::cout<<std::endl;
}
bool ok(int n){
for(int p : {10, 8}) {
int cn = n;
while (cn) {
if (cn % p == 7) return false;
cn /= p;
}
}
return true;
}
template <class T> class BIT {
//T has operator "+=" and can be initialized with 0.
unsigned int n;
vector<T> bitree;
public:
BIT(unsigned long _n) : bitree(_n + 1, 0) {
n = _n;
}
void add(int id, T x) {
++id;
while (id <= n) {
bitree[id] += x;
id += id & -id;
}
}
T sum(int id) {
++id;
T temp(0);
while (id > 0) {
temp += bitree[id];
id -= id & -id;
}
return temp;
}
};
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin>>H>>W>>M;
vec up(W, H), left(H, W);
rep(i, M){
ll x, y; cin>>x>>y;
--x; --y;
chmin(up[y], x);
chmin(left[x], y);
}
ll res = 0;
rep(i, up[0]) res += left[i];
rep(i, left[0]) res += up[i];
//cout<<res<<endl;
BIT<ll> bit(W + 1);
rep(i, left[0]) bit.add(i, 1);
priority_queue<P, vector<P>, greater<> > pque;
rep(i, left[0]) pque.emplace(up[i], i);
rep(i, up[0]){
while(!pque.empty()){
P p = pque.top();
ll hei = p.first, id = p.second;
if(hei > i) break;
pque.pop();
bit.add(id, -1);
}
res -= bit.sum(left[i] - 1);
//rep(j, W) cout<<bit.sum(j) - (j ? bit.sum(j-1) : 0)<<" \n"[j==W - 1];
//cout<<bit.sum(left[i] - 1)<<endl;
}
cout<<res<<endl;
}
|
#include <iostream>
#include <map>
#define int long long
using namespace std;
const int MAXN = 4e5 + 10;
int f[MAXN], g[MAXN];
int C(int n, int k) {
int sum = f[k] + f[n - k];
if (f[n] > sum) {
return 0;
}
return g[n] * g[n - k] * g[k] % 3;
}
signed main() {
g[0] = 1;
f[1] = 0;
g[1] = 1;
for (int i = 2; i < MAXN; ++i) {
if (i % 3 == 0) {
int cur = i, cnt = 0;
while (cur % 3 == 0) {
cur /= 3;
cnt++;
}
f[i] = f[i - 1] + cnt;
g[i] = g[i - 1] * cur % 3;
}
else {
g[i] = g[i - 1] * i % 3;
f[i] = f[i - 1];
}
}
int n;
cin >> n;
int ans = 0;
map<char, int> mp;
map<int, char> mp_r;
mp['B'] = 0;
mp['W'] = 1;
mp['R'] = 2;
mp_r[0] = 'B', mp_r[1] = 'W', mp_r[2] = 'R';
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
// cerr << C(n - 1, i) << endl;
ans = (ans + C(n - 1, i) * mp[c]) % 3;
}
if (n % 2 == 0) {
cout << mp_r[(3 - ans) % 3] << endl;
}
else {
cout << mp_r[ans] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, SZ(v)) {
if (i) os << " ";
os << v[i];
}
return os;
}
template <class T>
void debug(const vector<T> &v) {
cout << "[";
REP(i, SZ(v)) {
if(i) cout << ", ";
cout << v[i];
}
cout << "]" << endl;
}
template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << p.first << " " << p.second;
}
template <class T, class U>
void debug(const pair<T, U> &p) {
cout << "(" << p.first << " " << p.second << ")" << endl;
}
template<class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
const ll MOD = 1e9 + 7;
const ll MOD998 = 998244353;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const int inf = INT_MIN;
const ll linf = LLONG_MIN;
const ld eps = 1e-9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
vll p = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int sz = SZ(p);
int n; cin >> n;
vll x(n);
REP(i, n) cin >> x[i];
vector<vector<bool>> dp(n+1, vector<bool>(1<<sz, false));
dp[0][0] = true;
REP(i, n) {
REP(j, 1<<sz) {
if(!dp[i][j]) continue;
REP(k, sz) {
if(x[i] % p[k] == 0) {
if(j>>k&1) {
dp[i+1][j] = true;
} else {
dp[i+1][j|(1<<k)] = true;
}
}
}
}
}
ll ans = LINF;
REP(i, 1<<sz) {
if(dp[n][i]) {
ll val = 1;
REP(j, sz) {
if(i>>j&1) {
val *= p[j];
}
}
chmin(ans, val);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define eps 1e-18
#define pi acos(-1)
#define ar array
#define int int64_t
using namespace std;
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.fi << ", " << p.se << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << ""; for(int i = 0; i < v.size(); i++) {if (i) cout << " "; cout << v[i];} return cout << "";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
template<typename T> istream& operator>>(istream &cin, vector<T> &v){
for(int i=0;i<v.size()-1;++i)cin>>v[i];
return cin>>v[(int)v.size()-1];
}
template<class T>
T roof(T a, T b){
return (a+b-1)/b;
}
template<class T>
T modulo(T a, T m){
return (a%m+m)%m;
}
int Log(int a, int b){
int c=0;
while(a)a/=b,c++;
return c;
}
int qpow(int x,int n, int m){
int r = 1;
for(;n;n>>=1){
if(n&1)(r = r * x)%=m;
(x = x * x)%=m;
}
return r;
}
bool pal(string s){
for(int i=0;i<s.size()/2+1;++i)if(s[i]!=s[(int)s.size()-i-1])return false;
return true;
}
template<class T>
void maxi(T& a, T b){
a=max(a,b);
}
template<class T>
void mini(T& a, T b){
a=min(a,b);
}
void done(int tc){
int n,k; cin >> n >> k;
while(k--){
if(n%200==0){
n/=200;
}else{
n *= 1000;
n += 200;
}
// cerr << n << " ";
}
cout<<n<<endl;
// cout <<"Case "<<<<tc<<": "<<((cnt==-1)?"IMPOSSIBLE":cnt)<<endl;
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout<<fixed<<setprecision(10);
// freopen("input.txt","r",stdin);
int t; t = 1;
// cin >> t;
for(int i=1;i<=t;++i){
//cout<<"Case #"<<i<<": ";
//cout<<"Case "<<i<<": ";
done(i);
}
}
| #include <bits/stdc++.h>
#define FOR(i,x,n) for(int i=x; i<n; i++)
#define F0R(i,n) FOR(i,0,n)
#define ROF(i,x,n) for(int i=n-1; i>=x; i--)
#define R0F(i,n) ROF(i,0,n)
#define WTF cerr << "WTF" << endl
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define FILL(a, b) memset(a, b, sizeof(a));
#define TOGGLE(x) (x) = 1 - (x)
using namespace std;
typedef double db;
typedef long long LL;
typedef string str;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<string> VSTR;
typedef set<int> SI;
typedef set<PII> SPII;
typedef set<PLL> SPLL;
typedef priority_queue<PII> DIPQ;
const int MAXN = 2e5 + 7;
const int MAXA = 1e7 + 7;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int LOG = 20;
const LL LONG_INF = 1e18;
int n;
str inp;
void Solve () {
cin >> n >> inp;
if (inp[0] != inp[n - 1]) {
cout << 1 << endl;
return;
}
else {
FOR (i, 1, n - 2) {
if (inp[i] != inp[0] && inp[i + 1] != inp[0]) {
cout << 2 << endl;
return;
}
}
}
cout << -1 << endl;
}
int main() {
IOS;
Solve ();
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
const int MOD = 1000000007;
vector<long long> fac, finv, inv;
void InitializeCombination(int COMMAX){
fac.push_back(1LL);
fac.push_back(1LL);
finv.push_back(1LL);
finv.push_back(1LL);
inv.push_back(0LL); //Though 0^(-1) cannot be defined, there should be some number in inv[0]
inv.push_back(1LL);
for (int i = 2; i <= COMMAX; i++){
fac.push_back(fac[i-1] * (long long)i % (long long)MOD);
inv.push_back((long long)MOD - inv[MOD%i] * (long long)(MOD/i) % (long long)MOD);
finv.push_back(finv[i-1] * inv[i] % (long long)MOD);
}
}
long long Combination(int n, int r){
if (n < r) return 0LL;
if (n < 0 || r < 0) return 0LL;
return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD;
}
long long InvCombination(int n, int r){
if (n < r) return 0LL;
if (n < 0 || r < 0) return 0LL;
return finv[n] * (fac[r] * fac[n-r] % MOD) % MOD;
}
int HexCharToInt(char C){
if((C>='0')&&(C<='9'))return C-'0';
return C-'A'+10;
}
int main(void){
string strN;
int K;
long long res = 0LL;
cin >> strN >> K;
vector<vector<long long>> numHex(1, vector<long long>(K+1, 0LL));
int lenN = (int)strN.size();
InitializeCombination(16);
numHex.push_back({});
for(int i=0; i<=K; i++)numHex[1].push_back(i == 1 ? 16LL : 0LL);
for(int i=2; i<=lenN; i++){
numHex.push_back({});
for(int j=0; j<=K; j++){
if((j==0)||(j>i)){
numHex[i].push_back(0LL);
}else{
numHex[i].push_back((numHex[i-1][j]*j%MOD+numHex[i-1][j-1]*(17-j)%MOD)%MOD);
}
}
}
for(int i=1; i<lenN; i++){
res += numHex[i][K]*15%MOD*inv[16]%MOD;
res %= MOD;
}
set<int> setSpecies;
int numSpecies = 0;
for(int i=0; i<lenN; i++){
int Ni = HexCharToInt(strN[i]);
for(int j=0; j<Ni; j++){
if((i==0)&&(j==0))continue;
set<int> nxtSpecies = setSpecies;
nxtSpecies.insert(j);
int nxtNum = (int)nxtSpecies.size();
if(nxtNum > K)continue;
if(i<lenN-1){
for(int k=K-nxtNum; k<=K; k++){
res += numHex[lenN-i-1][k]*Combination(nxtNum, nxtNum+k-K)%MOD*Combination(16-nxtNum, K-nxtNum)%MOD*InvCombination(16, k)%MOD;
res %= MOD;
}
}else{
if(nxtNum==K){
res++;
res %= MOD;
}
}
}
setSpecies.insert(Ni);
numSpecies = (int)setSpecies.size();
if(numSpecies > K)break;
}
if(numSpecies == K)res = (res + 1) % MOD;
cout << res << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); (i)++)
#define per(i, n) for (ll i = n - 1; i >= 0; (i)--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define ROF(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define ALL(x) std::begin(x), std::end(x)
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
//input, initialize
int N, M; cin >> N >> M;
vector<int> A(N);
rep(i, N) cin >> A[i];
//solve
vector<vector<int>> C(M);
rep(i, M) C[i].emplace_back(0);
rep(i, N){
if(A[i] >= M) continue;
C[A[i]].emplace_back(i+1);
}
rep(i, M) C[i].emplace_back(N+1);
int ans = M;
rep(i, M){
rep(j, C[i].size()-1){
if(C[i][j+1] - C[i][j] > M){
ans = i;
goto isAns;
}
}
}
isAns:
//output
cout << ans << '\n';
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod ((int)1e9+7)
#define lim 1000000000000000007
#define lim1 18446744073709551615 //Unsigned
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REPN(i,a,b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> PL;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL;
typedef pair<int,pair<int,int> > pii;
typedef pair<double,double> pdd;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
ll power(ll a,ll b) {
a %= mod;
ll res=1;
while(b){
if(b%2==1) res=(res*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return res;
}
ll gcdll(ll a,ll b) {
if (b==0) return a;
return gcdll(b,a%b);
}
int gcd(int a,int b) {
if (b==0) return a;
return gcd(b,a%b);
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
const int N = (int)2e5+5;
const int M = (int)3e3+5;
const int Q = 301;
const int logN = 19;
bool check(pi a, pi b) {
int num = (b.second - a.second);
int den = (b.first - a.first);
return (abs(num)<=abs(den));
}
void solve() {
int n;
cin >> n;
vector<pi> points(n);
int ans = 0;
REP(i,0,n-1) {
cin >> points[i].first >> points[i].second;
REP(j,0,i-1) {
if(check(points[i],points[j])) {
ans++;
}
}
}
cout << ans;
}
int main() {
//freopen("output.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
// cin>>T;
REP(TC,1,T) {
//cout<<"Case #"<<TC<<": ";
solve();
cout<<"\n";
}
}
| #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using ll= long long ;
#define rep(i,n) for(int i=0;i<(n);i++)
#define f first
#define sc second
int fact(int n){
if(n==0){
return 1;
}else{
return n*fact(n-1);
}
}
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<x;i++){
if(x%i==0) return false;}
return true;}
template<class T>void chmin(T& a,T b){
if(a>b){
a=b;
}
}
template<class T>void chmax(T& a,T b){
if(a<b){
a=b;
}
}
int gcd(int x, int y) {
if(x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
ll f(ll x,ll c,ll d){
return x-x/c-x/d+x/(c/(gcd(c,d))*d);
}
using namespace std;
int main(){
int n;
cin>>n;
set<string> t;
string s[n];
rep(i,n){
cin>>s[i];
t.insert(s[i]);
}
bool ok=false;
rep(i,n){
if(t.count('!'+s[i])){
cout << s[i] << endl;
ok=true;
return 0;
}
}
cout << "satisfiable" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); freopen("error.txt", "w", stderr);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
template <typename Arg1, typename... Args>
void prn(Arg1&& arg1, Args&&... args) { cout<<arg1<<" "; prn(args...); }
template <typename Arg1>
void prs(Arg1&& arg1) { cout<<arg1<<" ";}
template <typename Arg1, typename... Args>
void prs(Arg1&& arg1, Args&&... args) { cout<<arg1<<" "; prs(args...); }
template <typename Arg1>
void read(Arg1&& arg1) { cin>>arg1; }
template <typename Arg1, typename... Args>
void read(Arg1&& arg1, Args&&... args) { cin>>arg1; read(args...); }
#define int long long
#define all(ds) ds.begin(), ds.end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define gcd(x,y) __gcd(x,y)
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<b;i++)
#define precise(x) cout<<fixed<<setprecision(x)
#define endl "\n"
/* debug */
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x<<" "; _print(x); cerr << endl;
#else
#define debug(x);
#endif
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
/* debug */
const long long INF = 2e18;
const int32_t MOD = 1e9+7;
const int N = 2e5+5;
int n, m, k, q, r, l, x, y, z;
int a[N], b[N], c[N];
string s, t;
int ans = 0;
void solve(){
int t = 1;
// read(t);
while(t--){
read(n,x);
// sum is congruent to x modulo n
int a[n];
rep(i,0,n) read(a[i]);
int ans = x;
for(int size = 1; size <= n; ++size){
vector<vector<int>>dp(size+1, vector<int>(size, -1));
dp[0][0] = 0;
for(int val: a){
for(int i = size-1; i >= 0; --i){
for(int j = 0; j < size; ++j){
if(dp[i][j] == -1) continue;
int next = dp[i][j] + val;
dp[i+1][next%size] = max(dp[i+1][next%size], next);
}
}
}
int start = dp[size][x%size];
if(start == -1) continue;
ans = min(ans, (x-start)/size);
}
prn(ans);
}
}
signed main()
{
#ifndef ONLINE_JUDGE
input_output
#else
fastio
#endif
#ifdef SIEVE
sieve();
#endif
#ifdef NCR
init();
#endif
auto start1 = high_resolution_clock::now();
solve();
auto stop1 = high_resolution_clock::now();
auto duration = duration_cast<microseconds>(stop1 - start1);
#ifndef ONLINE_JUDGE
cerr << "Time: " << duration.count() / 1000 << endl;
#endif
return 0;
} | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void chmax(T& reference, T value) {
reference = max(reference, value);
}
template<typename T>
void chmaxmap(map<T, T>& m, T key, T value) {
if (m.count(key)) {
chmax(m[key], value);
}
else {
m[key] = value;
}
}
template<typename T>
void chmin(T& reference, T value) {
reference = min(reference, value);
}
ll solve(ll c) {
vector<ll> as;
while (c) {
as.push_back(c % 10);
c /= 10;
}
sort(as.begin(), as.end());
int n = as.size();
ll g = 0, l = 0;
for (int i = 0; i < n; i++) {
g *= 10;
g += as[n - 1 - i];
l *= 10;
l += as[i];
}
return g - l;
}
int main() {
ll n, x;
cin >> n >> x;
vector<ll> as(n);
ll u = 0;
rep(i, n) {
cin >> as[i];
chmax(u, as[i]);
}
ll ans = x - u;
for (int i = 2; i <= n; i++) {
vector<vector<vector<ll>>> dp(n+1,
vector<vector<ll>>(n + 1,
vector<ll>(n + 1, -1)));
dp[0][0][0] = 0;
//j番目
for (int j = 0; j < n; j++) {
//k個取った
for (int k = 0; k <= j; k++) {
//余りがm
for (ll m = 0; m < i; m++) {
if (dp[j][k][m] >= 0) {
chmax(dp[j+1][k][m], dp[j][k][m]);
ll nm = (m + as[j]) % i;
chmax(dp[j + 1][k + 1][nm], dp[j][k][m] + as[j]);
}
}
}
}
for (int m = 0; m < i; m++) {
ll v = dp[n][i][m];
if (v >= 0) {
if ((x - v) % i == 0) {
chmin(ans, (x - v) / i);
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;scanf("%d%d%d%d",&a,&b,&c,&d);
if(a==c&&b==d)return puts("0"),0;
if(a+b==c+d||a-b==c-d||abs(a-c)+abs(b-d)<=3)return puts("1"),0;
if(abs(a-b-c+d)<=3||abs(a+b-c-d)<=3||((a+b)%2)==((c+d)%2))return puts("2"),0;
puts("3");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) memset((a),0,sizeof(a))
#define MCLR(a) memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};
int solve(int sx, int sy, int gx, int gy) {
if(sx == gx && sy == gy) return 0;
if(sx + sy == gx + gy) return 1;
if(sx - sy == gx - gy) return 1;
if(abs(sx - gx) + abs(sy - gy) <= 3) return 1;
if((abs(sx - gx) + abs(sy - gy)) % 2 == 0) return 2;
return 3;
}
int main(){
int sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
int ans = solve(sx, sy, gx, gy);
REP2(i, -3, 4) {
REP2(j, -3, 4) {
if (3 < abs(i) + abs(j)) continue;
ans = min(ans, solve(sx + i, sy + j, gx, gy) + 1);
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <cmath>
#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 <climits>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ld = long double;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using namespace std;
template<class T> struct matrix{
matrix(int n = 0, T m = numeric_limits<T>::max()) : n(n), Mod(m), a(n, vector<T>(n)){}
vector<T> &operator[](const int &m){ return a[m]; }
matrix &operator*=(const matrix &b){
vector<vector<T>> c(n, vector<T>(n));
rep(i, n) rep(j, b.n) rep(k, n){
c[i][j] = (c[i][j] + a[i][k] * b.a[k][j]) % Mod;
}
a = c;
return *this;
}
matrix &operator+=(const matrix &b){
rep(i, n) rep(j, n){
a[i][j] += b.a[i][j];
if(a[i][j] >= Mod) a[i][j] -= Mod;
}
return *this;
}
matrix &operator-=(const matrix &b){
rep(i, n) rep(j, n){
a[i][j] -= b.a[i][j];
if(a[i][j] <= -Mod) a[i][j] += Mod;
}
return *this;
}
matrix operator*(const matrix &b) const{ return matrix(*this) *= b; }
matrix operator+(const matrix &b) const{ return matrix(*this) += b; }
matrix operator-(const matrix &b) const{ return matrix(*this) -= b; }
matrix pow(ll t) const{
matrix<T> b(n, Mod), c = *this;
rep(i, n) b[i][i] = 1;
while(t > 0){
if(t & 1) b *= c;
c *= c;
t /= 2;
}
return b;
}
int n;
vector<vector<T>> a;
private:
T Mod;
};
int main(){
int n,m,q;
cin >> n;
vl x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
cin >> m;
matrix<ll> op1(3), op2(3), op3(3), op4(3);
op1.a = {{0,1,0}, {-1,0,0}, {0,0,1}};
op2.a = {{0,-1,0}, {1,0,0}, {0,0,1}};
op3.a = {{-1,0,0}, {0,1,0}, {0,0,1}};
op4.a = {{1,0,0}, {0,-1,0}, {0,0,1}};
vector<matrix<ll>> c(m + 1);
c[0] = matrix<ll>(3);
c[0].a = {{1,0,0}, {0,1,0}, {0,0,1}};
rep(i, m){
int t; cin >> t;
if(t == 1) c[i + 1] = op1 * c[i];
if(t == 2) c[i + 1] = op2 * c[i];
if(t == 3){
ll p; cin >> p;
op3.a[0][2] = 2 * p;
c[i + 1] = op3 * c[i];
}
if(t == 4){
ll p; cin >> p;
op4.a[1][2] = 2 * p;
c[i + 1] = op4 * c[i];
}
}
cin >> q;
rep(i, q){
int a,b;
cin >> a >> b;
b--;
vl pos = {x[b], y[b], 1}, ans(3);
rep(j, 3) rep(k, 3) ans[j] += c[a][j][k] * pos[k];
cout << ans[0] << " " << ans[1] << endl;
}
} | #include <iostream>
#include <vector>
#include <utility>
using namespace std;
struct Operation
{
int M;
vector<vector<long long>> op;
vector<vector<long long>> sel = {
{0, 1, 0, -1, 0, 0, 0, 0, 1},
{0, -1, 0, 1, 0, 0, 0, 0, 1},
{-1, 0, 0, 0, 1, 0, 0, 0, 1},
{1, 0, 0, 0, -1, 0, 0, 0, 1}
};
Operation(int m) : M(m)
{
op.resize(M + 1);
for (int i = 0; i < M + 1; ++i)
{
op.at(i).resize(9);
}
op.at(0) = {1, 0, 0, 0, 1, 0, 0, 0, 1};
}
vector<long long> multiply(const vector<long long> &a, const vector<long long> &b) {
vector<long long> rtn(9);
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
rtn.at(i * 3 + j) = a.at(i*3+0) * b.at(0+j) + a.at(i*3+1) * b.at(3+j) + a.at(i*3+2) * b.at(6+j);
}
}
return rtn;
}
void update(int i, int o, int p)
{
if (o > 2) sel.at(o-1).at((o-2)*3-1) = 2 * p;
op.at(i) = multiply(sel.at(o-1), op.at(i-1));
}
pair<long long, long long> apply(int i, pair<long long, long long> xy) {
pair<long long, long long> rtn;
rtn.first = op.at(i).at(0) * xy.first + op.at(i).at(1) * xy.second + op.at(i).at(2);
rtn.second = op.at(i).at(3) * xy.first + op.at(i).at(4) * xy.second + op.at(i).at(5);
return rtn;
}
};
int main()
{
int n;
cin >> n;
vector<pair<long long, long long>> xy(n);
for (int i = 0; i < n; ++i)
{
cin >> xy.at(i).first >> xy.at(i).second;
}
int m;
cin >> m;
Operation op(m);
for (int i = 1; i <= m; ++i)
{
int o, p = 0;
cin >> o;
if (o > 2) cin >> p;
op.update(i, o, p);
}
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int a, b;
cin >> a >> b;
pair<long long, long long> ans = op.apply(a, xy.at(b-1));
cout << ans.first << " " << ans.second << endl;
}
return 0;
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n,m;
cin>>n>>m;
cout<<(n+m)/2<<" "<<(n-m)/2;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
const int INF=1LL<<30;
const string YYY="YES";
const string yyy="Yes";
const string NNN="NO";
const string nnn="No";
template<class T>void chmin(T& a,T b){
if(a>b){
a=b;
}
}
template<class T>void chmax(T& a,T b){
if(a>b){
a=b;
}
}
string rot13(string S){
int a=S.size();
for(int i=0;i<a;i++){
if(S[i]=='a'){S[i]='n';continue;}
if(S[i]=='b'){S[i]='o';continue;}
if(S[i]=='c'){S[i]='p'; continue;}
if(S[i]=='d'){S[i]='q'; continue;}
if(S[i]=='e'){S[i]='r'; continue;}
if(S[i]=='f'){S[i]='s'; continue;}
if(S[i]=='g'){S[i]='t'; continue;}
if(S[i]=='h'){S[i]='u'; continue;}
if(S[i]=='i'){S[i]='v'; continue;}
if(S[i]=='j'){S[i]='w'; continue;}
if(S[i]=='k'){S[i]='x'; continue;}
if(S[i]=='l'){S[i]='y'; continue;}
if(S[i]=='m'){S[i]='z'; continue;}
if(S[i]=='n'){S[i]='a'; continue;}
if(S[i]=='o'){S[i]='b'; continue;}
if(S[i]=='p'){S[i]='c'; continue;}
if(S[i]=='q'){S[i]='d';continue;}
if(S[i]=='r'){S[i]='e'; continue;}
if(S[i]=='s'){S[i]='f'; continue;}
if(S[i]=='t'){S[i]='g'; continue;}
if(S[i]=='u'){S[i]='h'; continue;}
if(S[i]=='v'){S[i]='i'; continue;}
if(S[i]=='w'){S[i]='j'; continue;}
if(S[i]=='x'){S[i]='k';continue;}
if(S[i]=='y'){S[i]='l'; continue;}
if(S[i]=='z'){S[i]='m'; continue;}
}
return S;
}
ll GD(ll num){//各桁の和
ll digit=0;
while(num!=0){
digit+=num%10;
num/=10;
}
return digit;
}
bool if_integer( ld x ){//整数判定
return std::floor(x)==x;
}
bool if_prime(ll x){
bool a=true;
for(ll i=2;i*i<=x;i++){
if(x%i==0){
a=false;break;
}
}
if(x==1)a=false;
return a;
}
ll gcd(ll x, ll y)//最大公約数
{
if (x%y == 0)
{
return(y);
}
else
{
return(gcd(y, x%y));
}
}
ll lcm(ll x, ll y)//最小公倍数
{
return x / gcd(x, y)*y ;
}
inline ll mod(ll a, ll m) {
return (a % m + m) % m;
}
ll modPow(ll a, ll n, ll p) {
if (n == 0) return 1; // 0乗にも対応する場合
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a%b, y, x);
y -= a/b * x;
return d;
}
int main() {
ll n,k;cin>>n>>k;
ll sum=0;
sum+=100*(n)*(n+1)/2*k;
sum+=n*(k)*(k+1)/2;
cout<<sum;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 500010;
ll prime[N] = {0}, num_prime = 0; //prime存放着小于N的素数
int isNotPrime[N] = {1, 1}; // isNotPrime[i]如果i不是素数，则为1
ll n, cnt;
ll Not[N];
int Prime()
{
for (ll i = 2; i < N; i++)
{
if (!isNotPrime[i])
prime[num_prime++] = i;
//无论是否为素数都会下来
for (ll j = 0; j < num_prime && i * prime[j] < N; j++)
{
isNotPrime[i * prime[j]] = 1;
if (!(i % prime[j])) //遇到i最小的素数因子
//关键处1
break;
}
}
for (int j = 0; prime[j] * prime[j] <= 1e5; j++)
{
ll temp = prime[j] * prime[j];
while (temp <= 1e5)
{
Not[temp] = true;
temp *= prime[j];
}
}
return 0;
}
long long ifpower(long long _a, long long _b, long long _p = 1e18)
{
long long _ans = 1;
while (_b)
{
if (_b & 1)
_ans = (_ans * _a) % _p;
_a = (_a * _a) % _p;
_b >>= 1;
}
return _ans;
}
int main()
{
Prime();
scanf("%lld", &n);
// for (int i = 2; i <= 10; i++)
// printf("%d ", Not[i]);
cnt = 0;
for (ll i = 2; i * i <= n; i++)
{
if (Not[i])
continue;
ll temp = i * i;
while (temp <= n)
{
if(temp<=1e5)
Not[temp] = true;
cnt++;
temp *= i;
}
}
printf("%lld", n - cnt);
return 0;
} | #include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
int arr[N];
for(int i=0;i<N;i++){
cin>>arr[i];
}
int sum=0;
for(int i=0;i<N;i++){
if(arr[i]>10) sum+=arr[i]-10;
}
cout<<sum<<endl;
return 0;
} |
// International Master sm0016
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define raftaar ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
const ll MOD1=1000000007;
const ll MOD2= 998244353;
const int N=1e6+6;
int main(){
raftaar
int a,b;cin>>a>>b;int ans=1;int check[N]={0};
for(int i=a;i<=b;i++){
for(int j=1;j*j<=i;j++){
if(i%j==0){
if(j*j==i) check[j]++;
else{check[j]++;check[i/j]++;}
}
}
}
for(int i=1;i<=max(a,b);i++){
if(check[i]>1) ans=max(ans,i);
}
cout<<ans;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<ll,int>
#define PI 3.141592653589793
#define pb push_back
#define C complex<double>
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 998244353;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
map<int, int> mp;
rep(i, n) mp[a[i]]++;
rep(i, m) mp[b[i]]++;
rep(i, 1000) {
if (mp[i + 1] == 1) cout << i + 1 << " ";
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define brn "\n"
#define ss second
#define mk make_pair
#define int long long
#define pb push_back
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x--)
#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 so(a,n) sort(a,a+n)
#define rso(a,n) sort(a,a+n),reverse(a,a+n)
#define all(v) (v).begin(),(v).end()
#define ps(x,y) fixed<<setprecision(y)<<x
#define sz size();
#define p_sieve 10000007
const int maxn = 1e3 + 5;
const int modulo=1000000007;
#define mod 1000000009;
const double pi=3.14159;
//check n==1 and base cases//
//don't stuck on 1 question try another too
// int dp(int a[],int x,int i,int n)
// {
// if(i>n-1)return 0;
// if(a[i]>x)
// {
// return mini=min(dp(a,x,i+1,n),dp())
// }
// }
// void zfun(string s)
// {
// int n;cin>>n;
// int a[n];
// FOR(i,0,n)cin>>a[i];
// int q;cin>>q;
// int maxi=0;
// FOR(i,0,q)
// {
// int x;cin>>x;
// if(x==2)
// {
// int y;cin>>y;
// maxi=max(maxi,y);
// }
// else
// {
// int y,z;cin>>y>>z;
// a[y-1]=z;
// }
// }
// FOR(i,0,n)
// {
// if(a[i]<maxi)a[i]=maxi;
// }
// for(auto i:a)cout<<i<<' ';
// }
// int cnt(string s,int i,int n,int tt)
// {
// if(i>=n)return 0;
// if(s[i]=='u' and s[i+1]=='u')
// {
// return cnt(s,i+2,n,tt+1)+cnt(s,i+1,n,tt);
// }
// else if(s[i]=='n' and s[i+1]=='n')
// {
// return cnt(s,i+2,n,tt+1)+cnt(s,i+1,n,tt);
// }
// // else return cnt(s,i+1,n,tt)+cnt(s,i+1,n,tt);
// return tt;
// }
// ll dp[N][2][2]={0};
// ll n;
// ll a[100000],b[100000];
// ll maxi(int i,int ch,int x)
// {
// if(i>=n)return 0;
// if(dp[i][x][ch]!=-1)return dp[i][x][ch];
// if(x==0) dp[i][x][ch] = max(maxi(i+1,0,1)+b[i],maxi(i+1,1,1)+a[i]);
// else if(ch==1) dp[i][x][ch] = max(maxi(i+1,0,1)+b[i],maxi(i+1,0,0));
// else if(ch==0) dp[i][x][ch] = max(maxi(i+1,1,1)+a[i],maxi(i+1,1,0));
// return dp[i][x][ch];
// }
// const int N=100005;
// int dp[N][2][2];
// int a[100005];
// int b[100005];
// int n;
// int maxi(int i,int ch,int x)
// {
// if(i>=n)return 0;
// if(dp[i][ch][x]!=-1)return dp[i][ch][x];
// if(x==0) dp[i][ch][x] = max(maxi(i+1,0,1)+b[i],maxi(i+1,1,1)+a[i]);
// else if(ch==1)dp[i][ch][x] = max(maxi(i+1,0,1)+b[i],maxi(i+1,0,0));
// else if(ch==0)dp[i][ch][x] = max(maxi(i+1,1,1)+a[i],maxi(i+1,1,0));
// return dp[i][ch][x];
// }
// int n,k,m;
// int a[N],b[N],c[N];
// int x,y,cnt=0;
// std::vector<pair<int,int>> v;
// std::vector<int> vec,vec1;
// set<int>s;
//********************************---------always check array boundness-----------****************
void solve()
{
int a,b,c,d;cin>>a>>b>>c>>d;
cout<<min(a,min(b,min(c,d)));
}
//########################---------code ends here------------------########################################################
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//prime_sieve();
//w(t)
solve();
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = min({a, b, c, d});
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
//#include <bits/extc++.h>
#define int long long
#define ll long long
//#define ull unsigned ll
#define endl "\n"
#define pb push_back
#define ms(v,x) memset(v, x, sizeof v)
#define ff first
#define ss second
#define td(v) v.begin(), v.end()
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,a,n) for (int i=(n-1);i>=a;i--)
#define trav(a, x) for(auto& a : x)
#define re(v) {for(auto &_re : v) cin >> _re;}
#define pr(v) {for(auto _pr : v) cout << _pr << " "; cout << endl;}
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define eb emplace_back
using namespace std;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll M = 1e9 + 7;
//const ll M = 998244353;
//const ll M = 1e9 + 9;
//const ll M = 1e6;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b){
ll res = (a!=0) % M;
while(b > 0){
if(b&1) res = res * a % M;
a = a * a % M;
b>>=1;
}
return res;
}
void solve(){
ll a, b , c;
cin >> a >> b >> c;
cout << (7 - a) + (7 - b) + (7 - c) << endl;
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
int t = 1;
//cin >> t;
while(t--){
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
int n, m, i, j;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
string s, x;
cin >> s >> x;
vector<int>dp(10);
dp[0] = 1;
for(i=s.size()-1;i>=0;i--){
vector<int>tmp(10);
for(j=0;j<7;j++){
int ps = j*10+s[i]-'0';
int p = j*10;
ps %= 7;
p %= 7;
if(x[i]=='A'){
if(dp[ps]&&dp[p])
tmp[j] = 1;
}
else{
if(dp[ps]||dp[p]){
tmp[j] = 1;
}
}
}
dp = tmp;
}
if(dp[0])
cout << "Takahashi\n";
else
cout << "Aoki\n";
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define MOD 1000000007
void solve()
{
int n;
cin>>n;
int a,b,c;
int num = n+1;
int ans = 0;
vector<vector<pair<int,int>>>gra(num);
for(int i=0;i<n-1;i++)
{
cin>>a>>b>>c;
gra[a].push_back({b,c});
gra[b].push_back({a,c});
}
queue<int>q;
q.push(1);
vector<int>visited(n+1),distance(n+1);
distance[1] = 0;
while(!q.empty())
{
int r = q.front();
q.pop();
if(visited[r]==1)
{
continue;
}
visited[r] = 1;
for(int i=0;i<gra[r].size();i++)
{
distance[gra[r][i].first] = distance[r]^gra[r][i].second;
// cout<<gra[r][i].first<<" "<<distance[gra[r][i].first]<<endl;
q.push(gra[r][i].first);
}
}
for(int i=1;i<=61;i++)
{
int numo = 0,numz = 0;
for(int j=1;j<=n;j++)
{
if(distance[j]&1)
numo++;
else
numz++;
distance[j] = distance[j]>>1;
}
int pans = (((int)pow(2,i-1)%MOD*numo)%MOD*numz)%MOD;
// cout<<pans<<endl;
ans=(ans+pans)%MOD;
}
cout<<ans<<endl;
}
signed main()
{
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
return ModInt(u); }
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i @hamayanhamayan0
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N;
vector<pair<int, ll>> E[201010];
ll xo[201010];
//---------------------------------------------------------------------------------------------------
void dfs(int cu, int pa, ll x) {
xo[cu] = x;
fore(p, E[cu]) if (pa != p.first) dfs(p.first, cu, x ^ p.second);
}
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N - 1) {
int a, b; ll c; cin >> a >> b >> c;
a--; b--;
E[a].push_back({ b, c });
E[b].push_back({ a, c });
}
dfs(0, -1, 0);
mint ans = 0;
rep(bit, 0, 60) {
ll msk = 1LL << bit;
ll cnt[2] = { 0, 0 };
rep(i, 0, N) cnt[(xo[i] & msk) != 0]++;
ans += mint(msk) * mint(cnt[0]) * mint(cnt[1]);
}
cout << ans << endl;
}
|
// Problem : B - Abbreviate Fox
// Contest : AtCoder - AtCoder Regular Contest 108
// URL : https://atcoder.jp/contests/arc108/tasks/arc108_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define DEBUG fprintf(stderr, "Passing [%s] line %d\n", __FUNCTION__, __LINE__)
#define File(x) freopen(x".in","r",stdin); freopen(x".out","w",stdout)
using namespace std;
typedef long long LL;
typedef pair <int, int> PII;
typedef pair <int, PII> PIII;
template <typename T>
inline T gi()
{
T f = 1, x = 0; char c = getchar();
while (c < '0' || c > '9') {if (c == '-') f = -1; c = getchar();}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return f * x;
}
const int INF = 0x3f3f3f3f, N = 200003, M = N << 1;
int n;
char s[N], stk[N];
int tp;
int main()
{
//File("");
n = gi <int> ();
scanf("%s", s + 1);
for (int i = 1; i <= n; i+=1)
{
stk[++tp] = s[i];
if (tp >= 3 && stk[tp] == 'x' && stk[tp - 1] == 'o' && stk[tp - 2] == 'f')
tp -= 3;
}
printf("%d\n", tp);
return 0;
} | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
string fie[510];
for(int i=0;i<H;i++)cin>>fie[i];
int flglis[1010]={0};
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(fie[i][j]=='B')flglis[i+j]=flglis[i+j]|1;
if(fie[i][j]=='R')flglis[i+j]=flglis[i+j]|2;
}
}
long long int ans=1;
for(int i=0;i<=H+W-2;i++){
if(flglis[i]==0){
ans*=2;
ans%=998244353;
}
else if(flglis[i]==3){
ans*=0;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
li len(vector<vector<li>>& vec,vector<int>& kero){
int n=kero.size(),a=0;
li ret=0;
rep(i,n){
ret+=vec[a][kero[i]];
a=kero[i];
}
ret+=vec[a][0];
if(df)print(ret);
return ret;
}
int main(){
int n;
li k; cin >>n >>k;
vector<vector<li>> vec(n,vector<li>(n));
rep(i,n) rep(j,n) cin >>vec[i][j];
vector<int> kero(n-1);
rep(i,n-1) kero[i]=i+1;
int cnt=0;
do{
if(k==len(vec,kero)) cnt++;
}while(next_permutation(kero.begin(),kero.end()));
print(cnt);
}
| #include"bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define all(v) begin(v), end(v)
#define mod (int)(1e9 + 7)
#define inf (int)(4e18)
#define N (int)(2e5 + 10)
#define ff first
#define ss second
/* Clear global containers without fail */
list<pair<int, int>> adjList[10];
int vis[10] = {};
int n, k;
int backtrack(int nd, int time) {
if (time > k) return 0;
vis[nd] = true;
int ans = 0;
for (auto it : adjList[nd]) {
if (it.ff == 1 and time + it.ss == k) ans++;
else if (!vis[it.ff]) ans += backtrack(it.ff, time + it.ss);
}
vis[nd] = false;
return ans;
}
void testCase() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int a; cin >> a;
adjList[i].pb({j, a});
}
}
cout << backtrack(1, 0) << endl;
}
/* Work hard .. Calm and proceed */
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cin.tie(nullptr);
int t_c = 1;
// cin >> t_c;
while (t_c--)
testCase();
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int A[n];
map< int,int>P;
int mx=-1;
for(int i=0;i<n;++i){
cin>>A[i];
P[A[i]]++;
mx=max(mx,A[i]);
}
int c=0;
int tot=0;int f=0,g=0;
for(int i=0;i<=(mx+1);++i){
m=min(m,P[i]);
tot+=m;
}
cout<<tot<<endl;
} | // -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 12/19/20 19:28:51
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int h,w; cin>>h>>w;
int minv = 1000;
vector<vector<int>> A(h, vector<int>(w));
for (auto& l:A) for (auto& v:l) {
cin>>v;
minv = min(minv, v);
}
int ans = 0;
for (auto& l:A) for (auto& v:l) {
ans += v-minv;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
struct P {
int id, x, y;
};
int chebyshev(P p1, P p2)
{
return max(abs(p1.x - p2.x), abs(p1.y - p2.y));
}
int main()
{
int n;
cin >> n;
vector<P> v(n);
rep(i,0,n-1)
{
v[i].id = i;
cin >> v[i].x >> v[i].y;
}
vector<P> unsorted = v;
vector<int> ids;
sort(v.begin(), v.end(), [](P p1, P p2) { return p1.x > p2.x; });
ids.push_back(v[0].id);
ids.push_back(v[1].id);
ids.push_back(v[n-2].id);
ids.push_back(v[n-1].id);
sort(v.begin(), v.end(), [](P p1, P p2) { return p1.y > p2.y; });
ids.push_back(v[0].id);
ids.push_back(v[1].id);
ids.push_back(v[n-2].id);
ids.push_back(v[n-1].id);
sort(ids.begin(), ids.end());
auto last = unique(ids.begin(), ids.end());
ids.erase(last, ids.end());
vector<int> ans;
for (size_t i = 0; i < ids.size(); ++i)
for (size_t j = i + 1; j < ids.size(); ++j)
ans.push_back(chebyshev(unsorted[ids[i]], unsorted[ids[j]]));
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[1] << endl;
return 0;
}
| #include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<string>
#include<unordered_map>
using namespace std;
using ll = long long;
constexpr int N = 2e5 + 5;
struct Point {
int x;
int y;
int id;
}p[N];
bool cmpx(Point a, Point b) {
return a.x < b.x;
}
bool cmpy(Point a, Point b) {
return a.y < b.y;
}
pair<int, int> pa[N];
priority_queue<int> q;
set<pair<int, int> > st;
int main() {
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
scanf("%d%d", &p[i].x, &p[i].y);
pa[i] = {p[i].x, p[i].y};
p[i].id = i;
}
sort(p + 1, p + 1 + n, cmpx);
for(int i = 1; i <= 2; ++i) {
for(int t = n - 1; t <= n; ++t) {
int a = p[i].id;
int b = p[t].id;
if(a > b) swap(a, b);
st.insert({a, b});
}
}
sort(p + 1, p + 1 + n, cmpy);
for(int i = 1; i <= 2; ++i) {
for(int t = n - 1; t <= n; ++t) {
int a = p[i].id;
int b = p[t].id;
if(a > b) swap(a, b);
st.insert({a, b});
}
}
for(auto &tt : st) {
int a = tt.first;
int b = tt.second;
q.push(max(abs(pa[a].first - pa[b].first), abs(pa[a].second - pa[b].second)));
}
q.pop();
printf("%d", q.top());
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, x) for(ll i = 0; i < x; i++)
#define rep2(i, x) for(ll i = 1; i <= x; i++)
#define rep3(i, x, y) for(ll i = x; i < y; i++)
#define rep4(i, x) for(ll i = x; i >= 0; i--)
#define all(a) (a).begin(),(a).end()
#define puts(x) cout << (x) << "\n"
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1000000000000000000;
const int intINF = 1000000000;
const ll mod = 1000000007;
const ll MOD = 998244353;
const ld pi = 3.141592653589793238;
//const ld EPS = 1e-9;
bool isprime(int p) {
if (p == 1) return false;
for (int i = 2; i < p; i++) {
if (p % i == 0) return false;
}
return true;
}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (a % b == 0)return b;
return gcd(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
//main関数内に extGCD(a, b, x, y); でx, yに解が格納
ll extGCD(ll a, ll b, ll& x, ll& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll keta(ll n) {
ll res = 0;
while (n >= 1) {
res += n % 10; n /= 10;
}
return res;
}
ll modpow(ll x, ll y) {
ll res = 1;
while (y) {
if (y % 2) { res *= x; res %= mod; }
x = x * x % mod; y /= 2;
}
return res;
}
ll nCk(ll n, ll k) {
ll a = 1, b = 1;
for (int h = n - k + 1; h <= n; h++) { a *= h; a %= mod; }
for (int h = 1; h <= k; h++) { b *= h; b %= mod; }
return a * modpow(b, mod - 2) % mod;
}
//printf("%.10f\n", n);
typedef pair <ll, ll> P;
typedef pair <ld, ll> pp;
ll dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
struct edge { ll to, cost; };
struct status {
ll ima;
ll cost;
bool operator<(const status& rhs) const { return cost < rhs.cost; };
bool operator>(const status& rhs) const { return cost > rhs.cost; };
};
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//cout << fixed << setprecision(15);
//input
ll n; cin >> n;
vector<ll> v(2 * n); vector<P> card(2 * n);
rep(i, 2 * n) {
cin >> v[i]; ll ba = 0;
if (i < n) { ba = n - i; }
else { ba = i - n + 1; }
card[i] = P(v[i], ba);
}
sort(all(card)); reverse(all(card));
set<ll> s;
rep(i, n + 1) {
s.insert(i);
}
vector<bool> use(2 * n, false);
ll ans = 0;
rep(i, 2 * n) {
ll ba = card[i].second;
if (!use[ba]) { use[ba] = true; s.erase(ba); ans += card[i].first; }
else {
auto itr = s.lower_bound(ba); itr--;
if (*itr != 0) {
use[*itr] = true; s.erase(*itr); ans += card[i].first;
}
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i=0; i<(n); i++)
#define ALL(n) n.begin(), n.end()
int main(){
int N; cin >> N;
if(N % 100 == 0) cout << N / 100;
else cout << N / 100 + 1;
cout << endl;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N);
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
}
int ans = 0;
for (int i = 0; i < N; i++) for(int j = i + 1; j < N; j++) {
double slope = (double) (y[j] - y[i]) / (x[j] - x[i]);
if (slope >= -1 && slope <= 1) {
ans += 1;
}
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define ff first
#define ss second
#define pb push_back
#define mod 1000000007
#define pl pair<lli,lli>
#define vl vector<lli>
#define vvl vector<vl>
#define INF (lli)2e18
lli slope(lli x1,lli y1,lli x2,lli y2){
auto l = (y2-y1)*(y2-y1);
auto r = (x2-x1)*(x2-x1);
if(l<=r)return 1;
else return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n;cin>>n;
vvl val;val.resize(n);
for(lli i=0;i<n;i++){
lli a,b;cin>>a>>b;
val[i].pb(a);val[i].pb(b);
}
lli ans=0;
for(lli i=0;i<n;i++){
for(lli j=i+1;j<n;j++){
if(slope(val[i][0],val[i][1],val[j][0],val[j][1]))ans++;
}
}
cout<<ans;
return 0;
}
|
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector <int> vi;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
constexpr ll nax = 1699, INF = 2e9+6969;
int n,m,ans,dp[nax][nax],A[nax],B[nax];
int main()
{
ans = INF;
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]);
for(int i=1;i<=n;++i) dp[i][0] = i;
for(int i=1;i<=m;++i) dp[0][i] = i;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + 1;
dp[i][j] = min(dp[i][j], dp[i-1][j-1]+1);
if(A[i] == B[j]) dp[i][j] = min(dp[i][j], dp[i-1][j-1]);
}
}
// for(int i=1;i<=n;++i)
// {
// for(int j=1;j<=m;j++) printf("%d ", dp[i][j]);
// puts("");
// }
for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) ans = min(ans, dp[i][j] + n-i + m-j);
printf("%d\n", ans);
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
class Solution{
private:
int N, M;
public:
int solve(int N, int M, vector<int>& A, vector<int>& B){
this->N = N, this->M = M;
vector<vector<int>> dp(N, vector<int>(M, -1));
return dfs(A, B, 0, 0, dp);
}
private:
int dfs(const vector<int>& A, const vector<int>& B, int ai, int bi,
vector<vector<int>>& dp){
if(ai == A.size()) return B.size() - bi;
if(bi == B.size()) return A.size() - ai;
if(dp[ai][bi] != -1) return dp[ai][bi];
int res = 1 + min(dfs(A, B, ai + 1, bi, dp), dfs(A, B, ai, bi + 1, dp));
res = min(res, (A[ai] != B[bi]) + dfs(A, B, ai + 1, bi + 1, dp));
return dp[ai][bi] = res;
}
};
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for(int i = 0; i < N; i ++) cin >> A[i];
for(int i = 0; i < M; i ++) cin >> B[i];
cout << Solution().solve(N, M, A, B) << endl;
return 0;
}
|
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
long long powm(long long a, long long b,long long mod) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a %mod;
a = a * a %mod;
b >>= 1;
}
return res;
}
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int pre[100005];
int ans[100005];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",stdout);
}
#endif
int n,q;
cin>>n>>q;
int a[n+2];
a[0]=0;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a,a+n+1);
for(int i=1;i<=n;i++)
{
pre[i]=pre[i-1]+a[i]-a[i-1]-1;
}
pre[n+1]=1e18+pre[n];
vector<pair<int,int>>qq;
int x;
for(int i=0;i<q;i++)
{
cin>>x;
qq.push_back({x,i});
}
sort(qq.begin(),qq.end());
// cout<<pre[2]<<endl;
for(auto i:qq)
{
int l=1,r=n+1;
int mn=n+1;
while(l<=r)
{
int mid=l+(r-l)/2;
if(pre[mid]>=i.first)
{
r=mid-1;
mn=min(mn,mid);
}
else
{
l=mid+1;
}
}
ans[i.second]=a[mn-1]+(i.first-pre[mn-1]);
}
for(int i=0;i<q;i++)
cout<<ans[i]<<'\n';
} | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ALL(v) (v).begin(), v.end()
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = LLONG_MAX;
const int MAX = 510000;
bool graph[nmax][nmax];
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;
}
}
ll COM(int n, int k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n)
{
for (size_t i = 0; i < n; i++)
{
for (size_t j = 0; j < n; j++)
{
for (size_t k = 0; k < n; k++)
{
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b)
{
return (((a % MOD) * (b % MOD)) % MOD);
}
ll powMod(ll a, ll p)
{
if (p == 0)
{
return 1;
}
else if (p % 2 == 0)
{
ll half = powMod(a, p / 2);
return mulMod(half, half);
}
else
{
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b)
{
return (a + b - 1) / b;
}
void solve(long long N, long long K)
{
ll ans = 0;
for (int i = 2; i <= 2 * N; i++)
{
ll ab = i + K;
if (ab < 2 || ab > 2 * N)
continue;
ll tmp = 0;
if (ab >= N + 1)
{
tmp = N - (ab - N) + 1;
}
else
{
tmp = ab - 1;
}
if (i >= N + 1)
{
tmp *= N - (i - N) + 1;
}
else
{
tmp *= i - 1;
}
ans += tmp;
}
cout << ans << endl;
}
int main()
{
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
solve(N, K);
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<int> g[200005];
vector<P> p[200005];
int ans[200005];
map<int,int> f(int u=0,int d=0){
// cout << u << endl;
map<int,int> s;
for(int v:g[u]){
auto t = f(v,d+1);
if(t.size()>s.size()) swap(s,t);
for(auto i:t) s[i.first] += i.second;
}
s[d]++;
for(auto i:p[u]) ans[i.first] = s[i.second];
return s;
}
int main() {
int n;
cin >> n;
rep(i,n-1){
int p;
cin >> p;
g[p-1].push_back(i+1);
}
int q;
cin >> q;
rep(i,q){
int u,d;
cin >> u >> d;
p[u-1].emplace_back(i,d);
}
f();
rep(i,q) printf("%d\n",ans[i]);
}
| #include<iostream>
#include<bits/stdc++.h>
#define int long long int
#define vi vector<int>
#define fo(i,n) for(int i=1;i<=n;i++)
#define foo(i,n) for(int i=0;i<n;i++)
#define sort(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define uniq(v) sort(v); v.resize(unique(v.begin(), v.end())-v.begin());
#define ff first
#define ss second
#define pb push_back
#define pii pair<int,int>
#define ok ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define vp vector<pair<int,int>>
#define mod 1000000007
const int huge = 1e17;
int max(int a,int b){ if(a>b) return a; return b; }
int min(int a,int b){ if(a<b) return a; return b; }
int abbs(int a,int b){ if(a-b < 0) return b-a; return a-b; }
int lowerB(vi &v, int val){
int ind=v.size(),l=0,r=v.size(),mid;while(l<=r){mid=(l+r)/2;if(v[mid]>=val){ind=mid;r=mid-1;}else l=mid+1;}return ind;
}
vi adj[200005];
vi in(200005);
vi out(200005);
vi d[200005];
int timer;
void dfs(int node = 1, int dep = 0) {
in[node] = timer++;
d[dep].pb(in[node]);
for(int x: adj[node]) dfs(x, dep+1);
out[node] = timer++;
}
void solve(){
int n; cin>>n;
fo(i,n-1) {
int x; cin>>x;
adj[x].pb(i+1);
}
dfs();
int q; cin>>q;
while(q--) {
int u, dd;
cin>>u>>dd;
int l = in[u], r = out[u];
int ans = lower_bound(d[dd].begin(), d[dd].end(), l) - lower_bound(d[dd].begin(), d[dd].end(), r+1);
cout<<ans*-1<<"\n";
}
// how many nodes are child of v at depth of d
}
signed main(){
ok
int t;
t = 1;
// cin>>t;
while(t--){
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define all(m) m.begin(),m.end()
#define sz(m) lld(m.size())
#define pb push_back
#define mod 1000000007
#define st first
#define nd second
#define endl "\n"
void swagWaalaFunction()
{
lld a,b,c,ans=0;
cin>>a>>b>>c;
ans=21-a-b-c;
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
lld tc=1;
//cin>>tc;
for(int i=0;i<tc;i++)
{
// cout<<"Case #"<<i+1<<": ";
swagWaalaFunction();
}
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>
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())
void solve()
{
int a,b,c;
cin>>a>>b>>c;
cout<<21-(a+b+c);
}
int main()
{
solve();
} |
#include <bits/stdc++.h>
using namespace std;
const int MN = 200012;
int n, q;
int c[MN];
int id[MN];
set<int> st[MN];
map<int, int> ctr[MN];
int main (void) {
ios::sync_with_stdio(false);cin.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> c[i];
id[i] = i;
st[i].insert(i);
ctr[i][c[i]] = 1;
}
while (q--) {
int op, x, y;
cin >> op >> x >> y;
if (op == 1) {
if (id[x] == id[y]) continue;
set<int>& sa = st[id[x]];
set<int>& sb = st[id[y]];
map<int, int>& ma = ctr[id[x]];
map<int, int>& mb = ctr[id[y]];
if (sa.size() < sb.size()) {
for (int s : sa) {
id[s] = id[y];
sb.insert(s);
mb[c[s]]++;
}
sa.clear();
ma.clear();
} else {
for (int s : sb) {
id[s] = id[x];
sa.insert(s);
ma[c[s]]++;
}
sb.clear();
mb.clear();
}
} else {
cout << ctr[id[x]][y] << '\n';
}
}
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
#include <array>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <memory>
#include <random>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;
template<typename Key, typename Cnt=int>
struct hashmultiset{
float load_factor = 0.8;
int table_size = 16;
int mod = 15;
const Key null_key;
uint32_t mask;
Cnt valid_size;
int valid_type;
vector<int> idx_table;
vector<pair<Key, Cnt>> data;
function<uint32_t(Key)> f = std::hash<uint32_t>();
void expand_table(){
table_size *= 2;
mod = table_size - 1;
idx_table.resize(table_size);
fill(idx_table.begin(), idx_table.end(), -1);
for(int i=0;i<data.size();i++){
if(data[i].first==null_key) continue;
inner_insert(i);
}
}
void inner_insert(int idx){
uint32_t h = f(data[idx].first^mask) & mod;
while(true){
if(idx_table[h]==-1){
idx_table[h] = idx;
return;
}
h = (h + 1) & mod;
}
}
public:
hashmultiset():
null_key(std::numeric_limits<Key>::max()),mask(random_device()()),
valid_size(0), valid_type(0), idx_table(table_size, -1){}
//データの数の総和
Cnt size(){
return valid_size;
}
//データの種類数
int type(){
return valid_type;
}
//kをx個数入れる
void insert(Key k, Cnt x=1){
assert(k!=null_key);
uint32_t h = f(k^mask) & mod;
while(true){
int idx = idx_table[h];
if(idx!=-1){
if(data[idx].first==k){
data[idx].second += x;
valid_size += x;
return;
}
h = (h + 1) & mod;
}else{
data.push_back({k, x});
idx_table[h] = int(data.size()) - 1;
valid_size += x;
valid_type++;
if(float(data.size())>load_factor*float(table_size)){
expand_table();
}
return;
}
}
}
//kを最大x個消す(0未満にはならない。inf個消すこととstd::multisetのeraseは同じ挙動)
void erase(Key k, Cnt x=std::numeric_limits<Cnt>::max()){
assert(k!=null_key);
uint32_t h = f(k^mask) & mod;
while(true){
int idx = idx_table[h];
if(idx==-1) return;
if(data[idx].first==k){
if(data[idx].second > x) {
data[idx].second -= x;
valid_size -= x;
}else {
data[idx].first = null_key;
valid_size -= data[idx].second;
valid_type--;
}
return;
}
h = (h + 1) & mod;
}
}
//kの個数
int count(Key k){
assert(k!=null_key);
uint32_t h = f(k^mask) & mod;
while(true){
int idx = idx_table[h];
if(idx==-1) return 0;
if(data[idx].first==k) return data[idx].second;
h = (h + 1) & mod;
}
}
};
vector<int> par(200001);
int find(int x){
if(par[x]==x) return x;
return par[x] = find(par[x]);
}
int main(){
int n, q;scanf("%d %d", &n, &q);
for(int i=0;i<n;i++) par[i] = i;
vector<hashmultiset<int>> hs(n);
for(int i=0;i<n;i++){
int c;scanf("%d", &c);
hs[i].insert(c, 1);
}
for(int i=0;i<q;i++){
int a, b, c;scanf("%d %d %d", &a, &b, &c);
if(a==1){
b = find(b-1);
c = find(c-1);
if(b==c) continue;
if(hs[b].type()>hs[c].type()) swap(b, c);
//b to c
for(auto e:hs[b].data){
if(e.first==hs[b].null_key) continue;
hs[c].insert(e.first, e.second);
}
par[b] = c;
}else{
b = find(b-1);
printf("%d\n", hs[b].count(c));
}
}
}
|
#include<bits/stdc++.h>
#define ll long long
#define nl "\n"
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define pcase printf("Case %d: ",ca)
int ca=1;
using namespace std;
int main(){
fast;
{
string n;
cin>>n;
string x="";
string y;
int s = n.size();
int ans = 1;
int i = 0, j = s-1, f = 0, l = 0;
while(n[i]=='0'){
i++;
f++;
if(i>s){
break;
}
}
while(n[j]=='0' && j>=0){
j--;
l++;
if(j==0){
break;
}
}
for(int b = i;b<=j;b++){
x+=n[b];
}
y = x;
reverse(y.begin(),y.end());
if(x==y && l>=f){
cout<<"Yes"<<nl;
}else{
cout<<"No"<<nl;
}
}
}
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
long long int N;
int main(void) {
cin >> N;
if (N == 0) { cout << "Yes" << endl; return 0; }
while (N % 10 == 0) { N /= 10; }
vector<int> V;
long long int K = N;
while (K > 0) { V.push_back(K % 10); K /= 10; }
vector<int> W;
for (int i = (int)V.size() - 1; i >= 0;i--) { W.push_back(V[i]); }
//for (auto y : V) { cout << " " << y; }cout << endl;
//for (auto y : W) { cout << " " << y; }cout << endl;
if (V == W) { cout << "Yes" << endl; }
else { cout << "No" << endl; }
return 0;
}
|
#line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
std::cout << v[i];
if (i != size - 1)
std::cout << " ";
}
return out;
}
template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
for (auto &el : v) {
std::cin >> el;
}
return in;
}
#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<
using namespace std;
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
}
#line 2 "main.cpp"
std::string solve(long long N, string S, std::string X) {
vector<vector<bool>> dp(N + 1, vector<bool>(7, false));
dp[N][0] = true;
for (int i = N - 1; i >= 0; i--) {
REP(j, 7) {
int m = 10 * j + (S[i] - '0'); // S[i]を選ぶ
m %= 7;
int m0 = 10 * j; // 0を選ぶ
m0 %= 7;
if (X[i] == 'T') {
if (dp[i + 1][m0] || dp[i + 1][m]) {
dp[i][j] = true;
} else {
dp[i][j] = false;
}
} else {
// どっちに転んでも高橋君が勝つ場合
if (dp[i + 1][m0] && dp[i + 1][m]) {
dp[i][j] = true;
} else {
dp[i][j] = false;
}
}
}
}
if (dp[0][0]) {
return "Takahashi";
} else {
return "Aoki";
}
}
// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
int N;
string S, X;
cin >> N;
cin >> S >> X;
auto ans = solve(N, S, X);
cout << ans << endl;
}
| #include<bits/stdc++.h>
#define M 200005
typedef long long ll;
using namespace std;
char IO;
int rd(){
int num=0;
while(IO=getchar(),IO<48||IO>57);
do num=(num<<1)+(num<<3)+(IO^48);
while(IO=getchar(),IO>=48&&IO<=57);
return num;
}
int n;
int dp[M][7];
char S[M],T[M];
bool dfs(int x,int rst){
if(x==n+1)return rst==0;
if(~dp[x][rst])return dp[x][rst];
if(T[x]=='A')return dp[x][rst]=dfs(x+1,rst*10%7)&dfs(x+1,(rst*10+S[x]-'0')%7);
else return dp[x][rst]=dfs(x+1,rst*10%7)|dfs(x+1,(rst*10+S[x]-'0')%7);
}
int main(){
scanf("%d%s%s",&n,S+1,T+1);
memset(dp,-1,sizeof(dp));
if(dfs(1,0))cout<<"Takahashi";
else cout<<"Aoki";
return 0;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Erep(i,n) for(int i = 0; i <= (n); ++i)
#define repS(i,s,n) for(int i = s; i < (n); ++i)
#define ErepS(i,s,n) for(int i = s; i <= (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) printf("%lld %s", a, "\n")
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<string> vst;
typedef vector<double> vd;
const ll INF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll n;
vd a, b, c, d;
void input(){
cin >> n;
a = vd(n);
b = vd(n);
c = vd(n);
d = vd(n);
rep(i, n) cin >> a[i] >> b[i];
rep(i, n) cin >> c[i] >> d[i];
}
void solve(){
string ans = "No";
vd x(n), y(n);
for(int k = 0; k < 360; k++){
rep(i, n){
double tx = a[i], ty = b[i];
x[i] = tx * cos((k * PI ) / 180) - ty * sin((k * PI ) / 180);
y[i] = tx * sin((k * PI ) / 180) + ty * cos((k * PI ) / 180);
}
double ave_s_x = 0, ave_s_y = 0, ave_t_x = 0, ave_t_y = 0;
rep(i, n){
ave_s_x += x[i];
ave_s_y += y[i];
ave_t_x += c[i];
ave_t_y += d[i];
}
double diff_x = (ave_t_x - ave_s_x) / n;
double diff_y = (ave_t_y - ave_s_y) / n;
ll check = 1;
rep(i, n){
ll count = 0;
rep(j, n){
double ex = x[i] + diff_x, ey = y[i] + diff_y;
//if(k == 90)
//cout << ex << " " << c[j] << " " << ey << " " << d[j] << "\n";
if(abs(ex - c[j]) <= (double) 0.05 && abs(ey - d[j]) <= (double) 0.05){
//cout << k << endl;
//cout << x[i] << " " << c[j] << " " << y[i] << " " << d[j] << "\n";
count++;
}
}
if(count == 0){
check = 0;
}
}
if(check){
ans = "Yes";
break;
}
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
input();
solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 400010, mod = 1e9 + 7;
int e[N], ne[N], h[N], idx, w[N][61], n;
ll tar, d[N][2], res;
void add(int a, int b, long long c) {
e[idx] = b, ne[idx] = h[a];
for (int i = 0; i < 60; ++i) {
if (c & 1) w[idx][i] = 1;
c /= 2;
if (!c) break;
}
h[a] = idx++;
}
void go(int x, int fa) {
d[x][0] = d[x][1] = 0;
for (int i = h[x]; i != -1; i = ne[i]) {
if (fa == e[i]) continue;
go(e[i], x);
if (w[i][tar]) {
d[x][0] += d[e[i]][1];
d[x][1] += d[e[i]][0] + 1;
} else {
d[x][0] += d[e[i]][0] + 1;
d[x][1] += d[e[i]][1];
}
}
res += d[x][1];
ll t = 0;
for (int i = h[x]; i != -1; i = ne[i]) {
if (fa == e[i]) continue;
if (w[i][tar]) {
res += (d[e[i]][0] + 1) * (d[x][0] - d[e[i]][1]);
} else {
res += d[e[i]][1] * (d[x][0] - d[e[i]][0] - 1);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
memset(h, -1, sizeof h);
for (int i = 1; i < n; ++i) {
int a, b;
ll w;
cin >> a >> b >> w;
add(a, b, w);
add(b, a, w);
}
ll ans = 0;
for (int i = 0; i < 60; ++i) {
tar = i;
res = 0;
go(1, -1);
ans = (ans + res % mod * ((1ll << i) % mod) % mod) % mod;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
#define print_tc(t, c) cout << "Case #" << t << ": " << c << "\n";
const long long int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};
const long long int cons = 100005, ncr_cons = 100005;
const long long int MOD = 1000000007; // const long long int MOD = 998244353;
const long long int const_INT_MAX = 1000000000000000000, const_INT_MIN = -1 * 1000000000000000000;
using namespace std;
bool sortinrev(const pair<ll,ll> &a, const pair<ll,ll> &b){return (a.first > b.first);}
bool sortbysec(const pair<ll,ll> &a, const pair<ll,ll> &b){return (a.second < b.second);}
bool sortbysecinrev(const pair<ll,ll> &a, const pair<ll,ll> &b){return (a.second > b.second);}
ll gcd(ll x, ll y){return (ll)(__gcd(x, y));}
ll lcm(ll x, ll y){return (ll)((x * y) / gcd(x, y));}
ll mod_expo(ll x, ll y, ll p){
if((x + p) % p == 0) return 0;
ll res = 1; x = (x + p) % p;
while (y > 0){
if(y & 1) res = (res*x + p) % p;
y = y>>1; x = (x*x + p) % p;
}
return res;
}
void usaco(string str = ""){
fastio;
if(str.size()){
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
int main(){
usaco();
ll n, k; cin >> n >> k;
ll a[n+1][n+1]; for(ll i=1;i<=n;i++) for(ll j=1;j<=n;j++) cin >> a[i][j];
ll l=0, r=1e9, ans = const_INT_MAX;
for(ll itr=0;itr<=150;itr++){
ll mid = l + (r - l) / 2; ll count[n+1][n+1]; memset(count, 0, sizeof(count));
for(ll i=1;i<=n;i++) for(ll j=1;j<=n;j++) if(a[i][j] <= mid) count[i][j] = 1;
for(ll i=1;i<=n;i++) for(ll j=1;j<=n;j++) count[i][j] = count[i][j] + count[i-1][j] + count[i][j-1] - count[i-1][j-1];
// ll f=0; for(ll i=k;i<=n;i++) for(ll j=k;j<=n;j++) if(count[i][j] + count[i-k][j-k] - count[i-k][j] - count[i][j-k] >= k*k) f=1;
ll f=0; for(ll i=k;i<=n;i++) for(ll j=k;j<=n;j++) if(2*count[i][j] + 2*count[i-k][j-k] - 2*count[i-k][j] - 2*count[i][j-k] >= k*k) f=1;
if(f){
ans = min(ans, mid); r = mid - 1;
}
else l = mid + 1;
}
cout << ans << "\n";
// cout << (ans + 1) / 2 << "\n";
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
| #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 800; int n, k;
vector<int> as;
int medianPos;
int a[maxN][maxN];
int b[maxN][maxN];
int acc[maxN + 1][maxN + 1];
int getSum(int loi, int loj, int hii, int hij)
{
return acc[hii + 1][hij + 1] - acc[loi][hij + 1] - acc[hii + 1][loj] + acc[loi][loj];
}
bool can(lli x)
{
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
b[i][j] = a[i][j] <= x;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
acc[i + 1][j + 1] = acc[i][j + 1] + acc[i + 1][j] - acc[i][j] + b[i][j];
for (int i = 0; i + k - 1 < n; i++)
for (int j = 0; j + k - 1 < n; j++)
if (getSum(i, j, i + k - 1, j + k - 1) >= medianPos)
return true;
return false;
}
int main()
{
while (~scanf("%d %d", &n, &k))
{
medianPos = ((k * k + 1) >> 1) + 0;
as.clear();
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
scanf("%d", &a[i][j]);
as.push_back(a[i][j]);
}
sort(as.begin(), as.end());
as.resize(distance(as.begin(), unique(as.begin(), as.end())));
int lo = 0, hi = as.size() - 1;
while (lo < hi)
{
lli mid = (lo + hi) >> 1;
if (can(as[mid])) hi = mid;
else lo = mid + 1;
}
printf("%d\n", as[lo]);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<vector<int>> G(N);
for (int i = 1; i < N; i++) {
int p;
cin >> p;
p--;
G[i].emplace_back(p);
G[p].emplace_back(i);
}
vector<int> in(N), out(N);
vector<vector<int>> dist(N);
int timer = 0;
function<void(int, int, int)> dfs = [&](int u, int p, int d) {
in[u] = timer++;
dist[d].emplace_back(in[u]);
for (int v : G[u]) {
if (v == p) continue;
dfs(v, u, d + 1);
}
out[u] = timer++;
};
dfs(0, 0, 0);
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int u, d;
cin >> u >> d;
u--;
const auto& v = dist[d];
cout << lower_bound(v.cbegin(), v.cend(), out[u]) - lower_bound(v.cbegin(), v.cend(), in[u])
<< '\n';
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
const ll MOD=1e9+7;
const ll INF=1e17;
//#######################################################################
vector<vector<ll>> input(ll N, ll width){
string str;
vector<vector<ll>> vec(N,vector<ll>(width));
for(ll i=0;i<N;++i){
cin>>str;
reverse(ALL(str));
for(ll j=0;j<width;++j){
vec[i][j]=str.back();
str.pop_back();
}
}
return vec;
}
void op(vector<ll> vec){
ll size=(ll)vec.size();
for(ll i=0;i<size-1;++i) cout<<vec[i]<<" ";
cout<<vec.back()<<endl;
}
void op(vector<vector<ll>> vec){
ll height=(ll)vec.size();
ll width=(ll)vec[0].size();
for(ll i=0;i<height;++i) {
for(ll j=0;j<width-1;++j) cout<<vec[i][j]<<" ";
cout<<vec[i].back()<<endl;
}
}
//########################################################################
int solve(){
ll N,K;
cin>>N>>K;
ll sum=0;
rep(i,1,N+1) rep(j,1,K+1) sum+=i*100+j;
cout<<sum<<endl;
return 0;
}
int main(void){
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
solve();
}
|
// Author : Sarthak Kapoor
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int ll
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define ll long long
#define pi pair<int,int>
#define pii pair<pi,int>
#define vi vector<int>
#define pb push_back
#define fi first
#define sec second
#define all(v) v.begin(),v.end()
#define s(v) v.size()
ll mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());//use rng()%n for numbers in range [0,n-1]
ll gcd(ll a,ll b){
if(b==0)return a;
return gcd(b,a%b);
}
ll fastexp(ll x,ll a){
ll res = 1;
while(a>0){
if(a&1){
res = (res*x)%mod;
}
a=a>>1;
x=(x*x)%mod;
}
return res;
}
ll inverse(ll n){
return fastexp(n,mod-2);
}
template <typename T>
void add(T &a, T b){
a += b;
if(a >= mod)a -= mod;
}
template <typename T>
void sub(T &a, T b){
a -= b;
if(a < 0)a += mod;
}
template <typename T>
void mul(T &a, T b){
a *= b;
if(a >= mod)a %= mod;
}
const int maxn = 1e6 + 10;
int mu[maxn],lpf[maxn];
void lpf1(){
repa(i,2,maxn){
if(!lpf[i]){
for(int j = i;j < maxn;j+=i){
if(!lpf[j])lpf[j] = i;
}
}
}
}
void sieve(){
lpf1();
mu[1] = 1;
repa(i,2,maxn){
if(lpf[i / lpf[i]] == lpf[i]){
mu[i] = 0;
}
else{
mu[i] = -1*(mu[i/lpf[i]]);
}
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int l,r;
cin>>l>>r;
int ans = 0;
for(int i = max(l,2ll);i <= r;i++){
for(int j = i+i;j <= r;j += i){
ans -= 2;
}
}
sieve();
repa(i,2,r+1){
// int x1 = l/i;
// if(l%i != 0)x1++;
// int x2 = r/i;
int d = (r/i)-((l-1)/i);
// cout<<i<<d<<endl;
// if(d < 2)break;
ans -= mu[i]*(d*(d-1));
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//左に行きたい各それについて、自分の左でa[i]-iが一致しているやつを見つけて飛び込む
//a[i]-iが一致しているやつの中で最大のものを見つけたらそこまでギュッとする
#define int long long
template<typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
const int INF=1e9+7;
int ans;
typedef pair<int,int> P;
signed main(){
int n,l;cin>>n>>l;
vector<int> a(n);
vector<int> b(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
set<int> III,JJJ;
{
set<P> s;//(a[i]-i,i)
s.insert(P(1,-1));
for(int i=0;i<n;i++){
if(a[i]<b[i])continue;
s.insert(P(a[i]-i,i));III.insert(i);
}//nowまでは左に行きたい
int L=INF;//Lまでは左に押し付けられてる
for(int i=n-1;i>=0;i--){
if(!III.count(i))continue;
int k=b[i]-i;//cout<<i<<" "<<k<<endl;
s.erase(P(a[i]-i,i));
if(i>L&&((L==-1&&b[i]==i+1)||(~L&&b[i]==a[L]+i-L)))continue;
if(a[i]==b[i])continue;
P p=*--s.lower_bound(P(k,INF));
int va=p.first,idx=p.second;
if(va!=k)fin(-1);
ans+=i-idx;//cout<<i-idx<<endl;
L=idx;
}
}
//cout<<"A"<<ans<<endl;
for(int i=0;i<n;i++)a[i]*=-1;
for(int i=0;i<n;i++)b[i]*=-1;
sort(a.begin(),a.end());
sort(b.begin(),b.end());
{
set<P> s;//(a[i]-i,i)
s.insert(P(-l,-1));
for(int i=0;i<n;i++){
if(a[i]<b[i])continue;
s.insert(P(a[i]-i,i));JJJ.insert(i);
}//nowまでは左に行きたい
int L=INF;//Lまでは左に押し付けられてる
for(int i=n-1;i>=0;i--){
if(!JJJ.count(i))continue;
int k=b[i]-i;//cout<<i<<" "<<k<<endl;
s.erase(P(a[i]-i,i));
if(i>L&&((L==-1&&b[i]==-l-1+i+1)||(~L&&b[i]==a[L]+i-L)))continue;//cout<<b[i]<<" "<<i<<" "<<L<<" "<<a[L]+i-L<<endl;
if(a[i]==b[i])continue;
P p=*--s.lower_bound(P(k,INF));
int va=p.first,idx=p.second;
if(va!=k)fin(-1);
ans+=i-idx;
L=idx;
//cout<<i-idx<<endl;
}
}
for(int p:JJJ)III.insert(n-1-p);
if(III.size()<n)fin(-1);
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const ll mod = 1e9+7;
int sum(int a, int b){return (a+b) % mod;}
int sub(int a, int b){return (a + mod - b) % mod;}
int mul(int a, int b){return (1ll * a * b) % mod;}
int power(int a,int b){
int res = 1;
while(b){
if(b&1)res = mul(res,a);
b >>= 1;
a = mul(a,a);
}
return res;
}
const ll oo = (ll)1e18;
void dijkstra(int src,vector<ll> &dist,vector<vii> &graph){
priority_queue<ii,vector<ii>,greater<ii>> pq;
pq.push({0,src});
dist[src] = 0;
while(pq.size()){
ii act = pq.top(); pq.pop();
ll d = act.fi;
int u = act.se;
if(d > dist[u])continue;
for(auto &sig : graph[u]){
int v = sig.fi;
ll c = sig.se;
if(dist[u]+c < dist[v]){
dist[v] = dist[u]+c;
pq.push({dist[v],v});
}
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int N,M; cin >> N >> M;
vector<pair<int,ii>> edges;
forn(i,0,M){
int u,v,c; cin >> u >> v >> c; u--; v--;
edges.pb({c,{u,v}});
}
forn(i,0,N){
vector<vii> graph(N+1);
for(auto &act : edges){
int c = act.fi;
int u = act.se.fi;
int v = act.se.se;
graph[u].pb({v,c});
if(v == i){
graph[u].pb({N,c});
}
}
vector<ll> dist(N+1,oo);
dijkstra(i,dist,graph);
if(dist[N] == oo){
cout << "-1\n";
continue;
}
cout << dist[N] << '\n';
}
return 0;
}
/*
__builtin_mul_overflow(x,y,&x)
-fsplit-stack
*/
| #include<bits/stdc++.h>
#define f first
#define int long long
#define s second
#define pii pair<int,int>
using namespace std;
const int N=2e5+5,mod=1e9+7,INF=1e15;
int t,n,m,u,v,dist[N];
vector<pii>V[N];
priority_queue<pii,vector<pii>,greater<pii> > q;
string s;
main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>u>>v>>t;
V[u].push_back({v,t});
}
for(int i=1;i<=n;i++){
q.push({0,i});
for(int j=1;j<=n;j++)
dist[j]=INF;
while(q.size()){
int d=q.top().f;
int u=q.top().s;
q.pop();
if(d>dist[u]) continue;
for(int j=0;j<V[u].size();j++){
if(dist[V[u][j].f]>d+V[u][j].s){
dist[V[u][j].f]=d+V[u][j].s;
q.push({dist[V[u][j].f],V[u][j].f});
}
}
}
if(dist[i]==INF) cout<<-1<<endl;
else cout<<dist[i]<<endl;
}
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
void solve()
{
ll n, i;
ll x;
cin>>n>>x;
ll v[n+9], p[n+9];
for(i=0; i<n; i++)
{
cin>>v[i]>>p[i];
}
ll in=0;
ll ans=-1;
x=x*100;
for(i=0; i<n; i++)
{
in+=v[i]*p[i];
if(in>x)
{
ans=i+1;
break;
}
}
cout<<ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio
ll t=1;
// cin>>t;
while(t--)
{
solve();
}
} | #pragma warning (disable:4996)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#define ll long long
#define REP(i, n) for(int i = 0; i < n; i++)
#define SET(a) int a = 0; (void)scanf("%d", &a);
#define NMAX 1000
typedef struct { int V; int P; }ALCOHOL;
int main() {
SET(N); SET(X);
ALCOHOL alcohol;
int sum = 0;
int ans = -1;
REP(i, N) {
(void)scanf("%d %d", &alcohol.V, &alcohol.P);
sum += (alcohol.V * alcohol.P);
if (sum > 100 * X) {
ans = (i + 1);
break;
}
}
printf("%d", ans);
return 0;
} |
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
double a,b;
cin>>a>>b;
double res=b/a*100;
res=100-res;
cout<<fixed<<setprecision(18)<<res;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
unordered_map<ll,ll> k;//h[y]表示将x变成y需要的步数
ll dfs(ll z)
{
if(z<=x) return x-z;
if(k.count(z)) return k[z];
ll re=z-x;
if(z%2==0) re=min(re,dfs(z/2)+1); //二倍优先
else re=min(re,min(dfs(z+1),dfs(z-1))+1);
return k[z]=re;
}
int main()
{
cin>>x>>y;
//倒着逆推
cout<<dfs(y);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 1e9;
int main() {
long long h, w;
cin >> h >> w;
vector<string> s(h);
for (int i=0; i<h; i++) {
cin >> s.at(i);
}
vector<vector<long long>> dp(h, vector<long long>(w));
dp.at(0).at(0) = 1;
vector<vector<long long>> row(h, vector<long long>(w));
vector<vector<long long>> col(h, vector<long long>(w));
vector<vector<long long>> squ(h, vector<long long>(w));
row.at(0).at(0) = 1;
col.at(0).at(0) = 1;
squ.at(0).at(0) = 1;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
if (s.at(i).at(j) == '#') {
continue;
}
if (i>0&&j>0) {
dp.at(i).at(j) = row.at(i).at(j-1) + col.at(i-1).at(j) + squ.at(i-1).at(j-1);
dp.at(i).at(j) %= MOD;
row.at(i).at(j) = dp.at(i).at(j) + row.at(i).at(j-1);
col.at(i).at(j) = dp.at(i).at(j) + col.at(i-1).at(j);
squ.at(i).at(j) = dp.at(i).at(j) + squ.at(i-1).at(j-1);
} else if (j>0) {
dp.at(i).at(j) = row.at(i).at(j-1);
dp.at(i).at(j) %= MOD;
row.at(i).at(j) = dp.at(i).at(j) + row.at(i).at(j-1);
col.at(i).at(j) = dp.at(i).at(j);
squ.at(i).at(j) = dp.at(i).at(j);
} else if (i>0) {
dp.at(i).at(j) = col.at(i-1).at(j);
dp.at(i).at(j) %= MOD;
col.at(i).at(j) = dp.at(i).at(j) + col.at(i-1).at(j);
row.at(i).at(j) = dp.at(i).at(j);
squ.at(i).at(j) = dp.at(i).at(j);
}
col.at(i).at(j) %= MOD;
row.at(i).at(j) %= MOD;
squ.at(i).at(j) %= MOD;
}
}
cout << dp.at(h-1).at(w-1)%MOD << 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>
#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
#define mod 1000000007
using namespace std;
typedef long long llint;
typedef pair<llint, llint> P;
llint h, w;
llint dp[2005][2005];
llint hsum[2005][2005], wsum[2005][2005], dsum[2005][2005];
char c[2005][2005];
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> h >> w;
rep(y, 1, h) rep(x, 1, w) cin >> c[x][y];
dp[1][1] = hsum[1][1] = wsum[1][1] = dsum[1][1] = 1;
rep(x, 1, w){
rep(y, 1, h){
if(x == 1 && y == 1) continue;
if(c[x][y] == '#'){
dp[x][y] = 0, hsum[x][y] = wsum[x][y] = dsum[x][y] = 0;
continue;
}
dp[x][y] = hsum[x][y-1] + wsum[x-1][y] + dsum[x-1][y-1], dp[x][y] %= mod;;
hsum[x][y] = hsum[x][y-1] + dp[x][y], hsum[x][y] %= mod;
wsum[x][y] = wsum[x-1][y] + dp[x][y], wsum[x][y] %= mod;
dsum[x][y] = dsum[x-1][y-1] + dp[x][y], dsum[x][y] %= mod;
}
}
cout << dp[w][h] << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int c = a+b;
if(c >= 15 && b >= 8) cout << "1" << endl;
else if(c >= 10 && b >= 3) cout << "2" << endl;
else if(c >= 3) cout << "3" << endl;
else cout << "4" << endl;
} | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define f first
#define s second
#define sz(x) (int)x.size()
#define endl "\n"
#define forn(i,n) for(int i=0;i<n;++i)
#define fore(i,l,r) for(int i=int(l);i<=int(r);++i)
#define rep(i,begin,end) for(__typeof(end) i=(begin);i!=(end);i++)
#define fill(a,value) memset(a,value,sizeof(a));
#define gcd(a,b) __gcd((a),(b))
#define watch1(x) cout<<(x)<<endl
#define watch2(x,y) cout<<(x)<<" "<<(y)<<endl
#define watch3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> oset;
const int INF = 9e18;
const int mod = 998244353;
const int N = 1e5 + 5;
int a, b;
void solve() {
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;
}
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int t;
//cin >> t;
t = 1;
while (t--) {
solve();
}
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 FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll,ll>>
#define pll pair<ll,ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout<<setprecision(x)<<fixed;
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
// getline (std::cin,name);
ll MOD=1e9+7;
ll ceil1(ll n,ll x){return (n-1)/x+(n>0);}
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll m ,ll mod=MOD );
ll pow2(ll n,ll k);
ll modinv(ll n,ll mod=MOD){ return pow1(n,mod-2,mod);}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
if(a.ff != b.ff)return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N=(ll)2e5+11;
ll const LG=(ll)log2(N)+1;
// bool cmp(pll &a,pll &b){
// if(a.ff!=b.ff)return a.ff<b.ff;
// }
void solve() {
ll i,j,k,l,n,m,x,y,z,r;
cin>>n;
vllv a(n+11);
for(i=0;i<n;i++){
cin>>x>>y;
a[y].pb(x);
}
vll an(n+11);
a[0].pb(0);
vll last(n+11);
for(i=1;i<=n;i++){
sort(all(a[i]));
ll tt=0;
for(j=1;j<a[i].sz;j++){
tt+=a[i][j]-a[i][j-1];
}
an[i]=tt;
if(a[i].sz==0){
last[i]=last[i-1];
}else{
last[i]=i;
}
}
a[n+1].pb(0);
vllv dp(n+11,vll(2));
for(i=1;i<=n+1;i++){
if(a[i].sz){
ll l=last[i-1];
m=a[l].sz;
k=a[i].sz;
dp[i][0]=an[i] + min(dp[i-1][0]+abs(a[i][0]-a[l][m-1]),dp[i-1][1]+ abs(a[i][0]-a[l][0]));
dp[i][1]=an[i] + min(dp[i-1][0]+abs(a[i][k-1]-a[l][m-1]),dp[i-1][1]+ abs(a[i][k-1]-a[l][0]));
}else{
dp[i][0]=dp[i-1][0];
dp[i][1]=dp[i-1][1];
}
}
// for(i=1;i<=n;i++){
// cout<<dp[i][0]<<" "<<dp[i][1]<<endl;
// }
m=a[n].sz;
cout<<min(dp[n+1][1],dp[n+1][0]);
}
int main(){
FS;
ll i,j,k,n,m,x,y,z,q;
q=1;
// cin>>q;
for(ll tc=1;tc<=q;tc++){
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n,ll m,ll mod){
if(m==0)return 1;
if(m%2==0)return pow1((n*n)%mod,m/2,mod);
return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}
ll pow2(ll n,ll k){
ll ans=1;
while(k>0){
if(k%2==1)ans=ans*n;
n=n*n;
k/=2;
}
return ans;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
struct Edge {
int to;
long long weight;
Edge() : to(0), weight(0) {}
Edge(int to, long long weight) : to(to), weight(weight) {}
Edge(const Edge& e) {
to = e.to;
weight = e.weight;
}
bool operator>(const Edge &e) const { return weight > e.weight; }
bool operator<(const Edge &e) const { return weight < e.weight; }
bool operator==(const Edge &e) const { return weight == e.weight; }
bool operator<=(const Edge &e) const { return weight <= e.weight; }
bool operator>=(const Edge &e) const { return weight >= e.weight; }
};
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
using weightedGraph = vector<vector<Edge>>;
using heap = priority_queue<int, vector<int>, greater<int>>;
const ll BIL = 1e9;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const int inf = 1 << 29;
const ld PI = 3.141592653589793238462643383;
ll solve(vector<ll>& r, vector<ll>& g, vector<ll>& b) {
ll res = INF;
for(int i=0;i<g.size();i++) {
auto it = lower_bound(b.begin(), b.end(), g[i]);
if(it != b.end()) {
res = min(res, abs(g[i]-*it));
}
if(it == b.begin()) continue;
it--;
res = min(res, abs(g[i]-*it));
}
for(int i=0;i<b.size();i++) {
auto it = lower_bound(g.begin(), g.end(), b[i]);
if(it != g.end()) {
res = min(res, abs(b[i]-*it));
}
if(it == g.begin()) continue;
it--;
res = min(res, abs(b[i]-*it));
}
vector<pll> gr, br;
for(int i=0;i<r.size();i++) {
ll t = INF;
auto it = lower_bound(g.begin(), g.end(), r[i]);
if(it != g.end()) t = min(t, abs(r[i]-*it));
if(it != g.begin()) {
it--;
t = min(t, abs(r[i]-*it));
}
gr.push_back({t, i});
t = INF;
auto it2 = lower_bound(b.begin(), b.end(), r[i]);
if(it2 != b.end()) t = min(t, abs(r[i]-*it2));
if(it2 != b.begin()) {
it2--;
t = min(t, abs(r[i]-*it2));
}
br.push_back({t, i});
}
sort(gr.begin(), gr.end());
sort(br.begin(), br.end());
ll res2 = INF;
int i = 0;
int j = 0;
while(res2 == INF && i < gr.size() && j < br.size()) {
if(gr[i].second != br[j].second) {
res2 = gr[i].first + br[j].first;
break;
}
if(i+1 == gr.size() && j+1 == br.size()) break;
else if(i+1 == gr.size()) j++;
else if(j+1 == br.size()) i++;
else if(gr[i].first+br[j+1].first < gr[i+1].first+br[j].first) j++;
else i++;
}
return min(res, res2);
}
int main(int argc,char* argv[]){
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
int n;
cin >> n;
int rn = 0, gn = 0, bn = 0;
vector<ll> r, g, b;
for(int i=0;i<2*n;i++) {
ll a;
char c;
cin >> a >> c;
if(c == 'R') {
rn++;
r.push_back(a);
} else if(c == 'G') {
gn++;
g.push_back(a);
} else {
bn++;
b.push_back(a);
}
}
if(rn % 2 == 0 && gn % 2 == 0 && bn % 2 == 0) {
cout << 0 << endl;
return 0;
}
sort(r.begin(), r.end());
sort(g.begin(), g.end());
sort(b.begin(), b.end());
ll ans = 0;
if(rn % 2 == 0) {
ans = solve(r, g, b);
} else if(gn % 2 == 0) {
ans = solve(g, r, b);
} else {
ans = solve(b, r, g);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
inline void sol() {
//
ll n, m;
cin >> n >> m;
vector<pll> adj[n + 1];
for (int i = 0; i < m; i++) {
ll u, v, c;
cin >> u >> v >> c;
adj[u].push_back({c, v});
}
for (int i = 1; i <= n; i++)
sort(adj[i].begin(), adj[i].end());
for (int start = 1; start <= n; start++) {
vll costs(n + 1, 1e12);
priority_queue<pll, vector<pll>, greater<pll>> pq;
for (auto &p : adj[start]) {
pq.push(p);
}
while (not pq.empty()) {
auto p = pq.top();
pq.pop();
if (costs[p.second] <= p.first)
continue;
costs[p.second] = p.first;
for (auto &q : adj[p.second]) {
ll next = costs[p.second] + q.first;
pq.push({next, q.second});
}
}
if(costs[start] == 1e12)
cout << "-1\n";
else
cout << costs[start] << endl;
}
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
sol();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef long double ld;
using P = pair<int,int>;
const int INF=1001001001;
const int mod =1e9+7;
struct edge{
int to;
ll w;
edge(int to,ll w):to(to),w(w){}
};
using Graph=vector<vector<edge>>;
int n,m;
auto dijkstra(int s,Graph G){
vector<ll>dist(n,INF);
priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>>q;
for(auto u:G[s]){
if(chmin(dist[u.to],u.w)){
q.push(P(u.w,u.to));
}
}
while(!q.empty()){
int v=q.top().second;
ll d=q.top().first;
if(v==s){return d;}
q.pop();
if(d>dist[v]){continue;}
for(auto e:G[v]){
if(chmin(dist[e.to],dist[v]+e.w)){
q.push({dist[e.to],e.to});
}
}
}
return -1ll;
}
void solve(){
cin>>n>>m;
Graph G(n);
vector<ll>r(n,INF);
rep(i,m){
ll a,b,c;
cin>>a>>b>>c;
a--;b--;
G[a].push_back(edge(b,c));
}
rep(i,n){
ll ans=dijkstra(i,G);
cout<<(ans==INF?-1:ans)<<endl;
}
}
int main() {
solve();
return 0;
} |
#include <bits/stdc++.h>
const int N = 200010;
const long long INF = 1ll<<60;
const int inf = 0x3f3f3f3f;
typedef std::pair<int, int> PairInt;
typedef std::pair<long long, int> Pair;
const long long mod = 1e9 + 7;
int n;
std::vector<std::pair<int, long long>> g[N];
int dp[N][60][2];
int mi[100];
int ans;
void Dfs(int u, int f) {
for (int i = 0; i < 60; ++i) dp[u][i][0] = 1;
for (size_t i = 0; i < g[u].size(); ++i) {
int v = g[u][i].first;
long long w = g[u][i].second;
if (v == f) continue;
Dfs(v, u);
for (int j = 0; j < 60; ++j) {
if ((w >> j) & 1) {
ans = (ans + 1ll * dp[u][j][0] * dp[v][j][0] % mod * mi[j] % mod) % mod;
ans = (ans + 1ll * dp[u][j][1] * dp[v][j][1] % mod * mi[j] % mod) % mod;
} else {
ans = (ans + 1ll * dp[u][j][0] * dp[v][j][1] % mod * mi[j] % mod) % mod;
ans = (ans + 1ll * dp[u][j][1] * dp[v][j][0] % mod * mi[j] % mod) % mod;
}
}
for (int j = 0; j < 60; ++j) {
if ((w >> j) & 1) {
dp[u][j][0] = (dp[u][j][0] + dp[v][j][1]) % mod;
dp[u][j][1] = (dp[u][j][1] + dp[v][j][0]) % mod;
} else {
dp[u][j][0] = (dp[u][j][0] + dp[v][j][0]) % mod;
dp[u][j][1] = (dp[u][j][1] + dp[v][j][1]) % mod;
}
}
}
}
int main() {
scanf("%d", &n);
mi[0] = 1;
for (int i = 1; i < 60; ++i) mi[i] = 2ll * mi[i - 1] % mod;
for (int i = 1; i < n; ++i) {
int u, v;
long long w;
scanf("%d%d%lld", &u, &v, &w);
g[u].push_back({v, w});
g[v].push_back({u, w});
}
Dfs(1, 0);
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i,s,e) for(int i=s ; i < e ; i++)
#define rrep(i,s,e) for(int i=s ; i > e ; i--)
#define srep(i,s,e,j) for(int i=s ; i < e ; i+=j)
#define tr(i,x) for(auto i : x)
#define inp(a) for(int i=0 ; i<a.size() ; i++)cin>>a[i]
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pii>
#define maxpqi priority_queue<int>
#define minpqi priority_queue <int, vector<int>, greater<int> >
#define pii pair<int,int>
#define F first
#define S second
#define mk make_pair
#define pb push_back
#define pf push_front
#define endl '\n'
#define br printf("\n")
#define inf 1000000
#define imap map<int,int>
#define uimap unordered_map<int,int>
#define gcd(a,b) __gcd(a,b)
#define clr(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define lb lower_bound
#define ub upper_bound
#define npos string::npos
#define all(x) x.begin(),x.end()
#define descen greater<int>()
const int mod = 1e9 + 7;
int SumOfXorOfAllPairs(int a[],int n,int numbits){
int sum = 0;
int cnt[2];
rep(i,0,numbits){
clr(cnt);
rep(j,0,n)cnt[(a[j]>>i)&1]++;
sum += (1LL<<i)%mod*cnt[0]%mod*cnt[1];
sum = sum%mod;
}
return sum;
}
void solve(){
int n;cin>>n;
vpi adj[n];
int u,v,w;
rep(i,0,n-1){
cin>>u>>v>>w;
u--;v--;
adj[u].pb({v,w});
adj[v].pb({u,w});
}
bool vis[n];fill(vis,false);
int dist[n];clr(dist);
queue<int>q;
q.push(0);
int curr;
while(!q.empty()){
curr = q.front();q.pop();
tr(i,adj[curr]){
if(!vis[i.F]){
dist[i.F] = dist[curr]^i.S;
vis[i.F] = true;
q.push(i.F);
}
}
}
cout << SumOfXorOfAllPairs(dist,n,60LL) << endl;
}
int32_t main()
{
fastio
// ios::sync_with_stdio(false);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
solve();
return 0;
}
/*
// Sort the array in descending order
sort(arr, arr + n, greater<int>());
*/ |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(a,b) memset(a,b,sizeof (a))
#define ios std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
// ios can not be used with scanf,printf. IF ios MUST cin,cout.
typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> PII;
const ll mod=1000000007;
const int INF=0x3f3f3f3f;
ll ksm(ll a,ll b){ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
const int N=2e5+10,M=18;
int main(){
int T;
scanf("%d",&T);
while(T--){
ll n;
scanf("%lld",&n);
if(n&1)puts("Odd");
else if(n%4==2)puts("Same");
else puts("Even");
}
return 0;
}
| // Generated by 2.3.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
x = y;
return true;
}
return false;
}
void solve(long long n, std::vector<long long> a){
vector<pair<i64,int>> v;
for(int i = 0; i < 2 * n; ++i){
v.emplace_back(a[i], i);
}
sort(v.begin(), v.end());
vector<int> fl(2 * n, 0);
for(int i = 0; i < n; ++i){
fl[v[i].second] = true;
}
queue<bool> que;
string s;
for(int i = 0; i < 2 * n; ++i){
if(!que.empty() && que.front() != fl[i]){
s += ')';
que.pop();
}
else{
que.emplace(fl[i]);
s += '(';
}
}
assert(que.empty());
cout << s << endl;
}
signed main(){
long long N;
std::scanf("%lld", &N);
std::vector<long long> A(2*N);
for(int i = 0 ; i < 2*N ; i++){
std::scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define sz(x) (int)(x.size())
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char& s) {
return to_string(string(1, s));
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(const bool& b) {
return (b ? "1" : "0");
}
string to_string(const vector<bool>& v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(const bitset<N>& v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(const A& v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef XOX // use -DXOX flag while compiling
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
const int inf = 1e15;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// code here
int n, m;
cin >> n >> m;
vector<array<int, 3>> edges;
vector<int> dis(n * n, -1);
for(int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
if(u > v) swap(u, v);
dis[u * n + v] = 1;
dis[v * n + u] = 1;
char ch;
cin >> ch;
edges.push_back({u, v, (int)(ch - 'a')});
}
for(int i = 0; i < n; i++) {
dis[i * n + i] = 0;
}
auto getp = [&](int u, int v) {
if(u > v) swap(u, v);
return u * n + v;
};
vector<vector<int>> adj(n * n);
for(int i = 0; i < sz(edges); i++) {
for(int j = i + 1; j < sz(edges); j++) {
auto p1 = edges[i], p2 = edges[j];
if(p1[2] != p2[2]) continue;
int u = getp(p1[0], p2[0]);
int v = getp(p1[1], p2[1]);
adj[u].push_back(v);
adj[v].push_back(u);
u = getp(p1[0], p2[1]);
v = getp(p1[1], p2[0]);
adj[u].push_back(v);
adj[v].push_back(u);
}
}
debug(adj);
debug(dis);
vector<int> D(n * n, -1);
queue<int> qu;
qu.push(n - 1);
D[n - 1] = 0;
int ans = inf;
while(!qu.empty()) {
auto u = qu.front();
qu.pop();
if(dis[u] != -1) {
ans = min(ans, D[u] + dis[u]);
continue;
}
for(int v : adj[u]) {
if(D[v] != -1) continue;
D[v] = D[u] + 2;
qu.push(v);
}
}
cout << (ans == inf ? -1 : ans) << '\n';
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define mem0(x) memset(x, 0, sizeof (x))
#define mem1(x) memset(x, -1, sizeof (x))
typedef long long ll;
#define int ll
typedef vector <int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector <ii> vii;
typedef vector<vii> vvii;
vvi g;
int32_t main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m; cin >> n >> m;
g.assign(n*n, vi());
vvii edges(26);
for (int i = 0; i < m; ++i) {
int u, v;
char c;
cin >> u >> v >> c;
edges[c-'a'].pb({u-1, v-1});
}
for (int ch = 0; ch < 26; ++ch) {
for (int i = 0; i < (int)edges[ch].size(); ++i) {
for (int j = i+1; j < (int)edges[ch].size(); ++j) {
int a,b,c,d;
a = edges[ch][i].ff;
b = edges[ch][i].ss;
c = edges[ch][j].ff;
d = edges[ch][j].ss;
g[a*n+c].pb(b*n+d); g[b*n+d].pb(a*n+c);
g[c*n+a].pb(d*n+b); g[d*n+b].pb(c*n+a);
g[a*n+d].pb(b*n+c); g[b*n+c].pb(a*n+d);
g[d*n+a].pb(c*n+b); g[c*n+b].pb(d*n+a);
}
}
}
vi dis(n*n, -1);
queue<int> q;
q.push(n-1);
dis[n-1] = 0;
while (q.size()){
int u = q.front(); q.pop();
for (int v: g[u]){
if (dis[v] == -1){
dis[v] = dis[u]+1;
q.push(v);
}
}
}
int ans = 1e9;
for (int i = 0; i < n; ++i) {
if (dis[n*i+i] + 1) ans = min(ans, dis[n*i+i]*2);
}
for (int c = 0; c < 26; ++c) {
for (ii p: edges[c]){
if (dis[n*p.ff+p.ss] + 1) ans = min(ans, dis[n*p.ff+p.ss]*2+1);
swap(p.ff, p.ss);
if (dis[n*p.ff+p.ss] + 1) ans = min(ans, dis[n*p.ff+p.ss]*2+1);
}
}
if (ans == (int)1e9) ans = -1;
cout << ans << "\n";
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b,c;
cin>>a>>b>>c;
cout<<b<<c<<a;
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll = long long;
#define for(i, a, b) for (int i=(a); i < (b); i++)
#define rep(i, n) for(i, 0, n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
int main () {
string s;
cin >> s;
cout << s[1] << s[2] << s[0] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define bit(n,k) ((n>>k)&1) //nのk bit目
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll llINF = 1LL << 60;
const int iINF = 1e9;
//------------------------------------------------
struct Solver{
void solve(){
ll A,B;
cin >> A>>B;
ll ans=1;
rep1(g,B) if( ceil(A/double(g)) < floor(B/double(g)) ) ans=g;
cout << ans << endl;
}
};
int main(){
int testcasenum=1;
//cin >> testcasenum;
rep1(ti,testcasenum){
Solver solver;
solver.solve();
}
return 0;
}
| #include "bits/stdc++.h"
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define maxn 2000
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef double db;
int lg[maxn+5];
int a[maxn+5],b[maxn+5];
int n;
int d[maxn+5][maxn+5];
void adj(int &x)
{
if(x & (1<<lg[n-1])) x^=1<<lg[n-1];
if(x>=n) x^=1<<(lg[n-1]-1);
}
int main()
{
scanf("%d",&n);
rep(i,1,n) lg[i]=lg[i>>1]+1;
rep(i,0,n-1)
{
a[i]=i*2;
b[i]=i*2+1;
adj(a[i]);
adj(b[i]);
}
/*
rep(i,1,n) rep(j,1,n) d[i][j]=inf;
rep(i,0,n-1) d[i+1][a[i]+1]=d[i+1][b[i]+1]=1;
rep(i,1,n) d[i][i]=0;
rep(k,1,n) rep(i,1,n) rep(j,1,n) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
rep(i,1,n) rep(j,1,n) assert(d[i][j]<=10);
*/
rep(i,0,n-1) printf("%d %d\n",a[i]+1,b[i]+1);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a*a+b*b<c*c){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(int i=cc;i>=n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const vector<int> dx2 = {1, 1, 1, 0, 0, 0, -1, -1, -1};
const vector<int> dy2 = {1, 0, -1, 1, -1, 0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const ll MAX = 1000000;
const ll MOD = 1000000007;
const ll big = (1ll<<60);
const ll moda = 1000000007;
const ll modb = 100000007;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll modPow(ll a, ll n, ll p) {
if (n == 0) return 1;
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
int main(){
ll a, b, c;
cin >> a >> b >> c;
cout << (a*a+b*b<c*c ? "Yes":"No") << endl;
} |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
#define rep(i,n) for (int i=0;i<n;++i)
#define REP(i,n) for (int i=1;i<=n;++i)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define RI(x) scanf("%d",&x)
#define RII(x,y) scanf("%d%d",&x,&y)
int n;
int x[105],y[105];
vector<int> G[105];
bool vis[105];
inline void dfs(int u){
vis[u]=1;
for (int i=0;i<G[u].size();++i) if (!vis[G[u][i]]) dfs(G[u][i]);
}
int main(){
ios::sync_with_stdio(false);
cin>>n;
// lower bound line: 0 upper bound line: n+1
REP(i,n) cin>>x[i]>>y[i];
int l=0,r=1e8;// l:ok r:bad
// multiplied by 1e6.
while(r-l>1){
int m=l+r>>1;
rep(i,n+2) G[i].clear();
REP(i,n) if ((y[i]+100)*1e6<m*2) G[0].pb(i);
REP(i,n) if ((100-y[i])*1e6<m*2) G[i].pb(n+1);
for (int i=1;i<n;++i) for (int j=i+1;j<=n;++j)
if ((ll)((x[i]-x[j])*(x[i]-x[j])+((y[i]-y[j])*(y[i]-y[j])))*1e6*1e6 < (ll)m*m*4) G[i].pb(j),G[j].pb(i);
memset(vis,0,sizeof(vis));
dfs(0);
if (vis[n+1]) r=m;
else l=m;
}
double x=(double)l/1e6;
printf("%0.5lf",x);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << '\n'; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on
class UnionFind {
public:
vector<int> par;
int N;
UnionFind(int n) {
par.resize(n, -1);
N = n;
}
int Find(int n) {
return par[n] < 0 ? n : par[n] = Find(par[n]);
}
bool Union(int x, int y) {
x = Find(x);
y = Find(y);
if (x == y) return false;
if (-par[x] > -par[y]) swap(x, y);
par[y] += par[x];
par[x] = y;
N--;
return true;
}
bool Same(int x, int y) {
return Find(x) == Find(y);
}
int size(int x) {
return -par[Find(x)];
}
int size() {
return N;
}
};
#include <iomanip>
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin, n;
vector<int> x(n), y(n);
REP(i, 0, n) {
cin, x[i], y[i];
}
double l = 0, r = 100;
double ans = 0;
while (abs(r - l) >= 1e-9) {
UnionFind uf(n + 2);
double mid = (l + r) / 2;
REP(i, 0, n) {
REP(j, 0, n) {
if ((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) < 4 * mid * mid) {
uf.Union(i, j);
}
}
if (y[i] + mid > 100 - mid) {
uf.Union(i, n);
}
if (y[i] - mid < -100 + mid) {
uf.Union(i, n + 1);
}
}
dump(mid, uf.Same(n, n + 1));
if (uf.Same(n, n + 1)) {
r = mid;
} else {
l = mid;
ans = mid;
}
}
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define DB double
#define LL long long
#define MST(a,b) memset((a),(b),sizeof(a))
#ifdef _DEBUG_
#define MRK() cout<<"Mark"<<endl;
#define WRT(x) cout<<#x<<" = "<<(x)<<endl;
#else
#define MRK() ;
#define WRT(x) ;
#endif
#define MAXN 1010000
#define MAXM 2010000
#define MOD 998244353 //1000000007
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-5
#define _ 0
using namespace std;
int n;
int w[MAXN];
LL pool[101][21000];
LL* dp[101];
LL fac[MAXN];
void init()
{
for (int i=0;i<=100;i++)
dp[i]=pool[i]+10050;
}
void work()
{
dp[0][0]=1;
int sum=0;
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>w[i];
sum+=w[i];
}
if (sum%2==1)
{
cout<<0<<endl;
return ;
}
dp[0][0]=1;
for (int i=1;i<=n;i++)
{
for (int j=i-1;j>=0;j--)
for (int k=10000;k>=0;k--)
{
//dp[j+1][k]=(dp[j+1][k]+dp[j][k])%MOD;
dp[j+1][k+w[i]]=(dp[j+1][k+w[i]]+dp[j][k])%MOD;
}
}
fac[0]=1;
for (int i=1;i<MAXN;i++)
fac[i]=fac[i-1]*i%MOD;
LL ans=0;
for (int i=0;i<=n;i++)
{
WRT(dp[i][sum/2])
ans+=dp[i][sum/2]*fac[i]%MOD*fac[n-i]%MOD;
}
cout<<ans%MOD<<endl;
}
int main()
{
#ifdef _DEBUG_
freopen("C:/Users/DELL/Documents/Dev-C++/sample.in","r",stdin);
#endif
init();
int casenum=1;
//scanf("%d",&casenum);
for (int testcase=1;testcase<=casenum;testcase++)
{
#ifdef _DEBUG_
printf("Case #%d:\n",testcase);
#endif
work();
}
return ~~(0^_^0);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define fi first
#define se second
#define INF 1000000009
#define LLINF 1000000000000000009LL
using ll = long long;
const int mod = 1000000007; // 998244353;
struct mint {
long long x;
mint(long long x=0) : x((x%mod+mod)%mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const mint& a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint& a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint& a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint& a) const {
return mint(*this) += a;
}
mint operator-(const mint& a) const {
return mint(*this) -= a;
}
mint operator*(const mint& a) const {
return mint(*this) *= a;
}
mint pow(long long t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod-2); }
mint& operator/=(const mint& a) { return *this *= a.inv(); }
mint operator/(const mint& a) const {
return mint(*this) /= a;
}
};
istream& operator>>(istream& is, const mint& a) {
return is >> a.x;
}
ostream& operator<<(ostream& os, const mint& a) {
return os << a.x;
}
typedef pair<int,ll>P;
vector<P> to[200009];
mint odd[200009], even[200009];
mint dfs(int p, int last, int n){
mint odds=0, res=0;
rep(i,to[p].size()){
int next=to[p][i].fi;
int w=(to[p][i].se>>n)&1;
if(next==last)continue;
res+=dfs(next,p,n);
if(w==0){
odd[p]+=odd[next];
even[p]+=even[next];
}
else{
odd[p]+=even[next];
even[p]+=odd[next];
}
}
rep(i,to[p].size()){
int next=to[p][i].fi;
int w=(to[p][i].se>>n)&1;
if(next==last)continue;
if(w==0){
res += (odd[p] - odd[next]) * even[next];
}
else{
res += (odd[p] - even[next]) * odd[next];
}
}
res+=odd[p];
//cout<<p<<' '<<res<<' '<<odd[p]<<endl;
return res;
}
int main(){
int n;
cin>>n;
rep(i,n-1){
int u,v;
ll w;
cin>>u>>v>>w;
u--;v--;
to[u].push_back(P(v, w));
to[v].push_back(P(u, w));
}
mint ans=0;
rep(i,60){
rep(j,n){
odd[j]=0;
even[j]=1;
}
ans += dfs(0,0,i)*((ll)1<<i);
}
cout<<ans<<endl;
return 0;
} |
#include <stdio.h>
#include <stack>
typedef long long ll;
int main(void) {
ll i, j, k, n, ans = 0;
scanf("%lld", &n);
char s[n + 10], t[n + 10];
scanf("%s%s", s, t);
std::stack<ll> a, b;
for(i = 0; i < n; ++i) {
if(t[i] == '1') a.push(i);
if(s[i] == '1') {
if(b.size()) ans += i - b.top(), b.pop();
else if(a.size()) ans += i - a.top(), a.pop();
else b.push(i);
}
}
printf("%lld", a.size() || b.size() ? -1 : ans);
return 0;
} | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
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;}
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
const double pi = 3.14159265358979;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
string s,t;
cin >> n >> s >> t;
ll ssum = 0,tsum = 0;
for (ll i = 0; i < n; i++){
if (s[i] == '1'){
ssum++;
}
if (t[i] == '1'){
tsum++;
}
}
if (ssum %2 != tsum %2){
cout << -1 << endl;
return 0;
}
ll erase = 0;
ll ans = 0;
ll count = 0;
ll j = 0;
for (ll i = 0; i < n; i++){
if (t[i] == '0') continue;
ll k = -1;
while (j < i){
if (s[j] == '1'){
count++;
if (count %2 == 1){
k = j;
}
else{
ans += (j - k);
k = -1;
}
}
j++;
}
//cout << i << " " << j << " " << k << endl;
if (k != -1){
while (j < n){
if (s[j] == '1'){
ans += (j - k);
//cout << ans << endl;
j++; count++;
k = -1;
break;
}
else j++;
}
}
if (k != -1){
cout << -1 << endl;
return 0;
}
while (j < n){
if (s[j] == '1'){
ans += (j - i);
//cout << ans << endl;
break;
}
else j++;
}
if (j >= n){
cout << -1 << endl;
return 0;
}
else if (j == n-1){
if (count != ssum - tsum){
cout << -1 << endl;
return 0;
}
else break;
}
else{
j++;
}
//cout << ans << endl;
}
//cout << count << endl;
if (count != ssum - tsum){
//cout << "Yes" << endl;
ll k = -1;
for (ll i = n-1; i >= 0; i--){
if (s[i] == '1'){
count++;
if (count %2 == 1){
k = i;
}
else{
ans += (k - i);
k = -1;
}
if (count == ssum - tsum) break;
}
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5;
int main(){
vector<pair<int,int>>ans;
int n,m;cin>>n>>m;
int x=m;
if((m>0&&x+2>n)||m<0){
cout<<"-1\n";
return 0;
}
ans.emplace_back(1,4*x+3);
for(int i=0;i<n-1;i++){
ans.emplace_back(4*i+2,4*i+4);
}
for(auto& i:ans){
cout<<i.first<<' '<<i.second<<'\n';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
if(n == 1) {
if(m != 0)
cout << -1 << endl;
else
cout << "1 2" << endl;
return 0;
}
if(m < 0 || m > n - 2) {
cout << -1 << endl;
return 0;
}
if(m == 0) {
for(int i=0, s = 5; i<n; ++i, s+= 2) {
cout << s << " " << s + 1 << endl;
}
return 0;
}
assert(m <= n - 2);
cout << 1 << " " << 2*(m + 1) + 5 << endl;
for(int s=2, cnt=0; cnt<m+1; s+=2, ++cnt) {
cout << s << " " << s + 1 << endl;
}
int start = 2*(m + 1) + 10;
for(int k=0; k < n-m-2; ++k) {
cout << start << " " << start + 1 << endl;
start += 2;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.