code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using i64 = int64_t;
using vi64 = vector<i64>;
using vvi64 = vector<vi64>;
using vvvi64 = vector<vvi64>;
using u64 = uint64_t;
#define rep(i, s, n) for (i64 i = (s); i < (n); ++i)
void mul(vvi64& c, const vvi64& a, const vvi64& b) {
rep(i, 0, 3) {
rep(j, 0, 3) {
rep(k, 0, 3) { c[i][j] += a[i][k] * b[k][j]; }
}
}
}
const vvi64 m1_of() { return {{0, 1, 0}, {-1, 0, 0}, {0, 0, 1}}; }
const vvi64 m2_of() { return {{0, -1, 0}, {1, 0, 0}, {0, 0, 1}}; }
const vvi64 m3_of(i64 p) { return {{-1, 0, 2 * p}, {0, 1, 0}, {0, 0, 1}}; }
const vvi64 m4_of(i64 p) { return {{1, 0, 0}, {0, -1, 2 * p}, {0, 0, 1}}; }
void run() {
i64 n;
cin >> n;
vi64 xs(n), ys(n);
rep(i, 0, n) { cin >> xs[i] >> ys[i]; }
i64 m;
cin >> m;
vvvi64 trs(m + 1, vvi64(3, vi64(3, 0)));
rep(i, 0, 3) { trs[0][i][i] = 1; }
rep(i, 1, m + 1) {
i64 op;
cin >> op;
if (op == 1) {
mul(trs[i], m1_of(), trs[i - 1]);
} else if (op == 2) {
mul(trs[i], m2_of(), trs[i - 1]);
} else if (op == 3) {
i64 p;
cin >> p;
mul(trs[i], m3_of(p), trs[i - 1]);
} else if (op == 4) {
i64 p;
cin >> p;
mul(trs[i], m4_of(p), trs[i - 1]);
}
}
i64 q;
cin >> q;
rep(i, 0, q) {
i64 a, b;
cin >> a >> b;
--b;
i64 x{trs[a][0][0] * xs[b] + trs[a][0][1] * ys[b] + trs[a][0][2] * 1},
y{trs[a][1][0] * xs[b] + trs[a][1][1] * ys[b] + trs[a][1][2] * 1};
cout << x << " " << y << endl;
}
}
int main() {
cin.tie(nullptr);
cout.precision(std::numeric_limits<double>::max_digits10);
run();
return 0;
}
| //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////
const int C=1e15;
bool reasonable(int x){
return x>=-C && x<=C;
}
int32_t main() {
boost; IO();
int N; cin>>N;
vi X(N),Y(N);
FOR(i,0,N) cin>>X[i]>>Y[i];
int M; cin>>M;
vpi vec;
FOR(i,0,M){
int t,p=-1; cin>>t;
if(t>=3) cin>>p;
vec.eb(t,p);
}
int a[M],b[M],v[M],v2[M],c[M],d[M];
int cur_a=1,cur_b=1,cur_v=0,cur_v2=1,cur_c=0,cur_d=0;
FOR(i,0,M){
int t=vec[i].fi,p=vec[i].se;
if(t==2){
swap(cur_a,cur_b);
swap(cur_v,cur_v2);
swap(cur_c,cur_d);
cur_a*=-1;
cur_c*=-1;
}
else if(t==1){
swap(cur_a,cur_b);
swap(cur_v,cur_v2);
swap(cur_c,cur_d);
cur_b*=-1;
cur_d*=-1;
}
else if(t==3){
cur_a*=-1;
cur_c*=-1;
cur_c+=2*p;
}
else if(t==4){
cur_b*=-1;
cur_d*=-1;
cur_d+=2*p;
}
a[i]=cur_a; b[i]=cur_b;
v[i]=cur_v; v2[i]=cur_v2;
c[i]=cur_c; d[i]=cur_d;
/*dbg(cur_a)
dbg(cur_v)
dbg(cur_c)*/
}
int Q; cin>>Q;
while(Q--){
int op,i; cin>>op>>i;
op--; i--;
if(op<0){
cout << X[i] << ' ' << Y[i] << endl;
continue;
}
int x=X[i],y=Y[i];
cur_a=a[op];
cur_b=b[op];
cur_c=c[op];
cur_d=d[op];
dbgs(cur_a,cur_b)
if(v[op]==0){
cout << cur_a*x+cur_c << ' ' << cur_b*y+cur_d << endl;
}
else{
cout << y*cur_a+cur_c << ' ' << cur_b*x+cur_d << endl;
}
}
return 0;
}
//Change your approach |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#define all(c) (c).begin(), (c).end()
#define length(x) (int)(x).size()
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define R_EP(i, a, b, s) for(int i=(a); (s)>0?i<=(b):i>=(b); i+=(s))
#define R_EP1(e) R_EP(i, 1, e, 1)
#define R_EP2(i, e) R_EP(i, 1, e, 1)
#define R_EP3(i, b, e) R_EP(i, b, e, 1)
#define R_EP4(i, b, e, s) R_EP(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define R_EPC(...) GET5(__VA_ARGS__, R_EP4, R_EP3, R_EP2, R_EP1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
#define REP(...) R_EPC(__VA_ARGS__)(__VA_ARGS__)
template<class TypeInt> void read(TypeInt &x) {
bool neg=false;
int c;
x=0;
c=getchar();
if(c=='-') {
neg=true;
c=getchar();
}
for(; (c>47&&c<58); c=getchar()) {
x=(x<<1)+(x<<3)+c-48;
}
if(neg)
x*=-1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
read(a);
read(b);
read(c);
if(c%2==0)
a=abs(a), b=abs(b);
if(a>b)
cout << ">";
else if(a<b)
cout << "<";
else
cout << "=";
cout << "\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(){
lli a,b,c;
cin>>a>>b>>c;
if(c%2==0){
if(abs(a)>abs(b))
cout<<">";
else if(abs(a)==abs(b))
cout<<"=";
else if(abs(a)<abs(b))
cout<<"<";
}
else{
if(a>b)
cout<<">";
else if(a==b)
cout<<"=";
else if(b>a)
cout<<"<";
}
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define FastIO cin.sync_with_stdio(false), cin.tie(nullptr)
#define pb push_back
#define fs first
#define sc second
#define mkp make_pair
#define endl '\n'
// IO
#define multitest signed __T; cin >> __T; while(__T--)
template<typename T>
void _read(T& t);
template<typename T>
void _read(vector<T>& v);
template<typename T1, typename T2>
void _read(pair<T1, T2>& p);
template<typename T>
void _read(T& t) { cin >> t; }
template<typename T>
void _read(vector<T>& v) { for (unsigned _i = 0; _i < v.size(); _i++)_read(v[_i]); }
template<typename T1, typename T2>
void _read(pair<T1, T2>& p) { _read(p.first); _read(p.second); }
void _masterread() {}
template<typename T, typename... V>
void _masterread(T& t, V& ... v) { _read(t); _masterread(v...); }
#define re(...)_masterread(__VA_ARGS__)
template<typename T>
void _print(T t);
template<typename T>
void _print(vector<T>& v);
template<typename T1, typename T2>
void _print(pair<T1, T2>& p);
template<typename T>
void _print(T t) { cout << t; }
template<typename T>
void _print(vector<T>& v) { for (unsigned _i = 0; _i < v.size(); _i++)_print(v[_i]), cout << (_i == v.size() - 1 ? "" : " "); }
template<typename T1, typename T2>
void _print(pair<T1, T2>& p) { _print(p.first); cout << " "; _print(p.second); }
void _masterprint() { cout << endl; }
template<typename T, typename... V>
void _masterprint(T t, V... v) { _print(t); if (sizeof...(v))cout << " "; _masterprint(v...); }
#define pr(...)_masterprint(__VA_ARGS__)
// DEBUG
// colored output???
template <typename T> // start forward declaration
void _debug(T t);
template<typename T1, typename T2>
void _debug(pair<T1, T2> p);
template<typename T>
void _debug(vector<T>v);
template <typename T> // end forward declaration
void _debug(T t) { cerr << t; }
template<typename T1, typename T2>
void _debug(pair<T1, T2> p) { cerr << "{"; _debug(p.first); cerr << ", "; _debug(p.second); cerr << "}"; }
template<typename T>
void _debug(vector<T>v) { cerr << "("; for (unsigned _i = 0; _i < v.size(); _i++)_debug(v[_i]), cerr << (_i == v.size() - 1 ? "" : ", "); cerr << ")"; }
void _masterdebug() { cerr << "]\n"; }
template<typename T, typename... V>
void _masterdebug(T t, V... v) { _debug(t); if (sizeof...(v))cerr << ", "; _masterdebug(v...); }
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"] = [";_masterdebug(__VA_ARGS__)
#define int long long
void solve() {
int n, c; re(n, c);
vector<pair<int, pair<int, int>>> A(n); re(A);
set<int> els;
for (int i = 0; i < n; i++)
els.insert(A[i].fs), els.insert(A[i].sc.fs);
map<int, int> from, to;
int idx = 0;
for (int val : els) {
to[idx] = val;
from[val] = idx++;
}
//for (auto val : from)
// cout << val.fs << ' ' << val.sc << endl;
for (int i = 0; i < n; i++)
A[i].fs = from[A[i].fs], A[i].sc.fs = from[A[i].sc.fs];
//debug(A);
vector<int> P(idx + 1, 0);
vector<int> E(idx + 1, 0);
for (int i = 0; i < n; i++) {
P[A[i].fs] += A[i].sc.sc;
P[A[i].sc.fs] -= A[i].sc.sc;
E[A[i].sc.fs] += A[i].sc.sc;
}
//debug(P);
for (int i = 1; i <= idx; i++)
P[i] += P[i - 1];
//debug(P);
int ans = 0;
int prev = 0;
for (int i = 0; i <= idx - 1; i++) {
int cur = to[i];
int nxt = to[i + 1];
ans += min(c, E[i] + P[i]);
ans += (nxt - cur - 1) * min(c, P[i]);
}
pr(ans);
}
signed main() {
FastIO;
/*int t;
cin >> t;
while (t--)*/
solve();
} | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse4,fma")
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using f32 = double;
using f64 = long double;
using u8 = unsigned char;
using u16 = unsigned short;
using u32 = unsigned int;
using u64 = unsigned long long;
using i16 = signed short;
using i32 = signed int;
using i64 = signed long long;
using vi = vector<int>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using rng = default_random_engine;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define np next_permutation
#define sz(v) int(v.size())
#define all(v) begin(v), end(v)
#define popcnt __builtin_popcount
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int INF = 2000069420;
const int M1 = 1'000'000'007;
const int M2 = 998'244'353;
const int maxn = 1'000'005;
const int maxg = 2'005;
const int maxk = 19;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
int a[maxn];
void solve() {
int n; cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a+n);
ll S = 0, T = 0;
for (int i = 0; i < n; ++i)
T += a[i]*ll(i) - S, S += a[i];
cout << T << '\n';
}
int main() {
cin.tie(nullptr) ->
sync_with_stdio(false);
int T = 1; // cin >> T;
while (T--) solve();
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define f(i,j,n) for(int i = j; i <= n; i++)
#define r(i,n,j) for(int i = n; i >= j; i--)
#define all(container) container.begin() , container.end()
#define sz(container) (int)container.size()
#define ff first
#define ss second
#define pii pair <int , int>
#define sp(x) setprecision(x)
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
#define T int ttt; cin >> ttt; while(ttt--)
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
int32_t main()
{
fast
int n; cin>>n;
int a[n+1],b[n+1];
f(i,1,n) cin>>a[i];
f(i,1,n) cin>>b[i];
int ans=0,id=0;
f(i,1,n){
id=max(id,a[i]);
ans=max(ans,id*b[i]);
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+10;
struct BIT{
int n,tr[N];
void init(int _n){
n=_n;
memset(tr,0,sizeof tr);
}
void add(int x,int v){
for(int i=x;i<=n;i+=i&-i)
tr[i]+=v;
}
int sum(int x){
int ans=0;
for(int i=x;i;i-=i&-i)
ans+=tr[i];
return ans;
}
}tr;
int n,a[N];
ll ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",&a[i]);
a[i]++;
}
tr.init(n+2);
for(int i=1;i<=n;++i){
int v=i-1-tr.sum(a[i]);
ans+=v;
tr.add(a[i],1);
}
for(int i=1;i<=n;++i){
printf("%lld\n",ans);
tr.add(a[i],-1);
int v=tr.sum(a[i]);
ans-=v;
v=tr.sum(n+2)-tr.sum(a[i]);
ans+=v;
tr.add(a[i],1);
}
return 0;
} |
#include<iostream>
#include<vector>
#include<math.h>
#include<algorithm>
#include<stack>
#include<list>
#include<queue>
#include<set>
#include<string>
#include<string.h>
#include <sstream>
#include<map>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#define ll long long
#define yes cout<<"YES"<<"\n"
#define no cout<<"NO"<<"\n"
using namespace std;
const ll MOD = 1000000007;
const ll mod = 1000000007;
const int Nmax=1000005;
ll gcd(ll a,ll b)
{
if(a==0){
return b;
}
return gcd(b%a,a);
}
int lcm(int a,int b)
{
return (a*b)/gcd(a,b);
}
bool isPrime(ll n){
for(int i = 2; i <=sqrt(n); i++)
if(n % i == 0)
return 0;
return 1;
}
void binaryRepresentation(int x)
{
for (int i = 31; i >= 0; i--)
{
if (x&(1<<i)) cout << "1";
else cout << "0";
}
}
ll combination(ll n,ll r){
if(r==n || r==0)
{
return 1LL;
}
return combination(n-1,r-1) + combination(n-1,r);
}
bool isPowerOfTwo(ll n)
{
if(n==0)
return false;
return (ceil(log2(n)) == floor(log2(n)));
}
ll power(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a);
b/=2;
a=(a*a);
}
return ans;
}
ll inverse(ll i)
{
if(i==1) return 1;
return (MOD-((MOD/i)*inverse(MOD%i))%MOD+MOD)%MOD;
}
bool cmp(const pair<ll,ll> &a,const pair<ll,ll> &b)
{
if(a.first==b.first)
return a.second<b.second;
return a.first>b.first;
}
string toString(ll a)
{
ostringstream temp;
temp << a;
return temp.str();
}
int main()
{
//vector<vector<int> >ar(n,vector<int> (m,0));
//vector<int>::iterator ptr;
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
ll h,w,x,y;
cin>>h>>w>>x>>y;
--x;--y;
vector<string>ar(h);
for(ll i=0;i<h;i++)
cin>>ar[i];
ll ans=0;
if(ar[x][y]=='.')
ans++;
for(ll i=x;i<=x;i++)
{
bool flag=true;
for(ll j=y+1;j<w;j++)
{
if(ar[i][j]=='.')
ans++;
else
{
flag=false;
break;
}
}
}
for(ll i=x;i<=x;i++)
{
bool flag=true;
for(ll j=y-1;j>=0;j--)
{
if(ar[i][j]=='.')
ans++;
else
{
flag=false;
break;
}
}
}
for(ll i=y;i<=y;i++)
{
bool flag=true;
for(ll j=x+1;j<h;j++)
{
if(ar[j][i]=='.')
ans++;
else
{
flag=false;
break;
}
}
}
for(ll i=y;i<=y;i++)
{
bool flag=true;
for(ll j=x-1;j>=0;j--)
{
if(ar[j][i]=='.')
ans++;
else
{
flag=false;
break;
}
}
}
cout<<ans;
return 0;
}
| /**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int inf = 1'000'000'007;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
void solve() {
int h, w; cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
int sx = -1, sy = -1, gx = -1, gy = -1;
vector<vector<int>> tpos(26, vector<int>());
rep(i, h) {
rep(j, w) {
cin >> a[i][j];
if(a[i][j] == 'S') sx = i, sy = j;
else if(a[i][j] == 'G') gx = i, gy = j;
else if(a[i][j] != '.' and a[i][j] != '#') {
int c = a[i][j] - 'a';
tpos[c].push_back(i * w + j);
}
}
}
vector<int> dist(h * w + 26, inf);
dist[sx * w + sy] = 0;
priority_queue<P, vector<P>, greater<P>> pque;
pque.push({0, sx * w + sy});
while(pque.size()) {
P p = pque.top(); pque.pop();
int pos = p.sc, di = p.fr;
if(di > dist[pos]) continue;
if(pos < h * w) {
int x = pos / w, y = pos % w;
rep(k, 4) {
int nx = x + dx[k], ny = y + dy[k];
// cerr << nx << " " << ny << "\n";
if(0 <= nx and nx < h and 0 <= ny and ny < w and a[nx][ny] != '#') {
if(chmin(dist[nx * w + ny], di + 1)) {
pque.push({di + 1, nx * w + ny});
}
}
}
if(a[x][y] != '.' and a[x][y] != 'S' and a[x][y] != 'G') {
// teleport
int c = a[x][y] - 'a';
if(chmin(dist[h * w + c], di)) {
pque.push({di, h * w + c});
}
}
} else {
int c = pos - h * w;
for(int np: tpos[c]) {
if(chmin(dist[np], di + 1)) {
pque.push({di + 1, np});
}
}
}
}
if(dist[gx * w + gy] == inf) dist[gx * w + gy] = -1;
cout << dist[gx * w + gy] << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(20);
//int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pi (3.141592653589)
#define pb push_back
#define mp make_pair
#define INF 1000000000000000000
#define MOD 1000000007
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define pll pair<ll , ll>
#define ff first
#define ss second
#define mMul(a , b , m) (a * b) % m
#define mSub(a , b , m) (a - b + m) % m
#define mAdd(a , b , m) (a + b) % m
ll dp[62][62];
string fun(ll i,ll j,ll k)
{
if(i==0)
{
string s;
while(j--)
s.pb('b');
return s;
}
if(j==0)
{
string s;
while(i--)
s.pb('a');
return s;
}
ll cn=dp[i+j-1][j];
if(cn>=k)
return 'a'+fun(i-1,j,k);
else
return 'b'+fun(i,j-1,k-dp[i+j-1][j]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
for(ll j=0;j<=60;j++)
dp[0][j]=0;
for(ll j=1;j<=60;j++)
dp[j][0]=1;
for(ll j=1;j<=60;j++)
{
for(ll k=1;k<=60;k++)
{
if(k>j)
dp[j][k]=0;
else if(k==j)
dp[j][k]=1;
else
dp[j][k]=dp[j-1][k]+dp[j-1][k-1];
}
}
ll x,y,k;
cin>>x>>y>>k;
cout<<fun(x,y,k)<<"\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int H,W,A,B;
int tatami[16][16];
int dfs(int y,int x){
//cout<<x<<","<<y<<endl;
if(y>=H){
if(A==0&&B==0) return 1;
return 0;
}
int nx=x+1;
int ny=y;
if(nx>=W){
nx=0;
ny++;
}
int ans=0;
if(tatami[y][x]==1){
return dfs(ny,nx);
}
tatami[y][x]=1;
B--;
if(B>=0) ans+=dfs(ny,nx);
B++;
A--;
if(A>=0&&y!=H-1&&tatami[y+1][x]==0){
tatami[y+1][x]=1;
ans+=dfs(ny,nx);
tatami[y+1][x]=0;
}
if(A>=0&&x!=W-1&&tatami[y][x+1]==0){
tatami[y][x+1]=1;
ans+=dfs(ny,nx);
tatami[y][x+1]=0;
}
A++;
tatami[y][x]=0;
return ans;
}
int main(){
cin>>H>>W>>A>>B;
cout<<dfs(0,0)<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vt vector
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
const int64_t MOD = 1000000007;
// 🚩
// 20201204 00:47~
//
int main()
{
ll H, W;
cin >> H >> W;
vt<string> S(H);
rep(i, H) cin >> S.at(i);
vt<vt<ll>> dp(H, vt<ll>(W, 0)), dpX(H, vt<ll>(W, 0)), dpY(H, vt<ll>(W, 0)), dpXY(H, vt<ll>(W, 0));
dp.at(0).at(0) = 1;
dpX.at(0).at(0) = 1;
dpY.at(0).at(0) = 1;
dpXY.at(0).at(0) = 1;
rep(i, H)
{
rep(j, W)
{
if (S.at(i).at(j) == '#') continue;
if (j > 0) dp.at(i).at(j) += dpX.at(i).at(j - 1);
if (i > 0) dp.at(i).at(j) += dpY.at(i - 1).at(j);
if (i > 0 && j > 0) dp.at(i).at(j) += dpXY.at(i - 1).at(j - 1);
dp.at(i).at(j) %= MOD;
dpX.at(i).at(j) = dp.at(i).at(j);
dpY.at(i).at(j) = dp.at(i).at(j);
dpXY.at(i).at(j) = dp.at(i).at(j);
if (j > 0) dpX.at(i).at(j) += dpX.at(i).at(j - 1);
if (i > 0) dpY.at(i).at(j) += dpY.at(i - 1).at(j);
if (i > 0 && j > 0) dpXY.at(i).at(j) += dpXY.at(i - 1).at(j - 1);
dpX.at(i).at(j) %= MOD;
dpY.at(i).at(j) %= MOD;
dpXY.at(i).at(j) %= MOD;
}
}
cout << dp.at(H - 1).at(W - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
const long long INFLL = 1e18;
using ll = long long;
int main(){
int h, w;
cin >> h >> w;
const int MAX = 2000;
char s[MAX][MAX];
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++){
cin >> s[i][j];
}
}
vector<vector<ll>> dp(h, vector<ll>(w, 0));
dp[0][0] = 1;
vector<ll> sita(w, 0);
ll migi;
vector<vector<ll>> naname(h, vector<ll>(w, 0));
for(int i = 0; i < h; i++){
migi = 0;
for(int j = 0; j < w; j++){
if(s[i][j] == '#'){
// dp[i][j] = -1;
migi = 0;
sita[j] = 0;
naname[i][j] = 0;
}else{
if(i == 0){
if(j == 0) {
migi = dp[i][j];
}else{
dp[i][j] = migi;
migi += dp[i][j];
}
sita[j] = dp[i][j];
naname[i][j] = dp[i][j];
}else{
if(j == 0){
dp[i][j] = sita[j];
sita[j] += dp[i][j];
naname[i][j] = dp[i][j];
}else{
// cout << naname[i-1][j-1] << endl;
dp[i][j] = migi + sita[j] + naname[i-1][j-1];
sita[j] += dp[i][j];
naname[i][j] = naname[i-1][j-1] + dp[i][j];
}
migi += dp[i][j];
}
}
if(dp[i][j] != -1) dp[i][j] %= MOD;
migi %= MOD;
sita[j] %= MOD;
naname[i][j] %= MOD;
// cout << dp[i][j];
}
// cout << endl;
}
cout << dp[h-1][w-1] << endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
void solve() {
long long n;
cin >> n;
int comma = 0;
int cnt = 2;
long long curr = 1000, res = 0;
while (curr <= n) {
cnt++;
comma = cnt / 3;
long long a = curr, b = min(n, curr * 10 - 1);
res += comma * (b - a + 1);
debug() << imie(res) imie(a) imie(b) imie(cnt);
curr *= 10;
}
cout << res << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt = 1;
//cin >> tt;
while (tt--) {
solve();
}
}
| #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n;
ll ans = 0;
cin >> n;
if (n >= 1000) {
ans += n - 999;
}
if (n >= 1000000) {
ans += n - 999999;
}
if (n >= 1000000000) {
ans += n - 999999999;
}
if (n >= 1000000000000) {
ans += n - 999999999999;
}
if (n >= 1000000000000000) {
ans += n - 999999999999999;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
//#include <atcoder/modint>
#define inc(i, n) for (int i = 0; i < (n); i++)
#define incs(i, s, n) for (int i = (s); i < (n); i++)
//#define yes printf("Yes\n")
//#define no printf("No\n")
using namespace std;
//using mint = atcoder::modint998244353;
//using pii = pair<int, int>;F
using ll = long long;
const int ARR_SIZE = 5e3+2;
const double epsilon = 0.5;
int main(int argc, char const *argv[])
{
int N;
scanf("%d", &N);
ll ans = 0;
inc(i, N) {
ll A, B;
scanf("%lld%lld", &A, &B);
ans += (A+B)*(B-A+1)/2;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<typename T>
T pown(T b, ll e) {
if(e == 0) return 1;
T p = pown(b, e / 2);
if(e % 2 == 0) return p * p;
return p * p * b;
}
template<const int mod>
struct Intmod {
ll a;
Intmod(ll a = 0): a(((a % mod) + mod) % mod) {}
Intmod operator-() const {return Intmod(-a);}
Intmod& operator+=(const Intmod b) {
if((a += b.a) >= mod) a -= mod;
return *this;
}
Intmod& operator+=(const ll b) {
if((a += b) >= Intmod(mod).a) a -= mod;
return *this;
}
Intmod& operator-=(const Intmod b) {
if((a -= b.a) < 0) a += mod;
return *this;
}
Intmod& operator-=(const ll b) {
if((a -= Intmod(b).a) < 0) a += mod;
return *this;
}
Intmod& operator*=(const Intmod b) {
(a *= b.a) %= mod;
return *this;
}
Intmod& operator*=(const ll b) {
(a *= Intmod(b).a) %= mod;
return *this;
}
template<typename T> Intmod operator+(const T b) const {return Intmod(*this) += b;}
template<typename T> Intmod operator-(const T b) const {return Intmod(*this) -= b;}
template<typename T> Intmod operator*(const T b) const {return Intmod(*this) *= b;}
// Valid for prime mod. pown() needs to be included.
int i = 0;
Intmod inv() {
if(a == 0) throw "Inverse of zero does not exist.";
if(!i) i = pown(*this, mod - 2).a;
return Intmod(i);
}
Intmod& operator/=(const Intmod b) {return *this *= b.inv();}
Intmod& operator/=(const ll b) {return *this *= Intmod(b).inv();}
template<typename T> Intmod operator/(const T b) const {return Intmod(*this) /= b;}
};
template<const int mod> Intmod<mod> operator+(const ll b, Intmod<mod> a) {return a += b;}
template<const int mod> Intmod<mod> operator-(const ll b, Intmod<mod> a) {return a -= b;}
template<const int mod> Intmod<mod> operator*(const ll b, Intmod<mod> a) {return a *= b;}
template<const int mod> Intmod<mod> operator/(const ll b, Intmod<mod> a) {return a /= b;} //Valid for prime mod.
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
const int MOD = 1000000007;
int t;
cin >> t;
ll n, a, b;
Intmod<MOD> mul1 = 1, mul2 = 1, sab = 0, sab1 = 0, sab2 = 0, ans = 0;
rep(i, t) {
cin >> n >> a >> b;
if(n < a + b) {
printf("0\n");
continue;
}
mul1 = 1;
mul2 = 1;
mul1 *= n - a + 1;
mul1 *= n - b + 1;
mul1 *= 2;
sab = n;
sab -= a;
sab -= b;
sab1 = sab;
sab1 += 1;
sab2 = sab;
sab2 += 2;
mul2 *= sab2;
mul2 *= sab1;
ans = mul1;
ans -= mul2;
ans *= mul2;
printf("%lld\n", ans.a);
}
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define ll int64_t
#define ld long double
#define nl cout<<"\n"
#define all(v) v.begin(),v.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define forn(i,a,b) for(int64_t i=int64_t(a);i<int64_t(b);++i)
#define forb(i,a,b) for(int64_t i=int64_t(a);i>=int64_t(b);--i)
#define fastio() ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mod 1000000007
#define mod2 998244353
#define inf 1000000000000007
#define pi 3.14159265358979323846
template<class L,class R> ostream& operator<<(ostream& out,pair<L,R> &p) {return out<<"("<<p.ff<<", "<<p.ss<<")";}
template<class T> ostream& operator<<(ostream& out,vector<T> &v) {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,deque<T> &v) {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,set<T> &s) {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class L,class R> ostream& operator<<(ostream& out,map<L,R> &m) {out<<"{";for(auto it=m.begin();it!=m.end();++it){if(it!=m.begin())out<<", ";out<<*it;}return out<<"}";}
void dbg_out() {cerr<<"]\n";}
template<typename Head,typename... Tail>
void dbg_out(Head H,Tail... T) {cerr<<H;if(sizeof...(Tail))cerr<<", ";dbg_out(T...);}
#ifdef LOCAL
#define dbg(...) cerr<<"["<<#__VA_ARGS__<<"] = [",dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
ll count_digits(ll n) {ll dig=floor(log10(n)+1);return dig;}
ll mpow(ll x,ll y,ll p) {ll r=1;x=x%p;while(y>0){if(y&1)r=(r*x)%p;y=y>>1;x=(x*x)%p;}return r;}
ll mod_inv(ll a,ll m) {ll m0=m,y=0,x=1;if(m==1)return 0;while(a>1){ll q=a/m,t=m;m=a%m,a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=m0;return x;}
/* const ll MAXN=1000007;ll spf[MAXN+5];vector<ll> prime; */
/* void sieve(ll n) {forn(i,2,MAXN+1)spf[i]=i;for(ll i=2;i*i<=n;i++)if(spf[i]==i)for(ll j=i*i;j<=n;j+=i)if(spf[j]==j)spf[j]=i;forn(i,2,MAXN+1)if(spf[i]==i)prime.push_back(i);} */
//-------------------------------L_I_Erq34-------------------------------
vector<vector<ll>> dp;
vector<ll> cnt,max1;
ll calc(ll i,bool carry)
{
if(i==cnt.size()-1)
return 1;
if(dp[i][carry]!=-1)
return dp[i][carry];
ll r=cnt[i]+carry;
if(r==max1[i])
return dp[i][carry]=calc(i+1,true);
else if(!r)
return dp[i][carry]=calc(i+1,false);
return dp[i][carry]=calc(i+1,true)+calc(i+1,false);
}
int main()
{
fastio();
ll z,n,m,t,k,i,j,l,d,h,r;
cin>>n>>k;
vector<ll> a(n);
for(ll &i:a)
cin>>i;
cnt=max1=vector<ll>(n);
dp=vector<vector<ll>>(n,vector<ll>(2,-1));
r=k;
forb(i,n-1,0)
{
cnt[i]=r/a[i];
r-=a[i]*cnt[i];
if(i<n-1)
max1[i]=a[i+1]/a[i];
}
cout<<calc(0,false)<<"\n";
cerr<<"\nTime elapsed: "<<1000*clock()/CLOCKS_PER_SEC<<"ms\n";
return 0;
}
| #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_REP(__VA_ARGS__, REP3, REP2) (__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2) (__VA_ARGS__)
#define IN(type, n) type n; cin >> n
#define INALL(type, v) REP(i, v.size()) { IN(type, _tmp); v.at(i) = _tmp; }
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
#pragma endregion
int main() {
IN(int, N);
IN(ll, X);
vector<ll> A(N);
vector<ll> max_use(N);
REP(i, N) {
IN(ll, a);
A.at(i) = a;
if (i > 0) max_use.at(i - 1) = a / A.at(i - 1);
}
if (X == A.at(N - 1)) {
cout << "1" << endl;
return 0;
}
vector<map<ll, ll> > dp(N);
dp.at(N - 1)[X - (X / A.at(N - 1)) * A.at(N - 1)]++;
dp.at(N - 1)[X - (X / A.at(N - 1) + 1) * A.at(N - 1)]++;
RREP(i, N - 1) {
for (auto itr = dp.at(i + 1).begin(); itr != dp.at(i + 1).end(); ++itr) {
ll rem = itr->first;
ll amount = rem / A.at(i);
rem -= amount * A.at(i);
if (abs(rem) < A.at(i))
dp.at(i)[rem] += itr->second;
if (abs(amount + 1) < max_use.at(i) && abs(rem - A.at(i)) < A.at(i))
dp.at(i)[rem - A.at(i)] += itr->second;
if (abs(amount - 1) < max_use.at(i) && abs(rem + A.at(i)) < A.at(i))
dp.at(i)[rem + A.at(i)] += itr->second;
}
}
cout << dp.at(0)[0] << endl;
return 0;
}
|
/*********************************************************************************\
* _________ _ _ ________ _ _ __ ________ *
* |___ ___|| | | || ______|| | | | / \ | ____ | *
* | | | | | || |______ | |_____| | / /\ \ | |____| | *
* | | | | | ||______ || _____ | / /__\ \ | __ __| *
* | | | |____| | ______| || | | | / ______ \ | | \ \ *
* |_| |________||________||_| |_| /_/ \_\ |_| \_\ *
* *
* Department of Computer Science & Engineering *
* Student ID : 18CSE035 *
* Bangabnadhu Sheikh Mujibur Rahman Science & Technology University,Gopalgonj. *
* *
\*********************************************************************************/
//Now Write to Code ___________________________
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
inline int Int(){int x; cin >> x; return x;}
inline ll Long(){ll x; cin >> x; return x;}
inline float Float(){float x; cin >> x; return x;}
inline double Double(){double x; cin >> x; return x;}
inline void Yes(){cout << "Yes" << endl;}
inline void No(){cout << "No" << endl;}
inline void YES(){cout << "YES" << endl;}
inline void NO(){cout << "NO" << endl;}
const int N =(int)2e5 + 5;
const int maxN =(int)1e6 + 6;
const ll Mod =(ll)1e9 + 7;
const int inf =(int)2e9;
const ll Inf =(ll)1e18;
#define T int t,q; cin >> t; for(q=1;q<=t;q++)
#define Forn(i,n) for(int i=0;i<n;i++)
#define ForN(i,n) int i;for(i=n-1;n>=0;i--)
#define forn(i,n) for(int i=1;i<=n;i++)
#define forN(i,n) int i;for(i=n;n>=1;i--)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define Sort(s) sort(s.begin(),s.end())
#define debug(x) cerr << #x << " = " << x << '\n' ;
#define rep(i,b,e) for(__typeof(e) i=(b); i!=(e+1)-2*(b>e); i=i+1-2*(b>e))
#define gcd(a,b) __gcd(a , b)
#define lcm(a,b) (a*(b/__gcd(a,b)))
#define gt greater<int>()
#define Int Int()
#define Long Long()
#define Float Float()
#define Double Double()
#define all(x) x.begin() , x.end()
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mem(a) memset(a,0,sizeof a)
#define memn(a) memset(a,-1,sizeof a)
#define biday return 0
#define nl endl
#define sp(n) fixed<<setprecision(n)
#define pi acos(-1)
#define PI 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342
int main()
{
T{
ll n,i,c1=0,c2=0;
cin >> n;
if(n==2)cout << "Same" << endl;
else if(n%2)cout << "Odd" << endl;
else
{
if(n%2==0 && (n/2)%2==0)cout << "Even" << endl;
else cout << "Same" << endl;
}
}
biday;
}
//...............BYE BYE................ | // -- //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5+228;
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll q;
cin >> q;
while(q--){
ll n;
cin >> n;
ll u = n&-n;
ll l = 1, e=0;
while(l<u){
l<<=1;
e++;
}
if(e==0) cout<<"Odd\n";
else if(e==1) cout<<"Same\n";
else cout<<"Even\n";
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll ans = 0;
ll nc = 0;
ll sum = 0;
ll m = 0;
for (int i = 1; i <= n; i++) {
sum = sum + a.at(i - 1);
m = max(m, sum);
ans = max(ans, nc + m);
nc += sum;
}
cout << ans << endl;
return 0;
} | #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()
#define fi first
#define se second
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
ll N, M, K, H, W, A, B, C, D;
string S;
const ll INF = 1LL<<60;
int main(){
cin>>N;
ll res(0);
rep(i, N){
cin>>A>>B;
res += (A + B) * (B - A + 1) / 2;
}
cout<<res<<endl;
}
|
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define pb push_back
#define int long long // Make sure to use ll everywhere while commenting this, to avoid overflow
#define sz(v) (int)v.size()
#define inf 2147483647
#define llinf 9223372036854775807
#define all(v) v.begin(),v.end()
#define bp(n) __builtin_popcountll(n)
#define f(i,l,r) for(long long i=l;i<=r;i++)
#define rf(i,r,l) for(long long i=r;i>=l;i--)
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
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() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
const int N = 16385, mod = 1e9 + 7, bit = 61;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
signed main()
{
fast;
int t = 1;
// cin>>t;
f(tc, 1, t)
{
int n;
cin >> n;
int a[n + 1], b[n + 1], c[n + 1];
map<int, int> mp;
int ans = 0;
f(i, 1, n)
{
cin >> a[i];
}
f(i, 1, n)
{
cin >> b[i];
}
f(i, 1, n)
{
cin >> c[i];
mp[b[c[i]]]++;
}
f(i, 1, n)
{
ans += mp[a[i]];
}
cout << ans << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (Int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(Int i=(n)-1;i>=0;i--)
#define FOR(i,a,b) for(Int i=a;i<=Int(b);i++)
#define __MAGIC__ ios::sync_with_stdio(false);cin.tie(nullptr);
//#include <atcoder/all>
//using namespace atcoder;
typedef long long Int;
const long long INF = 1ll << 60;
using namespace std;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
__MAGIC__
int n; cin >> n;
int A[n], B[n];
rep(i,n)cin >> A[i];
rep(i,n)cin >> B[i];
Int sums = 0;
rep(i,n){
sums += A[i]*B[i];
}
if(sums == 0)cout << "Yes" <<endl;
else cout << "No" <<endl;
// cout << ans << endl;
// cout << (ans ? "Yes" : "No") << endl;
return 0;
} |
/*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x--)
#define endl "\n"
#define timetaken cerr<<"Time : "<<1000*(long double)clock()/(long double)CLOCKS_PER_SEC<<"ms\n"
void zanj0()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int nCr(int n, int r) {
int ret = 1;
for (int i = 1; i <= r; i++) {
ret = ret * (n - i + 1);
ret /= i;
}
return ret;
}
void solve() {
int a, b, k;
cin >> a >> b >> k;
string ret = "";
int n = a + b;
for (int i = 0; i < n; i++) {
int posAfter = n - 1 - i;
int notPutA = nCr(posAfter, b);
if (notPutA < k) {
k -= notPutA;
ret += 'b';
b--;
} else {
ret += 'a';
a--;
}
}
cout << ret << endl;
}
int32_t main()
{
zanj0();
solve();
timetaken;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<long long>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvc = vector<vector<char>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using graph = vector<vector<pair<T, int>>>;// pair of weight and vertex
template<typename T> inline bool chmax(T& a, const T b){if(a < b){ a = b; return true; } return false; }
template<typename T> inline bool chmin(T& a, const T b){if(a > b){ a = b; return true; } return false; }
void my_answer(){
int n;
cin >> n;
vi a(n);
ll rem[200] = {0};
for(auto& x: a){
cin >> x;
++rem[x % 200];
}
ll ans = 0;
for(int i = 0; i < 200; ++i){
if(rem[i] == 0) continue;
ans += (rem[i]*(rem[i]-1LL))/2LL;
}
cout << ans << endl;
}
void best_answer(){
}
int main(){
my_answer();
// best_answer();
}
|
#include<iostream>
using namespace std;
int N_MAX = 10001;
int main()
{
int n,m,i,a,s=0;
bool b[N_MAX];
cin >> n;
fill(b,b+N_MAX,0);
b[6]=1;
b[10]=1;
b[15]=1;
n-=3;
for(i=2;n>0&&i*6<=10000;i++,n--)
b[i*6]=1;
for(i=2;n>0&&i*10<=10000;i++)
if(!b[i*10]){
b[i*10]=1;
n--;
}
for(i=2;n>0&&i*15<=10000;i++)
if(!b[i*15]){
b[i*15]=1;
n--;
}
for(i=1;i<N_MAX;i++)
if(b[i])
cout << i << " ";
cout << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <cstring>
#include <istream>
#include <algorithm>
#include <map>
#include <cmath>
#include <unordered_map>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
b = c;
}
if (b == 0)return a;
else return gcd(b, a % b);
}
bool vis[1000000005];
int main() {
memset(vis, false, sizeof(vis));
int n;
cin >> n;
map<int, int>mp;
vector<int>a(n);
for (auto& i : a)cin >> i;
int min = 0x3F3F3F3F;
for (auto i : a)if (min > i)min = i;
mp[min] = 1;
for (auto i : a) {
for (int j = 1; j * j <= i && j < min; j++) {
int ans = i;
if (i % j == 0 && vis[j] == 0) {
vis[j] = 1;
for (auto k : a) {
if (k % j == 0)ans = gcd(ans, k);
if (ans == j) {
mp[j] = 1; break;
}
}
}
ans = i;
if (i % j == 0 && vis[i / j] == 0 && i / j < min) {
vis[i / j] = 1;
int ccc = i / j;
for (auto k : a) {
if (k % ccc == 0)ans = gcd(ans, k);
if (ans == ccc) {
mp[ccc] = 1; break;
}
}
}
}
}
cout << mp.size() << endl;
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)
#ifndef ONLINE_JUDGE
#define local true;
#endif
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;
}
}
//########################################################################
struct in{
ll len;
string str;
ll num;
};
bool compare(const in& fr, const in& se){
if(fr.len!=se.len) return fr.len<se.len;
else return fr.num>se.num;
}
int solve(){
ll N,M;
cin>>N>>M;
random_device rnd;
mt19937 mt(rnd());
uniform_int_distribution<> pick(0,M-1);
vector<in> dict;
set<string> checker;
in inserter;
rep(i,0,M){
string s;
cin>>s;
if(checker.count(s)==0){
inserter.len=s.size();
inserter.str=s;
inserter.num=1;
checker.insert(s);
dict.push_back(inserter);
}
else {
rep(c,0,dict.size()) if(dict[c].str==s) {dict[c].num++; break;}
}
}
grid<char> res(N,vector<char>(N,'.'));
sort(ALL(dict),compare);
//if(local) for(auto a:dict) cout<<a.str<<" "<<a.num<<endl;
ll iter=0;
for(ll i=0;i<N;++i) {
ll cnt=0;
ll start=0;
while(true) {
rep(j,0,dict[iter].len) {
if(cnt>=N) break;
res[i][start+j]=dict[iter].str[j];
cnt++;
}
iter++;
if(iter>=dict.size()) iter-=dict.size();
start+=dict[iter].len;
if(cnt>=N-1) break;
}
}
uniform_int_distribution<> rand7(0, 7);
vector<char> alpha{'A','B','C','D','E','F','G','H'};
rep(i,0,N) {
rep(j,0,N) {
if(res[i][j]=='.') res[i][j]=alpha[rand7(mt)];
cout<<res[i][j];
}
cout<<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();
}
| #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < ll(n); ++i)
typedef int64_t lint;
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using lb = long double;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define all(x) (x).begin(), (x).end()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define debug(x) cerr << #x << ": " << x << "\n"
#define debugV(x) \
for (int i = 0; i < ((ll)(x).size()); i++) \
cerr << #x << "at:" << i << ": " << x[i] << "\n"
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define O(p) cout << p << "\n", 0
#define OS(p) cout << p << " ", 0
#define ON(p) cout << p, 0
#define INF 1000000000000
#define MOD 1000000007
#define pb emplace_back
#define mp make_pair
#define F first
#define S second
#define CST(x) cout << fixed << setprecision(x)
#define uoset unordered_set
#define vec vector
#define str string
const int dy[4] = {-1, 0, 1, 0};
const int dx[4] = {0, 1, 0, -1}; //^>v<
const string dstr="URDL";
const int Dy[5]={0,-1, 0, 1, 0};
const int Dx[5]={0,0, 1, 0, -1};
struct RandomNumberGenerator
{
mt19937 mt;
RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
int operator()(int a, int b)
{ // [a, b]
uniform_int_distribution<int> dist(a, b);
return dist(mt);
}
int operator()(int b)
{ // [0, b]
return (*this)(0, b);
}
};
struct Timer
{
chrono::high_resolution_clock::time_point st;
Timer() { reset(); }
void reset()
{
st = chrono::high_resolution_clock::now();
}
chrono::milliseconds::rep elapsed()
{
auto ed = chrono::high_resolution_clock::now();
return chrono::duration_cast<chrono::milliseconds>(ed - st).count();
}
};
ll chatoi(char a)
{
string s = "";
s += a;
return stoi(s);
}
//------------------------------------------------------------
ll N,M;
bool comp(const std::string& lh, const std::string& rh) {
// 文字列lhの長さが文字列rhより短かったらtrueを返す
return lh.length() < rh.length();
}
bool write(vec<str> &Mat,int piv,int sta,str &s,bool isX){
if(isX){
rep(i,s.size()){
int x=(sta+i)%N;
if(!(Mat[piv][x]=='.'||Mat[piv][x]==s[i])){
return false;
}
}
}else{
rep(i,s.size()){
int y=(sta+i)%N;
if(!(Mat[y][piv]=='.'||Mat[y][piv]==s[i])){
return false;
}
}
}
if(isX){
rep(i,s.size()){
int x=(sta+i)%N;
Mat[piv][x]=s[i];
}
}else{
rep(i,s.size()){
int y=(sta+i)%N;
Mat[y][piv]=s[i];
}
}
return true;
}
//------------------------------------------------------------
int main()
{
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//--------------------------------------------------------
auto Rand=RandomNumberGenerator();
auto Tim=Timer();
cin>>N>>M;
vec<str> Mat(N,"");
vec<str> S(M);
rep(i,N){
rep(j,N){
Mat[i]+='.';
}
}
rep(i,M){
str s;cin>>s;
S[i]=s;
}
sort(all(S),comp);
int y=0,x=0,Snow=0;
while(Snow!=M){
rep(i,N){
rep(j,N){
if(write(Mat,i,j,S[Snow],true)){
Snow++;
goto A;
}else if(write(Mat,j,i,S[Snow],false)){
Snow++;
goto A;
}
}
}
Snow++;
A:;
if(Tim.elapsed()>2990){
O("ASAS");
break;
}
}
rep(i,N){
O(Mat[i]);
}
return 0;
} |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
#include <bitset>
// #include <atcoder/all>
#include <fstream>
#include <random>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
// using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef int itn;
const ll LINF = 1e16;
const int INF = 1e9;
//マクロ定義
#define vvint(vec,n,m,l) vector<vector<int>> vec(n, vector<int>(m,l)); // lで初期化
#define vvll(vec,n,m,l) vector<vector<ll>> vec(n,vector<ll>(m,l));
#define vint vector<int>
#define pint pair<int,int>
#define rep(i,a) for(ll i=0;i<(a);i++)
#define all(x) (x).begin(),(x).end()
#define debug system("pause") //デバッグ用
#define ret return 0
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
#define ketasitei setprecision(15) //15桁表示
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const long double PI = 3.1415926535897932;
using Graph = vector<vector<ll>>;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << ketasitei;
string s;
cin >> s;
ll ans = 0;
for (int i = 0; i < s.size() - 3; i++)
{
if (s[i] == 'Z' && s[i + 1] == 'O' && s[i + 2] == 'N' && s[i + 3] == 'e')
ans++;
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll ans = 0, cur = 0;
vector<ll> a(n), sum(n+1, 0LL), mx(n+1, 0LL);
rep(i,n){
cin >> a[i];
sum[i+1] = sum[i] + a[i];
mx[i+1] = max(mx[i], sum[i+1]);
}
for(int i = 1; i <= n; ++i){
chmax(ans, cur + mx[i]);
cur += sum[i];
}
chmax(ans, cur);
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
#ifndef DEBUG
#define cerr while(false) cerr
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define priority_queue std::priority_queue
#define F first
#define S second
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
vector<pii>adj[5000005];
char a[2005][2005];
int INF=1e9;
ll dist[5000005];
int get(int x, int y){
if(a[x][y]=='S') return 0;
if(a[x][y]=='G') return 1;
return x*2005+y+2;
}
void dijkstra(int src){
for(int i=0;i<5000005;i++) dist[i]=INF;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
dist[src]=0;
pq.push({0, src});
while(!pq.empty()){
auto [w, x]=pq.top(); pq.pop();
if(dist[x]<w) continue;
for(auto [y, cw]: adj[x]){
if(dist[y]>w+cw){
dist[y]=w+cw;
pq.push({dist[y], y});
}
}
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int h, w;
cin>>h>>w;
for(int i=0;i<h;i++)
for(int j=0;j<w;j++) cin>>a[i][j];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(a[i][j]=='#') continue;
for(int k=0;k<4;k++){
int ci=i+dx[k], cj=j+dy[k];
if(ci>=0 && ci<h && cj>=0 && cj<w && a[ci][cj]!='#'){
//cout<<get(i, j)<<" "<<get(ci, cj)<<" "<<2<<endl;
adj[get(i, j)].push_back({get(ci, cj), 2});
}
}
if(a[i][j]>='a' && a[i][j]<='z'){
int c=4500000+(int)(a[i][j]-'a');
adj[get(i, j)].push_back({c, 1});
adj[c].push_back({get(i, j), 1});
}
}
}
dijkstra(0);
cout<<(dist[1]==INF ? -1 : dist[1]/2)<<endl;
} | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) {rep(_,v.size())cout<<" "<<v[_];cout<<endl;}
#define show2d(v) {rep(__,v.size())show1d(v[__]);}
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vt>vvt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const long double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
vs in(n);
rep(i,n)cin>>in[i];
vvp w(26);
vvi dp(n,vi(m,inf));
vi used(26);
queue<pii>q;
rep(i,n)rep(j,m){
if(in[i][j]=='S'){
dp[i][j]=0;
q.push({i,j});
}
if(islower(in[i][j])){
w[in[i][j]-'a'].pb({i,j});
}
}
while(!q.empty()){
int x=q.front().first;
int y=q.front().second;
q.pop();
if(in[x][y]=='G'){
cout<<dp[x][y]<<endl;
return 0;
}
rep(i,4){
int nx=x+dx[i];
int ny=y+dy[i];
if(nx<0||ny<0||nx>=n||ny>=m)continue;
if(in[nx][ny]=='#')continue;
if(dp[nx][ny]!=inf)continue;
dp[nx][ny]=dp[x][y]+1;
q.push({nx,ny});
}
if(islower(in[x][y])){
int a=in[x][y]-'a';
if(used[a])continue;
rep(j,w[a].size()){
pii ax=w[a][j];
if(dp[ax.first][ax.second]-inf)continue;
dp[ax.first][ax.second]=dp[x][y]+1;
q.push(ax);
}
used[a]=1;
}
}
cout<<-1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tsc=1;
//cin>>tsc;
while(tsc--){
int t,n;
cin>>t>>n;
int a=(n*100+t-1)/(t);
cout<<a+n-1;
cout<<endl;}}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+5;
int main() {
ll t,n;cin>>t>>n;n--;
ll need=n%t+1,start=100*(n/t)+1,last=((100+t)*(start-1)/100);
for(;need;) {
ll now=((100+t)*start/100);
if(now!=last+1) need--;
start++;last=now;
}
cout<<last-1<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
return mod(mod(a)+mod(b));
}
long long mul(long long a, long long b){
return mod(mod(a)*mod(b));
}
ll modPow(ll a, ll b){
if(b==0)
return 1LL;
if(b==1)
return a%M;
ll res=1;
while(b){
if(b%2==1)
res=mul(res,a);
a=mul(a,a);
b=b/2;
}
return res;
}
void solve (){
ll n;
cin>>n;
n=2*n;
ll ans=0;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
ll f1=i;
ll f2=n/i;
if((f2+1-f1)%2==0) ans++;
if(n/i != i){
ll f1=n/i;
ll f2=i;
if((f2+1-f1)%2==0) ans++;
}
}
}
cout<<ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
// freopen("timber_input.txt", "r", stdin);
// freopen("timber_output.txt", "w", stdout);
int t=1;
// cin>>t;
for(int i=1;i<=t;i++){
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define INFF (pow(2,64))
#define def (200007)
#define MOD (1000000007)
typedef int64_t intt;
typedef vector<int> veci;
typedef vector<vector<int>> Veci;
typedef vector<int64_t> vecit;
typedef vector<vector<int64_t>> Vecit;
typedef vector<vector<double>> Vecd;
typedef vector<double> vecd;
typedef pair<intt, intt> P;
typedef unordered_set<int> uset;
typedef unordered_set<intt> usett;
int main(){
intt N;cin>>N;
intt sum=0;
veci allgcd(pow(N,0.5)+1,0);
intt at_n=N;
rep(i,2,pow(N,0.5)+1){
if(N%i==0){
while(at_n%i==0){
allgcd[i]++;
at_n/=i;
}
}
}
intt at_sum=1;
rep(i,3,allgcd.size()){
if(allgcd[i]>=1)at_sum*=(allgcd[i]+1);
}
if(at_n>2)at_sum*=2;
sum+=at_sum;
sum*=2;
cout<<sum<<endl;
} |
#include <iostream>
#include <queue>
using namespace std;
const int DIR_X[2] = {-1, 0};
const int DIR_Y[2] = {0, -1};
int h, w;
int a[2001][2001];
pair<int,int> ans[2001][2001];
bool used[2001][2001];
void calc() {
queue<pair<int, pair<int,int>>> que;
int start = 1;
if ((w+h-2) % 2 != 0) {
start = -1;
}
que.push(make_pair(start, make_pair(w-1,h-1)));
while(que.size()) {
pair<int , pair<int, int>> now = que.front();
que.pop();
int my = now.first;
int nowX = now.second.first;
int nowY = now.second.second;
// cout << nowX << ", " << nowY << endl;
for (int i = 0;i < 2;i++) {
int toX = nowX + DIR_X[i];
int toY = nowY + DIR_Y[i];
if (toX < 0 || toY < 0) continue;
if (used[toX][toY]) {
if (my == 1) {
int ansDiff = ans[toX][toY].second - ans[toX][toY].first;
int nowDiff = ans[nowX][nowY].second - ans[nowX][nowY].first + a[nowX][nowY];
if (nowDiff > ansDiff) {
ans[toX][toY] = ans[nowX][nowY];
ans[toX][toY].second += a[nowX][nowY];
}
} else {
int ansDiff = ans[toX][toY].first - ans[toX][toY].second;
int nowDiff = ans[nowX][nowY].first - ans[nowX][nowY].second + a[nowX][nowY];
if (nowDiff > ansDiff) {
ans[toX][toY] = ans[nowX][nowY];
ans[toX][toY].first += a[nowX][nowY];
}
}
} else {
used[toX][toY] = true;
ans[toX][toY] = ans[nowX][nowY];
if (my == 1) {
ans[toX][toY].second += a[nowX][nowY];
} else {
ans[toX][toY].first += a[nowX][nowY];
}
que.push(make_pair(-my, make_pair(toX, toY)));
}
}
}
// cout << ans[2][2].first << ", " << ans[2][2].second << endl;
// cout << ans[0][0].first << ", " << ans[0][0].second << endl;
if (ans[0][0].first == ans[0][0].second) {
cout << "Draw" << endl;
} else if (ans[0][0].first > ans[0][0].second) {
cout << "Takahashi" << endl;
} else {
cout << "Aoki" << endl;
}
}
int main() {
string str;
cin >> h >> w;
for (int i = 0;i < h;i++) {
cin >> str;
for (int j = 0;j < w;j++) {
if (str[j] == '+') {
a[j][i] = 1;
} else {
a[j][i] = -1;
}
}
}
calc();
return 0;
} | //#include <iostream>
//#include <vector>
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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; }
int main() {
int H, W;
cin >> H >> W;
vector<vector<int>> A(H, vector<int>(W));
char a;
for(int i = 0; i < H; ++i) {
for(int j = 0; j < W; ++j) {
cin >> a;
if(a == '+') A.at(i).at(j) = 1;
else A.at(i).at(j) = -1;
}
}
vector<vector<int>> dp(H+1, vector<int>(W+1, 0));
for(int i = H-1; i >= 0; --i) {
for(int j = W-1; j >= 0; --j) {
// mr. takahashi
if((i + j) % 2 == 0) {
if(i+1 < H && j+1 < W) {
dp.at(i).at(j) = max(dp.at(i+1).at(j) + A.at(i+1).at(j), dp.at(i).at(j+1) + A.at(i).at(j+1));
}
else if(i+1 == H && j+1 < W) {
dp.at(i).at(j) = dp.at(i).at(j+1) + A.at(i).at(j+1);
}
else if(i+1 < H && j+1 == W) {
dp.at(i).at(j) = dp.at(i+1).at(j) + A.at(i+1).at(j);
}
}
else {
if(i+1 < H && j+1 < W) {
dp.at(i).at(j) = min(dp.at(i+1).at(j) - A.at(i+1).at(j), dp.at(i).at(j+1) - A.at(i).at(j+1));
}
else if(i+1 == H && j+1 < W) {
dp.at(i).at(j) = dp.at(i).at(j+1) - A.at(i).at(j+1);
}
else if(i+1 < H && j+1 == W) {
dp.at(i).at(j) = dp.at(i+1).at(j) - A.at(i+1).at(j);
}
}
}
}
if(dp.at(0).at(0) > 0) cout << "Takahashi" << endl;
else if(dp.at(0).at(0) < 0) cout << "Aoki" << endl;
else cout << "Draw" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(size_t i=(l); i<(r); i++)
#define REP(i,n) FOR(i,0,n)
#define endl "\n"
#define debug(x) cout<<x<<endl;
typedef long long ll;
static const ll INF = 1ll<<60;
int main(){
int N,S,D;
cin>>N>>S>>D;
vector<int> X(N),Y(N);
REP(i,N) cin>>X[i]>>Y[i];
bool flag = false;
REP(i,N){
if(X[i] >= S) continue;
if(Y[i] <= D) continue;
flag = true;
}
cout<<(flag ? "Yes" : "No")<<endl;
} | #include <iostream>
using namespace std;
int n;
string s , t;
int a[500010] , cnt;
int main()
{
ios::sync_with_stdio(false);
cin >> n >> s >> t;
for(int i = 0; i < n; i++)
if(s[i] == '1')
a[++cnt] = i;
int temp = 1;
long long ans = 0;
for(int i = 0; i < n; i++)
if(t[i] == '1')
{
while(a[temp] < i && temp <= cnt)
{
if(temp == cnt)
{
cout << -1 << endl;
return 0;
}
ans += a[temp + 1] - a[temp] , temp += 2;
}
if(temp == cnt + 1)
{
cout << -1 << endl;
return 0;
}
ans += a[temp] - i , temp++;
}
while(temp <= cnt)
{
if(temp == cnt)
{
cout << -1 << endl;
return 0;
}
ans += a[temp + 1] - a[temp] , temp += 2;
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int j=6;
if(n==3)
{
cout<<"6 10 15";
return 0;
}
for(int i=0;i<n;i++)
{
cout<<j<<' ';
j++;
while((j%6!=0&&j%10!=0&&j%15!=0))
{
j++;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector <int> ans;
for(int i = 1; i <= 10000; i++)
if(i%6 == 0 || i%10 == 0 || i%15 == 0)
ans.push_back(i);
swap(ans[2] ,ans[3]);
int n;
scanf("%d",&n);
for(int i = 0; i < n; i++)
printf("%d ",ans[i]);
printf("\n");
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype>
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ren(i,a,b) for(int i=a;i>=b;i--)
#define ff first
#define ss second
#define pll pair<long long int,long long int>
#define pii pair<int,int>
#define vll vector<long long int>
#define vii vector<int>
#define gi(n) scanf("%d",&n)
#define gll(n) scanf("%lld",&n)
#define gstr(n) scanf("%s",n)
#define gl(n) cin >> n
#define oi(n) printf("%d",n)
#define oll(n) printf("%lld",n)
#define ostr(n) printf("%s",n)
#define ol(n) cout << n
#define os cout<<" "
#define on cout<<"\n"
#define o2(a,b) cout<<a<<" "<<b
#define all(n) n.begin(),n.end()
#define present(s,x) (s.find(x) != s.end())
#define cpresent(s,x) (find(all(s),x) != s.end())
#define tr(container, it) for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++)
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
typedef vector<vector<ll> > mat;
const int N=2e5+5;
ll a[N],b[N],k[N],t[N],d[N],n,m,x,y;
vector<pll> v[N];
int main()
{ios_base::sync_with_stdio(false);
cin.tie(0);
rep(i,0,N-1)d[i]=1e18+7;
cin>>n>>m>>x>>y;
rep(i,0,m-1)
{
cin>>a[i]>>b[i]>>t[i]>>k[i];
v[a[i]].pb({b[i],i});
v[b[i]].pb({a[i],i});
}
priority_queue<pll> q;
d[x]=0;
q.push({0,x});
while(!q.empty())
{
ll dis=-q.top().ff,at=q.top().ss;
q.pop();
if(dis>d[at])continue;
tr(v[at],it)
{
ll to=it->ff,id=it->ss;
ll dis2=dis+(k[id]-dis%k[id])%k[id]+t[id];
if(dis2<d[to])
{
d[to]=dis2;
q.push({-dis2,to});
}
}
}
if(d[y]<1e17)
{
ol(d[y]);
}
else
{
ol("-1");
}
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define lc (x << 1)
#define rc (x << 1 | 1)
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define vi vector<int>
#define TP template <class o>
#define SZ(a) ((int)a.size())
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 110, S = N * N * N / 2, size = 1 << 20, inf = 2e9;
// char buf[size],*p1=buf,*p2=buf;
template <class o> void qr(o& x) {
char c = gc;
x = 0;
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = gc;
}
while (isdigit(c))
x = x * 10 + c - '0', c = gc;
x *= f;
}
template <class o> void qw(o x) {
if (x / 10)
qw(x / 10);
putchar(x % 10 + '0');
}
template <class o> void pr1(o x) {
if (x < 0)
x = -x, putchar('-');
qw(x);
putchar(' ');
}
template <class o> void pr2(o x) {
if (x < 0)
x = -x, putchar('-');
qw(x);
putchar('\n');
}
int n, k, p, f[N][S], sum[N], s[N], ou[N];
void ad(ll& x, ll y) {
x += y;
if (x >= p)
x -= p;
}
int main() {
qr(n);
qr(k);
qr(p);
f[0][0] = 1;
for (int i = 1; i <= n; i++) {
sum[i] += sum[i - 1] + i * k;
for (int j = 0; j < i; j++)
s[j] = 0;
for (int j = 0; j <= sum[i]; j++) {
int x = j % i;
s[x] = (s[x] + f[i - 1][j]) % p;
if (j - (k + 1) * i >= 0)
s[x] = (s[x] - f[i - 1][j - (k + 1) * i] + p) % p;
f[i][j] = s[x];
}
}
for (int i = 1, j = n; i <= j; i++, j--) {
ll ans = 0;
for (int j = 0; j <= sum[i - 1]; j++)
ad(ans, (ll)f[i - 1][j] * f[n - i][j] % p);
ou[i] = ou[j] = ((ans * (k + 1) + p) - 1) % p;
}
for (int i = 1; i <= n; i++)
pr2(ou[i]);
return 0;
}
|
//
// Created by whq on 2021/2/21.
//
#include <bits/stdc++.h>
#define uset unordered_set
#define umap unordered_map
#define debug cout<<"ok"<<endl
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vvl vector<vector<ll>>
#define vl vector<ll>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define For(i, n) for (int i = 0; i < n; i++)
#define forn(i, a, b) for(int i=a;i<=b;i++)
#define pb(a) push_back(a)
#define all(a) a.begin(),a.end()
#define lowbit(x) x&(-x)
using namespace std;
class A{
public:
void solve(){
ll k;
cin>>k;
ll res=0;
for(ll i=1;i*i*i<=k;i++) res++;
for(ll i=1;i*(i+1)<=k;i++){
for(ll j=i+1;j*i<=k;j++){
if(i*i*j<=k) res+=3;
if(i*j*j<=k) res+=3;
}
}
for(ll i=1;i*(i+1)<=k;i++){
for(ll j=i+1;j*i<=k;j++){
for(ll l=j+1;l*j*i<=k;l++) res+=6;
}
}
cout<<res<<endl;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
A ans;
ans.solve();
return 0;
} | #include <bits/stdc++.h>
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double> ;
using vvd = std::vector<vd> ;
using qi = std::queue<int> ;
using vpii = std::vector<std::pair<int, int> >;
using vpll = std::vector<pll>;
using namespace std;
#define rep(i,j) for(int (i)=0;(i)<(j);(i)++)
#define drep(i,j) for(int (i)=(j);(i) >= 0;(i)--)
template<class T1, class T2> inline void chmin(T1 &a, T2 b){if(a > b) a = b;}
template<class T1, class T2> inline void chmax(T1 &a, T2 b){if(a < b) a = b;}
template<class T> inline void pri(T a){cout << a << endl;}
template<class Z> using vec = vector<Z>;
template<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
inline void IN(void){
return;
}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
cin >> first;
IN(rest...);
return;
}
inline void OUT(void){
cout << endl;
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
cout << first << " " ;
OUT(rest...);
return;
}
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
const int INF = int(1e9);
int n,m,k;
string S;
int ans;
void solve()
{
int n;
IN(n);
int ans = 100 - n %100;
cout << ans << endl;
}
signed main (int argc, char* argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int cases=1;
//IN(cases);
while(cases--)solve();
//pri(ans);
//for(auto c : ans){cout << c << endl;}
//cout << fixed << setprecision(15) << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 200010, mod = 1e9 + 7;
ll dp[N][20], k, num[N];
char s[N];
ll dfs(int pos, bool limit, bool lead, int cnt, ll state){
if(!pos) return cnt == k;
if(cnt > k) return 0;
if(!limit && !lead && ~dp[pos][cnt]) return dp[pos][cnt];
ll ans = 0;
int up = limit ? num[pos] : 15;
for(int i = 0; i <= up; ++ i){
if(lead && !i) ans = (ans + dfs(pos - 1, limit && i == up, true, 0, 0)) % mod;
else{
if((state >> i) & 1) ans = (ans + dfs(pos - 1, limit && i == up, false, cnt, state)) % mod;
else ans = (ans + dfs(pos - 1, limit && i == up, false, cnt + 1, state | (1 << i))) % mod;
}
}
if(!limit && !lead) dp[pos][cnt] = ans;
return ans;
}
ll solve(){
int len = strlen(s + 1);
for(int i = 1, j = len; i < j; ++ i, -- j) swap(s[i], s[j]);
for(int i = 1; i <= len; ++ i){
if(s[i] >= '0' && s[i] <= '9') num[i] = s[i] - '0';
else num[i] = s[i] - 'A' + 10;
}
return dfs(len, true, true, 0, 0);
}
int main(){
scanf("%s", s + 1);
cin >> k;
memset(dp, -1, sizeof dp);
cout << solve();
return 0;
} | //CODE YOUR WAY ;) -->>
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
#define Loopi for(ll i=0;i<n;i++)
#define Loopj for(ll j=0;j<m;j++)
#define LoopLR(l,r) for(ll i=l;i<=r;i++)
#define pb push_back
#define Umap unordered_map<ll,ll> M
#define Omap map<int,int> M;
#define read(a,n) Loopi{ cin>> a[i]; }
#define print(a,n) Loopi{ cout<<a[i]<<" "; }
#define findsum(a,n) Loopi{ sum+=a[i]; }
void Doit()
{
ll n;
cin>>n;
ll a[n];
read(a,n);
ll max=0;
ll min=1000000000000000000;
for(int i=0;i<n;i++)
{
//max=a[i];
min=INT_MAX;
if(min>a[i])
min=a[i];
for(int j=i;j<n;j++)
{
if(min>a[j])
min=a[j];
ll x=min*(j-i+1);
if(max<x)
max=x;
}
}
cout<<max<<endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
// ll t;
// cin>>t;
// while(t--)
// {
Doit();
// }
} |
#include<bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define pi acos(-1.0)
#define mod 1000000007
#define test int t; cin>>t ;while(t--)
typedef long long ll;
using namespace std;
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
double ans;
ans=(1.*b*(c-a))/(d+b);
ans+=a;
printf("%.10lf",ans);
return 0;
}
| #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int sx, sy, gx, gy;
double res, slope;
cin >> sx >> sy >> gx >> gy;
// gのy座標を反転
gy = -gy;
// グラフの傾きの逆数 * -1
slope = -(double)(sx - gx) / (double)(sy - gy);
res = (double)sx + (double)sy * slope;
cout << fixed << setprecision(10) << res << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int Solve(int n, string s)
{
string t = "";
for (int i = 0; i < n; ++i)
{
t += s[i];
if (3 <= t.size())
{
if (t.substr(t.size() - 3, 3) == "fox")
{
for (int i = 0; i < 3; ++i) t.pop_back();
}
}
}
return t.size();
}
int main() {
int n;
string s;
cin >> n >> s;
cout << Solve(n, s) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int a[N];
int b[N];
int c[N];
int k=0;
for(int i=0;i<N;i++)
{
cin>>a[i];
}
for(int i=0;i<N;i++)
{
cin>>b[i];
}
for(int i=0;i<N;i++)
{
c[k]=a[i]*b[i];
k++;
}
int sum=0;
for(int i=0;i<N;i++)
{
sum=sum+c[i];
}
if(sum==0)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
}
|
#include <bits/stdc++.h>
const int N = 2010;
const int INF = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
int t;
int n, m;
char a[N][N];
long long dp[N][N];
long long pre[N][N][3]; // 0: left 1: up 2: diagonal
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", a[i] + 1);
}
dp[1][1] = 1ll;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (a[i][j] == '#') {
continue;
}
if (i - 1 >= 1 && j - 1 >= 1 && a[i][j] != '#') {
dp[i][j] = (dp[i][j] + pre[i - 1][j - 1][2]) % mod;
}
if (i - 1 >= 1 && a[i - 1][j] != '#') {
dp[i][j] = (dp[i][j] + pre[i - 1][j][1]) % mod;
}
if (j - 1 >= 1 && a[i][j - 1] != '#') {
dp[i][j] = (dp[i][j] + pre[i][j - 1][0]) % mod;
}
if (i - 1 >= 1 && j - 1 >= 1 && a[i][j] != '#') {
pre[i][j][2] = (pre[i - 1][j - 1][2] + dp[i][j]) % mod;
} else {
pre[i][j][2] = dp[i][j];
}
if (i - 1 >= 1 && a[i - 1][j] != '#') {
pre[i][j][1] = (pre[i - 1][j][1] + dp[i][j]) % mod;
} else {
pre[i][j][1] = dp[i][j];
}
if (j - 1 >= 1 && a[i][j - 1] != '#') {
pre[i][j][0] = (pre[i][j - 1][0] + dp[i][j]) % mod;
} else {
pre[i][j][0] = dp[i][j];
}
}
}
printf("%lld\n", dp[n][m]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int inf = numeric_limits<int> :: max() / 2;
class dsu {
private:
vector<int> par;
public:
dsu(int N) : par(N) {
iota(par.begin(), par.end(), 0);
}
int find(int x) {
return x == par[x] ? x : par[x] = find(par[x]);
}
bool same(int x, int y) {
return find(x) == find(y);
}
void Union(int x, int y) {
if(same(x, y)) {
return;
}
x = find(x);
y = find(y);
par[x] = y;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
vector<bool> row(n);
vector<bool> col(m);
row[0] = row[n - 1] = true;
col[0] = col[m - 1] = true;
for (int i = 0; i < n; ++i) {
if (s[i][0] == '#' || s[i][m - 1] == '#') {
row[i] = true;
}
}
for (int i = 0; i < m; ++i) {
if (s[0][i] == '#' || s[n - 1][i] == '#') {
col[i] = true;
}
}
int ans = inf;
dsu dsu(n + m);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (s[i][j] == '#') {
dsu.Union(i, j + n);
}
}
}
dsu.Union(0, n - 1);
dsu.Union(n, n + m - 1);
dsu.Union(n - 1, n);
int tc = 0;
for (int i = 0; i < m; ++i) {
bool same = false;
for (int j = i + 1; j < m; ++j) {
if (dsu.same(i + n, j + n)) {
same = true;
}
}
if (!same) {
tc ++;
}
}
int tr = 0;
for (int i = 0; i < n; ++i) {
bool same = false;
for (int j = i + 1; j < n; ++j) {
if (dsu.same(i, j)) {
same = true;
}
}
if (!same) {
tr ++;
}
}
cout << min(tr, tc) - 1 << '\n';
return 0;
}
|
/*
More power comes with more responsibilities.
_.-;;-._.-;;
'-..-'| || |
'-..-'|_.-;;-._|
'-..-'| || |
'-..-'|_.-''-._|
*/
#define SUP ios::sync_with_stdio(0); cin.tie(0);
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define modulo 10000003
#define br "\n"
#define pb push_back
using namespace std;
int main()
{
SUP
int t; cin >> t;
while(t--)
{
int l, r; cin >> l >> r;
ll ans=0;
ans = max(0, (r-l+1)-l);
ans = ans*(ans+1)/2;
cout << ans << br;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i=1; i < (int)(n); i++)
#define rrep(i, n) for (int i=((int)(n)-1); i>=0; i--)
#define rreps(i, n) for (int i=((int)(n)-1); i>0; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using lint = long long;
using p = pair<int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
lint T; cin >> T;
lint l, r;
rep (i, T) {
cin >> l >> r;
if (2*l > r) {
cout << 0 << endl;
continue;
} else {
cout << (r-2*l+2)*(r-2*l+1) / 2 << endl;
continue;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i =0;i<n;++i)
#define reps(i,s,n) for(int i =s;i<n;++i)
using namespace std;
using P = pair<int, int>;
using ll = long long;
//0-indexed
template<class T, T (*op)(T,T), T(*e)()>
class segtree
{
private:
int n;
vector<T> v;
public:
segtree(int n_)
{
int x = 1;
while (n_ > x) x <<= 1;
n = x;
v.resize(2 * n - 1, e());
}
void set(int k, T x)
{
k += n - 1;
v[k] = x;
while (k > 0)
{
k = (k - 1) / 2;
v[k] = op(v[k*2+1],v[k*2+2]);
}
}
T get(int k) { return v[k + n - 1]; }
//[a,b)
T query(int a, int b) { return query_sub(a, b, 0, 0, n); }
T query_sub(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) return e();
if (a <= l && r <= b) return v[k];
T c1 = query_sub(a, b, 2 * k + 1, l, (l + r) / 2);
T c2 = query_sub(a, b, 2 * k + 2, (l + r) / 2, r);
return op(c1,c2);
}
//display segtree value
void display(string text = "segtree value")
{
cout << text << endl;
int cnt = 0;
int end = 1 << cnt;
int l = v.size();
for (int i = 0; i < l; ++i)
{
cout << v[i] << " ";
if (i == end - 1)
{
++cnt;
end += 1<<cnt;
cout << endl;
}
}
cout << endl;
}
};
int op(int a, int b) { return a ^ b; }
int e() { return 0; }
int main()
{
int n,q;
cin >> n >> q;
segtree<int,op,e> sg(n);
rep(i, n)
{
int ai; cin >> ai;
sg.set(i,ai);
}
rep(i, q)
{
int t, x, y;
cin >> t >> x >> y;
--x;
if (t == 1) sg.set(x, op(sg.get(x), y));
else printf("%d\n", sg.query(x,y));
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define deb1(x) cout<<#x<<" :: "<<x<<"\n";
#define deb2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define deb3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
ll mod=1e9+7;
using namespace std;
ll a[1000000],seg[2*1000000];
ll make(ll ind,ll low,ll high){
if(low==high){
seg[ind]=a[low];
return seg[ind];
}
ll mid=(low+high)/2;
ll left=make(2*ind+1,low,mid);
ll right=make(2*ind+2,mid+1,high);
seg[ind]=left^right;
//cout<<ind<<"--"<<seg[ind]<<endl;
return seg[ind];
}
ll query(ll ind,ll low,ll high,ll l, ll r){
if(l<=low && r>=high){
return seg[ind];
}
if(high<l || low>r)return 0;
ll mid=(low+high)/2;
ll left=query(2*ind+1,low,mid,l,r);
ll right=query(2*ind+2,mid+1,high,l,r);
return left^right;
}
ll update(ll ind,ll low,ll high,ll l, ll r){
//cout<<low<<" "<<high<<endl;
if(high<l || low>l){
return seg[ind];
}
if(low==l && high==l){
seg[ind]=seg[ind]^r;
return seg[ind];
}
ll mid=(low+high)/2;
ll left=update(2*ind+1,low,mid,l,r);
ll right=update(2*ind+2,mid+1,high,l,r);
seg[ind]=left^right;
return seg[ind];
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,m,fl=0;
cin>>n>>m;
for(ll i=0;i<n;i++){
cin>>a[i];
}
make(0,0,n-1);
ll s,l,r,u;
for(ll i=0;i<m;i++){
cin>>u>>l>>r;
if(u==1){
update(0,0,n-1,l-1,r);
}
else{
ll ans=query(0,0,n-1,l-1,r-1);
cout<<ans<<endl;
}
}
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define rreps(i, n, s) for (int i = s; i >= n; i--)
using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> p(n);
map<int, int> m;
rep(i, n) {
cin >> p[i];
p[i]--;
m[p[i]] = i;
}
vector<int> res;
vector<bool> done(n, false);
rep(k, n) {
if (m[k] != k) {
while (m[k] != k) {
ll right = m[k];
ll left = right - 1;
if (done[left]) break;
done[left] = true;
swap(p[right], p[left]);
m[p[right]] = right;
m[p[left]] = left;
res.pb(left);
}
}
}
bool ok = true;
rep(i, n - 1) {
if (p[i + 1] < p[i]) {
ok = false;
break;
}
}
if (res.size() != n - 1) { ok = false; }
if (ok) {
for (auto idx : res) cout << idx + 1 << endl;
} else {
cout << -1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
struct BIT {
int N;
VI dat;
BIT(int N):N(N){
dat.resize(N+1,0);
}
ll sum(int k) {
k++;
if(k==0)
return 0;
ll res=0;
for(;k>0;k-=k&-k)
res+=dat[k];
return res;
}
ll sum(int l, int r){
return sum(r)-sum(l-1);
}
void add(int k, ll x) {
k++;
for(;k<=N;k+=k&-k)
dat[k]+=x;
}
int lowerBound(int w) {
if (w<=0) return 0;
int x=0;
int k=1;
while(k*2<=N) k*=2;
for(;k>0;k/=2){
if(x+k<=N&&dat[x+k]<w){
w-=dat[x+k];
x+=k;
}
}
return x;
}
};
int main(){
int n; cin >> n;
VI p(n); REP(i,n) cin >> p[i];
BIT bt(n);
VI a(n,0);
REP(i,n){
a[p[i]-1]=i;
}
set<int> st;
vector<int> ans(0);
bool no=0;
for(int i=n-1;i>=0;i--){
for(int j=a[i]-bt.sum(a[i]);j<i;j++){
if(st.count(j)){
no=1;
break;
}
st.insert(j);
ans.push_back(j);
}
bt.add(a[i],1);
}
if(no||ans.size()!=n-1)
cout << -1 << endl;
else{
REP(i,n-1)
cout << ans[i]+1 << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
template<class T> inline bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
using ll = long long;
int x;
int main () {
cin.tie(0); ios::sync_with_stdio(false);
cin >> x;
cout << 100-x%100 << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define REP_REV(i, a, b) for (ll i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define endl "\n"
#define pb push_back
#define rsz resize
#define f first
#define s second
#define mp make_pair
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using ull = unsigned int64_t;
using pi = pair<int, int>;
using vl = vector<int64_t>;
using pl = pair<int64_t, int64_t>;
using vpl = vector<pair<int64_t, int64_t>>;
using msl = map<string, int64_t>;
using vvl = vector<vector<int64_t>>;
#define DBG1(x) cerr << (#x) << ": " << (x) << endl;
#define DBG2(x, y) cerr << (#x) << " " << (#y) << ": " << (x) << " " << y << endl;
#define DBG3(x, y, z) cerr << (#x) << " " << (#y) << " " << (#z) << ": " << (x) << " " << y << " " << z << endl;
#define DBG4(a, b, c, d) cerr << (#a) << " " << (#b) << " " << (#c) << " " << (#d) << ": " << a << " " << b << " " << c << " " << d << endl;
template <class T>
void DBGvec(vector<T> a) {
for (T i : a) cerr << i << " ";
cerr << endl;
}
template <class T>
void DBGvec_pair(vector<T> a) {
for (T i : a) cerr << "{" << i.f << " " << i.s << "} ";
cerr << endl;
}
template <class K, class P>
void DBGmap(map<K, P> a) {
for (auto i : a) cerr << "{" << i.f << " " << i.s << "} ";
cerr << endl;
}
const ll MOD = 1e9 + 7;
const int INF = int(1e9);
bool isPrime(ll n) {
if (n == 1) return false;
if (n == 2) return true;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
unsigned long long factorial(int n) {
const unsigned int M = MOD;
unsigned long long f = 1;
for (int i = 1; i <= n; i++)
f = (f * i) % M;
return f;
}
ll expon(ll a, ll b, ll m = MOD) {
ll res = 1;
a %= m;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
void solve() {
ll n;
cin >> n;
vl a(n);
vector<bool> t(n);
REP(i, 0, n - 1) {
cin >> a[i];
t[a[i] - 1] = true;
}
REP(i, 0, n - 1) {
if (t[i] == false) {
cout << "No";
return;
}
}
cout << "Yes";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
int tt = clock();
#endif
// freopen("diamond.in", "r", stdin);
// freopen("diamond.out", "w", stdout);
// ll t;
// cin >> t;
// while (t--)
solve();
#ifdef _DEBUG
cerr << "\nTIME = " << clock() - tt << endl;
tt = clock();
#endif
return 0;
} |
//https://atcoder.jp/contests/abc183/tasks/abc183_d
//D - Water Heater
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+4;
long long nums[MAXN];
int main() {
#if 1
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#endif
int n,w;
cin>>n>>w;
for (int i=1; i<=n; i++) {
int s,t,p;
cin>>s>>t>>p;
nums[s] += p;
nums[t] -= p;
}
for (int i=1; i<MAXN; i++) {
nums[i] += nums[i-1];
}
for (int i=0; i<MAXN; i++) {
if (nums[i]>w) {
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
} | # include <bits/stdc++.h>
using namespace std;
# define fori(i,n) for(int i=0;i<n;i++)
# define forl(i,n) for (ll i=0;i<n;i++)
# define pb push_back
# define mp make_pair
# define X first
# define Y second
# define all(v) v.begin(),v.end()
# define sz(a) int((a).size())
# define in_ar_int(arr,n) int arr[n]; fori(i,n) cin >> arr[i];
# define in_ar_ll(arr,n) ll arr[n]; fori(i,n) cin >> arr[i];
# define endl "\n"
# define R0 return 0
# define mod 1000000007
# define pi 3.1415926536
# define fill(a,x) memset(a,x,sizeof(a))
typedef long long ll;
typedef string str;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef map <int,int> mii;
void solve(){
int n; cin >> n;
str s; cin >> s;
int q; cin >> q;
int flag=0;
while (q--){
int a,b,c; cin >> a >> b >> c;
if (a==1){
b=b-1;
c=c-1;
if (flag==1){
b=(b+n)%(2*n);
c=(c+n)%(2*n);
}
int tmp=s[b];
s[b]=s[c];
s[c]=tmp;
}else{
flag=1-flag;
}
}
if (flag==0) cout << s;
else{
for (int i=n;i<2*n;i++){
cout << s[i];
}
for (int i=0;i<n;i++){
cout << s[i];
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int chill=1;
// cin >> chill;
while(chill--){
solve();
}
} |
#include <bits/stdc++.h>
#define inc(l,i,r) for (int i=l;i<=r;i++)
#define dec(r,i,l) for (int i=r;i>=l;i--)
#define SIZE(V) ((int) V.size())
#define pb push_back
#define fi first
#define se second
// #define mp make_pair
#define ___ putchar(10);
#define cnt(x) __builtin_popcount(x)
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 100100, P = 998244353;
int n, tot, d[N], b[N], pri[N];
int main() {
scanf("%d",&n);
d[1] = 1;
for (int i=2;i<=n;i++) {
if (!b[i]) {
pri[++tot] = i;
d[i] = 2;
}
for (int j=1;j<=tot && i*pri[j] <= n;j++) {
b[i*pri[j]] = 1;
d[i*pri[j]] = d[i] + 1;
if (i % pri[j] == 0) break;
}
}
// inc(1,i,n) {
// printf("%d |\t%d\t%d\t%d\n",i,mp[i],cnt[i],d[i]);
// }
inc(1,i,n) printf("%d ",d[i]);
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n;
cin>>n;
ll s=3,t;
repi(a,1,38){
t=5;
repi(b,1,26){
if(s+t>n) break;
if(s+t==n){
cout<<a<<" "<<b;
return 0;
}
t*=5;
}
s*=3;
}
cout<<-1;
} |
#include<bits/stdc++.h>
#define int long long
#define uc getchar()
#define ph putchar
#define R register
#define CN const
#define rint R int
#define cint CN int
#define ps ph(' ')
#define pe ph('\n')
using namespace std;
cint inf=1e9+7;
cint mix=1e6+5;
inline int in();
inline void out(rint x);
int n=in(),ans;
struct nodgd{
int x,id;
inline bool operator<(CN nodgd&ep)CN{
return ep.x<x;
}
} a[mix];
set<int> b;
set<int>::iterator it;
#undef int
int main() {
#define int long long
for(rint i=1;i<=n;++i)
a[i]=(nodgd){in(),n+1-i},b.insert(i);
for(rint i=1;i<=n;++i)
a[n+i]=(nodgd){in(),i};
sort(a+1,a+(n<<1)+1);
for(rint i=1,j=1;i<=n;++i){
while(j<=(n<<1)){
it=b.upper_bound(a[j].id);
if(it!=b.begin())break;
//cerr<<a[j].x<<'\n';
++j;
} ans+=a[j++].x;
b.erase(--it);
} out(ans),pe;
}
inline int in() {
rint x=0;
R bool f=0;
R char s=uc;
while((s<'0'||'9'<s)&&s!='-')s=uc;
if(s=='-')f=1,s=uc;
while('0'<=s&&s<='9')(x*=10)+=s^48,s=uc;
return f?-x:x;
}
inline void out(rint x) {
if(x<0)ph('-'),x=-x;
rint y=x/10;
if(y)out(y);
ph((x-y*10)^48);
} | #include <bits/stdc++.h>
using namespace std;
const int N = 200200;
int n, v[N*2], a[N], b[N];
priority_queue<int,vector<int>,greater<int> > Q;
int main() {
scanf("%d",&n);
for (int i=1;i<=n*2;i++) scanf("%d",v+i);
for (int i=1;i<=n;i++) {
a[i] = max(v[n+1-i],v[n+i]);
b[i] = min(v[n+1-i],v[n+i]);
}
for (int i=1;i<=n;i++) {
if (i != 1) {
if (b[i] > Q.top()) {
Q.pop();
Q.push(b[i]);
}
}
Q.push(a[i]);
}
long long sum = 0;
for (int i=1;i<=n;i++) {
sum += Q.top();
Q.pop();
}
printf("%lld\n", sum);
} |
#include <bits/stdc++.h>
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(V) V.begin(), V.end()
#define L_B lower_bound
#define U_B upper_bound
#define pb push_back
using namespace std;
template<class T, class T1> int chkmin(T &x, const T1 &y) { return x > y ? x = y, 1 : 0; }
template<class T, class T1> int chkmax(T &x, const T1 &y) { return x < y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);
int n;
int a[MAXN];
string s;
void read() {
cin >> n;
cin >> s;
for(int i = 0; i <= n; i++) {
cin >> a[i];
}
}
int val[MAXN];
int rem[MAXN];
bool check(int k) {
for(int i = 0; i <= n; i++) {
val[i] = a[i] / k;
rem[i] = a[i] % k;
if(i == 0) continue;
if(s[i - 1] == '<') {
if(val[i - 1] >= val[i]) {
return false;
}
if(val[i - 1] + 1 == val[i] && rem[i - 1] > rem[i]) {
return false;
}
} else {
if(val[i - 1] <= val[i]) {
return false;
}
if(val[i - 1] - 1 == val[i] && rem[i - 1] < rem[i]) {
return false;
}
}
}
return true;
}
void solve() {
int low = 2, high = (int)1e4 + 1, mid, ret = 1;
while(low <= high) {
mid = (low + high) >> 1;
if(check(mid)) {
ret = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
check(ret);
cout << ret << endl;
for(int j = 0; j < ret; j++) {
for(int i = 0; i <= n; i++) {
int v = a[i] / ret;
if(j < (a[i] % ret)) v++;
cout << v << " ";
}
cout << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
read();
solve();
return 0;
}
| #include<iostream>
#include<cstdio>
#define N 110
using namespace std;
int abs(int x)
{
return x<0?-x:x;
}
char s[N];
int a[N],b[N],c[N];
int main()
{
int n,k=999999999;
scanf("%d",&n);
scanf("%s",s+1);
scanf("%d",&a[1]);
for(int i=2;i<=n+1;++i)
{
scanf("%d",a+i);
k=min(abs(a[i]-a[i-1]),k);
// printf("%d\n",k);
}
printf("%d\n",k);
for(int i=1;i<=k;++i)
{
for(int j=1;j<=n+1;++j)
{
printf("%d ",a[j]/k+ (i<=(a[j]%k)?1:0));
}
printf("\n");
}
return 0;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort(x.rbegin(), x.rend())
#define REVERSE(x) reverse(ALL(x))
#define MAX(x) *max_element(ALL(x))
#define MAXI(x) max_element(ALL(x)) - x.begin()
#define SUM(x) accumulate(ALL(x), 0ll)
#define COUNT(x, y) count(ALL(x), y);
#define ANS cout << ans << "\n"
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define Yes cout << "Yes\n";
#define No cout << "No\n";
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(z, v.size()) cerr << " " << v[z]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
using vp = vector<P>;
using vs = vector<string>;
template <typename T>
inline istream& operator>>(istream& i, vector<T>& v) {
rep(j, v.size()) i >> v[j];
return i;
}
template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
return i >> v.first >> v.second;
}
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
template <class T>
void chmax(T& a, const T& b) {
if (a < b) a = b;
}
template <class T>
void chmin(T& a, const T& b) {
if (b < a) a = b;
}
vvll to;
vp range;
vll dep;
vll points;
ll dfs(ll i, ll s, ll d) {
ll count = 1;
points.pb(i);
for (ll t : to[i]) count += dfs(t, s + count, d + 1);
dep[i] = d;
range[i] = {s, s + count - 1};
return count;
}
signed main() {
init();
ll N;
cin >> N;
vll A(N - 1);
cin >> A;
rep(i, N - 1) A[i]--;
to.resize(N);
range.resize(N);
dep.resize(N);
rep(i, N - 1) to[A[i]].pb(i + 1);
dfs(0, 0, 0);
vector<unordered_map<ll, ll>> x(N);
unordered_map<ll, ll> m;
ll M = 2130;
rep(i, N) {
ll p = points[i];
m[dep[p]]++;
if (i % M == 0) x[i] = m;
}
ll Q;
cin >> Q;
rep(i, Q) {
ll u, d;
cin >> u >> d;
u--;
ll l = range[u].first;
ll r = range[u].second;
ll ans = x[r - r % M][d];
rep(k, r % M) if (dep[points[r - k]] == d) ans++;
if (l != 0) {
l--;
rep(k, l % M) if (dep[points[l - k]] == d) ans--;
ans -= x[l - l % M][d];
}
COUT(ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define long long
#define INF 1e18
// #define lc 2*node+1
// #define rc 2*node+2
const int mod = 1e9 + 7;
const int maxN = 2e5;
int n, q;
struct Query {
int a, b, i;
};
bool cmp(Query a, Query b) {
return a.a < b.a;
}
vector<int> adj[maxN];
Query queries[maxN];
map<int, int> depths[maxN];
int ans[maxN];
// returns the first index at which the value at this position is greater than or equal to val
int search(int val) {
int l = 0, r = q - 1;
while (r > l) {
int mid = (l + r) / 2;
if (queries[mid].a >= val) {
r = mid;
}
else if (queries[mid].a < val) {
l = mid + 1;
}
}
return max(l, 0);
}
// read in all the
void dfs(int node, int depth) {
depths[node][depth] = 1;
for (int next : adj[node]) {
dfs(next, depth + 1);
// now merge the 2 data structures
if (depths[next].size() > depths[node].size()) {
swap(depths[node], depths[next]);
}
for (pair<int, int> it : depths[next]) {
// cout << "here" << endl;
int new_val = depths[node][it.first] + it.second;
depths[node][it.first] = new_val;
}
depths[next].clear();
}
// now we can update all the queries for this node since it is updated
int pos = search(node);
while (pos < q && queries[pos].a == node) {
auto it = depths[node].find(queries[pos].b);
if (it == depths[node].end()) ans[queries[pos].i] = 0;
else {
ans[queries[pos].i] = it->second;
}
pos ++;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("hopscotch.in", "r", stdin);
// freopen("hopscotch.out", "w", stdout);
cin >> n;
// use a map and do small to large merging
int a;
for (int i = 1; i < n; i ++) {
cin >> a; a --;
adj[a].push_back(i);
}
// read in all queries and later when doing the merging we can use it to process
cin >> q;
int b;
for (int i = 0; i < q; i ++) {
cin >> a >> b; a --;
queries[i] = {a, b, i};
}
// sort based on the nodes
sort(queries, queries + q, cmp);
// we don't need to worry about parents anymore
// compute the depths and put it into the maps at each spot
dfs(0, 0);
/*for (pair<int, int> a : depths[0]) {
cout << a.first << ' ' << a.second << endl;
}*/
for (int i = 0; i < q; i ++) {
cout << ans[i] << endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n, q;
int temp1,temp2,temp3;
vector<int> t, a, b;
string s, front, back;
cin >> n;
cin >> s;
front = s.substr(0, n);
back = s.substr(n, n);
cin >> q;
for (int i = 0; i < q; i++) {
cin >> temp1 >> temp2 >> temp3;
t.push_back(temp1);
a.push_back(temp2);
b.push_back(temp3);
}
for (int i = 0; i < q; i++) {
if (t[i] == 1) {
if (a[i] > n) {
char temp = back[a[i] - n - 1];
back[a[i] - n - 1] = back[b[i] - n - 1];
back[b[i] - n - 1] = temp;
}
else {
char temp = front[a[i] - 1];
if (b[i] > n) {
front[a[i] - 1] = back[b[i] - n - 1];
back[b[i] - n - 1] = temp;
}
else {
front[a[i] - 1] = front[b[i] - 1];
front[b[i] - 1] = temp;
}
}
}
else
front.swap(back);
}
cout << front << back << endl;
return 0;
} | // Problem: D - Message from Aliens
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define ld long double
#define endl "\n"
#define pb push_back
#define fill(a,val) memset(a,val,sizeof(a))
#define ff first
#define ss second
#define test ll t; cin>>t; while(t--)
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define loopr(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1000*1000*1000+7;
const ll inf = 1ll*1000*1000*1000*1000*1000*1000 + 7;
const ll mod2 = 998244353;
const ll N = 1000 * 1000 + 10;
const ld pi = 3.141592653589793;
ll power(ll x,ll y,ll p = LLONG_MAX ){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
ll ncr(ll n,ll r,ll m){if(r>n)return 0;ll a=1,b=1,i;for(i=0;i<r;i++){a=(a*n)%m;--n;}while(r){b=(b*r)%m;--r;}return (a*power(b,m-2,m))%m;}
void solve(){
string s;
cin>>s;
vector<char> ans;
for(ll i=0;i<s.length();i++){
if(s[i]!='R'){
if(ans.size() > 0 && ans[ans.size() - 1]==s[i]){
ans.pop_back();
}
else{
ans.pb(s[i]);
}
}
else{
reverse(all(ans));
}
}
for(auto i:ans) cout<<i;
cout<<endl;
}
signed main(){
fastio();
// test
solve();
return 0;
} |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define all(v) (v).begin(),(v).end()
#define all_rev(v) (v).rbegin(),(v).rend()
#define debug(x) cout << #x << ": " << x << '\n';
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll, ll>;
const ll INF = 1LL<<60;
const int MOD = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
//cin.tie(0);ios::sync_with_stdio(false);
//cout << fixed << setprecision(15);
int n;
string s;
cin >> n >> s;
int ans = n;
stack<char> st;
for (int i = 0; i < s.size(); i++) {
st.push(s[i]);
if (st.size() > 2) {
string t = "";
rep (j, 3) {
t += st.top();
st.pop();
}
if (t == "xof") ans -= 3;
else rep (j, 3) st.push(t[2 - j]);
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
//#include <string>
#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
//typedef long double LD;
using namespace std;
//#define MOD 1000000007
//#define MOD 998244353
//#define MAX 100100
//#define NIL -1
//#define INFTY 1000000000000000000
int main(){
LL n;
LL k;
cin >> n >> k;
vector<vector<LL>> t(n, vector<LL>(n));
for(LL i=0; i<n; i++){
for(LL j=0; j<n; j++){
cin >> t[i][j];
}
}
vector<LL> v(n-1);
for(LL i=0; i<n-1; i++){
v[i]=i+1;
}
LL sum_val;
LL ans=0;
do{
sum_val=t[0][v[0]];
for(LL i=0; i<n-2; i++){
//cout << v[i] << endl;
sum_val+=t[v[i]][v[i+1]];
}
sum_val+=t[v[n-2]][0];
//cout << sum_val << endl;
if(sum_val==k){
ans++;
}
}while(next_permutation(v.begin(), v.end()));
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
size_t f(size_t L, size_t N) // a + b = L and 1 <= a, b, <= L の組の数
{
if (L <= N + 1)
{
return (L - 1); // (1, L-1) .. (L-1, 1)
}
else if (2 * N < L)
{
return 0;
}
else
{
return (2 * N - L + 1); // (L-N, N) .. (N, L-N)
}
}
int main()
{
int N, K; // 1 <= a, b, c, d <= N and a + b - c - d = K
cin >> N >> K;
size_t ans = 0;
for (int l = 2; l <= 2 * N; ++l)
{
int m = l - K;
if (m >= 2)
{
ans += f(static_cast<size_t>(l), N) * f(static_cast<size_t>(m), N);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S == "Y") {
for_each(T.begin(), T.end(), [](char& c) { c = toupper(c); });
cout << T << endl;
} else {
cout << T << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <unordered_set>
#include <utility>
using namespace std;
int main() {
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<bool> light(h * w, false), block(h * w, false);
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
light.at(a * w + b) = true;
}
for (int i = 0; i < m; ++i) {
int c, d;
cin >> c >> d;
--c;
--d;
block.at(c * w + d) = true;
}
unordered_set<int> ans;
bool is_shin_f = false, is_shin_r = false;
for (int i = 0; i < h; ++i) {
is_shin_f = false, is_shin_r = false;
for (int j = 0; j < w; ++j) {
int idx_f = i * w + j, idx_r = i * w + w - j - 1;
if (light.at(idx_f)) is_shin_f = true;
if (light.at(idx_r)) is_shin_r = true;
if (block.at(idx_f)) is_shin_f = false;
if (block.at(idx_r)) is_shin_r = false;
if (is_shin_f) ans.insert(idx_f);
if (is_shin_r) ans.insert(idx_r);
}
}
for (int j = 0; j < w; ++j) {
is_shin_f = false, is_shin_r = false;
for (int i = 0; i < h; ++i) {
int idx_f = i * w + j, idx_r = (h - i - 1) * w + j;
if (light.at(idx_f)) is_shin_f = true;
if (light.at(idx_r)) is_shin_r = true;
if (block.at(idx_f)) is_shin_f = false;
if (block.at(idx_r)) is_shin_r = false;
if (is_shin_f) ans.insert(idx_f);
if (is_shin_r) ans.insert(idx_r);
}
}
cout << ans.size() << endl;
return 0;
}
| #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12
//priority_queue<int,vector<int>, greater<int> > q2;
int H, W, N, M;
bool vis[1510][1510];
bool L[1510][1510];//光があるか
bool LL[1510][1510];//光があるか
bool B[1510][1510];//ブロックか
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> H >> W >> N >> M;
REP(i, N) {
int x, y; cin >> x >> y;
x--; y--;
L[x][y] = 1;
LL[x][y] = 1;
}
REP(i, M) {
int x, y; cin >> x >> y;
x--; y--;
B[x][y] = 1;
}
int ans = 0;
REP(i, H) {
FOR(j, 1, W) {
if (L[i][j - 1] && !B[i][j]) {
L[i][j] |= (L[i][j - 1]);
}
}
}
REP(i, H) {
for (int j = W - 2; j >= 0; j--) {
if (L[i][j + 1] && !B[i][j]) {
L[i][j] |= (L[i][j + 1]);
}
}
}
FOR(i, 1, H) {
REP(j, W) {
if (LL[i - 1][j] && !B[i][j]) {
LL[i][j] |= (LL[i - 1][j]);
}
}
}
for (int i = H - 2; i >= 0; i--) {
REP(j, W) {
if (LL[i + 1][j] && !B[i][j]) {
LL[i][j] |= (LL[i + 1][j]);
}
}
}
REP(i, H)REP(j, W) {
if (L[i][j] || LL[i][j])ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int n;
int p[200005];
vector<int> adj[200005];
int q;
pair<pair<int,int>,int> qq[200005];
int dep[200005];
bool vis[200005];
map<int,int> cnt[200005];
int ans[200005];
int dfs(int u) {
if (dep[u] != 0) return dep[u];
else return dep[u] = dfs(p[u]) + 1;
}
void presolve() {
fill(vis, vis + n + 1, 0);
for (int u = 1; u <= n; u++) {
if (adj[u].size() == 0) {
vis[u] = 1;
cnt[u][dep[u]] = 1;
}
}
}
void recur(int u) {
if (vis[u]) return;
vis[u] = 1;
cnt[u][dep[u]] = 1;
for (int v : adj[u]) {
recur(v);
if (cnt[u].size() < cnt[v].size()) {
swap(cnt[u], cnt[v]);
}
for (auto it : cnt[v]) {
cnt[u][it.fi] += it.se;
}
cnt[v].clear();
}
}
int solve(int u, int d) {
recur(u);
if (cnt[u].count(d)) return cnt[u][d];
else return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> p[i];
adj[p[i]].push_back(i);
}
dep[1] = 1;
for (int i = 2; i <= n; i++) {
dfs(i);
}
cin >> q;
for (int i = 0; i < q; i++) {
auto& cur = qq[i];
cin >> cur.fi.fi >> cur.fi.se;
++cur.fi.se;
cur.se = i;
}
sort(qq, qq + q, [&] (auto x, auto y) {
return dep[x.fi.fi] > dep[y.fi.fi];
});
presolve();
for (int i = 0; i < q; i++) {
ans[qq[i].se] = solve(qq[i].fi.fi, qq[i].fi.se);
}
for (int i = 0; i < q; i++) {
cout << ans[i] << "\n";
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ll long long
#define dbwt(x) std::cout << fixed << setprecision(15) << x << '\n'
#define Wt(x) cout << x << '\n'
#define re0 return 0
#define Int(...) int __VA_ARGS__; in(__VA_ARGS__)
#define Ll(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; in(__VA_ARGS__)
#define Vec(t,a,s) vector<t>a(s); in(a)
#define Vec2(t,a,b,s) vector<t>a(s),b(s);rep(i,0,s)in(a[i],b[i])
#define Vec3(t,a,b,c,s) vector<t>a(s),b(s),c(s);rep(i,0,s)in(a[i],b[i],c[i])
#define Vec4(t,a,b,c,d,s) vector<t>a(s),b(s),c(s),d(s);rep(i,0,s) in(a[i],b[i],c[i],d[i])
#define mvec(t,a,i) vector<t>(a,i)
#define mvec2(t,a,b,i) vector<vector<t>>(a,vector<t>(b,i))
void scan(int& x) {std::cin >> x;}
void scan(ll& x) {std::cin >> x;}
void scan(double& x) {std::cin >> x;}
void scan(std::string& x) {std::cin >> x;}
void scan(std::vector<int>& x) {rep (i, 0, x.size()) std::cin >> x[i];}
void scan(std::vector<ll>& x) {rep (i, 0, x.size()) std::cin >> x[i];}
void in(){}
template<class Head, class... Tail>
void in(Head& head, Tail&... tail) {scan(head); in(tail...);}
template<class T, class U>
bool chmax(T& a, U b) {if(a < b){a=b; return true;} return false;}
template<class T, class U>
bool chmin(T& a, U b) {if(a > b){a=b; return true;} return false;}
using namespace std;
template<class T>
using vvec = vector<vector<T>>;
template<class T>
void emitvec(vector<T> a) {rep (i, 0, a.size()) cout << a[i] << " "; cout << endl;}
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
//----------------------------------------------------------------//
int N, M;
map<pair<int, int>, int> mp;
vector<vector<int>> g(100005);
vector<int> col(100005, -1);
vector<bool> visited(100005, false);
void dfs(int v) {
visited[v] = true;
for (int to: g[v]) {
if (visited[to]) continue;
if (col[v] == mp[{v, to}]) {
col[to] = (col[v] == 1 ? N : 1);
}
else {
col[to] = mp[{v, to}];
}
dfs(to);
}
}
int main() {
cin >> N >> M;
Vec3(int, u, v, c, M);
rep (i, 0, M) {
mp[{u[i], v[i]}] = mp[{v[i], u[i]}] = c[i];
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
col[1] = 1;
dfs(1);
rep (i, 1, N + 1) cout << col[i] << endl;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <math.h>
#include <sstream>
#include <iomanip>
#include <numeric>
#define REP(i, n, s) for (int i = (s); i < (int)(n); i++)
#define REP0(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
using namespace std;
ll i, j;
const int MOD = 1000000000 + 7;
const int MOD2 = 998244353;
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD>
struct Fp
{
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD)
{
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept
{
return val ? MOD - val : 0;
}
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept
{
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept
{
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept
{
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept
{
long long a = r.val, b = MOD, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept
{
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept
{
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept
{
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept
{
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD2>;
struct UnionFind
{
//自身が親であれば、その集合に属する頂点数に-1を掛けたもの
//そうでなければ親のid
vector<int> r;
UnionFind(int N)
{
r = vector<int>(N, -1);
}
int root(int x)
{
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y)
{
x--;
y--;
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x)
{
return -r[root(x)];
}
void show()
{
REP0(i, r.size())
{
cout<<r[i]<<" ";
}
cout<<"\n";
}
};
int main()
{
ll x, y, a, b;
ll ans = 0;
cin >> x >> y >> a >> b;
ll kako = x;
while((double)kako * a <= 2e18 && kako * a <= kako + b && kako * a < y){
kako *= a;
ans++;
}
ans += max(0LL,(y-kako-1)/b);
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll x, y, a, b;
int main()
{
ll ans = 0;
cin>>x>>y>>a>>b;
while (1) {
if ((1.0 * a - 1) >= (1.0 * b / x))break;
x = a * x;
if (x >= y)break;
ans ++;
}
ll cnt = max((ll)0, (y - x - 1)) / b;
printf("%lld\n", ans + cnt);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void chmax(ll &x, ll y) {x = max(x,y);}
void chmin(ll &x, ll y) {x = min(x,y);}
void Yes() {cout << "Yes" << endl; exit(0);}
void No() {cout << "No" << endl; exit(0);}
template<class in_Cout> void Cout(in_Cout x) {cout << x << endl; exit(0);}
template<class in_vec_cout>
void vec_cout(vector<in_vec_cout> vec) {
for (in_vec_cout res : vec) {cout << res << " ";}
cout << endl;
}
const ll inf = 1e18;
const ll mod = 1e9 + 7;
using mat = vector<vector<ll>>;
ll N, M, K;
bool G[110][110];
mat A, E;
ll powmodp(ll x, ll n) {
if (n==0) return 1;
if (n%2) return x * powmodp(x,n-1) % mod;
ll res = powmodp(x,n/2);
return res * res % mod;
}
ll inv(ll x) {return powmodp(x,mod-2);}
mat prod(mat x, mat y) {
ll n = x.size();
mat res(n,vector<ll>(N));
rep(i,n) rep(j,N) rep(k,N) {
res[i][j] += x[i][k]*y[k][j]%mod;
res[i][j] %= mod;
}
return res;
}
mat powmat(mat x, ll n) {
if (n==0) return E;
if (n%2) return prod(x,powmat(x,n-1));
mat res = powmat(x,n/2);
return prod(res,res);
}
int main() {
cin >> N >> M >> K;
A.resize(1,vector<ll>(N));
rep(i,N) cin >> A[0][i];
rep(i,M) {
ll x, y; cin >> x >> y;
x--; y--;
G[x][y] = G[y][x] = true;
}
E.resize(N,vector<ll>(N));
rep(i,N) E[i][i] = 1LL;
ll p = inv(M);
ll half = inv(2);
mat f(N,vector<ll>(N));
rep(j,N) {
ll cnt = 0;
rep(i,N) if (G[i][j]) cnt++;
rep(i,N) {
if (i==j) {
ll q = cnt * p % mod;
ll sub = q * half % mod;
f[i][j] = (1 + mod - sub) % mod;
} else if (G[i][j]) {
f[i][j] = p * half % mod;
}
}
}
mat F = powmat(f,K);
mat vec = prod(A,F);
vector<ll> res = vec[0];
for (ll ans : res) cout << ans << endl;
} | #define _USE_MA_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
#include <cassert>
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define REPE(i, n) for (int (i)=0; (i) <= (n); (i)++)
#define CONTAINS_MAP(m, a) ((m).find((a)) != m.end())
#define CONTAINS_SET(m, a) ((m).find((a)) != m.end())
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; exit(0); }
void Yes() { cout << "Yes" << endl; exit(0); }
void No() { cout << "No" << endl; exit(0); }
//----------BIT木 0-index----------
const int BIT_N = 1000010;
int bit_tree[BIT_N];
//[index]にnを追加
void bit_add(int index, int n)
{
for (int x = index; x < BIT_N; x |= x + 1)
{
bit_tree[x] += n;
}
}
//[0, index)の合計
int bit_sum(int index)
{
int ret = 0;
for (int x = index - 1; x >= 0; x = (x & (x + 1)) - 1)
{
ret += bit_tree[x];
}
return ret;
}
int H, W, M;
int X[200001];
int Y[200001];
vector<int> l_list[200001];
vector<int> __list[200001];
vector<int> m;
bool bit_flg[200001];
signed main()
{
cin >> H >> W >> M;
REP(i, M)
{
cin >> Y[i] >> X[i];
X[i]--;
Y[i]--;
}
REP(i, W) l_list[i].push_back(H);
REP(i, H) __list[i].push_back(W);
REP(i, M)
{
l_list[X[i]].push_back(Y[i]);
__list[Y[i]].push_back(X[i]);
}
REP(i, W)
{
SORT(l_list[i]);
}
REP(i, H)
{
SORT(__list[i]);
}
int l_sum = 0;
int __sum = 0;
REP(i, W)
{
if (l_list[i][0] == 0)
{
break;
}
l_sum += l_list[i][0];
}
REP(i, H)
{
if (__list[i][0] == 0)
{
break;
}
__sum += __list[i][0];
}
for (int i = 0; i < W; i++)
{
bit_flg[i] = true;
bit_add(i, 1);
}
int x_sum = 0;
for (int y = 0; y < l_list[0][0]; y++)
{
for (auto p : __list[y])
{
if (bit_flg[p])
{
bit_add(p, -1);
bit_flg[p] = false;
}
}
x_sum += bit_sum(min(__list[y][0], __list[0][0]));
}
cout << l_sum + __sum - x_sum;
}
|
//#pragma GCC target("avx2")
//#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
const ll MOD=1e9+7;
const ll LINF=1e18;
const int INF=0x3f3f3f3f;
const int MAXE=5000050;
const int MAXN=200050;
const int bk_sz=3420;
mt19937 rnd(114514);
map<int,int> visp;
pair<int,int> a[MAXN];
bool vis[MAXN];
void mainwork(int T){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d%d",&a[i].first,&a[i].second);
}
sort(a+1,a+m+1);
visp[n]=1;
for(int i=1,j=1;i<=m;i=j){
while(a[i].first==a[j].first)j++;
for(int k=i;k<j;k++){
vis[k]=visp[a[k].second-1]||visp[a[k].second+1];
}
for(int k=i;k<j;k++){
visp[a[k].second]=vis[k];
}
}
int ans=0;
for(auto i:visp){
ans+=i.second;
}
printf("%d\n",ans);
}
signed main(){
//IOS;
#ifndef ONLINE_JUDGE
freopen("Ranulx.in","r",stdin);
freopen("Ranulx.out","w",stdout);
#endif
int t=1;
//scanf("%d",&t);
for(int i=1;i<=t;i++){
mainwork(i);
}
} | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <sstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define F first
#define S second
#define pb push_back
#define ld long double
#define pll pair<long long,long long>
#define pld pair<long double,long double>
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
ll mod=1000000007;
ll INF = 100000000000000000;
ll gcd (ll a,ll b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
ll modularExp(ll x,ll n,ll mod)
{
ll result=1;
while(n>0)
{
if(n%2==1)
result=(result*x)%mod;
x=((x%mod)*(x%mod))%mod;
n=n/2;
}
return (result)%mod;
}
ll fastExp(ll x,ll n)
{
ll result=1;
while(n>0)
{
if(n%2==1)
result=(result*x);
x=((x)*(x));
n=n/2;
}
return (result);
}
bool isPrime(ll n)
{
for(ll i=2;i*i<=n;i++)
if(n%i==0)
return false;
return true;
}
ll n,k;
map<ll,set<ll> > rows;
map<ll,set<ll> > cols;
vector<pll> v(200005);
map<pll,ll> dp;
set<ll> res;
void recur(ll sx,ll sy)
{
if(dp.find({sx,sy})!=dp.end())
return ;
dp[{sx,sy}]=1;
ll block=INF;
if(cols[sy].upper_bound(sx)==cols[sy].end())
res.insert(sy);
else
{
block=*cols[sy].upper_bound(sx);
}
// cout<<sx<<" "<<sy<<" "<<block<<"\n";
auto it=cols[sy-1].upper_bound(sx);
for( ; it!=cols[sy-1].end();it++)
{
if(*it<=block)
recur(*it,sy-1);
else
break;
}
it = cols[sy+1].upper_bound(sx);
for( ; it!=cols[sy+1].end();it++)
{
if(*it<=block)
recur(*it,sy+1);
else
break;
}
}
void solve()
{
cin>>n>>k;
ll i,j;
for(i=0;i<k;i++)
cin>>v[i].F>>v[i].S;
for(i=0;i<k;i++)
{
rows[v[i].F].insert(v[i].S);
cols[v[i].S].insert(v[i].F);
}
recur(0,n);
cout<<res.size();
}
int main()
{
ios;
int t;
// cin>>t;
t=1;
while(t--)
solve();
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
int arr[n];
int j = 0;
for(int i=0; i<2*n; i++)
{
cin >> s[j] >> arr[j];
j++;
}
int maxi = arr[0];
int m;
for(int i=0; i<n; i++)
{
if(arr[i] >= maxi)
{
m = i;
maxi = arr[i];
}
}
arr[m] = -1;
int maxo = 0;
int maxoi;
for(int i=0; i<n; i++)
{
if(arr[i] >= maxo)
{
maxoi = i;
maxo = arr[i];
}
}
cout << s[maxoi];
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <functional>
#include <set>
#include <math.h>
#include <iomanip>
// int max: 2 x 10^9, long long max: 9 x 10^18
using namespace std;
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
long long sum = 0;
vector<long long> a(n), b(n);
for(int i=0; i<n; i++){
cin >> a[i] >> b[i];
sum += (a[i] + b[i])*(b[i] - a[i] + 1)/2;
}
cout << sum;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < n; ++i)
void Main(){
ll n;
cin >> n;
set<ll> ve;
for(ll i = 1; i * i <= n; ++i){
if(n % i == 0){
ve.insert(i);
ve.insert(n / i);
}
}
for(auto e : ve){
cout << e << endl;
}
}
int main(){
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
vector<ll> enum_div(ll n){//yakusu
vector<ll> ret;
for(ll i=1 ; i*i<=n ; ++i){
if(n%i == 0){
ret.push_back(i);
if(i*i!=n)ret.push_back(n/i);
}
}
return ret;
}
int main(){
ll N;
cin >> N;
auto ans = enum_div(N);
SORT(ans);
for(auto x:ans){
cout << x << endl;
}
}
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vector<vector<int>>;
using field=vector<string>;
using p =pair<int,int>;
int main(){
ll n;
cin>>n;
set<ll> s;
for(ll i=1;i*i<=n;++i){
if(n%i==0){
s.insert(i);
s.insert(n/i);
}
}
for(auto &e:s){
cout<<e<<endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
#define mod 1000000007
#define INF 1e18
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pll pair<ll,ll>
#define plll pair<ll,pair<ll,ll>>
// pb,mp,F,S,MOD,INF should not be used as variable names for any instances...
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void google(int t) {cout << "Case #" << t << ": ";}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
// const int Max=2005;
// vector<ll>edges[Max];
// vector<ll>adj(Max,0);
// check for cases like n=0,n=1 corners which may lead to WA,Costs a lot be careful....
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("Error.txt", "w", stderr);
#endif
ll i,j,t,n,m,k;
cin>>n;
ll ans=INF;
for(i=0;i<=60;i++)
{
ll temp=1ll<<i;
ans=min(ans,i+n/temp+n%temp);
}
cout<<ans<<endl;
return 0;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define out(x) cout << x << '\n'
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define _GLIBCXX_DEBUG
const lli INF = 2147483647;
const lli MINF = -2147483648;
const lli LINF = 9223372036854775807;
const lli MOD = 1000000007; //10^9+7
const double PI = acos(-1);
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define pb push_back
#define eb emplace_back
#define mp make_pair
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vvli = vector<vlli>;
using vs = vector<string>;
using vvs = vector<vs>;
using vb = vector<bool>;
using vvb = vector<vb>;
using ll = long long;
//---------------------------------------------------------------------------------------------------
// vector入力
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
// os << '{';
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
// os << '}';
return os;
}
// aよりもbが大きいならばaをbで更新する(更新されたならばtrueを返す)
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b; // aをbで更新
return true;
}
return false;
}
// aよりもbが小さいならばaをbで更新する(更新されたならばtrueを返す)
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b; // aをbで更新
return true;
}
return false;
}
//---------------------------------------------------------------------------------------------------
//---------------------------------------------------------------------------------------------------
void solve()
{
}
/* divisor(n)
入力：整数 n
出力：nのすべての約数
計算量：O(√n)
*/
vlli divisor(lli n)
{
vlli ret;
for (lli 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;
}
//---------------------------------------------------------------------------------------------------
signed main()
{
lli a = 0, b = 0, c = 0, h = 0, n = 0, w = 0, ans = 0, count = 0;
vector<pair<lli, lli>> pr;
map<lli, lli> ma;
set<lli> st;
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli m, s, p;
cin >> s >> p;
vlli d;
d = divisor(p);
rep(i, 0, d.size())
{
rep(j, 0, d.size())
{
if (d[i] + d[j] == s)
{
out("Yes");
return 0;
}
}
}
out("No");
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(register int i=a;i<=b;i++)
#define req(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
int n,m,l[200010],r[200010];
int main()
{
cin>>n>>m;
if (m==0)
{
rep(i,1,n) printf("%d %d\n",i*3-2,i*3-1);
return 0;
}
if (n-abs(m)<2||m<0) return printf("-1\n"),0;
if (m>0) l[1]=0,r[1]=(abs(m)+1)*4;
rep(i,1,n-1) l[i+1]=i*4-3,r[i+1]=i*4-1;
rep(i,1,n) printf("%d %d\n",l[i]+1,r[i]+1);
return 0;
} |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n;
ll solve(ll m){
if(m >= n) m -= n;
else m += n;
return m;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll q;
string s;
cin >> n >> s >> q;
bool maki = 0;
ll t, a, b;
rep(i, q){
cin >> t >> a >> b;
a--; b--;
if(t == 1){
if(maki) {
a = solve(a);
b = solve(b);
}
swap(s[a], s[b]);
}else{
maki ^= 1;
}
}
if(maki){
cout << s.substr(n, n);
cout << s.substr(0, n) << endl;
}else{
cout << s << endl;
}
return 0;
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD_17 = 1e9 + 7;
const int INF = 1e9 + 1001010;
const double PI = 3.14159265358979;
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
int main(){
int n; string s; cin >> n >> s;
int q; cin >> q;
int t_2 = 0;
for(int i = 0; i < q; i++){
int t, a, b; cin >> t >> a >> b;
if(t == 2){
t_2++;
continue;
}
a--; b--;
if(t_2 %2 == 1){
a = (a+n) % (2*n);
b = (b+n) % (2*n);
}
swap(s[a], s[b]);
}
if(t_2%2 == 1) s = s.substr(n) + s.substr(0,n);
cout << s << endl;
} |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <stdexcept>
#include<math.h>
#include<iomanip>
using namespace std;
using ll=long long ;
#define rep(i,n) for(int i=0;i<(n);i++)
#define f first
#define sc second
const int mod=1'000'000'007;
// UnionFind
// coding: https://youtu.be/TdR816rqc3s?t=726
// comment: https://youtu.be/TdR816rqc3s?t=6822
struct UnionFind {
vector<int> d;
UnionFind(int n=0): d(n,-1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x,y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return find(x) == find(y);}
int size(int x) { return -d[find(x)];}
};
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);
}
string to_oct(int n){
string s;
while(n){
s = std::to_string(n%8) + s;
n /= 8;
}
return s;
}
using Graph=vector<vector<int > >;
using namespace std;
vector<int> c;
vector<bool> seen;
vector<int> num;
vector<int> ans;
void dfs(const Graph &G, int v,int p=-1) {
//seen[v] = true; // v を訪問済にする
num[c[v]]++;
if(num[c[v]]==1)ans.push_back(v);
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if(p==next_v)continue;
if (seen[next_v]) continue; // next_v が探索済だったらスルー
dfs(G, next_v,v); // 再帰的に探索
}
num[c[v]]--;
}
int main(){
int n;
cin>>n;
c=vector<int>(n+1);
rep(i,n){
cin>>c[i+1];
}
Graph g(n+1);
rep(i,n-1){
int a,b;
cin>>a>>b;
g[b].push_back(a);
g[a].push_back(b);
}
seen.assign(n+1,false);
num.assign(1000001,0);
dfs(g,1);
sort(ans.begin(),ans.end());
for(auto a:ans)cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int kN = 1e5 + 10;
int n;
vector<int> g[kN];
int a[kN], cnt[kN];
vector<int> ans;
void Dfs(int u, int fa = 0) {
if(!cnt[a[u]]) ans.push_back(u);
cnt[a[u]]++;
for(int v : g[u]) if(v != fa) Dfs(v, u);
cnt[a[u]]--;
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int i = 1; i < n; i++) {
int x, y; scanf("%d%d", &x, &y);
g[x].push_back(y), g[y].push_back(x);
}
Dfs(1);
sort(ans.begin(), ans.end());
for(int x : ans) printf("%d\n", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define imie(x) cerr << #x << " = " << x << '\n';
#else
#define imie(x)
#endif
void debug(vector<int> v) {
cerr << "[";
int n = (int)v.size();
for(int i = 0; i < n; i++) {
cerr << v[i] << (i == n-1 ? "" : ", ");
}
cerr << "]" << '\n';
}
void setIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);freopen("Error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
}
void test_case() {
int n; cin >> n;
vector< pair<int, int> > p(n), x(n), y(n);
for(int i = 0; i < n; i++) {
cin >> x[i].first >> y[i].first;
x[i].second = i;
y[i].second = i;
p[i] = make_pair(x[i].first, y[i].first);
}
set<int> use;
sort(x.begin(), x.end());
use.insert(x[0].second);
use.insert(x[1].second);
use.insert(x[n-2].second);
use.insert(x[n-1].second);
sort(y.begin(), y.end());
use.insert(y[0].second);
use.insert(y[1].second);
use.insert(y[n-2].second);
use.insert(y[n-1].second);
vector<int> dist;
for(int a : use) {
for(int b : use) {
if(a >= b) continue;
dist.push_back(max(abs(p[a].first - p[b].first), abs(p[a].second - p[b].second)));
}
}
sort(dist.begin(), dist.end(), greater<>());
cout << dist[1] << '\n';
}
int main() {
setIO();
int T;
T = 1;
while(T-- >0) {
test_case();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
ll n;cin>>n;
vector<PP> x(n),y(n);
vp v(n);
rep(i,n){
ll a,b;cin>>a>>b;
x[i]=PP(a,b,i);
y[i]=PP(b,a,i);
v[i]=P(a,b);
}
auto dis=[&](ll i,ll j){
return PP(max(abs(v[i].fi-v[j].fi),abs(v[i].se-v[j].se)),min(i,j),max(i,j));
};
sort(all(x));sort(all(y));
vector<PP> al;
al.pb(dis(get<2>(x[0]),get<2>(x[n-1])));
al.pb(dis(get<2>(x[0]),get<2>(x[n-2])));
al.pb(dis(get<2>(x[1]),get<2>(x[n-1])));
al.pb(dis(get<2>(y[0]),get<2>(y[n-1])));
al.pb(dis(get<2>(y[0]),get<2>(y[n-2])));
al.pb(dis(get<2>(y[1]),get<2>(y[n-1])));
dupli(al);
reverse(all(al));
out(get<0>(al[1]));
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll X,Y,ans,LCM;
ll x,y,p,q,i,j;
void Gcd(ll A,ll B,ll &gcd)
{
if(B){Gcd(B,A%B,gcd);ll t=X;X=Y;Y=t-(A/B)*Y;}
else {gcd=A;X=1,Y=0;}
}
ll f(ll a,ll b,ll mod)
{
ll k=0;
while(b)
{
if(b&1) k=(k+a)%mod;
a=(a+a)%mod;
b>>=1;
}
return k;
}
void exgcd(ll A,ll B,ll C){
ll gcd;
Gcd(A,B,gcd);
if(C%gcd) return;
else{
//if(C/gcd<0)
//X=f(X,((C/gcd)%LCM+LCM)%LCM,LCM);
X=X*(C/gcd);
if(X<0) X=(LCM-(-X)%LCM)%LCM;
//ll res=((f(X,2*x+2*y,LCM)+i)%LCM+LCM)%LCM;
ans=min(ans,(f(2*x+2*y,X,LCM)+i)%LCM);
}
}
int main() {
int t;
cin>>t;
while(t--){
ans=INT64_MAX;
cin>>x>>y>>p>>q;
LCM=(2*x+2*y)/__gcd(2*x+2*y,p+q)*(p+q);
for(i=x;i<x+y;i++){
for(j=p;j<p+q;j++){
exgcd(2*x+2*y,-p-q,j-i);
}
}
if(ans==INT64_MAX) printf("infinity\n");
else cout<<ans<<endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define int long long
template<typename T>
void dbg_a(T *a,int l,int r){cout<<" {";for(int i = l;i<r;i++) cout<<a[i]<<", ";cout<<a[r]<<"}"<<endl;}
typedef long long ll;
template<typename T = int>
inline T read(){
T f = 1,r = 0;
char c = getchar();
while(c<'0'||c>'9'){if(c == '-') f = -1; c = getchar();}
while(c>='0'&&c<='9'){ r = (r<<1) + (r<<3) + c - '0';c = getchar();}
return f*r;
}
typedef pair<int,int> PII;
#define fi first
#define se second
#define mst(a,b) memset(a,b,sizeof(a))
#define For(i,a,b) for(int i = a;i<=b;i++)
#define For_(i,a,b) for(int i = a;i>=b;i--)
#define _for(i,a) for(int i = 0;i<a;i++)
#define All(x) x.begin(),x.end()
// For(i,1,n) For(j,1,m) printf("f[%lld][%lld] = %lld\n",i,j,f[i][j]);
const int N = 2e5 + 10,M = 2*N + 10,INF = 0x3f3f3f3f;
const int mod = 998244353;
int h[N],ne[M],e[M],idx;
void add(int a,int b){
e[++idx] = b;ne[idx] = h[a];h[a] = idx;
}
int exgcd(int a,int b,int &x,int &y){
int d = a;
if(b){ d = exgcd(b, a%b, y, x);y -= (a/b)*x;}
else{x = 1;y = 0;}
return d;
}
int inv(int a,int mo){
int x,y;
int d = exgcd(a,mo,x,y);
return d == 1 ? (x + mo)%mo : -1;//-1表示不存在，并对逆元调整
}
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
bool merge(int a1,int m1,int a2,int m2,int &A,int &mo){
int c = (a2 - a1),d = gcd(m1,m2);
if(c % d) return 0;//gcd(m1,m2)|(a2 - a1)时才有解
c = (c%m2 + m2)%m2;//将c变为[0,m2)之间的数
c /= d;m1 /= d;m2 /= d;//两边除以d
c = c*inv(m1,m2) % m2;//将m1/d 移到右边
mo = m1*m2*d;// mo = m1 * m2 /d
A = (c*m1%mo*d%mo + a1)%mo;
return 1;
}
int EXCRT(int n,int a[],int mo[]){
int a1 = a[1],m1 = mo[1],A,Mo;
for(int i = 2;i<=n;i++){
if(!merge(a1,m1,a[i],mo[i],A,Mo)) return -1;//不合法
a1 = A;m1 = Mo;
}
return (a1 + m1)%m1;
}
int n;
void solve(){
int x,y,p,q;
cin>>x>>y>>p>>q;
int a[3] = {},mo[3] = {};
int ans = 3e18;
For(i,x,x+y-1){
For(j,p,p+q-1){
a[1] = i,mo[1] = 2*(x+y);
a[2] = j,mo[2] = p + q;
int res = EXCRT(2,a,mo);
if(res == -1) continue;
ans = min(res,ans);
}
}
if(ans == 3e18)cout<<"infinity"<<"\n";
else cout<<ans<<"\n";
}
signed main(){
int T = 1;
T = read();
while(T--) solve();
system("pause");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_YESNO(x) (WRITE_N((x) ? "Yes" : "No"))
#define PRECISE_COUT std::cout << std::setprecision(15) << std::fixed
bool xor_logic(bool x, bool y) { return (x && y) || (!x && !y); }
struct State {
int last = 0;
ll sum_time = 0;
set<int> unseen;
};
int solve(int N, ll K, std::vector<std::vector<ll>>&T) {
int retv = 0;
stack<State> dfs;
State init_state;
for (size_t i = 1; i < N; i++) {
init_state.unseen.insert(i);
}
dfs.push(init_state);
while (!dfs.empty()) {
State search = dfs.top();
dfs.pop();
if (search.unseen.empty()) {
int sum_time = search.sum_time + T[search.last][0];
if (sum_time == K) {
retv++;
}
} else {
for (auto &&i : search.unseen) {
State new_state;
new_state.last = i;
new_state.sum_time = search.sum_time + T[search.last][new_state.last];
new_state.unseen = search.unseen;
new_state.unseen.erase(i);
dfs.push(new_state);
}
}
}
return retv;
}
int main() {
// get values from input
cin.tie(0);
ios::sync_with_stdio(false);
int N;
ll K;
cin >> N >> K;
std::vector<std::vector<ll>> T(N, std::vector<ll>(N, 0));
for (size_t i = 0; i < N; i++) {
for (size_t j = 0; j < N; j++) {
cin >> T[i][j];
}
}
// main procedure
int ans = solve(N, K, T);
// output
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define sec second
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
if(nega==-1) return -ans;
return ans;
}
typedef pair<int,int> pii;
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
inline int add(int x,int y) {return x+y>=mod?x+y-mod:x+y;}
inline int add(int x,int y,int z) {return add(add(x,y),z);}
inline int sub(int x,int y) {return x-y<0?x-y+mod:x-y;}
inline int mul(int x,int y) {return 1LL*x*y%mod;}
inline int mul(int x,int y,int z) {return mul(mul(x,y),z);}
#define N 200005
int a[N],pw[N],val[305],n,k;
int fac[N],inv[N],ifac[N];
const int i2=(mod+1)/2;
void init()
{
fac[0]=1; for(int i=1;i<N;i++) fac[i]=mul(fac[i-1],i);
inv[0]=inv[1]=1; for(int i=2;i<N;i++) inv[i]=mul(mod-mod/i,inv[mod%i]);
ifac[0]=1; for(int i=1;i<N;i++) ifac[i]=mul(ifac[i-1],inv[i]);
}
int C(int x,int y){return x>=y?mul(fac[x],ifac[x-y],ifac[y]):0;}
signed main()
{
// cout<<sizeof(pw)/1024.0/1024.0<<endl;
cin>>n>>k; init();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=n;i++) pw[i]=1;
val[0]=n;
for(int j=1;j<=k;j++)
{
for(int i=1;i<=n;i++) pw[i]=mul(pw[i],a[i]);
for(int i=1;i<=n;i++) val[j]=add(val[j],pw[i]);
}
for(int i=1;i<=n;i++) pw[i]=1;
for(int i=1;i<=k;i++)
{
int ans=0;
for(int j=0;j<=i;j++)
{
int tmp=mul(val[j],val[i-j]);
ans=add(ans,mul(tmp,C(i,j)));
}
for(int j=1;j<=n;j++) pw[j]=mul(pw[j],a[j]+a[j]);
for(int j=1;j<=n;j++) ans=sub(ans,pw[j]);
ans=mul(ans,i2);
printf("%d\n",ans);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int x, y;
bool m[3] = { 0, 0, 0 };
cin >> x >> y;
m[x] = m[y] = true;
if(x == y) cout << x << '\n';
else {
for(int i = 0; i < 3; ++i) {
if(!m[i]) {
cout << i << '\n';
break;
}
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int T;
cin >> T;
rep(i, T){
long long N;
cin >> N;
if (N%2 == 0){
if (N%4 == 0) cout << "Even" << endl;
else cout << "Same" << endl;
}
else cout << "Odd" << endl;
}
} |
#include <bits/stdc++.h>
#define int unsigned long long
using namespace std;
int x, y, a, b;
signed main() {
cin >> x >> y >> a >> b;
int cnt = 0;
while(x < y) {
if(x*a - x < b) x = x*a, cnt++;
else {
int k = (y-x)/b;
cnt += k;
x += k*b;
if(x < y) { x += b; cnt++; }
break;
}
}
cout << cnt-1 << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
/***typededfs***/
typedef long long ll;
typedef long double ldb;
/***defines***/
#define M1 1000000007
#define M2 998244353
#define F first
#define S second
#define pb push_back
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define forz(i,n) for(int i=0;i<(n);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define rforz(i,n) for(int i=(n-1);i>=0;i--)
#define rfore(i,a,b) for(int i=(a);i>=(b);i--)
#define test int T; cin>>T; while(T--)
#define all(v) v.begin(),v.end()
#define mm(a,b) ((a%M1)*(b%M1))%M1
#define ma(a,b) ((a%M1)+(b%M1))%M1
void io(){
FASTIO;
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
int main(){
io();
ll x,y,a,b;
cin>>x>>y>>a>>b;
ll cnt{};
while(x<=(b-1)/a&&x*a<y){
x*=a;
cnt++;
}
if(y-x-1>=0)
cnt+=(y-x-1)/b;
cout<<cnt<<'\n';
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,counter=0;
cin >> H >> W;
vector<string> S(H);
for(int i=0;i<H;i++){
cin >> S[i];
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(j != W-1){
if(S[i].at(j) == '.' && S[i].at(j+1) == '.' ){
counter++;
}
}
if(i != H-1){
if(S[i].at(j) == '.' && S[i+1].at(j) == '.'){
counter++;
}
}
}
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr int MAX = 1510;
int board[MAX][MAX]; //+1:light bulb, 0:normal cell -1:block
bool rl[MAX][MAX], rr[MAX][MAX], cl[MAX][MAX], cr[MAX][MAX];
int main()
{
int h, w, n, m;
std::cin >> h >> w >> n >> m;
rep(i, n)
{
int x, y;
std::cin >> x >> y;
board[x][y] = 1;
}
rep(i, m)
{
int x, y;
std::cin >> x >> y;
board[x][y] = -1;
}
for (int i = 1; i <= h; ++i)
{
for (int j = 1; j <= w; ++j)
{
if (board[i][j] == -1)
continue;
if (board[i][j] == 1)
{
rl[i][j] = 1;
}
else
rl[i][j] = rl[i][j - 1];
}
for (int j = w; j >= 1; --j)
{
if (board[i][j] == -1)
continue;
if (board[i][j] == 1)
{
rr[i][j] = 1;
}
else
rr[i][j] = rr[i][j + 1];
}
}
for (int j = 1; j <= w; ++j)
{
for (int i = 1; i <= h; ++i)
{
if (board[i][j] == -1)
continue;
if (board[i][j] == 1)
{
cl[i][j] = 1;
}
else
cl[i][j] = cl[i - 1][j];
}
for (int i = h; i >= 1; --i)
{
if (board[i][j] == -1)
continue;
if (board[i][j] == 1)
{
cr[i][j] = 1;
}
else
cr[i][j] = cr[i + 1][j];
}
}
int ans = 0;
for (int i = 1; i <= h; ++i)
{
for (int j = 1; j <= w; ++j)
{
if (rl[i][j] || rr[i][j] || cl[i][j] || cr[i][j])
++ans;
}
}
std::cout << ans << std::endl;
return 0;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b){a=max(a,b);}
void rd(int&x){scanf("%i",&x);}
void rd(ll&x){scanf("%lld",&x);}
void rd(char*x){scanf("%s",x);}
void rd(ldb&x){scanf("%lf",&x);}
void rd(string&x){scanf("%s",&x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&i:x)rd(i);}
template<typename T,typename...A>void rd(T&x,A&...args){rd(x);rd(args...);}
template<typename T>void rd(){T x;rd(x);return x;}
int ri(){int x;rd(x);return x;}
template<typename T>vector<T> rv(int n){vector<T> x(n);rd(x);return x;}
template<typename T>void ra(T a[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]);}
template<typename T1,typename T2>void ra(T1 a[],T2 b[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]),rd(b[st+i]);}
template<typename T1,typename T2,typename T3>void ra(T1 a[],T2 b[],T3 c[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]),rd(b[st+i]),rd(c[st+i]);}
void re(vector<int> E[],int m,bool dir=0){for(int i=0,u,v;i<m;++i){rd(u,v);E[u].pb(v);if(!dir)E[v].pb(u);}}
template<typename T>void re(vector<pair<int,T>> E[],int m,bool dir=0){for(int i=0,u,v;i<m;++i){T w;rd(u,v,w);E[u].pb({v,w});if(!dir)E[v].pb({u,w});}}
const int N=200050;
const int inf=1e9+7;
int lim;
vector<int> E[N];
int now;
pii DFS(int u,int p){
//int fir=-inf,sec=-inf;
int mn=inf,fir=-inf;
int mx1=0,mx2=0;
for(int v:E[u]){
if(v!=p){
pii d=DFS(v,u);
d.first+=1;
d.second+=1;
ckmn(mn,d.first);
//if(d.first>fir)sec=fir,fir=d.first;
//else ckmx(sec,d.first);
ckmx(mx1,d.second);
}
}
//if(fir+sec>lim*2+1||max(fir,1)+mx1>lim){
if((mx1>=lim)){
//printf("%i ",u);
now++;
return {0,-inf};
}else{
//if(fir>0)return {fir,-inf};
//return {inf,mx1};
if(mn<inf&&mn+mx1<=lim)return {mn,-inf};
if(p==0)now++;
return {mn,mx1};
}
}
int Solve(){
now=0;
//printf("%i: ",lim);
DFS(1,0);
//printf("\n");
return max(now,1);
}
int main(){
int n,k;rd(n,k);
re(E,n-1);
int top=n,bot=0,ans=n;
while(top>=bot){
int mid=top+bot>>1;
lim=mid;
if(Solve()<=k)top=mid-1,ans=mid;
else bot=mid+1;
}
printf("%i\n",ans);
return 0;
}
| #include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
const int maxn=2e5+10;
struct Node{
int x;
int y;
friend bool operator < (const Node &a,const Node &b){
return a.x<b.x;
}
}a[maxn];
vector<int> ve[maxn];
vector<int> bj[maxn];
map<int,int> mp;
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=k;i++)
scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+1+k);
int cnt=0;
for(int i=1;i<=k;i++){
if(a[i].x!=a[i-1].x)
cnt++;
ve[cnt].push_back(a[i].y);
}
mp[n]=1;
for(int i=1;i<=cnt;i++){
for(int j=0;j<ve[i].size();j++){
if(mp[ve[i][j]-1]||mp[ve[i][j]+1])
bj[i].push_back(1);
else
bj[i].push_back(0);
}
for(int j=0;j<ve[i].size();j++){
if(bj[i][j])
mp[ve[i][j]]=1;
else
mp[ve[i][j]]=0;
}
}
int ans=0;
for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
if(it->second)
ans++;
printf("%d",ans);
return 0;
} |
#include<bits/stdc++.h>
#define input freopen("input.txt", "r", stdin)
#define output freopen("output.txt", "w", stdout)
#define sc(a) scanf("%lld",&a)
#define pr(a) printf("%lld\n",a)
#define ll long long
#define vll vector<ll>
#define pb push_back
#define srt(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define inf 0x3f3f3f3f3f3f3f3fLL
#define mxn 1000005
#define mod 1000000007
#define pi acos(-1)
#define yes printf("YES\n")
#define no printf("NO\n")
#define r0 return 0
using namespace std;
string mirror="AHIMOTUVWXY";
string letter= "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main()
{
ll n,m,i,j,k,x,y,t;
string s;
cin>>s;
ll f=0;
n=s.size();
for(i=0;i<n;i+=2){
if(s[i]>='a' && s[i]<='z')continue;
f=1;
}
for(i=1;i<n;i+=2){
if(s[i]>='A' && s[i]<='Z')continue;
f=1;
}
if(f)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
string s, ans = "Yes";
cin >> s;
for (int i = 0; i < s.size(); i++)
{
if (i % 2 == 0)
{
if (s.at(i) <= 'Z')
ans = "No";
}
else
{
if (s.at(i) > 'Z')
ans = "No";
}
}
cout << ans << endl;
} |
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define fo(i,n) for(int i=0;i<(n);i++)
#define inp(a) int a;cin>>a;
#define inpa(a,n)vector<int> a(n);fo(i,n)cin>>a[i];
#define printclock cerr<<"Time : "<<1000*(ld)clock()/(ld)CLOCKS_PER_SEC<<"ms\n";
using namespace std;
#define int ll
// #define MAX 20
#define INF (int)1e18
template<class T> ostream& operator<<(ostream& cout,vector<T> V)
{cout<<"[ ";for(auto v:V)cout<<v<<' ';return cout<<']';}
template<class L,class R> ostream& operator<<(ostream& cout,pair<L, R> P)
{return cout<<'('<<P.F<<','<< P.S<<')';}
signed main()
{
fio
inp(n) inp(k) inp(mod)
vector<int> posl={1}, posr={1};
// TODO
for(int i=1;i<=n;i++)
{
vector<int> tposr(posr.size()+i*k), rem(i);
fo(j,posr.size()+i*k)
{
if(j<posr.size())
{
rem[j%i]+=posr[j];
rem[j%i]%=mod;
}
tposr[j]=rem[j%i];
if(j-i*k>=0)
{
rem[j%i]-=posr[j-i*k];
rem[j%i]%=mod;
}
}
swap(posr,tposr);
// cout<<posr<<endl;
}
vector<int> fans(n/2+n%2);
for(int i=1;i<=n/2+n%2;i++)
{
int x=n-i+1;
vector<int> rem(x);
fo(j,posr.size())
{
posr[j]=posr[j]-rem[j%x];
posr[j]%=mod;
rem[j%x]+=posr[j];
rem[j%x]%=mod;
if(j-x*k>=0)
rem[j%x]-=posr[j-x*k];
rem[j%x]%=mod;
}
// cerr<<posl<<'\n';
// cout<<posr<<"\n\n";
int ans=0;
fo(j,min(posr.size(),posl.size()))
ans=(ans+((int)posl[j]*posr[j])%mod)%mod;
vector<int> tposl(posl.size()+i*k);
rem.clear();
rem.resize(i);
fo(j,posl.size()+i*k)
{
if(j<posl.size())
{
rem[j%i]+=posl[j];
rem[j%i]%=mod;
}
tposl[j]=rem[j%i];
if(j-i*k>=0)
{
rem[j%i]-=posl[j-i*k];
rem[j%i]%=mod;
}
}
swap(posl,tposl);
int ftans=((ans*(k+1))%mod-1)%mod;
if(ftans<0)
ftans+=mod;
fans[i-1]=ftans;
}
int ind=n/2-1;
while(ind>=0)
{
fans.push_back(fans[ind]);
ind--;
}
// cout<<fans.size()<<endl;
assert(fans.size()==n);
for(int i:fans)
cout<<i<<'\n';
printclock;
} | // author : lynmisakura
// Last Modified: 2020-10-04T12:59:37
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0;i < n;i++)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define dup(x,y) (x + y - 1) / (y)
#define all(x) (x).begin(),(x).end()
template<class T> bool chmax(T& a,T b){ if(a < b){ a = b; return true; }else return false; }
template<class T> bool chmin(T& a,T b){ if(a > b){ a = b; return true; }else return false; }
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
using vpi = vector<Pi>;
using vpl = vector<Pl>;
#define debug(arr) cout << #arr << " = " << arr << '\n'
#define debug2(a,b) cout << "[" << #a << "," << #b << "] = " << "[" << a << "," << b << "]" << '\n'
template<class T> ostream &operator << (ostream& out, const vector<T>& arr) {
cout << "{"; for (int i = 0; i < arr.size(); i++)cout << (!i ? "" : ", ") << arr[i]; cout << "}";
return out;
}
template<class T> ostream &operator << (ostream& out, const vector<vector<T> >& arr) {
cout << "{\n"; for (auto& vec : arr)cout << " " << vec << ",\n"; cout << "}";
return out;
}
template<class S,class T> ostream &operator << (ostream& out, const pair<S,T>& p){
cout << "{" << p.first << "," << p.second << "}" << '\n';
return out;
}
template<class T> istream &operator >> (istream& in, vector<T>& arr) {
for (auto& i : arr)cin >> i; return in;
}
template<class T> T read(){
T val;cin >> val; return val;
}
/////////////////////////////////////////////////////////////////////////
int mod = 998244353;
struct mint {
long long x; // typedef long long ll;
mint(long long x=0):x((x%mod+mod)%mod){}
mint& operator+=(const mint a) { if((x+=a.x)>=mod)x-=mod;return *this;}
mint& operator-=(const mint a) { if((x+=mod-a.x)>=mod)x-=mod; return *this;}
mint& operator*=(const mint a) { (x *=a.x)%=mod; return *this;}
mint operator+(const mint a) const { mint res(*this);return res+=a;}
mint operator-(const mint a) const { mint res(*this);return res-=a;}
mint operator*(const mint a) const { mint res(*this);return res*=a;}
mint pow(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();}
};
const int maxn = 100;
mint dp[maxn+10][maxn*(maxn+1)*maxn/2+10];
int N,K;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
//cout << fixed << setprecision(20);
cin >> N >> K >> mod;
int MAX = N*(N+1)*K/2;
// 前計算
dp[0][0] = 1;
for(int i = 1;i <= N;i++){
// dp[i-1][] について、mod iでの和を管理する
vector<mint> R(i+1,0);
for(int j = 0;j <= MAX;j++){
R[j % i] += dp[i-1][j];
if(j - (K+1)*i >= 0) R[j % i] -= dp[i-1][j - (K+1)*i];
dp[i][j] += R[j % i];
}
}
for(int i = 1;i <= N;i++){
int l = i - 1;
int r = N - i;
mint res = 0;
for(int j = 0;j <= MAX;j++){
res += (j == 0 ? (mint)K : (mint)(K+1))*dp[l][j] * dp[r][j];
}
cout << res.x << '\n';
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include<vector>
#include <algorithm>
#include <queue>
#include<string>
#include <map>
#include <cmath>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <utility>
#include <set>
#include <bitset>
typedef long long ll;
typedef long double ld;
#define PI 3.14159265358979323846
#define REP(i,s,n)for(ll i=s;i<(n);++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
string S;
ll N, M;
vector<string>A;
int Bingo[3][3] = {};
int main() {
cin >> N>>M;
ll maxNM = max(N,M);
ll minNM = min(N,M);
minNM += 3;
if (maxNM<minNM) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
using namespace std;
const int mo=1e9+7;
template<typename _T>
void read(_T &x){
_T f=1;x=0;char s=getchar();
while('0'>s||s>'9'){if(s=='-')f=-1;s=getchar();}
while('0'<=s&&s<='9'){x=(x<<3)+(x<<1)+(s^48);s=getchar();}
x*=f;
}
int n,v1,v2,v3,v4;
int add(int x,int y){return x+y>mo?x+y-mo:x+y;}
int solve1(int x){
int res=1;
for(int i=1;i<x-2;i++)res=add(res,res);
return res;
}
int solve2(int x){
int f1=1,f2=1;
for(int i=1;i<x-2;i++)f1=add(f1,f2),f2=add(f1,mo-f2);
return f1;
}
int main(){
read(n);char ch;
scanf("\n%c",&ch);v1=(ch=='A');
scanf("\n%c",&ch);v2=(ch=='A');
scanf("\n%c",&ch);v3=(ch=='A');
scanf("\n%c",&ch);v4=(ch=='A');
if(v1&&v2&&v3&&v4)puts("1");
if(v1&&v2&&v3&&!v4)puts("1");
if(v1&&v2&&!v3&&v4)puts("1");
if(v1&&v2&&!v3&&!v4)puts("1");
if(v1&&!v2&&v3&&!v4)puts("1");
if(!v1&&!v2&v3&&!v4)puts("1");
if(v1&&!v2&&!v3&&!v4)puts("1");
if(!v1&&!v2&&!v3&&!v4)puts("1");
if(v1&&!v2&&v3&&v4)printf("%d\n",solve1(n));
if(!v1&&v2&&v3&&v4)printf("%d\n",solve2(n));
if(!v1&&v2&&!v3&&v4)printf("%d\n",solve1(n));
if(!v1&&v2&&!v3&&!v4)printf("%d\n",solve1(n));
if(!v1&&!v2&&v3&&v4)printf("%d\n",solve1(n));
if(v1&&!v2&&!v3&&v4)printf("%d\n",solve2(n));
if(!v1&&v2&&v3&&!v4)printf("%d\n",solve2(n));
if(!v1&&!v2&&!v3&&v4)printf("%d\n",solve2(n));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
for(auto &e:u) fill_v<T>(e,v...);
}
template <typename F>
class
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
FixPoint final : private F
{
public:
template <typename G>
explicit constexpr FixPoint(G&& g) noexcept
: F{std::forward<G>(g)}
{}
template <typename... Args>
constexpr decltype(auto)
operator()(Args&&... args) const
#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9
noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))
#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9
{
return F::operator()(*this, std::forward<Args>(args)...);
}
}; // class FixPoint
#if defined(__cpp_deduction_guides)
template <typename F>
FixPoint(F&&)
-> FixPoint<std::decay_t<F>>;
#endif // defined(__cpp_deduction_guides)
namespace
{
template <typename F>
#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)
# if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)
_Check_return_
# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)
inline constexpr decltype(auto)
makeFixPoint(F&& f) noexcept
{
return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};
}
} // namespace
template <typename T>
void fwt(vector<T>& f) {
int n = f.size();
for (int i = 1; i < n; i <<= 1) {
for (int j = 0; j < n; j++) {
if ((j & i) == 0) {
T x = f[j], y = f[j | i];
f[j] = x + y, f[j | i] = x - y;
}
}
}
}
template <typename T>
void ifwt(vector<T>& f) {
int n = f.size();
for (int i = 1; i < n; i <<= 1) {
for (int j = 0; j < n; j++) {
if ((j & i) == 0) {
T x = f[j], y = f[j | i];
f[j] = (x + y) / 2, f[j | i] = (x - y) / 2;
}
}
}
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int64 N;
cin >> N;
int64 a = ((1 << N) - 1), b = ((1 << (N-1)) - 1);
if (N == 1) {
cout << 1 << endl << "AB" << endl;
return 0;
}
int64 n = b / __gcd(a, b);
int64 x = n * a / b, m = x;
cout << x << endl;
FOR(i, 1, x+1) {
REP(j, 1 << N) {
if (__builtin_popcount(i & j) % 2) cout << "A";
else cout << "B";
}
cout << endl;
}
}
| #include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<string> f(int n){
if(n == 1) return vector<string>{"AB"};
vector<string> ans = f(n - 1);
int sz = ans.size();
for(int t = 0; t < sz; ++t){
ans[t] = ans[t] + ans[t];
string s = ans[t];
int siz = s.size();
for(int i = siz / 2; i < siz; ++i) s[i] = "AB"[s[i] == 'A'];
ans.emplace_back(s);
}
string s(1 << (n - 1), 'A'), ss(1 << (n - 1), 'B');
ans.emplace_back(s + ss);
return ans;
}
int n;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
vector<string> s = f(n);
cout << s.size() << "\n";
for(auto &v : s) cout << v << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
}
return false;
}
template<class T,class U>
inline bool chmin(T &a,U b){
if(a>b){
a=b;
return true;
}
return false;
}
constexpr int INF=1000000000;
constexpr ll llINF=1000000000000000000;
constexpr int mod=998244353;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
random_device rnd;
mt19937 mt(rnd());//32bit
//[mi,ma]
uniform_int_distribution<int>engine(mi,ma);
return engine(mt);
}
/*
vector<vector<ll>>C,sC;
void init_comb(int n,int m){
C.resize(n+1,vector<ll>(m+1,0));
sC.resize(n+1,vector<ll>(m+1,0));
C[0][0]=1;
for(int i=1;i<=n;i++){
C[i][0]=1;
for(int j=1;j<=m;j++){
C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
}
rep(i,n+1){
rep(j,m){
sC[i][j+1]=(sC[i][j]+C[i][j])%mod;
}
}
}*/
ll gcd(ll a,ll b){
while(a%b){
a%=b;
swap(a,b);
}
return b;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool isprime(int a){
if(a==1)return false;
for(int i=2;i*i<=a;i++){
if(a%i==0)return false;
}
return true;
}
set<int>primes;
void init_prime(int n){
for(int i=2;i<=n;i++){
bool f=true;
for(int j:primes){
if(j*j>i)break;
if(i%j==0){
f=false;
break;
}
}
if(f)primes.insert(i);
}
}
ll modpow(ll a,ll b){
ll res=1;
while(b){
if(b&1){
res*=a;
res%=mod;
}
a*=a;
a%=mod;
b>>=1;
}
return res;
}
vector<ll>inv,fact,factinv;
void init_fact(int n){
inv.resize(n+1);
fact.resize(n+1);
factinv.resize(n+1);
inv[0]=0;
inv[1]=1;
fact[0]=1;
factinv[0]=1;
for(ll i=1;i<=n;i++){
if(i>=2)inv[i]=mod-((mod/i)*inv[mod%i]%mod);
fact[i]=(fact[i-1]*i)%mod;
factinv[i]=factinv[i-1]*inv[i]%mod;
}
}
ll _inv(ll a,ll m=mod){
//gcd(a,m) must be 1
ll b=m,u=1,v=0;
while(b){
ll t=a/b;
a-=t*b;swap(a,b);
u-=t*v;swap(u,v);
}
u%=m;
if(u<0)u+=m;
return u;
}
ll comb(int a,int b){
if(a<b)return 0;
if(a<0)return 0;
return fact[a]*factinv[a-b]%mod*factinv[b]%mod;
}
ll multicomb(int a,int b){
return comb(a+b-1,b);
}
int h,w,k;
constexpr ll p=665496236;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
cin>>h>>w>>k;
vector<vector<ll>>dp(h+1,vector<ll>(w+1,0));
vector<vector<char>>c(h+1,vector<char>(w+1,'.'));
rep(i,k){
int x,y;
cin>>x>>y;
x--,y--;
cin>>c[x][y];
}
dp[0][0]=1;
rep(i,h){
rep(j,w){
if(i<h){
if(c[i][j]=='D'||c[i][j]=='X'){
dp[i+1][j]+=dp[i][j];
dp[i+1][j]%=mod;
}
if(c[i][j]=='.'){
dp[i+1][j]+=dp[i][j]*p%mod;
dp[i+1][j]%=mod;
}
}
if(j<w){
if(c[i][j]=='R'||c[i][j]=='X'){
dp[i][j+1]+=dp[i][j];
dp[i][j+1]%=mod;
}
if(c[i][j]=='.'){
dp[i][j+1]+=dp[i][j]*p%mod;
dp[i][j+1]%=mod;
}
}
}
}
cout<<dp[h-1][w-1]*modpow(3,h*w-k)%mod<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ cout << "[" << p.first << ", " << p.second << "]"; return os; }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define Return(expr) { Cout(expr); return 0; }
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
// constexpr int MOD = 1e9+7;
int main(void){
Cin(int, n);
Cin(string, s);
Cins(int, n+1, a);
/*srand(time(nullptr));
int n = 10;
vc<int> a(n+1);
a[0] = rand() % 100;
For(i, n) a[i+1] = (a[i] + 30 + rand() % 40) % 100;
string s;
For(i, n) s += (a[i] < a[i+1] ? '<' : '>');
Couts(a);
Cout(s);*/
int k = 1e4;
For(i, n) Mini(k, abs(a[i]-a[i+1]));
Cout(k);
vc<vc<int>> b(k, vc<int>(n+1, 0));
For(i, n+1) For(j, a[i]) b[j % k][i] ++;
For(i, k) Couts(b[i]);
}
|
#include <bits/stdc++.h>
#include <unordered_set>
#define f(i, a, b) for (int i = a; i < b; i++)
#define rf(i, a, b) for (int i = a; i > b; i--)
#define lf(i, a, b) for (long long i = a; i < b; i++)
#define sq(a) (a)*(a)
#define cube(a) (a)*(a)*(a)
#define pb push_back
#define ppb pop_back
#define LB lower_bound
#define UB upper_bound
#define sarr(arr, n) sort(arr, arr + n);
#define svec(v) sort(v.begin(), v.end());
#define svecr(v) sort(v.rbegin(), v.rend());
#define intinp(var) int var; \
cin >> var;
#define adjc(adj, n) int adj[n];
#define adjcw(adj, n) vector<pair<int, int>> adj[n];
#define PYES cout << "YES\n"
#define PNO cout << "NO\n"
#define PYes cout << "Yes\n"
#define PNo cout << "No\n"
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef vector<string> vs;
typedef unordered_map<int, int> um;
int main(){
ll n, k; cin >> n >> k;
f(i, 0, k){
if (n%200 == 0) n /= 200;
else{
n *= 1000;
n += 200;
}
}
cout << n << "\n";
return 0;
}
| //
// _oo0oo_
// o8888888o
// 88" . "88
// (| -_- |)
// 0\ = /0
// ___/`---'\___
// .' \\| |// '.
// / \\||| : |||// \
// / _||||| -:- |||||- \
// | | \\\ - /// | |
// | \_| ''\---/'' |_/ |
// \ .-\__ '-' ___/-. /
// ___'. .' /--.--\ `. .'___
// ."" '< `.___\_<|>_/___.' >' "".
// | | : `- \`.;`\ _ /`;.`/ - ` : | |
// \ \ `_. \_ __\ /__ _/ .-` / /
// =====`-.____`.___ \_____/___.-`___.-'=====
// `=---='
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define ll long long
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB emplace_back
#define PF emplace_front
#define FILL(a,b) memset(a,b,sizeof(a))
#define lwb lower_bound
#define upb upper_bound
#define lc (x<<1)
#define rc ((x<<1)|1)
using namespace std;
P<int,int> p[400005];
int f[400005],L[400005],R[400005];
int ans[400005],a[400005];
int n;
bool check(int x,int y){
RE x>=1&&x<=n&&y>=1&&y<=n&&f[x]!=f[y];
}
void erase(int x){
R[L[x]]=R[x];
L[R[x]]=L[x];
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n;
n*=2;
FOR(i,1,n)cin>>p[i].F,p[i].S=i;
sort(p+1,p+n+1);
set<int> s;
FOR(i,1,n/2)f[p[i].S]=1;
FOR(i,1,n)L[i]=i-1,R[i]=i+1;
rep(i,1,n){
if(f[i]!=f[i+1])s.emplace(i);
}
while(!s.empty()){
int t=*s.begin();
ans[t]=1;
ans[R[t]]=2;
s.erase(s.begin());
if(check(L[t],t))s.erase(L[t]);
if(check(R[t],R[R[t]]))s.erase(R[t]);
if(check(L[t],R[R[t]]))s.emplace(L[t]);
erase(R[t]);
erase(t);
}
FOR(i,1,n)cout<<(ans[i]==1?'(':')');
RE 0;
}
|
#include <set>
#include <cstdio>
using namespace std;
#define maxn 200005
#define int long long
set < pair < int, int > > st;
set < pair < int, int > > :: iterator it;
int n;
int t[maxn];
int lowbit( int x ) {
return x & ( -x );
}
void add( int x, int val ) {
for( int i = x;i <= n;i += lowbit( i ) ) t[i] += val;
}
int query( int x ) {
int ans = 0;
for( int i = x;i;i -= lowbit( i ) ) ans += t[i];
return ans;
}
signed main() {
scanf( "%lld", &n );
for( int i = 1, x;i <= n;i ++ ) {
scanf( "%lld", &x );
st.insert( make_pair( x + i, i ) );
}
bool flag = 0; int ans = 0;
for( int i = 1, x;i <= n;i ++ ) {
scanf( "%lld", &x );
it = st.lower_bound( make_pair( x + i, 0 ) );
if( it == st.end() ) flag = 1;
else {
int v = query( ( *it ).second );
add( 1, 1 ), add( ( *it ).second, -1 );
ans += ( *it ).second + v - i;
st.erase( it );
}
}
if( flag ) printf( "-1\n" );
else printf( "%lld\n", ans );
return 0;
} | #include <bits/stdc++.h>
typedef long long i64;
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using namespace std;
const int xn = 2e5;
int n, a[xn], b[xn], p[xn], c[xn];
map<int, queue<int>> mp;
void ap(int i) {for (; i < n; i |= i + 1) {++c[i];}}
int sp(int i) {int x = 0;
for (; i; i &= i - 1) {x += c[i - 1];} return x;}
int main() {
// freopen("#.in", "r", stdin); // @
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
rep(i, 0, n) {cin >> a[i]; a[i] += i; mp[a[i]].push(i);}
bool ok = true;
rep(i, 0, n) {
cin >> b[i]; b[i] += i;
queue<int> &q = mp[b[i]];
if (!sz(q)) {ok = false;}
else {p[i] = q.front(); q.pop();}
}
if (ok) {
i64 res = 0;
rep(i, 0, n) {res += i - sp(p[i]); ap(p[i]);}
cout << res << '\n';
} else {cout << "-1\n";}
return 0;
}
/* 📌https://www.cnblogs.com/George1123/p/tips.html */
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+3;
int num[N];
vector<pair<int,int> > adj[N];
void dfs(int u, int p){
for(auto it : adj[u]){
if(num[it.first] != -1){
continue;
}
if(num[u] == it.second){
num[it.first] = (it.second == 1 ? 2 : 1);
}else{
num[it.first] = it.second;
}
dfs(it.first,u);
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(num,-1,sizeof(num));
int n,m;
cin >> n >> m;
for(int i=0;i<m;i++){
int u,v,m;
cin >> u >> v >> m;
u--,v--;
adj[u].emplace_back(v,m);
adj[v].emplace_back(u,m);
}
if(adj[0].empty()){
cout << "No\n";
return 0;
}
num[0] = adj[0][0].second;
dfs(0,-1);
bool val = true;
for(int i=0;i<n;i++){
if(num[i] == -1){
val = false;
break;
}
}
if(!val){
cout << "No\n";
}else{
for(int i=0;i<n;i++){
cout << num[i] << '\n';
}
}
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int n, m;
cin >> n >> m;
vector< int > a(m+1), b(m+1), c(n+1), dir(m+1, 0);
for(int i=1;i<=m;i++) cin >> a[i] >> b[i];
for(int i=1;i<=n;i++) cin >> c[i];
for(int i=1;i<=m;i++){
if(c[a[i]] > c[b[i]]){
dir[i] = 1;
}else if(c[a[i]] < c[b[i]]){
dir[i] = -1;
}
}
auto f = [&](auto f, int v)->void{
for(int i=1;i<=m;i++){
if(dir[i] != 0 || (a[i] != v && b[i] != v)) continue;
if(a[i] == v){
dir[i] = 1;
f(f, b[i]);
}
if(b[i] == v){
dir[i] = -1;
f(f, a[i]);
}
}
};
for(int i=1;i<=m;i++){
if(dir[i] != 0) continue;
f(f, a[i]);
}
for(int i=1;i<=m;i++){
cout << (dir[i] == 1 ? "->" : "<-") << endl;
}
}
|
#include <iostream>
using namespace std;
int n ;
int main()
{
cin >> n;
if (n%2==0) {
cout << "White" << endl;
} else {
cout << "Black" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define sz(x) (int)(x).size()
#define dup(x,y) ((x+y-1)/y)
#define dame0 { puts("0"); return 0;}
#define dame1 { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define outa cout << ans << endl
#define out(x) cout << x << endl
#define ul(x) x^=32 // 大文字小文字を逆にする
#define shousuu cout << fixed << setprecision(15)
bool flg = false;
int main(){
int n; cin>>n;
if(n%2==0) out("White");
else out("Black");
}
/*
g++ a.cpp
./a.out
*/
|
/**
* AtCoder Beginner Contest
**/
// >>> ngng628's library
// >>> includes
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <chrono>
#include <random>
#include <bitset>
// <<<
// >>> macros
# define cauto const auto
# define int long long
# define float long double
# define FI first
# define SE second
# define mkp make_pair
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i,n) for(int i=((int)(n)); i>0; --i)
# define repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)
# define reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)
# define step(n) rep(_, n)
# define all(x) std::begin(x), std::end(x)
# define rall(x) std::rbegin(x), std::rend(x)
# define pb push_back
# define eb emplace_back
# define len(x) ((int)(x).size())
# define contains(x,key) ((x).find(key) != (x).end())
# define lb(v,x) distance(std::begin(v), lower_bound(all(v), (x)))
# define ub(v,x) distance(std::begin(v), upper_bound(all(v), (x)))
// <<<
// >>> usings
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using mii = map<int, int>;
using mci = map<char, int>;
using msi = map<string, int>;
// <<<
// >>> functions
template<class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template<class T> istream& operator>>(istream& is, vector<vector<T>>& v) { for(auto& x : v) for (auto& y : x) is >> y; return is; }
template<class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.FI >> p.SE; }
template<class T> string join(const vector<T> &v){ stringstream s; rep (i, len(v)) s<<' '<<v[i]; return s.str().substr(1); }
template<class T> ostream& operator<<(ostream& os, const vector<T>& v){ if (len(v)) os << join(v); return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){ rep (i, len(v)) { if (len(v[i])) os << join(v[i]) << (i-len(v)+1 ? "\n" : ""); } return os; }
template<class T, class U> ostream& operator<<(ostream& os, const pair<T,U>& p){ cout << p.FI << " " << p.SE; return os; }
void print(){ cout << "\n"; }
template<class T, class... A>void print(const T& v, const A&...args){cout << v; if(sizeof...(args))cout << " "; print(args...);}
void eprint() { cerr << "\n"; }
template<class T, class... A>void eprint(const T& v, const A&...args){cerr << v; if(sizeof...(args))cerr << " "; eprint(args...);}
template<class T> inline void Unique(T& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T> inline constexpr bool chmax(T &a, T b) { return a < b && (a = b, true); }
template<class T> inline constexpr bool chmin(T &a, T b) { return a > b && (a = b, true); }
constexpr int ctoi(const char c) { return ('0' <= c && c <= '9') ? (c - '0') : -1; }
const char* YesNo(bool b) { return b ? "Yes" : "No"; }
const char* YESNO(bool b) { return b ? "YES" : "NO"; }
const char* yesno(bool b) { return b ? "yes" : "no"; }
const char* yn(bool b) { return YesNo(b); }
// <<<
// <<<
int32_t main() {
int x;
cin >> x;
if (x >= 0) {
print(x);
}
else {
print(0);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> v;
for(int i = 0;i < N;i++){
int a;cin >> a;
v.push_back(a);
}
int ma = 0;
int ans = -1;
for(int i = 2;i <= 1000;i++){
int cnt = 0;
for(auto a : v){
if(a % i == 0)cnt++;
}
if(cnt > ma){
ma = cnt;
ans = i;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rei register int
#define pb push_back
using namespace std;
const int maxn = 100010;
int n;
int dp[maxn],g[maxn],sz[maxn];
vector<int>ver[maxn];
void dfs(int x){ g[x] = sz[x] = 1; int cnt = 0;
for(rei i = 0;i < ver[x].size();++i) dfs(ver[x][i]);
for(rei i = 0;i < ver[x].size();++i) cnt ^= g[ver[x][i]];
for(rei i = 0;i < ver[x].size();++i) g[x] ^= g[ver[x][i]],sz[x] += sz[ver[x][i]];
for(rei i = 0;i < ver[x].size();++i) if(g[ver[x][i]] == 0){
if(sz[ver[x][i]] - dp[ver[x][i]] <= dp[ver[x][i]]) dp[x] += dp[ver[x][i]];
else if(cnt == 1) dp[x] += sz[ver[x][i]] - dp[ver[x][i]];
else dp[x] += dp[ver[x][i]];
} vector<pair<int,int > >st;
for(rei i = 0;i < ver[x].size();++i) if(g[ver[x][i]] == 1) st.pb(make_pair(2 * dp[ver[x][i]] - sz[ver[x][i]],dp[ver[x][i]]));
sort(st.begin(),st.end()); reverse(st.begin(),st.end());
for(rei i = 0;i < st.size();i += 2) dp[x] += st[i].second;
for(rei i = 1;i < st.size();i += 2) dp[x] += st[i].second - st[i].first;
} int main(){
cin >> n; for(rei i = 1;i < n;++i){
int x; scanf("%d",&x); ver[x].pb(i + 1);
} dfs(1);
// for(rei i = 1;i <= n;++i) cerr << dp[i] << " " << g[i] << endl;
cout << n - dp[1];
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
//V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int,int>;
using Pl = pair<ll, ll>;
using Vs = vector<string>;
const ll mod = 1000000007;
const ll inf = 1000000000000000000;//10の18乗
#define yn {puts("Yes");}else{puts("No");}
#define dame { puts("-1"); return 0;}
int main(){
ll n;
cin >> n;
Vl v(n);
VVl to(n);
rep(i,n-1){
cin >> v[i+1];
v[i+1]--;
to[v[i+1]].PB(i+1);
}
Vl dp(n),dp2(n);
repd(i,n){
ll sen=1,go=0;
vector<P> can;//奇数の行き先
ll last=0,last2=0;
for(int j:to[i]){
ll x=dp[j],y=dp2[j];
if((x+y)%2==0){
if(x<=y){
sen+=x;go+=y;
}
else{
last+=x;
last2+=y;
}
}
else{
can.PB(MP(x-y,x));//相手に利益が低いものを押し付ける
}
}
sort(all(can));
rep(j,can.size()){
if(j%2==1){
go+=can[j].S;
sen+=(-can[j].F+can[j].S);
}
else{
sen+=can[j].S;
go+=(-can[j].F+can[j].S);
}
}
if(can.size()%2==0){//?
sen+=last;
go+=last2;
}
else{
sen+=last2;
go+=last;
}
dp[i]=sen;dp2[i]=go;
//cout << last << endl;
}
cout << dp[0] << endl;
//rep(i,n) cout << dp[i] << endl;
//rep(i,n) cout << dp2[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> a(10010);
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
int x = a[i];
for (int j = i; j < n; j++) {
x = min(x, a[j]);
ans = max(ans, x * (j - i + 1));
}
}
cout << ans << endl;
} | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll h[100005],s[5000005],w[5000005];
int n,p;
int main()
{
while (scanf ("%d",&n)!=EOF)
{
if (n==0) return 0;
memset(h,0,sizeof(h));
memset(s,0,sizeof(h));
for (int i=1;i<=n;i++)
scanf ("%d",&h[i]);
h[n+1]=p=0;//增加一个高度为0的矩形，避免扫描栈结束后有剩余矩形
ll ans=0;
for (int i=1;i<=n+1;i++)
{
if (h[i]>s[p])
{
s[++p]=h[i];
w[p]=1;
}
else //如果当前矩形比之前矩形低，那就出栈栈中矩形，直到有矩形比它低
{//用一个 宽度为出栈矩形总宽 高度为当前矩形 的新矩形代替之前矩形
ll wid=0;
while (s[p]>h[i])
{
wid+=w[p];//统计宽度
ans=max(ans,1LL*(wid*s[p]));//计算出栈的矩形面积，更新答案
p--;//出栈
}
w[++p]=wid+1;//将新矩形入栈
s[p]=h[i];
}
}
while (p!=0)//将所有矩形出栈，按照上面的方法计算面积，更新答案
{
ans=max(ans,1LL*(s[p]*w[p]));
p--;
}
printf("%lld\n",ans);
}
} |
#include <stdio.h>
int main()
{
int n;
scanf("%d", &n);
if (n*108/100 > 206)
{
printf(":(");
}
else if (n*108/100 == 206){
printf("so-so");
}
else printf("Yay!");
return 0;
} | #include <bits/stdc++.h>
int main(){
int n;
scanf("%d",&n);
printf("%d",n-1);
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef vector<bool> VB;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) LL((a).size())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define ROF(i,a,b) for(LL i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL LARGE_INT = 1e9+100;
const LL INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const LL MOD = 1e9+7;
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
LL TIME_LIMIT = 1992;
LL start_time;
string result_string;
LL result_point=0;
LL h=50;
LL w=50;
VVL t;
VVL p;
void check(string result, LL point){
if(point > result_point){
result_point = point;
result_string = result;
}
}
void dfs(LL x, LL y, VB v, string result, LL point){
LL time = chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count();
if(time-start_time > TIME_LIMIT){
check(result, point);
return;
}
v[t[x][y]]=true;
VL dx={1,-1,0,0};
VL dy={0,0,1,-1};
VVL tp;
REP(i,4){
LL nx = x+dx[i];
LL ny = y+dy[i];
if(nx >= h || nx < 0 || ny >= w || ny < 0){
continue;
}
if(v[t[nx][ny]]){
continue;
}
LL dist = min(nx,abs(h-nx)) + min(ny,abs(w-ny));
tp.PB({-dist,p[nx][ny],i,nx,ny});
}
if(tp.empty()){
check(result, point);
return;
}
SORT_DESC(tp);
for(auto w : tp){
LL np = w[1];
LL i = w[2];
LL nx = w[3];
LL ny = w[4];
//cerr<<np<<" "<<i<<" "<<nx<<" "<<ny<<endl;
string d;
if(i==0){
d = "D";
}
if(i==1){
d = "U";
}
if(i==2){
d = "R";
}
if(i==3){
d = "L";
}
dfs(nx, ny, v, result+d, point+np);
}
}
void Main()
{
start_time = chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count();
//dump(start_time)
LL si,sj;cin>>si>>sj;
t.resize(h);
REP(i,h){
t[i].resize(w);
REP(j,w){
cin>>t[i][j];
}
}
p.resize(h);
REP(i,h){
p[i].resize(w);
REP(j,w){
cin>>p[i][j];
}
}
VB v(h*w);
string result = "";
LL point = 0;
dfs(si, sj, v, result, point);
cout<<result_string<<endl;
return;
}
int main()
{
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int si,sj,mx = 0;
int t[55][55],p[55][55];
int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
bool used[2505];
string base = "RDLU";
string fans = "";
void input() {
cin >> si >> sj;
for(int i = 0; i < 50; i++) {
for(int j = 0; j < 50; j++) {
cin >> t[i][j];
}
}
for(int i = 0; i < 50; i++) {
for(int j = 0; j < 50; j++) {
cin >> p[i][j];
}
}
}
int score(string tmp) {
int nx = si;
int ny = sj;
int ans = p[si][sj];
for(int i = 0; i < tmp.size(); i++) {
for(int j = 0; j < 4; j++) {
if(base[j] == tmp[i]) {
nx += dx[j];
ny += dy[j];
ans += p[nx][ny];
}
}
}
return ans;
}
void chmax(string tmp) {
if(mx < score(tmp)) {
mx = score(tmp);
fans = tmp;
}
}
string BFS() {
used[t[si][sj]] = true;
int nx = si;
int ny = sj;
string ans = "";
int r = rand()%4;
while (true) {
bool flag = false;
if(rand()%25 == 0) {
r = rand()%4;
}
for(int i = r; i < r+4; i++) {
int nnx = nx+dx[i%4];
int nny = ny+dy[i%4];
if(nnx >= 0 && nny >= 0 && nnx < 50 && nny < 50 && !used[t[nnx][nny]]) {
nx = nnx;
ny = nny;
ans += base[i%4];
flag = true;
used[t[nnx][nny]] = true;
break;
}
}
if(!flag) {
break;
}
}
memset(used,false,sizeof(used));
return ans;
}
string BFS2(int r) {
used[t[si][sj]] = true;
int nx = si;
int ny = sj;
string ans = "";
while (true) {
bool flag = false;
for(int i = r; i < r+4; i++) {
int nnx = nx+dx[i%4];
int nny = ny+dy[i%4];
if(nnx >= 0 && nny >= 0 && nnx < 50 && nny < 50 && !used[t[nnx][nny]]) {
nx = nnx;
ny = nny;
ans += base[i%4];
flag = true;
used[t[nnx][nny]] = true;
break;
}
}
if(!flag) {
break;
}
}
memset(used,false,sizeof(used));
return ans;
}
int main() {
srand((unsigned)time(NULL));
input();
for(int i = 0; i < 1000000; i++) {
chmax(BFS());
}
chmax(BFS2(0));
chmax(BFS2(1));
chmax(BFS2(2));
chmax(BFS2(3));
cout << fans << endl;
}
|
#include<bits/stdc++.h>
#define endl ("\n")
#define int long long
#define read(a,n) rep(i,0,n){cin>>a[i];}
#define print(a,n) rep(i,0,n) cout<<a[i]<<" ";
#define yy cout<<"Yes"<<endl;
#define nn cout<<"No"<<endl;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define ff first
#define ss second
#define mod 1000000007
using namespace std;
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int T = clock();
int t = 1 ;
// cin >> t ;
while (t--)
{
int n, k, a, b;
cin >> n >> k;
map<int, int> m;
int tb = k;
rep(i, 0, n)
{
cin >> a >> b;
m[a] += b;
}
for (auto it : m) {
a = it.ff;
b = it.ss;
if (tb < a)
{
break;
}
tb += b;
}
cout << tb << 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()
using P = pair<int,int>;
constexpr int inf = numeric_limits<int>::max() / 2;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n, m; cin >> n >> m;
vector<int> w(n); rep(i,n) cin >> w[i];
vector<P> b(m+1);
rep(i,m){
int l, v; cin >> l >> v;
b[i] = {v,l};
}
b[m] = {0,0};
sort(all(b));
int e = 1;
for(int i=1; i<=m; i++){
if(b[i].first == b[e-1].first) b[e-1].second = b[i].second;
else if(b[i].second > b[e-1].second) b[e++] = b[i];
}
int ans = inf;
vector<int> v(n); iota(all(v), 0);
rep(i,n) if(b[1].first < w[i]) return 0 * puts("-1");
do {
vector<int> len(n,0), ac(n+1,0);
rep(i,n) ac[i+1] = ac[i] + w[v[i]];
rep(i,n) for(int j=i+1; j<n; j++){
int l = len[i] + (--lower_bound(b.begin(), b.begin()+e, P{ac[j+1]-ac[i],0}))->second;
len[j] = max(len[j], l);
}
ans = min(ans, len[n-1]);
}while(next_permutation(all(v)));
cout << ans << "\n";
} |
// #pragma GCC optimize(2)
// #pragma GCC optimize(3)
// #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<VI> VII;
typedef vector<ll> VL;
typedef vector<vector<ll>> VLL;
constexpr int mod = 1e9 + 7;
constexpr int KINF = 0x3f3f3f3f;
constexpr int INF = 0x7f7f7f7f;
constexpr double eps = 1e-7;
int main(){
ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
int r, x, y;
cin >> r >> x >> y;
ll dist = (1ll * x * x) + (1ll * y * y);
//dist = ceil(sqrt(dist));
if(dist < 1ll * r * r) {
cout << 2 << endl;
return 0;
}
ll k = 1;
while(1ll * k * k * r * r < dist) k ++;
cout << k << endl;
return 0;
}
// 小心左移运算符导致的int溢出
// dp记得处理非法状态
// resize并不会初始化数组
// 全局函数一定要记得inline
// 带空格字符串不能直接cin,要用getline
// 最好用用"\n"代替endl
| //#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
using namespace std ;
#define int int64_t //be careful about this
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<typename T>
void __p(T a) {
cout<<a;
}
template<typename T, typename F>
void __p(pair<T, F> a) {
cout<<"{";
__p(a.first);
cout<<",";
__p(a.second);
cout<<"}\n";
}
template<typename T>
void __p(std::vector<T> a) {
cout<<"{";
for(auto it=a.begin(); it<a.end(); it++)
__p(*it),cout<<",}\n"[it+1==a.end()];
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
__p(a1);
__p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout<<name<<" : ";
__p(arg1);
cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket=0,i=0;
for(;; i++)
if(names[i]==','&&bracket==0)
break;
else if(names[i]=='(')
bracket++;
else if(names[i]==')')
bracket--;
const char *comma=names+i;
cout.write(names,comma-names)<<" : ";
__p(arg1);
cout<<" | ";
__f(comma+1,args...);
}
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin.exceptions(cin.failbit);
cout.precision(15); cout << fixed;
#ifdef ONLINE_JUDGE
if(sz(s)){
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
#endif
}
const int inf = 1e9, A = 26;
signed main(){
setIO() ;
int n,m; rd(n,m);
int dp[n][n];
f(i,0,n) f(j,0,n) dp[i][j] = inf ;
f(i,0,n) dp[i][i] = 0;
vt<int> g[n][A];
f(_,0,m){
int u,v; char c;
rd(u,v,c);
--u,--v;
ckmin(dp[u][v],int(1));
ckmin(dp[v][u],int(1));
g[u][c-'a'].pb(v);
g[v][c-'a'].pb(u);
}
PQ<ar<int,3>> q;
f(i,0,n) f(j,0,n) q.push({-dp[i][j],i,j});
while(sz(q)){
auto a = q.top(); q.pop();
int v = -a[0], i = a[1], j = a[2];
//if(dp[i][j] != v) continue;
f(k,0,A){
for(auto x : g[i][k]){
for(auto y : g[j][k]){
if(ckmin(dp[x][y],v + 2)){
q.push({-dp[x][y],x,y});
}
}
}
}
}
cout << (dp[0][n-1] == inf ? int(-1) : dp[0][n-1]);
}
|
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree{
int N;
vector<int> tree;
SegmentTree(vector<int>& v) {
int sz = v.size();
N = 1;
while(N < sz) N *= 2;
tree = vector<int>(2 * N, 0);
for(int i = 0;i < sz;++i) tree[N + i] = v[i];
}
void update(int index) {
index += N;
tree[index]++;
while(index > 0) {
index /= 2;
tree[index] = tree[2 * index] + tree[2 * index + 1];
}
}
int sum(int left, int right) {
left += N, right += N;
int res = 0;
while(right - left > 1) {
if(left % 2 == 0) left /= 2;
else {
res += tree[left];
left = left / 2 + 1;
}
if(right % 2 == 0) {
res += tree[right];
right = right / 2 - 1;
}
else right /= 2;
}
res += (left == right ? tree[left] : tree[left] + tree[right]);
return res;
}
};
int main() {
int n; cin >> n;
vector<int> a(n), b(n);
for(auto& e : a) cin >> e;
for(auto& e : b) cin >> e;
for(int i = 0;i < n;++i) a[i] += i, b[i] += i;
map<int, int> mpa, mpb;
for(int i = 0;i < n;++i) mpa[a[i]]++, mpb[b[i]]++;
for(auto p : mpa) {
if(mpb[p.first] != p.second) {
cout << -1 << '\n';
return 0;
}
}
map<int, queue<int>> mp;
for(int i = 0;i < n;++i) mp[b[i]].push(i);
vector<int> v1(n), v2(n);
for(int i = 0;i < n;++i) {
v1[i] = mp[a[i]].front();
mp[a[i]].pop();
}
SegmentTree seg(v2);
long long ans = 0;
for(int i = 0; i < n;++i) {
ans += seg.sum(0, v1[i]);
seg.update(v1[i]);
}
ans = (long long)n * (n - 1) / 2 - ans;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
const int maxn=200000+10;
ll tree[maxn],n,a[maxn],b[maxn],c[maxn];
int lowbit(int i) {return i&-i;}
ll ask(int x)
{
int res=0;
for(int i=x;i;i-= lowbit(i)) res+=tree[i];
return res;
}
void modify(int x,int val)
{
for(int i=x;i<=n;i+=lowbit(i)) tree[i]+=val;
}
int main()
{
cin>>n;
vector <P> vec1,vec2;
for(int i=0;i<n;i++)
{
cin>>a[i];
a[i]+=i;
vec1.push_back(P(a[i],i));
}
for(int i=0;i<n;i++)
{
cin>>b[i];
b[i]+=i;
vec2.push_back(P(b[i],i));
}
sort(vec1.begin(),vec1.end());
sort(vec2.begin(),vec2.end());
for(int i=0;i<n;i++)
{
if(vec1[i].first!=vec2[i].first)
{
cout<<"-1\n";
return 0;
}
c[vec1[i].second]=vec2[i].second;
}
ll ans=0;
for(int i=n-1;i>=0;i--)
{
ans+=ask(c[i]+1);
//cout<<ans<<endl;
modify(c[i]+1,1);
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define per(i,a,b) for(register int i=(a);i>=(b);i--)
using namespace std;
const int N=59;
inline long long read() {
register long long x=0, f=1; register char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1; c=getchar();}
while(c>='0'&&c<='9') {x=(x<<3)+(x<<1)+c-48,c=getchar();}
return x*f;
}
int n,m,col[N],res=0,ans=1;
bool vst[N];
bool ed[N][N];
vector<int>e[N],vec;
void dfs(int u,int ret=0) {
vst[u]=1;
vec.push_back(u);
for(auto v:e[u]) if(!vst[v]) dfs(v);
}
void sfd(int pos) {
if(pos==vec.size()) {
res++;
return;
}
rep(i,1,3) {
bool qwq=1;
rep(j,0,pos-1) if(ed[vec[pos]][vec[j]]&&col[j]==i) qwq=0;
if(!qwq) continue;
col[pos]=i;
sfd(pos+1);
}
}
signed main() {
n=read(), m=read();
rep(i,1,m) {
int u=read(), v=read();
e[u].push_back(v), e[v].push_back(u);
ed[u][v]=ed[v][u]=1;
}
rep(i,1,n) if(!vst[i]) {
vec.clear(), res=0;
dfs(i);
sfd(0);
ans*=res;
}
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
clock_t start=clock();
int main()
{
int N,M;
cin>>N>>M;
vector<string> s(M);
string answer[N][N];
for(int i=0;i<M;i++) cin>>s[i];
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
answer[i][j]=".";
}
}
int num=0;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(answer[i][j]=="."&&s[num].size()+j<N){
for(int k=0;k<s[num].size();k++){
answer[i][j+k]=s[num][k];
}
num++;
}
}
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cout<<answer[i][j];
}
cout<<endl;
}
}
|
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
typedef long long ll;
const ll maxn = 1e3 + 10;
ll n, i, j, k, a, b;
ll vis[maxn];
ll ans[maxn];
ll cnt = 0;
ll arr[maxn];
int main() {
scanf("%lld", &n);
i = 0;
b = 0;
while (n) {
a = n % 10;
arr[i] = a;
n /= 10;
i++;
b += a;
}
b = b % 3;
if (b == 0)
printf("0");
else
{
if (b == 1)
{
if (i == 1)
printf("-1");
else {
ll ok = 0;
for (j = 0; j < i; j++)
if (arr[j] % 3 == 1)
ok = 1;
ll x = 0;
for (j = 0; j < i; j++)
if (arr[j] % 3 == 2)
x++;
if (ok == 1)
printf("1");
else if (x >= 2 && i >= 3)
{
printf("2");
}
else
printf("-1");
}
}
else
{
ll ok = 0;
for (j = 0; j < i; j++) {
if (arr[j] % 3 == 2)
ok = 1;
}
ll x = 0;
for (j = 0; j < i; j++) {
if (arr[j] % 3 == 1)
x++;
}
if (ok == 1 && i >= 2)
printf("1");
else if (x >= 2 && i >= 3)
printf("2");
else
printf("-1");
}
}
return 0;
}
| #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <string>
#include <list>
using namespace std;
long long min(long long int a,long long int b){
if(a>b){
return b;
}else{
return a;
}
}
long long int max(long long int a,long long int b){
if(a>b){
return a;
}else{
return b;
}
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
void f(vector<vector<int>>& a,vector<vector<int>>& b,int N,int K){
for(int i=0;i<N-1;i++){
for(int j=i+1;j<N;j++){
int l=0;
for(int k=0;k<N;k++){
if(a[k][i]+a[k][j]>K){
break;
}
l+=1;
}
if(l==N){
b[i][j]=1;
b[j][i]=1;
}
}
}
}
void g(vector<vector<int>>& a,vector<vector<int>>& c,int N,int K){
for(int i=0;i<N-1;i++){
for(int j=i+1;j<N;j++){
int l=0;
for(int k=0;k<N;k++){
if(a[i][k]+a[j][k]>K){
break;
}
l+=1;
}
if(l==N){
c[i][j]=1;
c[j][i]=1;
}
}
}
}
int h(vector<vector<int>>& b,vector<int>& x,int N){
int M=1;
vector<int> a(N);
for(int i=0;i<N;i++){
a[i]=0;
}
stack<int> d;
for(int i=0;i<N;i++){
int j=0;
if(a[i]==0){
d.push(i);
a[i]=1;
}
while(!d.empty()){
int k=d.top();
d.pop();
j+=1;
for(int l=0;l<N;l++){
if(b[k][l]==1 && a[l]==0){
d.push(l);
a[l]=1;
}
}
}
if(j>1){
x.push_back(j);
M=max(M,j);
}
}
return M;
}
int main(){
long long int N;
int max=-1;
int ans=-1;
cin>>N;
vector<long long int> A;
while(N!=0){
A.push_back(N%10);
N=N/10;
}
int M=A.size();
for(long long int k=0;k<(1<<M);k++){
int S=0;
int l=0;
for(int i=0;i<M;i++){
if(k&(1<<i)){
l+=1;
S+=A[i];
}
}
if(S%3==0 && l!=0){
if(l>max){
max=l;
}
}
}
if(max>-1){
ans=M-max;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 998244353
int binary_expo(int a,int b)
{
int res=1;
while(b>0)
{
if(b&1>0)
{
res=(((res%M)*(a%M))%M);
}
b=b>>1;
a=(((a%M)*(a%M))%M);
}
return res;
}
int inv(int a,int b)
{
a=(((a%M)*(binary_expo(b,M-2)))%M);
return a;
}
int32_t main()
{
int t=1;
//cin>>t;
while(t--)
{
int n;cin>>n;
vector<int> a(n,0);
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a.begin(),a.end());
int p=0;
int i=n-2;
int s=0;
while(i>=0)
{
s+=((a[i]*(binary_expo(2,p)))%M);
s%=M;
p++;
i--;
}
int c=0;
for(int i=n-1;i>0;i--)
{
int k=((s*a[i])%M);
c+=k;
c%=M;
s=((s-a[i-1]+M)%M);
s=(inv(s,(int)2)%M);
s%=M;
}
for(int i=0;i<n;i++)
{
c+=((a[i]*a[i])%M);
c%=M;
}
cout<<c<<endl;
}
return 0;
}
| #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <tuple>
#define ll long long
#define MAX 1000000007
#define mod % 998244353
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
vector<ll> beki;
int main(){
ll n;
cin >> n;
beki.push_back(1);
rep(i,n+3){
beki.push_back((beki[i]*2)mod);
}
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
sort(a.begin(),a.end());
ll ans = 0;
ll sum = 0;
rep(i,n){
ans = (ans+a[i]*sum) mod;
sum = (sum*2+a[i]) mod;
ans = (ans + (a[i]*a[i]))mod;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount
const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
struct dijkstra {
ll N;
struct edge { ll to, d; };
vector<vector<edge>> adj;
vector<ll> minlen;
dijkstra(ll n) { N = n; adj.resize(N); minlen.assign(N,LLINF); }
ll operator[](const ll &x) const { return minlen[x]; }
void add_edge(ll from, ll to, ll d){
adj[from].push_back({to,d});
}
vector<ll> calc(ll n=0) {
auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;};
priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c);
minlen[n] = 0; q.push(make_pair(n,0));
while(q.size()) {
p_ll now = q.top(); q.pop();
ll np = now.first, nd = now.second;
if (nd>minlen[np]) continue;
for (auto x: adj[np]) {
if (minlen[x.to]<=minlen[np]+x.d) continue;
q.push(make_pair(x.to, minlen[np]+x.d));
minlen[x.to] = minlen[np]+x.d;
}
}
return minlen;
}
};
// ----------------------------------------------------------------------
// ----------------------------------------------------------------------
ll R, C;
ll gid(ll i, ll j, bool ura) { return i*C + j + ura*(R*C); }
int main() {
cin >> R >> C;
ll A[R][C-1]; rep(i,R) rep(j,C-1) cin >> A[i][j];
ll B[R-1][C]; rep(i,R-1) rep(j,C) cin >> B[i][j];
dijkstra ds(R*C*2);
rep(i,R) rep(j,C-1) {
ds.add_edge(gid(i,j,false), gid(i,j+1,false), A[i][j]);
ds.add_edge(gid(i,j+1,false), gid(i,j,false), A[i][j]);
}
rep(i,R-1) rep(j,C) {
ds.add_edge(gid(i,j,false), gid(i+1,j,false), B[i][j]);
ds.add_edge(gid(i+1,j,true), gid(i,j,true), 1);
}
rep(i,R) rep(j,C) {
ds.add_edge(gid(i,j,false), gid(i,j,true), 1);
ds.add_edge(gid(i,j,true), gid(i,j,false), 0);
}
vector<ll> d = ds.calc();
ll result = ds[gid(R-1,C-1,false)];
cout << result << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
int main() {
ll n; int k;
std::cin >> n >> k;
for (int i=0; i<k; i++) {
std::string ns = std::to_string(n);
std::sort(ns.begin(), ns.end());
ll g2 = std::stoll(ns);
std::reverse(ns.begin(), ns.end());
ll g1 = std::stoll(ns);
n = g1 - g2;
}
std::cout << n << '\n';
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert
#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}
using namespace std;
template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}
//-------------------------------------------------
int N,M;
int stat(int i, int j){return i*N+j;}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cin>>N>>M;
vector<vector<pi>> G(N);
rep(i,M){
int a,b; char c; cin>>a>>b>>c; a--; b--;
G[a].emplace_back(b,c-'a');
G[b].emplace_back(a,c-'a');
}
vector<vi> F(N*N);
rep(i,N)rep(j,N){
int st = stat(i,j);
vector<vi> v1(26),v2(26);
for(auto u:G[i]){
v1[u.se].pb(u.fi);
}
for(auto u:G[j]){
v2[u.se].pb(u.fi);
}
rep(ch,26){
auto &vv1 = v1[ch];
auto &vv2 = v2[ch];
int V1 = vv1.size();
int V2 = vv2.size();
rep(k,V1)rep(l,V2){
int to = stat(vv1[k],vv2[l]);
F[st].pb(to);
F[to].pb(st);
}
}
}
vector<int> dist(N*N,-1); dist[stat(0,N-1)]=0;
queue<int> que; que.push(stat(0,N-1));
while(!que.empty()){
int v = que.front(); que.pop();
for(auto u:F[v]){
if (dist[u]!=-1) continue;
dist[u]=dist[v]+1;
que.push(u);
}
}
int ans = INT_MAX;
rep(i,N){
if (dist[stat(i,i)]!=-1)
chmin(ans,dist[stat(i,i)]*2);
for(auto e:G[i]){
if (dist[stat(i,e.fi)]==-1) continue;
chmin(ans,dist[stat(i,e.fi)]*2+1);
}
}
if (ans==INT_MAX){
cout<<"-1\n";
}else{
cout<<ans<<endl;
}
return 0;
}
| //g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAXN 1005
vector<pair<ll,char>> adj[MAXN];
map<pair<ll,ll>,ll> vis;
map<pair<ll,ll>,ll> edge;
map<pair<ll,ll>,ll> dis;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N,M; cin>>N>>M;
for(ll i=0;i<M;++i)
{
ll u,v; cin>>u>>v;
char ch; cin>>ch;
adj[u].push_back({v,ch});
adj[v].push_back({u,ch});
edge[{u,v}] = 1;
edge[{v,u}] = 1;
}
queue<pair<ll,ll>> q;
dis[{1,N}] = 0;
q.push({1,N});
vis[{1,N}] = 1;
ll ans = LLONG_MAX;
while(!q.empty())
{
ll a = q.front().first;
ll b = q.front().second;
//cout<<a<<" "<<b<<endl;
q.pop();
if(a == b)
{
ans = min(ans,2LL * dis[{a,b}]);
break;
}
if(edge[{a,b}])
{
ans = min(ans,2LL * dis[{a,b}] + 1);
continue;
}
for(auto it1: adj[a])
{
for(auto it2: adj[b])
{
ll c = it1.first;
ll d = it2.first;
if(!vis[{c,d}] && (it1.second == it2.second))
{
dis[{c,d}] = dis[{a,b}] + 1;
vis[{c,d}] = 1;
q.push({c,d});
}
}
}
}
if(ans == LLONG_MAX)
cout<<-1<<endl;
else
cout<<ans<<endl;
} |
#include"bits/stdc++.h"
using namespace std;
#define int long long
int n,m,c[21];
vector<int> g[21];
int dfs(int cur){
if(cur==n+1)return 1;
if(g[cur].empty())return dfs(cur+1)*3;
int ret=0;
for(int i=1;i<=3;i++){
int d=0;
for(int v:g[cur]){
if(c[v]==i){d=1;break;}
}
if(d)continue;
c[cur]=i;
ret+=dfs(cur+1);
c[cur]=0;
}
return ret;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
for(int i=1,u,v;i<=m;i++){
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
cout<<dfs(1)<<"\n";
}
| #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);
}
//ax + by = cが整数解をもつための必要十分条件は c が gcd(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 m) {
ll res = 1;
while (y) {
if (y % 2) { res *= x; res %= m; }
x = x * x % m; y /= 2;
}
return res;
}
ll kaijyo[600005];
void nCkinit(ll n, ll m) {
ll cnt = 1; kaijyo[0] = 1;
for (int h = 1; h <= n; h++) { cnt *= h; cnt %= m; kaijyo[h] = cnt; }
}
ll nCk(ll n, ll k, ll m) {
/*ll a = 1, b = 1;
for (int h = 1; h <= n; h++) { a *= h; a %= m; }
for (int h = 1; h <= k; h++) { b *= h; b %= m; }
for (int h = 1; h <= n - k; h++) { b *= h; b %= m; }*/
ll a = kaijyo[n], b = kaijyo[k] * kaijyo[n - k] % m;
return a * modpow(b, m - 2, m) % m;
}
//printf("%.10f\n", n);
typedef pair <ll, ll> P;
typedef pair <char, ll> pp;
ll dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
struct edge { ll to, cost; };
struct status {
ll d;
ll c;
ll s;
bool operator<(const status& rhs) const { return d < rhs.d; };
bool operator>(const status& rhs) const { return d > rhs.d; };
};
ll n, m; vector<vector<ll>> G(22);
vector<bool> visit(22);
vector<ll> dfs(ll k) {
vector<ll>r; r.push_back(k);
rep(i, G[k].size()) {
if (!visit[G[k][i]]) {
visit[G[k][i]] = true; vector<ll> kr = dfs(G[k][i]);
rep(j, kr.size()) { r.push_back(kr[j]); }
}
}
return r;
}
vector<vector<bool>> no(22, vector<bool>(3)); vector<ll>v;
ll cnt(ll k) {
if (k == v.size()) { return 1; }
ll r = 0;
rep(j, 3) {
if (!no[v[k]][j]) {
vector<ll> kno;
rep(i, G[v[k]].size()) {
if (!no[G[v[k]][i]][j]) {
kno.push_back(i);
no[G[v[k]][i]][j] = true;
}
}
r += cnt(k + 1);
rep(i, kno.size()) {
no[G[v[k]][kno[i]]][j] = false;
}
}
}
return r;
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//cout << fixed << setprecision(15);
//input
cin >> n >> m;
rep(i, m) {
ll a, b; cin >> a >> b; a--; b--;
G[a].push_back(b); G[b].push_back(a);
}
ll ans = 1;
rep(i, n) {
if (!visit[i]) {
visit[i] = true; v = dfs(i); ans *= cnt(0);
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=105;
int a[maxn][maxn];
int b[maxn][maxn];
int cn[maxn];
bool used[maxn];
int cnt;
void dfs(int x)
{
++cnt;
used[x]=true;
for(int i=0;i<maxn;++i)
{
if(b[x][i] && !used[i])
{
dfs(i);
}
}
}
double c(int n,int k)
{
double ans=1;
for(int i=(n-k+1);i<=n;++i) ans*=i;
for(int i=1;i<=k;++i) ans/=i;
return ans;
}
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin>>n;
for(int i=0;i<n;++i)
{
string s;
cin>>s;
for(int j=0;j<n;++j) {a[i][j]=(s[j]-'0');b[j][i]=a[i][j];}
}
for(int i=0;i<n;++i)
{
for(int j=0;j<maxn;++j) used[j]=false;
cnt=0;
dfs(i);
cn[i]=cnt;
}
double ans=0;
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
ans+=c(n-cn[i],j)/c(n-1,j);
}
}
cout<<setprecision(25)<<ans/(n+0.0);
return 0;
}
| #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
#include <cassert>
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define REPE(i, n) for (int (i)=0; (i) <= (n); (i)++)
#define CONTAINS_MAP(m, a) ((m).find((a)) != m.end())
#define CONTAINS_SET(m, a) ((m).find((a)) != m.end())
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; exit(0); }
void Yes() { cout << "Yes" << endl; exit(0); }
void No() { cout << "No" << endl; exit(0); }
//---------- セグ木 ----------
const int SEG_MAX = (1 << 18); //1<<18 = 2^18 = 262144
struct SegTree
{
vector<int> seg;
SegTree() : seg(SEG_MAX * 2, 0) {}
//[a,b]にxを加算 (節点kをベースに[l,r]に足す)
void add(int a, int b, int x, int k = 0, int l = 0, int r = SEG_MAX - 1)
{
if (a <= l && r <= b)
{
seg[k] += x;
}
else
{
int l0 = l;
int r0 = l + (r - l) / 2;
int l1 = r0 + 1;
int r1 = r;
if (a <= r0)
{
int kk = 2 * k + 1;
add(a, b, x, kk, l0, r0);
}
if (l1 <= b)
{
int kk = 2 * k + 2;
add(a, b, x, kk, l1, r1);
}
}
}
int get(int index)
{
int sum = 0;
int k = SEG_MAX - 1 + index; //根
while (true)
{
sum += seg[k];
if (k == 0) break;
k = (k - 1) / 2;
}
return sum;
}
};
struct St
{
int index;
int n;
bool operator < (const St& st) const
{
return (index > st.index); //(昇順)
}
};
int N;
map<int, priority_queue<St>> _m;
int B[200010];
signed main()
{
cin >> N;
REP(i, N)
{
St st;
cin >> st.n;
st.n += i;
st.index = i;
_m[st.n].push(st);
}
REP(i, N)
{
cin >> B[i];
}
SegTree offset;
int ans = 0;
for (int i = 0; i < N; i++)
{
int b = B[i] + i;
if (_m[b].size() == 0)
{
cout << -1 << endl;
return 0;
}
St st = _m[b].top();
_m[b].pop();
int a = st.index + offset.get(st.index);
int sub = a - i;
ans += sub;
offset.add(0, st.index, 1);
// //for (int i = 0; i < N; i++)
// //{
// // cout << offset.get(i) << " ";
// //}
// //cout << endl;
}
cout << ans << endl;
}
|
#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 100000
#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 main()
{
int cas; scanf("%d",&cas); while(cas--)
{
int n; scanf("%d",&n); vi a(n+1,0);
rep(i,1,n) scanf("%d",&a[i]);
if(n&1) puts("Second");
else
{
map<int,int> cnt;
rep(i,1,n) cnt[a[i]]++;
bool ok=1;
for(auto it: cnt) if(it.SE&1) ok=0;
puts(ok?"Second":"First");
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define ll long long
#define ar array
const ll mxN=2e5;
const int mod=1e9+7;
const ll INF=1e18;
#define what_is(x) cerr << #x << " is " << x << endl;
ll a,b,n,k,m,x,y,h,l,r,t;
void solve(){
cin>>n;
string s[n];
map<string,int> mp;
for(int i=0;i<n;i++){
cin>>s[i];
string s2;
mp[s[i]]=1;
}
for(int i=0;i<n;i++){
if(s[i][0]!='!'){
string check='!'+s[i];
if(mp[check]){
cout<<s[i]<<endl;
return;
}
}
}
cout<<"satisfiable"<<endl;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif
// ios::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
cout<<setprecision(12)<<fixed;
// cin>>t;
// while(t--)
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define int long long
int read(){
int w=0,f=1;
char c=' ';
while(c<'0'||c>'9')c=getchar(),f=c=='-'?-1:f;
while(c>='0'&&c<='9')w=w*10+c-48,c=getchar();
return w*f;
}
int n,a[N];
bool vis[N];
signed main(){
n=read();
a[1]=1;
for(int i=2;i<=n;i++){
vis[1]=1;
for(int j=2,k=sqrt(i);j<=k;j++)
if(i%j==0)vis[a[j]]=vis[a[i/j]]=1;
for(int j=1;!a[i];j++)
if(!vis[j])a[i]=j;
for(int j=2,k=sqrt(i);j<=k;j++)
if(i%j==0)vis[a[j]]=vis[a[i/j]]=0;
}
for(int i=1;i<=n;i++)
printf("%lld%c",a[i],i==n?'\n':' ');
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<long long,long long>;
//ll INF = 1e18;
//int INF = 1e9;
//printf("%.10f\n",ans);
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i] %= 200;
vector<vector<int>> b(200,vector<int>(0));
int cnt = min(n,8);
for(int bit = 1; bit < (1<<cnt); ++bit){
ll sum = 0;
vector<int> s;
for(int i = 0; i < cnt; ++i){
if(bit & (1<<i)){
sum += a[i];
sum %= 200;
s.push_back(i+1);
}
}
sum %= 200;
if(b[sum].size() != 0){
cout << "Yes" << endl;
int m1 = b[sum].size();
cout << m1 << " ";
rep(j,m1) cout << b[sum][j] << " ";
cout << endl;
int m2 = s.size();
cout << m2 << " ";
rep(j,m2) cout << s[j] << " ";
return 0;
}
b[sum] = s;
}
cout << "No" << endl;
return 0;
} |
// Atcoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
#include <sstream>
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad)/2/M_PI)*360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i,n) for(int i=0;i<n;i++)
#define show(s) cout<<s<<endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define LINF (1e18)
#define MOD (1e9+7)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define all(x) (x).begin(),(x).end()
//#define int long long
typedef pair < ll, ll> P;
//元がintの分けたものを返す p[0]は1桁目
vector<int> divnum(ll num) {
int dig;
vector<int>p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
//桁数を返す
int digiter(ll num) {
int dig;
vector<int>p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
//元がstringの分けたものを返す d[0]は最高位
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
reverse(s.begin(), s.end());
rep(i, n) {
d.push_back(s[i] - '0');
}
return d;
}
/*long double は%Lf*/
//queue古い順,stack新しい
//bool operator<(const Info &another) const {return x > another.x;}//struct(構造体)内の比較演算子のオバーロード
string S; ll M; int d;
int32_t main() {
cin >> S >> M;
rep(i, S.size()) {
chmax(d, S[i] - '0');
}
reverse(S.begin(), S.end());
rep(i, S.size()) {
if (pow(d + 1, i) > M) {
cout << 0 << endl;
return 0;
}
}
ll su = 0;
rep(i, S.size()) {
su += ll(S[i] - '0') * pow(d + 1, i);
}
if (su > M) {
cout << 0 << endl;
return 0;
}
//cout << d << endl;
ll ul = LINF+1LL; ll bl = d + 1;
ul++;
while (ul - bl > 1) {
ll mid = (ul + bl) >> 1LL;
ll sum = 0;
rep(i, S.size()) {
if (pow(mid, i) > M) {
ul = mid;
//cout << "work"<<mid << endl;
break;
}
}
if (ul == mid) {
continue;
}
rep(i, S.size()) {
sum += ll(S[i] - '0') * pow(mid, i);
if (sum > M) {
ul = mid;
break;
}
}
if (sum <= M) {
bl = mid;
}
else {
ul = mid;
}
}
if (S.size() == 1) {
cout << min(1LL, bl - d) << endl;
return 0;
}
cout << bl - d << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define ff first
#define ss second
#define hell 1000000007
#define test4(x,y,z,a) cout<<"x is "<<x<<" y is "<<y<<" z is "<<z<<" a is "<<a<<endl;
#define test3(x,y,z) cout<<"x is "<<x<<" y is "<<y<<" z is "<<z<<endl;
#define test2(x,y) cout<<"x is "<<x<<" y is "<<y<<endl;
#define test1(x) cout<<"x is "<<x<<endl;
#define N 100009
ll power(ll a,ll b,ll m)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
}
return ans;
}
ll dist[N];
bool vis[N];
//ll parent[N];
vector<pair<ll,pii>> v[N];
void initialise()
{
rep(i,1,N)
{
//parent[i]=-1;
v[i].clear();
dist[i]=LLONG_MAX;
vis[i]=0;
}
return ;
}
ll dijkstra(ll src,ll dest)
{
vis[src]=1;
multiset<pii>s;
s.insert({0,src});
dist[src]=0;
while(s.size())
{
auto it=s.begin();
ll d=it->ff;
ll num=it->ss;
s.erase(it);
vis[num]=1;
rep(i,0,v[num].size())
{
if(vis[v[num][i].ff])
continue;
// time for this
ll tm;
if(dist[num] % v[num][i].ss.ss == 0) {
tm = dist[num] + v[num][i].ss.ff;
}
else {
ll mc = dist[num]/ v[num][i].ss.ss;
mc ++;
mc *= v[num][i].ss.ss;
tm = mc - dist[num];
tm += v[num][i].ss.ff;
tm += dist[num];
}
//tm += dist[num];
if(tm >= dist[v[num][i].ff])
continue;
dist[v[num][i].ff]=tm;
//parent[v[num][i].ff]=num;
s.insert({tm,v[num][i].ff});
}
}
return dist[dest];
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
initialise();
ll n,m,source,dest;
cin >> n >> m >> source >> dest;
rep(i,1,m+1) {
ll l,r;cin>> l >> r;
ll a,b;cin>> a>> b; // a is the time and b is the multiples value
v[l].pb({r,{a,b}});
v[r].pb({l,{a,b}});
}
dijkstra(source,dest);
/*rep(i,1,n+1) {
test2(i,dist[i]);
}
test1(vis[dest]);*/
if( vis[dest])
cout << dist[dest] << endl;
else
cout << -1 << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a = (i * 2 + 0) % n;
int b = (i * 2 + 1) % n;
cout << a + 1 << ' ' << b + 1 << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio() ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define ll long long int
#define loop(i,k,n) for(i=k; i<n; i++)
#define rloop(i,n,k) for(i = n-1; i >= k; i--)
#define trv(x,a) for(auto& x:a)
#define all(x) x.begin(),x.end()
#define between(v,x,y) v.begin()+x,v.begin()+y
#define pb push_back
#define mp make_pair
#define sz(x) x.size()
#define clr(x) memset(x,0,sizeof(x))
#define oparr(v) for(auto x:v) cout << x << " " ; cout << '\n'
#define f first
#define s second
template<class T> void inp(T& x) {
cin >> x;
}
template<class H, class... T> void inp(H& h, T&... t) {
inp(h);
inp(t...);
}
template<class A> void inp(vector<A>& x) {
trv(a, x)
inp(a);
}
void deb_out() { cerr << endl; }
template<typename Head, typename... Tail> void deb_out(Head H, Tail... T) { cerr << ' ' << H; deb_out(T...); }
#define deb(...) cerr << "(" << #__VA_ARGS__ << "):", deb_out(__VA_ARGS__)
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<ll> vll;
const ll mod = 1e9 + 7;
const char nl = '\n';
const int N = 1e6;
const ll lim = 2e7 + 1;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define msb(n) __builtin_clz(n)
void solve(){
int i,j;
int a,b,c;
inp(a,b,c);
if(a == b) cout << c;
else if(b == c) cout << a;
else if(a == c) cout << b;
else cout << 0;
}
int main(){
fastio();
int t = 1;
//inp(t);
int x = t;
while(t--){
//cout << "Case #" << x-t << ": ";
solve();
}
return 0;
}
|
//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define REP(i,n) for(int i=0;i<n;i++)
const ll maxn=100050;
const ll mod=1e9+7;
int main(){
fast;
int n,m,i,j,k,u,v,mask;
cin >> n >> m;
vector<set<int>> g(20);
for(i=0;i<m;i++){
cin >> u >> v;
--u,--v;
g[u].insert(v);
g[v].insert(u);
}
vector<bool> can(1<<n,true);
for(mask=0;mask<(1<<n);++mask){
vector<int> str;
for(j=0;j<n;j++){
if(mask&(1<<j))
str.pb(j);
}
for(i=0;i<str.size();++i){
for(j=i+1;j<str.size();++j){
if(g[str[i]].count(str[j])==false){
can[mask]=false;
break;
}
}
}
}
vector<int> dp(1<<n,1e9);
dp[0]=0;
//dp[mask]-> minimum number of connected components formed from mask subset of nodes.
for(i=0;i<(1<<n);i++){
if(can[i])
dp[i]=1;
else{
for(j=i;j;j=(j-1)&i){
dp[i]=min(dp[i],dp[j]+dp[i^j]);
}
}
}
cout<<dp[(1<<n)-1];
}
| #include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
constexpr int inf = 1<<28;
constexpr char newl = '\n';
template<class T>std::istream&operator>>(std::istream&is,std::vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T>std::ostream&operator<<(std::ostream&os,std::vector<T>const&v){for(auto const& vi:v)os<<vi<<" ";return os;}
#if _local
struct debug_structure{template<class T>debug_structure&operator<<(const T&elm){std::cerr<<elm<<std::flush;return*this;}}dout;
#else
struct debug_structure{template<class T>debug_structure&operator<<(const T&elm){return*this;}}dout;
#endif
template<class T>inline bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
int main() {
int n, m;
cin >> n >> m;
vector<int> adj(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--, b--;
adj[a] |= 1 << b;
adj[b] |= 1 << a;
}
vector<int> dp(1 << n, inf);
rep(S, 1 << n) {
bool kn = true;
rep(i, n) if ((S >> i) & 1) kn &= ((adj[i] | 1 << i) & S) == S;
if (kn)
dp[S] = 1;
}
rep(S, 1 << n) {
for (int T = S;; T = (T - 1) & S) {
if (T == 0)
break;
chmin(dp[S], dp[S ^ T] + dp[T]);
}
}
cout << (dp.back()) << endl;
rep(i, 1 << n) dout << i << ":" << bitset<10>(i) << ":" << dp[i] << newl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
const ll N = 100000000;
string S[3];
string T;
ll mp[N];
ll g(string S){
ll ret = 0;
for(int i = 0; i<S.size(); i++){
ret*=10;
ret+=mp[S[i]];
}
return ret;
}
bool f(vector<int> v){
for(int i = 0; i<T.size(); i++){
mp[T[i]] = v[i];
}
for(int i = 0; i<3; i++){
if(mp[S[i][0]]==0) return false;
}
if(g(S[0])+g(S[1])==g(S[2])){
cout<<g(S[0])<<'\n'<<g(S[1])<<'\n'<<g(S[2])<<'\n'; return true;
}
return false;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for(int i = 0; i<3; i++){
cin>>S[i];
T+=S[i];
}
sort(T.begin(), T.end());
T.erase(unique(T.begin(), T.end()), T.end());
if(T.size()>10){
cout<<"UNSOLVABLE\n";
return 0;
}
vector<int> v;
for(int i = 0; i<10; i++) v.push_back(i);
do{
if(f(v)) return 0;
} while(next_permutation(v.begin(), v.end()));
cout<<"UNSOLVABLE\n";
return 0;
} | #include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main(){
string S1,S2,S3; cin>>S1>>S2>>S3;
set<char> se;
for(auto c:S1) se.insert(c);
for(auto c:S2) se.insert(c);
for(auto c:S3) se.insert(c);
if (se.size() > 10){
cout<<"UNSOLVABLE\n";
return 0;
}
int N = se.size();
map<char,int> mp;
int idx=0;
for(auto c:se){
mp[c] = idx++;
}
vector<int> v(10);
for(int i=0; i<10; i++) v[i]=i;
auto calc = [&](char c){
return v[mp[c]];
};
do{
if (calc(S1[0])==0||calc(S2[0])==0||calc(S3[0])==0){
continue;
}
ll A=0,B=0,C=0;
for(int i=0; i<S1.size(); i++){
A=A*10+calc(S1[i]);
}
for(int i=0; i<S2.size(); i++){
B=B*10+calc(S2[i]);
}
for(int i=0; i<S3.size(); i++){
C=C*10+calc(S3[i]);
}
if (A+B==C){
cout<<A<<endl;
cout<<B<<endl;
cout<<C<<endl;
return 0;
}
}while(next_permutation(v.begin(), v.end()));
cout<<"UNSOLVABLE\n";
return 0;
} |
#include<cstdio>
#include<iostream>
int n,bj,q;
char c[400005];
int read()
{
int s=0;
char c=getchar();
while(c<'0'||c>'9') c=getchar();
while(c>='0'&&c<='9') s=s*10+c-'0',c=getchar();
return s;
}
int main()
{
scanf("%d",&n);
getchar();
for(int i=1;i<=2*n;i++)
c[i]=getchar();
scanf("%d",&q);
for(int i=1,az,x,y;i<=q;i++)
{
az=read();x=read();y=read();
if(az==1) std::swap(c[(x+bj*n-1)%(2*n)+1],c[(y+bj*n-1)%(2*n)+1]);
else bj^=1;
}
if(bj)
{
for(int i=n+1;i<=2*n;i++) putchar(c[i]);
for(int i=1;i<=n;i++) putchar(c[i]);
}
else
{
for(int i=1;i<=n;i++) putchar(c[i]);
for(int i=n+1;i<=2*n;i++) putchar(c[i]);
}
} | #include <iostream>
#include <climits>
#include <cmath>
using namespace std;
int main(){
int n;
cin>>n;
char s[2*n];
cin>>s;
int q;
cin>>q;
int count=0;
for(int i=0;i<q;i++){
int t,a,b;
cin>>t>>a>>b;
if(t==1){
a--;
b--;
if(count%2!=0){
if(a>=n && b>=n){
swap(s[a-n],s[b-n]);
}
else if(a<n && b<n){
swap(s[a+n],s[b+n]);
}
else if(a<n && b>=n){
swap(s[a+n],s[b-n]);
}
else if(a>=n && b<n){
swap(s[a-n],s[b+n]);
}
}
else swap(s[a],s[b]);
}
else{
count++;
}
}
if(count%2==0){
}
else{
for(int i=0;i<n;i++){
swap(s[i],s[i+n]);
}
}
cout<<s;
} |
#include <bits/stdc++.h>
using namespace std;
#define dbg(v) cout << __LINE__ << ": " << #v << " = " << v << endl
const int N = 2e3 + 5;
const int M = 1e9 + 7;
char str[N];
int add (int a, int b) {
return (a + b < M) ? (a + b) : (a + b - M);
}
int main() {
int h, w;
scanf("%d %d", &h, &w);
vector <string> s(h);
for (string &v : s) {
scanf(" %s", str);
v = str;
}
vector <int> r(h), c(w), d(h + w);
int ans = 0;
for (int i = h - 1; i >= 0; i--) {
for (int j = w - 1; j >= 0; j--) {
if (i == h - 1 and j == w - 1) {
r[i] = 1;
c[j] = 1;
d[i - j + w] = 1;
continue;
}
if (s[i][j] == '#') {
r[i] = c[j] = d[i - j + w] = 0;
}
else {
ans = 0;
ans = add(ans, r[i]);
ans = add(ans, c[j]);
ans = add(ans, d[i - j + w]);
r[i] = add(r[i], ans);
c[j] = add(c[j], ans);
d[i - j + w] = add(d[i - j + w], ans);
}
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define flush cout.flush
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll, ll>;
const ll INF = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-9;
const ld PI = acos(-1);
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
cin >> n >> m;
vector<vector<char>> mx(n, vector<char>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> mx[i][j];
}
}
ll res = 1;
for (int i = 0; i < n + m - 1; ++i) {
bool red = false, blue = false;
for (int j = 0; j < m; ++j) {
if (i - j < 0)continue;
if (i - j >= n)continue;
if (mx[i - j][j] == 'R') {
red = true;
}
if (mx[i - j][j] == 'B') {
blue = true;
}
}
if (red && blue) {
cout << 0 << "\n";
return 0;
}
if (!red && !blue) {
res *= 2;
res %= mod2;
}
}
cout << res << "\n";
return 0;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std::chrono;
using namespace std;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define loop(i, start, end) for (int i = start; i <= end; i++)
#define rloop(i, start, end) for (int i = start; i >= end; i--)
#define read(a,n) loop(i,0,n-1) cin>>a[i];
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define pii pair<int,int>
#define vec(x) vector<x>
#define sz(v) (int)v.size()
#define UB upper_bound
#define LB lower_bound
#define all(v) (v).begin(),(v).end()
#define arl(v) (v).rbegin(),(v).rend()
#define fsp(a) fixed<<setprecision(a)
#define mem(a,with) memset(a, with, sizeof (a))
#define vmn(a) (*min_element(a.begin(),a.end()))
#define vmx(a) (*max_element(a.begin(),a.end()))
#define bs(a,key) binary_search(all(a),key) /// return bool.
#define rotl(a,x) rotate(a.begin(),a.begin()+x,a.end());
#define rotr(a,x) rotl(a,a.size()-x);
#define nl cout<<"\n"
#define dbg(x) cerr << #x << " :: " << x << endl;
#define dbg2(x, y) cerr << #x << " :: " << x << "\t" << #y << " :: " << y << endl;
#define MOD 1000000007
#define f first
#define s second
int add(int x, int y) {int res = x + y; return (res >= MOD ? res - MOD : res);}
int mul(int x, int y) {int res = x * y; return (res >= MOD ? res % MOD : res);}
int power(int x, int y) {int res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
void solve(){
//code goes here
int n; cin>>n;
int a[n]; read(a,n);
int b[n]; read(b,n);
int ans=0;
loop(i,0,n-1){
ans+=(a[i]*b[i]);
}
if(ans==0) cout<<"Yes";
else cout<<"No";
}
int32_t main()
{
auto start = chrono::high_resolution_clock::now();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
int t=1;
// cin>>t;
while (t--)
{
solve();
}
#ifndef ONLINE_JUDGE
auto stop = chrono::high_resolution_clock::now();
auto duration = chrono::duration_cast<microseconds>(stop - start);
cout<<"\n\nExecuted In: "<<duration.count()<<" ms";
#endif
return 0;
} | #include <iostream>
using namespace std;
int n ;
struct pr
{
int x, y ;
}
v[100005];
int main()
{
int s = 0 ;
cin >> n ;
for (int i = 1 ; i <= n ; i ++)
cin >> v[i].x ;
for (int i = 1 ; i <= n ; i ++)
cin >> v[i].y ;
for (int i = 1 ; i <= n ; i ++)
s = s + (v[i].x * v[i].y) ;
if (s != 0)
cout << "No" ;
else
cout << "Yes" ;
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;using ll=long long;
using vl=vector<ll>;using vi=vector<int>;
using vs=vector<string>;using vc=vector<char>;
using vvl=vector<vl>;using pl=pair<ll,ll>;
using vvc=vector<vc>;using vd=vector<double>;
using vpl=vector<pl>;using vb=vector<bool>;
#define rep(i,r) for(ll i=0;i<(r);i++)
#define Rep(i,l,r) for(ll i=(l);i<(r);i++)
#define print(n) cout<<(n)<<endl
#define all(n) n.begin(),n.end()
#define sortp(d) sort(all(d)) //1234
#define sortm(d) sort(d.rbegin(),d.rend()) //4321
/*-----------順列生成-----------------
do
{
}while(next_permutation(all(A)));
*/
//'A'65,'a'97
//cout<<fixed<<setprecision(9)<<;
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/gcd(a,b)*b;}
ll modpow(ll a,ll n,ll mod) {ll res=1;while(n>0)
{if(n&1)res=res*a%mod;a=a*a%mod;n >>= 1;}return res;}
ll modinv(ll a,ll mod){return modpow(a, mod - 2, mod);}
ll p=0,q=0,r=0;
ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
ll dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll inf=1000000000000; //10^12:∞
ll mod=1000000007; //10^9+7:合同式の法
struct edge{ll to,cost;};
const double pi = acos(-1);
int main()
{
ll n;cin>>n;map<ll,ll>m;
for (ll i = 2; i * i <= n; i++)
{
q=i;
rep(j,100)
{
q*=i;if(q>n)break;
m[q]++;
//print(q);
}
}
print(n-m.size());
} | #include <bits/stdc++.h>
using namespace std;
//#define MULTITEST
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
typedef long long li;
typedef long double ld;
typedef pair<int, int> pt;
template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
return out << "(" << a.x << ", " << a.y << ")";
}
template <class A> ostream& operator << (ostream& out, const vector<A> &v) {
out << "[";
forn(i, sz(v)) {
if(i) out << ", ";
out << v[i];
}
return out << "]";
}
mt19937 rnd(time(NULL));
const int INF = int(1e8);
const li INF64 = li(1e18);
const int MOD = int(1e9) + 7;
const ld EPS = 1e-9;
const ld PI = acos(-1.0);
int n, m;
bool read () {
if (scanf("%d%d", &n, &m) != 2)
return false;
return true;
}
void solve() {
if (m == 0){
forn(i, n) printf("%d %d\n", 2 * i + 1, 2 * i + 2);
return;
}
if (m < 0 || m >= n - 1){
puts("-1");
return;
}
vector<pt> ans;
ans.pb(mp(0, 2 * m + 2));
forn(i, m) ans.pb(mp(2 * i + 1, 2 * i + 2));
ans.pb(mp(2 * m + 1, 2 * m + 3));
int lst = 2 * m + 3;
while (sz(ans) < n){
ans.pb(mp(lst + 1, lst + 2));
lst += 2;
}
for (auto it : ans)
printf("%d %d\n", it.x + 1, it.y + 1);
}
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tt = clock();
#endif
cerr.precision(15);
cout.precision(15);
cerr << fixed;
cout << fixed;
#ifdef MULTITEST
int tc;
scanf("%d", &tc);
while(tc--){
read();
#else
while(read()) {
#endif
solve();
#ifdef _DEBUG
cerr << "TIME = " << clock() - tt << endl;
tt = clock();
#endif
}
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std ;
int main()
{
ll n , i , j ; cin>>n ;
ll a[n] ;
for(i=0;i<n;i++){
cin>> a[i] ;
}
ll stt=0 , st=0 , s=0 ;
for(i=0;i<n;i++){
stt+= i*a[i]*a[i] - 2*s* a[i]+st ;
s+=a[i] ;
st+= a[i]*a[i] ;
}
cout<< stt <<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+3;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
template <typename T>
inline void print(T x){
if(x<0) putchar('-'),x=-x;
if(x>9) print(x/10);
putchar(x%10^48);
}
int n;
ll tong[405];
ll ans;
int main(){
read(n);
for(register int i=1;i<=n;++i){
int tep;read(tep);
tong[tep+200+1]++;
}
for(register int i=1;i<=401;++i){
for(register int j=i+1;j<=401;++j){
ll tot=tong[i]*tong[j];
ans+=tot*(j-i)*(j-i);
}
}
print(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
void func(std::string S){
deque<char> T;
lli rev = 0;
for(auto &c:S){
if(c == 'R'){
rev++;
}
else{
if(rev % 2 == 0){
T.push_back(c);
if(T.size()>=2){
if(T[T.size()-1]==T[T.size()-2]){
T.pop_back();
T.pop_back();
}
}
}
else{
T.push_front(c);
if(T.size()>=2){
if(T[0]==T[1]){
T.pop_front();
T.pop_front();
}
}
}
}
}
string s;
REP(i,0,T.size()){
if(rev%2==0)s.push_back(T[i]);
else s.push_back(T[T.size()-1-i]);
}
cout<<s<<endl;
}
int main(){
// cout << fixed << setprecision(5);
std::string S;
std::cin >> S;
func(S);
return 0;
}
| #include<bits/stdc++.h>
//#include <atcoder/all>
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())
using namespace std;
//using namespace atcoder;
using ld = long double;
using ll = long long;
using P = pair<ll, ll>;
template<typename T> bool chmin(T& a, const T& b) { if(a > b){ a = b; return 1;} return 0; }
template<typename T> bool chmax(T& a, const T& b) { if(a < b){ a = b; return 1;} return 0; }
const ll ZER = 0;
const ll MOD = 998244353;
const ll INF = 1e9;
int main(){
int n;
cin >> n;
double res = 0;
REP(i, 1, n - 1){
res += (double)1.0 / (double)i;
}
cout << fixed << setprecision(10) << (double) n * res<< endl;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200010, mod = 1000000007;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
struct Seg{
int tot,s[maxn*100],v[maxn*100],rt,ls[maxn*100],rs[maxn*100];
void psp(int k) {s[k]=s[ls[k]]+s[rs[k]],v[k]=v[ls[k]]+v[rs[k]];}
void ins(int&k,int l,int r,int p,int VL,int VL2)
{
if(!k) k=++tot;
if(l==r) return s[k]+=VL,v[k]+=VL2,void();int mid=l+r>>1;
p>mid?ins(rs[k],mid+1,r,p,VL,VL2):ins(ls[k],l,mid,p,VL,VL2),psp(k);
}
int asks(int k,int l,int r,int L,int R)
{
if(l>R||L>r||!k) return 0;
if(L<=l&&r<=R) return s[k];int mid=l+r>>1;
return asks(ls[k],l,mid,L,R)+asks(rs[k],mid+1,r,L,R);
}
int askv(int k,int l,int r,int L,int R)
{
if(l>R||L>r||!k) return 0;
if(L<=l&&r<=R) return v[k];int mid=l+r>>1;
return askv(ls[k],l,mid,L,R)+askv(rs[k],mid+1,r,L,R);
}
}s1,s2;
int ans,n,m,Q,a[maxn],b[maxn];
signed main()
{
n=read(),m=read(),Q=read();
s1.ins(s1.rt,0,1e8,0,0,n);
s2.ins(s2.rt,0,1e8,0,0,m);
for(int i=1,x,y;i<=Q;cout<<ans<<'\n',i++)
if(read()==1)
{
x=read();
ans-=s2.asks(s2.rt,0,1e8,a[x]+1,1e8)+a[x]*s2.askv(s2.rt,0,1e8,0,a[x]);
s1.ins(s1.rt,0,1e8,a[x],-a[x],-1);
a[x]=read();
s1.ins(s1.rt,0,1e8,a[x],a[x],1);
ans+=s2.asks(s2.rt,0,1e8,a[x]+1,1e8)+a[x]*s2.askv(s2.rt,0,1e8,0,a[x]);
}
else
{
x=read();
ans-=s1.asks(s1.rt,0,1e8,b[x]+1,1e8)+b[x]*s1.askv(s1.rt,0,1e8,0,b[x]);
s2.ins(s2.rt,0,1e8,b[x],-b[x],-1);
b[x]=read();
s2.ins(s2.rt,0,1e8,b[x],b[x],1);
ans+=s1.asks(s1.rt,0,1e8,b[x]+1,1e8)+b[x]*s1.askv(s1.rt,0,1e8,0,b[x]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define inf 1e17
vector<vector<int>> grid;
int n, m;
int dp[2005][2005];
int helper(int r, int c){
if(r == n-1 && c == m-1)
return 0;
if(dp[r][c] != -1)
return dp[r][c];
int op1 = -inf, op2 = -inf;
if(r+1 < n)
op1 = grid[r+1][c] - helper(r+1, c);
if(c+1 < m)
op2 = grid[r][c+1] - helper(r, c+1);
return dp[r][c] = max(op1, op2);
}
void solve(int T) {
cin >> n >> m;
grid.assign(n, vector<int>(m, 0));
for(int i = 0 ; i < n ; i++){
string s;
cin >> s;
for(int j = 0 ; j < m ; j++){
grid[i][j] = (s[j]=='+'?1:-1);
}
}
memset(dp, -1, sizeof dp);
int ans = helper(0, 0);
if(ans > 0){
cout << "Takahashi" <<endl;
}else if(ans < 0){
cout <<"Aoki"<<endl;
}else{
cout <<"Draw"<<endl;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inputf.txt", "r", stdin);
freopen("outputf.txt", "w", stdout);
#endif
int T = 1;
//cin >> T;
for (int t = 1; t <= T; t++) {
solve(t);
}
cerr << "time taken : " << (float) clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
|
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%d",&x,&y)
#define P(x) printf("%d\n",x)
#define all(v) v.begin(),v.end()
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
typedef long long int LL;
typedef pair<int, int > pii;
typedef vector<int > vi;
const int mod = 1000000007;
LL _pow(LL a, LL b) {
if(!b) return 1;
if(b == 1) return a;
if(b == 2) return a * a % mod;
if(b & 1) {
return a * _pow(a,b-1) % mod;
}
return _pow(_pow(a,b/2),2);
}
int main() {
int n,m;
S2(n,m);
int num = n + m;
int den = n;
rep(i,0,n) {
int x;
S(x);
den += x;
}
if(den > num) {
P(0);
return 0;
}
LL ans = 1;
rep(i,1,den+1) {
ans = ans * (num + 1 - i) % mod;
ans = ans * _pow(i, mod - 2) % mod;
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr double EPS = 1e-10;
constexpr double PI = M_PI;
constexpr int MOD = 1e9 + 7;
long long inv(long long n, long long mod) {
long long res = 1;
while (n > 1) {
(res *= (mod - mod / n)) %= mod;
n = mod % n;
}
return res;
}
long long comb_mod(long long n, long long r, long long mod) {
r = (r <= n/2) ? r : n-r;
if (r < 0) return 0;
if (r == 0) return 1;
long long nume = 1, deno = 1;
for (long long i=1; i<=r; i++) {
deno *= i % mod;
deno %= mod;
}
for (long long i=n-r+1; i<=n; i++) {
nume *= i % mod;
nume %= mod;
}
deno = inv(deno, mod);
return (deno * nume) % mod;
}
void solve() {
int N, M;
cin >> N >> M;
vector<int> A(N);
for (int i=0; i<N; ++i) cin >> A[i];
int sumA = 0;
for (int x : A) sumA += x;
cout << comb_mod(M + N, sumA + N, MOD) << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define INF 1000000000000000000
#define pb push_back
#define vl vector<ll>
#define vi vector<int>
#define sz(a) (ll)a.size()
#define all(v) v.begin(), v.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
ll power(ll b, ll e, ll m) {
if (e == 0) return 1;
if (e & 1) return b * power(b * b % m, e / 2, m) % m;
return power(b * b % m, e / 2, m);
}
ll power( ll b, ll e)
{
if (e == 0) return 1;
if (e & 1) return b * power(b * b, e / 2);
return power(b * b, e / 2);
}
ll modI(ll a, ll m)
{
ll m0 = m, y = 0, x = 1;
if (m == 1)return 0;
while (a > 1) {
ll q = a / m;
ll t = m; m = a % m;
a = t; t = y;
y = x - q * y; x = t;
}
if (x < 0) {x += m0;}
return x;
}
const int N = 2e5 + 5;
ll a, b;
ll ncr[61][31];
ll nCr(ll n, ll r) {
if (r > n or r < 0) {return 0;}
if (n == r || r == 0) {return 1;}
if (r == 1 || r == n - 1) {return n;}
if (ncr[n][r] != -1) {return ncr[n][r];}
ncr[n][r] = nCr(n - 1, r) + nCr(n - 1, r - 1);
return ncr[n][r];
}
// if our approach is correct p = ans and k =1
ll f(ll k) {
// find the number of numbers less than k with a 0s and b 1s
string curr = "";
int num_zeroes = 0;
for (int i = 0; i < a + b; i++) {
if (k & (1LL << i)) {
curr += '1';
}
else {
curr += '0';
num_zeroes++;
}
}
reverse(all(curr));
ll zeroes_used = 0;
ll ans = 0;
if (num_zeroes == a) {
ans++;
}
// ll num_ones = 0;
for (ll i = 0; i < a + b; i++) {
if (zeroes_used > a) {break;}
if (curr[i] == '1') {
// use zero here
if (a < zeroes_used + 1) {break;}
ans += nCr(a + b - i - 1, a - zeroes_used - 1);
}
else {zeroes_used++;}
}
return ans;
}
void print(ll x) {
for (int i = 59; i >= 0; i--) {
if (x & (1LL << i)) {
cout << 1;
}
else {cout << 0;}
}
cout << "\n";
return;
}
void solve() {
memset(ncr, -1, sizeof(ncr));
ll k;
cin >> a >> b >> k;
ll l = 0, r = (1LL << 60);
// print(r - 1);
// for (int i = 0; i < b; i++) {
// r |= (1LL << (a + i));
// }
// r++;
ll ans = -1;
while (l <= r) {
ll mid = (l + r) >> 1;
ll g = f(mid);
// cout << mid << " " << g << "\n";
if (g >= k) {
ans = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
// cout << ans << "\n";
string out = "";
for (int i = 0; i < a + b; i++) {
if (ans & (1LL << i)) {
out += 'b';
}
else {
out += 'a';
}
}
reverse(all(out));
cout << out;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("test_input.txt", "r", stdin);
// freopen("test_output.txt", "w", stdout);
int t = 1;
// cin >> t ;
// cout << t % 3 << "\n";
// return 0;
for (int ntc = 1; ntc <= t; ntc++) {
// cout << "Case #" << ntc << ": ";
solve();
}
} | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline ll read()
{
ll f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
ll C[100][100];
int main()
{
int a=read(),b=read();
int n=a+b;
ll k=read();
for(int i=0;i<=n;i++) C[i][i]=C[i][0]=1;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
C[j][i]=C[j-1][i-1]+C[j-1][i];
for(int i=1;i<=n;i++)
{
// cout<<a<<" "<<b<<" "<<k<<endl;
if(a==0)
{
for(int j=1;j<=b;j++) putchar('b');
break;
}
if(b==0)
{
for(int j=1;j<=a;j++) putchar('a');
break;
}
ll res=C[a+b-1][a-1];
// cout<<res<<endl;
if(k>res)
{
putchar('b');
k-=res;
b--;
}
else
{
putchar('a');
a--;
}
}
return 0;
} |
#include <bits/stdc++.h>
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rrepi(i,a,b) for(int i=((int)(b)-1);i>=(a);--i)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) rrepi(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(x) memset(x,0,sizeof(x))
#define MINUS(x) memset(x,-1,sizeof(x))
#define UNIQUE(x) (x).erase(unique(ALL(x)), (x).end())
#define TOUPPER(x) transform(ALL(x), (x).begin(), ::toupper)
#define TOLOWER(x) transform(ALL(x), (x).begin(), ::tolower)
#define debug(var) do{std::cout << #var << " : "; view(var);}while(0)
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){for(const auto& v : vv){ view(v); } }
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void viewarr(T arr[], int n) { for(int i = 0; i < n; ++i) std::cout << arr[i] << " "; std::cout << std::endl; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll qp(ll a,ll b){ll ans=1;do{if(b&1)ans=1ll*ans*a;a=1ll*a*a;}while(b>>=1);return ans;}
ll qp(ll a,ll b,ll mo){ll ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const int INF = 1e9;
const ll INFL = 1e18;
const int MOD = 1e9 + 7;
const int MAX_N = 1e5;
struct Dijkstra {
struct edge{
int to, cost;
edge(int to, int cost) : to(to), cost(cost) {}
};
int V;
vector<vector<edge>> G;
vector<ll> d;
vector<int> prev;
Dijkstra(int n) : V(n), G(n), d(n, INFL), prev(n, -1) {}
void set(int from, int to, int cost) {
G[from].push_back(edge(to, cost));
}
void calc(int s) {
priority_queue<P, vector<P>, greater<P>> que;
d[s] = 0;
que.emplace(0, s);
while(!que.empty()) {
P p = que.top(); que.pop();
int v = p.se;
if(d[v] < p.fi) continue;
for(edge e : G[v]) {
if(d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.emplace(d[e.to], e.to);
prev[e.to] = v;
}
}
}
}
ll dist(int to) {
return d[to];
}
vector<int> get_path(int t) {
vector<int> path;
for(; t != -1; t = prev[t]) path.push_back(t);
reverse(ALL(path));
return path;
}
};
int main() {
int N, M; cin >> N >> M;
vector<int> A(M), B(M);
rep(i,M) cin >> A[i] >> B[i];
int K; cin >> K;
vector<int> C(K);
rep(i,K) cin >> C[i];
vector<vector<ll>> G(K, vector<ll>(K, INFL));
rep(i,K) {
Dijkstra d(N);
rep(j,M) {
d.set(A[j]-1, B[j]-1, 1);
d.set(B[j]-1, A[j]-1, 1);
}
d.calc(C[i]-1);
rep(j,K) G[i][j] = d.dist(C[j]-1);
}
vector<vector<ll>> dp(1 << K, vector<ll>(K, INFL));
rep(i,K) dp[1<<i][i] = 0;
for(int s = 0; s < 1 << K; s++) {
for(int v = 0; v < K; v++) {
for(int u = 0; u < K; u++) {
if(s >> v & 1)chmin(dp[s][v], dp[s & ~(1<<v)][u] + G[u][v]);
}
}
}
ll ans = INFL;
rep(i,K) chmin(ans, dp[(1 << K) -1][i] + 1);
cout << (ans == INFL ? -1 : ans) << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int N = 100005;
const int K = 20;
int n, m, k, a[K], dis[K][N], dp[K][1 << K];
vector<int> adj[N];
void bfs(int idx)
{
queue<int> q;
q.push(a[idx]);
for (int i = 1; i <= n; ++i)
dis[idx][i] = -1;
dis[idx][a[idx]] = 0;
while (!q.empty())
{
int u = q.front();
q.pop();
for (int v: adj[u])
{
if (dis[idx][v] == -1)
{
dis[idx][v] = dis[idx][u] + 1;
q.push(v);
}
}
}
}
int solve(int last, int mask)
{
if (mask == (1 << k) - 1)
return dp[last][mask] = 0;
if (dp[last][mask] != -1)
return dp[last][mask];
int cur = INT_MAX;
for (int i = 0; i < k; ++i)
{
if (mask & (1 << i))
continue;
cur = min(cur, dis[last][a[i]] + solve(i, mask | (1 << i)));
}
return dp[last][mask] = cur;
}
int main(int argc, char const *argv[])
{
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
cin >> k;
for (int i = 0; i < k; ++i)
{
cin >> a[i];
bfs(i);
}
for (int i = 0; i < k; ++i)
{
if (dis[0][a[i]] == -1)
return cout << -1, 0;
}
int ans = INT_MAX;
for (int i = 0; i < k; ++i)
{
memset(dp, -1, sizeof(dp));
int cur = solve(i, (1 << i));
ans = min(ans, 1 + cur);
// cout << cur << '\n';
}
cout << ans << '\n';
return 0;
} |
// #Sazaの1日1AC
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
const long long INF=9e18;
const double PI=3.14159265358979323846;
//マクロ
//型エイリアス
using ll = long long;
using P=pair<long long, long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
//ショートカット
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep2(i,k,n) for(long long i = k; i < n; i++) //半開区間
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define mkp make_pair
//入力
#define vin(v,N) for(long long i=0;i<N;i++) cin>>v.at(i)
#define lin(n) long long n;cin>>n
#define chin(x) char x;cin>>x;
#define sin(s) string s;cin>>s;
#define vlin(v,N) vector<long long>v(N);for(long long i=0;i<N;i++)cin>>v.at(i)
#define max(a,b) max((ll)a,(ll)b)
#define min(a,b) min((ll)a,(ll)b)
//関数
//最大公約数
long long gcd(long long m, long long n){
long long a=max(m,n);
long long b=min(m,n);
long long r=a%b;
while(r!=0){
a=b; b=r; r=a%b;
}
return b;
}
// 最小公倍数
long long lcd(long long m, long long n){
return m*n/gcd(m,n);
}
//xのn乗
long long power(long long x, long long N){
long long ret=1;
for(long long i=0;i<N;i++)
ret*=x;
return ret;
}
//繰り返し二乗法
long long repeat_squaring(long long x, long long n){
if(n==0) return 1;
else if(n%2==0){
long long t=repeat_squaring(x,n/2);
return t*t%mod;
}
else
return x*repeat_squaring(x,n-1)%mod;
}
//素因数分解(mapで返す)
map<int,int> factor(long long p){
ll p1=p;
map<int, int>ret;
for(int i=2;i*i<=p1;i++){
while(p%i==0){
ret[i]++;
p/=i;
}
}
if(p!=1)
ret[p]++;
return ret;
}
//素数判定
bool is_prime(long long N){
for(long long i=2;i*i<=N;i++){
if(N%i==0)
return false;
}
return true;
}
//最大値更新
void chmax(long long &a,long long b){
a=max(a,b);
}
//最小値更新
void chmin(long long &a,long long b){
a=min(a,b);
}
//構造体
//Union-Find木
struct UnionFind{
//メンバ変数
vector<long long>par; //par[i]:=頂点iの親
vector<long long>s; //s[i]:=頂点iが属する集合の個数(iが根のとき)
//コンストラクタ
UnionFind(long long N):par(N),s(N){
for(long long i=0;i<N;i++){
par[i]=i; //最初はすべてが根として初期化
s[i]=1;
}
}
//メンバ関数
//root(i):=頂点iの根
long long root(long long i){
if(par[i]==i) return i;
par[i]=root(par[i]); //経路圧縮
return root(par[i]); //再帰
}
//size[i]:=iが属する集合の個数
long long size(long long i){
return s[root(i)];
}
//same(x,y) xとyが同じ根を持つか(同じ集合に含まれるか)
bool same(long long x, long long y){
return root(x)==root(y);
}
//unite(x,y) xの根をyの根に繋げる(集合を合併)
void unite(long long x, long long y){
if(!same(x,y)){
long long rx=root(x);
long long ry=root(y);
par[rx]=par[ry];
s[ry]=s[rx]+s[ry];
}
}
};
/////////////////⊂('ω'⊂ )))Σ≡GO!/////////////////
ll s(int a, int b){
ll n = b - a + 1;
ll ret = (n * (n+1)) / 2 + n * (a - 1);
return ret;
}
//メイン関数
int main(){
cout<<fixed<<setprecision(14);
int N; cin >> N;
vector<pair<int, int>> p(N);
rep(i, N) cin >> p[i].first >> p[i].second;
bool OK = false;
rep(i, N){
for(int j = i + 1; j < N; j++){
for(int k = j + 1; k < N; k++){
int x1 = p[j].first - p[i].first;
int y1 = p[j].second - p[i].second;
int x2 = p[k].first - p[j].first;
int y2 = p[k].second - p[j].second;
if(x1 * y2 == x2 * y1) OK = true;
}
}
}
if(OK) cout << "Yes" << endl;
else cout << "No" << endl;
} | #pragma GCC optimize("Ofast")
/*#pragma GCC target("avx,avx2,fma")
#pragma GCC target ("sse4")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mod 1000000007
#define lcm(a,b) (a*b)/__gcd(a,b)
#define N 200005
#define f first
#define s second
#define pi 2*acos(0.0)
bool isPowerOfTwo (ll x) { return x && (!(x&(x-1))); }
ll Modular_Exponentiation(ll x, ll n, ll M)
{
if(n==0) return 1;
if(n%2) return (x*Modular_Exponentiation((x*x)%M,n/2,M))%M;
else return (Modular_Exponentiation((x*x)%M,n/2,M))%M;
}
bool isprime(ll n)
{
if (n<=1) return false;
if (n<=3) return true;
if (n%2==0||n%3==0) return false;
for(ll i=5; i*i<=n; i+=6)
if (n%i==0||n%(i+2)==0) return false;
return true;
}
/********************************************************************************************/
void solve()
{
ll n; cin>>n;
vector<pair<ll,ll>> vp;
ll c1=0, c2=0, c3=0;
rep(i,0,n)
{
ll x,y; cin>>x>>y;
vp.pb({x,y});
if(!x) c1++;
if(!y) c2++;
if(x==y) c3++;
}
if(c1>=3 or c2>=3 or c3>=3) { cout<<"Yes"; return; }
rep(i,0,n)
{
rep(j,i+1,n)
{
rep(k,j+1,n)
{
ll x1=vp[i].f, y1=vp[i].s;
ll x2=vp[j].f, y2=vp[j].s;
ll x3=vp[k].f, y3=vp[k].s;
ll a=(y2-y1)*(x1-x3);
ll b=(y1-y3)*(x2-x1);
if(a==b)
{
cout<<"Yes";
return;
}
}
}
}cout<<"No";
}
int32_t main()
{
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt","r",stdin);
//for getting error from error.txt
freopen("error.txt", "w", stderr);
// for writing output to output.txt
freopen("output.txt","w",stdout);
#endif
BOOST
int T=1; //cin>>T;
rep(i,0,T)
{
solve();
}
cerr<<"Time taken : "<<fixed<<setprecision(5)<<((float)clock()/CLOCKS_PER_SEC)*1000<<" ms"<<"\n";
cerr<<"My CLOCKS_PER_SEC= "<<CLOCKS_PER_SEC<<"\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.